Efficient algorithm for achieving GWPMM fairness in ATM ABR services
Long, Yihong & Ho, T.K. (2000) Efficient algorithm for achieving GWPMM fairness in ATM ABR services. Electronics Letters, 36(8), p. 772.
Abstract
A new explicit rate allocation algorithm is proposed for achieving generic weight-proportional max-min (GWPMM) fairness in asynchronous transfer mode (ATM) available bit rate services. This algorithm scales well with a fixed computational complexity of O(1) and can realise GWPMM fair rate allocation in an ATM network accurately.
Citations:
Citation countsare sourced monthly from Scopus and Web of Science citation databases.
These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science generally from 1980 onwards.
Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.
| ID Code: | 38210 |
|---|---|
| Item Type: | Journal Article |
| Keywords: | Data Communication, Computer network, Network switching |
| DOI: | 10.1049/el:20000582 |
| ISSN: | 0013-5194 |
| Subjects: | Australian and New Zealand Standard Research Classification > INFORMATION AND COMPUTING SCIENCES (080000) > DISTRIBUTED COMPUTING (080500) > Networking and Communications (080503) Australian and New Zealand Standard Research Classification > ENGINEERING (090000) > ELECTRICAL AND ELECTRONIC ENGINEERING (090600) > Signal Processing (090609) |
| Divisions: | Past > QUT Faculties & Divisions > Faculty of Built Environment and Engineering Past > Schools > School of Engineering Systems |
| Copyright Owner: | Copyright 2000 The Institution of Engineering and Technology |
| Deposited On: | 28 Oct 2010 10:06 |
| Last Modified: | 11 Aug 2011 01:43 |
Export: EndNote | Dublin Core | BibTeX
Repository Staff Only: item control page