DocumentCode
2054771
Title
Optimal broadcasting in all-port meshes of trees with distance-insensitive routing
Author
Salinger, Petr ; Tvrdik, Pavel
Author_Institution
Dept. of Comput. Sci. & Eng., Czech Tech. Univ., Prague, Czech Republic
fYear
2000
fDate
2000
Firstpage
353
Lastpage
358
Abstract
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-and-forward, is used. How its properties compare to meshes if distance-insensitive routing, such as wormhole, is used, was not previously understood. In this paper, we show that meshes of trees allow an elegant and optimal one-to-all broadcast algorithm supposing that routers implement distance-insensitive routing and have all-port capability
Keywords
multiprocessor interconnection networks; network topology; all-port capability; all-port meshes; distance-insensitive routing; mesh-of-trees; meshes of trees; one-to-all broadcast; Binary trees; Chromium; Communication switching; Computer science; Computer worms; Delay; Labeling; Network topology; Routing; TV broadcasting;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Processing Symposium, 2000. IPDPS 2000. Proceedings. 14th International
Conference_Location
Cancun
Print_ISBN
0-7695-0574-0
Type
conf
DOI
10.1109/IPDPS.2000.846005
Filename
846005
Link To Document