Network Management in Cloud and Edge Computing

Preface\n	Book Organization\nAcknowledgments\nContents\n1 Introduction\n	1.1 Research Background\n	1.2 Content Summary\n	1.3 Key Contributions\n	1.4 Chapter Arrangement\n	References\n2 A Survey of Resource Management in Cloud and Edge Computing\n	2.1 Latency Optimization for Cloud-Based Service Chains\n	2.2 Toward Shorter Task Completion Time\n	2.3 Container Placement and Reassignment for Large-Scale Network\n	2.4 Near-Optimal Network System for Data Replication\n	2.5 Distributed Edge Caching in Short Video Network\n	2.6 The Controllability of Dynamic Temporal Network\n	References\n3 A Task Scheduling Scheme in the DC Access Network\n	3.1 Introduction\n	3.2 Dynamic Differentiated Service with Delay-Guarantee\n		3.2.1 The Components of Latency\n		3.2.2 Design Philosophy\n		3.2.3 D3G Framework\n		3.2.4 Adjusting Resource Allocation\n	3.3 Deployment\n	3.4 D3G Experiment\n		3.4.1 Overall Performance\n		3.4.2 Algorithm Dynamism\n		3.4.3 System Scalability\n	3.5 Conclusion\n	References\n4 A Cross-Layer Transport Protocol Design in the Terminal Systems of DC\n	4.1 Introduction\n	4.2 TAFA\'s Control Scheme\n	4.3 Key Challenges\n	4.4 TAFA: Task-Aware and Flow-Aware\n		4.4.1 Task-Awareness\n			4.4.1.1 End-Host Operations\n			4.4.1.2 Switch Operations\n			4.4.1.3 Multiple Priority Queues\n		4.4.2 Flow-Awareness\n		4.4.3 Algorithm Implementation\n	4.5 System Stability\n	4.6 TAFA Experiment\n		4.6.1 Setup\n		4.6.2 Overall Performance of TAFA\n		4.6.3 TAFA vs. Task-Aware\n		4.6.4 TAFA vs. Flow-Aware\n	4.7 Conclusion\n	References\n5 Optimization of Container Communication in DC Back-EndServers\n	5.1 Container Group-Based Architecture\n	5.2 Problem Definition\n		5.2.1 Objective\n			5.2.1.1 Communication Cost\n			5.2.1.2 Resource Utilization Cost\n			5.2.1.3 Residual Resource Balance Cost\n		5.2.2 Constraints\n	5.3 Container Placement Problem\n		5.3.1 Problem Analysis\n		5.3.2 CA-WFD Algorithm\n	5.4 Container Reassignment Problem\n		5.4.1 Problem Analysis\n		5.4.2 Sweep&Search Algorithm\n			5.4.2.1 Sweep\n			5.4.2.2 Search\n	5.5 Implementation\n	5.6 Experiment\n		5.6.1 Performance of CA-WFD\n			5.6.1.1 Algorithm Performance\n			5.6.1.2 Algorithm Variations\n		5.6.2 Performance of Sweep&Search\n			5.6.2.1 Algorithm Performance\n			5.6.2.2 Algorithm Efficiency\n	5.7 Approximation Analysis of Sweep&Search\n	5.8 Conclusion\n	References\n6 The Deployment of Large-Scale Data Synchronization System for Cross-DC Networks\n	6.1 Motivation of BDS+ Design\n		6.1.1 Baidu\'s Inter-DC Multicast Workload\n		6.1.2 Potentials of Inter-DC Application-Level Overlay\n		6.1.3 Limitations of Existing Solutions\n		6.1.4 Key Observations\n	6.2 System Overview\n	6.3 Near-Optimal Application-Level Overlay Network\n		6.3.1 Basic Formulation\n		6.3.2 Decoupling Scheduling and Routing\n		6.3.3 Scheduling\n		6.3.4 Routing\n	6.4 Dynamic Bandwidth Separation\n		6.4.1 Design Logic\n		6.4.2 Integrated to BDS+\n			6.4.2.1 Online Traffic Prediction Algorithm\n			6.4.2.2 Dynamic Bandwidth Separation\n	6.5 System Design\n		6.5.1 Centralized Control of BDS+\n		6.5.2 Dynamic Bandwidth Separation of BDS+\n		6.5.3 Fault Tolerance\n		6.5.4 Implementation and Deployment\n	6.6 BDS+ Experiment\n		6.6.1 BDS+ Over Existing Solutions\n			6.6.1.1 Methodology\n			6.6.1.2 BDS+ vs. Gingko\n			6.6.1.3 BDS+ vs. Other Overlay Multicast Techniques\n		6.6.2 Micro-benchmarks\n			6.6.2.1 Scalability\n			6.6.2.2 Fault Tolerance\n			6.6.2.3 Choosing the Values of Key Parameters\n			6.6.2.4 In-Depth Analysis\n		6.6.3 BDS+\'s Dynamic Bandwidth Separation\n			6.6.3.1 Further Improvements Over BDS+\n			6.6.3.2 BDS+\'s Prediction Algorithm\n	6.7 Conclusion\n	Appendix\n	References\n7 Storage Issues in the Edge\n	7.1 Introduction\n		7.1.1 The Characteristics of Edge Caching in Short VideoNetwork\n		7.1.2 Limitations of Existing Solutions\n	7.2 AutoSight Design\n		7.2.1 System Overview\n		7.2.2 Correlation-Based Predictor: CoStore\n		7.2.3 Caching Engine: Viewfinder\n	7.3 AutoSight Experiment\n		7.3.1 Experiment Setting\n		7.3.2 Performance Comparison\n	7.4 Conclusion\n	References\n8 Computing Issues in the Edge\n	8.1 Background\n	8.2 DND: Driver Node Algorithm\n		8.2.1 Parameters and Variable Declarations\n		8.2.2 Modeling\n		8.2.3 Abstraction of Topology\n	8.3 DND Experiment\n		8.3.1 Communication Radius\n		8.3.2 Nodes Density\n		8.3.3 Nodes Velocity\n		8.3.4 Control Time\n	8.4 Conclusion\n	References