Optimal circuit access policies in an ISDN environment

A Markov decision approach

Keith Ross, Danny H K Tsang

    Research output: Contribution to journalArticle

    Abstract

    The problem of determining optimal access policies for circuit-switched networks that support traffic types with varying bandwidth requirements is addressed. The authors suppose that the network supports K classes of calls where each class is determined by a fixed route and a bandwidth requirement. A Markov decision process (MDP) approach is used to obtain optimal access policies for three models: the flexible scheme access-port model where a single link is shared; the contiguous scheme access-port model where wideband calls are required to occupy specific contiguous regions of the TDM frame; and the network-access model where a call holds several channels in different links simultaneously. Both linear programming and value-iteration MDP algorithms are coupled with a novel state descriptor in order to locate the optimal policy for reasonable-size problems (several T1 carriers in parallel for the access-port case, and small networks of T1 carriers for the network-access case).

    Original languageEnglish (US)
    Pages (from-to)934-939
    Number of pages6
    JournalIEEE Transactions on Communications
    Volume37
    Issue number9
    StatePublished - Sep 1989

    Fingerprint

    Voice/data communication systems
    Networks (circuits)
    Bandwidth
    Time division multiplexing
    Switching networks
    Telecommunication traffic
    Linear programming

    ASJC Scopus subject areas

    • Engineering(all)

    Cite this

    Optimal circuit access policies in an ISDN environment : A Markov decision approach. / Ross, Keith; Tsang, Danny H K.

    In: IEEE Transactions on Communications, Vol. 37, No. 9, 09.1989, p. 934-939.

    Research output: Contribution to journalArticle

    @article{57336a4395804335bbbd9dfe0206c6cc,
    title = "Optimal circuit access policies in an ISDN environment: A Markov decision approach",
    abstract = "The problem of determining optimal access policies for circuit-switched networks that support traffic types with varying bandwidth requirements is addressed. The authors suppose that the network supports K classes of calls where each class is determined by a fixed route and a bandwidth requirement. A Markov decision process (MDP) approach is used to obtain optimal access policies for three models: the flexible scheme access-port model where a single link is shared; the contiguous scheme access-port model where wideband calls are required to occupy specific contiguous regions of the TDM frame; and the network-access model where a call holds several channels in different links simultaneously. Both linear programming and value-iteration MDP algorithms are coupled with a novel state descriptor in order to locate the optimal policy for reasonable-size problems (several T1 carriers in parallel for the access-port case, and small networks of T1 carriers for the network-access case).",
    author = "Keith Ross and Tsang, {Danny H K}",
    year = "1989",
    month = "9",
    language = "English (US)",
    volume = "37",
    pages = "934--939",
    journal = "IEEE Transactions on Communications",
    issn = "0090-6778",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    number = "9",

    }

    TY - JOUR

    T1 - Optimal circuit access policies in an ISDN environment

    T2 - A Markov decision approach

    AU - Ross, Keith

    AU - Tsang, Danny H K

    PY - 1989/9

    Y1 - 1989/9

    N2 - The problem of determining optimal access policies for circuit-switched networks that support traffic types with varying bandwidth requirements is addressed. The authors suppose that the network supports K classes of calls where each class is determined by a fixed route and a bandwidth requirement. A Markov decision process (MDP) approach is used to obtain optimal access policies for three models: the flexible scheme access-port model where a single link is shared; the contiguous scheme access-port model where wideband calls are required to occupy specific contiguous regions of the TDM frame; and the network-access model where a call holds several channels in different links simultaneously. Both linear programming and value-iteration MDP algorithms are coupled with a novel state descriptor in order to locate the optimal policy for reasonable-size problems (several T1 carriers in parallel for the access-port case, and small networks of T1 carriers for the network-access case).

    AB - The problem of determining optimal access policies for circuit-switched networks that support traffic types with varying bandwidth requirements is addressed. The authors suppose that the network supports K classes of calls where each class is determined by a fixed route and a bandwidth requirement. A Markov decision process (MDP) approach is used to obtain optimal access policies for three models: the flexible scheme access-port model where a single link is shared; the contiguous scheme access-port model where wideband calls are required to occupy specific contiguous regions of the TDM frame; and the network-access model where a call holds several channels in different links simultaneously. Both linear programming and value-iteration MDP algorithms are coupled with a novel state descriptor in order to locate the optimal policy for reasonable-size problems (several T1 carriers in parallel for the access-port case, and small networks of T1 carriers for the network-access case).

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

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

    M3 - Article

    VL - 37

    SP - 934

    EP - 939

    JO - IEEE Transactions on Communications

    JF - IEEE Transactions on Communications

    SN - 0090-6778

    IS - 9

    ER -