Congestion probabilities in a circuit-switched integrated services network
Performance Evaluation
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Reservation-based bandwidth allocation in a radio ATM network
IEEE/ACM Transactions on Networking (TON)
An efficient stable recursion to compute multiservice blocking probabilities
Performance Evaluation
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Traffic theory and the Internet
IEEE Communications Magazine
Bounding the blocking probabilities in multirate CDMA networks supporting elastic services
IEEE/ACM Transactions on Networking (TON)
Throughputs in processor sharing models for integrated stream and elastic traffic
Performance Evaluation
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance evaluation of admission control and adaptive modulation in OFDMA WiMax systems
IEEE/ACM Transactions on Networking (TON)
Analytical Model of Traffic Compression in the UMTS Network
EPEW '09 Proceedings of the 6th European Performance Engineering Workshop on Computer Performance Engineering
Performance analysis of the uplink of a CDMA cell supporting elastic services
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
International Journal of Communication Systems
| Hi-index | 0.00 |
We consider a multi-rate loss system where two types of non-peak allocated traffic flows receive service. Both elastic and adaptive flows are associated with a peak-and a minimum bandwidth requirement and they tolerate bandwidth compression while in service. The holding time of elastic flows depends on their received throughput, while the holding time of the adaptive flows is insensitive to that. Unfortunately, while this system is Markovian under quite non-restrictive assumptions (that are often used in the literature), it is not reversible. We propose a method whereby the approximation of this system by a reversible system is possible. We derive recursive formulas for determining the occupancy distribution and the mean number of flows in the system. By using a continuous approximation of the discrete state space, we also derive an explicit formula for the average throughputs that is independent of the size of the state space. The recursive formulas and the continuous approximation together provide a powerful tool for the performance analysis of this quite general system in the sense that they allow the calculation of the blocking probabilities and the mean throughputs in medium and large systems as well.