An MCR-weighted protocol for multipoint-to-point communication over ABR service
In this paper, we propose an available bit rate (ABR) algorithm which can work with multipoint-to-point (mpt-to-pt) as well as with point-to-point (pt-to-pt) connections. The algorithm is an extension to the MCR-weighted maxmin algorithm [Y. Hou, H. Tzeng, S. Panwar, IEEE GLOBCOM, 1997, pp. 492497], which allocates rates to users in proportion to their MCR requirements. This paper shows how source-level information can be compensated for in order to achieve a performance comparable to that of the pt-to-pt algorithm. This is achieved by combining the current cell rate (CCR) and minimum cell rate (MCR) values of all merged connections hierarchically at each merging point and inserting the aggregate values in the outgoing FRM cells. However, we propose to combine the bottlenecked information only in order to avoid mixing the rates of bottlenecked and non-bottlenecked sources. The same switch algorithm used for the pt-to-pt case can therefore still run on the VC level. A simulation study is conducted under different network configurations. Results show that the algorithm produces an oscillation-free allocation vector with almost the same convergence time of the pt-to-pt algorithm. The results also indicate that the additional buffer requirements due to packet level service is minimal.
multipoint-to-point abr atm traffic management