標題: Interleaving collision resolution engines in n-ary tree protocols
作者: Yin, WM
Lin, YD
資訊工程學系
Department of Computer Science
關鍵字: collision resolution engine;interleaving;n-ary tree
公開日期: 1-十二月-2001
摘要: N-ary tree protocols are used for access control on shared channels to resolve collisions among channel users. For exercising a single collision resolution engine (CRE), throughput and latency of such protocols have been comprehensively studied. This study investigates the same protocols with multiple interleaved CREs in slotted networks. Power, defined as the ratio of throughput over latency, is measured as the criteria to launch or terminate CREs. Analysis results indicate that the appropriate number of CREs to trigger depends on the traffic load and the collision resolution protocol. As the load grows to 0.25, 0.35, 0.5, and 0.8, the optimal number of interleaved CREs becomes 2, 3, 5, and 8, respectively. Moreover, the power of n-ary tree protocol with n determined dynamically outperforms the 3-ary tree protocol by 13%.
URI: http://dx.doi.org/10.1109/4234.974497
http://hdl.handle.net/11536/29225
ISSN: 1089-7798
DOI: 10.1109/4234.974497
期刊: IEEE COMMUNICATIONS LETTERS
Volume: 5
Issue: 12
起始頁: 494
結束頁: 496
顯示於類別:期刊論文


文件中的檔案:

  1. 000173068100011.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。