A recent trend in routing research is to avoid inefficiencies in network-level routing by
allowing hosts to either choose routes themselves (eg, source routing) or use overlay routing …

A recent trend in routing research is to avoid inefficiencies in network-level routing by
allowing hosts to either choose routes themselves (eg, source routing) or use overlay routing …

We study the negative consequences of selfish behavior in a congested network and
economic means of influencing such behavior. We consider a model of selfish routing in …

We study economic incentives for influencing selfish behavior in networks. We consider a
model of selfish routing in which the latency experienced by network traffic on an edge of the …

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 …

We analyze the characteristics of overlay routing networks generated by selfish nodes
playing competitive network construction games. We explore several networking scenarios …

In this work, we introduce and study a new model for selfish routing over non-cooperative
networks that combines features from the two such best studied models, namely the KP …

A central and well-studied problem arising in the management of a large network is that of
routing traffic to achieve the best possible network performance. In many networks, it is …

We study the problem of routing traffic through a congested network. We focus on the
simplest case of a network consisting of m parallel links. We assume a collection of n …

In this paper, we study the price of anarchy of traffic routing, under the assumption that users
are partially altruistic or spiteful. We model such behavior by positing that the" cost" …