Sciweavers

80 search results - page 1 / 16
» Fast, Fair, and Efficient Flows in Networks
Sort
View
IOR
2007
89views more  IOR 2007»
13 years 3 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...
ICNP
1999
IEEE
13 years 8 months ago
An In-Depth Look at Flow Aggregation for Efficient Quality of Service
We investigate the preservation of quality of service guarantees to a flow of packets in the presence of flow aggregation. For efficiency, multiple flows, known as the constituent...
Jorge Arturo Cobb
COMCOM
1999
141views more  COMCOM 1999»
13 years 3 months ago
A flow control scheme on ATM networks with max-min fairness
Asynchronous Transfer Mode (ATM) does not guarantee Quality of Service (QoS) for Available Bit Rate (ABR) service type during connection establishment. The bandwidth left for ABR ...
W. K. Lai, J.-Y. Tsai
ICNP
1996
IEEE
13 years 7 months ago
Time-Shift Scheduling: Fair Scheduling of Flows in High Speed Networks
Abstract-- We present a scheduling protocol, called TimeShift Scheduling, to forward packets from multiple input flows to a single output channel. Each input flow is guaranteed a p...
Jorge Arturo Cobb, Mohamed G. Gouda, Amal El-Nahas
TON
2008
120views more  TON 2008»
13 years 3 months ago
Centralized and distributed algorithms for routing and weighted max-min fair bandwidth allocation
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
Miriam Allalouf, Yuval Shavitt