Paper Info
Title
Interval Routing & Layered Cross Product: Compact Routing Schemes for Butterflies, Mesh of Trees and Fat Trees
Abstract
In this paper we propose compact routing schemes having space and time complexities comparable to a 2-Interval Routing Scheme for the class of networks decomposable as Layered Cross Product (LCP) of rooted trees. As a consequence, we are able to design a 2-Interval Routing Scheme for butterflies, meshes of trees and fat trees using a fast local routing algorithm. Finally, we show that a compact routing scheme for networks which are LCP of general graphs cannot be found by any only using shortest paths information on the factors.
Year
DOI
Venue
1998
10.1007/BFb0057963
Euro-Par
Keywords
Field
DocType
fat trees,interval routing,layered cross product,compact routing schemes,time complexity,shortest path
Multipath routing,Equal-cost multi-path routing,Link-state routing protocol,Dynamic Source Routing,Path vector protocol,Computer science,Algorithm,Destination-Sequenced Distance Vector routing,DSRFLOW,Routing table,Distributed computing
Conference
Volume
ISSN
ISBN
1470
0302-9743
3-540-64952-2
Citations 
PageRank 
References 
2
0.39
12
Authors
2
Name
Order
Citations
PageRank
Tiziana Calamoneri151146.80
Miriam di Ianni214417.27