Performant Implementations of Tree Collision Resolution Algorithms for CATV Networks

Philippe Jacquet 1 Paul Mühlethaler 1 Philippe Robert 2
1 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
2 ALGO - Algorithms
Inria Paris-Rocquencourt
Abstract : In this paper, we analyze optimizations and adptations of the stack (tree) algorithm needed to use it as access scheme for a CATV channel access. In CATV network, we have large round trip delays, therefore it is possible have simultaneous tree collision resolution process. One approach is to handle many independant collision resolution process, another is to interleave all the collision resolution process. We give a detailed analysis of the two schemes concerning average and distribution of access delays. We show that the interleaving technique is both more simple and more efficient. This leads us to define a CATV channel access technique with interleaved collision resolution process on which we had a mechanism to offer reservation for successive slots. We a give a detailed implementation of this protocol as a thorough performance analysis. We deeply investigate the effect on throughput and delays of the end to end propagation delay and of the number of active stations.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00072524
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 10:11:03 AM
Last modification on : Thursday, February 7, 2019 - 4:46:04 PM
Long-term archiving on : Sunday, April 4, 2010 - 11:11:49 PM

Identifiers

  • HAL Id : inria-00072524, version 1

Collections

Citation

Philippe Jacquet, Paul Mühlethaler, Philippe Robert. Performant Implementations of Tree Collision Resolution Algorithms for CATV Networks. [Research Report] RR-4107, INRIA. 2001. ⟨inria-00072524⟩

Share

Metrics

Record views

273

Files downloads

191