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

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

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | 全文筆數/總筆數 : 113311/144292 (79%)
造訪人次 : 50935430 線上人數 : 964

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

搜尋範圍

查詢小技巧：

您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果

若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料

進階搜尋

主頁 ‧ 登入 ‧ 上傳 ‧ 說明 ‧ 關於政大典藏 ‧ 管理

到手機版

政大機構典藏 > 資訊學院 > 資訊科學系 > 學位論文 > Item 140.119/29680

請使用永久網址來引用或連結此文件: https://nccur.lib.nccu.edu.tw/handle/140.119/29680

題名:	利用Per-Hop封包排程的延遲變化率控制機制 A New Jitter Control Mechanism by Per-Hop Packet Scheduling Approach
作者:	林宗銘 Lin,Tsung-Ming
貢獻者:	連耀南 Lien,Yao-Nan 林宗銘 Lin,Tsung-Ming
關鍵詞:	延遲變化率封包排程 Jitter Packet Scheduling
日期:	2006
上傳時間:	2009-09-11 16:03:11 (UTC+8)
摘要:	近年來通訊網路的進步與寬頻網路的發展，使得更多新型的網路服務迅速應運而生，對網路服務的品質(QoS)也更加要求。眾多新興的應用服務中，即時性的應用服務(real-time traffic)，像是Voice over IP (VoIP)以及video on demand (VoD)，對於封包的傳遞延遲時間(delay time)以及抖動(jitter)具有嚴格的要求，router在處理即時性封包時，並非僅將封包快速送出即可，而須在一定的延遲時間內送出。本研究在BBQ﹙Budget-Base QoS﹚的架構下，發展一套簡單而有效的方法，在封包所經過的每一個router時，根據其緊急程度、服務等級及網路處理能力賦予合適的profit function，再對封包重新排程以獲得最大的profit，期望減小在接收端的jitter絕對值總和，進而增進網路的效能。在此我們設計了四種profit function配合Greedy演算法在兩種不同的router架構上調整封包傳送順序，並利用網路模擬工具NS2在即時性訊務分為單一服務等級及雙服務等級的情況下評估我們方法的效能，證明我們的方法較既有的方法更可以有效控制jitter，且能對不同的服務等級做適當的差異化處理以提高整體服務滿意度。 With fast growth of Internet traffic and applications, real-time streaming applications have attracted significant attention in the current Internet society. Novel real-time Internet applications such as Voice over IP (VoIP) and video on demand (VoD), have stringent delay and jitter requirements. Under these requirements a router not only have to forward real-time packet as fast as possible, it also have to accomplish the job within a time bound. Our research is based on BBQ﹙Budget-Based QoS﹚management architecture. In order to minimize the jitter of real-time services, we propose a new jitter control mechanism that uses per-hop packet scheduling. Four profit function are designed to represent different scheduling preferences. When a packet gets into a router, the router will assign a profit function based on its timeness and the class of service. The scheduler will re-schedule their order in output queue aiming to maximize total profit. Finally we evaluate our proposed mechanism by NS2 simulator in two situations, single real-time service class and two real-time service classes. Simulation results show that by using our approach the performance is better than other approaches. And we investigate the performance of the combination of profit function in handling multiple classes of service.
參考文獻:	[1] 徐毅銘, "在IPv6的DiffServ網路上具有Credit/Deficit調整的延遲變化率減小機制," 國立中山大學. [2] Wenjiang Zhou, Chuang Lin, and Fengyuan Ren, "A Model for the Integration of Buffer Management and Packet Scheduling," Proc. of PDCAT’03, pp. 27-29, Aug. 2003. [3] Hui Zhang, and Domenico Ferrari, “Rate-Controlled Service Disciplines,” Journal of High Speed Networks, pp. 389-412, 1994. [4] Jon C. R., and Hui Zhang, “Hierarchical Packet Fair Queueing Algorithms,” IEEE/ACM Transactions on Networking, pp. 675-689, Oct. 1997. [5] Qiong Li, and David L.Mills, “Jitter-Based Delay-Boundary Prediction of Wide-Area Networks,” IEEE/ACM Transactions on Networking, pp. 578-590, Oct. 2001. [6] Sally Floyd, and Van Jacobson, “Link-sharing and Resource Management Models for Packet Networks,” IEEE/ACM Transactions on Networking, Aug. 1995. [7] Dimitrios Stiliadis, and Anujan Varma, “Latency-Rate Servers:A General Model for Analysis of Traffic Scheduling Algorithms,” IEEE/ACM Transactions on Networking, pp. 611-623, Oct. 1998. [8] E. Crawley, Editor, L. Berger, S. Berson, ”A Framework for Integrated Service and RSVP over ATM ,” IETF RFC 2382, Aug. 1998. [9] D. Black, M. Carlson, E. Davies, Z. Wang, ”An Architecture for Differentiated Service,” IETF RFC 2475, Dec. 1998. [10] Yao-Nan Lien, Hung-Ching Jang, Tsu-Chieh Tsai and Hsing Luh, ”Budget Based QoS Management Infrastructure for All-IP Networks,” Proc. of IEEE ICACT2005, NSC 92-2219-E-004-001, Feb. 2005. [11] Yishay Mansour, and Boaz Patt-Shamir, “Jitter Control in QoS Networks,” IEEE/ACM Transactions on Networking, Aug. 2001. [12] Ion Stoica, and Hui Zhang, “Providing Guaranteed Services Without Per Flow Management,” Proc. of SIGCOMM `99, pp. 81-94, 1999. [13] Jon C.R. Bennett, and Hui Zhang, “WF2Q : Worst-case Fair Weighted Fair Queueing,” IEEE INFOCOM’96, March 1996. [14] Jon C. R. Bennett, Kent Benson, Anna Charny, and Jean-Yves Le Boudec, “Delay Jitter Bounds and Packet Scale Rate Guarantee for Expedited Forwarding,” IEEE/ACM Transactions on Networking, pp. 529-540, Aug. 2002. [15] Zheng Wang ,and Jon Crowcroft, “Analysis of Burstiness and Jitter in Real-Time Communications,” Proc. of the ACM SIGCOMM, pp. 13-19, Sept. 1993. [16] Mark Claypool, and Jonathan Tanner, “The Effects of Jitter on the Perceptual Quality of Video,” ACM Multimedia ‘99, Nov. 1999. [17] Yan Xu, Yilin Chang, and Zengji Liu, “Calculation and Analysis of Compensation Buffer Size in Multimedia Systems,” IEEE Communications Letters, pp. 355-357, Aug. 2001. [18] Tamir A. Hegazy, " Using Application Benefit for Proactive Resource Allocation in Asynchronous Real-Time Distributed Systems," 2001. [19] Jinggang Wang and Binoy Ravindran, " BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks," Proc. of ICPP’02. [20] 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, pp. 255-266, Dec. 2000. [21] Aman Kansal, and Abhay Karandikar, “Adaptive Delay Estimation for Low Jitter Audio over Internet,” Proc of IEEE INFOCOMM, pp. 680–686, June. 1994. [22] Ian R. Philp, Klara Nahrstedt, and Jane W.S. Liu, ”Scheduling and Buffer Management for Soft-Real-Time VBR Traffic in Packet-Switched Networks,” Proc of the 21st Conference on Local Computer Networks, pp. 143-152, 1996. [23] Hui Zhang, “Service Disciplines For Guaranteed Performance Service in Packet-Switching Networks,” Proc. of the IEEE, pp. 1374-1396, Oct. 1995.
描述:	碩士國立政治大學資訊科學學系 93753020 95
資料來源:	http://thesis.lib.nccu.edu.tw/record/#G0093753020
資料類型:	thesis
顯示於類別:	[資訊科學系] 學位論文

文件中的檔案:

檔案	大小	格式	瀏覽次數
index.html	0Kb	HTML2	544	檢視/開啟

在政大典藏中所有的資料項目都受到原著作權保護.

社群 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 © - 回饋