CONTENTS -- Preface -- 1 Erol Gelenbe's Contributions to Computer and Networks Performance -- 1.1 Introduction and Background -- 1.2 Technical Contributions -- 1.3 Contributions as a Research Leader and Mentor -- 1.4 Service to the Profession -- References -- Resource Management -- 2 Rethinking Incentives for Mobile Ad Hoc Networks -- 2.1 Introduction -- 2.2 Token Based Incentive Systems -- 2.2.1 Quality of Service Problems -- 2.2.2 Technical Conundrums -- 2.3 Trust Management Systems -- 2.4 Transparency vs Choice -- 2.5 Proposed Solution -- 2.5.1 Adoption Cycle For Mobile Ad Hoc Networks -- 2.5.2 Do We Really Need Incentive Systems? -- 2.6 Conclusions -- References -- 3 Fair and Efficient Allocation of Resources in the Internet -- 3.1 Introduction -- 3.2 Fairness Efficiency and Utility Functions -- 3.3 Utility-Based Bandwidth Allocation -- 3.3.1 Utility of the Aggregate -- 3.3.2 Limiting Regime Approximation -- 3.3.3 Offered Load Estimation -- 3.4 Utility-Based Admission Control -- 3.5 Utility-Based Scheduling -- 3.5.1 Measuring Class Delays -- 3.6 Conclusion -- Acknowledgements -- References -- 4 The Locality Principle -- 4.1 Introduction -- 4.2 Manifestation of a Need (1949-1965) -- 4.3 Discovery and Propagation of Locality Idea (1966-1980) -- 4.4 Adoption of Locality Principle (1967-present) -- 4.5 Modern Model of Locality: Context Awareness -- 4.6 Future Uses of Locality Principle -- References -- 5 A Simulation-Based Performance Analysis of Epoch Task Scheduling in Distributed Processors -- 5.1 Introduction -- 5.2 Model and Methodology -- 5.2.1 System and Workload Models -- 5.2.2 Task Routing Methods -- 5.2.3 Scheduling Strategies -- 5.2.4 Performance Metrics -- 5.2.5 Model Implementation and Input Parameters -- 5.3 Simulation Results and Performance Analysis -- 5.3.1 Probabilistic Routing.

5.3.2 Shortest Queue Routing -- 5.4 Conclusions -- References -- New Challenges on Modelling and Simulation -- 6 Counter Intuitive Aspects of Statistical Independence in Steady State Distributions -- 6.1 Introduction -- 6.2 A System of Two Independent M/M/l Queues -- 6.3 A System of Two Queues in Tandem -- 6.4 Statistical and Dynamic Independence -- 6.5 Beyond Stochastic Modelling -- 6.5.1 Central Role of Steady State Distributions -- 6.5.2 Generality Robustness and Level of Detail -- 6.5.3 Operational Analysis -- 6.6 Conclusions -- References -- 7 The Non-Stationary Loss Queue: A Survey -- 7.1 Introduction -- 7.2 The Simple Stationary Approximation (SSA) Method -- 7.3 The Stationary Peakedness Approximation (PK) Method -- 7.4 The Average Stationary Approximation (ASA) Method -- 7.5 The Closure Approximation for Non-Stationary Queues -- 7.6 The Pointwise Stationary Approximation (PSA) Method -- 7.7 The Modified Offered Load Approximation (MOL) Method -- 7.8 The Fixed Point Approximation (FPA) Method -- 7.9 Conclusions -- References -- 8 Stabilization Techniques for Load-Dependent Queuing Networks Algorithms -- 8.1 Introduction -- 8.2 Preliminaries -- 8.2.1 Numerical Exceptions -- 8.2.2 Closed Product-Form Queuing Networks -- 8.3 Numerical Instabilities in PFQN Algorithms -- 8.3.1 Convolution Algorithm -- 8.3.1.1 Static and Dynamic Scaling Techniques -- 8.3.2 Load Dependent Mean Value Analysis (MVA-LD) -- 8.4 Improved Stabilisation Techniques -- 8.4.1 Software Stabilisation -- 8.4.2 Stabilisation of MVA-LD with Two Customer Classes -- 8.4.2.1 Numerical Example -- 8.5 Conclusions -- References -- 9 Modelling and Simulation of Interdependent Critical Infrastructure: The Road Ahead -- 9.1 Introduction -- 9.2 Modelling and Simulation of Interdependent Infrastructures -- 9.2.1 Interdependency Analysis -- 9.2.2 System Analysis.

