(will be inserted by the editor) A BGP-based Mechanism for Lowest-Cost...  Home/Search
Context
Related
| berkeley.edu/~christos/papers...podc.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: berkeley.edu/~christos/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper, we address the problem of interdomain routing from a mechanism-design point of view. The application of mechanism-design principles to the study of routing is the subject of earlier work by Nisan and Ronen [15] and Hershberger and Suri [11]. In this paper, we formulate and solve a version of the routing-mechanism design problem that is different from the previously studied version in three ways that make it more accurately reflective of real-world interdomain routing: (1) we treat... (Update)
Similar documents (at the sentence level): More
57.9%: A BGP-based Mechanism for Lowest-Cost Routing - Feigenbaum, Papadimitriou, Sami (2002) (Correct)
42.0%: Distributed Algorithmic Mechanism Design - Sami (2003) (Correct)
24.3%: Incentive-Compatible Interdomain Routing - Christos (2002) (Correct)
Active bibliography (related documents): More All
0.2: Specification Faithfulness in Networks with Rational Nodes - Shneidman, Parkes (2004) (Correct)
0.2: Distributed Algorithmic Mechanism Design: Recent Results.. - Feigenbaum, Shenker (2002) (Correct)
0.2: Distributed Implementations of Vickrey-Clarke-Groves Mechanisms - Parkes, Shneidman (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ inserted-distributed,
author = "Will Be Inserted",
title = "Distributed Computing manuscript No.",
url = "citeseer.ist.psu.edu/762347.html" }
Citations (may not include all citations):215 Multipart pricing of public goods (context) - Clarke - 1971
214 Incentives in teams (context) - Groves - 1973
184 A market-oriented programming environment and its applicatio.. - Wellman - 1993
174 and competitive sealed tenders (context) - Vickrey, auctions - 1961
137 Algorithmic mechanism design - Nisan, Ronen - 2001
95 Sharing the cost of multicast transmissions - Feigenbaum, Papadimitriou et al. - 2001
87 How Bad is Selfish Routing (context) - Roughgarden, Tardos - 2002
75 Distributed rational decision making - Sandholm - 1999
69 Iterative combinatorial auctions: Theory and practice - Parkes, Ungar - 2000
63 An analysis of BGP convergence properties - Griffin, Wilfong - 1999
46 Oxford University Press (context) - Mas-Colell, Whinston et al. - 1995
43 A BGP-based Mechanism for Lowest-Cost Routing - Feigenbaum, Papadimitriou et al. - 2002
40 Frugal path mechanisms - Archer, Tardos - 2002
38 iBundle: An efficient ascending price bundle auction - Parkes - 1999
35 Competitive Generalized Auctions - Fiat, Goldberg et al. - 2002
34 Vickrey prices and shortest paths: What is an edge worth - Hershberger, Suri - 2001
31 Incentives in public decision making (context) - Green, Laffont - 1979
27 Internet path inflation due to policy routing - Tangmunarunkit, Govindan et al. - 2001
19 Private communication (context) - Mitchell, Sami et al. - 2001
17 Distributed Games: From Mechanisms to Protocols - Monderer, Tennenholtz - 1999
7 Using redundancy to improve robustness of distributed mechan.. - Shneidman, Parkes - 2003
5 Auctions for decentralized scheduling (context) - Wellman, Walsh et al. - 2001
http://www.cs.yale.edu/homes/jf/AFKSS1.ps
http://www.routeviews.org
Documents on the same site (http://www.cs.berkeley.edu/~christos/): More
Computational Aspects of Organization Theory (Extended.. - Papadimitriou, al. (Correct)
A Microeconomic View of Data Mining - Kleinberg, Papadimitriou, Raghavan (1998) (Correct)
NP-completeness: A Retrospective - Papadimitriou (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC