Hsiuping University of Science and Technology Institutional Repository : Item 310993100/205

English | 正體中文 | 简体中文 | Items with full text/Total items : 4334/7631
Visitors : 3184289 Online Users : 445

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

Scope Adv. Search

Login ‧ Upload ‧ Help ‧ About ‧ Administer

HUSTIR > College of Management > Department of Information Management > Journal > Item 310993100/205

Please use this identifier to cite or link to this item: http://ir.hust.edu.tw/dspace/handle/310993100/205

Title:	The Study on Scheduling Algorithms in Packet Switched Networks
Authors:	C.L.Lee E.H.Hwang P.C.Wang
Contributors:	Department of Information Management
Keywords:	Quality of Service Guarantees Packet Scheduling Algorithm Traffic Model
Date:	2001-03
Issue Date:	2008-08-19T02:32:29Z
Abstract:	One of most important issues in providing performance guaranteed service is the design of the packet scheduling algorithm at each switching node. In packet-switched networks, packets from different connections interact with each other at each switching node. Without proper control, the interaction of each packet will affect the performance of each connection. The packet scheduling algorithms control the order in which packets are serviced and determine the relation of the interaction at each connection. In this paper, we reviewed a lot of scheduling algorithms and traffic models. We will study the property of these algorithms and compare these packet scheduling algorithms focusing on end-to-end delay bound, fairness, and implementation time complexity.
Relation:	修平學報 2, 233-260
Appears in Collections:	[Department of Information Management] Journal

Files in This Item:

File	Size	Format
02-15封包交換網路排程演算法之研究.pdf	1310Kb	Adobe PDF	3408	View/Open