Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
New user? Click here to register.Have you forgotten your password?
  1. Home
  2. KMITL
  3. Publication
  4. Performance analysis of random slot multiple access algorithms for DOCSIS protocol
Loading...
Thumbnail Image

Performance analysis of random slot multiple access algorithms for DOCSIS protocol

Author(s)
Pawasopon, Thanyawarat
Sittichivapak, Suvepon
Date Issued
December 1, 2011
Type
Conference Paper
DOI
10.1109/TENCON.2011.6129166
Abstract
This paper proposes the analysis of random slot multiple access algorithms for DOCSIS (Data-Over-Cable Service Interface Specifications) protocol. These algorithms are the contention mini - slots resolution algorithms that uniformly generate probability p of each user need to send a request. They can increase an efficiency of mini-slot access. In this paper, we analyze efficiency of these algorithms by consideration of throughput and delay of system. And, the analysis results provide a comparative evaluation of the Truncated Binary Exponential Back - off (TBEB) that is widely studied algorithm for DOCSIS protocol. © 2011 IEEE.
Citation
IEEE Region 10 Annual International Conference Proceedings TENCON, 554-557, 2011
Metrics
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your Institution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback