A fractional model of the Border Gateway Protocol (BGP)

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 193-199

  Haxell, P E ^a   Wilfong, G T ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS SYSTEMS (AS); BORDER GATEWAY PROTOCOL (BGP); EXCHANGE ROUTING; INTER-DOMAIN ROUTING; INTRA-DOMAIN ROUTING; PATH PROBLEMS;

GRID COMPUTING; INTERNET PROTOCOLS; PARALLEL ALGORITHMS; ROUTING ALGORITHMS; ROUTING PROTOCOLS; SURFACE PLASMON RESONANCE; TELECOMMUNICATION SYSTEMS;

GATEWAYS (COMPUTER NETWORKS);

EID: 57549104330     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. R. Aharoni and T. Fleiner. On a lemma of Scarf. Journal of Combinatorial Theory, Series B, 87(1):72-80, 2003.
2. D. Gale and L. Shapley. College admissions and stability of marriage. American Math Monthly, 69(1):9-15, 1962.
3. T. Griffin, B. Shepherd, and G. Wilfong. The stable paths problem and interdomain routing. IEEE/ACM Transactions on Networking, 10(2):232-243, 2002.
4. T. Griffin and G. Wilfong. An analysis of BGP convergence properties. In Proceedings of SIG-COMM, pages 277-288, 1999.
5. J. Nash. Equilibrium points in n-person games. Proceedings of the National Academy of Sciences, 36(1):48-49, 1950.
6. Y. Rehkter and T. Li. A Border Gateway Protocol (BGP version 4). RFC 1771, 1995.
7. H. Scarf. The core of an n person game. Econometrica, 35(1):50-69, 1967.
8. J. Tan. A necessary and sufficient condition for the existence of a complete stable matching. J. Algorithms, 12(1):154-178, 1991.
9. K. Varadhan, R. Govindan, and D. Estrin. Persistent route oscillations in inter-domain routing. Computer Networks, 32:1-16, 2000.