Sciweavers

63 search results - page 2 / 13
» Bottleneck Routing Games in Communication Networks
Sort
View
SIGMETRICS
2003
ACM
113views Hardware» more  SIGMETRICS 2003»
13 years 10 months ago
An empirical evaluation of wide-area internet bottlenecks
Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network – i.e last mile connectivity to users, or access links of s...
Aditya Akella, Srinivasan Seshan, Anees Shaikh
INFOCOM
2005
IEEE
13 years 10 months ago
On the interaction between overlay routing and underlay routing
— In this paper, we study the interaction between overlay routing and Traffic Engineering (TE) in a single Autonomous System (AS). We formulate this interaction as a twoplayer n...
Yong Liu, Honggang Zhang, Weibo Gong, Donald F. To...
INFOCOM
2010
IEEE
13 years 3 months ago
A Theoretical Framework for Hierarchical Routing Games
—Most theoretical research on routing games in telecommunication networks has so far dealt with reciprocal congestion effects between routed entities. Yet in networks that suppor...
Vijay Kamble, Eitan Altman, Rachid El Azouzi, Vino...
GLOBECOM
2009
IEEE
13 years 11 months ago
PEMP: Peering Equilibrium MultiPath Routing
—It is generally admitted that Inter-domain peering links represent nowadays the main bottleneck of the Internet, particularly because of lack of coordination between providers, ...
Stefano Secci, Jean-Louis Rougier, Achille Pattavi...