Publication Details
Title: A BGP-Based Mechanism for Lowest-Cost Routing
Author: J. Feigenbaum, C.H. Papadimitriou, R. Sami, and S. Shenker
Group: Networking
Date: July 2002
PDF: http://www.icsi.berkeley.edu/pubs/networking/bgpbased02.pdf
Acknowledgements:
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.
Bibliographic Information:
Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, pp. 173-182.
Bibliographic Reference:
J. Feigenbaum, C.H. Papadimitriou, R. Sami, and S. Shenker. A BGP-Based Mechanism for Lowest-Cost Routing. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, pp. 173-182., July 2002
Author: J. Feigenbaum, C.H. Papadimitriou, R. Sami, and S. Shenker
Group: Networking
Date: July 2002
PDF: http://www.icsi.berkeley.edu/pubs/networking/bgpbased02.pdf
Acknowledgements:
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.
Bibliographic Information:
Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, pp. 173-182.
Bibliographic Reference:
J. Feigenbaum, C.H. Papadimitriou, R. Sami, and S. Shenker. A BGP-Based Mechanism for Lowest-Cost Routing. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002), Monterey, California, pp. 173-182., July 2002