File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Delay analysis of buffered CSMA/CD protocols

TitleDelay analysis of buffered CSMA/CD protocols
Authors
Issue Date1988
Citation
IEEE Global Telecommunications Conference & Exhibition: Communications for the Information Age - Conference Record; Hollywood, FL., 1988. How to Cite?
AbstractAn approximate method for the delay analysis of CSMA/CD (carrier-sense multiple access with collision detection) with infinite-buffered users is proposed. The authors propose a system queue approach in which a single Markov chain considering all packets in the system is formulated. Based on the identical statistical behavior of each user, the packets in the system are distributed to every user with equal probability. A recursive method is introduced to solve the Markov chain efficiently. In the proposed approach, buffered packets and newly arrived packets can be distinguished. It is concluded that the recursive method can be used to evaluate CSMA/CD under the immediate-first-transmission (IFT) protocol or the delay-first-transmission (DFT) protocol. It is found that IFT performs better than DFT. Numerical results exhibit good agreement with simulation results.
Persistent Identifierhttp://hdl.handle.net/10722/158041

 

DC FieldValueLanguage
dc.contributor.authorWu, CSen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:57:50Z-
dc.date.available2012-08-08T08:57:50Z-
dc.date.issued1988en_US
dc.identifier.citationIEEE Global Telecommunications Conference & Exhibition: Communications for the Information Age - Conference Record; Hollywood, FL., 1988.-
dc.identifier.urihttp://hdl.handle.net/10722/158041-
dc.description.abstractAn approximate method for the delay analysis of CSMA/CD (carrier-sense multiple access with collision detection) with infinite-buffered users is proposed. The authors propose a system queue approach in which a single Markov chain considering all packets in the system is formulated. Based on the identical statistical behavior of each user, the packets in the system are distributed to every user with equal probability. A recursive method is introduced to solve the Markov chain efficiently. In the proposed approach, buffered packets and newly arrived packets can be distinguished. It is concluded that the recursive method can be used to evaluate CSMA/CD under the immediate-first-transmission (IFT) protocol or the delay-first-transmission (DFT) protocol. It is found that IFT performs better than DFT. Numerical results exhibit good agreement with simulation results.en_US
dc.languageengen_US
dc.relation.ispartofIEEE Global Telecommunications Conference & Exhibition-
dc.titleDelay analysis of buffered CSMA/CD protocolsen_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, ViOK: 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-0024173880en_US
dc.identifier.scopusauthoridWu, Chengshong=25958496500en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US
dc.customcontrol.immutablesml 160113 - amend-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats