Comparison of contention resolution algorithms for a cable modem MAC protocol

Sala, Dolors; Limb, J.O.

doi:10.1109/izsbc.1998.670249

Cited by 13 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Over the past years, different technologies have appeared in which a contention period is defined to request the needed resources by the different nodes of the system, being developed some studies, like [4], [5] in HFC (Hybrid Fiber Coaxial), and [6], [7] in cable modem. An overview and comparison of contention resolution algorithm are shown in the latter papers.…”

Section: Related Workmentioning

confidence: 99%

New Contention Resolution Schemes for WiMAX

Delicado

et al. 2009

2009 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-The use of Broadband Wireless Access (BWA) technology is increasing due to the use of Internet and multimedia applications with strict requirements of end-to-end delay and jitter, through wireless devices. The IEEE 802.16 standard, which defines the physical (PHY) and the medium access control (MAC) layers, is one of the BWA standards. Its MAC layer is centralized basis, where the Base Station (BS) is responsible for assigning the needed bandwidth for each Subscriber Station (SS), which requests bandwidth competing between all of them. The standard defines a contention resolution process to resolve the potential occurrence of collisions during the requesting process. In this paper, we propose to modify the contention resolution process to improve the network performance, including end-to-end delay and throughput.

show abstract

Section: Related Workmentioning

confidence: 99%

New Contention Resolution Schemes for WiMAX

Delicado

et al. 2009

2009 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

show abstract

“…The blocked binary-tree algorithm has been widely used in the shared networking like ALOHA and satellite communications [3] and has been introduced in HFC network research as shown in [4] [5]. It is applied as the CRA mechanism in this paper due to its simplicity and high resolution efficiency.…”

Section: Fig 4 the Diagram Of Binary Tree Cramentioning

confidence: 99%

MAC Performance Analysis on Two-stage HFC Access Network

Gao

Yan

et al. 2006

The Sixth IEEE International Conference on Computer and Information Technology (CIT'06)

View full text Add to dashboard Cite

Two-stage access network structure is widely used in fixed and mobile access networks such as HFC (Hybrid Fibre/Coaxial) and BSS (Base Station System).In this paper, we introduce a new two-stage access scheme that employs random access and centralized polling methods corresponding to the two stages respectively. The new scheme's MAC (Medium Access Control) protocol procedure is presented based on DOCSIS standard. The performance of the mechanism in terms of access delay and throughput is evaluated and analyzed using computer simulating experiments. The results show the new access mechanism is efficient.

show abstract

“…Since an m-ary tree scheme was introduced [1, 6,14], a number of variants have been reported [9,12]. Also, a ternary tree scheme was adopted in IEEE 802.14 HFC standard [3,13,15]. In general, an m-ary tree scheme requires the feedback information about the result of data delivery attempt.…”

Section: Introductionmentioning

confidence: 99%

Unisource and Multisource Tree Schemes for Collision Resolution in Wireless MAN

Park

Shin

et al. 2005

Telecommun Syst

View full text Add to dashboard Cite

IEEE 802.16 wireless MAN standard specifies the air interface of broadband wireless access systems providing multiple services. In the wireless MAN, the best effort service class is ranked on the lowest position in priority and is assisted by a MAC scheme based on reservation ALOHA. In such a MAC scheme, a collision of resource requests is unavoidable so that the wireless MAN standard adopted a truncated binary exponential back-off scheme to arbitrate request attempts. While an exponential back-off scheme is simple to implement, its capture or starvation effect was revealed to deteriorate the fairness in short-term throughput and delay variance in the long term. Aiming at improving the throughput and delay performance, we thus propose the unisource and multisource m-ary tree schemes as alternatives for resolving request collisions in a wireless MAN. For the unisource tree scheme, we first develop an analytical method to exactly calculate the throughput in the saturated environment. Using the analytical method and simulation method as well, we then evaluate the saturated throughput, mean of MAC PDU delay and variance of MAC PDU delay in each proposed scheme. From the numerical examples, we confirm that the unisource and multisource m-ary tree schemes invoke superior throughput and delay performance to a truncated binary exponential back-off scheme.

show abstract

Comparison of contention resolution algorithms for a cable modem MAC protocol

Cited by 13 publications

References 5 publications

New Contention Resolution Schemes for WiMAX

New Contention Resolution Schemes for WiMAX

MAC Performance Analysis on Two-stage HFC Access Network

Unisource and Multisource Tree Schemes for Collision Resolution in Wireless MAN

Contact Info

Product

Resources

About