IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Blocking with retrials in a completely shared resource environment
Performance Evaluation
Reservation-based bandwidth allocation in a radio ATM network
IEEE/ACM Transactions on Networking (TON)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
A simple approximation of the link model with reservation by a one-dimensional Markov chain
Performance Evaluation - Special issue: ATM networks: Performance modelling and analysis
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Engset multi-rate state-dependent loss models with QoS guarantee: Research Articles
International Journal of Communication Systems
Performance of optical burst switched networks: a two moment analysis
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE/ACM Transactions on Networking (TON)
Engset multi-rate state-dependent loss models
Performance Evaluation
IEEE Communications Magazine
GMPLS: the promise of the next-generation optical control plane
IEEE Communications Magazine
Teletraffic: Theory and Applications
Teletraffic: Theory and Applications
| Hi-index | 0.00 |
Firstly, we reviewed two extensions of the Erlang multi-rate loss model, whereby we can assess the call-level QoS of telecom networks supporting elastic traffic: (i) the extended Erlang multi-rate loss model, where random arriving calls of certain bandwidth requirements at call setup can tolerate bandwidth compression while in service; and (ii) the connection-dependent threshold model, where arriving calls may have several contingency bandwidth requirements, whereas in-service calls cannot tolerate bandwidth compression. Secondly, we proposed a new model, the extended connection-dependent threshold model. Calls may have alternative bandwidth requirements at call setup and can tolerate bandwidth compression while in service. We proposed a recurrent formula for the efficient calculation of link occupancy distribution and consequently call blocking probabilities, link utilization, and throughput per service class. Furthermore, in the proposed model, we incorporated the bandwidth reservation policy, whereby we can (i) equalize the call blocking probabilities of different service classes, (ii) guarantee specific QoS per service class, and (iii) implement different maximum bandwidth compression/expansion rate per service class so that the network supports both elastic and stream traffic. The accuracy of the new model is verified by simulation. Moreover, the proposed model performs better than the existing models. Finally, we generalize the proposed model by incorporating service classes with either random or quasi-random arrivals. Copyright © 2011 John Wiley & Sons, Ltd.