BETTER: handling best effort traffic in the ATM networks

Wojciech Burakowski , Zbigniew Kopertowski , Andrzej Bąk , C.J. Waveren , H.A.M. Luiijf

Abstract

This paper addresses the problem of handling best effort traffic (BET) in ATM networks. This type of traffic usually consists of information cell transfer without any guarantees about the quality of service. We show that its transfer characteristics strictly depend on the cell scheduling mechanisms used in the ATM switches. The comparative studies take into account the following queue disciplines: FIFO without priorities, FIFO within predefined priorities, weighted fair queuing algorithm and control by the cycle. The ATM services that handle BET traffic are ABR and UBR. A new way of handling BET traffic ldquo;best effort traffic takes empty round rdquo; (BETTER) controlled by a cycle mechanism is proposed. The outcome of the numerical study shows that BETTER has some advantages over other queuing mechanisms
Author Wojciech Burakowski IT
Wojciech Burakowski,,
- The Institute of Telecommunications
, Zbigniew Kopertowski - [Wojskowy Instytut Łączności (WiŁ)]
Zbigniew Kopertowski,,
-
- Wojskowy Instytut Łączności
, Andrzej Bąk IT
Andrzej Bąk,,
- The Institute of Telecommunications
, C.J. Waveren
C.J. Waveren,,
-
, H.A.M. Luiijf
H.A.M. Luiijf,,
-
Pages787-791 vol.3
Book , IEEE Military Communications Conference, 1998. MILCOM 98. Proceedings, vol. 3, 1998
Keywords in EnglishABR, asynchronous transfer mode, ATM networks, ATM services, ATM switches, Bandwidth, best effort traffic, best effort traffic takes empty round, BETTER, BET traffic, cell scheduling mechanisms, Communication system traffic control, contracts, cycle mechanism, FIFO, information cell transfer, Intelligent networks, Multiplexer, multiplexing, multiplexing equipment, priorities, quality of service, queue disciplines, queueing theory, switches, telecommunication congestion control, telecommunication networks, telecommunication traffic, traffic control, transfer characteristics, UBR, weighted fair queuing algorithm
DOIDOI:10.1109/MILCOM.1998.726931
Score (nominal)1
Citation count*2 (2018-02-15)
Cite
Share Share



* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.
Back