Network utility maximization is a well-accepted theoretical framework that describes how congestion controls cooperate to achieve an ideal sending rate allocation, for given functions of senders and constraints the network. These network are expressed as “cost” in framework. In practice, most control mechanisms obtain feedback different from framework's “cost.” This article focuses on explicit ...

We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost function-independent) worst-case examples. One noteworthy byproduct of our proofs is the fact that weigh...

Congestion and overloading for lines are the main problems in the exploitation of power grids. The consequences of these problems in deregulated systems can be mentioned as sudden jumps in prices in some parts of the power system, lead to an increase in market power and reduction of competition in it. FACTS devices are efficient, powerful and economical tools in controlling power flows through ...

En route airspace congestion, often due to convective weather, causes system-wide delays and disruption in the U.S. National Airspace System (NAS). Present-day methods for managing congestion are mostly manual, based on uncertain forecasts of weather and traffic demand, and often involve rerouting or delaying entire flows of aircraft. A sequential decision-making approach is proposed, in which ...

A heuristic algorithm, called LANCOST, is introduced for vehicle routing and scheduling problems to minimize the total travel cost, where the total travel cost includes fuel cost, driver cost and congestion charge. The fuel cost required is influenced by the speed. The speed for a vehicle to travel along any road in the network varies according to the time of travel. The variation in speed is c...

We identify how to share costs locally in weighted congestion games with polynomial cost functions to minimize the worst-case price of anarchy (POA). First, we prove that among all cost-sharing methods that guarantee the existence of pure Nash equilibria, the Shapley value minimizes the worst-case POA. Second, if the guaranteed existence condition is dropped, then the proportional cost-sharing ...

In this paper, we present the results from a detailed energy measurement study of different TCP variants when used in Mobile Ad hoc Network environments. More precisely, we focus on the node-level cost of the TCP protocol; also know as the computational energy cost. In fact, the computational energy consumption is the most important part of TCP energy consumption. This is already proven in prev...

The Urban Mobility Report (UMR) is a widely-cited study that estimates U.S. traffic congestion costs and recommends various congestion reduction strategies. This report critically evaluates its methodologies. The UMR does not reflect best congestion costing methods: it uses higher baseline speeds and travel time unit cost values than experts recommend, exaggerates fuel savings and emission redu...

We study the model of resource allocation games with conflicting congestion effects that was introduced by Feldman and Tamir (2012). In this model, an agent’s cost consists of its resource’s load (which increases with congestion) and its share in the resource’s activation cost (which decreases with congestion). The current work studies the convergence rate of best-response dynamics (BRD) in the...

Congestion management in electricity markets is traditionally done using deterministic values of power system parameters considering a fixed network configuration. In this paper, a stochastic programming framework is proposed for congestion management considering the power system uncertainties. The uncertainty sources that are modeled in the proposed stochastic framework consist of contingencie...