A BGP-Based Mechanism for Lowest-Cost Routing

TitleA BGP-Based Mechanism for Lowest-Cost Routing
Publication TypeConference Paper
Year of Publication2002
AuthorsFeigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S.
Published inProceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002)
Page(s)173-182
Other Numbers247
Acknowledgment

This work was partially supported by funding provided to ICSI and its researchers through National Science Foundation grants ANI: 0196514 (originally 9730162, "Learning and the Design of the Internet"); CNS: 0081698 ("Analysis of Internet Algorithms: Optimization, Game Theory, and Competitive Analysis"); CCF: 0121555 ("Discrete Models and Algorithms in the Sciences"); CNS: 0207399 ("Incentive-Compatible Designs for Distributed Systems"); CNS: 0205519 ("Addressing Fundamental Issues for Robust Internet Performance"); and CNS: 0225660 ("Robust Large-Scale Distributed Systems"). Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors or originators and do not necessarily reflect the views of the National Science Foundation.

URLhttp://www.icsi.berkeley.edu/pubs/networking/bgpbased02.pdf
Bibliographic Notes

Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, pp. 173-182.

Abbreviated Authors

J. Feigenbaum, C.H. Papadimitriou, R. Sami, and S. Shenker

ICSI Research Group

Networking and Security

ICSI Publication Type

Article in conference proceedings