A coarse-grain analysis for the performance of measurement-based admission control algorithms

Abdelnasser M. Abdelaal, Hesham H Ali, Hamid Sharif

Research output: Contribution to journalArticle

Abstract

Network load control mechanisms have become important due to merging towards IP-packet switched networks, Fixed-Mobile Convergence (FMC) and the growing diversity of Internet applications. These applications vary in terms of size, content, time duration, and Quality of Service (QoS) requirements. These current advancements require new design criteria for traffic control mechanisms to cope with the growing complexity of future networks and the increasing diversity of network applications. Previous work on the design and performance evaluation criteria of Call Admission Control (CAC) algorithms has taken link utilization as a measure of efficient allocation of available network resources while enhancing QoS. We believe that considering only link utilization to evaluate the performance of CAC algorithms is not an accurate criterion. In this paper, we propose a simple and robust method for evaluating the performance and design considerations of CAC algorithms. The proposed approach is based on flow parameters such as call admission rate, call rejection rate, average call duration and provided QoS parameters with respect to link utilization level. This flow-based evaluation method is particularly important for optimal resource allocation, efficient service management and content-based pricing.

Original languageEnglish (US)
Pages (from-to)S349-S358
JournalJournal of Computational Methods in Sciences and Engineering
Volume6
Issue number5-6
StatePublished - 2006

Fingerprint

Congestion control (communication)
Admission Control
Access control
Control Algorithm
Quality of service
Call Admission Control
Telecommunication links
Quality of Service
Packet networks
Traffic control
Merging
Resource allocation
Internet
Service Management
Traffic Control
Robust Methods
Optimal Allocation
Evaluation Method
Rejection
Resource Allocation

Keywords

  • Call admission control
  • quality of service (QoS)
  • traffic control

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Mathematics
  • Engineering(all)

Cite this

A coarse-grain analysis for the performance of measurement-based admission control algorithms. / Abdelaal, Abdelnasser M.; Ali, Hesham H; Sharif, Hamid.

In: Journal of Computational Methods in Sciences and Engineering, Vol. 6, No. 5-6, 2006, p. S349-S358.

Research output: Contribution to journalArticle

@article{f3143b934adc44489cc1b9154f13405e,
title = "A coarse-grain analysis for the performance of measurement-based admission control algorithms",
abstract = "Network load control mechanisms have become important due to merging towards IP-packet switched networks, Fixed-Mobile Convergence (FMC) and the growing diversity of Internet applications. These applications vary in terms of size, content, time duration, and Quality of Service (QoS) requirements. These current advancements require new design criteria for traffic control mechanisms to cope with the growing complexity of future networks and the increasing diversity of network applications. Previous work on the design and performance evaluation criteria of Call Admission Control (CAC) algorithms has taken link utilization as a measure of efficient allocation of available network resources while enhancing QoS. We believe that considering only link utilization to evaluate the performance of CAC algorithms is not an accurate criterion. In this paper, we propose a simple and robust method for evaluating the performance and design considerations of CAC algorithms. The proposed approach is based on flow parameters such as call admission rate, call rejection rate, average call duration and provided QoS parameters with respect to link utilization level. This flow-based evaluation method is particularly important for optimal resource allocation, efficient service management and content-based pricing.",
keywords = "Call admission control, quality of service (QoS), traffic control",
author = "Abdelaal, {Abdelnasser M.} and Ali, {Hesham H} and Hamid Sharif",
year = "2006",
language = "English (US)",
volume = "6",
pages = "S349--S358",
journal = "Journal of Computational Methods in Sciences and Engineering",
issn = "1472-7978",
publisher = "IOS Press",
number = "5-6",

}

TY - JOUR

T1 - A coarse-grain analysis for the performance of measurement-based admission control algorithms

AU - Abdelaal, Abdelnasser M.

AU - Ali, Hesham H

AU - Sharif, Hamid

PY - 2006

Y1 - 2006

N2 - Network load control mechanisms have become important due to merging towards IP-packet switched networks, Fixed-Mobile Convergence (FMC) and the growing diversity of Internet applications. These applications vary in terms of size, content, time duration, and Quality of Service (QoS) requirements. These current advancements require new design criteria for traffic control mechanisms to cope with the growing complexity of future networks and the increasing diversity of network applications. Previous work on the design and performance evaluation criteria of Call Admission Control (CAC) algorithms has taken link utilization as a measure of efficient allocation of available network resources while enhancing QoS. We believe that considering only link utilization to evaluate the performance of CAC algorithms is not an accurate criterion. In this paper, we propose a simple and robust method for evaluating the performance and design considerations of CAC algorithms. The proposed approach is based on flow parameters such as call admission rate, call rejection rate, average call duration and provided QoS parameters with respect to link utilization level. This flow-based evaluation method is particularly important for optimal resource allocation, efficient service management and content-based pricing.

AB - Network load control mechanisms have become important due to merging towards IP-packet switched networks, Fixed-Mobile Convergence (FMC) and the growing diversity of Internet applications. These applications vary in terms of size, content, time duration, and Quality of Service (QoS) requirements. These current advancements require new design criteria for traffic control mechanisms to cope with the growing complexity of future networks and the increasing diversity of network applications. Previous work on the design and performance evaluation criteria of Call Admission Control (CAC) algorithms has taken link utilization as a measure of efficient allocation of available network resources while enhancing QoS. We believe that considering only link utilization to evaluate the performance of CAC algorithms is not an accurate criterion. In this paper, we propose a simple and robust method for evaluating the performance and design considerations of CAC algorithms. The proposed approach is based on flow parameters such as call admission rate, call rejection rate, average call duration and provided QoS parameters with respect to link utilization level. This flow-based evaluation method is particularly important for optimal resource allocation, efficient service management and content-based pricing.

KW - Call admission control

KW - quality of service (QoS)

KW - traffic control

UR - http://www.scopus.com/inward/record.url?scp=84948664164&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948664164&partnerID=8YFLogxK

M3 - Article

VL - 6

SP - S349-S358

JO - Journal of Computational Methods in Sciences and Engineering

JF - Journal of Computational Methods in Sciences and Engineering

SN - 1472-7978

IS - 5-6

ER -