Design and evaluation of feedback consolidation for ABR point-to-multipoint connections in ATM networks

Authors:
S. Fahmy;R. Jain;R. Goyal;B. Vandalore;S. Kalyanaraman
Affiliations:
The Ohio State University, 2015 Neil Avenue, DL 395, Columbus, OH 43210-1277, USA;The Ohio State University, 2015 Neil Avenue, DL 395, Columbus, OH 43210-1277, USA;The Ohio State University, 2015 Neil Avenue, DL 395, Columbus, OH 43210-1277, USA;The Ohio State University, 2015 Neil Avenue, DL 395, Columbus, OH 43210-1277, USA;The Ohio State University, 2015 Neil Avenue, DL 395, Columbus, OH 43210-1277, USA
Venue:
Computer Communications
Year:
1999

Citing 5
Cited 0

Inter-receiver fairness: a novel performance measure for multicast ABR sessions

SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Multipoint-to-multipoint ABR service in ATM

Computer Networks and ISDN Systems - Special issue on ATM traffic management
Performance Analysis of Multicast Flow Control Algorithms over Combined Wired/Wireless Networks

INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On multicasting ABR protocols for wireless ATM networks

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
On max-min fair congestion control for multicast ABR service in ATM

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.24

Visualization

Abstract

The available bit rate (ABR) service is proposed to transport data traffic in asynchronous transfer mode (ATM) networks. ABR is unique because the network switches can indicate to the sources the rates at which they should be transmitting, thereby avoiding congestion and efficiently utilizing network resources. A number of algorithms have been developed for extending the ABR flow control algorithms for point-to-multipoint connections. In this case, feedback consolidation is required at the branch points to avoid overwhelming the sender with feedback. This paper discusses various design options and implementation alternatives for consolidation algorithms, and proposes a number of novel algorithms. The performance of the proposed algorithms and the original algorithms is compared under a variety of conditions. Results indicate that the algorithms we propose eliminate the consolidation noise (caused if the feedback is returned before all branches respond), while exhibiting a fast transient response.