| Description |
1 online resource (480 p.) |
| Series |
New York Academy of Sciences Ser |
|
New York Academy of Sciences Ser
|
| Contents |
Intro -- Title Page -- Copyright -- Table of Contents -- Dedication -- About the Author -- Preface -- Reader Requisites and Intended Audience -- Acknowledgments -- Chapter 1: Introduction -- 1.1 What is a Communication Network? -- 1.2 Capturing the Random User Behavior -- 1.3 Queueing Theory and Optimization Theory -- 1.4 The Rationale and Organization of this Book -- Part One: Modeling -- Chapter 2: Definitions and Notation -- 2.1 Notation for Sets, Vectors and Matrices -- 2.2 Network Topology -- 2.3 Installed Capacities -- 2.4 Traffic Demands -- 2.5 Traffic Routing -- References |
|
Chapter 3: Performance Metrics in Networks -- 3.1 Introduction -- 3.2 Delay -- 3.3 Blocking Probability -- 3.4 Average Number of Hops -- 3.5 Network Congestion -- 3.6 Network Cost -- 3.7 Network Resilience Metrics -- 3.8 Network Utility and Fairness in Resource Allocation -- 3.9 Notes and Sources -- 3.10 Exercises -- References -- Chapter 4: Routing Problems -- 4.1 Introduction -- 4.2 Flow-Path Formulation -- 4.3 Flow-Link Formulation -- 4.4 Destination-Link Formulation -- 4.5 Convexity Properties of Performance Metrics -- 4.6 Problem Variants -- 4.7 Notes and Sources -- 4.8 Exercises |
|
7.1 Introduction -- 7.2 Node Location Problems -- 7.3 Full Topology Design Problems -- 7.4 Multilayer Network Design -- 7.5 Notes and Sources -- 7.6 Exercises -- References -- Part Two: Algorithms -- Chapter 8: Gradient Algorithms in Network Design -- 8.1 Introduction -- 8.2 Convergence Rates -- 8.3 Projected Gradient Methods -- 8.4 Asynchronous and Distributed Algorithm Implementations -- 8.5 Non-Smooth Functions -- 8.6 Stochastic Gradient Methods -- 8.7 Stopping Criteria -- 8.8 Algorithm Design Hints -- 8.9 Notes and Sources -- 8.10 Exercises -- References |
|
Chapter 9: Primal Gradient Algorithms -- 9.1 Introduction -- 9.2 Penalty Methods -- 9.3 Adaptive Bifurcated Routing -- 9.4 Congestion Control using Barrier Functions -- 9.5 Persistence Probability Adjustment in MAC Protocols -- 9.6 Transmission Power Assignment in Wireless Networks -- 9.7 Notes and Sources -- 9.8 Exercises -- References -- Chapter 10: Dual Gradient Algorithms -- 10.1 Introduction -- 10.2 Adaptive Routing in Data Networks -- 10.3 Backpressure (Center-Free) Routing -- 10.4 Congestion Control -- 10.5 Decentralized Optimization of CSMA Window Sizes -- 10.6 Notes and Sources |
| Notes |
Description based upon print version of record |
| Bibliography |
References -- Chapter 5: Capacity Assignment Problems -- 5.1 Introduction -- 5.2 Long-Term Capacity Planning Problem Variants -- 5.3 Fast Capacity Allocation Problem Variants: Wireless Networks -- 5.4 MAC Design in Hard-Interference Scenarios -- 5.5 Transmission Power Optimization in Soft Interference Scenarios -- 5.6 Notes and Sources -- 5.7 Exercises -- References -- Chapter 6: Congestion Control Problems -- 6.1 Introduction -- 6.2 NUM Model -- 6.3 Case Study: TCP -- 6.4 Active Queue Management (AQM) -- 6.5 Notes and Sources -- 6.6 Exercises -- References -- Chapter 7: Topology Design Problems |
| Notes |
10.7 Exercises |
| Genre/Form |
Electronic books
|
| Form |
Electronic book
|
| ISBN |
9781119013334 |
|
111901333X |
|
