This paper presents the development of a measurement based flow admission control (M-FAC) mechanism, which is used in conjunction with Class Based Queuing (CBQ) to support guaranteed services in multiservice packet switched networks. M-FAC uses an analytical queuing model to decide if a new flow may be admitted into a particular class, and bases this decision on the parameters provided by the flow's source. However, once the new flow has been accepted, M-FAC continually monitors the arrival process in order to determine the true load on the class' queue. This true load is then used in subsequent admission tests. The analytical model was developed in previous work, and this paper focuses on the development of the monitoring process. This paper introduces the monitoring process and explains how it is used by M-FAC to continually update the estimate of the instantaneous load vector, and presents the results from a simulation experiment designed to evaluate the effectiveness of this monitoring process.
[1]
Simon Crosby,et al.
Practical connection admission control for ATM networks based on on-line measurements
,
1998,
Comput. Commun..
[2]
K ParekhAbhay,et al.
A generalized processor sharing approach to flow control in integrated services networks
,
1993
.
[3]
Van Jacobson,et al.
Link-sharing and resource management models for packet networks
,
1995,
TNET.
[4]
QUTdN QeO,et al.
Random early detection gateways for congestion avoidance
,
1993,
TNET.
[5]
F. Ball,et al.
Supporting adaptive video applications in future IP networks
,
1999
.
[6]
Abhay Parekh,et al.
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
,
1993,
TNET.
[7]
Frank G. Ball,et al.
A GENERIC ARCHITECTURE FOR MULTISERVICE ROUTING
,
2000
.