對應IP網路上的既時群播演算法

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：15

、訪客IP：3.141.38.5

姓名

謝明益(Ming-I Hsieh) 查詢紙本館藏

畢業系所

資訊工程學系

論文名稱

對應IP網路上的既時群播演算法
(Algorithms to Real-time Multicast Applications over IP Network)

相關論文

★ 具多重樹狀結構之可靠性群播傳輸	★ 在嵌入式行動裝置上設計與開發跨平台Widget
★ 在 ARM 架構之嵌入式系統上實作輕量化的手持多媒體播放裝置圖形使用者介面函式庫	★ 基於網路行動裝置所設計可擴展的服務品質感知GStreamer模組
★ 針對行動網路裝置開發可擴展且跨平台之GSM/HSDPA引擎	★ 於單晶片多媒體裝置進行有效率之多格式解碼管理
★ IMS客戶端設計與即時通訊模組研發：個人資訊交換模組與即時訊息模組實作	★ 在可攜式多媒體裝置上實作人性化的嵌入式小螢幕網頁瀏覽器
★ 以IMS為基礎之及時語音影像通話引擎的實作:使用開放原始碼程式庫	★ 電子書嵌入式開發: 客制化下載服務實作, 資料儲存管理設計
★ 於數位機上盒實現有效率訊框參照處理與多媒體詮釋資料感知的播放器設計	★ 具數位安全性的電子書開發：有效率的更新模組與資料庫實作
★ 適用於異質無線寬頻系統的新世代IMS客戶端軟體研發	★ 在可攜式數位機上盒上設計並實作重配置的圖形使用者介面
★ Friendly GUI design and possibility support for E-book Reader based Android client	★ Effective GUI Design and Memory Usage Management for Android-based Services

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

近十年來, 人們之間溝通的方式隨著科技的進步迅速地改變中. 隨著快速成長且便宜化的網路頻寬及無線網路的普及, 人們之間溝通的快速地從早期昂貴具特制的設備及架構, 如 H323及PSTN, 移向便宜且通用的架構, 如IP及VoIP. 特別是在peer-to-peer(P2P)架構的想法在提出及普及化後. 隨著更新且便宜的網路架構, 目前一部份幾乎免費的溝通方式己經實現在人們的生活中. 然而在新的架構上, 依然有許多的問題隨著新的架構而出現. 特別是當這類型的網路頻寛是被多種應用同時分享, 在對於每個應用的品質保證上會無法保證且影響到一部份應用的運行. 特別是既時性應用程式無法在long-delay的網路上運作, 這將會造成這類的應用在實現上的困難. 除此之外, 在新型態的P2P架構中, 節點的運作能力將比之前標準的IP network來的多且其頻寛在其運算能力下, 相對地就比較少. 在這方面, 如果有效地利用其特性來轉送封包將會是這類應用服務的另一個難題. 在這篇博士論文中, 作者將專注在這方面的問題來解決提供既時群播應用服務所遇到的部份問題. 在服務品質部份, 由於大多傳輸的瓶頸發生在last-mile(最後一哩的網路), 在這方面我們提供了postgate, LLEPS及QGPS來在無ISP支援的情況下, 保證其封包可以快速地傳輸以提高其服務的品質. 在另一方面, 群播, 作者提供了一個更有效率的演算法以在有限地時間內找出更有效率的傳輸路徑. 基於我們結果, 相信一個便宜且可行的既時群播服務應是可以在現有的IP網路上實現.

摘要(英)

In recent ten years, the communication between people are acculturated quickly. With the rapidly growth and cheaper of network bandwidth and wireless access, the communication was being moved gradually from the dedicated and expensive architecture, e.g. H323 and PSTN switch, to the common and cheaper ones, e.g. IP and VoIP. Especially, the notion of peer-to-peer(P2P) architecure was addressed and become popular in the applications of file distributions and voice communications. With the new cheaper network access and architectures, some almost-free communications between humans are available today. However, in this moment some problems were also incurred from new architectures. Since the cheaper bandwidth are shared and may be used by many applications in the same time, the quality of service for each application is not guaranteed by the service provider. Since the real-time applications could not be able over the long-delay network, it would be a challenge to such applications. Besides, the node in new P2P architecture would obtain more computing power and less bandwidth compared with the traditional PSTN switch. Hence, how to route and forward the packets from the source node to the multiple destinations would be another challenge to provide a real-time multicast services on such network. In this dissertation, the author focuses this issue that supports the real-time multicast applications over Internet. In the quality of service issue, since the bottleneck nodes are located at last-mile in most cases, we provide our solutions, postgate, LLEPS, and QGPS, to guarantee the delay and jitter for the real-time packets without ISP supports. In another issue, multicast delivery, we provide an efficient multicast algorithm which could find out a low cost distribution tree to delivery packets in an acceptable time. Based on our results, a cheap and feasible multicast real-time application should be possible over current Internet.

