Sciweavers

1639 search results - page 145 / 328
» Degree-constrained network flows
Sort
View
IPCO
1998
87views Optimization» more  IPCO 1998»
15 years 5 months ago
Simple Generalized Maximum Flow Algorithms
We introduce a gain-scaling technique for the generalized maximum ow problem. Using this technique, we present three simple and intuitive polynomial-time combinatorialalgorithms fo...
Éva Tardos, Kevin D. Wayne
142
Voted
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
15 years 4 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
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...
Yonatan Aumann, Yuval Rabani
ICC
2007
IEEE
120views Communications» more  ICC 2007»
15 years 10 months ago
Fixed-Period Packet Sampling and its Application to Flow Rate Estimation
Abstract— We propose a packet sampling strategy called fixedperiod sampling, which selects at most one packet in every fixedlength period. Under the fixed-period sampling, the...
Sadayoshi Ito, Kousuke Uchiyama, Shigeo Shioda
ANOR
2004
170views more  ANOR 2004»
15 years 4 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
USS
2008
15 years 6 months ago
Proactive Surge Protection: A Defense Mechanism for Bandwidth-Based Attacks
Large-scale bandwidth-based distributed denial-of-service (DDoS) attacks can quickly knock out substantial parts of a network before reactive defenses can respond. Even traffic flo...
Jerry Chi-Yuan Chou, Bill Lin, Subhabrata Sen, Oli...