排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
Tanun Jaruvitayakovit Prasit Prapinmongkolkarn 《International Journal of Communication Systems》2004,17(7):689-704
This paper proposes a novel explicit rate allocation algorithm called Fast Rate Allocation Congestion Avoidance (FRACA) algorithm supporting non‐zero minimum cell rate (MCR). The non‐zero MCR guarantee strategy for ABR service in ATM networks focused in this paper is MCR plus equal share (The ATM Forum Traffic Management Specification, version 4.0. April 1996). The main goals for designing the algorithm are the fast convergence according to the max–min fairness criteria, fairness among all sessions, maximum network utilization while the switch queue length is properly controlled. At the same time, it should work well under a wide range of network conditions without the need for adjusting the algorithm parameters. The performance of the proposed algorithm is evaluated and compared with the Generic Weighted Fairness (GWF) ERICA + (J Comput Comm 2000; 149). Simulation results show that the proposed algorithm achieves the design goals in the evaluated scenarios. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
2.
Naris Rangsinoppamas Tanun Jaruvitayakovit Prasit Prapinmongkolkarn 《International Journal of Communication Systems》2002,15(1):23-45
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. 相似文献
1