Abstract
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.
Original language | English |
---|---|
Title of host publication | Gate to the Global Information Society: Proceedings of IEEE International Conference on Communications 2004 (ICC 2004), held in Paris, France, 20-24 June, 2004 |
Publisher | IEEE |
Number of pages | 5 |
ISBN (Print) | 0780385349 |
Publication status | Published - 2004 |
Event | IEEE International Conference on Communications - Duration: 10 Jun 2012 → … |
Conference
Conference | IEEE International Conference on Communications |
---|---|
Period | 10/06/12 → … |
Keywords
- Internet
- telecommunication networks and computer systems
- multimedia communications
- packet switching (data transmission)
- queuing theory