Cover -- Title Page -- Copyright -- Contents -- Preface -- Abbreviations -- General Introduction -- 1: Foundations of Satellite Networks -- 1.1. Introduction -- 1.2. Satellite orbits -- 1.2.1. Characteristics of the ellipse -- 1.2.2. Kepler's laws -- 1.2.3. Orbital parameters for earth satellites -- 1.2.4. Orbital perturbations -- 1.2.5. Maintaining and surviving an orbit -- 1.3. Time, time variation and coverage -- 1.3.1. Geometric data -- 1.3.2. Approximation of coverage -- 1.3.3. Time interval between two successive intersatellite transfers -- 1.3.4. Time and time variation -- 1.4. Orbital paths -- 1.4.1. GEO-type systems -- 1.4.2. Elliptical systems -- 1.4.3. MEO-type systems -- 1.4.4. LEO-type systems -- 1.5. Characteristics of cellular satellite systems -- 1.6. The advantages of LEO systems -- 1.7. Handover in LEO satellite networks -- 1.7.1. Link-layer handover -- 1.7.2. Network-layer handover -- 2: An Introduction to Teletraffic -- 2.1. Introduction -- 2.2. The history of teletraffic theory and technique -- 2.2.1. Queuing theory -- 2.2.2. Teletraffic theory -- 2.3. Basic concepts -- 2.3.1. The birth-death process -- 2.3.2. Poisson process -- 2.4. Erlang-B and Erlang-C models -- 2.4.1. Blocking probability and the Erlang-B formula -- 2.4.2. Queuing probability and the Erlang-C formula -- 3: Channel Allocation Strategies and the Mobility Model -- 3.1. Introduction -- 3.2. Channel allocation techniques -- 3.2.1. Fixed channel allocation techniques -- 3.2.2. Dynamic channel allocation techniques -- 3.3. Spotbeam handover and priority strategies -- 3.3.1. Spotbeam handover -- 3.3.2. Priority strategies for handover requests -- 3.3.2.1. Concepts of guaranteed handover -- 3.3.2.2. Concepts of guaranteed priority to handover -- 3.4. Mobility model -- 3.5. Analysis of the mobility model -- 4: Evaluation Parameters Method -- 4.1. Introduction.

4.2. The advantages of the LEO MSS mobility model -- 4.3. Evaluation parameters method -- 4.3.1. Position of the MU in the cell -- 4.3.2. The moment the next handover request initializes -- 4.3.3. Maximum queuing time -- 4.4. Pseudo-last useful instant queuing strategy -- 4.4.1. Putting handover requests in a queue -- 4.4.2. Handover request management -- 4.4.3. LUI queuing strategy -- 4.4.4. Pseudo-LUI queuing strategy -- 4.5. Guard channel strategy: dynamic channel reservation-like -- 4.5.1. Dynamic channel reservation technique [DEL 95, KIA 11] -- 4.5.2. Dynamic channel reservation DCR-like technique -- 5: Analytical Study -- 5.1. Introduction -- 5.2. An analysis of FCA-QH with different queuing strategies -- 5.3. Analytical study of FCR and FCR-like -- 5.3.1. An analysis of FCR -- 5.3.2. An analysis of FCR-like -- 6: The Rescuing System -- 6.1. Introduction -- 6.2. Fuzzy logic -- 6.2.1. Definition of fuzzy subsets -- 6.2.2. Decisions in the fuzzy environment -- 6.3. The problem -- 6.4. Rescuing system [DEL 99] -- 7: Results and Simulation -- 7.1. Introduction -- 7.2. The (folded) simulated network -- 7.3. Simulation results -- 7.3.1. Verifying the simulation: a comparison with the analytical results of the FCA-QH case with different queuing strategies -- 7.3.2. A comparison of FCA and DCA, DCA-QH & FCA-QH simulation using LUI -- 7.3.3. A comparison of NPS and QH, DCA-NPS & DCA-QH simulation -- 7.3.4. Comparison of QH strategies, DCA-QH FIFO, LUI, PLUI simulation -- 7.3.5. Verifying the simulation: a comparison with the analytical results of the FCR and FCR-like case -- 7.3.6. A comparison of DCR and DCR-like -- 8: PAB for IP Traffic in Satellite Networks -- 8.1. Introduction -- 8.2. Proportional allocation of bandwidth -- 8.2.1. Implementation of PAB -- 8.2.1.1. Packet labeling methodology [RAY 03, BAO 05, NIE 06].

8.2.1.2. Packet dropping mechanism at the core routers -- 8.3. Determination of the label fraction -- 8.3.1. Equal fractions -- 8.3.2. AP fractions -- 8.3.3. GP fractions -- 8.4. Simulation and results -- 8.4.1. Single congested link [CAO 09, TAL 06, VAL 07, AKY 01a, SEL 06] -- 8.4.1.1. GEO satellites -- 8.4.1.2. MEO satellites -- 8.4.1.3. LEO satellites -- 8.4.2. Multiple congested link -- 8.5. Conclusion -- General Conclusion -- Appendix 1: Demonstration of Erlang-B and Erlang-C -- A1.1. Erlag B -- A1.2. Erlang C -- Appendix 2: DCA Arrangement -- Appendix 3: Calculating the Probability of Handover Request Failure -- Appendix 4: Simulation Flow Chart -- Appendix 5: Presentation of the Network Simulator Software -- A5.1. Network simulator -- A5.1.1. Introduction -- A5.1.2. Network simulator: NS -- A5.1.2.1. Sources -- A5.1.2.2. Classes -- A5.1.2.2.1. Simulator class -- A5.1.2.2.2. Node class -- A5.1.2.2.3. Link class -- A5.1.2.2.4. Agent class -- A5.1.2.2.5. Source class -- A5.1.2.2.6. Queue class -- A5.1.3. Network AniMator: NAM -- A5.1.4. Implementing our approaches with NS -- A5.1.4.1. The creation of links -- A5.1.4.2. Types of files -- A5.1.4.3. "Edge" link creation function -- A5.1.4.4. "Core" link creation function -- Bibliography -- Index.