Premium
An efficient contention resolution algorithm for input queuing atm cross‐connect switches
Author(s) -
Obara Hitoshi,
Yasushi Tetsujirou
Publication year - 1989
Publication title -
international journal of digital and analog cabled systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 0894-3222
DOI - 10.1002/dac.4520020409
Subject(s) - computer science , queueing theory , throughput , queue , algorithm , asynchronous transfer mode , resolution (logic) , blocking (statistics) , computer network , real time computing , telecommunications , artificial intelligence , wireless
This paper describes an efficient contention resolution algorithm and its distributed implementation for large capacity input queuing cross‐connect switches, which will establish virtual paths in future broadband ATM networks. The algorithm dynamically allocates sending time to cells held in input queues when no contention is indicated in the designated output ports. An expression for the mean delay and the cell loss probability for random traffic are derived through an approximate analysis. Input cells are served on a first‐come, first‐served basis as conventional contention resolution algorithms whose throughput saturates at 58 per cent because of head of line blocking in input queues. The proposed algorithm achieves a maximum throughput of 76 per cent.