VLSI implementation of a fairness ATM buffer system

J.V. Nielsen, Lars Dittmann, Jens Kargaard Madsen, Peter Stuhr Lassen

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    213 Downloads (Pure)

    Abstract

    This paper presents a VLSI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in asynchronous transfer mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in networks in order to provide defined allocation policies (fairness) and improve network robustness. The presented design illustrates how the theoretical weighted fair queueing model can be approximated with a model feasible for practical implementation. This approximated model has been implemented as a VLSI component
    Original languageEnglish
    Title of host publicationConference Record of IEEE International Conference on Communications : Converging Technologies for Tomorrow's Applications
    VolumeVolume 2
    PublisherIEEE
    Publication date1996
    Pages681-686
    ISBN (Print)07-80-33250-4
    DOIs
    Publication statusPublished - 1996
    EventIEEE International Conference on Communications 1996 - Dallas, United States
    Duration: 23 Jun 199627 Jun 1996

    Conference

    ConferenceIEEE International Conference on Communications 1996
    CountryUnited States
    CityDallas
    Period23/06/199627/06/1996

    Bibliographical note

    Copyright: 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

    Cite this

    Nielsen, J. V., Dittmann, L., Madsen, J. K., & Lassen, P. S. (1996). VLSI implementation of a fairness ATM buffer system. In Conference Record of IEEE International Conference on Communications: Converging Technologies for Tomorrow's Applications (Vol. Volume 2, pp. 681-686). IEEE. https://doi.org/10.1109/ICC.1996.541268
    Nielsen, J.V. ; Dittmann, Lars ; Madsen, Jens Kargaard ; Lassen, Peter Stuhr. / VLSI implementation of a fairness ATM buffer system. Conference Record of IEEE International Conference on Communications: Converging Technologies for Tomorrow's Applications. Vol. Volume 2 IEEE, 1996. pp. 681-686
    @inproceedings{963c9ffb4b3a48ad9daf4ea8d72a496b,
    title = "VLSI implementation of a fairness ATM buffer system",
    abstract = "This paper presents a VLSI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in asynchronous transfer mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in networks in order to provide defined allocation policies (fairness) and improve network robustness. The presented design illustrates how the theoretical weighted fair queueing model can be approximated with a model feasible for practical implementation. This approximated model has been implemented as a VLSI component",
    author = "J.V. Nielsen and Lars Dittmann and Madsen, {Jens Kargaard} and Lassen, {Peter Stuhr}",
    note = "Copyright: 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE",
    year = "1996",
    doi = "10.1109/ICC.1996.541268",
    language = "English",
    isbn = "07-80-33250-4",
    volume = "Volume 2",
    pages = "681--686",
    booktitle = "Conference Record of IEEE International Conference on Communications",
    publisher = "IEEE",
    address = "United States",

    }

    Nielsen, JV, Dittmann, L, Madsen, JK & Lassen, PS 1996, VLSI implementation of a fairness ATM buffer system. in Conference Record of IEEE International Conference on Communications: Converging Technologies for Tomorrow's Applications. vol. Volume 2, IEEE, pp. 681-686, IEEE International Conference on Communications 1996, Dallas, United States, 23/06/1996. https://doi.org/10.1109/ICC.1996.541268

    VLSI implementation of a fairness ATM buffer system. / Nielsen, J.V.; Dittmann, Lars; Madsen, Jens Kargaard; Lassen, Peter Stuhr.

    Conference Record of IEEE International Conference on Communications: Converging Technologies for Tomorrow's Applications. Vol. Volume 2 IEEE, 1996. p. 681-686.

    Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    TY - GEN

    T1 - VLSI implementation of a fairness ATM buffer system

    AU - Nielsen, J.V.

    AU - Dittmann, Lars

    AU - Madsen, Jens Kargaard

    AU - Lassen, Peter Stuhr

    N1 - Copyright: 1996 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

    PY - 1996

    Y1 - 1996

    N2 - This paper presents a VLSI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in asynchronous transfer mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in networks in order to provide defined allocation policies (fairness) and improve network robustness. The presented design illustrates how the theoretical weighted fair queueing model can be approximated with a model feasible for practical implementation. This approximated model has been implemented as a VLSI component

    AB - This paper presents a VLSI implementation of a resource allocation scheme, based on the concept of weighted fair queueing. The design can be used in asynchronous transfer mode (ATM) networks to ensure fairness and robustness. Weighted fair queueing is a scheduling and buffer management scheme that can provide a resource allocation policy and enforcement of this policy. It can be used in networks in order to provide defined allocation policies (fairness) and improve network robustness. The presented design illustrates how the theoretical weighted fair queueing model can be approximated with a model feasible for practical implementation. This approximated model has been implemented as a VLSI component

    U2 - 10.1109/ICC.1996.541268

    DO - 10.1109/ICC.1996.541268

    M3 - Article in proceedings

    SN - 07-80-33250-4

    VL - Volume 2

    SP - 681

    EP - 686

    BT - Conference Record of IEEE International Conference on Communications

    PB - IEEE

    ER -

    Nielsen JV, Dittmann L, Madsen JK, Lassen PS. VLSI implementation of a fairness ATM buffer system. In Conference Record of IEEE International Conference on Communications: Converging Technologies for Tomorrow's Applications. Vol. Volume 2. IEEE. 1996. p. 681-686 https://doi.org/10.1109/ICC.1996.541268