MULTIPLE ACCESS PROTOCOLS - ROM RAPHAEL

. .

Résumé :
Computer communication networks have come of age. Today, there is hardly any professional, particularly in engineering, that has not been the user of such a network. This proliferation requires the thorough understanding of the behavior of networks by those who are responsible for their operation as well as by those whose task it is to design such networks. This is probably the reason for the large number of books, monographs, and articles treating relevant issues, problems, and solutions in this field. Among all computer network architectures, those based on broadcast mul? tiple access channels stand out in their uniqueness. These networks appear naturally in environments requiring user mobility where the use of any fixed wiring is impossible and a wireless channel is the only available option. Because of their desirable characteristics multiple access networks are now used even in environments where a wired point-to-point network could have been installed. The understanding of the operation of multiple access network through their performance analysis is the focus of this book.

Sommaire:
1. Introduction.- 1.1. Protocol Classification.- 1.2. The System Model.- 2. Conflict-Free Access Protocols.- 2.1. Frequency Division Multiple Access.- 2.1.1. Delay Distribution.- 2.2. Time Division Multiple Access.- 2.2.1. FDMA - TDMA Comparison.- 2.2.2. Message Delay Distribution.- 2.3. Generalized TDMA.- 2.3.1. Number of Packets at Allocated Slots - Distribution.- 2.3.2. Expected Number of Packets at Allocated Slots.- 2.3.3. Message Delay Distribution.- 2.3.4. Expected Message Delay.- 2.4. Dynamic Conflict-Free Protocols.- 2.4.1. Expected Delay.- 2.5. Related Analysis.- Exercises.- Appendix: Distribution of the Mod Function.- 3. Aloha Protocols.- 3.1. Pure Aloha.- 3.2. Slotted Aloha.- 3.3. Slotted Aloha - Finite Number of Users.- Steady-State Probabilities.- Throughput Analysis.- Expected Delay.- The Capture Phenomenon.- 3.4. (In)Stability Of Aloha Protocols.- 3.4.1. Analysis.- 3.4.2. Stabilizing the Aloha System.- 3.5. Related Analysis.- 2.1 Exercises.- 4. Carrier Sensing Protocols.- 4.1. Nonpersistent Carrier Sense Multiple Access.- Throughput Analysis.- 4.2. 1-Persistent Carrier Sense Multiple Access.- Throughput Analysis.- Transmission Period Lengths.- State Probabilities.- 4.3. Slotted Carrier Sense Multiple Access.- Throughput of Slotted Nonpersistent CSMA.- Throughput of Slotted 1P-CSMA.- 4.4. Carrier Sense Multiple Access with Collision Detection.- Throughput of Slotted Nonpersistent CSMA/CD.- Throughput of Slotted 1-Persistent CSMA/CD.- 4.5. Related Analysis.- Exercises.- 5. Collision Resolution Protocols.- 5.1. The Binary-Tree Protocol.- 5.1.1. Moments of the Conditional Length of a CRI.- Bounds on the Moments.- 5.1.2. Stability Analysis.- 5.1.3. Bounds on Expected Packet Delay.- 5.2. Enhanced Protocols.- 5.2.1. The Modified Binary-Tree Protocol.- 5.2.2. The Epoch Mechanism.- 5.2.3. The Clipped Binary-Tree Protocol.- 5.3. Limited Sensing Protocols.- 5.3.1. Throughput Analysis.- 5.5. Related Analysis.- Exercises.- Appendix: Moments of Collision Resolution Interval Length.- 6. Additional Topics.- References.- Appendix: Mathematical Formulae and Background.- Glossary of Notation.