• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

How bad is selfish routing? (2002)

Cached

  • Download as a PDF

Download Links

  • [www.cs.ust.hk]
  • [www.cs.cuhk.hk]
  • [www.cse.cuhk.edu.hk]
  • [www.cs.cuhk.edu.hk]
  • [www.cs.cmu.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cornell.edu]
  • [www-2.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.cmu.edu]
  • [www.cs.huji.ac.il]
  • [www.cs.northwestern.edu]
  • [personal.ie.cuhk.edu.hk]
  • [www.cs.cornell.edu]
  • [lcm.csa.iisc.ernet.in]
  • [www.cs.cornell.edu]
  • [www.cs.stanford.edu]
  • [theory.stanford.edu]
  • [theory.stanford.edu]
  • [www.cs.cornell.edu]
  • [www.cs.brown.edu]
  • [theory.stanford.edu]
  • [www.cs.stanford.edu]
  • [www.cs.cornell.edu]
  • [cs.uwaterloo.ca]
  • [theory.stanford.edu]
  • [cs.uwaterloo.ca]
  • [theory.stanford.edu]
  • [theory.stanford.edu]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Tim Roughgarden , Éva Tardos
Venue:JOURNAL OF THE ACM
Citations:657 - 27 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Roughgarden02howbad,
    author = {Tim Roughgarden and Éva Tardos},
    title = {How bad is selfish routing?},
    journal = {JOURNAL OF THE ACM},
    year = {2002},
    volume = {49},
    number = {2},
    pages = {236--259}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route traffic such that the sum of all travel times—the total latency—is minimized. In many settings, it may be expensive or impossible to regulate network traffic so as to implement an optimal assignment of routes. In the absence of regulation by some central authority, we assume that each network user routes its traffic on the minimum-latency path available to it, given the network congestion caused by the other users. In general such a “selfishly motivated ” assignment of traffic to paths will not minimize the total latency; hence, this lack of regulation carries the cost of decreased network performance. In this article, we quantify the degradation in network performance due to unregulated traffic. We prove that if the latency of each edge is a linear function of its congestion, then the total latency of the routes chosen by selfish network users is at most 4/3 times the minimum possible total latency (subject to the condition that all traffic must be routed). We also consider the more general setting in which edge latency functions are assumed only to be continuous and nondecreasing in the edge congestion. Here, the total

Keyphrases

selfish routing    total latency    general setting    edge latency function    linear function    edge congestion    minimum-latency path    congested network    network performance    decreased network performance    network traffic    motivated assignment    many setting    minimum possible total latency    selfish network user    network congestion    optimal assignment    latency function    central authority    unregulated traffic   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University