Sciweavers

231 search results - page 18 / 47
» Path disruption games
Sort
View
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
15 years 4 months ago
Price of Stability in Survivable Network Design
We study the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in [5]. In this model, players attempt to connect ...
Elliot Anshelevich, Bugra Caskurlu
91
Voted
INFOCOM
2006
IEEE
15 years 3 months ago
Bottleneck Routing Games in Communication Networks
—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...
Ron Banner, Ariel Orda
CONEXT
2009
ACM
14 years 10 months ago
SafeGuard: safe forwarding during route changes
This paper presents the design and evaluation of SafeGuard, an intra-domain routing system that can safely forward packets to their destinations even when routes are changing. Saf...
Ang Li, Xiaowei Yang, David Wetherall
TRANSCI
2010
104views more  TRANSCI 2010»
14 years 4 months ago
Equilibrium Results for Dynamic Congestion Games
Consider the following game. Given a network with a continuum of users at some origins, suppose that users wish to reach specic destinations, but that they are not indierent to the...
Frédéric Meunier, Nicolas Wagner
92
Voted
JSAC
2007
177views more  JSAC 2007»
14 years 9 months ago
Achieving Shared Protection for Dynamic Multicast Sessions in Survivable Mesh WDM Networks
— The advances in wavelength-division multiplexing (WDM) technology are expected to facilitate bandwidth-intensive multicast applications. A single fiber failure in such a netwo...
Hongbin Luo, Lemin Li, Hongfang Yu, Sheng Wang