DocumentCode
2131137
Title
Distance routing on series parallel networks
Author
Flocchini, Paola ; Luccio, Flaminia L.
Author_Institution
Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada
fYear
1996
fDate
27-30 May 1996
Firstpage
352
Lastpage
359
Abstract
We consider the problem of routing messages on Series Parallel Graphs (SPGs) and we introduce a new technique called Distance Routing. This technique is based on the idea of encoding in the label of each node x some information about a shortest path from the source of the SPG to x, and from x to the terminal node of the SPG. We first compare shortest path Distance Routing and I-interval Routing Schemes on directed SPGs. We then show that Distance Routing can be used to route on bidirectional SPGs, where no general shortest path I-interval Routing Scheme can be applied. We also show the relevance of the study of the time complexity in the choice of a Compact Routing method
Keywords
communication complexity; graph theory; multiprocessor interconnection networks; network routing; one-interval routing schemes; routing messages; series parallel networks; shortest path distance routing; terminal node; time complexity; Boolean functions; Computer science; Costs; Encoding; Labeling; Routing; Runtime; Scholarships; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Distributed Computing Systems, 1996., Proceedings of the 16th International Conference on
Print_ISBN
0-8186-7399-0
Type
conf
DOI
10.1109/ICDCS.1996.507969
Filename
507969
Link To Document