Double loop networks with minimum delay
β Scribed by F.K Hwang; Y.H Xu
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 516 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A double-loop network with hop constants h 1 , h 2 , DL(n, h 1 , h 2 ) may be represented as a directed graph with n nodes 0, 1, . . . , n 0 1 and 2n links of the form i r i / h 1 mod n and i r i / h 2 mod n (referred to as h 1 -links and h 2 -links). They have been proposed as architectures for loc
This article deals with the problem of minimizing the transmission delay in Illiac-type interconnection networks for parallel or distributed architectures or in local area networks. A double-loop network (also known as circulant) G(n,h), consists of a loop of n vertices where each vertex i is also j
Double loop networks have been intensively studied as interconnecting networks. However, the reliability analysis of such networks has hit a snag since the usual measure of reliability, the graph connectivity, is completely powerless as all double loops, if connected, are 2-connected. Recently, Hwan