9.3 Conclusions -- References -- 10 Stochastic Automata Networks and Lumpable Stochastic Bounds: Bounding Availability -- 10.1 Introduction -- 10.2 Stochastic Automata Networks and Stochastic Bounds -- 10.2.1 SANs and their Tensor Representations -- 10.2.2 Stochastic Bounds: An Algorithmic Presentation -- 10.3 LIMSUB and Analysis of Transient Availability -- 10.4 Algorithm GetCol and its Complexity -- 10.4.1 Computation of a Column -- 10.4.1.1 Computation of the Synchronised Part Cs -- 10.4.1.2 Computation of the Local Part Cl -- 10.4.2 Sorting and Uniformisation -- 10.5 Example: A Resource Sharing Model Subject to Failure -- Acknowledgements -- References -- 11 Aggregation Methods for Cross-Layer Simulations -- 11.1 Introduction -- 11.2 Aggregation Methods -- 11.3 Aggregation of Markov Chains -- 11.3.1 Introduction -- 11.3.2 Decomposability Method of Kemeny and Snell: Theory -- 11.3.3 Example of the Method of Kemeny and Snell -- 11.3.4 Decomposition Method of Courtois: Theory -- 11.3.5 Example of the Decomposition Method of Courtois -- 11.4 Aggregation of Physical Sub-System -- 11.5 Time-Space Aggregation -- 11.6 Layer Aggregation -- 11.6.1 Dynamic Simulations -- 11.6.2 Example of Inter-Layer Design -- 11.6.3 Network Protocols which use Inter-Layer Interactions -- 11.7 Conclusion -- References -- Modelling of Emerging Networks -- 12 Space and Time Capacity in Dense Mobile Ad Hoc Networks -- 12.1 Introduction -- 12.2 Gupta and Kumar Scaling Property -- 12.3 Massively Dense Networks -- 12.3.1 Tractable Case with Curved Propagation Lines -- 12.3.2 Practical Implementation of Shortest Path Protocol -- 12.4 Introduction of Time Component -- 12.5 Information Flow Tensor and Perspectives -- References.

13 Stochastic Properties of Peer-to-Peer Communication Architecture in a Military Setting -- 13.1 Problem Formulation -- 13.2 A Renewal Model for Blue vs Red in a Subregion -- 13.2.1 The Visibility Detection Process -- 13.2.2 The Model -- 13.2.3 The Probability an EP of Size 6 Attaches to the Detected RA Before it Hides -- 13.2.4 The Probability the Detected RA is Killed Before it Hides -- 13.2.5 Model with Additional C2 Time -- 13.2.6 Numerical Illustration -- 13.3 Conclusions -- References -- 14 Quantifying the Quality of Audio and Video Transmissions over the Internet: The PSQA Approach -- 14.1 Introduction -- 14.2 The PSQA Technology -- 14.3 The Random Neural Networks Tool -- 14.3.1 G-networks -- 14.3.2 Feedforward 3-layer G-networks -- 14.3.3 Learning -- 14.3.4 Sensitivity Analysis -- 14.4 Applications -- 14.5 Conclusions -- References -- 15 A Study of the Dynamic Behaviour of a Web Site -- 15.1 Introduction -- 15.2 Data Collection -- 15.3 Results -- 15.4 Conclusions -- Acknowledgements -- References.