Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
FAST HEURISTICS FOR MULTI-PATH SELECTION FOR MULTIPLE DESCRIPTION ENCODED VIDEO STREAMING
 

Summary: FAST HEURISTICS FOR MULTI-PATH SELECTION FOR MULTIPLE DESCRIPTION
ENCODED VIDEO STREAMING
Ali C. Begen, Yucel Altunbasak and Ozlem Ergun
{acbegen, yucel}@ece.gatech.edu oergun@isye.gatech.edu
Georgia Institute of Technology, Atlanta, GA, USA
ABSTRACT
In a previous work [1], we proposed an optimal multi-path selec-
tion method for multiple description (MD) encoded video stream-
ing.1
To do so, we first modelled multi-path streaming and then
developed an expression, i.e., an objective (cost) function, that es-
timated average streaming distortion in terms of network statistics,
media characteristics and application requirements. Naturally, the
ultimate goal was to find the set of paths that minimized this cost
function. However, finding such sets of paths turned out to be in-
tractable in large topologies. Hence, in this paper, we provide a
fast heuristics-based solution by exploiting the infrastructure fea-
tures of the Internet. The simulations run over various random
Internet topologies show that the proposed heuristic is able to find
a good solution in a much shorter time than the brute-force ap-

  

Source: Altunbasak, Yucel - School of Electrical and Computer Engineering, Georgia Institute of Technology

 

Collections: Engineering