Packet multiplexers with adversarial regulated traffic

Srini Rajagopal, Martin Reisslein, Keith Ross

    Research output: Contribution to journalArticle

    Abstract

    We consider a finite-buffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e. the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal on-off sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.

    Original languageEnglish (US)
    Pages (from-to)239-253
    Number of pages15
    JournalComputer Communications
    Volume25
    Issue number3
    DOIs
    StatePublished - Feb 15 2002

    Fingerprint

    Multiplexing
    Bandwidth
    Controllers

    Keywords

    • Buffer-bandwidth tradeoff curve
    • Call admission control
    • Leaky bucket
    • Quality-of-service guarantees
    • Resource allocation
    • Statistical multiplexing
    • Worst-case sources

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Electrical and Electronic Engineering

    Cite this

    Packet multiplexers with adversarial regulated traffic. / Rajagopal, Srini; Reisslein, Martin; Ross, Keith.

    In: Computer Communications, Vol. 25, No. 3, 15.02.2002, p. 239-253.

    Research output: Contribution to journalArticle

    Rajagopal, Srini ; Reisslein, Martin ; Ross, Keith. / Packet multiplexers with adversarial regulated traffic. In: Computer Communications. 2002 ; Vol. 25, No. 3. pp. 239-253.
    @article{a9ef61c22aa1487d9d4604065b40380b,
    title = "Packet multiplexers with adversarial regulated traffic",
    abstract = "We consider a finite-buffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e. the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal on-off sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.",
    keywords = "Buffer-bandwidth tradeoff curve, Call admission control, Leaky bucket, Quality-of-service guarantees, Resource allocation, Statistical multiplexing, Worst-case sources",
    author = "Srini Rajagopal and Martin Reisslein and Keith Ross",
    year = "2002",
    month = "2",
    day = "15",
    doi = "10.1016/S0140-3664(01)00359-0",
    language = "English (US)",
    volume = "25",
    pages = "239--253",
    journal = "Computer Communications",
    issn = "0140-3664",
    publisher = "Elsevier",
    number = "3",

    }

    TY - JOUR

    T1 - Packet multiplexers with adversarial regulated traffic

    AU - Rajagopal, Srini

    AU - Reisslein, Martin

    AU - Ross, Keith

    PY - 2002/2/15

    Y1 - 2002/2/15

    N2 - We consider a finite-buffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e. the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal on-off sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.

    AB - We consider a finite-buffer packet multiplexer to which traffic arrives from several independent sources. The traffic from each of the sources is regulated, i.e. the amount of traffic that can enter the multiplexer is constrained by known regulator constraints. The regulator constraints depend on the source and are more general than those resulting from cascaded leaky buckets. We assume that the traffic is adversarial to the extent permitted by the regulators. For lossless multiplexing, we show that if the original multiplexer is lossless it is possible to allocate bandwidth and buffer to the sources so that the resulting segregated systems are lossless. For lossy multiplexing, we use our results for lossless multiplexing to estimate the loss probability of the multiplexer. Our estimate involves transforming the original system into two independent resource systems, and using adversarial sources for the two independent resources to obtain a bound on the loss probability of the transformed system. We show that the adversarial sources are not extremal on-off sources, even when the regulator consists of a peak rate controller in series with a leaky bucket. We explicitly characterize the form of the adversarial source for the transformed problem. We also provide numerical results for the case of the simple regulator.

    KW - Buffer-bandwidth tradeoff curve

    KW - Call admission control

    KW - Leaky bucket

    KW - Quality-of-service guarantees

    KW - Resource allocation

    KW - Statistical multiplexing

    KW - Worst-case sources

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

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

    U2 - 10.1016/S0140-3664(01)00359-0

    DO - 10.1016/S0140-3664(01)00359-0

    M3 - Article

    VL - 25

    SP - 239

    EP - 253

    JO - Computer Communications

    JF - Computer Communications

    SN - 0140-3664

    IS - 3

    ER -