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.
展开▼