關鍵字(中)

★ 既時
★ 群播演算法

關鍵字(英)

★ Multicast
★ ADSL Downlink
★ Fair Queuing
★ Steiner Tree

論文目次

1 Introduction 1
1.1 Quality of Service and Fair Queueing . . . . . . . . . . . . . . . . . 4
1.2 Multicast Routing . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
1.3 Organization of this Dissertation . . . . . . . . . . . . . . . . . . . 15
2 Related Work and Background Knowledge 17
2.1 Bandwidth Management for ADSL Downlink . . . . . . . . . . . . . 18
2.1.1 Partition solution (…xed rate solution) . . . . . . . . . . . . 19
2.1.2 Weighted fair queueing solution . . . . . . . . . . . . . . . . 20
2.2 Fair Queueing Algorithms . . . . . . . . . . . . . . . . . . . . . . . 20
2.2.1 General Processor Sharing (GPS) . . . . . . . . . . . . . . . 21
2.2.2 Weighted Fair Queueing (WFQ) . . . . . . . . . . . . . . . . 22
2.2.3 Delay Optimized Worst Case Fair WFQ (WF2Q) Packet
Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
2.2.4 Low Latency Queueing (LLQ) . . . . . . . . . . . . . . . . . 25
2.2.5 De…cit Round Robin (DRR) /Nested De…cit Round Robin
(NDRR) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
2.2.6 A Dynamic Regulation and Scheduling Scheme for Real-
Time Tra￠ c Management (RCSP) . . . . . . . . . . . . . . 27
2.3 Analysis for Alignment Problem of Virtual Time . . . . . . . . . . . 27
2.3.1 Generalize Processor Sharing (GPS) . . . . . . . . . . . . . . 28
2.3.2 Low Bound of Computational Complexity . . . . . . . . . . 31
2.3.3 L-GPS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 32
2.4 Directed Steiner Tree Problem . . . . . . . . . . . . . . . . . . . . . 35
2.4.1 TM Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 36
2.4.2 Charikar et al’s algorithm . . . . . . . . . . . . . . . . . . . 41
2.4.3 Roos’algorithm . . . . . . . . . . . . . . . . . . . . . . . . . 43
I Quality of Service 47
3 ADSL downlink bandwidth management 49
3.1 Postgate . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 49
3.1.1 Throughput estimation . . . . . . . . . . . . . . . . . . . . . 50
3.1.2 Weight estimation . . . . . . . . . . . . . . . . . . . . . . . . 52
3.2 Simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 54
3.2.1 Queueing delay and throughput . . . . . . . . . . . . . . . . 56
3.2.2 Bandwidth, burst index and weight of each class . . . . . . . 59
3.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
4 Scheduler for Real-time Application 63
4.1 The Bu¤er Underrun Problem . . . . . . . . . . . . . . . . . . . . . 64
4.2 Detailed Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . 67
4.3 Simulations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
4.3.1 Bandwidth Reservation . . . . . . . . . . . . . . . . . . . . . 73
4.3.2 Queueing Delay Comparison of LLEPS, SFQ, SCFQ,WF2Q+... 74
4.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 77
5 Analysis for the Alignment Problem of Virtual Time 79
5.1 QGPS: Virtual Time Function and Algorithm . . . . . . . . . . . . 79
5.1.1 Virtual Time Function . . . . . . . . . . . . . . . . . . . . . 80
5.1.2 An algorithm to …nd out the backlogged set in (log n) times 83
5.2 QGPS: Practical Issues and Solutions . . . . . . . . . . . . . . . . . 86
5.2.1 How many bits does a timestamp require? . . . . . . . . . . 87
5.2.2 Fairness and relative deviation . . . . . . . . . . . . . . . . . 91
5.2.3 Bits requirements . . . . . . . . . . . . . . . . . . . . . . . . 95
5.2.4 A Practicable GPS Simulator . . . . . . . . . . . . . . . . . 100
5.3 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 108
II Multicast Routing 109
6 Solutions for the Multicast Distribution Tree 111
6.1 FasterDSP Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . 111
6.1.1 approximation guarantee of the l-restricted Steiner tree . . . 112
6.1.2 Select operator and special graph H . . . . . . . . . . . . . . 117
6.1.3 algorithm to construct a FasterDSP tree . . . . . . . . . . . 118
6.1.4 Approximation Guarantee for 2-level Steiner tree of FasterDSP120
6.2 Algorithm Detail . . . . . . . . . . . . . . . . . . . . . . . . . . . . 120
6.2.1 FasterDSP Vertices Function . . . . . . . . . . . . . . . . . . 122
6.2.2 FasterDSP Forest Function . . . . . . . . . . . . . . . . . . . 123
6.2.3 FasterDSPTree Function . . . . . . . . . . . . . . . . . . . . 125
6.2.4 Analysis for Time Complexity and Space Complexity . . . . 126
6.3 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127
6.4 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130
7 Conclusion 131
References 133

