Skip to main content

Call Admission Control with Multiple Priorities Erlang B System

  • Conference paper
Web Technologies Research and Development - APWeb 2005 (APWeb 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3399))

Included in the following conference series:

  • 424 Accesses

Abstract

Erlang B system has been widely used in modelling and evaluating network performance. For example, guard channels are allocated for handover calls in cellular networks, which is a two-priority Erlang B model. This paper discusses multi-priority fractional guard channel scheme, a generalized Erlang B model, and develops recursive algorithms to reduce computational complexity. Simulation results are presented for the NSFNET topology model when applying the scheme to the Internet. Routing algorithms’ influence on system performance is studied.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akemaru, H., Kawashima, K.: Teletraffic: Theory and applications. Springer, New York (1993)

    Google Scholar 

  2. Bellamy, J.: Digital telephony, 2nd edn. Wiley, New York (1991)

    Google Scholar 

  3. Fang, Y., Zhang, Y.: Call admission control schemes and performance analysis in wireless mobile networks. IEEE Transactions on Vehicular Technology 51(2), 371–382 (2002)

    Article  MathSciNet  Google Scholar 

  4. Fang, Y.: Thinning schemes for call admission control in wireless networks. IEEE Transactions on Computers 52(5), 685–687 (2003)

    Article  Google Scholar 

  5. Freeman, R.L.: Reference manual for telecommunications engineering, 2nd edn. Wiley, New York (1994)

    Google Scholar 

  6. Haring, G., Marie, R., Puigjaner, R., Trivedi, K.: Loss forumlas and their application to optimization for cellular networks. IEEE Transactions on Vehicular Technology 50(3), 664–673 (2001)

    Article  Google Scholar 

  7. Hong, D.Y., Rappaport, S.S.: Traffic model and performance analysis for cellular mobile radio telephone systems with prioritized and nonprioritized handoff procedures. IEEE Transactions on Vehicular Technology 35(3), 77–92 (1986)

    Article  Google Scholar 

  8. Le Gall, F., Bernussou, J.: Blocking probabilities for trunk reservation policy. IEEE Transactions on Communidations COM-35(3), 313–318 (1987)

    Article  Google Scholar 

  9. Ramjee, R., Towsley, D., Nagarajan, R.: On optimal call admission control in cellular networks. Wireless Networks 3(1), 29–41 (1997)

    Article  Google Scholar 

  10. Ross, K.W.: Multiservice loss models for broadband telecommunication networks. Springer, London (1995)

    MATH  Google Scholar 

  11. Santucci, R.: Recursive algorithm for calculating performance of cellular networks with cutoff priority. IEE Electronics Letters 33(8), 662–664 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, D. (2005). Call Admission Control with Multiple Priorities Erlang B System. In: Zhang, Y., Tanaka, K., Yu, J.X., Wang, S., Li, M. (eds) Web Technologies Research and Development - APWeb 2005. APWeb 2005. Lecture Notes in Computer Science, vol 3399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31849-1_96

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31849-1_96

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25207-8

  • Online ISBN: 978-3-540-31849-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics