Premium
A congestion measure for call admission and traffic engineering for multi‐layer multi‐rate traffic
Author(s) -
Hui Joseph Y.
Publication year - 1990
Publication title -
international journal of digital and analog communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1047-9627
DOI - 10.1002/dac.4510030207
Subject(s) - computer science , network traffic control , measure (data warehouse) , poisson distribution , traffic congestion reconstruction with kerner's three phase theory , traffic engineering , traffic congestion , chernoff bound , traffic generation model , network congestion , computer network , data mining , engineering , transport engineering , mathematics , statistics , algorithm , network packet
We consider traffic control for services with constant bit rate (CBR) or multi‐layer Poisson statistics. Through the use of the Chernoff bound for the probability of traffic overflow, a congestion measure s * can be conveniently used for traffic control methodologies such as call admission and traffic engineering. We investigate extensively the mathematical properties of this congestion measure, and provide intuitive economical interpretations for the purpose of traffic integration. Applied to dynamic non‐hierarchical routing (DNHR), we show why the marginal bandwidth cost is a good criterion for choosing least cost paths.