| Preface | p. v |
| Erol Gelenbe's Contributions to Computer and Networks Performance | p. 1 |
| Introduction and Background | p. 1 |
| Technical Contributions | p. 2 |
| Contributions as a Research Leader and Mentor | p. 4 |
| Service to the Profession | p. 5 |
| References | p. 5 |
| Resource Management | p. 9 |
| Rethinking Incentives for Mobile Ad Hoc Networks | p. 11 |
| Introduction | p. 11 |
| Token Based Incentive Systems | p. 12 |
| Quality of Service Problems | p. 12 |
| Technical Conundrums | p. 13 |
| Trust Management Systems | p. 15 |
| Transparency vs Choice | p. 16 |
| Proposed Solution | p. 17 |
| Adoption Cycle For Mobile Ad Hoc Networks | p. 18 |
| Do We Really Need Incentive Systems? | p. 20 |
| Conclusions | p. 22 |
| References | p. 23 |
| Fair and Efficient Allocation of Resources in the Internet | p. 25 |
| Introduction | p. 25 |
| Fairness, Efficiency and Utility Functions | p. 26 |
| Utility-Based Bandwidth Allocation | p. 29 |
| Utility of the Aggregate | p. 30 |
| Limiting Regime Approximation | p. 32 |
| Offered Load Estimation | p. 33 |
| Utility-Based Admission Control | p. 35 |
| Utility-Based Scheduling | p. 37 |
| Measuring Class Delays | p. 38 |
| Conclusion | p. 40 |
| Acknowledgements | p. 40 |
| References | p. 41 |
| The Locality Principle | p. 43 |
| Introduction | p. 43 |
| Manifestation of a Need (1949-1965) | p. 44 |
| Discovery and Propagation of Locality Idea (1966-1980) | p. 47 |
| Adoption of Locality Principle (1967-present) | p. 56 |
| Modern Model of Locality: Context Awareness | p. 57 |
| Future Uses of Locality Principle | p. 60 |
| References | p. 62 |
| A Simulation-Based Performance Analysis of Epoch Task Scheduling in Distributed Processors | p. 69 |
| Introduction | p. 69 |
| Model and Methodology | p. 71 |
| System and Workload Models | p. 71 |
| Task Routing Methods | p. 72 |
| Scheduling Strategies | p. 73 |
| Performance Metrics | p. 73 |
| Model Implementation and Input Parameters | p. 73 |
| Simulation Results and Performance Analysis | p. 74 |
| Probabilistic Routing | p. 75 |
| Shortest Queue Routing | p. 80 |
| Conclusions | p. 84 |
| References | p. 85 |
| New Challenges on Modelling and Simulation | p. 87 |
| Counter Intuitive Aspects of Statistical Independence in Steady State Distributions | p. 89 |
| Introduction | p. 89 |
| A System of Two Independent M/M/1 Queues | p. 90 |
| A System of Two Queues in Tandem | p. 93 |
| Statistical and Dynamic Independence | p. 96 |
| Beyond Stochastic Modelling | p. 98 |
| Central Role of Steady State Distributions | p. 98 |
| Generality, Robustness and Level of Detail | p. 100 |
| Operational Analysis | p. 101 |
| Conclusions | p. 103 |
| References | p. 103 |
| The Non-Stationary Loss Queue: A Survey | p. 105 |
| Introduction | p. 105 |
| The Simple Stationary Approximation (SSA) Method | p. 108 |
| The Stationary Peakedness Approximation (PK) Method | p. 109 |
| The Average Stationary Approximation (ASA) Method | p. 111 |
| The Closure Approximation for Non-Stationary Queues | p. 112 |
| The Pointwise Stationary Approximation (PSA) Method | p. 114 |
| The Modified Offered Load Approximation (MOL) Method | p. 118 |
| The Fixed Point Approximation (FPA) Method | p. 121 |
| Conclusions | p. 123 |
| References | p. 124 |
| Stabilization Techniques for Load-Dependent Queuing Networks Algorithms | p. 127 |
| Introduction | p. 127 |
| Preliminaries | p. 128 |
| Numerical Exceptions | p. 128 |
| Closed Product-Form Queuing Networks | p. 129 |
| Numerical Instabilities in PFQN Algorithms | p. 130 |
| Convolution Algorithm | p. 130 |
| Static and Dynamic Scaling Techniques | p. 131 |
| Load Dependent Mean Value Analysis (MVA-LD) | p. 133 |
| Improved Stabilisation Techniques | p. 134 |
| Software Stabilisation | p. 134 |
| Stabilisation of MVA-LD with Two Customer Classes | p. 136 |
| Numerical Example | p. 137 |
| Conclusions | p. 140 |
| References | p. 140 |
| Modelling and Simulation of Interdependent Critical Infrastructure: The Road Ahead | p. 143 |
| Introduction | p. 144 |
| Modelling and Simulation of Interdependent Infrastructures | p. 146 |
| Interdependency Analysis | p. 146 |
| System Analysis | p. 150 |
| Conclusions | p. 154 |
| References | p. 157 |
| Stochastic Automata Networks and Lumpable Stochastic Bounds: Bounding Availability | p. 161 |
| Introduction | p. 162 |
| Stochastic Automata Networks and Stochastic Bounds | p. 163 |
| SANs and their Tensor Representations | p. 164 |
| Stochastic Bounds: An Algorithmic Presentation | p. 165 |
| LIMSUB and Analysis of Transient Availability | p. 169 |
| Algorithm GetCol and its Complexity | p. 172 |
| Computation of a Column | p. 174 |
| Computation of the Synchronised Part C[subscript s] | p. 175 |
| Computation of the Local Part C[subscript l] | p. 176 |
| Sorting and Uniformisation | p. 177 |
| Example: A Resource Sharing Model Subject to Failure | p. 177 |
| Acknowledgements | p. 179 |
| References | p. 179 |
| Aggregation Methods for Cross-Layer Simulations | p. 183 |
| Introduction | p. 183 |
| Aggregation Methods | p. 184 |
| Aggregation of Markov Chains | p. 185 |
| Introduction | p. 185 |
| Decomposability Method of Kemeny and Snell: Theory | p. 185 |
| Example of the Method of Kemeny and Snell | p. 186 |
| Decomposition Method of Courtois: Theory | p. 188 |
| Example of the Decomposition Method of Courtois | p. 190 |
| Aggregation of Physical Sub-System | p. 191 |
| Time-Space Aggregation | p. 195 |
| Layer Aggregation | p. 196 |
| Dynamic Simulations | p. 197 |
| Example of Inter-Layer Design | p. 197 |
| Network Protocols which use Inter-Layer Interactions | p. 198 |
| Conclusion | p. 202 |
| References | p. 202 |
| Modelling of Emerging Networks | p. 205 |
| Space and Time Capacity in Dense Mobile Ad Hoc Networks | p. 207 |
| Introduction | p. 207 |
| Gupta and Kumar Scaling Property | p. 209 |
| Massively Dense Networks | p. 211 |
| Tractable Case with Curved Propagation Lines | p. 213 |
| Practical Implementation of Shortest Path Protocol | p. 214 |
| Introduction of Tiem Component | p. 215 |
| Information Flow Tensor and Perspectives | p. 220 |
| References | p. 220 |
| Stochastic Properties of Peer-to-Peer Communication Architecture in a Military Setting | p. 223 |
| Problem Formulation | p. 223 |
| A Renewal Model for Blue vs Red in a Subregion | p. 225 |
| The Visibility Detection Process | p. 225 |
| The Model | p. 226 |
| The Probability an EP of Size b Attaches to the Detected RA Before it Hides | p. 227 |
| The Probability the Detected RA is Killed Before it Hides | p. 228 |
| Model with Additional C2 Time | p. 228 |
| Numerical Illustration | p. 229 |
| Conclusions | p. 231 |
| References | p. 232 |
| Quantifying the Quality of Audio and Video Transmissions over the Internet: The PSQA Approach | p. 235 |
| Introduction | p. 235 |
| The PSQA Technology | p. 236 |
| The Random Neural Networks Tool | p. 239 |
| G-networks | p. 240 |
| Feedforward 3-layer G-networks | p. 242 |
| Learning | p. 243 |
| Sensitivity Analysis | p. 245 |
| Applications | p. 246 |
| Conclusions | p. 249 |
| References | p. 249 |
| A Study of the Dynamic Behaviour of a Web Site | p. 251 |
| Introduction | p. 251 |
| Data Collection | p. 253 |
| Results | p. 254 |
| Conclusions | p. 259 |
| Acknowledgements | p. 260 |
| References | p. 260 |
| Table of Contents provided by Ingram. All Rights Reserved. |