A New Queueing Algorithm for Improving Fairness between TCP Flows 


Vol. 11,  No. 2, pp. 235-244, Apr.  2004
10.3745/KIPSTC.2004.11.2.235


PDF
  Abstract

TCP Vegas version provides better performance and more stable services than TCP Tahoe and Reno versions, which are widely used in the current Internet. However, in the situation where TCP Vegas and Reno share the bottleneck link, the performance of TCP Vegas is much smaller than that of TCP Reno. This unfairness is due to the difference of congestion control mechanisms of each TCP use. Several studies have been executed in order to solve this unfairness problem. In this paper, we analyze the minimum window size to maintain the maximum TCP performance of link bandwidth. In addition, we propose an algorithm which maintains the TCP performance and improves fairness by selective packet drops in order to allocate proper window size of each TCP connections. To evaluate the performance of the proposed algorithm, we have measured the number of data bytes transmitted between end-to-end systems by each TCP connections. The simulation results show that the proposed algorithm maintains the maximum TCP performance and improves the fairness.

  Statistics
  Cite this article

[IEEE Style]

C. H. Seog and C. M. Lyeol, "A New Queueing Algorithm for Improving Fairness between TCP Flows," The KIPS Transactions:PartC, vol. 11, no. 2, pp. 235-244, 2004. DOI: 10.3745/KIPSTC.2004.11.2.235.

[ACM Style]

Chae Hyeon Seog and Choe Myeong Lyeol. 2004. A New Queueing Algorithm for Improving Fairness between TCP Flows. The KIPS Transactions:PartC, 11, 2, (2004), 235-244. DOI: 10.3745/KIPSTC.2004.11.2.235.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals