Low Complexity Algorithm for Multi-path Video Streaming

In this paper, we propose a multi-path (e.g., WiFi, and LTE) video streaming algorithm for videos encoded using Scalable Video Coding (SVC) in which each chunk of the video is encoded into a single base layer and multiple enhancement layers. The multi-path SVC streaming subject to the available band...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Conference on Signal Processing and Communications s. 287 - 291
Hlavní autoři: Elgabli, Anis, Aggarwal, Vaneet, Liu, Ke
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2018
Témata:
ISSN:2474-915X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, we propose a multi-path (e.g., WiFi, and LTE) video streaming algorithm for videos encoded using Scalable Video Coding (SVC) in which each chunk of the video is encoded into a single base layer and multiple enhancement layers. The multi-path SVC streaming subject to the available bandwidth of the different paths and the chunk deadlines is formulated as a non convex optimization problem. The objective is to optimize a Quality of Experience (QoE) metric that maintains a tradeoff between maximizing the average quality and minimizing the rebuffering duration and quality switching rate. A novel polynomial time complexity algorithm is developed to solve the proposed non convex optimization problem. Extensive emulated experiments with real SVC encoded videos and real bandwidth traces of public dataset reveal the robustness of our scheme and show its significant performance improvement compared to other multi-path algorithms.
AbstractList In this paper, we propose a multi-path (e.g., WiFi, and LTE) video streaming algorithm for videos encoded using Scalable Video Coding (SVC) in which each chunk of the video is encoded into a single base layer and multiple enhancement layers. The multi-path SVC streaming subject to the available bandwidth of the different paths and the chunk deadlines is formulated as a non convex optimization problem. The objective is to optimize a Quality of Experience (QoE) metric that maintains a tradeoff between maximizing the average quality and minimizing the rebuffering duration and quality switching rate. A novel polynomial time complexity algorithm is developed to solve the proposed non convex optimization problem. Extensive emulated experiments with real SVC encoded videos and real bandwidth traces of public dataset reveal the robustness of our scheme and show its significant performance improvement compared to other multi-path algorithms.
Author Elgabli, Anis
Liu, Ke
Aggarwal, Vaneet
Author_xml – sequence: 1
  givenname: Anis
  surname: Elgabli
  fullname: Elgabli, Anis
  organization: Purdue University, West Lafayette, IN, 47907
– sequence: 2
  givenname: Vaneet
  surname: Aggarwal
  fullname: Aggarwal, Vaneet
  organization: Purdue University, West Lafayette, IN, 47907
– sequence: 3
  givenname: Ke
  surname: Liu
  fullname: Liu, Ke
  organization: Purdue University, West Lafayette, IN, 47907
BookMark eNotj11LwzAYhaMoOGf_gN7kD7S--Wjz9nIUv6BjwlS8G2mbbJG2KW1E9-8tuHNzeDjwwLkmF73vDSG3DBLGIL_fvhabdcKBYYKKS4npGYlyhSwVmAnkAOdkwaWScc7SzysSTdMXAAhgM8OCqNL_0MJ3Q2t-XTjSVbv3owuHjlo_0vV3G1w86HCgH64xnm7DaHTn-v0NubS6nUx06iV5f3x4K57jcvP0UqzK2DGVhtjyOrUNypyhBcHmWJFZ5GgV6FzJWsimamxaAYoqy4yuswqMQZtzZnGel-Tu3-uMMbthdJ0ej7vTVfEHs6pJGw
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/SPCOM.2018.8724485
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781538638200
1538638215
1538638207
9781538638217
EISSN 2474-915X
EndPage 291
ExternalDocumentID 8724485
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i175t-f2c5fd84918f031111f36f828f70a974c34dbdf5b083b66eac6b0ee8f921f84c3
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000490497200059&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:46:37 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-f2c5fd84918f031111f36f828f70a974c34dbdf5b083b66eac6b0ee8f921f84c3
PageCount 5
ParticipantIDs ieee_primary_8724485
PublicationCentury 2000
PublicationDate 2018-July
PublicationDateYYYYMMDD 2018-07-01
PublicationDate_xml – month: 07
  year: 2018
  text: 2018-July
