跳到主要內容

臺灣博碩士論文加值系統

(54.172.135.8) 您好!臺灣時間:2022/01/18 15:36
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

: 
twitterline
研究生:姜景娟
研究生(外文):Ching-Chuan Chiang
論文名稱:co-DRR:在無線區域網路上整合上傳與下傳排程的頻寬管理
論文名稱(外文):co-DRR: An Integrated Uplink and Downlink Scheduler for Bandwidth Management over Wireless LANs
指導教授:李嘉晃李嘉晃引用關係林盈達林盈達引用關係
指導教授(外文):Chia-Hoang LeeYing-Dar Lin
學位類別:碩士
校院名稱:國立交通大學
系所名稱:資訊科學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2002
畢業學年度:90
語文別:英文
論文頁數:30
中文關鍵詞:排程公平頻寬管理餘額累積式輪循法802.11
外文關鍵詞:schedulingfairnessbandwidth managementdeficit round robin802.11
相關次數:
  • 被引用被引用:0
  • 點閱點閱:312
  • 評分評分:
  • 下載下載:18
  • 收藏至我的研究室書目清單書目收藏:1
在有線網路瓶頸連線上已經存在許多有效利用頻寬資源的分配方式。隨著無線網路環境快速的演進,有效分配目前無線區域網路IEEE 802.11標準環境下的頻寬是一個值得探討的議題。但目前針對無線頻寬管理議題的討論多為最佳化多媒體資料傳輸、單獨上傳或下傳的頻寬管理或是與IEEE 802.11標凖不相容的頻寬管理方式。因此我們提出一個利用deficit round robin (DRR)和distributed-DRR (DDRR)演算法整合上下傳的頻寬流量計算且相容於IEEE 802.11標準的頻寬管理機制以保障每一個使用者獲得的頻寬。並使用PCF mode機制,利用非競爭時期來補足競爭時期所造成的不公平現象。從模擬的結果可以看出,在多台機器(100台)或是高位元錯誤率(0.0001)的測試環境下,分配給每位使用者的上下傳的頻寬量不但能達到長期的公平性,且延展性極佳。

Bandwidth management over wired bottleneck links has been an effective method to utilize network resources. For the rapidly emerging Wireless Local Area Network (WLAN) with IEEE 802.11 standard, bandwidth management over the bottlenecked WLAN becomes a new issue. Most possible existing solutions only exclusively focus on optimizing multimedia traffic, pure downlink/uplink fairness, or are incompatible with IEEE 802.11. This study proposes a cooperative deficit round robin (co-DRR), an IEEE 802.11-compatible host-based fair scheduling algorithm based on the deficit round robin (DRR) and distributed-DRR (DDRR) schemes, cooperating the uplink and downlink quantum calculations. With the PCF mode, utilize the contention-free period to complement the unfairness of contention period. With 100 mobile hosts or 0.0001 high bit error rate, simulation results show uplink and downlink bandwidth allocated for hosts not only achieves long-term fairness (CoV< 0.01) but also scales well.

1. INTRODUCTION 1
2. BACKGROUND 4
2.1 IEEE 802.11 WLAN Standard 4
2.2 Deficit Round Robin (DRR) 7
2.3 Distributed Deficit Round Robin (DDRR) 7
3. COOPERATIVE DEFICIT ROBIN 9
3.1 Assumptions and Objectives 9
3.2 Architecture 9
3.3 Algorithm 11
3.3.1 Polling List Manager 11
3.3.2 Downlink Manager 12
3.3.3 Synchronization Mechanism 13
3.3.4 Head of Line (HOL) Blocking 14
3.3.5 Pseudo Code 15
3.4 A Running Example 16
4. SIMULATION AND NUMERICAL RESULTS 18
4.1 Simulation Environment 18
4.2 Baseline Experiments 19
4.3 Effectiveness of Bandwidth Allocation 20
4.4 Scalability of co-DRR 22
4.5 Impact of Burst Errors 24
5. CONCLUSION AND FUTURE WORK 27

[1] M. Shreedhar, George Varghese, “Efficient fair queueing using deficit round robin,” ACM SIGCOMM’95, Page(s):231-242 v.25 n.4, Oct. 1995.
[2] Sally Floyd , Van Jacobson, “Link-sharing and resource management models for packet networks,” IEEE/ACM Transactions on Networking (TON ‘95), Page(s): .365-386, v.3 n.4, Aug. 1995.
[3] Pawan Goyal , Harrick M. Vin , Haichen Cheng, “Start-time fair queueing,” IEEE/ACM Transactions on Networking (TON ‘97), Page(s): 690-704, v.5 n.5, Oct. 1997.
[4] Aad, I., Castelluccia, C., “Introducing service differentiation into IEEE 802.11,” IEEE ISCC’00, Page(s): 438 -443, July 2000.
[5] P. Bhagwat, P. Bhattacharya, A. Krishma and S. Tripathi, “Enhancing throughput over wireless LANs using channel state dependent packet scheduling,” IEEE INFOCOM’97, Page(s): 1133-1140 v.3, April 1996
[6] M. Srivastava, C. Fragouli, V.Sivaraman, “Controlled Multimedia Wireless Link Sharing via Enhanced Class-Based Queuing with Channel-State-Dependent Packet Scheduling,” IEEE INFOCOM’98, Page(s): 572-580 v.2, March 1998.
[7] T. Nandagopal, S. Lu, V. Bharghavan, “A Unified Architecture for the Design and Evaluation of Wireless Fair Queueing Algorithms,” ACM MOBICOM’99, Page(s): 132-142, Aug. 1999.
[8] D. Eckhardt and P. Steenkiste, “Effort Limited Fair (ELF) Scheduling for Wireless Networks,” IEEE INFOCOM'00, Page(s): 1097-1106 v.3, March 2000.
[9] S. Lu, V. Bharghavan, R. Srikant, “Fair scheduling in wireless packet networks,” ACM SIGCOMM’97, Page(s): 63-74, Oct. 1997.
[10] T. S. E. Ng, I. Stoica, and H. Zhang, “Packet fair queueing algorithms for wireless networks with location-dependent errors,” IEEE INFOCOM '98, Page(s): 1103 —1111, v.3, March 1998.
[11] ISO/IEC and IEEE Draft International Standards, “Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications,” ISO/IEC 8802-11, IEEE P802.11/D10, Jan. 1999.
[12] Ranasinghe, R.S.; Andrew, L.L.H.; Everitt, D.,”Impact of polling strategy on capacity of 802.11 based wireless multimedia LANs,” IEEE ICON’99, Page(s): 96 —103, Sept. 1999.
[13] M. Shreedhar, George Varghese, “Efficient fair queueing using deficit round robin,” ACM SIGCOMM’95, Page(s): 231-242, v. 25 n. 4, Oct. 1995
[14] ns2: network simulator version 2.1b8a , June 25 2001, http://www.isi.edu/nsnam/ns/
[15] D. Newman, “Benchmarking Terminology for Firewall Performance,” August 1999, RFC2647
[16] B. Bing. “Measured Performance of the IEEE 802.11 Wireless LAN,” IEEE LCN'99, Page(s): 34 -42, October 1999.
[17] GILBERT E.N., “Capacity of a Burst-Noise Channel,” Bell Syst. Tech. Journ., Page(s): 1253-1265, v. 39, Sept. 1960

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