An efficient cell-scheduling algorithm for multicast ATM switching systems

Citation
Wt. Chen et al., An efficient cell-scheduling algorithm for multicast ATM switching systems, IEEE ACM TN, 8(4), 2000, pp. 517-525
Citations number
14
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE-ACM TRANSACTIONS ON NETWORKING
ISSN journal
10636692 → ACNP
Volume
8
Issue
4
Year of publication
2000
Pages
517 - 525
Database
ISI
SICI code
1063-6692(200008)8:4<517:AECAFM>2.0.ZU;2-A
Abstract
We propose an efficient multicast cell-scheduling algorithm, railed multipl e-slot cell-scheduling algorithm, for multicast ATM switching systems with input queues. Cells in an input-queueing system are usually served based on the first-in-first-out (FIFO) discipline, which may have a serious head-of -line (HOL) blocking problem, Our algorithm differs from previous algorithm s in that we consider the output contention resolution for multiple time sl ots instead of the current time slot only. Like window-based scheduling alg orithm, our algorithm allows cells behind an HOL cell to be transmitted pri or to the HOL cell in the same input port. Thus, HOL blocking can he allevi ated, We have illustrated that the delay-throughput performance of our algo rithm outperforms most of those algorithms that consider only the output co ntention resolution for the current time slot. We also present a simple and efficient architecture for realizing our algorithm, which can dramatically reduce the time complexity, Wt believe that the proposed architecture is v ery suitable for multicast asynchronous transfer mode (ATM) switching syste ms with input queues.