ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 25, Issue 8, 15 May 2002, Pages 741-755
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (1084 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0140-3664(01)00405-4    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2002 Elsevier Science B.V. All rights reserved.

Fair flow control for ATM-ABR multipoint connections

Sonia Fahmya, Corresponding Author Contact Information, E-mail The Corresponding Author, Raj Jainb, E-mail The Corresponding Author, Rohit Goyalc, E-mail The Corresponding Author and Bobby Vandalored, E-mail The Corresponding Author

a Department of Computer Sciences, Purdue University, West Lafayette, Indiana, USA b Department of CIS, The Ohio State University, Columbus, Ohio, USA c Axiowave Networks, Marlborough, Massachusetts, USA d Nokia, Mountain View, California, USA

Received 21 March 2001;
revised 7 July 2001;
accepted 13 July 2001
Available online 6 October 2001.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Multipoint-to-multipoint communication can be implemented by combining the point-to-multipoint and multipoint-to-point connection algorithms. In an ATM multipoint-to-point connection, multiple sources send data to the same destination on a shared tree. Traffic from multiple branches is merged into a single stream after every merge point. It is sometimes impossible for the network to determine any source-specific characteristics since all sources in the multipoint connection may use the same connection identifiers. The challenge is to develop a fair rate allocation algorithm without per-source accounting as this is inequivalent to per-connection or per-flow accounting in this case.

We define fairness objectives for multipoint connections, and we design and simulate an O(1) fair ATM-ABR rate allocation scheme for point-to-point and multipoint connections sharing the same links. Simulation results show that the algorithm performs well and exhibits many desirable properties. We list key modifications necessary for any ATM-ABR rate allocation scheme to fairly accommodate multiple sources.

Author Keywords: Available bit rate; Asynchronous Transfer Mode; Bandwidth Allocation algorithms; Congestion Control Algorithms; Fairness; Multicasting

Article Outline

1. Introduction
2. Preliminaries and related work
2.1. Connections, sources and flows
2.2. VC merging
2.3. ABR flow control
2.4. Previously proposed ABR multipoint-to-point algorithms and multicast fairness studies
3. Multi-sender fairness objectives
4. The algorithm
4.1. Rate allocation algorithm
4.2. Merge point algorithm
4.3. Rate allocation design issues
4.4. Merge point design issues
5. Performance analysis
5.1. Parameter settings
5.2. Simulation results
5.2.1. Downstream bottleneck configuration
5.2.2. Upstream bottleneck with heterogenous links configuration
5.2.3. Effect of large rate increase factor values
5.2.4. Effect of extremely short measurement intervals
6. Conclusions and recommendations for switch schemes
Acknowledgements
References
Vitae















Computer Communications
Volume 25, Issue 8, 15 May 2002, Pages 741-755
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.