Closed form two-sided bounds for probabilities that at least r and exactly r out of n events occur
Mathematics of Operations Research
Routing and capacity allocation in networks with trunk reservation
Mathematics of Operations Research
Data networks (2nd ed.)
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Computing approximate blocking probabilities for large loss networks with state-dependent routing
IEEE/ACM Transactions on Networking (TON)
Dimensioning of adaptively routed networks
IEEE/ACM Transactions on Networking (TON)
ATM network design and optimization: a multirate loss network framework
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
SIAM Journal on Applied Mathematics
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Routing and Dimensioning in Circuit-Switched Networks
Routing and Dimensioning in Circuit-Switched Networks
Proceedings of the 35th conference on Winter simulation: driving innovation
Performance Analysis for Multi-Service Networks with Congestion-Based Pricing for QoS Traffic
ANSS '05 Proceedings of the 38th annual Symposium on Simulation
Proceedings of the 4th Annual International Conference on Wireless Internet
Network capacity allocation in service overlay networks
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Opportunity cost analysis for dynamic wavelength routed mesh networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In this paper we consider a class of loss networks that have arbitrary topologies and routes of arbitrary length. Multiple traffic classes are present, each with different bandwidth requirement, and each routed according to a state-dependent routing scheme. In particular, we consider the least loaded routing method generalized to routes of arbitrary number of hops. The connection level performance metric of interest is the end-to-end blocking probability. We are interested in developing fast evaluation methods to provide reasonably accurate estimates of the blocking probability, especially under heavy traffic load. Our algorithms are based on the fixed-point method framework, also known as the reduced load approximation. In addition to what commonly examined by previous work, two more factors contribute to the complexity of the computation in the scenario under consideration in this paper. One is the state-dependent nature of the routing mechanism, the other is the possible overlapping between routes due to the general multihop topology of the network. We present two fast approximation algorithms to evaluate the blocking probability with state-dependent routing by simplifying the route overlapping computation. We discuss the computational complexity of our algorithms as well as sources of approximation error. We then compare the numerical results with that of simulation and show that our algorithms provide fairly accurate blocking probability estimates especially under heavy traffic load.