Algorithms for server placement in multiple-description-based media streaming

Satyajeet Ahuja, Marwan M Krunz

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a media stream into r substreams that are sent independently from a source to a destination. Each substream (or description) can be decoded independent of the other r - 1 substreams. With every successful reception of a substream, the quality of the decoded signal improves. In this paper, 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 that request MDC-coded traffic. We formulate the server placement (SP) problem, with the goal of identifying 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 belongs to the class of NP-complete problems. We propose a mixed-integer linear programming (MILP) formulation and an efficient heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution provided by the MILP solution.

Original languageEnglish (US)
Article number4668503
Pages (from-to)1382-1392
Number of pages11
JournalIEEE Transactions on Multimedia
Volume10
Issue number7
DOIs
StatePublished - Nov 2008

Fingerprint

Media streaming
Servers
Linear programming
Packet networks
Computational complexity
Quality of service
Communication

Keywords

  • Multiple description coding
  • Path diversity

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing
  • Media Technology
  • Computer Science Applications

Cite this

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

In: IEEE Transactions on Multimedia, Vol. 10, No. 7, 4668503, 11.2008, p. 1382-1392.

Research output: Contribution to journalArticle

@article{0d8a21e2ba0440edb583d780b9053444,
title = "Algorithms for server placement in multiple-description-based media streaming",
abstract = "Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a media stream into r substreams that are sent independently from a source to a destination. Each substream (or description) can be decoded independent of the other r - 1 substreams. With every successful reception of a substream, the quality of the decoded signal improves. In this paper, 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 that request MDC-coded traffic. We formulate the server placement (SP) problem, with the goal of identifying 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 belongs to the class of NP-complete problems. We propose a mixed-integer linear programming (MILP) formulation and an efficient heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution provided by the MILP solution.",
keywords = "Multiple description coding, Path diversity",
author = "Satyajeet Ahuja and Krunz, {Marwan M}",
year = "2008",
month = "11",
doi = "10.1109/TMM.2008.2004930",
language = "English (US)",
volume = "10",
pages = "1382--1392",
journal = "IEEE Transactions on Multimedia",
issn = "1520-9210",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

TY - JOUR

T1 - Algorithms for server placement in multiple-description-based media streaming

AU - Ahuja, Satyajeet

AU - Krunz, Marwan M

PY - 2008/11

Y1 - 2008/11

N2 - Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a media stream into r substreams that are sent independently from a source to a destination. Each substream (or description) can be decoded independent of the other r - 1 substreams. With every successful reception of a substream, the quality of the decoded signal improves. In this paper, 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 that request MDC-coded traffic. We formulate the server placement (SP) problem, with the goal of identifying 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 belongs to the class of NP-complete problems. We propose a mixed-integer linear programming (MILP) formulation and an efficient heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution provided by the MILP solution.

AB - Multiple description coding (MDC) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding a media stream into r substreams that are sent independently from a source to a destination. Each substream (or description) can be decoded independent of the other r - 1 substreams. With every successful reception of a substream, the quality of the decoded signal improves. In this paper, 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 that request MDC-coded traffic. We formulate the server placement (SP) problem, with the goal of identifying 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 belongs to the class of NP-complete problems. We propose a mixed-integer linear programming (MILP) formulation and an efficient heuristic solution for the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution provided by the MILP solution.

KW - Multiple description coding

KW - Path diversity

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

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

U2 - 10.1109/TMM.2008.2004930

DO - 10.1109/TMM.2008.2004930

M3 - Article

AN - SCOPUS:56549128383

VL - 10

SP - 1382

EP - 1392

JO - IEEE Transactions on Multimedia

JF - IEEE Transactions on Multimedia

SN - 1520-9210

IS - 7

M1 - 4668503

ER -