Sciweavers

138 search results - page 1 / 28
» Single-Source Stochastic Routing
Sort
View
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 9 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
CORR
2006
Springer
143views Education» more  CORR 2006»
13 years 5 months ago
Efficient Route Tracing from a Single Source
Traceroute is a networking tool that allows one to discover the path that packets take from a source machine, through the network, to a destination machine. It is widely used as a...
Benoit Donnet, Philippe Raoult, Timur Friedman
FOCS
2000
IEEE
13 years 9 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
ESA
2007
Springer
130views Algorithms» more  ESA 2007»
13 years 11 months ago
Convex Combinations of Single Source Unsplittable Flows
In the single source unsplittable flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given digraph. The deman...
Maren Martens, Fernanda Salazar, Martin Skutella
GLOBECOM
2010
IEEE
13 years 3 months ago
Performance-Oriented Routing in Telecommunication Networks
A lot of attention has been devoted to flow routing in networks by the past. Usually, each commodity to be routed is characterized by a single deterministic traffic value. However,...
Hassan Hijazi, Olivier Klopfenstein