Quantization, state reduction and cost-based admission and routing

Authors:
Chin-Tau Lea;Kai-Wei Ke
Affiliations:
Department of Electrical and Electronic Engineering, Hong Kong University of Science and Technology, Hong Kong;School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA, USA
Venue:
Computer Communications
Year:
1996

Citing 6
Cited 0

Stochastic modelling and analysis: a computational approach

Stochastic modelling and analysis: a computational approach
Routing in the Internet

Routing in the Internet
Bandwidth quantization and states reduction in the broadband ISDN

IEEE/ACM Transactions on Networking (TON)
Routing and Dimensioning in Circuit-Switched Networks

Routing and Dimensioning in Circuit-Switched Networks
Quantization and cost computation of MDB-based admission and routing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Design and control of networks with dynamic nonhierarchical routing

IEEE Communications Magazine

Quantified Score

Hi-index	0.24

Visualization

Abstract

Cost-based admission and routing have been widely discussed and used in telephone switching networks, but their application in a multirate high-speed network is severely hindered by the enormous number of states of the Markov model describing the network. In this paper we show how to apply the concept of quantization to reduce the states of the model. Once the state space is reduced, conventional techniques can then be used to compute the cost function for a cost-based admission and routing scheme. The proposed method is policy-independent, meaning that it can be applied to different call admission policies.