The Experts below are selected from a list of 360 Experts worldwide ranked by ideXlab platform
Shietung Peng - One of the best experts on this subject based on the ideXlab platform.
-
Node to set disjoint path routing in perfect hierarchical hypercubes
International Conference on Conceptual Structures, 2011Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:Abstract The perfect hierarchical hypercube structure was proposed in the literature as a topology for interconnection networks of massively parallel systems. It has the useful ability that it can connect many Nodes while retaining a low degree as well as a small diameter. In this paper, we introduce an algorithm solving the Node-to-set disjoint-path routing problem in a perfect hierarchical hypercube. Inside a (2 m + m)-perfect hierarchical hypercube, given one Source Node and a set of k (≤ m + 1) destination Nodes, this algorithm finds k disjoint paths between the Source Node and all destination Nodes of lengths at most m2 m + 2 m + 2 m + 4 in O(km2 m ) time complexity.
-
fault tolerant Node to set disjoint path routing in hypercubes
International Conference on Algorithms and Architectures for Parallel Processing, 2010Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems In a hypercube of dimension n, Node addresses are made of n bits, and two Nodes are adjacent if and only if their Hamming distance is equal to 1 In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty Nodes f disjoint paths connecting one Source Node to k=n−f destination Nodes in O(n2) time complexity.
-
a Node to set disjoint path routing algorithm in metacube
International Symposium on Pervasive Systems Algorithms and Networks, 2009Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:The metacube (MC) was introduced as a topology for interconnection networks of large parallel computers, and it has a merit that with a diameter similar to that of the hypercube, its degree is much lower: the 2^{m2^k+k} Nodes of a metacube MC(k, m) have a degree of m+k. We introduce in this paper an efficient routing algorithm for finding in a metacube MC(k, m) disjoint paths between one Source Node and a maximum of m+k target Nodes. We show that for any Source Node s, and any target Nodes T = {t_1,..., t_n}, n
-
Node to set disjoint path routing in metacube
Parallel and Distributed Computing: Applications and Technologies, 2009Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:The metacube interconnection network introduced a few years ago has some very interesting properties: it has a short diameter similar to the hypercube, and its degree is much lower than that of a hypercube of the same size. In this paper, we describe an efficient algorithm for finding disjoint paths between one Source Node and at most m+k target Nodes in a metacube MC(k, m) excluding MC(*,1), MC(2,2), MC(3,2) and MC(3,3). We show that we can find m+k disjoint paths between the Source Node and the m+k targets of length at most metacube diameter plus (k+4) with time complexity of order of metacube degree times its diameter.
Antoine Bossard - One of the best experts on this subject based on the ideXlab platform.
-
time optimal Node to set disjoint paths routing in hypercubes
Journal of Information Science and Engineering, 2014Co-Authors: Antoine Bossard, Keiichi KanekoAbstract:Due to their simplicity, hypercubes are a popular topology for the interconnection network of massively parallel systems. One critical issue when dealing with such parallel systems is routing: data transmission is at the center of any operation or computation. Additionally, as the number of processors inside modern supercomputers is huge, and continuously growing, fault tolerance ought to be addressed. Hence, for a routing algorithm to generating Node-disjoint paths is of high interest as it maximises the probability of establishing a fault-free path in a faulty environment. Also importantly, generating disjoint paths allows for time-efficient data transmission; transfers are able to be realised in parallel as two paths are ensured to share no common reSource. In an n-dimensional hypercube, given a Source Node and k (k ≤ n) destination Nodes, Rabin described an algorithm finding k Node-disjoint paths between the Source Node and the destination Nodes of optimal lengths (at most n + 1) in O(k^3 + kn) time. We describe in this paper a smart improvement to this algorithm to reduce its time complexity from O(k^3 + kn) to O(kn) which is time optimal.
-
Node to set disjoint path routing in perfect hierarchical hypercubes
International Conference on Conceptual Structures, 2011Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:Abstract The perfect hierarchical hypercube structure was proposed in the literature as a topology for interconnection networks of massively parallel systems. It has the useful ability that it can connect many Nodes while retaining a low degree as well as a small diameter. In this paper, we introduce an algorithm solving the Node-to-set disjoint-path routing problem in a perfect hierarchical hypercube. Inside a (2 m + m)-perfect hierarchical hypercube, given one Source Node and a set of k (≤ m + 1) destination Nodes, this algorithm finds k disjoint paths between the Source Node and all destination Nodes of lengths at most m2 m + 2 m + 2 m + 4 in O(km2 m ) time complexity.
-
fault tolerant Node to set disjoint path routing in hypercubes
International Conference on Algorithms and Architectures for Parallel Processing, 2010Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems In a hypercube of dimension n, Node addresses are made of n bits, and two Nodes are adjacent if and only if their Hamming distance is equal to 1 In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty Nodes f disjoint paths connecting one Source Node to k=n−f destination Nodes in O(n2) time complexity.
-
a Node to set disjoint path routing algorithm in metacube
International Symposium on Pervasive Systems Algorithms and Networks, 2009Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:The metacube (MC) was introduced as a topology for interconnection networks of large parallel computers, and it has a merit that with a diameter similar to that of the hypercube, its degree is much lower: the 2^{m2^k+k} Nodes of a metacube MC(k, m) have a degree of m+k. We introduce in this paper an efficient routing algorithm for finding in a metacube MC(k, m) disjoint paths between one Source Node and a maximum of m+k target Nodes. We show that for any Source Node s, and any target Nodes T = {t_1,..., t_n}, n
-
Node to set disjoint path routing in metacube
Parallel and Distributed Computing: Applications and Technologies, 2009Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:The metacube interconnection network introduced a few years ago has some very interesting properties: it has a short diameter similar to the hypercube, and its degree is much lower than that of a hypercube of the same size. In this paper, we describe an efficient algorithm for finding disjoint paths between one Source Node and at most m+k target Nodes in a metacube MC(k, m) excluding MC(*,1), MC(2,2), MC(3,2) and MC(3,3). We show that we can find m+k disjoint paths between the Source Node and the m+k targets of length at most metacube diameter plus (k+4) with time complexity of order of metacube degree times its diameter.
Keiichi Kaneko - One of the best experts on this subject based on the ideXlab platform.
-
time optimal Node to set disjoint paths routing in hypercubes
Journal of Information Science and Engineering, 2014Co-Authors: Antoine Bossard, Keiichi KanekoAbstract:Due to their simplicity, hypercubes are a popular topology for the interconnection network of massively parallel systems. One critical issue when dealing with such parallel systems is routing: data transmission is at the center of any operation or computation. Additionally, as the number of processors inside modern supercomputers is huge, and continuously growing, fault tolerance ought to be addressed. Hence, for a routing algorithm to generating Node-disjoint paths is of high interest as it maximises the probability of establishing a fault-free path in a faulty environment. Also importantly, generating disjoint paths allows for time-efficient data transmission; transfers are able to be realised in parallel as two paths are ensured to share no common reSource. In an n-dimensional hypercube, given a Source Node and k (k ≤ n) destination Nodes, Rabin described an algorithm finding k Node-disjoint paths between the Source Node and the destination Nodes of optimal lengths (at most n + 1) in O(k^3 + kn) time. We describe in this paper a smart improvement to this algorithm to reduce its time complexity from O(k^3 + kn) to O(kn) which is time optimal.
-
Node to set disjoint path routing in perfect hierarchical hypercubes
International Conference on Conceptual Structures, 2011Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:Abstract The perfect hierarchical hypercube structure was proposed in the literature as a topology for interconnection networks of massively parallel systems. It has the useful ability that it can connect many Nodes while retaining a low degree as well as a small diameter. In this paper, we introduce an algorithm solving the Node-to-set disjoint-path routing problem in a perfect hierarchical hypercube. Inside a (2 m + m)-perfect hierarchical hypercube, given one Source Node and a set of k (≤ m + 1) destination Nodes, this algorithm finds k disjoint paths between the Source Node and all destination Nodes of lengths at most m2 m + 2 m + 2 m + 4 in O(km2 m ) time complexity.
-
fault tolerant Node to set disjoint path routing in hypercubes
International Conference on Algorithms and Architectures for Parallel Processing, 2010Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:Hypercube-based interconnection networks are one of the most popular network topologies when dealing with parallel systems In a hypercube of dimension n, Node addresses are made of n bits, and two Nodes are adjacent if and only if their Hamming distance is equal to 1 In this paper we introduce a fault-tolerant hypercube routing algorithm which constructs n minus the number of faulty Nodes f disjoint paths connecting one Source Node to k=n−f destination Nodes in O(n2) time complexity.
-
a Node to set disjoint path routing algorithm in metacube
International Symposium on Pervasive Systems Algorithms and Networks, 2009Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:The metacube (MC) was introduced as a topology for interconnection networks of large parallel computers, and it has a merit that with a diameter similar to that of the hypercube, its degree is much lower: the 2^{m2^k+k} Nodes of a metacube MC(k, m) have a degree of m+k. We introduce in this paper an efficient routing algorithm for finding in a metacube MC(k, m) disjoint paths between one Source Node and a maximum of m+k target Nodes. We show that for any Source Node s, and any target Nodes T = {t_1,..., t_n}, n
-
Node to set disjoint path routing in metacube
Parallel and Distributed Computing: Applications and Technologies, 2009Co-Authors: Antoine Bossard, Keiichi Kaneko, Shietung PengAbstract:The metacube interconnection network introduced a few years ago has some very interesting properties: it has a short diameter similar to the hypercube, and its degree is much lower than that of a hypercube of the same size. In this paper, we describe an efficient algorithm for finding disjoint paths between one Source Node and at most m+k target Nodes in a metacube MC(k, m) excluding MC(*,1), MC(2,2), MC(3,2) and MC(3,3). We show that we can find m+k disjoint paths between the Source Node and the m+k targets of length at most metacube diameter plus (k+4) with time complexity of order of metacube degree times its diameter.
Johnny Wong - One of the best experts on this subject based on the ideXlab platform.
-
an end to end detection of wormhole attack in wireless ad hoc networks
Computer Software and Applications Conference, 2007Co-Authors: Xia Wang, Johnny WongAbstract:Wormhole attack is a severe attack in wireless ad hoc networks. Most of the previous work eliminate the effect of wormhole attack by examining the distance or communication time over each link during the route establishment, which requires special hardware or causes overhead on all links even though only one link on each route could be affected by a wormhole attack. In this article, we propose an end-to-end detection of wormhole attack (EDWA) in wireless ad-hoc networks. We first present the wormhole detection which is based on the smallest hop count estimation between Source and destination. If the hop count of a received shortest route is much smaller than the estimated value an alert of wormhole attack is raised at the Source Node. Then the Source Node will start a wormhole TRACING procedure to identify the two end points of the wormhole. Finally, a legitimate route is selected for data communication. Both our analysis and simulation results show that the end-to-end wormhole detection method is effective when the Source and destination are not too far away.
Xianggen Xia - One of the best experts on this subject based on the ideXlab platform.
-
a simple orthogonal space time coding scheme for asynchronous cooperative systems for frequency selective fading channels
IEEE Transactions on Communications, 2010Co-Authors: Xianggen Xia, Moon Ho LeeAbstract:In this paper, we propose a simple orthogonal space time transmission scheme for asynchronous cooperative systems. In the proposed scheme, OFDM is implemented at the Source Node, some very simple operations, namely time reversion and complex conjugation, are implemented at the relay Nodes, and a two-step of cyclic prefix (CP) removal is performed at the destination. The CP at the Source Node is used for combating the frequency selective fading channels and the timing errors. In this scheme, the received signals at the destination Node have the orthogonal code structure on each subcarrier and thus it has the fast symbol-wise ML decoding and can achieve full spatial diversity when SNR is large without the requirement of symbol level synchronization. It should be emphasized that since no Add/Remove CP or IFFT/FFT operation is needed at the relay Nodes, the relay Nodes do not have to know any information about the channels and the timing errors, and the complexity of the relay Nodes is very low.
-
distributed space frequency coding for cooperative diversity in broadband wireless ad hoc networks
IEEE Transactions on Wireless Communications, 2008Co-Authors: Wei Zhang, Xianggen Xia, P C Ching, Ben K LetaiefAbstract:A distributed space-frequency (SF) coded cooperative technique is proposed for broadband wireless ad-hoc networks, where both the channels from the Source Node to relay Nodes and from the relay Nodes to the destination Node are characterized by frequency-selective fading. Using an SF coding at the Source Node and a circular shift at each relay Node, we propose a scheme that can achieve both cooperative and multi-path diversity. The pairwise error probability is analyzed and the result demonstrates that a diversity gain of min(ML1, ML2) can be achieved, where M is the number of the relay Nodes, and L1 and L2 are the number of taps of the multipath fading channels from the Source Node to the relay Nodes and from the relay Nodes to the destination Node, respectively. Furthermore, the proposed distributed SF coding can achieve full-rate transmission for any number of relay Nodes. In particular, it does not need IFFT/FFT processing or decoding at each relay Node, thus providing a low-complexity design of the relay Nodes in broadband wireless ad-hoc networks.
-
a simple alamouti space time transmission scheme for asynchronous cooperative systems
IEEE Signal Processing Letters, 2007Co-Authors: Xianggen XiaAbstract:In this letter, we propose a simple orthogonal frequency-division multiplexing (OFDM) scheme for an asynchronous cooperative system, where OFDM is implemented at the Source Node, and time-reversion and complex conjugation are implemented at the relay Nodes. The cyclic prefix (CP) at the Source Node is used for combating the timing errors from the relay Nodes. In this scheme, the received signals at the destination Node have the Alamouti code structure on each subcarrier, and thus, it has the fast symbol-wise ML decoding. It should be emphasized that the relay Nodes only need to implement the time-reversion, some sign changes from plus to minus, and/or the complex conjugation to the received signals, and no IDFT or DFT operation is needed. It is shown that this simple scheme achieves second-order diversity gain without the synchronization requirement at the relay Nodes.
