Title :
RPA: a simple, efficient, and flexible policy for input buffered ATM switches
Author :
Marsan, M. G Ajmone ; Bianco, A. ; Leonardi, E.
Author_Institution :
Dipartimento di Elettronica, Politecnico di Torino, Italy
fDate :
5/1/1997 12:00:00 AM
Abstract :
Reservation with Preemption and Acknowledgment (RPA) is a simple, efficient, and flexible queuing discipline and scheduling algorithm for input buffered asynchronous transfer-mode (ATM) switches. This letter describes the RPA algorithms, and presents simulation results to demonstrate the effectiveness of the proposed approach.
Keywords :
asynchronous transfer mode; buffer storage; computational complexity; queueing theory; scheduling; telecommunication traffic; ATM switches; RPA algorithms; Reservation with Preemption and Acknowledgment; input buffered asynchronous transfer mode switches; queuing discipline; scheduling algorithm; simulation results; Asynchronous transfer mode; Bandwidth; Computational complexity; Fabrics; Optical buffering; Quality of service; Scheduling algorithm; Switches; Throughput; Traffic control;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/4234.585804
