Sciweavers

23 search results - page 2 / 5
» Earliest Arrival Flows in Networks with Multiple Sinks
Sort
View
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 6 months ago
Polymatroids with Network Coding
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
Te Sun Han
BIRTHDAY
2006
Springer
13 years 9 months ago
Optimal Flow Distribution Among Multiple Channels with Unknown Capacities
Consider a simple network flow problem in which there are n channels directed from a source to a sink. The channel capacities are unknown and we wish to determine a feasible netwo...
Richard M. Karp, Till Nierhoff, Till Tantau
IOR
2007
89views more  IOR 2007»
13 years 5 months ago
Fast, Fair, and Efficient Flows in Networks
Abstract. We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions ar...
José R. Correa, Andreas S. Schulz, Nicol&aa...
INFOCOM
1993
IEEE
13 years 10 months ago
A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case
Worst-casebounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of Generalized Processor Sharing (GPS) 10] servers. The inhe...
Abhay K. Parekh, Robert G. Gallager
GLOBECOM
2008
IEEE
14 years 8 days ago
On Traffic Long-Range Dependence at the Output of Schedulers with Multiple Service Classes
 Long-range dependence (LRD) is a widely verified property of Internet traffic, which severely impacts network performance yielding longer queuing delays. Moreover, LRD is almos...
Stefano Bregni, Paolo Giacomazzi, Gabriella Saddem...