Responsive image
博碩士論文 etd-0217105-170421 詳細資訊
Title page for etd-0217105-170421
論文名稱
Title
ATM網路上ABR服務之多點傳送機制
Mechanisms on Multipoint Communications for ABR Services on ATM Networks
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
122
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2005-01-21
繳交日期
Date of Submission
2005-02-17
關鍵字
Keywords
單點對多點、群體廣播、多點對單點、虛擬連結合併、直接貫通式、封包排程器、非同步傳輸模式、可用位元速率
ABR, ATM, Multipoint-to-Point, Packet-Scheduler, Cut-Through, Multicast, Point-to-Multipoint, VC-Merge
統計
Statistics
本論文已被瀏覽 5715 次,被下載 0
The thesis/dissertation has been browsed 5715 times, has been downloaded 0 times.
中文摘要
非同步傳輸模式 (Asynchronous Transfer Mode; ATM) 網路已經被部署在傳輸骨幹網路上。ATM 可以用來傳送多種型態的網路資料,例如語音 (voice)、影像 (video)、與純資料 (data)。可用位元速率 (Available Bit Rate; ABR) 服務是ATM所提供之六種服務中的其中一種,目前它正被廣泛地研究中,尤其是它的封閉迴路回饋控制 (closed loop feedback control) 特性。ABR服務支援兩種連結型態: 單點傳輸 (或點對點傳送; unicast) 與多點傳輸 (或群體廣播; multicast)。此外,也具有三種多點傳輸 (multicast) 的連結型態: 單點對多點 (point-to-multipoint)、多點對單點 (multipoint-to-point)、以及多點對多點(multipoint-to-multipoint)。所謂多點通訊 (multipoint communication) 就是指在多個傳送端 (senders) 與多個接收端 (receivers) 之間執行資訊交換,進而形成了一個群體廣播群組 (multicast group)。目前群體廣播應用的例子包括了音訊與視訊會議 (audio and video conferencing)、隨選視訊 (video on demand)、遠端遙測 (tele-metering)、分散式遊戲 (distributed games)、與資料散佈應用 (data distribution)。
在本論文中,我們強調在ABR多點對單點的連結中,佇列與封包排程的管理 (queuing and packet scheduling management)。雖然目前已有多人針對ABR多點對單點連結中的所有ABR傳送端,提出了公平性定義 (fairness definitions),但是,若傳送端的封包是變動長度時,仍會存在有許多的問題,尤其在佇列長度 (queue lengths)、排隊延遲 (queuing delays)、以及流通量 (throughputs) 等三方面。 例如,在合併交換器 (merged switches) 裡,若針對多點對單點連結中所使用之虛擬連結合併 (VC-merge) 方法的本質來看,當一個封包尚未被全部且完整地放入佇列中時,合併交換器是無法傳送此一封包的細胞串流 (cell-stream); 但若佇列中並沒有任何完整的封包存在時,此時合併交換器為求效率上的考量,將會強迫選擇一個不完整的封包 (incomplete packet) 來做直接貫通 (cut-through) 的傳送。因此,若此一交換器此時此刻從一個速度較慢的上游輸入分支中選擇了一個較長的封包來做cut-through 傳送,那麼此時這個合併交換器的輸出埠將會經歷嚴重的流通量震盪 (oscillations)。而且同時,ABR 輸出佇列 (ABR output queue) 也將會經常經歷了較長的佇列長度 (queue length),還有ABR 細胞也同樣地將會經歷較長的排隊延遲。
在本論文中,我們提出了MWTF (最小等待時間優先; Minimum Waiting Time First) 機制,這個機制其架構上是獨立於任何目前現有且已提出的速率分配方法 (rate allocation schemes) 以及與其相互配合的公平性定義。MWTF利用了隨時提供每一個封包的長度給每個合併交換器之機制,來解決了上述中所提到一些問題點。因此,合併交換器中的封包排程器 (packet scheduler) 就可藉此來選擇出一個具最小等待時間的不完整封包來做 cut-through 傳送。模擬結果顯示了當運用了MWTF機制之後,合併交換器將得到較好的效率; 亦即,流通量將不再有嚴重的震盪,且會更加的平穩。此外,細胞 (cell) 在平均上,也經歷了較小且較平順的排隊延遲; 還有,合併交換器本身也將擁有較短的佇列長度,與較平滑的佇列長度變動值。
Abstract
Asynchronous Transfer Mode (ATM) network is being deployed in carrier backbone. ATM can transmit a wide variety of traffic, such as video, voice, and data. Available Bit Rate (ABR) service is one of six ATM services, which is now under intensive research for its closed loop feedback control feature. ABR service supports two types of connections: unicast and multicast. There are also three types of multicast connections: point-to-multipoint, multipoint-to-point, and multipoint-to-multipoint. Multipoint communication is the exchange of information among multiple senders and multiple receivers, forming a multicast group. Examples of multicast applications include audio and video conferencing, video on demand, tele-metering, distributed games, and data distribution applications.
In this dissertation, we focus on queuing and packet scheduling management for multipoint-to-point ABR connections. Although there are so many proposed fairness definitions for all ABR sources in a multipoint-to-point connection, there are still problems about queue lengths, queuing delays, and throughputs, when ABR sources are with variable-length packets. From the nature of VC-merge scheme on merged points in a multipoint-to-point connection, merged switches cannot transmit cell-stream of a packet out until the packet is completely and totally queued. If there is no complete packets queued, the switch can then choose an incomplete packet for cut-through forwarding for efficiency. Therefore, if the switch chooses a long packet from a branch that has smaller cell input rate, for cut-through forwarding, the throughput of output ports will experience severe oscillations. At the same time, ABR queue lengths will be also occupied with severe growth, and ABR cells will be experienced long queuing delays.
We proposed a scheme, named MWTF (Minimum Waiting Time First), which is architecture-independent of any rate allocation schemes and fairness definitions, to resolve the problems by providing length of each packet to merged switches. Thereby the scheduler can choose an appropriate incomplete packet for cut-through forwarding, by selecting the packet that has the smallest packet waiting time. Simulation results show that merged switch has good performances. Throughput will be no severe oscillations and will be getting smoother. Also cells have smaller and smoother queuing delays in average, and the switches have much smaller queue lengths and smoother variations.
目次 Table of Contents
Abstract....................iii
List of Tables..............vii
List of Figures.............viii
Chapter 1. Introduction.....1
1.1 Motivation..............3
1.2 Objectives..............6
1.3 Major Contributions of the Dissertation.........7
1.4 Organizations of the Dissertation...............7
Chapter 2. Background and Survey of Related Work....9
2.1 Fundamentals of ATM Networks....................9
2.1.1 ATM Network Architecture and Reference Model..9
2.1.2 ATM Cell Format...............................11
2.1.3 ATM Connections and Cell Switching............13
2.1.4 Using Ethernet in Existing ATM Networks.......15
2.2 ATM Service Categories and Their QoS and Traffic Parameters........16
2.3 ABR Service and Traffic Management..............20
2.3.1 ABR Flow Control..............................21
2.3.2 General Definition of Max-Min Fairness........27
2.3.3 Rate Allocation Schemes.......................29
2.4 ATM Multicasting................................36
2.4.1 Multipoint-to-Point ABR Connections...........46
2.4.2 Packet Scheduler for Per-Flow Queuing Processing...49
2.4.3 Fairness Definitions of Multipoint-to-Point ABR Connections.......53
Chapter 3. Problem Statement and Methodology........59
3.1 Problem Statement...............................59
3.2 Proposed Scheme.................................63
3.2.1 Transmission of Packet Length.................63
3.2.2 Output Subsystem..............................66
3.2.3 Queuing Subsystem.............................70
3.2.4 Packet Scheduling Subsystem...................73
Chapter 4. Error Recovery...........................77
4.1 Recovery From Lost Data Cells...................77
4.2 Recovery From Lost EoP Cells....................79
4.3 Recovery From Lost FRM cells containing the length information.......82
Chapter 5. Simulation Results and Analysis..........90
5.1 Simulation Environment..........................90
5.2 Performance Analysis............................93
Chapter 6. Conclusions and Future Works.............103
6.1 Conclusions.....................................103
6.2 Future Works....................................104
References..........................................106
參考文獻 References
[AGK+03]J. Auerbach, M. Gopal, M. Kaplan, and S. Kutten, "Multicast Group Membership Management," IEEE/ACM Trans. Networking, vol. 11, issue 1, pp. 166-175, Feb. 2003.
[Arm96]G. Armitage, "Support for Multicast over UNI 3.0/3.1 based ATM Networks," RFC 2022, Nov. 1996.
[ATMa]ATM Forum, ATM Traffic Management Specification v4.1, Tech. Committee, AF-TM-0121.000, Mar. 1999.
[ATMb]ATM Forum, ATM UNI Signaling Specification Version 4.0, Tech. Committee, July 1996.
[ATMc]ATM Forum, ATM UNI Specification Version 4.1, Tech. Committee, Nov. 2002.
[AYS98]M. Reza Ahmadi, K. Yamaoka, and Y. Sakai, "Priority Assignment for Multimedia Multipoint-to-Point Communication," in Proc. 12th Int. Conf. Information Networking, pp. 247-251, Jan. 1998.
[Bau03]M. Baumann, YATS - Yet Another Tiny Simulator (version 0.4), Commun. Lab., Dresden University of Technology, Germany, [online.] Available: http://www.ifn.et.tu-dresden.de/TK/english/yats/yats.html, Oct. 2003.
[BG87]D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, Inc., 1987.
[BJ94]J. Bennett and G. T. D. Jardins, "Comments on the July PRCA Rate Control Baseline," ATM Froum/94-0682, July 1994.
[Bot04]S. D. Bot, "Key Technical Considerations When Using Ethernet Solutions in Existing ATM and Frame Relay Networks," IEEE Commun. Magazine, vol. 42, issue 3, pp. 96-102, Mar. 2004.
[CDF+99]R. Callon, P. Doolan, N. Feidman, A. Frcdcttc, G. Swallow, and A. Viswanathan, "A Framework for Multiprotocol Label Switching," Internet Draft, draft-ietf-mpls-framework-05.txt, Sept. 1999.
[CG00]Chew, J. P. and Gupta, A. K., "Using Dynamic Weights for Improving Fairness in the ATM ABR Service," in Proc. 5th IEEE Symposium on Computers and Commun., pp. 372-377, July 2000.
[CHS+03]Y-T Chin, S. Handa, F. Sasamori, and S. Oshita, "Improve TCP Performance over ATM-UBR with FED," in Proc. IEEE ICC ’03, vol. 3, pp. 1823-1827, May 2003.
[CK99]S. H. Chun and K. S. Kwak, "An Efficient VP Extension Algorithm for ABR Multipoint-to-Point Connection in ATM Networks," in Proc. 5th APCC/OECC, vol. 2, pp. 1227-1230, Oct. 1999.
[Cunn01]Cunningham, D. G., "The Status of the 10-Gigabit Ethernet Standard," in Proc. 27th European Conf. Optical Commun., vol. 3, pp. 364-367, 30 Sept.- 4 Oct. 2001.
[Fah99]Sonia Fahmy, "Traffic Management for Point-to-Point and Multipoint Available Bit Rate (ABR) Service in Asynchronous Transfer Mode (ATM) Networks," Ph. D. Dissertation, the Ohio State Univ., 1999.
[GBO97]Gauthier, E. and Le Boudec, J. -Y., and Oechslin, P., "SMART: A Many-to-Many Multicast Protocol for ATM," IEEE JSAC, vol. 15, issue 3, pp. 458-472, Apr. 1997.
[GR97]Grossglauser, M. and Ramakrishnan, K. K., "SEAM: Scalable and Efficient ATM Multicast," in Proc. IEEE INFOCOM, vol. 2, pp. 867-875, Apr. 1997.
[Guo01]Guo Chuanxiong, "SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks," in Proc. Applications, technologies, architectures, and protocols for computer communications, ACM SIGCOMM Computer Communication Review, vol. 31, issue 4, Aug. 2001.
[Hui95]C. Huitema, Routing in the Internet, Prentice Hall, Inc., 1995.
[HWA03]H. S. Hassanein, Xinhua Weng, and H. Aboelfotoh, "Multi-Objective Optimization Based Flow Control in Multipoint-to-Point Communication," in Proc. IEEE Int. Conf. Performance, Computing, and Commun., pp. 361-368, Apr. 2003.
[Jaf81]Jaffe, J, "Bottleneck Flow Control," IEEE Trans. Commun., vol. 29, issue 7, pp. 954-962, July 1981.
[JDB99]Raj Jain, Arjan Durresi, Gojko Babic, "Throughput Fairness Index: An Explanation," ATM Forum/99-0045, Feb. 1999.
[JKG95]Raj Jain, Shiv Kalyanaraman, Rohit Goyal, Sonia Fahmy, and Fang Lu, "ERICA+: Extensions to the ERICA Switch Algorithm," ATM Forum/95-1346, Oct. 1995.
[JKG96]R. Jain, S. Kalyanaraman, R. Goyal, and S. Fahmy, "ERICA Switch Algorithm: A Complete Description," ATM Froum/96-1172, Aug. 1996.
[KAL01]Jae Young Kim, Byung Jun Ahn, and Hyeong Ho Lee, "Improved VC-merging Method in MPLS Networks," in Proc. Joint 4th IEEE Int. Conf. ATM and High Speed Intelligent Internet Symposium, pp. 28-31, Apr. 2001.
[KCM98]Komandur, S., Crowcroft, J., and Mosse, D., "CRAM: Cell Re-labeling at Merge-Points for ATM Multicast," in Proc. 1st IEEE Int. Conf. ATM, pp. 162-167, June 1998.
[KM95]H. T. Kung and Robert Morris, "Credit-Based Flow Control for ATM Networks," IEEE Network Magazine, vol. 9, no. 2, pp. 40-48, Mar. 1995.
[KM97]S. Komandur and D. Mosse, "SPAM: A Data Forwarding Model for Multipoint-to-Multipoint Connection Support in ATM Networks," in Proc. ICCCN ’97, pp. 383-388, Sept. 1997.
[KZA03]P. Karbhari, E. Zegura, and M. Ammar, "Multipoint-to-Point Session Fairness in the Internet," in Proc. IEEE INFOCOM, vol. 1, pp. 207-217, Mar. 2003.
[LH03]Wei Kuang Lai and Wen-Jiunn Hsiao, "SDRAM: A SD Channel-based Multicast Scheme on ATM Networks for Multimedia Transmissions," IEEE Trans. Broadcasting, vol. 49, no. 2, pp. 192-201, June 2003.
[LHH98]Wei Kuang Lai, Chuang-Chi Hwang, and Wen-Jiunn Hsiao, "A Proportional Feedback Scheme for ATM Networks," Information Sciences, vol. 110, issue 3-5, pp. 237-253, Oct. 1998.
[LPH00]Zhang Lin, Zhao Peng, and Zhang Huimin, "Rate-Based Congestion Control for Multipoint-to-Point ATM ABR Service," in Proc. WCC-Int. Conf. Commun. Technology, vol. 1, pp. 673-776, Aug. 2000.
[MC98]W. M. Moh and Y. Chen, "Design and Evaluation of Multipoint-to-Point Multicast Flow Control," in Proc. SPIE Conf. Performance and Control of Networks Systems II, pp. 143-154, Nov. 1998.
[MD00]J. Mangues-Bafalluy and J. Domingo-Pascual, "Multicast Forwarding over ATM: Native Approaches," IEEE Commun. Surveys & Tutorials, no. 3, pp. 2-11, third quarter 2000.
[MS95]D. E. McDysan and D. L. Spohn, ATM Theory and Application, McGraw-Hill Book Co., 1995.
[NK00]U. T. Nguyen and I. Katzela, "A Flexible Multipoint-to-Point Traffic Control Algorithm for ABR Services in ATM Networks," in Proc. IEEE Conf. High Performance Switching and Routing, pp. 185-194, June 2000.
[PAM01]A. Papadopoulos, T. Antonakopoulos, and V. Makios, "A New Cut-Through Forwarding Mechanism for Supporting ATM Multipoint-to-point Connections," in Proc. IEEE Int. Conf. Networking, July 2001.
[Pao00]D. C. W. Pao, "A Congestion Control Algorithm for Multipoint-to-Multipoint ABR Service in ATM Network," in Proc. IEEE Conf. High Performance Switching and Routing, pp. 167-175. June 2000.
[Pao04]D. Pao, "On-Demand Packet Discard Scheme for TCP over ATM-UBR Service," IEE Proceedings-Communications, vol. 151, issue 3, pp. 190-196, June 2004.
[RSS+98]W. Ren, K-Y Siu, H. Suzuki, and M. Shinohara, "Multipoint-to-Multipoint ABR Service in ATM," Computer Networks and ISDN Systems, vol. 30, issue 19, pp. 1793-1810, Oct. 1998.
[SR99]Stolyar, A. L. and Ramakrishnan, K. K., "The Stability of a Flow Merge Point with Non-Interleaving Cut-Through Scheduling Disciplines," in Proc. IEEE INFOCOM, vol. 3, pp. 1231-1238, Mar. 1999.
[Turn97]J. S. Turner, "Extending ATM Networks for Efficient Reliable Multicast," in Proc. Workshop Commun. and Architectural Support for Network-Based Parallel Computing, pp. 73-97, Feb. 1997.
[UHD02]G. Urvoy-Keller, G. Hèbuterne, and Y. Dallery, "Traffic Engineering in a Multipoint-to-Point Network," IEEE JSAC, vol. 20, issue 4, pp. 834-849, May 2002.
[VFJ+98a]B. Vandalore, S. Fahmy, R. Jain, R. Goyal, M. Goyal, "Generalized Fairness support in Switch Algorithms," ATM Forum/98-0151, Feb. 1998.
[VFJ+98b]B. Vandalore, S. Fahmy, R. Jain, R. Goyal, and M. Goyal, "A Definition of General Weighted Fairness and Its Support in Explicit Rate Switch Algorithms," in Proc. ICNP ’98, pp. 22-30, Oct. 1998.
[VRC+98]Venkateswarau, R., Raghavendra, C. S., Chen, X., and Kumar, V. P., "Support for Multiway Communications in ATM Networks, " in Proc. IEEE ATM Workshop, pp. 339-348, May 1998.
[WE98]Widjaja, I. and Elwalid, A. I., "Performance Issues in VC-merge Capable Switches for IP over ATM Networks," in Proc. IEEE INFOCOM, vol. 1, pp. 372-380, Mar. 1998.
[YZY01]Chan-Hyun Youn, Lin Zhang, and Jaehyoung Yoo, "Fair Pricing Policy for Multipoint-to-Point Service in Internet Wide-Area Network," in Proc. Int. Conf. Info-tech and Info-net, Beijing, vol. 2, pp. 401-412, Oct. 2001.
[ZZ00]Zhang Lin and Zhang Huimin, "An Effective and Fairness Merging Algorithm for Multipoint-to-Point ABR Flow Control in ATM Networks," in Proc. 11th IEEE Int. Symposium on Personal, Indoor and Mobile Radio Commun., vol. 1, pp. 633-638, Sept. 2000.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內校外均不公開 not available
開放時間 Available:
校內 Campus:永不公開 not available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 3.144.202.167
論文開放下載的時間是 校外不公開

Your IP address is 3.144.202.167
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code