By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sungwon Ha ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Kang-Won Lee ; Bharghavan, V.

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

Published in:

Computers and Communications, 1998. ISCC '98. Proceedings. Third IEEE Symposium on

Date of Conference:

30 Jun-2 Jul 1998