Malek Benslama is Professor at the University of Constantine 1 in Algeria. He is a member of the scientific and technical advisory council for the Algerian Space Agency. His research centers on the field of space and communication networks.Wassila Kiamouche works at the University of Constantine 1 in Algeria.Hadj Batatia works at IRIT ENSEEIHT in Toulouse, France.

• PREFACE ixABBREVIATIONS xiINTRODUCTION xvCHAPTER 1. THE FOUNDATIONS OF SATELLITE NETWORKS 11.1. Introduction 11.2. Satellite orbits 31.2.1. Characteristics of the ellipse 31.2.2. Kepler’s laws 41.2.3. Orbital parameters for earth satellites 51.2.4. Orbital perturbations 71.2.5. Maintaining and surviving an orbit 71.3. Time, time variation and coverage 81.3.1. Geometric data 81.3.2. Approximation of coverage 111.3.3. Time interval between two successive intersatellite transfers 121.3.4. Time and time variation 121.4. Orbital paths 131.4.1. GEO-type systems 141.4.2. Elliptical systems 151.4.3. MEO-type systems 171.4.4. LEO-type systems 171.5. Characteristics of cellular satellite systems 191.6. The advantages of LEO systems 221.7. Handover in LEO satellite networks 231.7.1. Link-layer handover 241.7.2. Network-layer handover 25CHAPTER 2. AN INTRODUCTION TO TELETRAFFIC 272.1. Introduction 272.2. The history of teletraffic theory and technique 282.2.1. Queuing theory 282.2.2. Teletraffic theory 292.3. Basic concepts 302.3.1. The birth–death process 312.3.2. Poisson process 322.4. Erlang-B and Erlang-C models 342.4.1. Blocking probability and the Erlang-B formula 342.4.2. Queuing probability and the Erlang-C formula 36CHAPTER 3. CHANNEL ALLOCATION STRATEGIES AND THE MOBILITY MODEL 393.1. Introduction 393.2. Channel allocation techniques 403.2.1. Fixed channel allocation techniques 413.2.2. Dynamic channel allocation techniques 413.3. Spotbeam handover and priority strategies 433.3.1. Spotbeam handover 433.3.2. Priority strategies for handover requests 453.4. Mobility model 483.5. Analysis of the mobility model 53CHAPTER 4. EVALUATION PARAMETERS METHOD 634.1. Introduction 634.2. The advantages of the LEO MSS mobility model 644.3. Evaluation parameters method 714.3.1. Position of the MU in the cell 714.3.2. The moment the next handover request initializes 724.3.3. Maximum queuing time 744.4. Pseudo-last useful instant queuing strategy 774.4.1. Putting handover requests in a queue 774.4.2. Handover request management 774.4.3. LUI queuing strategy 784.4.4. Pseudo-LUI queuing strategy 794.5. Guard channel strategy: dynamic channel reservation-like 814.5.1. Dynamic channel reservation technique 814.5.2. Dynamic channel reservation DCR-like technique 83CHAPTER 5. ANALYTICAL STUDY 855.1. Introduction 855.2. An analysis of FCA-QH with different queuing strategies 855.3. Analytical study of FCR and FCR-like 915.3.1. An analysis of FCR 915.3.2. An analysis of FCR-like 94CHAPTER 6. THE RESCUING SYSTEM 1016.1. Introduction 1016.2. Fuzzy logic 1026.2.1. Definition of fuzzy subsets 1026.2.2. Decisions in the fuzzy environment 1026.3. The problem 1036.4. Rescuing system 105CHAPTER 7. RESULTS AND SIMULATION 1097.1. Introduction 1097.2. The (folded) simulated network 1107.3. Simulation results 1127.3.1. Verifying the simulation: a comparison with the analytical results of the FCA-QH case with different queuing strategies 1137.3.2. A comparison of FCA and DCA, DCA-QH & FCA-QH simulation using LUI 1157.3.3. A comparison of NPS and QH, DCA-NPS & DCA-QH simulation 1167.3.4. Comparison of QH strategies, DCA-QH FIFO, LUI, PLUI simulation 1177.3.5. Verifying the simulation: a comparison with the analytical results of the FCR and FCR-like case 1197.3.6. A comparison of DCR and DCR-like 120CHAPTER 8. PAB FOR IP TRAFFIC IN SATELLITE NETWORKS 1278.1. Introduction 1278.2. Proportional allocation of bandwidth 1298.2.1. Implementation of PAB 1308.3. Determination of the label fraction 1358.3.1. Equal fractions 1358.3.2. AP fractions 1358.3.3. GP fractions 1358.4. Simulation and results 1368.4.1. Single congested link 1378.4.2. Multiple congested link 1468.5. Conclusion 149GENERAL CONCLUSION 151APPENDIX 1 157APPENDIX 2 161APPENDIX 3 163APPENDIX 4 167APPENDIX 5 169BIBLIOGRAPHY 181INDEX 201

