Algorithms for 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) has emerged as a powerful technique for reliable real-time communications over lossy packet networks. In its basic form, it involves encoding media into m substreams that are routed independently towards a given destination. Each substream can be decoded independently and with every successful reception of a substream, the overall quality of the decoded signal is improved. In this paper, we consider the problem of placing a set of servers in the network such that a desired QoS can be provided to a community of clients that request MDC coded traffic. Specifically, we consider the server placement (SP) problem where the goal is to identify the "optimal" server positions and associated set of client-server paths such that if MDC content is placed at these servers a cost function that is a linear combination of average delay and path disjointness is minimized. We propose an MILP formulation and a highly efficient heuristic to solve the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution obtained by using the MILP solution.

Original languageEnglish (US)
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
DOIs
StatePublished - 2006
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: Nov 27 2006Dec 1 2006

Other

OtherIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
CountryUnited States
CitySan Francisco, CA
Period11/27/0612/1/06

Fingerprint

Media streaming
Servers
Packet networks
Cost functions
Quality of service
Communication

Keywords

  • Content delivery networks
  • Media streaming
  • Multiple description coding
  • Path diversity
  • Path selection

ASJC Scopus subject areas

  • Engineering(all)

Cite this

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

GLOBECOM - IEEE Global Telecommunications Conference. 2006. 4150830.

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

Ahuja, S & Krunz, MM 2006, Algorithms for server placement in multiple-description-based media streaming. in GLOBECOM - IEEE Global Telecommunications Conference., 4150830, IEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference, San Francisco, CA, United States, 11/27/06. https://doi.org/10.1109/GLOCOM.2006.200
Ahuja, Satyajeet ; Krunz, Marwan M. / Algorithms for server placement in multiple-description-based media streaming. GLOBECOM - IEEE Global Telecommunications Conference. 2006.
@inproceedings{47b63adb62454542aacece656e33fc25,
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 media into m substreams that are routed independently towards a given destination. Each substream can be decoded independently and with every successful reception of a substream, the overall quality of the decoded signal is improved. In this paper, we consider the problem of placing a set of servers in the network such that a desired QoS can be provided to a community of clients that request MDC coded traffic. Specifically, we consider the server placement (SP) problem where the goal is to identify the {"}optimal{"} server positions and associated set of client-server paths such that if MDC content is placed at these servers a cost function that is a linear combination of average delay and path disjointness is minimized. We propose an MILP formulation and a highly efficient heuristic to solve the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution obtained by using the MILP solution.",
keywords = "Content delivery networks, Media streaming, Multiple description coding, Path diversity, Path selection",
author = "Satyajeet Ahuja and Krunz, {Marwan M}",
year = "2006",
doi = "10.1109/GLOCOM.2006.200",
language = "English (US)",
isbn = "142440357X",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

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

AU - Ahuja, Satyajeet

AU - Krunz, Marwan M

PY - 2006

Y1 - 2006

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 media into m substreams that are routed independently towards a given destination. Each substream can be decoded independently and with every successful reception of a substream, the overall quality of the decoded signal is improved. In this paper, we consider the problem of placing a set of servers in the network such that a desired QoS can be provided to a community of clients that request MDC coded traffic. Specifically, we consider the server placement (SP) problem where the goal is to identify the "optimal" server positions and associated set of client-server paths such that if MDC content is placed at these servers a cost function that is a linear combination of average delay and path disjointness is minimized. We propose an MILP formulation and a highly efficient heuristic to solve the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution obtained by using 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 media into m substreams that are routed independently towards a given destination. Each substream can be decoded independently and with every successful reception of a substream, the overall quality of the decoded signal is improved. In this paper, we consider the problem of placing a set of servers in the network such that a desired QoS can be provided to a community of clients that request MDC coded traffic. Specifically, we consider the server placement (SP) problem where the goal is to identify the "optimal" server positions and associated set of client-server paths such that if MDC content is placed at these servers a cost function that is a linear combination of average delay and path disjointness is minimized. We propose an MILP formulation and a highly efficient heuristic to solve the SP problem. Simulations are conducted to evaluate the performance of the proposed algorithm and compare it with the optimal solution obtained by using the MILP solution.

KW - Content delivery networks

KW - Media streaming

KW - Multiple description coding

KW - Path diversity

KW - Path selection

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

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

U2 - 10.1109/GLOCOM.2006.200

DO - 10.1109/GLOCOM.2006.200

M3 - Conference contribution

AN - SCOPUS:50949109693

SN - 142440357X

SN - 9781424403578

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -