Abstract
As the Internet transforms from the traditional best-effort service network into QoS-capable multi-service network, it is essential to have new architectural design and appropriate traffic control algorithms in place. This paper presents a network node architecture and several traffic management mechanisms that are capable of achieving QoS provisioning for the guaranteed service (GS), the controlled-load (CL) service, and the best-effort (BE) service for future integrated services networks. A key feature of our architecture is that it resolves the out-of-sequence problem associated with the traditional design. We also propose two novel packet discarding mechanisms called selective pushout (SP) and selective pushout plus (SP+). Simulation results show that, once admitted into the network, our architecture and traffic management algorithms provide, under all conditions, hard performance guarantees to GS flows and consistent (or soft) performance guarantees to CL flows, respectively; minimal negative impact to in-profile GS, CL and BE traffic should there be any out-of-profile behavior from some CL flows.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H.J. Chao, Y.R. Jenq, X. Guo and C.H. Lam, Design of packet-fair queueing schedulers using a RAM-based searching engine, IEEE Journal on Selected Areas in Communications 17(6) (June 1999) 1105-1126.
A.K. Choudhury and E.L. Hahne, Dynamic queue length thresholds in a shared memory ATM switch, in: Proc. of IEEE INFOCOM'96, San Francisco, CA, USA, March 1996, pp. 679-687.
D. Clark, S. Shenker and L. Zhang, Supporting real-time applications in an integrated services packet network: architecture and mechanism, in: Proc. of ACM SIGCOMM'92, Baltimore, MD, USA, August 1992.
L. Georgiadis, R. Guerin, V. Peris and R. Rajan, Efficient support of delay and rate guarantee, in: Proc. of ACM SIGCOMM'96, Stanford, CA, USA, August 1996.
S. Jamin, P.B. Danzig, S. Shenker and L. Zhang, A measurement-based admission control algorithm for integrated services packet networks, IEEE/ACMTransactions on Networking 5(1) (February 1997) 56-70.
S. Shenker, C. Partridge and R. Guerin, Specification of guaranteed quality of service, RFC 2212, Internet Engineering Task Force (September 1997).
D. Stiliadis and A. Varma, A general methodology for designing efficient traffic scheduling and shaping algorithms, in: Proc. of IEEE INFOCOM'97, Kobe, Japan, April 1997.
B. Suter, T.V. Lakshman, D. Stiliadis and A.K. Choudhury, Design considerations for supporting TCP with per-flow queueing, in: Proc. of IEEE INFOCOM'98, San Francisco, CA, USA, March 1998, pp. 299-306.
J. Wroclawski, Specification of the controlled-load network element service, RFC 2211, Internet Engineering Task Force (September 1997).
D. Wu and H.J. Chao, Efficient bandwidth allocation and call admission control for VBR service using UPC parameters, in: Proc. of IEEE INFOCOM'99, New York, NY, USA, March 1999.
D. Wu, Y.T. Hou, Z.-L. Zhang, H.J. Chao, T. Hamada and T. Taniguchi, On implementation architecture for achieving QoS provisioning in integrated services networks, in: Proc. of IEEE ICC'99, Vancouver, BC, Canada, June 1999, pp. 461-468.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wu, D., Hou, Y.T., Li, B. et al. A Per-Flow Based Node Architecture for Integrated Services Packet Networks. Telecommunication Systems 17, 135–160 (2001). https://doi.org/10.1023/A:1016608221139
Issue Date:
DOI: https://doi.org/10.1023/A:1016608221139