{'fraction_non_alphanumeric': 0.012121212121212121, 'fraction_numerical': 0.0015151515151515152, 'mean_word_length': 4.798245614035087, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
On the relation between two slot-based contention resolution algorithms

This paper analyses the relation between two slot-based contention resolution algorithms for channel reservation namely UNI and CAP. For each algorithm the system performance is derived as a function of the number of request slots per frame and the number of users. The objective of this paper is to investigate the relationship between the UNI and CAP schemes. A relation of these two techniques is mathematically derived in details. The numerical results show that in a special case where the permission probability of CAP is set to 1/number of remaining users the CAP becomes the UNI.