Sciweavers

61 search results - page 5 / 13
» Approximation Algorithms for Survivable Optical Networks
Sort
View
COCOON
2005
Springer
14 years 1 months ago
Bicriteria Network Design via Iterative Rounding
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
Piotr Krysta
SAGT
2009
Springer
140views Game Theory» more  SAGT 2009»
14 years 2 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
ANSS
2005
IEEE
14 years 1 months ago
Approximation Techniques for the Analysis of Large Traffic-Groomed Tandem Optical Networks
We consider a traffic-groomed optical network consisting of N nodes arranged in tandem. This optical network is modeled by a tandem queueing network of multi-rate loss queues with...
Alicia Nicki Washington, Chih-Chieh Hsu, Harry G. ...
INFOCOM
2003
IEEE
14 years 24 days ago
Protection Mechanisms for Optical WDM Networks based on Wavelength Converter
Abstract— This paper studies the problem of designing survivable optical wavelength division multiplexed (WDM) networks. A wavelength-routed wide area backbone network supporting...
Sunil Gowda, Krishna M. Sivalingam
IAT
2005
IEEE
14 years 1 months ago
Dynamic Lightpath Protection in WDM optical Networks Using Ant-based Mobile Agents
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
Son-Hong Ngo, Xiaohong Jiang, Susumu Horiguchi