Congestion probabilities in a batched Poisson multirate loss model supporting elastic and adaptive traffic

Annales des Telecommunications/Annals of Telecommunications

Volumn 68, Issue 5-6, 2013, Pages 327-344

  Moscholios, Ioannis ^a   Vardakas, John ^b   Logothetis, Michael ^b   Boucouvalas, Anthony ^a  

^a UNIVERSITY OF PELOPONNESE   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

Batched Poisson process; Elastic adaptive traffic; Markov chain; Recursive formula; Time call congestion

Indexed keywords

ADAPTIVE SERVICES; AVAILABLE BANDWIDTH; BANDWIDTH COMPRESSION/EXPANSION; LINK UTILIZATION; POISSON PROCESS; PRODUCT-FORM SOLUTIONS; RECURSIVE FORMULA; TIME-CALL CONGESTION;

BANDWIDTH; COMPUTER SIMULATION; MARKOV PROCESSES; POISSON DISTRIBUTION;

TRAFFIC CONGESTION;

EID: 84879090154     PISSN: 00034347     EISSN: 19589395     Source Type: Journal    
DOI: 10.1007/s12243-012-0326-7     Document Type: Article

References (44)

1. Greenberg A, Srikant R (1997) Computational techniques for accurate performance evaluation of multirate, multihop communication networks. IEEE/ACM Trans Netw 5(2):266-277
2. Moscholios I, Logothetis M, Kokkinakis G (2002) Connection dependent threshold model: a generalization of the Erlang multiple rate loss model. Perform Eval 48(1-4):177-200
3. Shengye F, Wu Y, Suili F, Hui S (2004) Coordination-based optimisation of path bandwidth allocation for large-scale telecommunication networks. Comput Commun 27(1):70-80
4. Moscholios I, Logothetis M, Kokkinakis G (2005) Call-burst blocking of ON-OFF traffic sources with retrials under the complete sharing policy. Perform Eval 59(4):279-312
5. Vassilakis V, Moscholios I, Logothetis M (2008) Call-level performance modelling of elastic and adaptive service-classes with finite population. IEICE Trans Commun E91-B(1):151-163
6. Huang Q, Ko K-T, Iversen V (2008) Approximation of loss calculation for hierarchical networks with multiservice overflows. IEEE Trans Commun 56(3)466-473
7. Glabowski M, Stasiak M, Zwierzykowski P (2009) Communication networks modelling of virtual-circuit switching nodes with multicast connections. Eur Trans Telecommun 20(2)123-137
8. Glabowski M (2008) Modelling of state-dependent multirate systems carrying BPP traffic. Ann Telecommun 63(7-8):393-407
9. Staehle D, Mäder A (2003) An analytic approximation of the uplink capacity in a UMTS network with heterogeneous traffic. In: Proc. 18th int. teletraffic congress (ITC-18), pp 81-90
10. Mäder A, Staehle D (2004) Analytic modeling of the WCDMA downlink capacity in multi-service environments. In: Proc. 16th ITC specialist seminar, pp 217-226
11. Fodor G, Telek M (2007) Bounding the blocking probabilities in multirate CDMA networks supporting elastic services. IEEE/ACM Trans Netw 15(4):944-956
12. Vassilakis V, Logothetis M (2008) The wireless engset multi-rate loss model for the handoff traffic analysis in W-CDMA networks. In: Proc. 18th IEEE PIMRC, pp 1-6
13. Glabowski M, Stasiak M, Wisniewski A, Zwierzykowski P (2009) Blocking probability calculation for cellular systems with WCDMA radio interface servicing PCT1 and PCT2 multirate traffic. IEICE Trans Commun E92-B(4):1156-1165
14. Kallos G, Vassilakis V, Logothetis M (2011) Call-level performance analysis of a W-CDMA cell with finite population and interference cancellation. Eur Trans Telecommun 22(1):25-30
15. Washington A, Perros H (2004) Call blocking probabilities in a traffic-groomed tandem optical network. Comput Networks 45(3):281-294
16. Sahasrabudhe A, Manjunath D (2006) Performance of optical burst switched networks: a two moment analysis. Comput Networks 50(18):3550-3563
17. Vardakas J, Vassilakis V, Logothetis M (2008) Blocking analysis in hybrid TDM-WDM passive optical networks. In: Proc. 5th HET-NETs
18. Kuppuswamy K, Lee D (2009) An analytic approach to efficiently computing call blocking probabilities for multiclass WDM networks. IEEE/ACM Trans Netw 17(2):658-670
19. Vardakas JS, Moscholios ID, Logothetis MD, Stylianakis VG (2011) An analytical approach for dynamic wavelength allocation in WDM-TDMA PONs servicing ON-OFF traffic. IEEE/OSA J Opt Commun Netw 3(4):347-358
20. Kaufman J (1981) Blocking in a shared resource environment. IEEE Trans Commun 29(10):1474-1481
21. Roberts J (1981) A service system with heterogeneous user requirements. In: Pujolle G (ed) Performance of data communications systems and their applications. North Holland, pp 423-431
22. Tsang D, Ross K (1990) Algorithms to determine exact blocking probabilities for large multirate tree networks. IEEE Trans Commun 38(8):1266-1271
23. Chung S, Ross K (1993) Reduced load approximations for multirate loss networks. IEEE Trans Commun 41(8):1222-1231
24. Stamatelos G, Koukoulidis V (1997) Reservation based bandwidth allocation in a radio ATM network. IEEE/ACM Trans Netw 5(3):420-428
25. Racz S, Gero B, Fodor G (2002) Flow level performance analysis of a multi-service system supporting elastic and adaptive services. Perform Eval 49(1-4):451-469
26. Fodor G, Telek M (2005) A recursive formula to calculate the steady state of CDMA networks. In: Proc. 19th int. teletraffic congress (ITC-19), pp 1285-1294
27. Kallos G, Vassilakis V, Moscholios I, Logothetis M (2006) Performance modelling of W-CDMA networks supporting elastic and adaptive traffic. In: Proc. 4th HET-NETs, 09/1-09/10
28. Fodor G, Telek M (2007) On the tradeoff between blocking and dropping probabilities in multi-cell CDMA networks. J Commun 2(1):22-33
29. Vassilakis V, Moscholios I, Logothetis M (2007) Call-level performance modelling of elastic and adaptive service-classes. In: Proc. IEEE ICC, pp 183-189
30. Akimaru H, Kawashima K (1999) Teletraffic - theory and applications, 2nd edn. Springer, London
31. Wolff R (1989) Stochastic modeling and the theory of queues. Prentice Hall, Englewood Cliffs
32. van Doorn E, Panken F (1993) Blocking probabilities in a loss system with arrivals in geometrically distributed batches and heterogeneous service requirements. IEEE/ACM Trans Netw 1(6):664-667
33. Kaufman J, Rege K (1996) Blocking in a shared resource environment with batched Poisson arrival processes. Perform Eval 24(4):249-263
34. Moscholios I, Logothetis M (2010) The Erlang multirate loss model with batched Poisson arrival processes under the bandwidth reservation policy. Comput Commun 33(Suppl. 1):S167-S179
35. Morrison J (1996) Blocking probabilities for multiple class batched Poisson arrivals to a shared resource. Perform Eval 25(2):131-150
36. Choundhury G, Leung K, Whitt W (1995) Resource-sharing models with state-dependent arrivals of batches. In: Stewart WJ (ed) Computations with Markov chains. Kluwer, Boston, pp 255-282
37. Jain R (1992) The art of computer systems performance analysis techniques for experimental design, measurement, simulation and modeling. Wiley, New York
38. Moscholios ID, Vardakas JS, Logothetis MD, Boucouvalas AC (2011) A Batched Poisson multirate loss model supporting elastic traffic under the bandwidth reservation policy. In: Proc. IEEE ICC, pp 1-6
39. Bonald T, Proutiere A, Roberts J, Virtamo J (2003) Computational aspects of balanced fairness. In: Proc. 18th int. teletraffic congress (ITC-18), pp 801-810
40. Bonald T, Virtamo J (2005) A recursive formula for multirate systems with elastic traffic. IEEE Commun Lett 9(8):753-755
41. Iversen VB (2011) Teletraffic theory and network planning. Technical University of Denmark. http://oldwww.com.dtu.dk/education/34340/material/ telenook2011pdf.pdf. Accessed 17 Feb 2012
42. Bonald T, Virtamo J (2004) Calculating the flow level performance of balanced fairness in tree networks. Perform Eval 58(1):1-14
43. Bonald T, Massoulie L, Proutiere A, Virtamo J (2006) A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Syst 53(1-2):65-84
44. Simscript II.5. http://www.simscript.com/. Accessed on 17 Feb 2012