File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Delay analysis of tree conflict resolution algorithm with and without broadcast reservation using random or pseudo random addressing

TitleDelay analysis of tree conflict resolution algorithm with and without broadcast reservation using random or pseudo random addressing
Authors
Issue Date1991
Citation
Conference Record - International Conference On Communications, 1991, v. 3, p. 1324-1328 How to Cite?
AbstractAn analysis is made of the performance of tree conflict resolution algorithms. A system with a finite number of users is considered, and each user provides buffers to store backlogged packets. In particular, the delay and system capacity of Capetanakis's original tree protocol and the broadcast reservation (BR) protocol using both random and pseudo random addressing are studied. Due to the nature of random access, the maximum throughput is low (only 0.348 for the original tree protocol). To improve it, the BR protocol combines the original tree protocol with the idea of demand assignment and yields very good delay-throughput. For the tree protocols, the random addressing scheme is fair but less efficient than deterministic addressing. To have fair and efficient addressing, an addressing scheme called pseudo random addressing is studied It is as efficient as deterministic addressing and yet as fair as random addressing.
Persistent Identifierhttp://hdl.handle.net/10722/158104
ISSN

 

DC FieldValueLanguage
dc.contributor.authorWu, Chengshongen_US
dc.contributor.authorLi, Victor OKen_US
dc.date.accessioned2012-08-08T08:58:05Z-
dc.date.available2012-08-08T08:58:05Z-
dc.date.issued1991en_US
dc.identifier.citationConference Record - International Conference On Communications, 1991, v. 3, p. 1324-1328en_US
dc.identifier.issn0536-1486en_US
dc.identifier.urihttp://hdl.handle.net/10722/158104-
dc.description.abstractAn analysis is made of the performance of tree conflict resolution algorithms. A system with a finite number of users is considered, and each user provides buffers to store backlogged packets. In particular, the delay and system capacity of Capetanakis's original tree protocol and the broadcast reservation (BR) protocol using both random and pseudo random addressing are studied. Due to the nature of random access, the maximum throughput is low (only 0.348 for the original tree protocol). To improve it, the BR protocol combines the original tree protocol with the idea of demand assignment and yields very good delay-throughput. For the tree protocols, the random addressing scheme is fair but less efficient than deterministic addressing. To have fair and efficient addressing, an addressing scheme called pseudo random addressing is studied It is as efficient as deterministic addressing and yet as fair as random addressing.en_US
dc.languageengen_US
dc.relation.ispartofConference Record - International Conference on Communicationsen_US
dc.titleDelay analysis of tree conflict resolution algorithm with and without broadcast reservation using random or pseudo random addressingen_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, Victor OK:vli@eee.hku.hken_US
dc.identifier.authorityLi, Victor OK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0026407753en_US
dc.identifier.volume3en_US
dc.identifier.spage1324en_US
dc.identifier.epage1328en_US
dc.identifier.scopusauthoridWu, Chengshong=25958496500en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats