Inefficiency in Networks with Multiple Sources and Sinks

نویسندگان

  • Hyejin Youn
  • Michael T. Gastner
  • Hawoong Jeong
چکیده

We study the problem of optimizing traffic in decentralized transportation networks, where the cost of a link depends on its congestion. If users of a transportation network are permitted to choose their own routes, they generally try to minimize their personal travel time. In the absence of centralized coordination, such a behavior can be inefficient for society and even for each individual user. This inefficiency can be quantified by the “price of anarchy”, the ratio of the suboptimal total cost to the socially optimal cost. Here we study the price of anarchy in multi-commodity networks, (i.e., networks where traffic simultaneously flows between different origins and destinations).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper Bounding the Price of Anarchy in Atomic Splittable Selfish Routing

Selfish behavior of nodes of a network such as sensors of a geographically distributed sensor network, each of which owned and operated by a different stakeholder may lead to a game theoretic setting called “selfish routing”. The fact that every node strictly aims at maximizing its own utility can cause degradations of social welfare. An issue of concern would be the quantitative measure of thi...

متن کامل

Optimal flows in networks with multiple sources and sinks

In their famous book, Ford and Fulkerson [ 3 ] state that the situation in which there are multiple sources and sinks, with flow permitted from any source to any sink, presents nothing new. They claim that a multiple source, multiple sink network reduces to a single source, single sink network by the adjunction of a supersource, a supersink, and several arcs. That is of course true if only a ma...

متن کامل

Virtual Sink Rotation: Low-Energy Scalable Routing Protocol for Ubiquitous Sensor Networks

In this paper we propose a new routing protocol called virtual sink rotation (VSR) routing for large-scale sensor networks. VSR can efficiently handle a large number of sources as well as a large number of sinks with potential mobility. Each sensor node is not required to know the global network topology nor the location awareness. The main ideas underlying the VSR are two folds. First, to alle...

متن کامل

Energy-Efficient Grid-based Data Dissemination in Wireless Sensor Networks

In Wireless Sensor Networks, data dissemination to multiple sinks consumes a lot of energy. Various data dissemination schemes have been proposed over the years to reduce the energy consumption in Wireless Sensor Networks. In this paper, we have proposed a virtual infrastructure based data dissemination scheme which reduces the energy consumption in grid construction process. Grid construction ...

متن کامل

Optimization of Survivability Analysis for Large-Scale Engineering Networks

Engineering networks fall into the category of large-scale networks with heterogeneous nodes such as sources and sinks. The survivability analysis of such networks requires the analysis of the connectivity of the network components for every possible combination of faults to determine a network response to each combination of faults. From the computational complexity point of view, the problem ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009