Movatterモバイル変換

[0]ホーム
URL:

Skip to main content

Advertisement

Springer Nature Link
Log in

Can Equivalent Capacity CAC Deal with Worst Case Traffic in GCRA—Policed ATM Networks?

  • Chapter

Abstract

In order to manage modern ATM networks various methods for connection admission control (CAC) have been proposed. In addition, usage parameter control (UPC) algorithms supervise the transmitted traffic to prevent the user from exceeding the negotiated traffic parameters. This paper addresses the question, whether the broadly accepted Equivalent Capacity CAC algorithm can guarantee the quality of service asserted to the subscribers provided that the algorithm has only knowledge of the specified GCRA parameters used for UPC. We describe two types of worst case traffic conforming to the Generic Cell Rate Algorithm and show the performance of Equivalent Capacity CAC in various traffic scenarios.

Similar content being viewed by others

Keywords

References

  1. ATM Forum Traffic Management Specification4.0,December 1995, ATM Forum/95–0013R9, pp63–68.

    Google Scholar 

  2. B. T. Doshi:Deterministic Rule Based Traffic Descriptors for Broadband ISDN: Worst CaseBehaviour and Connection AcceptanceControl. Proceedings of the 14th International Teletraffic Congress, Antibes Juan-les-Pins, France, 6–10 June, 1994, pp 591–600.

    Google Scholar 

  3. Roch Guerin, Hamid Ahmadi, Mahmoud Naghshineh: Equivalent capacityand its Application to Bandwidth Allocation in High Speed Networks. IEEE Journal on Selected Areas in Communications, Vol 9, No 7, September 1991, pp 968–981.

    Article  Google Scholar 

  4. Harry G. Perros, Khaled M. Elsayed:Call Admission Control Schemes: A Review. IEEE Communications Magazine, November 1996, pp. 82–91.

    Google Scholar 

  5. Nikolas M. Mitrou, Kimon P. Kontovasilis, Hans Kröner, Villy Bæk Iversen:Statistical Multiplexing,Bandwidth Allocation Strategies and Connection Admission Control in ATM Networks. ETT, Vol 5, No 2, Mar.-Apr. 1994, pp. 33/161–47/175

    Google Scholar 

  6. Gagan L. Choudhury, David M. Lucantoni, Ward Whitt:Squeezing the Most Out of ATM. IEEE Transactions on Communications, Vol 44, No 2, February 1996, pp. 203–217

    Article  Google Scholar 

  7. Ruth Kleinewillinghöfer—Kopp, Birgit Kaltenmorgen:Connection Acceptance Control in ATM Networks. Studie des Forschungsinstituts der DBP Telekom, Forschungsbereich 5 ‘Vermittlung und Netze’, Juni 1991, also presented at: TIMS/ORSA Joint National Meeting, Nashville, Tennessee, USA, May 1991.

    Google Scholar 

  8. K. Schmidt, U. Killat, F. Mayer—Lindenberg, P. Kraft: A Parallel ATMNetwork Simulator Proc. XV. International Switching Symposium ISS ‘85, April 1995, Berlin, Germany.

    Google Scholar 

  9. K. Schmidt: Efficient ATM Network Simulation Proc. EUROSIM 1995 Conference, September 1995, Vienna, Austria.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Digital Communication Systems, University of Technology Hamburg-Harburg, 21071, Hamburg, Germany

    Kai Schmidt, Maike Wichers & Ulrich Killat

Authors
  1. Kai Schmidt

    You can also search for this author inPubMed Google Scholar

  2. Maike Wichers

    You can also search for this author inPubMed Google Scholar

  3. Ulrich Killat

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Stuttgart — IND, Stuttgart, Germany

    Paul J. Kühn

  2. SUN Microsystems Inc., Stuttgart, Germany

    Roya Ulrich

Rights and permissions

Copyright information

© 1998 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Schmidt, K., Wichers, M., Killat, U. (1998). Can Equivalent Capacity CAC Deal with Worst Case Traffic in GCRA—Policed ATM Networks?. In: Kühn, P.J., Ulrich, R. (eds) Broadband Communications. BC 1998. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35378-4_26

Download citation

Publish with us

[8]ページ先頭
©2009-2025 Movatter.jp