Summary
A single multiaccess channel is studied with the outcome of a transmission being either ‘idle’, ‘success’, or ‘collision’ (ternary channel). Packets involved in a collision must be retransmitted, and an efficient way to solve a collision is known in the literature as Gallager-Tsybakov-Mikhailov algorithm. Performance analysis of the algorithm is quite hard. In fact, it bases on a numerical solution of some recurrence equations and on a numerical evaluation of some series. The obvious drawback of it is lack of insight into the behavior of the algorithm. We shall present a new approach of looking at the algorithm and discuss some attempts of analyzing its performance. In particular, expected lengths of a resolution interval and a conflict resolution interval as well as throughput of the algorithm will be discussed using asymptotic approximation and “a small input rate” approximation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramowitz, M., Stegun, I.: Handbook of mathematical functions. Dover, New York 1964
Berger, T.: Poisson multiple-access contention with binary feedback. IEEE Trans. Inf. Theory IT-30, 745–751 (1984)
Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Trans. Inf. Theory IT-25, 505–515 (1979)
Fayolle, G., Flajolet, Ph., Hofri, M.: On functional equation arising in the analysis of a protocol for multi-access broadcast channel. INRIA Technical Report, No. 131 (1982)
Flajolet, Ph., Regnier, M., Sotteau, D.: Algebraic methods for trie statistics. Ann. Discrete Math. 25, 145–188 (1985)
Flajolet, Ph., Sedgewick, R.: Digital search trees revisited. J. Comput. 15, 748–767 (1985)
Flajolet, Ph., Saheb, N.: The complexity of generating an exponentially distributed variate. J. Algorithms 7, 463–488 (1986)
Gallager, R.: Conflict resolution in a random access broadcast networks. Proceedings AFOSR Workshop in Comunication Theory and Applications, (1978), pp. 74–76
Henrici, P.: Applied and computational complex analysis. vol. 2. John Wiley & Sons, New York (1977)
Hofri, M.: Stack algorithms for collision-detecting channels and their analysis: A limited survey. Proceedings of Intern. Seminar on Modeling and Performance Evaluation Methodology (Paris 1983), vol. 1, pp. 53–78
Knuth, D.: The art of computer programming, vol. 3. Sorting and Searching. Addison-Wesley, (1973)
Mathys, P., Flajolet, Ph.: Q-ary collision resolution algorithms in random access systems with free or blocked access. IEEE Trans. Information Theory, vol. IT-31, 2, (1985), pp. 217–244
Szpankowski, W.: Analysis of a recurrence equation arising in stack-type algorithms for collision-detecting channels. Proceedings of Intern. Seminar on Computer Networking and Performance Evaluation, Tokyo 1985, pp. 9.3.1–9.3.12
Szpankowski, W.: On an asymptotic analysis of a tree-type algorithm for broadcast communications. Information Processing Letters23, 135–142 (1986)
Szpankowski, W.: Solution of a linear recurrence equation arising in analysis of some algorithms. SIAM J. Algebraic Discrete Methods 8, 233–250 (1987)
Tsybakov, B., Mikhailov, V.: Free synchronous packet access in a broadcast channel with feedback. Prob. Inf. Trans. 14, 4 (1978), pp. 259–280
Tsybakov, B., Mikhailov, V.: Random multiple packet access: Part-and-Try algorithm. Prob. Inf. Trans. 16, 4, (1980), pp. 305–317
Whittaker, E., Watson, G.: A course of modern analysis. Cambridge press (1935)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Szpankowski, W. An analysis of a contention resolution algorithm. Acta Informatica 24, 173–190 (1987). https://doi.org/10.1007/BF00264363
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264363