1-3hit |
Tanun JARUVITAYAKOVIT Naris RANGSINOPPAMAS Prasit PRAPINMONGKOLKARN
This paper proposes a stable rate allocation algorithm for ABR service in ATM networks. The main goals in designing this algorithm are to speed up the convergence according to the max-min fairness criterion and to maximize the network utilization while the switch queue length can be properly controlled. Importantly, the set goals should be achieved in a wide range of network conditions without the need for adjusting the algorithm parameters. The algorithm is targeted to work in various networking environments with additional criteria as extended from the work of E-FMMRA (Enhanced Fast Max-Min Rate Allocation) and ERICA+ (Explicit Rate Indication for Congestion Avoidance) . The additional design criteria include the ability to enhance a large number of ABR connections and staggered TCP connections as well as to perform an accurate traffic averaging. The algorithm is analytically proved to be convergent. Simulation results indicate that the proposed algorithm achieves the goals in all evaluated configurations. However, it has some limitations when working in the large-scale network due to its per-connection accounting. It is not recommended to implement the algorithm with a switch that has a small buffer size due to its relatively long averaging interval.
Tetsuya YOKOTANI Tatsuki ICHIHASHI
One of the functions that should be provided in ATM LANs is multicast communication. For multicast communication on ATM LANs, the architecture of switch fabric and protocols for signaling have been studied. However, when data communication using a multicast connection such as LAN emulation service is provided, ABR service on a multicast connection (Multicast ABR) is also required. ABR service has been actively discussed in the ATM forum. Unfortunately, the study on flow control mechanism for Multicast ABR is not enough. This paper discusses the suitable flow control mechanism for Multicast ABR and shows its performance.
Tetsuya YOKOTANI Tatsuki ICHIHASHI Chikara MATSUDA Michihiro ISHIZAKA
Data communication by using TCP/IP is one of important services on ATM networks. At one approach in traffic control of this service, the dedicated bandwidth for data transfer is not guaranteed and the feedback congestion control to prevent cell loss is performed in the congestion case. However, when a large quantity of data is transferred within a short period, this traffic control cannot be expected to achieve high efficiency. In this case, it is suitable that the dedicated bandwidth is guaranteed by FRP (Fast Reservation Protocol) before the data is transferred. This paper describes that FRP is superior to the feedback congestion control for large size data transmission. Next, it proposes a selectable traffic control which selects adaptively one of the feedback congestion control and FRP.