Parallel Architectures, Algorithms, and Networks, International Symposium on (2005)
Dec. 7, 2005 to Dec. 9, 2005
ISSN: 1087-4089
ISBN: 0-7695-2509-1
pp: 282-287
Doina Bein , UNLV
Vincent Villain , LaRIA, Universite de Picardie Jules, Verne, France
ABSTRACT
<p>Compact routing protocols are used to reduce the routing table size at the cost of the optimality of the computed (shortest) paths. Interval Routing ( IR ) is a compact routing scheme, where no des are labeled with unique integers from a continuous range, and the outgoing arcs in every node are labeled with a set of intervals forming a partition of the range. Pivot Interval Routing(PIR) [19, 101] applies IR to an arbitrary weighted network such that the stretch factor (the ratio between the length of a path induced by PIR and the actual distance betwe en theno des) is at most five and three on the average.</p> <p>A self-stabilizing system has the ability to automatically recover from transient faults in finite time [5, 6]. We present a self-stabilizing PIR (SPZR). Our algorithm, with no knowledge of the network layout, tolerates node/link addition and/or failur e, and builds correct routing tables in o(d\sqrt {(a1 + \log n^{} )}) time units (d is the network diameter and n is the maximum number of nodes). The stretch factor and the average stretch factor are preserved. Each node builds its own routing table of size o(n^{1/2} \log ^{3/2} n + \Delta \log n) bits (where \Delta is the node degree) with a total number of o(n^{3/2} \log ^{3/2} n + n\Delta \log (n)) bits for the whole network (\Delta is the maximum degree of a node in the network).</p>
INDEX TERMS
null
CITATION

V. Villain, D. Bein and A. K. Datta, "Self-Stablizing Pivot Interval Routing in General Networks," Parallel Architectures, Algorithms, and Networks, International Symposium on(ISPAN), Las Vegas, Nevada, USA, 2005, pp. 282-287.
doi:10.1109/ISPAN.2005.79