Performance analysis of random slot multiple access algorithms for DOCSIS protocol

Pawasopon, Thanyawarat; Sittichivapak, Suvepon

doi:10.1109/tencon.2011.6129166

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

2018

Publication Types

Select...

Article2

Relationship

Self Cite1

Independent1

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 5 publications

(5 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Contention slots access schemes have been considered in many papers [9]- [17]. However, these papers were assumed that each user access to each slot with equal probability.…”

Section: Introductionmentioning

confidence: 99%

A Group Persistent Assignment in Contention Slots of DOCSIS

Pawasopon

Sittichivapak

2014

AMM

Self Cite

View full text Add to dashboard Cite

This paper presents a group persistent assignment method in contention slots for DOCSIS standard. Our model is a numerical method which can separate each user access to the arbitrary contention slot with independent persistent value. Each user can be collected into a group access. Then we can assign different persistent value to access slots in a frame. The occasion that many users access in same slot is reduced. In this paper, we also calculate the value of successful probability and average successful number in each contention period.

show abstract

“…Contention slots access schemes have been considered in many papers [9]- [17]. However, these papers were assumed that each user access to each slot with equal probability.…”

Section: Introductionmentioning

confidence: 99%