Browse > Article

An Admission Control for End-to-end Performance Guarantee in Next Generation Networks  

Joung, Jin-Oo (상명대학교 컴퓨터과학부)
Choi, Jeong-Min (상명대학교 컴퓨터과학부)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.35, no.8B, 2010 , pp. 1141-1149 More about this Journal
Abstract
Next Generation Networks (NGN) is defined as IP-based networks with multi-services and with multi-access networks. A variety of services and access technologies are co-existed within NGN. Therefore there are numerous transport technologies such as Differentiated Services (DiffServ), Multi-protocol Label Switching (MPLS), and the combined transport technologies. In such an environment, flows are aggregated and de-aggregated multiple times in their end-to-end paths. In this research, a method for calculating end-to-end delay bound for such a flow, provided that the information exchanged among networks regarding flow aggregates, especially the maximum burst size of a flow aggregate entering a network. We suggest an admission control mechanism that can decide whether the requested performance for a flow can be met. We further verify the suggested calculation and admission algorithm with a few realistic scenarios.
Keywords
Admission Control; Delay Bound; Flow Aggregation; LR Server; QoS;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 ITU-T Recommendation Y.1541, Network performance objectives for IP-based services, Feb., 2006.
2 W. Sun and K. G. Shin, End-to-End Delay Bounds for Traffic Aggregates Under Guaranteed-Rate Scheduling Algorithms, IEEE/ACM Transactions on Networking, Vol.13, No.5, Oct., 2005.
3 K. Kompella and Y. Rekhter, Label Switched Paths (LSP) Hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Engineering (TE), IETF RFC 4206, 2005.
4 J. Joung, J. Song, and S.S. Lee, Flow Aggregation Criteria in Networks with Rate-Guaranteeing Servers, 한국통신학회논문지 33권 12호, 2008년 12월.   과학기술학회마을
5 J. Joung, Feasibility of Supporting Real-Tirne Traffic in DiffServ Architecture, in Proc. of WWIC 2007, also in LNCS Vol.4517, pp.189-200, May, 2007.
6 F. Ciucu, A. Burchard, and J. Liebeherr, A Network Service Curve Approach for the Stochastic Analysis of Networks, in Proc. of SIGMETRICS, June, 2005.
7 ITU-T Recommendation Y.1542, Framework for achieving end-to-end IP performance objectives, July, 2006.
8 D. Clark, S. Shenker, and L. Zhang, Supporting Real- Time Applications in an Integrated Services Packet Network: Architecture and Mechanism, in Proc. SIGCOMM '92, Sep., 1992.
9 A. Charny and J.-Y. Le Boudec, Delay bounds in a network with aggregate scheduling, In Proc. First International Workshop of Quality of Future Internet Services (QOFIS), 2000.
10 D. Stiliadis and A. Varma, Latency-Rate servers: A general model for analysis of traffic scheduling algorithms, IEEE/ACM Trans. Networking, Vol.6, No.5 Oct., 1998.
11 ITU-T Recommendation Y.2122, Flow Aggregate Informatìon Exchange Functions in NGN, 2009.