A dynamic programming methodology for managing prerecorded VBR sources in packet-switched networks

Jean McManus, Keith Ross

    Research output: Contribution to journalArticle

    Abstract

    Broadband networks will increasingly carry prerecorded traffic, such as high-fidelity audio, short multimedia clips, and full-length movies. We study how to manage the transmission and transport of traffic from prerecorded VBR sources so that network resources are efficiently utilized and end users receive satisfactory service. Specifically, we study Piecewise Constant-Rate Transmission and Transport (PCRTT), whereby the server transmits and the network transports each connection's packets at different constant rates over a small number of intervals. We show how Dynamic Programming (DP) can be applied to find optimal PCRTT rates and intervals for a wide variety of optimization criteria, including criteria which explicitly account for delays to user interaction (pause, fast forward, and rewind). We also introduce two admission policies for PCRTT: peak-rate admission and packing admission. For peak-rate admission, for each video the network allocates an end-to-end CBR connection; the rate of the CBR connection is equal to the maximum PCRTT rate. For packing admission, for each video the network reserves a series of CBR connections of different rates over specific time intervals. Using public domain MPEG traces, we present several numerical examples which illustrate the traffic management schemes and the DP methodology.

    Original languageEnglish (US)
    Pages (from-to)223-247
    Number of pages25
    JournalTelecommunication Systems
    Volume9
    Issue number2
    StatePublished - 1998

    Fingerprint

    Packet networks
    Dynamic programming
    Broadband networks
    Servers

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

    A dynamic programming methodology for managing prerecorded VBR sources in packet-switched networks. / McManus, Jean; Ross, Keith.

    In: Telecommunication Systems, Vol. 9, No. 2, 1998, p. 223-247.

    Research output: Contribution to journalArticle

    @article{044ac9e949574f2098cf72489e15e7af,
    title = "A dynamic programming methodology for managing prerecorded VBR sources in packet-switched networks",
    abstract = "Broadband networks will increasingly carry prerecorded traffic, such as high-fidelity audio, short multimedia clips, and full-length movies. We study how to manage the transmission and transport of traffic from prerecorded VBR sources so that network resources are efficiently utilized and end users receive satisfactory service. Specifically, we study Piecewise Constant-Rate Transmission and Transport (PCRTT), whereby the server transmits and the network transports each connection's packets at different constant rates over a small number of intervals. We show how Dynamic Programming (DP) can be applied to find optimal PCRTT rates and intervals for a wide variety of optimization criteria, including criteria which explicitly account for delays to user interaction (pause, fast forward, and rewind). We also introduce two admission policies for PCRTT: peak-rate admission and packing admission. For peak-rate admission, for each video the network allocates an end-to-end CBR connection; the rate of the CBR connection is equal to the maximum PCRTT rate. For packing admission, for each video the network reserves a series of CBR connections of different rates over specific time intervals. Using public domain MPEG traces, we present several numerical examples which illustrate the traffic management schemes and the DP methodology.",
    author = "Jean McManus and Keith Ross",
    year = "1998",
    language = "English (US)",
    volume = "9",
    pages = "223--247",
    journal = "Telecommunication Systems",
    issn = "1018-4864",
    publisher = "Springer Netherlands",
    number = "2",

    }

    TY - JOUR

    T1 - A dynamic programming methodology for managing prerecorded VBR sources in packet-switched networks

    AU - McManus, Jean

    AU - Ross, Keith

    PY - 1998

    Y1 - 1998

    N2 - Broadband networks will increasingly carry prerecorded traffic, such as high-fidelity audio, short multimedia clips, and full-length movies. We study how to manage the transmission and transport of traffic from prerecorded VBR sources so that network resources are efficiently utilized and end users receive satisfactory service. Specifically, we study Piecewise Constant-Rate Transmission and Transport (PCRTT), whereby the server transmits and the network transports each connection's packets at different constant rates over a small number of intervals. We show how Dynamic Programming (DP) can be applied to find optimal PCRTT rates and intervals for a wide variety of optimization criteria, including criteria which explicitly account for delays to user interaction (pause, fast forward, and rewind). We also introduce two admission policies for PCRTT: peak-rate admission and packing admission. For peak-rate admission, for each video the network allocates an end-to-end CBR connection; the rate of the CBR connection is equal to the maximum PCRTT rate. For packing admission, for each video the network reserves a series of CBR connections of different rates over specific time intervals. Using public domain MPEG traces, we present several numerical examples which illustrate the traffic management schemes and the DP methodology.

    AB - Broadband networks will increasingly carry prerecorded traffic, such as high-fidelity audio, short multimedia clips, and full-length movies. We study how to manage the transmission and transport of traffic from prerecorded VBR sources so that network resources are efficiently utilized and end users receive satisfactory service. Specifically, we study Piecewise Constant-Rate Transmission and Transport (PCRTT), whereby the server transmits and the network transports each connection's packets at different constant rates over a small number of intervals. We show how Dynamic Programming (DP) can be applied to find optimal PCRTT rates and intervals for a wide variety of optimization criteria, including criteria which explicitly account for delays to user interaction (pause, fast forward, and rewind). We also introduce two admission policies for PCRTT: peak-rate admission and packing admission. For peak-rate admission, for each video the network allocates an end-to-end CBR connection; the rate of the CBR connection is equal to the maximum PCRTT rate. For packing admission, for each video the network reserves a series of CBR connections of different rates over specific time intervals. Using public domain MPEG traces, we present several numerical examples which illustrate the traffic management schemes and the DP methodology.

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

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

    M3 - Article

    AN - SCOPUS:22044451452

    VL - 9

    SP - 223

    EP - 247

    JO - Telecommunication Systems

    JF - Telecommunication Systems

    SN - 1018-4864

    IS - 2

    ER -