Title: Interleaving collision resolution engines in n-ary tree protocols
Authors: Yin, WM
Lin, YD
資訊工程學系
Department of Computer Science
Keywords: collision resolution engine;interleaving;n-ary tree
Issue Date: 1-Dec-2001
Abstract: 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
Journal: IEEE COMMUNICATIONS LETTERS
Volume: 5
Issue: 12
Begin Page: 494
End Page: 496
Appears in Collections:Articles


Files in This Item:

  1. 000173068100011.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.