Packet loss minimization in load-balancing switch

Yury Audzevich, Levente Bodrog, Yoram Ofek, M. Telek

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

Abstract

Due to the overall growing demand on the network resources and tight restrictions on the power consumption, the requirements to the long-term scalability, cost and performance capabilities appear together with the deployment of novel switching architectures. The load-balancing switch proposed in [1,2] satisfies to the above requirements due to a simple distributed control and good performance characteristics. However, as it was proven in [3,4] a set of specific assumptions applied to the load-balancing switch restrains the above advantages. In particular, due to the limited information availability, cental stage buffers can overflow and, correspondingly, a packet loss can occur. In this paper we present a novel load-balancing service protocol which uses the congestion allocation technique to allow the drop of the arriving packets also at the input stage. If congestion indication is detected, the input stage will drop the whole packet upon its arrival while reducing the probability of congestion at the output reassembly unit. In the following the mathematical model for joint input/central stage packet loss evaluation will be presented. Based on the presented analysis we account the ways to minimize the mentioned packet loss.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages44-58
Number of pages15
Volume6148 LNCS
DOIs
Publication statusPublished - 2010
Event17th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2010 - Cardiff, United Kingdom
Duration: Jun 14 2010Jun 16 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6148 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other17th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2010
CountryUnited Kingdom
CityCardiff
Period6/14/106/16/10

Fingerprint

Packet Loss
Packet loss
Load Balancing
Congestion
Resource allocation
Switch
Switches
Overflow
Requirements
Distributed Control
Power Consumption
Buffer
Scalability
Electric power utilization
Availability
Mathematical Model
Mathematical models
Restriction
Minimise
Resources

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Audzevich, Y., Bodrog, L., Ofek, Y., & Telek, M. (2010). Packet loss minimization in load-balancing switch. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6148 LNCS, pp. 44-58). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6148 LNCS). https://doi.org/10.1007/978-3-642-13568-2_4

Packet loss minimization in load-balancing switch. / Audzevich, Yury; Bodrog, Levente; Ofek, Yoram; Telek, M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6148 LNCS 2010. p. 44-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6148 LNCS).

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

Audzevich, Y, Bodrog, L, Ofek, Y & Telek, M 2010, Packet loss minimization in load-balancing switch. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6148 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6148 LNCS, pp. 44-58, 17th International Conference on Analytical and Stochastic Modeling Techniques and Applications, ASMTA 2010, Cardiff, United Kingdom, 6/14/10. https://doi.org/10.1007/978-3-642-13568-2_4
Audzevich Y, Bodrog L, Ofek Y, Telek M. Packet loss minimization in load-balancing switch. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6148 LNCS. 2010. p. 44-58. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-13568-2_4
Audzevich, Yury ; Bodrog, Levente ; Ofek, Yoram ; Telek, M. / Packet loss minimization in load-balancing switch. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6148 LNCS 2010. pp. 44-58 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{6eabbf3a960344b4a3571f3c6a5a74ca,
title = "Packet loss minimization in load-balancing switch",
abstract = "Due to the overall growing demand on the network resources and tight restrictions on the power consumption, the requirements to the long-term scalability, cost and performance capabilities appear together with the deployment of novel switching architectures. The load-balancing switch proposed in [1,2] satisfies to the above requirements due to a simple distributed control and good performance characteristics. However, as it was proven in [3,4] a set of specific assumptions applied to the load-balancing switch restrains the above advantages. In particular, due to the limited information availability, cental stage buffers can overflow and, correspondingly, a packet loss can occur. In this paper we present a novel load-balancing service protocol which uses the congestion allocation technique to allow the drop of the arriving packets also at the input stage. If congestion indication is detected, the input stage will drop the whole packet upon its arrival while reducing the probability of congestion at the output reassembly unit. In the following the mathematical model for joint input/central stage packet loss evaluation will be presented. Based on the presented analysis we account the ways to minimize the mentioned packet loss.",
author = "Yury Audzevich and Levente Bodrog and Yoram Ofek and M. Telek",
year = "2010",
doi = "10.1007/978-3-642-13568-2_4",
language = "English",
isbn = "3642135676",
volume = "6148 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "44--58",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Packet loss minimization in load-balancing switch

AU - Audzevich, Yury

AU - Bodrog, Levente

AU - Ofek, Yoram

AU - Telek, M.

PY - 2010

Y1 - 2010

N2 - Due to the overall growing demand on the network resources and tight restrictions on the power consumption, the requirements to the long-term scalability, cost and performance capabilities appear together with the deployment of novel switching architectures. The load-balancing switch proposed in [1,2] satisfies to the above requirements due to a simple distributed control and good performance characteristics. However, as it was proven in [3,4] a set of specific assumptions applied to the load-balancing switch restrains the above advantages. In particular, due to the limited information availability, cental stage buffers can overflow and, correspondingly, a packet loss can occur. In this paper we present a novel load-balancing service protocol which uses the congestion allocation technique to allow the drop of the arriving packets also at the input stage. If congestion indication is detected, the input stage will drop the whole packet upon its arrival while reducing the probability of congestion at the output reassembly unit. In the following the mathematical model for joint input/central stage packet loss evaluation will be presented. Based on the presented analysis we account the ways to minimize the mentioned packet loss.

AB - Due to the overall growing demand on the network resources and tight restrictions on the power consumption, the requirements to the long-term scalability, cost and performance capabilities appear together with the deployment of novel switching architectures. The load-balancing switch proposed in [1,2] satisfies to the above requirements due to a simple distributed control and good performance characteristics. However, as it was proven in [3,4] a set of specific assumptions applied to the load-balancing switch restrains the above advantages. In particular, due to the limited information availability, cental stage buffers can overflow and, correspondingly, a packet loss can occur. In this paper we present a novel load-balancing service protocol which uses the congestion allocation technique to allow the drop of the arriving packets also at the input stage. If congestion indication is detected, the input stage will drop the whole packet upon its arrival while reducing the probability of congestion at the output reassembly unit. In the following the mathematical model for joint input/central stage packet loss evaluation will be presented. Based on the presented analysis we account the ways to minimize the mentioned packet loss.

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

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

U2 - 10.1007/978-3-642-13568-2_4

DO - 10.1007/978-3-642-13568-2_4

M3 - Conference contribution

AN - SCOPUS:77955465348

SN - 3642135676

SN - 9783642135675

VL - 6148 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 44

EP - 58

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -