• DocumentCode
    1548270
  • Title

    RPA: a simple, efficient, and flexible policy for input buffered ATM switches

  • Author

    Marsan, M. G Ajmone ; Bianco, A. ; Leonardi, E.

  • Author_Institution
    Dipartimento di Elettronica, Politecnico di Torino, Italy
  • Volume
    1
  • Issue
    3
  • fYear
    1997
  • fDate
    5/1/1997 12:00:00 AM
  • Firstpage
    83
  • Lastpage
    86
  • Abstract
    Reservation with Preemption and Acknowledgment (RPA) is a simple, efficient, and flexible queuing discipline and scheduling algorithm for input buffered asynchronous transfer-mode (ATM) switches. This letter describes the RPA algorithms, and presents simulation results to demonstrate the effectiveness of the proposed approach.
  • Keywords
    asynchronous transfer mode; buffer storage; computational complexity; queueing theory; scheduling; telecommunication traffic; ATM switches; RPA algorithms; Reservation with Preemption and Acknowledgment; input buffered asynchronous transfer mode switches; queuing discipline; scheduling algorithm; simulation results; Asynchronous transfer mode; Bandwidth; Computational complexity; Fabrics; Optical buffering; Quality of service; Scheduling algorithm; Switches; Throughput; Traffic control;
  • fLanguage
    English
  • Journal_Title
    Communications Letters, IEEE
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/4234.585804
  • Filename
    585804
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1548270