DocumentCode
2487063
Title
Principles of safe Policy Routing Dynamics
Author
Epstein, Samuel ; Mattar, Karim ; Matta, Ibrahim
Author_Institution
Comput. Sci. Dept., Boston Univ., Boston, MA, USA
fYear
2009
fDate
13-16 Oct. 2009
Firstpage
254
Lastpage
263
Abstract
We introduce the dynamic policy routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of causation chains where the route flap at one node causes a flap at the next node along the chain.
Keywords
telecommunication network routing; Gao-Rexford guidelines; InterferenceBeat; causation chains; distributed algorithm; multitiered cycle principle; noninterference principle; safe policy routing dynamics; single cycle principle; Computer science; Convergence; Distributed algorithms; Economic forecasting; Guidelines; Internet; Peer to peer computing; Power generation economics; Routing protocols; Topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Network Protocols, 2009. ICNP 2009. 17th IEEE International Conference on
Conference_Location
Princeton, NJ
ISSN
1092-1648
Print_ISBN
978-1-4244-4635-3
Electronic_ISBN
1092-1648
Type
conf
DOI
10.1109/ICNP.2009.5339679
Filename
5339679
Link To Document