63 search results - page 1 / 13 » Bottleneck Routing Games in Communication Networks |
107
click to vote
INFOCOM
2006
IEEE
15 years 6 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...
97
Voted
ESA
2010
Springer
15 years 1 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
115
click to vote
INFOCOM
1999
IEEE
15 years 4 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
15 years 4 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...
106
Voted
SIGCOMM
2004
ACM
15 years 5 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...