By Topic

Bandwidth availability aware defragmentation based CAC algorithm for IEEE 802.16 distributed mesh networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
De Rango, F. ; DEIS Dept., Univ. of Calabria, Rende, Italy ; Malfitano, A.

The interest about distributed network architectures is arising. It allows to obtain more scalable network and in this context, also the interest of research around the IEEE 802.16 distributed mesh mode is growing. The mesh distributed mode supported by IEEE 802.16 protocol, with the capability to establish direct links between SSs (Subscriber Station) and with the wide coverage area and the promised bits rate, allows to create interesting scenarios. The protocol defines guidelines to realize request/grant process, but it presents some lacks, one of these is the absence of a distributed call admission control (CAC) algorithm. This process is essential to guarantee QoS constraints to admitted connections. In this paper, we present GCAD-CAC (Greedy Choice with Bandwidth Availability aware Defragmentation): a new call admission control algorithm to guarantee the respect of data flows delay constraints defined by three different traffic classes. To reach good results, the algorithm tries to accept all the new requests, but when a higher priority request is received, a lower priority admitted request is preempted. The preemption can leave in data subframe some little gaps not sufficient to new connection admission; these gaps can be collected by GCAD algorithm by activating a bandwidth availability based defragmentation process. The algorithm quality is proved by a comparison with other two algorithms found in the literature.

Published in:

Performance Evaluation of Computer & Telecommunication Systems, 2009. SPECTS 2009. International Symposium on  (Volume:41 )

Date of Conference:

13-16 July 2009