QoS-enhanced TNPOSS Network Model and its E2E Delay Bound for Multimedia Flows

In our previous work, we proposed the TNPOSS (To Next-hop Port Sequence Switch) network which can achieve scalable fast forwarding and is suitable for delivering multimedia flows. However, TNPOSS network has no Quality of Service (QoS) tools to provide better QoS guarantee for multimedia flows which often have long-range dependence (LRD) property. To enhance the QoS ability of TNPOSS network, this paper proposes a QoS-enhanced TNPOSS (QTNPOSS) network model by introducing Fractal Leak Bucket (FLB) shaper and Weighted Fair Queuing (WFQ) scheduler into the original TNPOSS network. In the new QTNPOSS network, each packet of multimedia flows is shaped by the FLB when arriving at a node and is scheduled by the WFQ before being outputted. Based on study above, we further analyze the end-to-end (E2E) delay bound of QTNPOSS network by means of the network calculus theory which is an effective mathematical tool on analyzing the worst-case QoS performances of networks. The service curve and the formulation of E2E delay bound of QTNPOSS network are presented and proved. Extensive numerical experiments show that both the LRD property of multimedia flows and the WFQ weight have influences on the E2E delay bound, and the WFQ weight influences the E2E delay bound more greatly than the LRD property does.

[1]  Gregorio Procissi,et al.  Token bucket characterization of long-range dependent traffic , 2002, Comput. Commun..

[2]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[3]  Jean-Yves Le Boudec.  Some properties of variable length packet shapers , 2002, IEEE/ACM Trans. Netw..

[4]  Hongke Zhang,et al.  A scalable fast forwarding approach for IP networks , 2008, Int. J. Internet Protoc. Technol..

[5]  Chen Zhi-gang.  Models of bounds on end-to-end delay of long-range dependence traffic based on fractal leaky buckets , 2008 .

[6]  Zhigang Chen,et al.  Towards End-to-end Delay Bounds on WMNs Based on Statistical Network Calculus , 2008, 2008 The 9th International Conference for Young Computer Scientists.

[7]  J. Le Boudec.  Some properties of variable length packet shapers , 2001, SIGMETRICS '01.

[8]  Norio Shiratori,et al.  Self-similar and fractal nature of internet traffic , 2004, Int. J. Netw. Manag..

[9]  Yuming Jiang,et al.  Delay bound and packet scale rate guarantee for some expedited forwarding networks , 2006, Comput. Networks.

[10]  P. Van Mieghem,et al.  Measurements of the hopcount in internet , 2001 .

[11]  Srinivasan Keshav,et al.  An Engineering Approach to Computer Networking: ATM Networks , 1996 .

[12]  Jean-Yves Le Boudec,et al.  Network Calculus , 2001, Lecture Notes in Computer Science.

[13]  Towela P. R. Nyirenda-Jere,et al.  Impact of Traffic Aggregation on Network Capacity and Quality of Service : Preliminary Results , 2001 .

[14]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[15]  Wilton R. Abbott,et al.  Network Calculus , 1970 .