z-logo
Premium
Performance analysis and interoperability issue of consolidation algorithms in point‐to‐multipoint ABR services
Author(s) -
Rangsinoppamas Naris,
Jaruvitayakovit Tanun,
Prapinmongkolkarn Prasit
Publication year - 2002
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.521
Subject(s) - computer science , consolidation (business) , algorithm , interoperability , multicast , computer network , accounting , business , operating system
In this paper we propose a performance analysis of the consolidation algorithms in point‐to‐multipoint ABR services in ATM network. We also present a new efficient consolidation algorithm, which overcomes some drawbacks of the previous works. The performance of the previous works and our proposed consolidation algorithms are analysed mathematically. General equations for calculating the response time and allowed cell rate of the source are derived. The derived equations show relatively good agreement with simulation results and can be applied for using in various network topologies. In addition, the interoperability issue in multicast available bit rate (ABR) is investigated. It is found that the branch points implemented with different consolidation algorithms can work interoperably. It is concluded from the simulation results that the performance of the point‐to‐multipoint ABR services is dominated by the most upper stream branch point (the nearest one to the source), therefore, in order to avoid the consolidation noise and get a faster response in the network, the most upper stream branch point has to be implemented with a high accuracy consolidation algorithm while the lower stream branch point(s) should be implemented with a fast response consolidation algorithm with a less degree of complexity. Copyright © 2002 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here