Two communication traffic streams with Poisson statistics arrive at a network node. These are to be transmitted across a channel with a total bandwidth capacity of C slots. Messages not accepted at the node are assumed to be lost. Under the assumptions of exponential service time distributions, the problem of dynamic allocation of available channel bandwidth among the two traffic types is studied in order to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain is studied to minimize a weighted sum of blocking probabilities. Modeling the system as a two-dimensional Markov chain, it is shown by an application of dynamic programming principles that the optimal policy has the form of a 'switching curve'.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Optimal service allocation among two heterogeneous traffic types with no queueing


    Additional title:

    Optimale Zuordnung bei zwei heterogenen Verkehrstypen ohne Warteschlange


    Contributors:
    Lambadaris, I. (author) / Narayan, P. (author) / Viniotis, I. (author)


    Publication date :

    1987


    Size :

    3 Seiten, 12 Quellen


    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    A queueing based traffic flow model

    Vandaele, Nico | Online Contents | 2000


    Optimal buffer allocation in light traffic

    Reiman, M.I. | Tema Archive | 1987


    ELEVATOR SYSTEM WITH QUEUEING FUNCTION FOR ROBOT TRAFFIC

    BLOOMGREN RYAN | European Patent Office | 2023

    Free access

    ELEVATOR SYSTEM WITH QUEUEING FUNCTION FOR ROBOT TRAFFIC

    BLOOMGREN RYAN | European Patent Office | 2021

    Free access

    Elevator system with queueing function for robot traffic

    BLOOMGREN RYAN | European Patent Office | 2024

    Free access