Communications - Scientific Letters of the University of Zilina 2004, 6(4):13-16 | DOI: 10.26552/com.C.2004.4.13-16

Traffic savings through a cac procedure incorporating a fair bandwidth allocation policy for elastic services

Michael D. Logothetis1, Ioannis D. Moscholios1, George K. Kokkinakis1
1 Wire Communications Laboratory, Department of Electrical & Computer Engineering, University of Patras, Greece

We apply the max-min fairness policy (MMF) for elastic services with min and max bandwidth requirements (approximated MMF) not to a single link but to a whole connection-oriented network. To achieve it we propose a Call Admission Control (CAC) procedure consisting of several scenarios dependent on the number of paths between the origin-destination (O-D) network nodes. We evaluate the global network performance at the call level by comparing the maximum Call Blocking Probability (CBP) of the proposed scheme with that of a no fair bandwidth allocation policy scheme. Simulation results show significant traffic savings in the case of the approximated MMF policy.

Keywords: bandwidth allocation, max-min fairness, elastic traffic, call blocking probability

Published: December 31, 2004  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Logothetis, M.D., Moscholios, I.D., & Kokkinakis, G.K. (2004). Traffic savings through a cac procedure incorporating a fair bandwidth allocation policy for elastic services. Communications - Scientific Letters of the University of Zilina, 6(4), 13-16. doi: 10.26552/com.C.2004.4.13-16
Share...
Download citation
  • BibTeX (.bib)
  • Bookends (.ris)
  • EasyBib (.ris)
  • EndNote (.enw)
  • EndNote 8 (.xml)
  • ISI WoS (.isi)
  • Medlars (.medlars)
  • Mendeley (.ris)
  • MODS (.xml)
  • Papers (.ris)
  • RefWorks (.txt)
  • RefManager (.ris)
  • RIS (.ris)
  • MS Word (.xml)
  • Zotero (.ris)
    • Open full article

    References

    1. HOU, Y. T., LI, B., PANWAR, S. S., TZENG, H.: On network bandwidth allocation policies and feedback control algorithms for packet networks, Computer Networks 34 (2000), pp. 481-501. Go to original source...
    2. FAHMY, S., JAIN, R., KALYANARAMAN, S., GOYAL, R., VANDALORE, B.: On Determining the Fair Bandwidth Share for ABR Connections in ATM Networks, in Proc. ICC'98, June 1998, pp. 1485 - 1491.
    3. MA, Q., STEENKISTE, P., ZHANG, H.: Routing High-bandwidth Traffic in Max-Min Fair Share Networks, in ACM Proc. SIGCOM'96, Stanford, CA, August 1996, pp. 206-217. Go to original source...
    4. MOSCHOLIOS, I., LOGOTHETIS, M., KOKKINAKIS, G.: A Parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic, in Proc. 8th International Conference on Advances in Communication & Control, COMCON 8, Rethymna, Crete/Greece, June, 2001.
    5. WAGNER, H. M.: Principles of Operations Research. Prentice-Hall: Englewood Cliffs, New Jersey 1969.
    6. KESHAV, S.: An Engineering Approach to Computer Networking. Addison-Wesley: Massachusetts 1998.
    7. LOGOTHETIS, M., SHIODA, S.: Medium-term centralized virtual path bandwidth control based on traffic measurements, IEEE Trans. Commun., vol. 43, pp. 2630-2640, October 1995. Go to original source...
    8. LOGOTHETIS, M., LIOTOPOULOS, F.: A Batch-type, Time-true ATM Network Simulator - Design for Parallel Processing, International Journal of Communications Systems, Vol. 15, 8, pp. 713-739, October 2002. Go to original source...
    9. AKIMARU, H., KAWASHIMA, K.: Teletraffic, Springer-Verlag: 2nd edition, Berlin, 1999. Go to original source...
    10. LOGOTHETIS, M., MOSCHOLIOS, I., KOTZINOS, N.: Network Simulation with Fair Bandwidth Allocation Policy and Centralized Path Bandwidth Control for Elastic Traffic, in Proc. SoftCOM 2002, pp. 85-89.

    This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.


    Return to the content