For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Packet Discarding Scheme Considering Both Instantaneous and Historical Use of Network Resources
Norio YAMAGAKI Katsuya MINAMI Hideki TODE Koso MURAKAMI
IEICE TRANSACTIONS on Communications
Publication Date: 2001/08/01
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Internet Technology)
Category: Flow and Congestion Control
Internet router, transfer completion time, backlogged packet in the buffer, flow succession time,
Full Text: PDF>>
In the future Internet, various kinds of services will rapidly increase its volume and require different qualities. Thus, it is main technical problem to guarantee various QoS to each connection. However, in the current IP networks where most applications use TCP as transport protocol, most typical packet discarding scheme, RED (Random Early Detection), causes unfairness such as the difference of bandwidth sharing among flows traversing the same router. To dissolve this problem, we consider that two viewpoints are important associated with flow-base fairness. One is instantaneous flow condition and the other is historical flow condition. In this paper, we propose the packet discarding scheme considering both instantaneous and historical use of network resources for the purpose of dissolving unfairness of each flow and improving the flow-base QoS. We call this proposal method "Random Early Drop with Dual-fairness metrics (DRED). " DRED can improve whole throughput and transfer completion time of information such as a file, etc.