Congestion control is required in ATM (Asynchronous Transfer Mode) networks to fairly allocate network resources to the various service types and mixes carried out by the high speed wide area networks. Admission control is one of the congestion control mechanisms to be executed at the virtual call set-up. Access nodes decide to accept or reject a connection request based on a description of the traflc anticipated by the bursty source and of the traflc load encountered by the connection along the network route. To each new connection an appropriate bandwidth is assigned in order to ensure that the cell transport performance (cell losses and delay) remains at a satisfactory level for all users.This paper reports some simulation results for mixes of bursty traffic on a network employing a proposed mechanism for bandwidth assignment called "Class Related Rule". The allocation of virtual calls into a trunk group of ATM links using this bandwidth assignment mechanism is further investigated via simulation in order to ensure given virtual call blocking objectives (call losses).

Congestion control is required in ATM (Asynchronous Transfer Mode) networks to fairly allocate network resources to the various service types and mixes carried out by the high speed wide-area networks. Admission control is one of the congestion control mechanisms to be executed at the virtual call set up. Access nodes decide to accept or reject a connection request based on a description of the traffic anticipated by the bursty source and of the traffic load encountered by the connection along the network route. To each new connection an equivalent bandwidth is allocated in order to ensure that the cell transport objectives (cell losses and delay) remain at a satisfactory level for all users.This paper investigates the concepts of the equivalent bandwidth of bursty traffic and reports some simulation results of statistical multiplexing of homogeneous and heterogeneous bursty sources. The simulation tests show that in many significant traffic mixes the defined equivalent bandwidth value results to be rather constant. 318.6.2.

Congestion control mechanisms are required in ATM networks to fairly and efficiently allocate network resources to the various service types. Bandwidth allocation is a preventive control mechanism. On the basis of the traffic description given by the source, of the traffic load along the connection route and of the cell performance requirements, this mechanism gives a criterion to accept or reject a virtual connection request. A bandwidth called 'equivalent bandwidth' is allocated in order to ensure the cell transport objectives.This paper proposes a definition of equivalent bandwidth for stream, bursty data and variable bit ratevideo (VBRV) sources. The equivalent bandwidth values are evaluated by simulation considering both homogeneous and heterogeneous sources. In the heterogeneous mixes with different cell loss probability requirements the selective discarding mechanism permits a more efficient utilization of the network resources.

Congestion control mechanisms are required in ATM networks to fairly and efficiently allocate network resources to the variou service types. Bandwidth assignment is a preventive control mechanism. On the basis of the t m f i descriptiongiven by the source, of the traffic load along the connection route and of the cell performance requirements, this mechanism gives a criterion to accept or reject a virtual connection request. A bandwidth called 'equivalent bandwidth' is allocated in order to ensure the cell transport objectives. This paper proposes a definition of equivalent bandwidth for stream, bursty data and variable bit rate video sources (VBRV). Theequivalent bandwidth values are evaluated by simulation considering both homogeneous and heterogeneous sources. In the heterogeneous mixes with different cell loss probability requirements the selective discarding mechanism permits a more efficient utilization of the network resources.

The effectiveaction ofend-to-endwindowingas f2ow and congestion control mechanism for fast packet switching networks is widely recognized. This paper investigates the effectiveness of such mechanism applied to data t r a f i in ATM networks. In particular, an adaptive window mechanism includinggo-back(n) retransmission is proposed. Performance achievable by its application is evaluated by simulntion under a particular network model assumption. Thegain reachable in terms of improvement of cell acceptance is estimated with different soume t r a f i descriptors and network parameter values.