Access Restriction

Author Aldabbagh, G. ♦ Rio, M. ♦ Darwazeh, I.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2010
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword fairness ♦ Aggregates ♦ bandwidth ♦ Bandwidth ♦ Tin ♦ active queue management ♦ Complexity theory ♦ Inductors ♦ Delay ♦ interaction of TCP and UDP ♦ Core network
Abstract In this paper, we present the Fair Early Drop (FED) scheme which aims to prevent the unfairness problem generated by unresponsive flows and treat the various kinds of transport traffic “fairly”. Unresponsive flows are managed by making sure they do not consume more than their fair share of network resources; that is, by dropping more packets from them. The dropping decision is simple with O(1) complexity. To reduce queuing delays, FED starts dropping packets once a flow exceeds its fair share of queuing space and does not wait until the queue is full to start dropping packets. FED has shown not only to be able to handle unresponsive traffic, but also to improve the fairness among TCP connections, maximize link utilization and minimize jitter and queuing delay.
ISBN 9781424475476
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2010-06-29
Publisher Place United Kingdom
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
e-ISBN 9781424475483
Size (in Bytes) 831.50 kB
Page Count 8
Starting Page 2668
Ending Page 2675

Source: IEEE Xplore Digital Library