Admission control in computer networks with uncertain parameters

Abstract

Purpose

The purpose of this paper is to deal with a problem of admission control in computer networks when some of their parameters are uncertain. The case is considered when the most common probabilistic description of the uncertainty cannot be used and another approach should be applied.

Design/methodology/approach

The uncertain versions of admission control problem with quality of service requirements are considered. The uncertain variables are used to describe possible values of the unknown parameters in computer networks.

Findings

Given are formulations for the admission control problem in computer networks with unknown values of the capacities based on the network utility maximization concept. Solution algorithms for all these problems are proposed.

Research limitations/implications

It is assumed that an expert can describe possible values of uncertain network parameters in the form of a certainty distribution. Then the formalism of uncertain variables is applied and the knowledge of an expert is modelled with the use of certainty distributions. Decisions strongly depends on the quality of an expert's knowledge.

Practical implications

Obtained admission control algorithms can be useful for planning and designing of computer networks.

Originality/value

A new approach to the admission control problem in computer networks in the presence of uncertainty, in the case when the uncertain variable can be applied, is proposed and discussed.

Citation

Gąsior, D. (2009), "Admission control in computer networks with uncertain parameters", Kybernetes, Vol. 38 No. 7/8, pp. 1282-1297. https://doi.org/10.1108/03684920910976970