Quantization and cost computation of MDB-based admission and routing

Authors:
Chin-Tau Lea;Kai-Wei Ke
Affiliations:
School of Electrical and Computer Engineering, Georgia Institute of Technology;School of Electrical and Computer Engineering, Georgia Institute of Technology
Venue:
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
Year:
1996

Citing 3
Cited 1

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
Digital Coding of Waveforms: Principles and Applications to Speech and Video

Digital Coding of Waveforms: Principles and Applications to Speech and Video

Quantization, state reduction and cost-based admission and routing

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quantization, a process to restrict a continuous variable to a discrete one, has been a powerful technique for many fields of engineering. In this paper we show how to use the concept of quantization to compute the cost function of a Markov Decision Process (MDP)-based routing and admission policy in a broadband network.