Virtual lines; A deadlock free and real-time routing mechanism for ATM networks

    Research output: Contribution to journalArticleAcademicpeer-review

    35 Downloads (Pure)

    Abstract

    In this paper, we present a routing mechanism and buffer allocation mechanism for an ATM switching fabric. Since the fabric will be used to transfer multimedia traffic, it should provide a guaranteed throughput and a bounded latency. We focus on the design of a suitable routing mechanism that is capable of fulfilling these requirements and is free of deadlocks. We will describe two basic concepts that can be used to implement deadlock-free routing. Routing of messages is closely related to buffering. We have organized the buffers into parallel FIFO's, each representing a virtual line. In this way, we not only have solved the problem of head of line blocking, but we can also give real-time guarantees. We will show that for local high-speed networks, it is more advantageous to have a proper flow control than to have large buffers. Although the virtual line concept can have a low buffer utilization, the transfer efficiency can be higher. The virtual line concept allows adaptive routing. The total throughput of the network can be improved by using alternative routes. Adaptive routing is attractive in networks where alternative routes are not much longer than the initial route(s). The network of the switching fabric is built up from switching elements interconnected in a Kautz topology.
    Original languageUndefined
    Pages (from-to)-
    Number of pages14
    JournalInformation sciences
    Volume1995
    Issue number851-3
    DOIs
    Publication statusPublished - 1995

    Keywords

    • METIS-118587
    • IR-18068

    Cite this

    @article{752f82b593024cf6938f47d280d002d0,
    title = "Virtual lines; A deadlock free and real-time routing mechanism for ATM networks",
    abstract = "In this paper, we present a routing mechanism and buffer allocation mechanism for an ATM switching fabric. Since the fabric will be used to transfer multimedia traffic, it should provide a guaranteed throughput and a bounded latency. We focus on the design of a suitable routing mechanism that is capable of fulfilling these requirements and is free of deadlocks. We will describe two basic concepts that can be used to implement deadlock-free routing. Routing of messages is closely related to buffering. We have organized the buffers into parallel FIFO's, each representing a virtual line. In this way, we not only have solved the problem of head of line blocking, but we can also give real-time guarantees. We will show that for local high-speed networks, it is more advantageous to have a proper flow control than to have large buffers. Although the virtual line concept can have a low buffer utilization, the transfer efficiency can be higher. The virtual line concept allows adaptive routing. The total throughput of the network can be improved by using alternative routes. Adaptive routing is attractive in networks where alternative routes are not much longer than the initial route(s). The network of the switching fabric is built up from switching elements interconnected in a Kautz topology.",
    keywords = "METIS-118587, IR-18068",
    author = "Smit, {Gerardus Johannes Maria} and Havinga, {Paul J.M.} and Tibboel, {Walter H.}",
    year = "1995",
    doi = "10.1016/0020-0255(94)00113-P",
    language = "Undefined",
    volume = "1995",
    pages = "--",
    journal = "Information sciences",
    issn = "0020-0255",
    publisher = "Elsevier",
    number = "851-3",

    }

    Virtual lines; A deadlock free and real-time routing mechanism for ATM networks. / Smit, Gerardus Johannes Maria; Havinga, Paul J.M.; Tibboel, Walter H.

    In: Information sciences, Vol. 1995, No. 851-3, 1995, p. -.

    Research output: Contribution to journalArticleAcademicpeer-review

    TY - JOUR

    T1 - Virtual lines; A deadlock free and real-time routing mechanism for ATM networks

    AU - Smit, Gerardus Johannes Maria

    AU - Havinga, Paul J.M.

    AU - Tibboel, Walter H.

    PY - 1995

    Y1 - 1995

    N2 - In this paper, we present a routing mechanism and buffer allocation mechanism for an ATM switching fabric. Since the fabric will be used to transfer multimedia traffic, it should provide a guaranteed throughput and a bounded latency. We focus on the design of a suitable routing mechanism that is capable of fulfilling these requirements and is free of deadlocks. We will describe two basic concepts that can be used to implement deadlock-free routing. Routing of messages is closely related to buffering. We have organized the buffers into parallel FIFO's, each representing a virtual line. In this way, we not only have solved the problem of head of line blocking, but we can also give real-time guarantees. We will show that for local high-speed networks, it is more advantageous to have a proper flow control than to have large buffers. Although the virtual line concept can have a low buffer utilization, the transfer efficiency can be higher. The virtual line concept allows adaptive routing. The total throughput of the network can be improved by using alternative routes. Adaptive routing is attractive in networks where alternative routes are not much longer than the initial route(s). The network of the switching fabric is built up from switching elements interconnected in a Kautz topology.

    AB - In this paper, we present a routing mechanism and buffer allocation mechanism for an ATM switching fabric. Since the fabric will be used to transfer multimedia traffic, it should provide a guaranteed throughput and a bounded latency. We focus on the design of a suitable routing mechanism that is capable of fulfilling these requirements and is free of deadlocks. We will describe two basic concepts that can be used to implement deadlock-free routing. Routing of messages is closely related to buffering. We have organized the buffers into parallel FIFO's, each representing a virtual line. In this way, we not only have solved the problem of head of line blocking, but we can also give real-time guarantees. We will show that for local high-speed networks, it is more advantageous to have a proper flow control than to have large buffers. Although the virtual line concept can have a low buffer utilization, the transfer efficiency can be higher. The virtual line concept allows adaptive routing. The total throughput of the network can be improved by using alternative routes. Adaptive routing is attractive in networks where alternative routes are not much longer than the initial route(s). The network of the switching fabric is built up from switching elements interconnected in a Kautz topology.

    KW - METIS-118587

    KW - IR-18068

    U2 - 10.1016/0020-0255(94)00113-P

    DO - 10.1016/0020-0255(94)00113-P

    M3 - Article

    VL - 1995

    SP - -

    JO - Information sciences

    JF - Information sciences

    SN - 0020-0255

    IS - 851-3

    ER -