A new queue management scheme for AIMD based flows with proportional fair scheduling in wireless networks

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 394
  • Download : 0
In this paper, we studied the interaction between the proportional fair (PF) scheduling, one of the most popular wireless packet scheduling algorithms, and the additive increase and multiplicative decrease (AIMD) flow control algorithm such as in TCP. The PF scheduler is known to achieve not only efficiency but also fairness in wireless packet networks. Since TCP is one of the most popular transport protocols, understanding the interaction between them is worthwhile. We found out that with the AIMD control, the PF scheduling may not achieve the expected fairness and efficiency when channel conditions of users are not similar. To resolve the issue, we proposed a new queue management scheme, called"proportional queue management scheme". By isolating flows and setting queue thresholds proportional to their channel quality, the efficiency and fairness are both improved significantly. The simulation results with NS-2 confirmed the effectiveness of our algorithm.
Advisors
Mo, Jeong-Hoon모정훈
Description
한국정보통신대학교 : 공학부,
Publisher
한국정보통신대학교
Issue Date
2007
Identifier
392862/225023 / 020054700
Language
eng
Description

학위논문(석사) - 한국정보통신대학교 : 공학부, 2007.8, [ viii, 56 p. ]

Keywords

AIMD; Buffer Management; Fairness; Proportional Fair Scheduling; Efficiency

URI
http://hdl.handle.net/10203/54882
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392862&flag=dissertation
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0