290 search results - page 3 / 58 » Network as a Computer: Ranking Paths to Find Flows |
LCN
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, we introduce statistical methods to estimate the stability of paths in a mobile wireless ad hoc environment. Identifying stable paths helps to reduce control trafï¬...
INFOCOM
1997
IEEE
13 years 9 months ago
1997
IEEE
Due to the increasing reliance of our society on the timely and reliable transfer of large quantities of information (suchas voice, data, and video)across high speed communication...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We study the edge-disjoint escape problem in grids. Given a set of n sources in a two-dimensional grid, the problem is to connect all sources to the grid boundary using a set of n...
COMCOM
2006
13 years 5 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...