63 search results - page 1 / 13 » Bottleneck Routing Games in Communication Networks |
INFOCOM
2006
IEEE
13 years 10 months ago
2006
IEEE
—We consider routing games where the performance of each user is dictated by the worst (bottleneck) element it employs. We are given a network, finitely many (selfish) users, eac...
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
INFOCOM
1999
IEEE
13 years 8 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
GLOBECOM
2009
IEEE
13 years 8 months ago
2009
IEEE
In this paper, we show a prototype implementation for a new architecture of supporting interdomain routes. It is widely recognized that the rapid growth of Internet is forcing a sc...
SIGCOMM
2004
ACM
13 years 10 months ago
2004
ACM
The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottlen...