DocumentCode
2660162
Title
Analysis of BGP Convergence Using SHLPN Model
Author
Wang Lijun ; Jianping, Wu ; Ke, Xu
Author_Institution
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing
fYear
2007
fDate
13-19 May 2007
Firstpage
4
Lastpage
4
Abstract
BGP can be looked as a distributed algorithm to solve the stable paths problem. Routing policies conflict among ASes may cause routing divergence in Internet. Several research efforts analyze BGP convergence by describing BGP routing mechanism statically and designating BGP events in artificial sequence. In this paper, we present a stochastic high-level petri net model of simple path vector protocol, which conforms to the event-driven property of BGP. Basing on the model, the essence of routing policies conflict is analyzed and an algorithm is proposed to locate the conflict.
Keywords
Internet; Petri nets; distributed algorithms; routing protocols; stochastic processes; BGP convergence; SHLPN model; distributed algorithm; routing; simple path vector protocol; stochastic high-level petri net model; Algorithm design and analysis; Computer science; Convergence; Delay; Design methodology; Distributed algorithms; Internet; Routing protocols; Shortest path problem; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Telecommunications, 2007. AICT 2007. The Third Advanced International Conference on
Conference_Location
Morne
Print_ISBN
0-7695-2843-0
Electronic_ISBN
0-7695-2843-0
Type
conf
DOI
10.1109/AICT.2007.12
Filename
4215225
Link To Document