Routing in virtual path based ATM networks

Sanjay Gupta, Keith Ross, Magda El Zarki

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

    Abstract

    We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.

    Original languageEnglish (US)
    Title of host publicationGLOBECOM 1992 - Communication for Global Users
    Subtitle of host publicationIEEE Global Telecommunications Conference
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages571-575
    Number of pages5
    ISBN (Electronic)0780306082, 9780780306080
    DOIs
    StatePublished - Jan 1 1992
    Event1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992 - Orlando, United States
    Duration: Dec 6 1992Dec 9 1992

    Publication series

    NameGLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference

    Conference

    Conference1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992
    CountryUnited States
    CityOrlando
    Period12/6/9212/9/92

    Fingerprint

    Asynchronous transfer mode
    Networks (circuits)
    Telecommunication traffic
    Quality of service
    Routing

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Hardware and Architecture
    • Information Systems
    • Information Systems and Management
    • Safety, Risk, Reliability and Quality

    Cite this

    Gupta, S., Ross, K., & El Zarki, M. (1992). Routing in virtual path based ATM networks. In GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference (pp. 571-575). [276450] (GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/GLOCOM.1992.276450

    Routing in virtual path based ATM networks. / Gupta, Sanjay; Ross, Keith; El Zarki, Magda.

    GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers Inc., 1992. p. 571-575 276450 (GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference).

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

    Gupta, S, Ross, K & El Zarki, M 1992, Routing in virtual path based ATM networks. in GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference., 276450, GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference, Institute of Electrical and Electronics Engineers Inc., pp. 571-575, 1992 IEEE Global Telecommunications Conference: Communication for Global Users, GLOBECOM 1992, Orlando, United States, 12/6/92. https://doi.org/10.1109/GLOCOM.1992.276450
    Gupta S, Ross K, El Zarki M. Routing in virtual path based ATM networks. In GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers Inc. 1992. p. 571-575. 276450. (GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.1992.276450
    Gupta, Sanjay ; Ross, Keith ; El Zarki, Magda. / Routing in virtual path based ATM networks. GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference. Institute of Electrical and Electronics Engineers Inc., 1992. pp. 571-575 (GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference).
    @inproceedings{e5376ba175f64f3cb0c86c06b0acba92,
    title = "Routing in virtual path based ATM networks",
    abstract = "We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.",
    author = "Sanjay Gupta and Keith Ross and {El Zarki}, Magda",
    year = "1992",
    month = "1",
    day = "1",
    doi = "10.1109/GLOCOM.1992.276450",
    language = "English (US)",
    series = "GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    pages = "571--575",
    booktitle = "GLOBECOM 1992 - Communication for Global Users",

    }

    TY - GEN

    T1 - Routing in virtual path based ATM networks

    AU - Gupta, Sanjay

    AU - Ross, Keith

    AU - El Zarki, Magda

    PY - 1992/1/1

    Y1 - 1992/1/1

    N2 - We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.

    AB - We consider the issue of routing requests for virtual circuits in a Virtual Path (VP) based ATM network. We suppose that the VPs are partitioned in a manner such that all the VCs making use of any given VP have the same traffic characteristics and quality of service demands. A virtual circuit request can be accepted in the network only if the specified loss and delay bounds can be guaranteed for the cells belonging to it. After making suitable simplifying assumptions about the operation of the network, simple admission rules for virtual circuit requests are proposed. Routing policies are then proposed that try to minimize the fraction of virtual circuit requests denied. Simulations are carried out to evaluate the proposed routing policies.

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

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

    U2 - 10.1109/GLOCOM.1992.276450

    DO - 10.1109/GLOCOM.1992.276450

    M3 - Conference contribution

    AN - SCOPUS:85027182755

    T3 - GLOBECOM 1992 - Communication for Global Users: IEEE Global Telecommunications Conference

    SP - 571

    EP - 575

    BT - GLOBECOM 1992 - Communication for Global Users

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -