在ATM網路中, 一種允入控制機構會對服務需求進行管理以滿足服務品質之要求。然而, 當網路無法找到單一路徑滿足頻寬之要求時, 此要求便被拒絕。然而, 當時網路所有剩餘頻寬可能大於此頻寬之要求。因此, 此篇論文提出一種利用多路徑連線演算法使得ATM網路頻寬可以充分利用同時也可滿足群播樹之建立。此外, 一種解決細胞傳送與接收順序之細胞分散與合併之演算法也被提出。為了減少細胞遺失率, 一種緩衝區取代法則也於此論文中提出。模擬結果顯示此多路徑連線演算法可有效降低服務拒絕率。 This paper proposes a simple algorithm to find multiple path selection for solving the bandwidth utilization of links in an established multicast tree derived from ATM networks and a cells splitting/ merging strategy for solving the sequence number within each cell. In ATM networks, most of call admission control (CAC) will reject an incoming call if none of the paths with enough bandwidth can be found from source to destination. However, at the moment of rejecting a call, the total remaining network bandwidth may be large enough to service this call. Hence, we define the multiple path selection problems in the multicast tree and propose an algorithm to find the minimum number of paths. Based on the found paths, The proposed cell splitting/merging strategy is introduced to guarantee that the sequence of delivered cell stream is the same as that of received at destination. Moreover, a simple buffer replacement scheme is proposed to improve the tolerance of burst cell loss. The experimental analysis is presented to characterize the performance of our algorithm.
一九九八年全國電信研討會論文集=Proceedings of 1998 National Symposium on Telecommunications，頁163-168