Abstract
In this paper a survey on tries, a contention resolution algorithm, their similarities, dissimilarities, and their mathematical treatment, will be given. It has already been mentioned in some papers that tries and contention trees follow one common stochastic model, but still they are frequently treated as separate objects in the literature. Hence the aim of the current work is to contribute to the unification of the various results in that area and to exhibit the employed methods, which involve, among others, analytic poissonization/depoissonization and the Mellin transform. For the sake of the example, a new parameter in contention trees, the number of terminal frames, will be studied.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
