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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clark, D., Shenker, S., & Zhang, L. (1992). Supporting real-time applications in an integrated services packet network: architecture and mechanism. In Proc. SIGCOMM ’92, Sep. 1992.
Sun, W., & Shin, K. G. (2005). End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms. IEEE/ACM Transactions on Networking, 13(5).
Charny, A., & Le Boudec, J.-Y. (2000). Delay bounds in a network with aggregate scheduling. In Proc. first international workshop of Quality of Future Internet Services (QOFIS).
Song, J., Chang, M. Y., Lee, S. S., & Joung, J. (2007). Overview of ITU-T NGN QoS control. IEEE Communications Magazine, 116–123.
ITU-T NGN-GSI (2005). Requirements and framework for end-to-end QoS in NGN. In: NGN FG proceedings part II (pp. 325–363).
ITU-T Recommendation Y.1541. Network performance objectives for IP-based services, Feb. 2006.
ITU-T Recommendation Y.1542. Framework for achieving end-to-end IP performance objectives, July 2006.
ITU-T Recommendation Y.2122. Flow Aggregate Information Exchange Functions in NGN, 2009.
ITU-T Recommendation Y.2173. Management of performance measurement for NGN, Sep. 2008.
Sadasivan, G., Brownlee, N., Claise, B., & Quittek, J. (2009). Architecture for IP flow information export. IETF RFC 5470, March 2009.
Stiliadis, D. (1996). Traffic scheduling in packet-switched networks: analysis, design and implementation. Ph.D. Dissertation, U.C. Santa Cruz, June 1996.
Chlamtac, I., Farago, A., Zhang, H., & Fumagalli, A. (1998). A deterministic approach to the end-to-end analysis of packet flows in connection-oriented networks. IEEE/ACM Transactions on Networking, 6(4).
Kompella, K., & Rekhter, Y. (2005). Label Switched Paths (LSP) hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Engineering (TE). IETF RFC 4206. U-T Recommendation Y.1542. Framework for achieving end-to-end IP performance objectives, July 2006.
ITU-T Recommendation Y.1223. Interworking guidelines for transporting assured IP flows, July 2008.
Stiliadis, D., & Varma, A. (1998). Efficient fair queuing algorithms for packet-switched networks. IEEE/ACM Transactions on Networking, 6(2).
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the IT R&D program of MKE/KEIT, Rep. of Korea [2006-S-064-01, Research on BcN Network Engineering Technologies].
Rights and permissions
About this article
Cite this article
Joung, J., Choi, J., Min, S. et al. A flow admission control in Next Generation Networks with flow aggregate information exchange. Telecommun Syst 52, 363–374 (2013). https://doi.org/10.1007/s11235-011-9444-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11235-011-9444-1