scispace - formally typeset
Journal ArticleDOI

The available bit rate service for data in ATM networks

Thomas M. Chen, +2 more
- 01 May 1996 - 
- Vol. 34, Iss: 5, pp 56-58
Reads0
Chats0
TLDR
The authors describe the purpose of the available bit rate (ABR) service in the context of other ATM services and review the agreements on the traffic control mechanism.
Abstract
The authors describe the purpose of the available bit rate (ABR) service in the context of other ATM services and review the agreements on the traffic control mechanism. They describe the recent progress towards standardization of the new service. The general nature of the ABR service is described in comparison with constant bit rate (CBR) and variable bit rate (VBR) services.

read more

Citations
More filters
Posted Content

Congestion Control with Explicit Rate Indication

TL;DR: An asynchronous distributed algorithm is presented for optimal rate calculation across the network, where optimality is understood in the maxmin sense and the algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience.
Journal ArticleDOI

A framework based approach to the development of network aware applications

TL;DR: A framework-based approach to the construction of network-aware programs with a feedback loop that controls the adjustment of the application to network properties and illustrates that there is more to network-awareness than just taking network resources and protocols into account.
Journal ArticleDOI

Teletraffic engineering in a broad-band era

TL;DR: Current topics in B-ISDN teletraffic research are summarized: connection admission control, buffer dimensioning, multiquality of service, cell discard schemes, rate-based flow control, per-virtual-connection queueing, and weighted fair queueing.
Journal ArticleDOI

Connection-dependent threshold model: a generalization of the Erlang multiple rate loss model

TL;DR: Two extensions of the Erlang multi-rate loss model (EMLM) are reviewed, whereby the call-level quality-of-service (QoS) of ATM networks is assessed and the connection-dependent threshold model (CDTM) is proposed, which resembles the threshold models, but the state dependency is individualized among call-connections.
Patent

Link capacity sharing for throughput-blocking optimality

TL;DR: In this paper, the authors proposed a call-level model for elastic traffic and determined a maximum number of admissible elastic traffic flows based on calllevel constraints for the elastic traffic related to throughput and/or blocking.
References
More filters
Journal ArticleDOI

Congestion control and traffic management in ATM networks: recent advances and a survey

TL;DR: In this article, the authors present the selection criterion for selection between rate-based and credit-based approach and the key points of the debate between these two approaches are presented. And several other schemes that were considered are described.
Journal ArticleDOI

The rate-based flow control framework for the available bit rate ATM service

F. Bonomi, +1 more
- 01 Mar 1995 - 
TL;DR: A new ATM service category, the available bit rate service, is currently the subject of intense development and the rate-based flow control framework has been identified as the most appropriate for the support of this new service.
Journal ArticleDOI

Bottleneck Flow Control

TL;DR: The problem of optimally choosing message rates for users of a store-and-forward network is analyzed and a generalized definition of ideal tradeoff is introduced to provide more flexibility in the choice of message rates.
Journal ArticleDOI

A binary feedback scheme for congestion avoidance in computer networks

TL;DR: The scheme is distributed, adapts to the dynamic state of the network, converges to the optimal operating point, is quite simple to implement, and has low overhead.
Posted Content

Congestion Control with Explicit Rate Indication

TL;DR: An asynchronous distributed algorithm is presented for optimal rate calculation across the network, where optimality is understood in the maxmin sense and the algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience.