Performance Analysis of Multi-User Communication Systems: Access Methods and Protocols
In a multi-user communication facility a set of processes (term which we use here in the sense of computer science, i.e. a “program” in execution) exchange information via a communication “channel”. Various examples of such a system can be imagined : micr
- PDF / 16,334,423 Bytes
- 258 Pages / 486.26 x 691.298 pts Page_size
- 50 Downloads / 154 Views
MULTI -USER COMMUNICATION SYSTEMS
EDITED BY G. LONGO UNIVERSITlt DI TRIESTE
Springer-Verlag
~
WienGmbH
SCIENCES
This work is suhject to copyright. All rights are reserved, whether the whole or part of the material is concemed specifically those of translation, reprinting, re-use of illustrations, hroadcasting, reproduction by photocopying machine or similar means, and storage in data hanks.
© 1981 hy Springer-Verlag Wien Originally published by CISM, Udine in 1981.
ISBN 978-3-211-81612-7 ISBN 978-3-7091-2900-5 (eBook) DOI 10.1007/978-3-7091-2900-5
PREFACE
Here is a set of qualified contributions to one of the most fascinating and intriguing problems in an area between system theory and communication theory, which is rapidly developing today, namely multiterminal or distributed communication. I am grateful to the lecturers who accepted my invitation and came to Udine in july 1979, to talk about this topic and to illustrate its numerous facets. I am also grateful to the
audience, who contributed in an active way to the success of the school. Tbe delay witb wbicb tbis volume is publisbed althougb being unpleasant in itself, gave tbe autbors tbe possibility of updating tbeir contributions, tbus making tbe written text even more valuable tban the set of lectures from wbicb it developed. just a few days before tbis book was printed, tbe Rector of CISM, professor Waclaw 0/szak, passed away.
I~
is witb great sorrow tbat I announce bis deatb to tbe friends of our
Centre, and I wisb to devote this book to bim. He bad been one of tbe founders of CISM and bad spent tbe last twelve years of bis life in building and extending the activity oftbis Centre. We all are greatly indebted to him. Giuseppe Longo Udine, December 1980
CONTENTS Page
Tbe Poisson Multiple-Access Conflict Resolution Problem by T. Berger Preface 1. Description of the Problem 20 Reformation-Fishingin a Poisson Stream with a Weak Net 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
02 0
3
3 Slotted ALOHA
04
40 The 0.487 Algorithm 50 Upper Bounds
09
References
26
0
0
0
18
0
Performance Analysis of Multi-User Communication Systems: Access Metbadsand Protocols by Eo Gelenbe
29
10 Introduction 20 Random Access to a Single Broadcast Channel References 0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
30 0
47
About a Combinatorial Proof ofthe Noisy Channel Coding Theorem by]. Körner
.......
Introduction
Statement of the Problem
49 50
Existence of Good Codes
57
Converse Results
63
Universal Coding
68
Outlook
70
References
0
0
0
71
Contents
IIl
Collision-Resolution Algorithms and Random-Access Communications by j.L. Massey · 1. lntroduction
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
73
. . . . . . . . . . . . . . . . . . . . . . . . . .
76
3. Traffic-lndependent Properties of the Capetanakis Collision-Resolution Algorithm .
83
2. Collision-Resolution Algorithms
4. Random-Access via Collision-Resolution
. . . . .
5. Effects of Propagation Delays, Channel Er
Data Loading...
