Sciweavers

1388 search results - page 20 / 278
» Approximability of Robust Network Design
Sort
View
ICALP
2005
Springer
14 years 1 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...
CORR
2011
Springer
179views Education» more  CORR 2011»
12 years 11 months ago
Approximating minimum-power edge-multicovers
Given a graph with edge costs, the power of a node is the maximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by appli...
Nachshon Cohen, Zeev Nutov
CONEXT
2010
ACM
13 years 5 months ago
Balancing throughput, robustness, and in-order delivery in P2P VoD
Peer-to-peer has emerged in recent years as a promising approach to providing Video-on-Demand streaming. The design space, however, is vast and still not well understood--yet choo...
Bin Fan, David G. Andersen, Michael Kaminsky, Kons...
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
INFOCOM
2002
IEEE
14 years 12 days ago
Increasing robustness of fault localization through analysis of lost, spurious, and positive symptoms
—This paper utilizes belief networks to implement fault localization in communication systems taking into account comprehensive information about the system behavior. Most previo...
Malgorzata Steinder, Adarshpal S. Sethi