Remember Me
Or use your Academic/Social account:


Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Moscholios, Ioannis; Logothetis, Michael; Boucouvalas, Anthony; Vassilakis, Vassilios (2015)
Languages: English
Types: Unknown
Subjects: computer_science
In this paper, we propose a multirate teletraffic loss model of a single link with certain bandwidth capacity that accommodates Poisson arriving calls, which can tolerate bandwidth compression (elastic traffic), under the threshold policy. When compression occurs, the service time of new and in-service calls increases. The threshold policy provides different QoS among service-classes by limiting the number of calls of a service-class up to a pre-defined threshold, which can be different for each service-class. Due to the bandwidth compression mechanism, the steady state probabilities in the proposed model do not have a product form solution. However, we approximate the model by a reversible Markov chain, and prove recursive formulas for the calculation of call blocking probabilities and link utilization. The accuracy of the proposed formulas is verified through simulation and found to be very satisfactory.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [1] J. Kaufman, “Blocking in a shared resource environment”, IEEE Trans. Commun., vol. 29, no. 10, pp. 1474-1481, October 1981.
    • [2] J. W. Roberts, “Teletraffic models for the Telecom 1 integrated services network”, Proc. ITC-10, Mondreal, Canada, 1982.
    • [3] J. Kaufman, “Blocking with retrials in a completely shared resource environment”, Perf. Eval., vol. 15, no. 2, pp. 99-113, June 1992.
    • [4] I. Moscholios, M. Logothetis and G. Kokkinakis, “Connection dependent threshold model: a generalization of the Erlang multiple rate loss model”, Performance Evaluation, vol.48, issues 1-4, pp. 177-200, May 2002.
    • [5] I. Moscholios, M. Logothetis and M. Koukias, “An ON-OFF multi-rate loss model of finite sources”, IEICE Trans. Commun., vol. E90-B, no. 7, pp.1608-1619, July 2007.
    • [6] M. Glabowski, A. Kaliszan and M. Stasiak, “Modeling product-form state depedent systems with BPP traffic”, Performance Evaluation, vol. 67, issue 3, pp. 174-197, March 2010.
    • [7] I. Moscholios, J. Vardakas, M. Logothetis and A. Boucouvalas, “A batched Poisson multirate loss model supporting elastic traffic under the bandwidth reservation policy”, Proc. IEEE ICC, Kyoto, Japan, June 2011.
    • [8] I. Moscholios, J. Vardakas, M. Logothetis and A. Boucouvalas, “QoS guarantee in a batched Poisson multirate loss model supporting elastic and adaptive traffic”, Proc. IEEE ICC, Ottawa, Canada, June 2012.
    • [9] M. Glabowski and M. D. Stasiak, “Internal blocking probability calculation in switching networks with additional inter-stage links and mixture of Erlang and Engset traffic”, Image Processing & Communication, vol. 17, no. 1-2, pp. 67-80, January 2013.
    • [10] I. Moscholios, J. Vardakas, M. Logothetis and A. Boucouvalas, “Congestion probabilities in a batched Poisson multirate loss model supporting elastic and adaptive traffic”, Annals of Telecommunications, vol. 68, issue 5, pp. 327-344, June 2013.
    • [11] S. Hanczewski, M. Stasiak and J.Weissenberg, “A queueing model of a multi-service system with state-dependent distribution of resources for each class of calls”, IEICE Trans. Commun., vol. E97-B, no. 8, pp.1592- 1605, August 2014.
    • [12] F. Cruz-Pérez, J. Vázquez-Ávila and L. Ortigoza-Guerrero, “Recurrent formulas for the multiple fractional channel reservation strategy in multiservice mobile cellular networks”, IEEE Communications Letters, vol. 8, no. 10, pp. 629-631, October 2004.
    • [13] V. Vassilakis, G. Kallos, I. Moscholios and M. Logothetis, “Call-level analysis of W-CDMA networks supporting elastic services of finite population”, Proc. IEEE ICC, Beijing, China, May 2008.
    • [14] M. Glabowski, M. Stasiak, A. Wisniewski, and P. Zwierzykowski, “Blocking probability calculation for cellular systems with WCDMA radio interface servicing PCT1 and PCT2 multirate traffic”, IEICE Trans. Commun., vol.E92-B, pp.1156-1165, April 2009.
    • [15] I. Moscholios, G. Kallos, V. Vassilakis and M. Logothetis, “Congestion probabilities in CDMA-based networks supporting batched Poisson input traffic”, Wireless Personal Communications, vol. 79, issue 2, pp. 1163-1186, November 2014.
    • [16] J. Vardakas, I. Moscholios, M. Logothetis and V. Stylianakis, “An analytical approach for dynamic wavelength allocation in WDM-TDMA PONs Servicing ON-OFF Traffic”, IEEE/OSA Journal of Optical Commun. Networking, vol. 3, no. 4, pp. 347-358, April 2011.
    • [17] N. Jara and A. Beghelli, “Blocking probability evaluation of end-to-end dynamic WDM networks”, Photonic Network Communications, vol. 24, issue 1, pp. 29-38, August 2012.
    • [18] J. Vardakas, I. Moscholios, M. Logothetis and V. Stylianakis, “Blocking performance of multi-rate OCDMA PONs with QoS guarantee”, Int. Journal on Advances in Telecommunications, vol. 5, no. 3&4, pp. 120- 130, December 2012.
    • [19] J. Vardakas, I. Moscholios, M. Logothetis, and V. Stylianakis, “Performance analysis of OCDMA PONs supporting multi-rate bursty traffic”, IEEE Trans. on Commun., vol. 61, issue 8, pp. 3374-3384, August 2013.
    • [20] G. Stamatelos and V. Koukoulidis, “Reservation - based bandwidth allocation in a radio ATM Network”, IEEE/ACM Trans. Networking, vol. 5, pp.420-428, June 1997.
    • [21] K. Ross, Multiservice loss models for broadband telecommunication networks, Springer, 1995.
    • [22] J. Ni, D. Tsang, S. Tatikonda and B. Bensaou, “Optimal and structured call admission control policies for resource-sharing systems”, IEEE Trans. on Commun., vol. 55, no. 1, January 2007.
    • [23] A. Farbod and B. Liang, “Efficient structured policies for admission control in heterogeneous wireless networks”, ACM/Springer Mobile Networks and Applications (MONET), vol. 12, no. 5, pp. 309-323, 2007.
    • [24] T. Kwon, S. Kim, Y. Choi, M. Naghshineh, “Threshold-type call admission control in wireless/mobile multimedia networks using prioritised adaptive framework”, IEE Electronics Letters, vol. 36, issue 9, pp. 852-854, Apr. 2000.
    • [25] N. Nasser, H. Hassanein, “Connection-level performance analysis for adaptive bandwidth allocation in multimedia wireless cellular networks”, Proc. IEEE Int. Conf. on Performance, Computing and Communications, pp. 61-68, April 2004.
    • [26] J. Ni and S. Tatikonda, “Revenue optimization via call admission control and pricing for mobile cellular systems”, Proc. IEEE ICC, vol. 5, pp. 3359-3364, May 2005.
    • [27] D. Tsang and K. Ross, “Algorithms to determine exact blocking probabilities for multirate tree networks”, IEEE Trans. Commun., vol. 38, issue 8, pp. 1266-1271, August 1990.
    • [28] Simscript II.5, http://www.simscript.com/
  • No related research data.
  • Discovered through pilot similarity algorithms. Send us your feedback.

Share - Bookmark

Download from

Cite this article