Admission control based on a simple core network with intelligent ingress nodes

Admission control is one of the key components in QoS (quality of service) provisioning. Unless admission of a new flow does not cause QoS violation of existing flows, it cannot be admitted. In the past, the inequality for stability, Σρ_i≤C_j, where ρ_i is the rate of flow i and C_j is the link capacity of link j , is used to admit new connections without delay guarantee. Recently, the rate-variance method which utilizes the properties of aggregated flows was proposed to admit flows based on statistical guarantees. In this paper, we propose a new admission control mechanism for deterministic and statistical guarantees in a network with a simple core using FCFS service and intelligent ingress nodes. In this model, we have reduced the admission control calculations to two simple delay computations: a shaper delay and a network delay. If the ratio l/ρ, where l is the packet size and ρ is the service rate, is kept constant, the end-to-end delay of each flow is tightly bounded. This is verified by additional computer simulations. The idea involves the conversion of all bursty flows to pseudo-CBR flows before injecting the traffic into the core network. This approach reduces the complexity of the core and makes the network scalable.