19 search results - page 1 / 4 » A Probabilistic Approach for Achieving Fair Bandwidth Alloca... |
NCA
2005
IEEE
13 years 10 months ago
2005
IEEE
The fair bandwidth allocations can isolate flows and protect well-behaved flows from ill-behaved ones. CSFQ (Core Stateless Fair Queueing) achieves the approximate fairness by d...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
— This paper describes and evaluates a probabilistic packet scheduling (PPS) algorithm for providing different levels of service to TCP flows. With our approach, each router deï...
QOSIP
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present a novel approach to the congestion control and resource allocation problem of elastic and real-time traffic in telecommunication networks. With the concep...
LCN
2003
IEEE
13 years 9 months ago
2003
IEEE
Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in the current network architecture research. The IntServ approaches achieve thos...
NETWORKING
2000
13 years 5 months ago
2000
Abstract. We examine the fair allocation of capacity to a large population of best-effort connections in a typical multiple access communication system supporting some bandwidth on...