[PDF] Top 20 Node-disjoint paths in hierarchical hypercube networks
Has 10000 "Node-disjoint paths in hierarchical hypercube networks" found on our website. Below are the top 20 most common "Node-disjoint paths in hierarchical hypercube networks".
Node-disjoint paths in hierarchical hypercube networks
... subclass in which prioritization is key to optimizing the overall per- formance of the ...network. In this paper, we have proposed a pragmatic polling with nonpreemptive priority-based access control scheme ... See full document
13
Node-disjoint paths in incomplete WK-recursive networks
... received in revised form 11 May 1998; accepted 19 April 2000 Abstract The incomplete WK-recursive networks have been recently proposed to relieve the re- striction on the sizes of the WK-recursive ... See full document
20
Bipancyclicity of hierarchical hypercube networks
... one-to-one disjoint paths algorithm was investigated in ...The hierarchical hypercube network was originally proposed in [9-11] for building massively parallel ...comparable ... See full document
5
A Reconfigurable Formation and Disjoint Hierarchical Routing for Rechargeable Bluetooth Networks
... Abstract: In this paper, a reconfigurable mesh-tree with a disjoint hierarchical routing protocol for the Bluetooth sensor network is ...c in its downstream direction to determine new ... See full document
18
One-to-Many Disjoint Paths in Hypercubes
... one-to-many disjoint paths in ...m disjoint paths whose maximal length is minimized in the worst case can be obtained in a k-dimensional hypercube, where ... See full document
7
The study of adjacent vertex-fault-tolerance for two spanning disjoint paths of hypercube 宋婉甄、洪春男
... embedding in the hypercube," Parallel Computing,29, ...Sun,LONGEST PATHS AND CYCLES IN FAULT HYPERCUBES," Proceedings of the IASTED ICPDCN, ...bipartite hypercube-like networks," ... See full document
2
The Study of Edge Fault-Tolerance for Two Spanning Disjoint Paths of Star Networks 劉驥雷、洪春男
... interconnection networks. In this paper, we discuss the edge fault tolerance for 2-pair spanning property for star ...spanning disjoint paths P(x1, y1) and P(x2, y2) of Sn ? Fe for any x1, x2 ... See full document
2
Fault tolerance for Hamiltonian cycle of node expansion on hypercube
... Spanning disjoint paths. 1 Introduction The hypercube is a popular and efficient inter- connection ...unavoidable in a large parallel ... See full document
6
Routing Functions-an Effective Approach to Deriving One-to-Many Disjoint Paths
... elements in which multiple occurrences of the same element are allowed [15]. In this paper, we introduce a new concept of routing functions, which can be used to construct one-to-many disjoint ... See full document
51
The spanning laceability on the faulty bipartite hypercube-like networks
... n. In this section, we show that every graph in B 0 n is f-edge fault k -laceable for every f 6 n 2 and f þ k 6 ...a node of G and S ¼ f v 1 ; v 2 ; ...of disjoint paths fP 1 ; P 2 ... See full document
9
Strong Menger Connectivity on the Class of Hypercube-like Networks.
... works in networks with faults, we are interested in the connectivity issue of a ...vertices in F ...fault-free paths in G−F, where deg f (u) and deg f (v) are the degree of u and ... See full document
3
On the spanning connectivity and spanning laceability of hypercube-like networks
... graph in B n 0 is w ∗ -laceable for every w, 1 ≤ w ≤ n, we need the concept of spanning ...a node of G and S = { v 1 , v 2 , ...of disjoint paths {P 1 , P 2 , ...any node u and any ... See full document
12
Finding cycles in hierarchical hypercube networks
... In an attempt to acquire a more accurate value for the yields of photofragments than that obtained by the fluorescence method, we have employed a res- onance-enhanc[r] ... See full document
5
Two Spanning Disjoint Paths with Required Length in Augmented Cubes
... cubes. In Section 3, we introduce the 2RP-property for the augmented cube AQ n and prove that AQ n satisfies the 2RP-property if n ≥ ...some in- teresting properties of augmented cubes are consequences of ... See full document
14
Hop Count Distribution of Multihop Paths in Wireless Networks With Arbitrary Node Density: Modeling and Its Applications
... transmissions in multihop wire- less networks with an arbitrary node ...each node, the neighbor node with the shortest distance to the destination is selected as the relaying ... See full document
11
Long paths in hypercubes with conditional node-faults
... every node should have at least two fault-free neighbors while a long path is constructed between every pair of fault-free ...fault-free node with only one fault-free neighbor, namely ...every node ... See full document
15
Designing a disjoint paths interconnection network with fault tolerance and collision solving
... another disjoint path to tolerate the faulty ...links in a switch are changed to bi-direction and the rerouting hop count is ...routing paths increases no matter whether packets encounter a faulty or ... See full document
18
3-disjoint gamma interconnection networks
... ample, in the present case when S ¼ 6 and D ¼ 6, and the routing path may be 6 ! 6 ! 6 ! 6, however, as the straight link from stage 1 to stage 2 is faulty, the path can be 6 ! 6 ! 4 ! ... See full document
6
Node-pancyclicity and edge-pancyclicity of hypercube variants
... the node prefixing method kGQ n −1 which will be used repeatedly in the definitions of specific hypercube variants late in this paper unless otherwise ...see in the fol- lowing sections ... See full document
7
Clock Skew Based Node Identification in Wireless Sensor Networks
... 1) In-network: For a node in WSNs to identify all its neigh- bor nodes, an approach with little calculation and memory is ...neighbor node, as shown in Table ...shown in Fig. 3, ... See full document
5
相關主題