BETTER: Handling Best Effort Traffic in the ATM Networks
conference paper
This paper addresses the problem of handling Best Eflort
Trafic (BET) in ATM networks. This type of trafic is
usually consists of information cell transfer without any
guaranties about the quality of service. In the paper 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
trafic are ABR and UBR. A new way of handling BET
trafic ,,Best Effort Trafic Takes Empty Round” (BETTER)
in control by cycle mechanism is proposed. The outcome of
a numerical study shows that BETTER has some
advantages over other queuing mechanisms
Trafic (BET) in ATM networks. This type of trafic is
usually consists of information cell transfer without any
guaranties about the quality of service. In the paper 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
trafic are ABR and UBR. A new way of handling BET
trafic ,,Best Effort Trafic Takes Empty Round” (BETTER)
in control by cycle mechanism is proposed. The outcome of
a numerical study shows that BETTER has some
advantages over other queuing mechanisms
TNO Identifier
95124
Publisher
IEEE
Source title
MILCOM 98 - Proceedings IEEE Military Communications Conference - Force Projection; Meeting the Communications Challenge, October 18-21, 1998, Boston, MA, Vol.III
Place of publication
Piscataway, NJ
Pages
787-791
Files
To receive the publication files, please send an e-mail request to TNO Repository.