政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/29686

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/29686

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113311/144292 (79%)
Visitors : 50932949 Online Users : 979

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大典藏 > College of Informatics > Department of Computer Science > Theses > Item 140.119/29686

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/29686

Title:	有助於提高服務品質的前瞻式封包排程機制 QoS-Aware Packet Scheduling by Looking Ahead Approach
Authors:	溫永全 Wen,Yung-Chuan
Contributors:	連耀南 Lien,Yao-Nan 溫永全 Wen,Yung-Chuan
Keywords:	前瞻式封包排程服務品質 Looking Ahead packet scheduling QoS
Date:	2007
Issue Date:	2009-09-11 16:03:43 (UTC+8)
Abstract:	受到封包網路原本忽略時效性特性之影響，對時效性要求極高的多媒體網路服務，如Voice over IP (VoIP)以及Video on Demand (VoD)在All-IP整合的核心網路上提供時，其服務品質低於傳統之電路交換網路。封包在網路的傳遞過程中受到各種因素之影響，於到達目的地時，可能會造成long delay time，high jitter或packet loss，而在目的地端幾乎已經沒有補救機會，故而如果能在傳遞的過程中，依封包的時效性及重要性做適度的次序調動(rescheduling)而不要依序傳遞(FIFO)，讓過遲的封包提前送出，而將有時間餘裕的封包稍緩送出，如此截長補短，可提高網路效能及整體QoS滿意度。我們在BBQ (Budget-Base QoS)的架構下發展一套簡單而有效的方法，在單佇列(Single Preemptive Queue)及多佇列(Multiple FIFO Queue)的router架構下，根據封包時效性及重要性賦予合適的profit function，並參考封包在後續路程上各router的負載狀態以便能更精確預估封包是否能及時到達目的地並調整profit function參數以調整封包的送出順序，如此能提高排程的效能。我們先對單一服務等級的封包排程進行研究，獲得參數調整之技巧，再根據其結果設計多服務等級的封包排程方法，其重點在於如何調配profit function給不同的服務等級。我們藉由NS-2模擬模擬器進行實驗，評估本方法的效能，實驗結果顯示我們的方法可以較每個router僅根據自身所知的資訊進行排程更可以有效提高網路效能，且能對不同的服務等級做差異化處理以提高整體QoS滿意度。最後在多等級服務的實驗環境及評估指標下，網路高負載的情況，本方法與Simulated Priority Queue排程演算法比較可以提升34%的整體滿意度。 Running time sensitive multimedia services such as Voice-over-IP (VoIP) and Video-on-Demand (VoD) on All-IP networks may have lower quality than that on the traditional circuit-switched networks. Influenced by many factors, packets transported on a packet-switched network, may suffer from long delay time, large jitter and high packet loss rate. When a packet arrives its destination late, there is no way to correct the problem. Thus, it will be beneficial if routers could forward packets base on their timeliness and importance, instead of using First-In-First-Out (FIFO) service plan, giving important late packets proper precedence. The overall QoS satisfaction will be improved significantly. In this thesis, we develop a simple and effective scheduling policy based on this concept for the environments where packets have predefined hop-by-hop time schedule. Routers are assumed in two different queue architectures: ideal Single Preemptive Queue router and practical Multiple FIFO Queue router. To forward a packet, a router first assigns a suitable profit function to the packet based on its timeliness and importance as well as the loading status in its succeeding routers along its predefined traveling path, then inserts the packet into an appropriate position in the output queues. Taking the loading status of succeeding routers into account could predict more accurately whether the packet could reach its destination on time or not. We conduct the research for the single service class environments first to learn the characteristics of this new scheduling policy, and then for the multiple service class environments based on the knowledge acquired. The challenge is to find the best way to assign proper profit functions to different classes of packets in order to utilize resources more wisely, e.g. urgent and important packets get precedence. We evaluate the performance of this approach by simulation using NS-2 network simulator. Simulation results show that our approach outperforms our previous version which doesn`t take the loading status of succeeding routers into account. Furthermore, our approach can outperform the Simulated Priority Queue by at least 34% under heavy load and our evaluation metrics.
Reference:	[1] M. Alam, R. Prasad, and J.R. Farserotu, “Quality of service among IP-based heterogeneous networks,” IEEE Personal Communications, vol. 8, no. 6, pp. 18-24, Dec. 2001. [2] J.C.R. Bennett, K. Benson, A. Charny, and J.-Y. Le Boudec, “Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding,” IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp. 529-540, Aug. 2002. [3] J.C.R. Bennett and H. Zhang, “WF2Q : Worst-case Fair Weighted Fair Queueing,” Proc. of INFOCOM, vol. 1, pp.120-128, Mar. 1996. [4] D. Black, M. Carlson, E. Davies, and Z. Wang, “An Architecture for Differentiated Services,” IETF RFC 2475, Dec. 1998. [5] M. Claypool and J. Tanner, “The Effects of Jitter on the Perceptual Quality of Video,” Proc. of ACM international conference on Multimedia, pp. 115-118, Nov. 1999. [6] E. Crawley, Editor, L. Berger, and S. Berson, “A Framework for Integrated Services and RSVP over ATM,” IETF RFC 2382, Aug. 1998. [7] T. Dag and O. Gokgol, “A Priority Based Packet Scheduler with Deadline Considerations,” Proc. of CNSR, May 2006. [8] X. Fei, A. Marshall, and J. Luo, “DO-WF2Q: delay-optimized WF2Q packet scheduling,” IEEE Proc. on Communications, vol. 152, no. 5, pp. 655-660, Oct. 2005. [9] V.K. Garg and O.T.W. Yu, “Integrated QoS support in 3G UMTS networks,” IEEE Wireless Communications and Networking Conference, vol. 3, pp. 1187-1192, Sep. 2000. [10] Jing-Guo Ge, Ming-Chuan Yang, and Hua-Lin Qian, “Implementation of Expedited Forwarding Using Dynamic Hop Counts Based Absolute Priority Scheduling,” Proc. of ICCT, vol. 1, pp. 324-333, Apr. 2003. [11] Yong Lee, Jian-Yu Lou, Jun-Zhou Luo, and Xiao-Jun Shen, “An Efficient Packet Scheduling Algorithm With Deadline Guarantees for Input-Queued Switches,” IEEE/ACM Transactions on Networking, vol. 15, no. 1 pp. 212-225, Feb. 2007. [12] Yao-Nan Lien, Hung-Ching Jang, Tsu-Chieh Tsai, and Hsing Luh, “Budget Based QoS Management Infrastructure for All-IP Networks,” Proc. of ICACT, vol. 1, pp. 185-190, Feb. 2005. [13] Tsung-Ming Lin, “A New Jitter Control Mechanism by Per-Hop Packet Scheduling Approach,” Master thesis, National Chengchi University, Dec. 2006. [14] P. Lorenz, “Quality of service and new architectures for future telecommunications networks,” Proc. of MILCOM, vol. 2, pp. 695-698, Oct. 2000. [15] S.-W. Moon, K.G. Shin, and J. Rexford, “Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches,” Proc. of RTAS, pp. 203-212, Jun. 1997. [16] R. Pellizzoni and G. Lipari, “Improved schedulability analysis of real-time transactions with earliest deadline scheduling,” Proc. of RTAS, pp. 66-75, Mar. 2005. [17] I. Stoica and Hui Zhang, “Providing Guaranteed Services Without Per Flow Management,” Proc. of ACM SIGCOMM, vol. 29, no. 4, pp. 81-94, Oct. 1999. [18] Fu-Ming Tsou, Hong-Bin Chiou, and Zsehong Tsai, “Design and Simulation of an Efficient Real-Time Traffic Scheduler with Jitter and Delay Guarantees,” IEEE Transaction on Multimedia, vol. 2, no. 4, pp. 255-266, Dec. 2000. [19] Jing-Gang Wang and B. Ravindran, “BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks,” Proc. of ICPP, pp. 159-166, 2002. [20] Chin-Chi Wu, Hsien-Ming Wu, and Woei Lin, “Efficient and Fair Multi-Level Packet Scheduling for Differentiated Services,” Proc. of ISM, Dec. 2005. [21] Chin-Chi Wu, Hsien-Ming Wu, Chiou Moh, and Woei Lin, “A Hierarchical Packet Scheduler for Differentiated Services in High-Speed Networks,” Proc. of ACIS, pp. 63-68, Jul. 2006. [22] Yan Xu, Yi-Lin Chang, and Zeng-Ji Liu, “Calculation and Analysis of Compensation Buffer Size in Multimedia Systems,” IEEE Communications Letters, vol. 5, no. 8, pp. 355-357, Aug. 2001. [23] Lin-Hua Zhong, Jin Xu, and Xian-Lei Wang, “VWQGRR: a Novel Packet Scheduler,” Proc. of ICN, pp. 36-36, Apr. 2007. [24] 3GPP, “Technical Specification Group Services and Systems Aspects: Architecture for an All IP network,” 3GPP TR 23.922 version 1.0.0., Oct. 1999. [25] “The Network Simulator - ns-2,” http://www.isi.edu/nsnam/ns/.
Description:	碩士國立政治大學資訊科學學系 94753041 96
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0094753041
Data Type:	thesis
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Size	Format
index.html	0Kb	HTML2	467	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - Feedback