Malek Benslama is Professor at the University of Constantine 1 in Algeria. He is a member of the scientific and technical advisory council for the Algerian Space Agency. His research centers on the field of space and communication networks.Wassila Kiamouche works at the University of Constantine 1 in Algeria.Hadj Batatia works at IRIT ENSEEIHT in Toulouse, France.

• PREFACE ixABBREVIATIONS xiINTRODUCTION xvCHAPTER 1. THE FOUNDATIONS OF SATELLITE NETWORKS 11.1. Introduction 11.2. Satellite orbits 31.2.1. Characteristics of the ellipse 31.2.2. Kepler’s laws 41.2.3. Orbital parameters for earth satellites 51.2.4. Orbital perturbations 71.2.5. Maintaining and surviving an orbit 71.3. Time, time variation and coverage 81.3.1. Geometric data 81.3.2. Approximation of coverage 111.3.3. Time interval between two successive intersatellite transfers 121.3.4. Time and time variation 121.4. Orbital paths 131.4.1. GEO-type systems 141.4.2. Elliptical systems 151.4.3. MEO-type systems 171.4.4. LEO-type systems 171.5. Characteristics of cellular satellite systems 191.6. The advantages of LEO systems 221.7. Handover in LEO satellite networks 231.7.1. Link-layer handover 241.7.2. Network-layer handover 25CHAPTER 2. AN INTRODUCTION TO TELETRAFFIC 272.1. Introduction 272.2. The history of teletraffic theory and technique 282.2.1. Queuing theory 282.2.2. Teletraffic theory 292.3. Basic concepts 302.3.1. The birth–death process 312.3.2. Poisson process 322.4. Erlang-B and Erlang-C models 342.4.1. Blocking probability and the Erlang-B formula 342.4.2. Queuing probability and the Erlang-C formula 36CHAPTER 3. CHANNEL ALLOCATION STRATEGIES AND THE MOBILITY MODEL 393.1. Introduction 393.2. Channel allocation techniques 403.2.1. Fixed channel allocation techniques 413.2.2. Dynamic channel allocation techniques 413.3. Spotbeam handover and priority strategies 433.3.1. Spotbeam handover 433.3.2. Priority strategies for handover requests 453.4. Mobility model 483.5. Analysis of the mobility model 53CHAPTER 4. EVALUATION PARAMETERS METHOD 634.1. Introduction 634.2. The advantages of the LEO MSS mobility model 644.3. Evaluation parameters method 714.3.1. Position of the MU in the cell 714.3.2. The moment the next handover request initializes 724.3.3. Maximum queuing time 744.4. Pseudo-last useful instant queuing strategy 774.4.1. Putting handover requests in a queue 774.4.2. Handover request management 774.4.3. LUI queuing strategy 784.4.4. Pseudo-LUI queuing strategy 794.5. Guard channel strategy: dynamic channel reservation-like 814.5.1. Dynamic channel reservation technique 814.5.2. Dynamic channel reservation DCR-like technique 83CHAPTER 5. ANALYTICAL STUDY 855.1. Introduction 855.2. An analysis of FCA-QH with different queuing strategies 855.3. Analytical study of FCR and FCR-like 915.3.1. An analysis of FCR 915.3.2. An analysis of FCR-like 94CHAPTER 6. THE RESCUING SYSTEM 1016.1. Introduction 1016.2. Fuzzy logic 1026.2.1. Definition of fuzzy subsets 1026.2.2. Decisions in the fuzzy environment 1026.3. The problem 1036.4. Rescuing system 105CHAPTER 7. RESULTS AND SIMULATION 1097.1. Introduction 1097.2. The (folded) simulated network 1107.3. Simulation results 1127.3.1. Verifying the simulation: a comparison with the analytical results of the FCA-QH case with different queuing strategies 1137.3.2. A comparison of FCA and DCA, DCA-QH & FCA-QH simulation using LUI 1157.3.3. A comparison of NPS and QH, DCA-NPS & DCA-QH simulation 1167.3.4. Comparison of QH strategies, DCA-QH FIFO, LUI, PLUI simulation 1177.3.5. Verifying the simulation: a comparison with the analytical results of the FCR and FCR-like case 1197.3.6. A comparison of DCR and DCR-like 120CHAPTER 8. PAB FOR IP TRAFFIC IN SATELLITE NETWORKS 1278.1. Introduction 1278.2. Proportional allocation of bandwidth 1298.2.1. Implementation of PAB 1308.3. Determination of the label fraction 1358.3.1. Equal fractions 1358.3.2. AP fractions 1358.3.3. GP fractions 1358.4. Simulation and results 1368.4.1. Single congested link 1378.4.2. Multiple congested link 1468.5. Conclusion 149GENERAL CONCLUSION 151APPENDIX 1 157APPENDIX 2 161APPENDIX 3 163APPENDIX 4 167APPENDIX 5 169BIBLIOGRAPHY 181INDEX 201

