Call admission algorithms in multiservice and multiclass ATM network

Salima Hamma; Gerard Hebuterne

doi:10.1117/12.570801

25 October 2004 Call admission algorithms in multiservice and multiclass ATM network

Salima Hamma, Gerard Hebuterne

Proceedings Volume 5598, Performance, Quality of Service, and Control of Next-Generation Communication Networks II; (2004) https://doi.org/10.1117/12.570801
Event: Optics East, 2004, Philadelphia, Pennsylvania, United States

Abstract

The introduction of new ATM service categories increases the benefits of ATM, making the technology suitable for a virtually unlimited range of applications. Connection Admission Control (CAC) is defined as the set of actions taken by the network during the call (virtual connection) set-up phase, or during call re-negotiation phase, to determine whether a connection request can be accepted or rejected. Network resources (port bandwidth and buffer space) are reserved to the incoming connection at each switching element traversed, if so required, by the service category. The major focus of this paper is call admission in the context of multi-service, multi-class ATM networks. Several strategies suggesting rules on bandwidth sharing are found in the litterature. This study investigates particularly the Complete Sharing approach. Two service categories are concerned, namely, Constant Bit rate/Deterministic Bit Rate (CBR/DBR) and Variable Bit Rate/Statistical Bit Rate (VBR/SBR). Each service category is represented by a set of call classes corresponding to different bandwidth needs. We propose two algorithms to solve the underlying Markovian system: Product-form and Recursive solutions. A performance study based on the latter algorithm is implemented. We analyze the results of this very sharing strategy and set the not-to-violate limits for a beneficial use of it.

Citation Download Citation

Salima Hamma and Gerard Hebuterne "Call admission algorithms in multiservice and multiclass ATM network", Proc. SPIE 5598, Performance, Quality of Service, and Control of Next-Generation Communication Networks II, (25 October 2004); https://doi.org/10.1117/12.570801

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
12 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Asynchronous transfer mode

Networks

Algorithm development

Chemical elements

Multiplexing

Neodymium

Statistical multiplexing

Show All Keywords

Keywords/Phrases

Search In:

Publication Years