Performance evaluation of scheduling algorithms in an integrated packet services network environment

This paper studies the performance of a large class of scheduling algorithms, and investigates the interaction between the application and the network to improve performance under congestion. The following key ideas are presented in this paper: (a) we show the performance and scalability trade-offs...

Full description

Saved in:
Bibliographic Details
Published inProceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166) pp. 94 - 99
Main Authors Sungwon Ha, Kang-Won Lee, Bharghavan, V.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1998
Subjects
Application software
Computer networks
Electronic switching systems
Intelligent networks
Intserv networks
IP networks
Quality of service
Scheduling algorithm
Switches
Web and internet services
Online AccessGet full text

Cover

More Information
Summary:This paper studies the performance of a large class of scheduling algorithms, and investigates the interaction between the application and the network to improve performance under congestion. The following key ideas are presented in this paper: (a) we show the performance and scalability trade-offs between providing separation and multiplexing among flows; (b) we show that a bounded buffer FIFO scheduler performs approximately as well as a weighted round robin scheduler with per-flow queues in most practical situations, but requires significantly less overhead in terms of per-flow state; and (c) we show how link layer schedulers can use application-level hints in order to increase the perceived goodness of connections at higher layers.
ISBN:0818685387
9780818685385
DOI:10.1109/ISCC.1998.702465