Analysis of load-balanced switch with finite buffers

Yury Audzevich, Yoram Ofek, M. Telek, Bülent Yener

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Recently the Birkhoff-von Neumann load-balanced (LB) switch has become a promising switch design due to its high scalability properties and simple control. The performance of the LB switch was studied under strong assumptions such as infinite buffers and admissible traffic conditions. However, both such assumptions may be violated in multi-hop networks since admissibility requirement cannot be maintained unless some inter-switch feedback mechanism is implemented, and infinite buffers are not feasible either. This paper considers the performance of the LB switch with finite central stage buffers under both (i) admissible and (ii) inadmissible input traffic conditions. Its contributions are two folds: firstly, by means of mathematical model we demonstrate that the load-balanced switch has a non-zero cell dropping probability due to buffer overflow even under the admissible input traffic assumptions. Secondly, cell loss probabilities are even higher and large buffers are required under inadmissible traffic conditions to cope with such behavior.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages1524-1529
Number of pages6
DOIs
Publication statusPublished - 2008
Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States
Duration: Nov 30 2008Dec 4 2008

Other

Other2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
CountryUnited States
CityNew Orleans, LA
Period11/30/0812/4/08

Fingerprint

Switches
Scalability
Mathematical models
Feedback

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Audzevich, Y., Ofek, Y., Telek, M., & Yener, B. (2008). Analysis of load-balanced switch with finite buffers. In GLOBECOM - IEEE Global Telecommunications Conference (pp. 1524-1529). [4698072] https://doi.org/10.1109/GLOCOM.2008.ECP.297

Analysis of load-balanced switch with finite buffers. / Audzevich, Yury; Ofek, Yoram; Telek, M.; Yener, Bülent.

GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 1524-1529 4698072.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Audzevich, Y, Ofek, Y, Telek, M & Yener, B 2008, Analysis of load-balanced switch with finite buffers. in GLOBECOM - IEEE Global Telecommunications Conference., 4698072, pp. 1524-1529, 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008, New Orleans, LA, United States, 11/30/08. https://doi.org/10.1109/GLOCOM.2008.ECP.297
Audzevich Y, Ofek Y, Telek M, Yener B. Analysis of load-balanced switch with finite buffers. In GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 1524-1529. 4698072 https://doi.org/10.1109/GLOCOM.2008.ECP.297
Audzevich, Yury ; Ofek, Yoram ; Telek, M. ; Yener, Bülent. / Analysis of load-balanced switch with finite buffers. GLOBECOM - IEEE Global Telecommunications Conference. 2008. pp. 1524-1529
@inproceedings{0b0e89f33bb34b18be0dfe1d25e23fa9,
title = "Analysis of load-balanced switch with finite buffers",
abstract = "Recently the Birkhoff-von Neumann load-balanced (LB) switch has become a promising switch design due to its high scalability properties and simple control. The performance of the LB switch was studied under strong assumptions such as infinite buffers and admissible traffic conditions. However, both such assumptions may be violated in multi-hop networks since admissibility requirement cannot be maintained unless some inter-switch feedback mechanism is implemented, and infinite buffers are not feasible either. This paper considers the performance of the LB switch with finite central stage buffers under both (i) admissible and (ii) inadmissible input traffic conditions. Its contributions are two folds: firstly, by means of mathematical model we demonstrate that the load-balanced switch has a non-zero cell dropping probability due to buffer overflow even under the admissible input traffic assumptions. Secondly, cell loss probabilities are even higher and large buffers are required under inadmissible traffic conditions to cope with such behavior.",
author = "Yury Audzevich and Yoram Ofek and M. Telek and B{\"u}lent Yener",
year = "2008",
doi = "10.1109/GLOCOM.2008.ECP.297",
language = "English",
isbn = "9781424423248",
pages = "1524--1529",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Analysis of load-balanced switch with finite buffers

AU - Audzevich, Yury

AU - Ofek, Yoram

AU - Telek, M.

AU - Yener, Bülent

PY - 2008

Y1 - 2008

N2 - Recently the Birkhoff-von Neumann load-balanced (LB) switch has become a promising switch design due to its high scalability properties and simple control. The performance of the LB switch was studied under strong assumptions such as infinite buffers and admissible traffic conditions. However, both such assumptions may be violated in multi-hop networks since admissibility requirement cannot be maintained unless some inter-switch feedback mechanism is implemented, and infinite buffers are not feasible either. This paper considers the performance of the LB switch with finite central stage buffers under both (i) admissible and (ii) inadmissible input traffic conditions. Its contributions are two folds: firstly, by means of mathematical model we demonstrate that the load-balanced switch has a non-zero cell dropping probability due to buffer overflow even under the admissible input traffic assumptions. Secondly, cell loss probabilities are even higher and large buffers are required under inadmissible traffic conditions to cope with such behavior.

AB - Recently the Birkhoff-von Neumann load-balanced (LB) switch has become a promising switch design due to its high scalability properties and simple control. The performance of the LB switch was studied under strong assumptions such as infinite buffers and admissible traffic conditions. However, both such assumptions may be violated in multi-hop networks since admissibility requirement cannot be maintained unless some inter-switch feedback mechanism is implemented, and infinite buffers are not feasible either. This paper considers the performance of the LB switch with finite central stage buffers under both (i) admissible and (ii) inadmissible input traffic conditions. Its contributions are two folds: firstly, by means of mathematical model we demonstrate that the load-balanced switch has a non-zero cell dropping probability due to buffer overflow even under the admissible input traffic assumptions. Secondly, cell loss probabilities are even higher and large buffers are required under inadmissible traffic conditions to cope with such behavior.

UR - http://www.scopus.com/inward/record.url?scp=67249118185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67249118185&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2008.ECP.297

DO - 10.1109/GLOCOM.2008.ECP.297

M3 - Conference contribution

AN - SCOPUS:67249118185

SN - 9781424423248

SP - 1524

EP - 1529

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -