跳到主要內容

臺灣博碩士論文加值系統

(44.200.194.255) 您好!臺灣時間:2024/07/22 01:09
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:吳忠興
研究生(外文):Chung-Hsing Wu
論文名稱:一個處理不當高頻寬串流之改良式RED方法
論文名稱(外文):An Improved RED Scheme For Handling Misbehaved High-bandwidth Flows
指導教授:陳耀宗陳耀宗引用關係
指導教授(外文):Yaw-Chung Chen
學位類別:碩士
校院名稱:國立交通大學
系所名稱:資訊工程系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:英文
論文頁數:45
中文關鍵詞:動態緩衝區管理趨近公平性
外文關鍵詞:active queue managementapproximate fairness
相關次數:
  • 被引用被引用:0
  • 點閱點閱:241
  • 評分評分:
  • 下載下載:10
  • 收藏至我的研究室書目清單書目收藏:0
RED機制是一種著名的動態緩衝區管理(active queue management)的機制,可以用來控制網路上的擁塞狀況,而且RED機制已經被推薦必須廣泛地應用在網際網路的路由器上。然而在網路發生擁塞的時期,RED機制並不能夠保護那些有著良好行為的網路資料流(和TCP協定相容的網路資料流)免於受到有些使用高頻寬且有著錯誤行為的網路資料流(包括那些沒有使用擁塞控制機制的網路資料流,以及那些有著不好的TCP協定實作的網路流量)的傷害。我們提出了一種新的機制來改善RED機制的能力,使得改善後的RED機制能夠處理那些使用高頻寬且有著錯誤行為的網路資料流。由實驗模擬後所得到的結果中可以觀察到我們所提出的機制成功地分辨出那些使用高頻寬且有著錯誤行為的網路資料流,並且加以懲罰。此外,從模擬實驗的結果中,我們發現所提出的方法對於所有共同競爭的網路資料流可以達到趨近公平性的效果。

The Random Early Detection (RED) mechanism is a well-known active queue management mechanism that was related to congestion control. And the RED mechanism has been recommended to be deployed in the Internet router. However, the RED mechanism cannot protect well-behaved flows (i.e. TCP-compatible flows) against the high-bandwidth misbehaving flows, these include flows that do not use congestion avoidance mechanism and flows with poorly implemented TCP protocol, during periods of congestion. We proposed a new mechanism to improve RED’s functionality to deal with the high-bandwidth misbehaving flows. The simulation results show that our proposed mechanism can successfully identify and penalize the high-bandwidth misbehaving flows. Besides, from those simulation results, we could find that our proposed mechanism can achieve approximate fairness among all competing flows.

中文摘要 .....................................................i
Abstract ....................................................ii
Acknowledgement ............................................iii
Table of Contents ...........................................iv
List of Figures .............................................vi
Chapter 1. Introduction ......................................1
Chapter 2. Related Work ......................................4
2.1. Random Early Detection ................................4
2.1.1. The Objective of the RED Mechanism ................4
2.1.2. The Algorithm of the RED Mechanism ..............4
2.2. The Serious Problem of the RED Mechanism .......8
Chapter 3. Proposed Scheme ..................................12
3.1. Objective of the Proposed Scheme .....................12
3.2. Overview of the Proposed Scheme ......................12
3.3. Identification Process ...............................14
3.3.1. Collecting Evidence ..............................15
3.3.2. Determine an identified misbehaving flow .........19
3.4. Penalization Process .................................24
3.4.1. Penalize for a Fixed Period ......................24
3.4.2. Penalization Mechanism ...........................27
3.5. The Full Flowchart of Our Proposed Scheme ............28
3.6. Some Related Issues ..................................29
Chapter 4. Simulation Results ...............................31
4.1. Comparison with DropTail and RED .....................31
4.1.1. Single High-bandwidth Misbehaving Flow ...........31
4.1.2. Multiple high-bandwidth misbehaving flows ........36
4.2. Comparison with CHOKe ................................39
4.2.1. Single Bottleneck Link ...........................39
4.2.2. Multiple bottleneck links ........................40
Chapter 5. Conclusion .......................................43
References ..................................................44

[1] Braden, B., Clark, D., Crowcroft, J., Davie, B., Deering, S., Estrin, D., Floyd, S., Jacobson, V., Minshall, G., Partridge, C., Peterson, L., Ramakrishnan, K., Shenker, S., Wroclawski, J., Zhang, L., “Recommendations on queue management and congestion avoidance in the internet”, IETF RFC 2309, April 1998.
[2] Floyd, S. and Jacobson, V., “Random Early Detection Gateways for Congestion Avoidance”, IEEE/ACM Transaction on Networking, vol.1, no.4, pp.397-413, August 1993.
[3] Pan, R., Prabhakar, B., Psounis, K., “CHOKe: A stateless active queue management scheme for approximating fair bandwidth allocation”, IEEE INFOCOM 2000, pp.942-951, March 2000.
[4] Floyd, S. and Fall, K., “Promoting the Use of End-to-End Congestion Control in the Internet”, IEEE/ACM Transaction on Networking, vol.7, no.4, pp.458-472, August 1999.
[5] Lin, D. and Morris, R., “Dynamics of Random Early Detection”, Proceedings of ACM SIGCOMM 97, pp.127-137, October 1997.
[6] A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a fair queueing algorithm”, Journal of Internetworking Research and Experience, October 1990.
[7] LBNL Network Research Group, UCB/LBNL/VINT Network Simulator — ns (version 2), September 1997.
[8] McKenny, P., “Stochastic Fairness Queueing”, Proceedings of INFOCOM 90, pp. 733-740.
[9] M. Shreedhar and G. Varghese. “Efficient fair queueing using deficit round robin”, Proceedings of SIGCOMM 95, pp.231-243, September 1995.
[10] Stevens, W., “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms”, IETF RFC 2001, January 1997.
[11] Manin, A. and Ramakrishnan K., “Gateway Congestion Control Survey”, IETF RFC 1254, August 1991.

QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top