IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer A 1999
DOI: 10.1109/infcom.1999.752161
|View full text |Cite
|
Sign up to set email alerts
|

Fair bandwidth sharing among adaptive and non-adaptive flows in the Internet

Abstract: The problem of fair bandwidth sharing among adaptive (TCP) and non-adaptive (i.e. CBR-UDP) flows at an Internet gateway is considered. An algorithm that drops packet preventively, an an attempt to actively penalize the non-adaptive traffic that attempts to "steal" buffer space, and therefore bandwidth f r o m the adaptive trafic flows, is presented. The algorithm maintains minimal Bow state information and is therefore scalable. The performance of the algorithm is compared with other gateway algorithms and it … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
41
0
5

Year Published

2000
2000
2017
2017

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 77 publications
(46 citation statements)
references
References 7 publications
0
41
0
5
Order By: Relevance
“…Examples of heuristic schemes are RED [6], gentle RED (GRED) [11], adaptive RED (ARED) [12], parabola RED [13], hyperbola RED (HRED) [14], dynamic RED [15], flow RED [16], stabilized RED [17], balanced RED [18], BLUE [19], Yellow [20] etc. These algorithms aimed to improve some or all of the features, such as fairness, stability, network utilization, packet loss and adaptability for different traffic loads.…”
Section: Related Workmentioning
confidence: 99%
“…Examples of heuristic schemes are RED [6], gentle RED (GRED) [11], adaptive RED (ARED) [12], parabola RED [13], hyperbola RED (HRED) [14], dynamic RED [15], flow RED [16], stabilized RED [17], balanced RED [18], BLUE [19], Yellow [20] etc. These algorithms aimed to improve some or all of the features, such as fairness, stability, network utilization, packet loss and adaptability for different traffic loads.…”
Section: Related Workmentioning
confidence: 99%
“…In other words, it performed downstream network traffic shaping and implemented what we have denoted in this paper as inbound service provision. This packet processing chain was retained, in its original capacity, in the NIProxy's current software architecture 2 . We therefore would like to refer the reader to our previous work [12] for a comprehensive discussion of the chain's exact mode of operation and refrain ourselves in this paper to a succinct review of the responsibilities of the main software components it links together.…”
Section: Original Designmentioning
confidence: 99%
“…Work in the network traffic shaping context is however not limited to theoretical research. Interesting examples of concrete systems and frameworks include the Exact Bandwidth Distribution Scheme (X-BDS) [6] and the bandwidth sharing algorithm presented in [2]. The NIProxy's multimedia service provision mechanism on the other hand is largely related to the Service Oriented Architecture (SOA) paradigm and hence shares many of its underlying principles and resulting advantages [10].…”
Section: Related Workmentioning
confidence: 99%
“…Interesting work in this BB context includes, for instance, the GARA architecture [2], the ARM approach [3], the transcoding protocol described in [4] and the QoS management framework proposed in [5]. Examples of network resource management in network architectures other than DiffServ are for instance presented in [6], [7], [8] and [9]. The NIProxy distinguishes itself from these approaches in that the latter are concerned with Quality of Service (QoS) provision (i.e.…”
Section: Related Workmentioning
confidence: 99%