Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10338528 | Computer Communications | 2005 | 18 Pages |
Abstract
Their relative fairness along with the delay bounds are derived. Simulation experiments support the algorithms' significance and useful results are also provided in comparison with other scheduling algorithms. This kind of algorithms can be applied for next generation internet routers, achieving short time service for delay sensitive flows.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Networks and Communications
Authors
John Tsiligaridis, Raj Acharya,