DocumentCode
1508330
Title
Augmented ring networks
Author
Aiello, William ; Bhatt, Sandeep N. ; Chung, Fan R K ; Rosenberg, Arnold L. ; Sitaraman, Ramesh K.
Author_Institution
AT&T Labs.-Res., Florham Park, NJ, USA
Volume
12
Issue
6
fYear
2001
fDate
6/1/2001 12:00:00 AM
Firstpage
598
Lastpage
609
Abstract
We study four augmentations of ring networks which are intended to enhance a ring´s efficiency as a communication medium significantly, while increasing its structural complexity only modestly. Chordal rings add “shortcut” edges, which can be viewed as chords, to the ring. Express rings are chordal rings whose chords are routed outside the ring. Multirings append subsidiary rings to edges of a ring and, recursively, to edges of appended subrings. Hierarchical ring networks (HRN´s) append subsidiary rings to nodes of a ring and, recursively, to nodes of appended subrings. We show that these four modes of augmentation are very closely related: 1) Planar chordal rings, planar express rings, and multirings are topologically equivalent families of networks with the “cutwidth” of an express ring translating into the “tree depth” of its isomorphic multiring and vice versa. 2) Every depth-d HRN is a spanning subgraph of a depth-(2d-1) multiring. 3) Every depth-d multiring ℳ can be embedded into a d-dimensional mesh with dilation 3 in such a way that some node of ℳ resides at a corner of the mesh. 4) Every depth-d HRN ℋ can be embedded into a d-dimensional mesh with dilation 2 in such a way that some node of ℋ resides at a corner of the mesh. In addition to demonstrating that these four augmented ring networks are grid graphs, our embedding results afford us close bounds on how much decrease in diameter is achievable for a given increase in structural complexity for the networks. Specifically, we derive upper and lower bounds on the optimal diameters of N-node depth-d multirings and HRN´s that are asymptotically tight for large N and d
Keywords
computational complexity; computer networks; augmented ring networks; chordal rings; communication medium; embedding results; isomorphic multiring; lower bounds; multirings; planar express rings; spanning subgraph; structural complexity; upper bounds; Bandwidth; Computer networks; Embedded computing; Fault tolerance; Filling; Grid computing;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/71.932713
Filename
932713
Link To Document