Logo image
Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams
Journal article   Peer reviewed

Fundamental tradeoffs in distributed algorithms for rate adaptive multimedia streams

Vilas Veeraraghavan and Steven Weber
Computer networks (Amsterdam, Netherlands : 1999), v 52(6), pp 1238-1251
24 Apr 2008

Abstract

Computer Science Computer Science, Hardware & Architecture Computer Science, Information Systems Engineering Engineering, Electrical & Electronic Science & Technology Technology Telecommunications
Rate adaptive multimedia streams adjust the encoding rate dynamically (with corresponding changes in media content resolution) in response to changing levels of congestion along the route. The field of optimization based congestion control has yielded sophisticated distributed algorithms for resource allocation among competing elastic streams. In this work we study the fundamental tradeoffs for a class of optimization based distributed algorithms for rate adaptive streams. We focus on three tradeoffs: (i) the tradeoff between maximizing client average quality of service (QoS) and client fairness, (ii) the tradeoff between granularity of control (both temporal and spatial) and QoS, and (iii) the tradeoff between maximizing the received volume and minimizing the fluctuations in received rate. We illustrate these tradeoffs through extensive ns-2 simulations on two distinct topologies - (i) a single bottleneck like and (ii) a linear network. (C) 2008 Elsevier B.V. All rights reserved.

Metrics

8 Record Views
7 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Hardware & Architecture
Computer Science, Information Systems
Engineering, Electrical & Electronic
Telecommunications
Logo image