Study on Dynamic Priority Collision Resolution Algorithm in HFC-CATV Network


The KIPS Transactions:PartC, Vol. 10, No. 5, pp. 611-616, Oct. 2003
10.3745/KIPSTC.2003.10.5.611,   PDF Download:

Abstract

Recently, the HFC-CATV network stand in a substructure of superhighway information network. Because of sharing up to 500 of subscribes, the Collision Resolution Algorithm needs in the upstream channel of HFC-CATV network. In order to provide Quality of Service (QoS) to users with real-time data such as voice, video and interactive service, the research of Collision Resolution Algorithm must include an effective priority scheme. In IEEE 802.14, the Collision Resolution Algorithm has high request delay because of static PNA(Priority New Access) slots structure and different priority traffics with the same probability. In order to resolve this problem, this paper proposed dynamic priority collision resolution algorithm with ternary tree algorithm. It has low request delay according to an increase of traffic load because high priority traffic first resolve and new traffic content with different probability. In the result of the simulation, it demonstrated that the proposed algorithm needs lower request delay than that of ternary tree algorithm with static PNA slots structure.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
L. S. Yeon and J. J. Ug, "Study on Dynamic Priority Collision Resolution Algorithm in HFC-CATV Network," The KIPS Transactions:PartC, vol. 10, no. 5, pp. 611-616, 2003. DOI: 10.3745/KIPSTC.2003.10.5.611.

[ACM Style]
Lee Su Yeon and Jeong Jin Ug. 2003. Study on Dynamic Priority Collision Resolution Algorithm in HFC-CATV Network. The KIPS Transactions:PartC, 10, 5, (2003), 611-616. DOI: 10.3745/KIPSTC.2003.10.5.611.