Malek Benslama is Professor at the University of Constantine 1 in Algeria. He is a member of the scientific and technical advisory council for the Algerian Space Agency. His research centers on the field of space and communication networks.Wassila Kiamouche works at the University of Constantine 1 in Algeria.Hadj Batatia works at IRIT ENSEEIHT in Toulouse, France.

• PREFACE ixABBREVIATIONS xiINTRODUCTION xvCHAPTER 1. THE FOUNDATIONS OF SATELLITE NETWORKS 11.1. Introduction 11.2. Satellite orbits 31.2.1. Characteristics of the ellipse 31.2.2. Kepler’s laws 41.2.3. Orbital parameters for earth satellites 51.2.4. Orbital perturbations 71.2.5. Maintaining and surviving an orbit 71.3. Time, time variation and coverage 81.3.1. Geometric data 81.3.2. Approximation of coverage 111.3.3. Time interval between two successive intersatellite transfers 121.3.4. Time and time variation 121.4. Orbital paths 131.4.1. GEO-type systems 141.4.2. Elliptical systems 151.4.3. MEO-type systems 171.4.4. LEO-type systems 171.5. Characteristics of cellular satellite systems 191.6. The advantages of LEO systems 221.7. Handover in LEO satellite networks 231.7.1. Link-layer handover 241.7.2. Network-layer handover 25CHAPTER 2. AN INTRODUCTION TO TELETRAFFIC 272.1. Introduction 272.2. The history of teletraffic theory and technique 282.2.1. Queuing theory 282.2.2. Teletraffic theory 292.3. Basic concepts 302.3.1. The birth–death process 312.3.2. Poisson process 322.4. Erlang-B and Erlang-C models 342.4.1. Blocking probability and the Erlang-B formula 342.4.2. Queuing probability and the Erlang-C formula 36CHAPTER 3. CHANNEL ALLOCATION STRATEGIES AND THE MOBILITY MODEL 393.1. Introduction 393.2. Channel allocation techniques 403.2.1. Fixed channel allocation techniques 413.2.2. Dynamic channel allocation techniques 413.3. Spotbeam handover and priority strategies 433.3.1. Spotbeam handover 433.3.2. Priority strategies for handover requests 453.4. Mobility model 483.5. Analysis of the mobility model 53CHAPTER 4. EVALUATION PARAMETERS METHOD 634.1. Introduction 634.2. The advantages of the LEO MSS mobility model 644.3. Evaluation parameters method 714.3.1. Position of the MU in the cell 714.3.2. The moment the next handover request initializes 724.3.3. Maximum queuing time 744.4. Pseudo-last useful instant queuing strategy 774.4.1. Putting handover requests in a queue 774.4.2. Handover request management 774.4.3. LUI queuing strategy 784.4.4. Pseudo-LUI queuing strategy 794.5. Guard channel strategy: dynamic channel reservation-like 814.5.1. Dynamic channel reservation technique 814.5.2. Dynamic channel reservation DCR-like technique 83CHAPTER 5. ANALYTICAL STUDY 855.1. Introduction 855.2. An analysis of FCA-QH with different queuing strategies 855.3. Analytical study of FCR and FCR-like 915.3.1. An analysis of FCR 915.3.2. An analysis of FCR-like 94CHAPTER 6. THE RESCUING SYSTEM 1016.1. Introduction 1016.2. Fuzzy logic 1026.2.1. Definition of fuzzy subsets 1026.2.2. Decisions in the fuzzy environment 1026.3. The problem 1036.4. Rescuing system 105CHAPTER 7. RESULTS AND SIMULATION 1097.1. Introduction 1097.2. The (folded) simulated network 1107.3. Simulation results 1127.3.1. Verifying the simulation: a comparison with the analytical results of the FCA-QH case with different queuing strategies 1137.3.2. A comparison of FCA and DCA, DCA-QH & FCA-QH simulation using LUI 1157.3.3. A comparison of NPS and QH, DCA-NPS & DCA-QH simulation 1167.3.4. Comparison of QH strategies, DCA-QH FIFO, LUI, PLUI simulation 1177.3.5. Verifying the simulation: a comparison with the analytical results of the FCR and FCR-like case 1197.3.6. A comparison of DCR and DCR-like 120CHAPTER 8. PAB FOR IP TRAFFIC IN SATELLITE NETWORKS 1278.1. Introduction 1278.2. Proportional allocation of bandwidth 1298.2.1. Implementation of PAB 1308.3. Determination of the label fraction 1358.3.1. Equal fractions 1358.3.2. AP fractions 1358.3.3. GP fractions 1358.4. Simulation and results 1368.4.1. Single congested link 1378.4.2. Multiple congested link 1468.5. Conclusion 149GENERAL CONCLUSION 151APPENDIX 1 157APPENDIX 2 161APPENDIX 3 163APPENDIX 4 167APPENDIX 5 169BIBLIOGRAPHY 181INDEX 201