Sciweavers

86 search results - page 6 / 18
» Flows in dynamic networks with aggregate arc capacities
Sort
View
CIIT
2004
13 years 9 months ago
Scalable architecture for providing per-flow bandwidth guarantees
Despite numerous efforts, the problem of providing per-flow Quality of Service in a scalable manner still remains an active area of research. This paper introduces a scalable arch...
Vasil Hnatyshin, Adarshpal S. Sethi
CORR
2010
Springer
90views Education» more  CORR 2010»
13 years 6 months ago
An Upper Bound on Multi-hop Transmission Capacity with Dynamic Multipath Routing
This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of...
Yuxin Chen, Jeffrey Andrews
INFOCOM
2003
IEEE
14 years 29 days ago
A Unifying Passivity Framework for Network Flow Control
—Network flow control regulates the traffic between sources and links based on congestion, and plays a critical role in ensuring satisfactory performance. In recent studies, glob...
John T. Wen, Murat Arcak
MMNS
2007
105views Multimedia» more  MMNS 2007»
13 years 9 months ago
Monitoring Flow Aggregates with Controllable Accuracy
In this paper, we show the feasibility of real-time flow monitoring with controllable accuracy in today’s IP networks. Our approach is based on Netflow and A-GAP. A-GAP is a prot...
Alberto Gonzalez Prieto, Rolf Stadler
WEA
2007
Springer
95views Algorithms» more  WEA 2007»
14 years 1 months ago
Experimental Evaluation of Parametric Max-Flow Algorithms
The parametric maximum flow problem is an extension of the classical maximum flow problem in which the capacities of certain arcs are not fixed but are functions of a single par...
Maxim A. Babenko, Jonathan Derryberry, Andrew V. G...