PublicationDecade 2010
PublicationTitle International Conference on Signal Processing and Communications
PublicationTitleAbbrev SPCOM
PublicationYear 2018
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003019150
Score 1.6655226
Snippet In this paper, we propose a multi-path (e.g., WiFi, and LTE) video streaming algorithm for videos encoded using Scalable Video Coding (SVC) in which each chunk...
SourceID ieee
SourceType Publisher
StartPage 287
SubjectTerms Bandwidth
Complexity theory
Multi-path
Multi-path TCP
Prediction algorithms
Scalable Video Coding
Static VAr compensators
Streaming media
Video coding
Video Streaming
Wireless fidelity
Title Low Complexity Algorithm for Multi-path Video Streaming
URI https://ieeexplore.ieee.org/document/8724485
WOSCitedRecordID wos000490497200059&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB21FQe4sLSIXT5wxG2SxkuOqKLiAKUSi3qrvEIk2qCSgvh7xmkpIHEhJyuRFWVi-83Y894AnMaxS1OmGVUqMzRFyKM6lhFluB7ryCVGRrYqNiEGAzkaZcManK24MM65KvnMtUOzOsu3hZmHrbKOFAhGktWhLoRYcLVW-yk4UDN0br54MVHWuR32bq5D8pZsLzv-qqBSAUh_83-v3oLWNxOPDFcYsw01N92BjR8igk0QV8U7CdM6SFuWH-T8-bHAiP9pQtAfJRXBloa6w-Qht64g4RhaTbBnC-77F3e9S7osh0BzxPiS-sQwb2WaxdLjVMTLd7nHiMmLSGFYYLqp1dYzjV6V5hxXVI7WdtJnSewlPt6FxrSYuj0gqcGoSyvHk6D4FzMpeTeoRlrFjUoiuw_NYILxy0LxYrz8-oO_bx_CerDyIon1CBrlbO6OYc28lfnr7KT6TZ9OcJM-
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4gmqgXH2B824NHC_tod7tHQyQYAUlEw41sX0oirMFF4793uiBq4sU9NbtpNjvb9ptp5_sG4Nz3DWNccpqmiaIMIY9KX3iU43osPRMo4emi2ETc7YrBIOmV4GLJhTHGFMlnpuaaxVm-ztTMbZXVRYxgJPgKrHLGAn_O1lruqOBQTdC9-WLGeEn9rte47bj0LVFbdP1VQ6WAkObW_16-DdVvLh7pLVFmB0pmsgubP2QEKxC3s3fiJrYTt8w_yOXzY4Yx_9OYoEdKCootdZWHycNIm4y4g-h0jD2rcN-86jdadFEQgY4Q5XNqA8WtFizxhcXJiJcNI4sxk429FAMDFTItteUS_SoZRbimRmhvI2wS-Fbg4z0oT7KJ2QfCFMZdMjVR4DT_fC5EFDrdSJ1GKg08fQAVZ4Lhy1zzYrj4-sO_b5_BeqvfaQ_b192bI9hwFp-ntB5DOZ_OzAmsqbd89Do9LX7ZJynDloU
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=International+Conference+on+Signal+Processing+and+Communications&rft.atitle=Low+Complexity+Algorithm+for+Multi-path+Video+Streaming&rft.au=Elgabli%2C+Anis&rft.au=Aggarwal%2C+Vaneet&rft.au=Liu%2C+Ke&rft.date=2018-07-01&rft.pub=IEEE&rft.eissn=2474-915X&rft.spage=287&rft.epage=291&rft_id=info:doi/10.1109%2FSPCOM.2018.8724485&rft.externalDocID=8724485