E-Book, Englisch, 128 Seiten, Web PDF
Meditch / Chu Computer-Communication Networks
1. Auflage 2014
ISBN: 978-1-4831-9071-6
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark
E-Book, Englisch, 128 Seiten, Web PDF
ISBN: 978-1-4831-9071-6
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark
Computer- Communication Networks presents a collection of articles the focus of which is on the field of modeling, analysis, design, and performance optimization. It discusses the problem of modeling the performance of local area networks under file transfer. It addresses the design of multi-hop, mobile-user radio networks. Some of the topics covered in the book are the distributed packet switching queuing network design, some investigations on communication switching techniques in computer networks and the minimum hop flow assignment and routing subject to an average message delay constraints. The analysis of the multi-access communication channel is covered. The local area network file transfers are discussed. The text describes the C-PODA protocol. The congestion control scheme for window flow controlled computer network is presented. A chapter of the volume is devoted to the description of a fairness control algorithm. Another section of the book focuses on the analysis of hierarchical model. The book will provide useful information to computer programmers, network analysts, students, and researchers.
Autoren/Hrsg.
Weitere Infos & Material
1;Front Cover;1
2;Computer-Communication Networks;2
3;Copyright Page;3
4;Table of Contents ;4
5;FOREWORD;6
6;Chapter 1. DESIGN CONCEPTS FOR A MOBILE-USER RADIO NETWORK;8
6.1;INTRODUCTION;8
6.2;NETWORK ARCHITECTURE;9
6.3;ACTIVATION OF LINKS;12
6.4;INHERENT NETWORK SECURITY;13
6.5;CONCLUSIONS;15
6.6;REFERENCES;16
7;Chapter 2. DISTRIBUTED PACKET SWITCHING QUEUEING NETWORK DESIGN;18
7.1;1. INTRODUCTION;18
7.2;2. THE PROBLEM;18
7.3;3. THE ALGORITHM;21
7.4;4. COMPUTATIONAL COMPLEXITY;24
7.5;5. ARBOREOUS NETWORK DESIGN;25
7.6;6. CONCLUSIONS;26
7.7;REFERENCES;26
7.8;APPENDIX;27
8;Chapter 3. SOME INVESTIGATIONS ON COMMUNICATION SWITCHING TECHNIQUES IN COMPUTER NETWORKS;30
8.1;NOTATION;30
8.2;INTRODUCTION;30
8.3;BRIEF REVIEW OF THREE SWITCHING SCHEMES;31
8.4;ANALYTIC MODELING BASED ON QUEUEING THEORY;32
8.5;ASSUMPTIONS;32
8.6;NUMERICAL EXAMPLE;34
8.7;CONCLUSIONS;37
8.8;REFERENCES;38
9;Chapter 4. A HYBRID TDMA/RANDOM-ACCESS SCHEME FOR MULTIPLE-ACCESS COMMUNICATION NETWORKS;40
9.1;1. INTRODUCTION;40
9.2;2. THE SYSTEM MODEL;41
9.3;3. THE HYBRID ACCESS-CONTROL SCHEME;42
9.4;4. THE PACKET DELAY COMPONENTS;44
9.5;5. DURATION AND WAITING-TIME ANALYSIS FOR A TRANSMISSION EPOCH;45
9.6;6. MESSAGE DELAY ANALYSIS: SOURCES WITH LIMITED BUFFER CAPACITIES;48
9.7;7. PERFORMANCE CURVES: SOURCES WITH LIMITED BUFFER CAPACITIES;52
9.8;8. MESSAGE DELAY ANALYSIS: SOURCES WITH UNLIMITED BUFFER CAPACITIES;55
9.9;9. PERFORMANCE CURVES: SOURCES WITH UNLIMITED BUFFER CAPACITIES;60
9.10;REFERENCES;62
9.11;APPENDIX;62
10;Chapter 5. MINIMUM HOP FLOW ASSIGNMENT AND ROUTING SUBJECT TO AN AVERAGE MESSAGE DELAY CONSTRAINT;64
10.1;1. INTRODUCTION;64
10.2;2. PROBLEM FORMULATION;65
10.3;3. FLOW ASSIGNMENT AND ROUTING ALGORITHM;66
10.4;4. EXAMPLE;68
10.5;5. CONCLUSION;69
10.6;REFERENCES;71
11;Chapter 6. HIERARCHICAL MODELLING OF FILE TRANSFERS ON LOCAL AREA NETWORKS;72
11.1;1. INTRODUCTION;72
11.2;2. DESCRIPTION OF EXAMPLE LANs AND FILE TRANSFER ENVIRONMENTS;73
11.3;3. HIERARCHICAL MODEL FOR FILE TRANSFER IN LANs;75
11.4;4. ANALYSIS OF THE HIERARCHICAL MODEL;79
11.5;5. RESULTS;83
11.6;6. CONCLUDING REMARKS;86
11.7;REFERENCES;87
11.8;APPENDIX;88
12;Chapter 7. AN ANALYSIS OF THE C-PODA PROTOCOL FOR A SATELLITE DATA COMMUNICATION CHANNEL;90
12.1;1. INTRODUCTION;90
12.2;2. ANALYTICAL MODEL;92
12.3;3. THE AVERAGE WAITING TIME AT THE RAQ, WR;96
12.4;4. AVERAGE WAITING TIME AT CENTRAL QUEUE (CQ), Wc;101
12.5;5. NUMERICAL COMPUTATION OF AVERAGE MESSAGE DELAY, D;102
12.6;6. A FAIRNESS CONTROL ALGORITHM;105
12.7;7. SUMMARY AND CONCLUSIONS;106
12.8;REFERENCES;107
13;Chapter 8. A CONGESTION CONTROL SCHEME FOR WINDOW FLOW CONTROLLED COMPUTER NETWORKS;110
13.1;1. INTRODUCTION;110
13.2;2. FBCC: THE FLOW BALANCING CONGESTION CONTROL MECHANISM;111
13.3;3. SIMULATION ENVIRONMENT AND PERFORMANCE MEASURES;113
13.4;4. SIMULATION EXAMPLES;116
13.5;5. FBCC WITH ADAPTIVE THRESHOLD;121
13.6;6. APPLICATIONS AND CONCLUSIONS;123
13.7;REFERENCES;124




