888 search results - page 140 / 178 » Capacity of Arbitrary Wireless Networks |
SIAMCOMP
1998
13 years 8 months ago
1998
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
ICDCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Abstract— In this paper, we explore multi-hop bandwidth estimation assuming arbitrary cross-traffic at each node and develop a new probing method called Envelope that can asympt...
IPTPS
2003
Springer
14 years 2 months ago
2003
Springer
– In this paper, we first describe the concept of data overlay, which is a mechanism to implement arbitrary data structure on top of any structured P2P DHT. With this ion, we dev...
SCN
2011
Springer
13 years 3 months ago
2011
Springer
An inelastic flow is a flow with inelastic rate: i.e., the rate is fixed, it cannot be dynamically adjusted to traffic and load condition as in elastic flows like TCP. Real ti...