DocumentCode
761841
Title
An efficient network-switch scheduling for real-time applications
Author
Tang, Caimu ; Chronopoulos, Anthony T. ; Yaprak, Ece
Author_Institution
Comput. Sci. Dept., Univ. of Southern California, Los Angeles, CA, USA
Volume
53
Issue
3
fYear
2005
fDate
3/1/2005 12:00:00 AM
Firstpage
401
Lastpage
404
Abstract
Bursts consist of a varying number of asynchronous transfer mode cells corresponding to a datagram. Here, we generalized weighted fair queueing to a burst-based algorithm with preemption. The new algorithm enhances the performance of the switch service for real-time applications, and it preserves the quality of service guarantees. We study this algorithm theoretically and via simulations.
Keywords
asynchronous transfer mode; quality of service; queueing theory; real-time systems; scheduling; asynchronous transfer mode cell; burst-based algorithm; generalized weighted fair queueing; network-switch scheduling; quality of service; real-time application; Admission control; Asynchronous transfer mode; Communication switching; Computer science; Finishing; Processor scheduling; Quality of service; Switches; Terminology; Wireless communication; Burst preemptive scheduling; fair queueing; quality of service (QoS);
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/TCOMM.2005.843434
Filename
1413581
Link To Document