Hershey, Pennsylvania
New York, New YorkBeijing, China
A Simplified Scheduling Algorithm for Cells in ATM Networks for Multimedia Communication

A Simplified Scheduling Algorithm for Cells in ATM Networks for Multimedia Communication

Ming-Chi Lee (National Sun Yat-Sen University, Taiwan), Chun-Liang Hou (National Sun Yat-Sen University, Taiwan), and Shie-Jue Lee (National Sun Yat-Sen University, Taiwan)
Copyright: © 2003 |Pages: 22
DOI: 10.4018/jdet.2003040103
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Distance learning involves multimedia communication of different traffic types with different Quality of Service (QoS) requirements. Scheduling is one of the key disciplines for fulfilling such requirements. Carry-Over Round Robin (CORR) is a scheduling mechanism for cells in Asynchronous Transfer Mode (ATM) networks, having a great advantage of operational simplicity over other scheduling disciplines. However, it requires two traversals of the admitted connections and maintenance of a sorted connection list, resulting in a detriment to the fairness of bandwidth allocation and simplicity in implementation. We propose a modified scheme of CORR. Operations are simplified and thus complexity in implementation is reduced. Furthermore, fairness in bandwidth allocation is more strongly enforced without introducing any harm to delay. The proposed scheme can be useful for multimedia communication in distance learning where different traffic types with different service-quality requirements are involved.

Complete Article List

Search this Journal:
Reset
Volume 23: 1 Issue (2025)
Volume 22: 1 Issue (2024)
Volume 21: 2 Issues (2023)
Volume 20: 4 Issues (2022): 1 Released, 3 Forthcoming
Volume 19: 4 Issues (2021)
Volume 18: 4 Issues (2020)
Volume 17: 4 Issues (2019)
Volume 16: 4 Issues (2018)
Volume 15: 4 Issues (2017)
Volume 14: 4 Issues (2016)
Volume 13: 4 Issues (2015)
Volume 12: 4 Issues (2014)
Volume 11: 4 Issues (2013)
Volume 10: 4 Issues (2012)
Volume 9: 4 Issues (2011)
Volume 8: 4 Issues (2010)
Volume 7: 4 Issues (2009)
Volume 6: 4 Issues (2008)
Volume 5: 4 Issues (2007)
Volume 4: 4 Issues (2006)
Volume 3: 4 Issues (2005)
Volume 2: 4 Issues (2004)
Volume 1: 4 Issues (2003)
View Complete Journal Contents Listing