We consider a multi-class single server queueing network as a model of a packet switching network. The rates packets are sent into this network are controlled by queues which act as congestion windows. By considering a sequence of such congestion windows we allow the network to become congested. We show the stationary throughput of routes on this sequence of networks converges to an allocation ...

We study the efficiency of oligopoly equilibria in congested markets. The motivating examples are the allocation of network flows in a communication network or of traffic in a transportation network. We show that increasing competition among oligopolists can reduce efficiency, measured as the difference between users’ willingness to pay and delay costs. We characterize a tight bound of 5/6 on e...

This paper is devoted to the study of a routing problem in telecommunication networks, when the cost function is the average delay. We establish asymptotic expansions for the value function and solutions in the vicinity of a congested nominal problem. The study is strongly related to the one of a partial inverse barrier method for linear programming. Analyse asymptotique des r eseaux de communi...

This paper reports on results of a study undertaken in the U.K. aimed at investigating factors affecting the car following process. An understanding of the factors affecting this complex decision making process is essential to a wide range of theoretical issues including driver workload, capacity and the modeling of freeway flow, as well as practical applications such as the design of in-vehicl...

The Congested Clique is a distributed-computing model for single-hop networks with restricted bandwidth that has been very intensively studied recently. It models a network by an n-vertex graph in which any pair of vertices can communicate one with another by transmitting O(log n) bits in each round. Various problems have been studied in this setting, but for some of them the best-known results...

Rapid urbanization and increasing demand for transportation burdens urban road infrastructures. The interplay of number of vehicles and available road capacity on their routes determines the level of congestion. Although approaches to modify demand and capacity exist, the possible limits of congestion alleviation by only modifying route choices have not been systematically studied. Here we coup...

We examine adaptive strategies adopted by vehicles for route selection en-route in transportation networks. By studying a model of two-dimensional cellular automata, we characterized parameter called path-greediness, which corresponds to the tendency them travel their destinations via shortest path. The path-greediness each individual vehicle is updated based on local traffic conditions, either...

the hop-normalized metric is better able to route real time traffic away from congested links thus providing better performance to satisfy real time services requirements.