Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks

Ast, László; Cinkler, Tibor; Fodor, Gábor; Rácz, Sándor; Blaabjerg, Søren

doi:10.1177/003754979706800106

Cited by 3 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The link blocking probabilities B ml are given as a solution to (11), (12) and (13) and can be obtained by, e.g., repeated substitution.…”

Section: Reduced Load and Link Independencementioning

confidence: 99%

“…The exact (or good approximate) and fast calculation of end-to-end blocking probabilities in modern telecommunication networks is important, because it is the primary measure of the grade of service the network provides to its users [1,2,3,4]. In broadband integrated services digital networks (B-ISDN), where calls of different service classes are routed between two or more different points, the traditional methods, elaborated for single-rate circuit switched (telephone) networks are no longer adequate.…”

Section: Introductionmentioning

confidence: 99%

“…Furthermore, to our knowledge it is not discussed how they can be applied to multicast routing -an important routing method, where each connection can be built up between more than two or three users and is expected to be in wide use in future multiservice networks. The obtained results were published in [10,11].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Approximations for Call-Blocking Probabilities in Multirouting Multicasting Multirate Loss Networks

Cinkler

Ast

2000

Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks

Self Cite

View full text Add to dashboard Cite

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 multirouting or multicasting networks (like the B-ISDN) is seldom studied. 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.

show abstract

“…The link blocking probabilities B ml are given as a solution to (11), (12) and (13) and can be obtained by, e.g., repeated substitution.…”

Section: Reduced Load and Link Independencementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Approximations for Call-Blocking Probabilities in Multirouting Multicasting Multirate Loss Networks

Cinkler

Ast

2000

Networking 2000 Broadband Communications, High Performance Networking, and Performance of Communication Networks

Self Cite

View full text Add to dashboard Cite

show abstract

Modelling and analysis of routing and resource allocation techniques in multi‐service networks

Fodor

Barta

Marquetant

et al. 1999

Int J Communication

Self Cite

View full text Add to dashboard Cite

In this paper a novel call level model based on the extension of the classical Erlang multi-rate model for broadband integrated services networks is proposed. We use the model to study routing strategies in multi-service networks where service classes with/without QoS guarantees coexist. Examples for such networks include ATM and IP-based integrated networks. In ATM, the CBR and VBR service classes provide QoS guarantees, while the ABR and UBR service classes are of the best effort type. In IP, traditional TCP/IP traffic is of the best effort type, while new protocols like the RSVP or the differentiated services with central resource handling attempt to support QoS parameters. The coexistence of guaranteed and best effort traffic gives rise to new challenging problems since for a given elastic (best effort) connection the bottleneck link determines the available bandwidth and thereby puts constraints on the bandwidth at the other links along the connection's path. Since the available bandwidth fluctuates in time following the load on the links, routing and link allocation in this environment together with blocking probability calculations and fairness issues need to be studied. By means of our proposed model we are able to conduct a survey of various routing and link allocation techniques as well as to develop a modified shortest path routing algorithm which, according to the numerical examples, performs well in this environment. Figure 9. Impact of partial blocking and queueing on total call holding times of: (a) ABR1 sources and (b) ABR2 sourcesAll in all, from the numerical results we conclude that in PB-Q systems, which we have used as models for multi-rate 'per-session state aware' connection-oriented networks, there are a number of means to control blocking probabilities and thus network resource utilization and fairness. As we have seen on the numerical examples, call queueing and partial blocking, in general, decreases the blocking probabilities at the expense of increased holding times. We are currently working on the formulation of optimization criteria and an optimization model for the PB-Q system. Relationship to and comparison with related works Related worksRouting high-bandwidth traffic in a fair manner and resource allocation in multi-service networks supporting best effort (also called 'elastic') traffic are the topics of current state-of-the-art research papers.\\ Also, the issue of fairness is in the focus of both the ITU-T and the ATM Forum. Although these papers delve into important aspects of fairness 117

show abstract

Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks

et al. 1997

View full text Add to dashboard Cite

For the end-to-end (Originator-Destination pair) call blocking probability computation in multirate loss networks the so-called reduced load approximation under link independence assumption is often used, because it allows the derivation of analytical and numerical results. Its accuracy and extendibility to multirouting or multicasting networks (like me B-ISDN), however, is seldom studied. This paper attempts to generalize this assumption and to assess the usefulness of this generalization by comparing simulation and approximation results on link, route, and end-to-end blocking probability evaluation for these kinds of networks. The accuracy of the approximation is examined by a simulation tool called Flexible Simulation Platform for ATM Networks. An important application example of this generalized link-, route- and Originator-Destination pair blocking measure is the formulation of an optimization model for multirate loss networks, which optimizes carried traffic and network revenue.

show abstract

Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks

Cited by 3 publications

References 12 publications

Approximations for Call-Blocking Probabilities in Multirouting Multicasting Multirate Loss Networks

Approximations for Call-Blocking Probabilities in Multirouting Multicasting Multirate Loss Networks

Modelling and analysis of routing and resource allocation techniques in multi‐service networks

Blocking Probability Approximations and Revenue Optimization in Multirate Loss Networks

Contact Info

Product

Resources

About