Using Linearization for Global Consistency in SSR

Author

Kutzner, Kendy ; Fuhrmann, Thomas

Author_Institution

Comput. Sci. Dept., Karlsruhe Univ.

fYear

2007

fDate

26-30 March 2007

Firstpage

1

Lastpage

5

Abstract

Novel routing algorithms such as scalable source routing (SSR) and virtual ring routing (VRR) need to set up and maintain a virtual ring structure among all the nodes in the network. The iterative successor pointer rewiring protocol (ISPRP) is one way to bootstrap such a network. Like its VRR-analogon, ISPRP requires one of the nodes to flood the network to guarantee consistency. Recent results on self-stabilizing algorithms now suggest a new approach to bootstrap the virtual rings of SSR and VRR. This so-called linearization method does not require any flooding at all. Moreover, it has been shown that linearization with shortcut neighbors has on average polylogarithmic convergence time, only.

Keywords

iterative methods; linearisation techniques; routing protocols; telecommunication network topology; global consistency; iterative successor pointer rewiring protocol; linearization method; polylogarithmic convergence time; scalable source routing algorithm; virtual ring routing algorithm; Communications technology; Computer science; Convergence; Floods; Iterative algorithms; Linearization techniques; Network topology; Proposals; Radio link; Routing protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International

Conference_Location

Long Beach, CA

Print_ISBN

1-4244-0910-1

Electronic_ISBN

1-4244-0910-1

Type

conf

DOI

10.1109/IPDPS.2007.370656

Filename

4228384