Avoiding useless multimedia packet over DiffServ networks with multiple bottleneck

Useless packet transmission (UPT) arises when a multimedia stream becomes unintelligible because too many packets, in aggregate, are dropped by fair queuing algorithms at routers, even with low drop rates at individual routers. We propose two UPT avoidance (UPTA) schemes for networks with multiple congested links: partial UPTA (P-UPTA), which is core-stateless, and centralized UPTA (C-UPTA), which employs a bottleneck fairshare discovery (BFD) protocol to determine a flow's global fairshare. Our simulation study shows that P-UPTA eventually detects UPT, but bandwidth may be wasted on upstream links before UPT is detected, whereas C-UPTA avoids UPT in all situations as it always drops useless packets at the network edge. We quantitatively analyse the performance of C-UPTA in conjunction with WFQ, in terms of TCP throughput, file download time, MPEG-2 video intelligibility, and fairness. The results reveal that, for the scenarios simulated, the TCP throughput is improved by up to 50% without any significant impact on the intelligibility of the MPEG-2 video and the fairness of the scheduling algorithm.

[1]  Keith W. Ross,et al.  Computer networking - a top-down approach featuring the internet , 2000 .

[2]  한선영.  [서평]「Understanding Networked Multimedia applications and technology」 , 1996 .

[3]  Wu-chang Fengy,et al.  BLUE: A New Class of Active Queue Management Algorithms , 1999 .

[4]  Scott Shenker,et al.  Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks , 1998, SIGCOMM '98.

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

[6]  Jenny Chapman,et al.  Digital Multimedia , 2000 .

[7]  Kang G. Shin,et al.  Stochastic fair blue: a queue management algorithm for enforcing fairness , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[8]  Ellen W. Zegura,et al.  Rainbow fair queueing: fair bandwidth sharing without per-flow state , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[9]  Jizhong Jim Wu,et al.  Techniques to avoid useless packet transmission in multimedia over best-effort networks , 2003 .

[10]  Konstantinos Psounis,et al.  CHOKe - a stateless active queue management scheme for approximating fair bandwidth allocation , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .