• DocumentCode
    1460658
  • Title

    Allocating fair rates for available bit rate service in ATM networks

  • Author

    Arulambalam, Ambalavanar ; Chen, Xiaoqiang ; Ansari, Nirwan

  • Author_Institution
    Bell Labs., Murray Hill, NJ, USA
  • Volume
    34
  • Issue
    11
  • fYear
    1996
  • fDate
    11/1/1996 12:00:00 AM
  • Firstpage
    92
  • Lastpage
    100
  • Abstract
    A central issue in congestion control for the available bit rate (ABR) service in ATM networks is the computation of the fair rate for every connection at each switching node in the network. The objective is to determine the fair rate for all the connections in a distributed network under dynamic changes in the absence of centralized knowledge about the network, and without the synchronization of different network components. The authors study the problem of fair rate allocation, specifying the requirements of a fair rate allocation algorithm, and provide a survey of various proposed fair rate allocation strategies in the context of the ABR service
  • Keywords
    asynchronous transfer mode; channel capacity; telecommunication congestion control; telecommunication networks; telecommunication services; ABR service; ATM networks; algorithm design; available bit rate service; bursty traffic; congestion control; distributed network; exact fair rate computation; fair rate allocation; fair rate allocation algorithm; fair rate approximation; network components; performance; switching node; Algorithm design and analysis; Asynchronous transfer mode; Bandwidth; Bit rate; Communication switching; Erbium; Feedback loop; Intelligent networks; Resource description framework; Switches;
  • fLanguage
    English
  • Journal_Title
    Communications Magazine, IEEE
  • Publisher
    ieee
  • ISSN
    0163-6804
  • Type

    jour

  • DOI
    10.1109/35.544198
  • Filename
    544198