상세정보
학술지
A Flow Admission Control in Next Generation Networks with Flow Aggregate Information Exchange
- 발행일
- 201302
- 출처
- Telecommunication Systems, v.52 no.2, pp.363-374
- ISSN
- 1018-4864
- 출판사
- Springer
- 협약과제
- 10MI1400, BcN 전달망 및 서비스 구조 표준개발, 김정윤
- 초록
- 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. © 2011 Springer Science+Business Media, LLC.
- KSP 제안 키워드
- Admission control(AC), Aggregate information, Calculation procedure, Control scheme, End to End(E2E), End-to-end delay bound, End-to-end performance, Flow Admission Control, ITU-T, Information Exchange, Multi-access