Hsiuping University of Science and Technology Institutional Repository : Item 310993100/205
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 4334/7631
造訪人次 : 3197467      線上人數 : 353
RC Version 3.2 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 進階搜尋

請使用永久網址來引用或連結此文件: http://ir.hust.edu.tw/dspace/handle/310993100/205

題名: The Study on Scheduling Algorithms in Packet Switched Networks
作者: C.L.Lee
E.H.Hwang
P.C.Wang
貢獻者: Department of Information Management
關鍵詞: Quality of Service Guarantees
Packet Scheduling Algorithm
Traffic Model
日期: 2001-03
上傳時間: 2008-08-19T02:32:29Z
摘要: 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.
關聯: 修平學報 2, 233-260
顯示於類別:[資訊管理系] 期刊論文

文件中的檔案:

檔案 大小格式瀏覽次數
02-15封包交換網路排程演算法之研究.pdf1310KbAdobe PDF3409檢視/開啟

在HUSTIR中所有的資料項目都受到原著作權保護.

 

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