A flow admission control in Next Generation Networks with flow aggregate information exchange

Abstract

Next Generation Networks (NGN) is defined as a set of multi-access, multi-transport, multi-service packet-based networks. There exists a variety of Quality of Service (QoS) architectures within NGN, therefore it is common to aggregate and de-aggregate flows at the boundaries of networks. A key question arises regarding the network performance is therefore whether we can guarantee end-to-end performance in this circumstance. In this work an efficient method for calculating end-to-end delay bounds of flows is given, which experience repetitive flow aggregations and de-aggregations. The calculation procedure requires network parameters exchanged among networks in the path as well as the traffic parameters of a flow. It is assumed that such parameters are exchanged according to a standard process recently approved in ITU-T. It is then suggested a simple admission control scheme for flows with strict delay bound requirements. In this scheme aggregation edge nodes store information only per flow aggregate; therefore the scalability is ensured. The delay bound and the admission control scheme are evaluated with simulations in a few realistic scenarios.