A BGP-based mechanism for lowest-cost routing

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2002, Pages 173-182

  Feigenbaum, Joan ^a   Sami, Rahul ^a   Papadimitriou, Christos ^b   Shenker, Scott ^c  

^a YALE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS AGENTS; CONCURRENT ENGINEERING; DISTRIBUTED COMPUTER SYSTEMS; GATEWAYS (COMPUTER NETWORKS); INTERNET; NETWORK PROTOCOLS; REAL TIME SYSTEMS; TELECOMMUNICATION TRAFFIC; TIME SHARING SYSTEMS;

BORDER GATEWAY PROTOCOL; CENTRALIZED ALGORITHMS; DISTRIBUTED ALGORITHMS; INTERDOMAIN ROUTING; LOWEST COST ROUTING;

DATA COMMUNICATION SYSTEMS;

EID: 0036957186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/571855.571856     Document Type: Conference Paper

References (23)

1. A. Archer and E. Tardos. Frugal path mechanisms. In Proceedings of 13th Symposium on Discrete Algorithms, ACM Press/SIAM, New York/Philadelphia, pages 991-999, 2002.
2. E. Clarke. Multipart pricing of public goods. Public Choice 11 (1971), pages 17-33.
3. J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker. Approximation and Collusion in Multicast Cost Sharing, submitted. Available in preprint form at http://www.cs.yale.edu/homes/jf/FKSS1.ps.
4. J. Feigenbaum, A. Krishnamurthy, R. Sami, and S. Shenker. Hardness Results for Multicast Cost Sharing, submitted. Available in preprint form at http://www.cs.yale.edu/homes/jf/FKSS2.ps.
5. J. Feigenbaum, C. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Journal of Computer and System Sciences 63 (2001), pages 21-41.
6. A. Fiat, A. Goldberg, J. Hartline, and A. Karlin. Generalized Competitive Auctions. To appear in Proceedings of the 34th Symposium on Theory of Computing, ACM Press, New York, 2002.
7. J. Green and J. Laffont. Incentives in public decision making. In Studies in Public Economics. Volume 1, North Holland, Amsterdam, pages 65-78, 1979.
8. T. G. Griffin and G. Wilfong. An analysis of BGP convergence properties. In Proceedings of SIGCOMM '99, ACM Press, New York, pages 277-288, 1999.
9. T. Groves. Incentives in teams. Econometrica 41 (1973), pages 617-663.
10. J. Hershberger and S. Suri. Vickrey prices and shortest paths: What is an edge worth? In Proceedings of the 42nd Symposium on the Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, pages 129-140, 2001.
11. A. Mas-Colell, M. Whinston, and J. Green. Microeconomic Theory, Oxford University Press, New York, 1995.
12. J. Mitchell, R. Sami, K. Talwar, and V. Teague. Private communication, December 2001.
13. D. Monderer and M. Tennenholtz. Distributed Games: From Mechanisms to Protocols. In Proceedings of the 16th National Conference on Artificial Intelligence, pages 32-37, 1999.
14. N. Nisan and A. Ronen. Algorithmic mechanism design. Games and Economic Behavior 35 (2001), pages 166-196.
15. D. Parkes. iBundle: An efficient ascending price bundle auction. In Proceedings of the 1st Conference on Electronic Commerce, ACM Press, New York, page 148-157, 1999.
16. D. Parkes and L. Ungar. Iterative combinatorial auctions: Theory and practice. In Proceedings of the 17th National Conference on Artificial Intelligence, pages 71-81, 2000.
17. T. Roughgarden and E. Tardos. How Bad is Selfish Routing? To appear in Journal of the ACM.
18. Route Views. University of Oregon Route Views Project. http://www.routeviews.org
19. T. Sandholm. Distributed rational decision making. In G. Weiss, editor, Multiagent systems: A Modern Introduction to Distributed Artificial Intelligence. MIT Press, Cambridge, MA, pages 201-258, 1999.
20. H. Tangmunarunkit, R. Govindan, and S. Shenker. Internet path inflation due to policy routing. In Proceeding of SPIE ITCom 2001, SPIE Press, Bellingham, pages 19-24, 2001.
21. W. Vickrey. Counterspeculation, auctions, and competitive sealed tenders. Journal of Finance 16 (1961), pages 8-37.
22. M. Wellman. A market-oriented programming environment and its applications to distributed multicommodity flow problems. Journal of AI Research 1 (1993), pages 1-23.
23. M. Wellman, W. Walsh, P. Wurman, and J. Mackie-Mason. Auctions for decentralized scheduling. Games and Economic Behavior 35 (2001), pages 271-303.