A combination of ERICA+ and distributed WPMM algorithms to guarantee the minimum cell rate for ABR service in ATM networks | |
| Author | Le Trung Quan |
| Call Number | AIT RSPR no.TC-02-13 |
| Subject(s) | Fairness doctrine (Broadcasting) Algorithms Asynchronous transfer mode |
| Note | A research study submitted in pa1iial fulfillment of the requirements for the degree of Master of Engineering, School of Advanced Technologies |
| Publisher | Asian Institute of Technology |
| Series Statement | Research studies project report ; no. TC-02-13 |
| Abstract | Fairness is the most important characteristics in designing the rate-based algorithm for traffic management in Available Bit Rate (ABR) service. The ATM Forum has currently chosen max-min fairness criterion in its specification. However, ABR algorithms achieving max-min fairness have still not guaranteed the non-zero Minimum Cell Rate (MCR). One of the most general fairness criteria supporting for non-zero MCR is Weighted Propo1iional Max-Min (WPMM) fairness since WPMM can be converted into any other fairness criteria by changing simply either the MCR or the weight of ABR connections. In this Research Study, these fairness criteria and ABR traffic management framework as well as ABR algorithms are investigated. Then a combination of ERICA+ algorithm (based on Max-min fairness) and Distributed WPMM algorithm (based on WPMM fairness) is proposed to guarantee the MCR for ABR service. The proposed algorithm (WPMM-ERICA+) is compared with Distributed WPMM by using a modified version of NIST ATM Simulator developed in this Research Study. A set of benchmark network scenarios is used to evaluate the following properties of WPMM-ERICA+ and Distributed WPMM: convergence time to WPMM fairness, queue length and link utilization under stable, transient, dynamic load and under sourcebottleneck case. Results show that both Distributed WPMM and WPMM-ERICA+ converge fast to WPMM fairness within only a few Round Trip Times, i.e upper bounds are O(N) and O(log(N)) respectively, with high link utilization under stable and transient load. Distributed WPMM takes slightly shorter convergence time, but higher queue length, i.e thousands of cells compared with hundreds of cells of WPMM-ERICA+. However, under dynamic load or source-bottleneck case, Distributed WPMM does not converge to WPMM fairness, while WPMM-ERICA+ converges quite fast with low queue length and high link utilization. |
| Year | 2002 |
| Corresponding Series Added Entry | Asian Institute of Technology. Research studies project report ; no. TC-02-13 |
| Type | Research Study Project Report (RSPR) |
| School | School of Advanced Technologies (SAT) |
| Department | Department of Information and Communications Technologies (DICT) |
| Academic Program/FoS | Telecommunications (TC) |
| Chairperson(s) | Erke, Tapio; |
| Examination Committee(s) | Ahmed, Kazi M.;Teerapat Sanguankotchakorn; |
| Scholarship Donor(s) | Ministry of Education and Training (MOET) of Vietnam; |
| Degree | Special Studies Project Report (M.Eng.) - Asian Institute of Technology, 2002 |