參考文獻

[1] Kademlia, http://en.wikipedia.org/wiki/Kademlia
[2] Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Looking up data in P2P systems. In Communications of the ACM, February 2003.
[3] Moni Naor and Udi Wieder. Novel Architectures for P2P Applications: the Continuous-Discrete Approach. in Proceedings of SPAA, 2003.
[4] Gurmeet Singh Manku. Dipsea: A Modular Distributed Hash Table. Ph. D. Thesis (Stanford University), August 2004.
[5] M.R. Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Freeman, San Francisco (1978).
[6] H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs, Math. Japonica, Vol. 24, pp.573-577 (1980).
[7] L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner trees, Acta Informatica, 15, pp. 141-145 (1981).
[8] J. Turner, "New directions in communications (or which way to the informa tion age?)", IEEE Communication Magazine, Vol. 24, p8-15, Oct. 1986.
[9] P. Winter, Steiner problem in networks: A survey, Networks, 17:129-167 (1987).
[10] V. Jacobson, "Congestion Avoidance and Control", in Proceedings of ACM SIGCOMM, August 1988.
[11] A. Demers, S. Keshav and S. Shenker, "Analysis and simulation of a fair queueing algorithm", in Proceedings of ACM SIGCOMM'89, Vol. 19, Issue 4, Aug. 1989.
[12] M. Bern and P. Plassman, The Steiner problems with edge lengths 1 and 2, Information Processing Letters, 32:171-176 (1989).
[13] L. Zhang, "Virtual clock: a new traffic control algorithm for packet switching networks", in Proceedings of ACM SIGCOMM'90, Vol. 20, Issue 4, Aug. 1990.
[14] A. G. Greenberg and N. Madras, "How Fair is Fair Queueing?", Journal of the Association for Computing Machinery 39, 1992.
[15] A, K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks-the single node case", in Proceedings of IEEE INFOCOM'92, Vol. 2, p914-924, May 1992.
[16] F. K. Hwang, D. S. Richards, P. Winter, The Steiner Tree Problem, North-Holland, 1992.
[17] S. Floyd and V. Jacobson, "Random early detection for congestion avoidance", IEEE/ACM Transactions on Networking, July 1993.
[18] S. J. Golestani, "A self-clocked fair queueing scheme for broadband applications", in Proceedings of IEEE INFOCOM'94, Vol. 2, p636-646, June 1994.
[19] R. Braden and D. Clark, "Integrated Services in the Internet Architecture: An Overview", RFC 1633, July 1994.
[20] P. Berman and V. Ramaiyer, "Improved approximation algorithms for the Steiner tree problem", Journal of Algorithms, 17:381-408 (1994).
[21] I. Stoica, H. Abdel-Wahab. "Earliest Eligible Virtual Deadline First: A Flexible and Accurate Mechanism for Proportional Share Resource Allocation", in Technical Report 95-22, Department of Computer Science, Old Dominion University, Nov. 1995.
[22] M. Karpinsky and A. Zelikovsky, "New approximation algorithms for the Steiner tree problem", Technical Report, Electronic Colloquium on Computational Complexity (ECCC): TR95-030 (1995).
[23] S. Floyd and V. Jacobson, "Link-Sharing and resource management models for packet networks", IEEE/ACM Transactions on Networking, Aug. 1995.
[24] H.F. Salama, "Evaluation of multicast routing algorithms for real-time communication on high-speed networks:, in Proceedings of IFIP Sixth Internation Conference on High Performance Networking, pp.27-42 (1995).
[25] N. Figucra and J. Pasquale, "Leave-in-time: A new service discipline for real-time communication in a packet-switching data network", Proc. SIGCOMM'95, Sept. 1995.
[26] D. Stiliadis and A. Varma, "Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms", in Proceedings of IEEE INFOCOM'96, Vol. 1, p111-119, Mar. 1996.
[27] S. Ramanathan, "Multicast tree generation in networks with asymmetric links", in Proceedings of IEEE INFOCOM'96, IEEE/ACM Transactions on Networking, Vol.4, pp.558-568 (1996).
[28] H. Schulzrinne, S. Casner, R. Frederick and V. Jacobson. "RTP: A Transport Protocol for Real-Time Application", RFC1889, 1996.
[29] M. Mathis et al., "TCP Selective Acknowledgement Options", RFC 2018, Apr. 1996.
[30] J. C. R. Bennet and H. Zhang, "WF2Q:Worst-case FairWeighted Fair Queueing", in Proceedings of IEEE INFOCOM'96, Vol. 1, p120-128, Mar. 1996.
[31] J. L. Rexford, A. G. Greenberg and F. G. Bonomi, "Hardware-efficient fair queueing architectures for high-speed networks", in Proceedings of IEEE INFOCOM'96, Vol. 2, p24-28, Mar. 1996.
[32] M. Shreedhar and George Varghese, "Efficient fair queueing Using de…cit round-robin", IEEE/ACM Transactions on Networking, June 1996.
[33] P. Goyal, H. M. Vin and H. Chen, "Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks", in Proceedings of ACM SIGCOMM'96, Vol. 26, Issue 4, Aug. 1996.
[34] J. C. R. Bennet and H. Zhang, "Hierarchical packet fair queueing algorithms", in Proceedings of ACM SIGCOMM'96, Vol. 26, Issue 4, Aug. 1996.
[35] D. Lin and R. Morris, "Dynamic of Random Early Detection", in Proceedings of ACM SIGCOMM'97, Sept. 1997.
[36] A. Zelikovsky, "A series of approximation algorithms for the Acyclic Directed Steiner Tree problem", Algorithmica, 18:99-110 (1997).
[37] D. Stiliadis and Anujan Varma, "Rate-Proportional Servers: A Design Methodology for Fair Queueing Algorithms", in Proceeding of IEEE/ACM Transactions on Networking, Vol. 6, Issue 2, Apr. 1998.
[38] D. Stiliadis and Anujan Varma, "Efficient Fair Queueing Algorithms for Packet-Switched Networks", IEEE/ACM Transactions on Networking, Vol. 6, Issue 2, Apr. 1998.
[39] D. C. Stephens and H. Zhang, "Implementing distributed packet fair queueing in a scalable switch architecture", in Proceedings of IEEE INFOCOM'98, Vol. 1, p282-290, Mar. 1998.
[40] KJ. Loh, I. Gui and KC. Chua, "Performance of a Linux Implementation of Class Based Queueing", in Proceedings of Computer Communications and Networks, Oct. 1998.
[41] RFC2309, "Recommendations on Queue Management and Congestion Avoidance in the Internet", April 1998.
[42] S. Blake, D. Black, M.Carlson, E. Davies, Z. Wang and W. Weiss, "An architecture for di¤erentiated services", RFC 2475, Dec. 1998.
[43] K. Ramakrishnan and S. Floyd, "A Proposal to Add Explicit Congestions Noti…cation (ECN) to IP", RFC 2481, Jan. 1999.
[44] W. Feng, D. Kandlur, D. Saha, and K. Shin., "A Self-Con…guring RED Gateway", in Proceedings of IEEE INFOCOM'99, Mar. 1999.
[45] M. Charikar, C. Chekuri, T. Cheung, Z. Dai, A. Goel, S. Guha and M. Li, "Approximation Algorithms for Directed Steiner Problems", Journal of Algorithms, vol. 33, pp.73-91 (1999).
[46] D. C. Stephens, J. C. R. Bennet and H. Zhang, "Implementing scheduling algorithms in high-speed networks", IEEE Journal on Selected Areas in Communications(JSAC), Vol. 17, Issue 6, p1145-1158, June 1999.
[47] K. Nichols, V. Jacobson and L. Zhang, "Two-bit di¤erentiated services architecture for the Internet", IETF RFC 2638, July 1999.
[48] Salil S. Kanhere and Harish Sethu, "Fair, Efficient and Low-Latency Packet Scheduling using Nested De…cit Round Robin", in Proceedings of the IEEE Workshop on High-Performance Switching and Routing (HSPR), May 2001
[49] Wu-Chang Feng, Kandlur, D.D., Saha D. and Shin K.G., "Stochastic fair blue: a queue management algorithm for enforcing fairness", in Proceedings of IEEE INFOCOM'01, April 2001.
[50] C. Guo, "SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-service Packet Networks", in Proceedings of ACM SIGCOMM'01, Vol.31, Issue 4, Aug. 2001.
[51] S. Floyd, "A Report on Recent Developments in TCP Congestion Control", IEEE Communications Magazine, April 2001.
[52] Steven Roos, Scheduling for ReMove and other partially connected architectures, Internal Report. (2001)
[53] J. Xu and R. J. Lipton, "On Fundamental Tradeo¤s between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms", in Proceedings of ACM SIGCOMM'02, Vol. 32, Issue 4, Aug. 2002.
[54] Wu-Chang Feng, Shin K.G., Kandlur D. D. and Saha D., "The BLUE active queue management algorithms", IEEE/ACM Transaction on Networking, Aug. 2002.
[55] Leonid Zosin, Samir Khuller, "On Directed Steiner Trees", in Proceedings of SODA'02, pp. 59-63 (2002)
[56] X. Fei and A. Marshall, "Delay Optimized Worst Case Fair WFQ (WF2Q) Packet Scheduling", ICC 2002, IEEE International Conference, 2002.
[57] A. Sayenko, T. Hamalainen, J. Joutsensal and J. Siltanen, "On providing bandwidth and delay guarantees using the revenue criterion based adaptive WFQ", IEEE APCC 2003, Sept. 2003.
[58] Dan Singletary, "ADSL Bandwidth Management HOWTO", The Linux Documentation Project, April 2003.
[59] Aditya Akella, Srinivasan Seshan and Anees Shaikh, "An Empirical Evaluation of WideArea Internet Bottlenecks", in Proceedings of ACM SIGMETRICS'03, June 2003.
[60] Q. Zhao and J. Xu, "On the Computational Complexity of Maintaining GPS Clock in Packet Scheduling", in Proceedings of IEEE INFOCOM'04, Vol. 4, p2383-2392, Mar. 2004.
[61] P. Valente, "Exact GPS Simulation with Logarithmic Complexity, and its Application to an Optimally Fair Scheduler", in Proceedings of ACM SIGCOMM'04, Vol. 34, Issue 4, Aug. 2004.
[62] A. Kortebi, L. Muscariello, S. Oueslati and J. Roberts, "Evaluating the number of active ‡ows in a scheduler realizing fair statistical bandwidth sharing", in Proceedings of ACM SIGMETRICS'05, Vol. 33, Issue 1, June 2005.
[63] M. Karsten, "SI-WF2Q Approximation with Small Constant Execution Overhead - Extended Version", Technical Report CS-2006-01, University of Waterloo, Extended Version of IEEE INFOCOM 2006 Paper, 2006.
[64] Ming-I Hsieh and Eric Hsiao-Kuang Wu, "Postgate: QoS-aware Bandwidth Management for Last-mile ADSL Broadband Services",WSEAS Transactions on Communications, Issue 5, Volume 5, May 2006, pp. 884-889.
[65] Eric Hsiao-Kuang Wu, Ming-I Hsieh and Hsu-Te Lai, "A Novel Low Latency Packet Scheduling Scheme for Broadband Networks", in Proceedings of 2005 Paci…c-Rim Conference on Multimedia (PCM'05), November, 2005, Part II. Lecture Notes in Computer Science 3768 Springer 2005, pp. 1015-1026.
[66] Eric Hsiao-Kuang Wu, Ming-I Hsieh and Hsu-Te Lai, "Low Latency and Efficient Packet Scheduling for Streaming Applications", ELSEVIER Computer Communications, Volume 29, No. 9. May 2006, pp. 1413-1421.
[67] Ming-I Hsieh, Eric Hsiao-Kuang Wu and Meng-Feng Tsai, "FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem", accepted for publication in Journal of Information Science and Engineering.
[68] W. Richard Steven, "TCP/IP Illustrated Volume 1: The Protocols", Addison-Wesley.
[69] Gary R. Wright and W. Richard Steven, "TCP/IP Illustrated Volume 2: The Implementation", Addison-Wesley.
[70] Network Simulator: http://www.isi.edu/nsnam/ns/
[71] Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Introduction to Algorithms, 26.3.

指導教授

吳曉光(Hsiao-Kuang Wu)

審核日期

2007-7-18

推文