Load balancing regenerating codes for multimedia content streaming

Juan Camilo Corena, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this article, we explore the use of a special type of erasure codes known as Regenerating Codes (RCs), as a way to perform load balancing among servers of a multimedia content streaming site. The goal of our construction is to reduce the costs of keeping the redundant servers by minimizing the amount of information that must be stored on disks as well as main memory. This proposal is advantageous for devices connecting through several means, such as a specialized video streaming device with two different internet connections or a smartphone connecting through Wi-Fi and a carrier simultaneously. To achieve this goal, we use a regenerating code based on a technique introduced by Rashmi et al. known as the Twin Code Framework. The use of this technique allows any user to connect to any k servers containing encoded fragments of the file to decode a particular part of it, while keeping the information overhead at the servers low. The construction also allows new copies to be created when demand increases; copies created at a later stage can be used in conjunction with previously created copies for load balancing purposes. In addition, any node in the system can be repaired with a relatively low amount of transmitted information compared to the length of the stored contents. Our instantiation of the framework uses Network Coding with coefficients drawn from a Hilbert Matrix.

Original languageEnglish
Title of host publicationIEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC
Pages3558-3562
Number of pages5
DOIs
Publication statusPublished - 2013
Event2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2013 - London, United Kingdom
Duration: 2013 Sep 82013 Sep 11

Other

Other2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2013
CountryUnited Kingdom
CityLondon
Period13/9/813/9/11

Fingerprint

Resource allocation
Servers
Wi-Fi
Network coding
Video streaming
Smartphones
Internet
Data storage equipment
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Corena, J. C., & Ohtsuki, T. (2013). Load balancing regenerating codes for multimedia content streaming. In IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC (pp. 3558-3562). [6666766] https://doi.org/10.1109/PIMRC.2013.6666766

Load balancing regenerating codes for multimedia content streaming. / Corena, Juan Camilo; Ohtsuki, Tomoaki.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. 2013. p. 3558-3562 6666766.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Corena, JC & Ohtsuki, T 2013, Load balancing regenerating codes for multimedia content streaming. in IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC., 6666766, pp. 3558-3562, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2013, London, United Kingdom, 13/9/8. https://doi.org/10.1109/PIMRC.2013.6666766
Corena JC, Ohtsuki T. Load balancing regenerating codes for multimedia content streaming. In IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. 2013. p. 3558-3562. 6666766 https://doi.org/10.1109/PIMRC.2013.6666766
Corena, Juan Camilo ; Ohtsuki, Tomoaki. / Load balancing regenerating codes for multimedia content streaming. IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC. 2013. pp. 3558-3562
@inproceedings{ada7524b9e6e4a25a384613df190814d,
title = "Load balancing regenerating codes for multimedia content streaming",
abstract = "In this article, we explore the use of a special type of erasure codes known as Regenerating Codes (RCs), as a way to perform load balancing among servers of a multimedia content streaming site. The goal of our construction is to reduce the costs of keeping the redundant servers by minimizing the amount of information that must be stored on disks as well as main memory. This proposal is advantageous for devices connecting through several means, such as a specialized video streaming device with two different internet connections or a smartphone connecting through Wi-Fi and a carrier simultaneously. To achieve this goal, we use a regenerating code based on a technique introduced by Rashmi et al. known as the Twin Code Framework. The use of this technique allows any user to connect to any k servers containing encoded fragments of the file to decode a particular part of it, while keeping the information overhead at the servers low. The construction also allows new copies to be created when demand increases; copies created at a later stage can be used in conjunction with previously created copies for load balancing purposes. In addition, any node in the system can be repaired with a relatively low amount of transmitted information compared to the length of the stored contents. Our instantiation of the framework uses Network Coding with coefficients drawn from a Hilbert Matrix.",
author = "Corena, {Juan Camilo} and Tomoaki Ohtsuki",
year = "2013",
doi = "10.1109/PIMRC.2013.6666766",
language = "English",
isbn = "9781467362351",
pages = "3558--3562",
booktitle = "IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC",

}

TY - GEN

T1 - Load balancing regenerating codes for multimedia content streaming

AU - Corena, Juan Camilo

AU - Ohtsuki, Tomoaki

PY - 2013

Y1 - 2013

N2 - In this article, we explore the use of a special type of erasure codes known as Regenerating Codes (RCs), as a way to perform load balancing among servers of a multimedia content streaming site. The goal of our construction is to reduce the costs of keeping the redundant servers by minimizing the amount of information that must be stored on disks as well as main memory. This proposal is advantageous for devices connecting through several means, such as a specialized video streaming device with two different internet connections or a smartphone connecting through Wi-Fi and a carrier simultaneously. To achieve this goal, we use a regenerating code based on a technique introduced by Rashmi et al. known as the Twin Code Framework. The use of this technique allows any user to connect to any k servers containing encoded fragments of the file to decode a particular part of it, while keeping the information overhead at the servers low. The construction also allows new copies to be created when demand increases; copies created at a later stage can be used in conjunction with previously created copies for load balancing purposes. In addition, any node in the system can be repaired with a relatively low amount of transmitted information compared to the length of the stored contents. Our instantiation of the framework uses Network Coding with coefficients drawn from a Hilbert Matrix.

AB - In this article, we explore the use of a special type of erasure codes known as Regenerating Codes (RCs), as a way to perform load balancing among servers of a multimedia content streaming site. The goal of our construction is to reduce the costs of keeping the redundant servers by minimizing the amount of information that must be stored on disks as well as main memory. This proposal is advantageous for devices connecting through several means, such as a specialized video streaming device with two different internet connections or a smartphone connecting through Wi-Fi and a carrier simultaneously. To achieve this goal, we use a regenerating code based on a technique introduced by Rashmi et al. known as the Twin Code Framework. The use of this technique allows any user to connect to any k servers containing encoded fragments of the file to decode a particular part of it, while keeping the information overhead at the servers low. The construction also allows new copies to be created when demand increases; copies created at a later stage can be used in conjunction with previously created copies for load balancing purposes. In addition, any node in the system can be repaired with a relatively low amount of transmitted information compared to the length of the stored contents. Our instantiation of the framework uses Network Coding with coefficients drawn from a Hilbert Matrix.

UR - http://www.scopus.com/inward/record.url?scp=84893285634&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84893285634&partnerID=8YFLogxK

U2 - 10.1109/PIMRC.2013.6666766

DO - 10.1109/PIMRC.2013.6666766

M3 - Conference contribution

SN - 9781467362351

SP - 3558

EP - 3562

BT - IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC

ER -