This work refers to an ATM satellite system, supporting different QoS classes via the standard ATM traffic categories, i.e. Constant Bit Rate (CBR), Variable Bit Rate (VBR), Available Bit Rate (ABR) and Unspecified Bit Rate (UBR). The focus of this work is on ABR (i.e. closed loop control) and the central issue is to find trade-offs between a high ABR throughput and processing burden/buffer space required on board satellite, under the constraint that no buffer overflow occurs. ABR fairness issues are not central to this work and hence are not considered. The focus of the paper is to evaluate how adaptive prediction of higher priority CBR/VBR traffic can enhance ABR traffic performance, with respect to a simpler worst case based approach. Results show that a significant improvement of performance can be obtained even with rather straightforward prediction algorithms. q2000 Elsevier Science B.V. All rights reserved.
Throughput-complexity trade-off for ABR traffic in an ATM satellite network under cell loss constraints / Baiocchi, Andrea; N., BLEFARI MELAZZI; Listanti, Marco. - In: COMPUTER COMMUNICATIONS. - ISSN 0140-3664. - 23:4(2000), pp. 1034-1046. [10.1016/S0140-3664(00)00164-X]
Throughput-complexity trade-off for ABR traffic in an ATM satellite network under cell loss constraints
BAIOCCHI, Andrea;LISTANTI, Marco
2000
Abstract
This work refers to an ATM satellite system, supporting different QoS classes via the standard ATM traffic categories, i.e. Constant Bit Rate (CBR), Variable Bit Rate (VBR), Available Bit Rate (ABR) and Unspecified Bit Rate (UBR). The focus of this work is on ABR (i.e. closed loop control) and the central issue is to find trade-offs between a high ABR throughput and processing burden/buffer space required on board satellite, under the constraint that no buffer overflow occurs. ABR fairness issues are not central to this work and hence are not considered. The focus of the paper is to evaluate how adaptive prediction of higher priority CBR/VBR traffic can enhance ABR traffic performance, with respect to a simpler worst case based approach. Results show that a significant improvement of performance can be obtained even with rather straightforward prediction algorithms. q2000 Elsevier Science B.V. All rights reserved.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.