Server placement in multiple-description-based media streaming

Satyajeet Ahuja, Marwan M Krunz

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

Abstract

Multiple description coding (MDC) is a powerful source coding technique that involves encoding a media stream into r independently decodeable substreams. With every successful reception of a substream, decoded signal quality improves. We consider the problem of placing a set of servers in the network such that a desired quality of service can be provided to a community of clients. We formulate the server placement (SP) problem, whose goal is to identify the minimum number of server locations that can provide r descriptions to a set of clients such that the delay associated with each path from a chosen server location to a given client is bounded by a given delay constraint and the total "unreliability" associated with the group of paths to a given client is also upper bounded. We show that the SP problem is NP-complete. We propose a mixed-integer linear programming (MILP) formulation and heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and to compare it with the MILP solution.

Original languageEnglish (US)
Title of host publicationData Compression Conference Proceedings
Pages372-381
Number of pages10
DOIs
StatePublished - 2008
Event2008 Data Compression Conference, DCC 2008 - Snowbird, UT, United States
Duration: Mar 25 2008Mar 27 2008

Other

Other2008 Data Compression Conference, DCC 2008
CountryUnited States
CitySnowbird, UT
Period3/25/083/27/08

Fingerprint

Media streaming
Servers
Linear programming
Computational complexity
Quality of service

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Ahuja, S., & Krunz, M. M. (2008). Server placement in multiple-description-based media streaming. In Data Compression Conference Proceedings (pp. 372-381). [4483315] https://doi.org/10.1109/DCC.2008.63

Server placement in multiple-description-based media streaming. / Ahuja, Satyajeet; Krunz, Marwan M.

Data Compression Conference Proceedings. 2008. p. 372-381 4483315.

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

Ahuja, S & Krunz, MM 2008, Server placement in multiple-description-based media streaming. in Data Compression Conference Proceedings., 4483315, pp. 372-381, 2008 Data Compression Conference, DCC 2008, Snowbird, UT, United States, 3/25/08. https://doi.org/10.1109/DCC.2008.63
Ahuja S, Krunz MM. Server placement in multiple-description-based media streaming. In Data Compression Conference Proceedings. 2008. p. 372-381. 4483315 https://doi.org/10.1109/DCC.2008.63
Ahuja, Satyajeet ; Krunz, Marwan M. / Server placement in multiple-description-based media streaming. Data Compression Conference Proceedings. 2008. pp. 372-381
@inproceedings{8ea5f2b36b8e4518805d53892e4d4fec,
title = "Server placement in multiple-description-based media streaming",
abstract = "Multiple description coding (MDC) is a powerful source coding technique that involves encoding a media stream into r independently decodeable substreams. With every successful reception of a substream, decoded signal quality improves. We consider the problem of placing a set of servers in the network such that a desired quality of service can be provided to a community of clients. We formulate the server placement (SP) problem, whose goal is to identify the minimum number of server locations that can provide r descriptions to a set of clients such that the delay associated with each path from a chosen server location to a given client is bounded by a given delay constraint and the total {"}unreliability{"} associated with the group of paths to a given client is also upper bounded. We show that the SP problem is NP-complete. We propose a mixed-integer linear programming (MILP) formulation and heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and to compare it with the MILP solution.",
author = "Satyajeet Ahuja and Krunz, {Marwan M}",
year = "2008",
doi = "10.1109/DCC.2008.63",
language = "English (US)",
isbn = "0769531210",
pages = "372--381",
booktitle = "Data Compression Conference Proceedings",

}

TY - GEN

T1 - Server placement in multiple-description-based media streaming

AU - Ahuja, Satyajeet

AU - Krunz, Marwan M

PY - 2008

Y1 - 2008

N2 - Multiple description coding (MDC) is a powerful source coding technique that involves encoding a media stream into r independently decodeable substreams. With every successful reception of a substream, decoded signal quality improves. We consider the problem of placing a set of servers in the network such that a desired quality of service can be provided to a community of clients. We formulate the server placement (SP) problem, whose goal is to identify the minimum number of server locations that can provide r descriptions to a set of clients such that the delay associated with each path from a chosen server location to a given client is bounded by a given delay constraint and the total "unreliability" associated with the group of paths to a given client is also upper bounded. We show that the SP problem is NP-complete. We propose a mixed-integer linear programming (MILP) formulation and heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and to compare it with the MILP solution.

AB - Multiple description coding (MDC) is a powerful source coding technique that involves encoding a media stream into r independently decodeable substreams. With every successful reception of a substream, decoded signal quality improves. We consider the problem of placing a set of servers in the network such that a desired quality of service can be provided to a community of clients. We formulate the server placement (SP) problem, whose goal is to identify the minimum number of server locations that can provide r descriptions to a set of clients such that the delay associated with each path from a chosen server location to a given client is bounded by a given delay constraint and the total "unreliability" associated with the group of paths to a given client is also upper bounded. We show that the SP problem is NP-complete. We propose a mixed-integer linear programming (MILP) formulation and heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and to compare it with the MILP solution.

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

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

U2 - 10.1109/DCC.2008.63

DO - 10.1109/DCC.2008.63

M3 - Conference contribution

AN - SCOPUS:50249097315

SN - 0769531210

SN - 9780769531212

SP - 372

EP - 381

BT - Data Compression Conference Proceedings

ER -