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

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

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

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大典藏 > College of Informatics > Department of Computer Science > Proceedings > Item 140.119/39715

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

Title:	Timeliness and QoS Aware Packet Scheduling for Next Generation Networks
Authors:	連耀南 Lien, Yaonan
Contributors:	國立政治大學資訊科學系
Date:	2009-08
Issue Date:	2010-05-27 16:49:08 (UTC+8)
Abstract:	Running time sensitive multimedia services such as Voice-over-IP (VoIP) and Video-on-Demand (VoD) on All-IP Networks may have lower quality, i.e. Quality of Service (QoS), than its counterpart on conventional circuit-switched networks. We could enhance overall QoS without investing more resources if routers could forward packets based on their timeliness and QoS class giving important late packets proper precedence. This paper proposes a charge-based optimization model for packet scheduling aiming to maximize overall QoS satisfaction factor. We also developed a simple and effective scheduling policy based on this concept for the environments where each packet has a predefined hop-by-hop traveling schedule. Routers are assumed in three different queue architectures: ideal single preemptive queue and practical multiple FIFO queue with and without a priority queue. To forward a packet, a router first assigns an adequate profit function to the packet based on its timeliness and QoS class as well as the loading status of the succeeding routers along its traveling path, and then inserts the packet into an appropriate position in the output queues. The performance of this approach is evaluated by simulation using NS-2 network simulator. Simulation results show that, under heavy load, our approach can outperform easily the Simulated Priority Queue that differentiates QoS class only. © 2009 IEEE.
Relation:	NBiS 2009 - 12th International Conference on Network-Based Information Systems,9-16
Data Type:	conference
DOI link:	http://dx.doi.org/10.1109/NBiS.2009.64
DOI:	10.1109/NBiS.2009.64
Appears in Collections:	[Department of Computer Science ] Proceedings

Files in This Item:

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

社群 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.

Loading...