Sciweavers

2343 search results - page 354 / 469
» The Locomotive Routing Problem
Sort
View
161
Voted
JSAC
2007
121views more  JSAC 2007»
15 years 4 months ago
Spare Capacity Allocation in Two-Layer Networks
Abstract— In this paper we consider the problem of provisioning spare capacity in two-layer backbone networks using shared backup path protection. First, two spare capacity alloc...
Yu Liu, David Tipper, K. Vajanapoom
COR
2004
111views more  COR 2004»
15 years 4 months ago
Multiple multicast tree allocation in IP network
The multicasting is defined as the distribution of the same information stream from one to many nodes concurrently. There has been an intensive research effort to design protocols...
Chae Y. Lee, Hee K. Cho
134
Voted
ANOR
2010
112views more  ANOR 2010»
15 years 3 months ago
Online stochastic optimization under time constraints
This paper considers online stochastic optimization problems where uncertainties are characterized by a distribution that can be sampled and where time constraints severely limit t...
Pascal Van Hentenryck, Russell Bent, Eli Upfal
NSDI
2008
15 years 7 months ago
Studying Black Holes in the Internet with Hubble
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
Ethan Katz-Bassett, Harsha V. Madhyastha, John P. ...
INFOCOM
2009
IEEE
15 years 11 months ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...