1639 search results - page 7 / 328 » Degree-constrained network flows |
APNOMS
2006
Springer
14 years 1 months ago
2006
Springer
It is widely recognized that today's Internet traffic is mostly carried by a relatively small number of elephant flows while mice flows constitute up to 80% of all active flow...
PAM
2011
Springer
13 years 19 days ago
2011
Springer
In this paper, we characterize, quantify, and correct timing errors introduced into network flow data by collection and export via Cisco NetFlow version 9. We find that while som...
FSTTCS
2009
Springer
14 years 4 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
GLOBECOM
2010
IEEE
13 years 7 months ago
2010
IEEE
We investigate flow rate optimization on a wireless link with randomly varying channel gain using techniques from adaptive modulation and network utility maximization. We consider ...
JCT
2011
13 years 4 months ago
2011
We prove a strong version of the the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to e...