TY - GEN
T1 - Stochastic QoS-based classification for link models with calculated service levels
AU - Mohamed, Amr
AU - Alnuweiri, Hussein
PY - 2005
Y1 - 2005
N2 - We investigate the problem of stochastic-QoS-based-classification of traffic streams for a multi-class-link-model with predetermined service levels calculated based on the link's total load. Specifically, we consider a link model with fixed service levels which may be represented by a finite number of MPLS-Label-Switched-Paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS requirement, in addition to the bandwidth demand into a small number of service-levels while optimizing the residual-allocated-resources as a result of the traffic classification. The residual-allocated-resources will be measured by the service-quantizationoverhead which is the summation of the differences between the required QoS and the offered service-level for all traffic streams. We formulate the classification as a constrained integer-linear optimization problem. We then present two efficient algorithms based on Branch and Bound technique to obtain the optimal classification for a set of traffic streams for link models with predetermined service levels.
AB - We investigate the problem of stochastic-QoS-based-classification of traffic streams for a multi-class-link-model with predetermined service levels calculated based on the link's total load. Specifically, we consider a link model with fixed service levels which may be represented by a finite number of MPLS-Label-Switched-Paths (LSPs). Our target is to classify a set of traffic streams each with arbitrary local QoS requirement, in addition to the bandwidth demand into a small number of service-levels while optimizing the residual-allocated-resources as a result of the traffic classification. The residual-allocated-resources will be measured by the service-quantizationoverhead which is the summation of the differences between the required QoS and the offered service-level for all traffic streams. We formulate the classification as a constrained integer-linear optimization problem. We then present two efficient algorithms based on Branch and Bound technique to obtain the optimal classification for a set of traffic streams for link models with predetermined service levels.
UR - https://www.scopus.com/pages/publications/33746835801
U2 - 10.1109/PACRIM.2005.1517301
DO - 10.1109/PACRIM.2005.1517301
M3 - Conference contribution
AN - SCOPUS:33746835801
SN - 0780391950
SN - 9780780391956
T3 - IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings
SP - 364
EP - 367
BT - 2005 IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing, PACRIM - Proceedings
T2 - 2005 IEEE Pacific RIM Conference on Communications, Computers, and Signal Processing, PACRIM
Y2 - 24 August 2005 through 26 August 2005
ER -