Routing and peering in a competitive internet

Proceedings of the IEEE Conference on Decision and Control

Volumn 2, Issue , 2004, Pages 1556-1561

  Johari, Ramesh ^a   Tsitsiklis, John N ^b  

^a STANFORD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); MATHEMATICAL MODELS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; TOPOLOGY;

COST FUNCTION; INTERCONNECTION LINKS; NETWORK PROVIDERS; ROUTING;

INTERNET;

EID: 14344250041     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2004.1430265     Document Type: Conference Paper

References (14)

1. L. Gao and J. Rexford, "Stable Internet routing without global coordination," IEEE/ACM Transactions on Networking, vol. 9, no. 6, pp. 681-692, 2001.
2. W. Norton, "Internet service providers and peering," 2000, available on request from: http://www.equinix.com/press/whtppr.htm.
3. T. G. Griffin and G. T. Wilfong, "An analysis of BGP convergence properties," ACM SIGCOMM Computer Communication Review, vol. 29, no. 4, pp. 277-288, 1999.
4. J. S. Marcus, Designing Wide Area Networks and Internetworks: A Practical Guide. Addison Wesley, 1999.
5. E. Koutsoupias and C. Papadimitriou, "Worst-case equilibria," in Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, 1999, pp. 404-413.
6. T. Roughgarden and E. Tardos, "How bad is selfish routing?" Journal of the ACM, vol. 49, no. 2, pp. 236-259, 2002.
7. T. G. Griffin, F. B. Shepherd, and G. T. Wilfong, "The stable paths problem and interdomain routing," IEEE/ACM Transactions on Networking, vol. 10, no. 2, pp. 232-243, 2002.
8. C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, "Delayed Internet routing convergence," IEEE/ACM Transactions on Networking, vol. 9, no. 3, pp. 293-306, 2001.
9. L. He and J. Walrand, "Dynamic provisioning of service level agreements between interconnected networks," in Proceedings of the 40th Allerton Conference on Communication, Control, and Computing, 2002.
10. B. Hajek and G. Gopalakrishnan, "Do greedy autonomous systems make for a sensible Internet?" 2002, presented at the Conference on Stochastic Networks, Stanford University.
11. J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGP-based mechanism for lowest-cost routing," in Proceedings of the 21st Symposium on Principles of Distributed Computing, 2002, pp. 173-182.
12. R. Johari and J. N. Tsitsiklis, "Routing and peering in a competitive Internet," MIT Laboratory for Information and Decision Systems, Publication 2570, 2003.
13. D. Awduche, J. Agogbua, and J. McManus, "An approach to optimal peering between autonomous systems in the Internet," in Proceedings of the 7th International Conference on Computer Communication and Networks, 1998, pp. 346-351.
14. D. P. Bertsekas and R. G. Gallager, Data Networks, 2nd ed. Upper Saddle River, New Jersey: Prentice Hall, 1992.