Sciweavers

570 search results - page 88 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
FOCS
2008
IEEE
14 years 3 months ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
ADHOC
2007
122views more  ADHOC 2007»
13 years 9 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
INFOCOM
2006
IEEE
14 years 2 months ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe
TON
2002
75views more  TON 2002»
13 years 8 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
TMC
2010
85views more  TMC 2010»
13 years 7 months ago
Juggler: Virtual Networks for Fun and Profit
—There are many situations in which an additional network interface—or two—can provide benefits to a mobile user. Additional interfaces can support parallelism in network flo...
Anthony J. Nicholson, Scott Wolchok, Brian D. Nobl...