An efficient adaptive bus arbitration scheme for scalable shared-medium ATM switch

Authors:
M.S Obaidat;G.I Papadimitriou;A.S Pomportsis
Affiliations:
Department of Computer Science, Monmouth University, West Long Branch, NJ 07764 USA;Department of Informatics, Aristotle University, Box 888, 54006 Thessaloniki, Greece;Department of Informatics, Aristotle University, Box 888, 54006 Thessaloniki, Greece
Venue:
Computer Communications
Year:
2001

Citing 7
Cited 4

Absorbing and ergodic discretized two-action learning automata

IEEE Transactions on Systems, Man and Cybernetics
Adaptive polling schemes for an ATM bus with bursty arrivals

Computer Networks and ISDN Systems
Approximate analysis of a shared-medium ATM switch under bursty arrivals and nonuniform destinations

Performance Evaluation - Special issue: discrete-time models and analysis methods
Learning automata-based receiver conflict avoidance algorithms for WDM broadcast-and-select star networks

IEEE/ACM Transactions on Networking (TON)
A New Approach to the Design of Reinforcement Schemes for Learning Automata: Stochastic Estimator Learning Algorithms

IEEE Transactions on Knowledge and Data Engineering
Hierarchical Discretized Pursuit Nonlinear Learning Automata with Rapid Convergence and High Accuracy

IEEE Transactions on Knowledge and Data Engineering
On the speedup required for combined input- and output-queued switching

Automatica (Journal of IFAC)

Efficient fast learning automata

Information Sciences—Informatics and Computer Science: An International Journal
On the problem of capacity allocation and flow assignment in self-healing ATM networks

Computer Communications
LACAS: learning automata-based congestion avoidance scheme for healthcare wireless sensor networks

IEEE Journal on Selected Areas in Communications - Special issue on wireless and pervasive communications for healthcare
Grid-based switch fabrics: a new approach in designing fault-tolerant ATM switches

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

Most commercial asynchronous transfer mode (ATM) switches are of the shared-medium type and are based on the well-known TDMA bus arbitration scheme. This is primarily due to the ease of implementation of shared-medium switches. However, ATM switches of this category, suffer from a major drawback - they are not scalable for large sizes because they require a bus running N times faster than the ports (where N is the switch size, i.e. the number of input ports). Furthermore, ATM switches that are based on the TDMA bus arbitration scheme suffer from low performance when the offered traffic is bursty. In this paper, a new approach to the design of scalable shared-medium ATM switches, which are capable of operating efficiently under bursty traffic, is introduced. The main features of the proposed switch are the following: (1) It uses the broadcast bus topology. (2) There is no need to have a bus running N times faster than the ports. A bus of any bandwidth can be used. (3) It uses a fully distributed bus arbitration scheme. (4) The MAC algorithm, which is implemented at each input port has a time complexity, which is in the nanoseconds range and is independent of the switch size N. (5) It is capable of operating efficiently under bursty traffic conditions. (6) It is based on the use of learning automata in order to allocate the bandwidth to the input ports according to their needs.