Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks

T. Cinkler, László Ast

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

Abstract

For the end-to-end call blocking probability computation in multi-rate loss networks the so called reduced load approximation under link independence assumption is often used, because it allows derivation of analytical results. However, its accuracy and extendibility to mul- tirouting or multicasting networks (like the B-ISDN) is seldom stud- ied. This paper proposes new analytical methods for approximating the call blocking probabilities for alternative routing and point-to-multipoint connections. The results are derived for different cases and techniques and further generalised for Whitt's summation bound.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages287-298
Number of pages12
Volume1815
ISBN (Print)354067506X, 9783540675068
Publication statusPublished - 2000
EventIFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000 - Paris, France
Duration: May 14 2000May 19 2000

Publication series

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

Other

OtherIFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000
CountryFrance
CityParis
Period5/14/005/19/00

Fingerprint

Loss Networks
Multicasting
Blocking Probability
Blocking probability
Voice/data communication systems
Approximation
Analytical Methods
Summation
Routing
Alternatives
Independence

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Cinkler, T., & Ast, L. (2000). Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1815, pp. 287-298). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1815). Springer Verlag.

Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks. / Cinkler, T.; Ast, László.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1815 Springer Verlag, 2000. p. 287-298 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1815).

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

Cinkler, T & Ast, L 2000, Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1815, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1815, Springer Verlag, pp. 287-298, IFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000, Paris, France, 5/14/00.
Cinkler T, Ast L. Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1815. Springer Verlag. 2000. p. 287-298. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Cinkler, T. ; Ast, László. / Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1815 Springer Verlag, 2000. pp. 287-298 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{d397928aa7ce4153a8b5625a69ff147c,
title = "Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks",
abstract = "For the end-to-end call blocking probability computation in multi-rate loss networks the so called reduced load approximation under link independence assumption is often used, because it allows derivation of analytical results. However, its accuracy and extendibility to mul- tirouting or multicasting networks (like the B-ISDN) is seldom stud- ied. This paper proposes new analytical methods for approximating the call blocking probabilities for alternative routing and point-to-multipoint connections. The results are derived for different cases and techniques and further generalised for Whitt's summation bound.",
author = "T. Cinkler and L{\'a}szl{\'o} Ast",
year = "2000",
language = "English",
isbn = "354067506X",
volume = "1815",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "287--298",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Approximations for call-blocking probabilities in multirouting multicasting multirate loss networks

AU - Cinkler, T.

AU - Ast, László

PY - 2000

Y1 - 2000

N2 - For the end-to-end call blocking probability computation in multi-rate loss networks the so called reduced load approximation under link independence assumption is often used, because it allows derivation of analytical results. However, its accuracy and extendibility to mul- tirouting or multicasting networks (like the B-ISDN) is seldom stud- ied. This paper proposes new analytical methods for approximating the call blocking probabilities for alternative routing and point-to-multipoint connections. The results are derived for different cases and techniques and further generalised for Whitt's summation bound.

AB - For the end-to-end call blocking probability computation in multi-rate loss networks the so called reduced load approximation under link independence assumption is often used, because it allows derivation of analytical results. However, its accuracy and extendibility to mul- tirouting or multicasting networks (like the B-ISDN) is seldom stud- ied. This paper proposes new analytical methods for approximating the call blocking probabilities for alternative routing and point-to-multipoint connections. The results are derived for different cases and techniques and further generalised for Whitt's summation bound.

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

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

M3 - Conference contribution

SN - 354067506X

SN - 9783540675068

VL - 1815

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

SP - 287

EP - 298

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

PB - Springer Verlag

ER -