An efficient contention resolution algorithm for input queuing atm cross‐connect switches

1 January 1989

journal article
research article
Published by Wiley in International Journal of Communication Systems

Vol. 2 (4) , 261-267
https://doi.org/10.1002/dac.4520020409

Abstract

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.

Keywords

This publication has 6 references indexed in Scilit:

Flexible surveillance capabilities for ATM-based transmission systems
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
High speed transport processor for broad-band burst transport system
Published by Institute of Electrical and Electronics Engineers (IEEE) ,2003
The 'Prelude' ATD experiment: assessments and future prospects
IEEE Journal on Selected Areas in Communications, 1988
A Broadband Packet Switch for Integrated Transport
IEEE Journal on Selected Areas in Communications, 1987
The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel Computer
IEEE Transactions on Computers, 1983
Packet switching in banyan networks
Published by Association for Computing Machinery (ACM) ,1979