A novel analytical model for switches with shared buffer

Authors:
Zhenghao Zhang;Yuanyuan Yang
Affiliations:
Department of Electrical and Computer Engineering, State University of New York at Stony Brook, Stony Brook, NY;Department of Electrical and Computer Engineering, State University of New York at Stony Brook, Stony Brook, NY
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2007

Citing 6
Cited 2

Improved queueing analysis of shared buffer switching networks

IEEE/ACM Transactions on Networking (TON)
Performance analysis of ATM Banyan networks with shared queueing—part I: random offered traffic

IEEE/ACM Transactions on Networking (TON)
Performance analysis of ATM Banyan networks with shared queueing—part II: correlated/unbalanced offered traffic

IEEE/ACM Transactions on Networking (TON)
Optimal buffer management policies for shared-buffer ATM switches

IEEE/ACM Transactions on Networking (TON)
Approaches to optical Internet packet switching

IEEE Communications Magazine
Techniques for optical packet switching and optical burst switching

IEEE Communications Magazine

A performance modeling scheme for multistage switch networks with phase-type and bursty traffic

IEEE/ACM Transactions on Networking (TON)
FPGEN: A fast, scalable and programmable traffic generator for the performance evaluation of high-speed computer networks

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Switches with a shared buffer have lower packet loss probabilities than other types of switches when the sizes of the buffers are the same. In the past, the performance of shared buffer switches has been studied extensively. However, due to the strong dependencies of the output queues in the buffer, it is very difficult to find a good analytical model. Existing models are either accurate but have exponential complexities or not very accurate. In this paper, we propose a novel analytical model called the Aggregation model for switches with shared buffer. The model is based on the idea of induction: first find the behavior of two queues, then aggregate them into one block; then find the behavior of three queues while regarding two of the queues as one block, then aggregate the three queues into one block; then aggregate four queues, and so on. When all queues have been aggregated, the behavior of the entire switch will be found. This model has perfect accuracies under all tested conditions and has polynomial complexity.