Resource allocation and connection admission control in satellite networks

Citation
H. Koraitim et S. Tohme, Resource allocation and connection admission control in satellite networks, IEEE J SEL, 17(2), 1999, pp. 360-372
Citations number
18
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS
ISSN journal
07338716 → ACNP
Volume
17
Issue
2
Year of publication
1999
Pages
360 - 372
Database
ISI
SICI code
0733-8716(199902)17:2<360:RAACAC>2.0.ZU;2-#
Abstract
This work focuses on resource allocation and connection admission control ( CAC) issues in broadband satellite networks. Broadband services can now be provided by satellite systems operating in the Ka band, due to the large ba ndwidth available at such frequencies. In this context, we propose a resour ce allocation algorithm which integrates three classes of services at the M AC layer: constant bit rate (CBR), bursty data, and best effort services. T he double movable boundary strategy (DMBS) is proposed to establish a resou rce-sharing policy among these service classes over the satellite uplink ch annel. The DMBS is a dynamically controlled boundary policy which adapts th e allocation decision to the variable network loading conditions. Connectio n-oriented and connectionless services can be supported by the system. The CAC and slot allocation decisions are taken at the beginning of each contro l period after monitoring the filling level of traffic request queues. A th reshold level for the bursty data request queue is defined to regulate the CAC process, The impact of the queue threshold value on the performance of the DMBS allocation policy is particularly evaluated in this study. A dynam ic variation of this value is also proposed to enhance the system response to interactive applications. We present a brief analytical formulation for the DMBS model, together with simulation study details and performance eval uation results, The obtained results indicate a good efficiency, in terms o f overall channel throughput and CBR blocking probability, for both fixed a nd dynamic data queue threshold approaches, The dynamic approach, however, outperforms the fixed one in terms of overall encountered bursty data delay .