DAVIC PROTOCOL.pdf (267.45 kB)
Contention resolution algorithms for CATV networks based on the DVB/DAVIC protocol
conference contribution
posted on 2017-06-22, 13:06 authored by Victor Rangel, Robert EdwardsRobert Edwards, K. SchunkeIn a bi-directional Community Antenna Television (CATV) Network the use of a Contention Resolutions Algorithm (CRA) is essential in order to allocate the bandwidth of the multiaccess medium in the upstream direction between the active stations. Two of the CRAs known as exponential backoff
algorithm and splitting tree algorithm, have recently been adopted by the Digital Video Broadcasting (DVB)/Digital Audio-Visual Council (DAVIC) Cable Television Protocol. In this paper we present a performance analysis
and a comparison of both algorithms in terms of mean access delay and system throughput for different traffic source scenarios (i.e. Internet traffic, Voice over IP, and mixed traffic). The analysis focuses on changes in
performance when selecting different backoff bounds for the exponential backoff algorithm and different values for the Entry-Spreading factor of the splitting tree algorithm. The results presented here show that an increase
over 10% in system performance can be obtained by selecting the splitting tree algorithm for different traffic sources.
History
School
- Mechanical, Electrical and Manufacturing Engineering
Published in
Proc. of the International Broadcasting Conference (IBC)Volume
IPages
193 - 202 (9)Citation
RANGEL, V., EDWARDS, R.M. and SCHUNKE, K., 2001. Contention resolution algorithms for CATV networks based on the DVB/DAVIC protocol. IN: Proceedings of the International Broadcasting Conference (IBC), Amsterdam, 13-18th Sept., I, pp. 193-202.Publisher
IEE on behalf of the International Broadcasting ConventionVersion
- AM (Accepted Manuscript)
Publisher statement
This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/Publication date
2001Notes
This is a conference paper.Language
- en