5G Networks: Planning, Design and Optimization

Cover
5G Networks:
Planning, Design and Optimization
Copyright
Dedication
Preface
1 Concepts and Architectures in 5G
	1.1 Software-Defined Networking (SDN)
		Centralized and Distributed Control
		Network Function Virtualization (NFV)
		OpenFlow
	1.2 IT Convergence
		Big Data
		Edge Computing
		Security and Integrity
		Energy Efficiency
	1.3 Building Blocks
		Optical Fiber
		SD-WAN
		Open Source Software
	1.4 Algorithms and Complexity Classes
		Optimization Problems
		Showing Problem Hardness
		Algorithms for Hard Problems
			Brute force
			Analytical methods
			Approximations
			Heuristics
			Problem restriction
			Divide and conquer
			Randomization
2 Network Modeling and Analysis
	2.1 Basic Properties
	2.2 Graph Representations
	2.3 Connectivity
		Depth-First Search
		Breadth-First Search
	2.4 Shortest Paths
		Dijkstra's Algorithm
		The Bellman-Ford Algorithm
	2.5 Minimum Spanning Trees
		Sparseness of Graphs
		Example Topologies
		The Traveling Salesman Problem
		The Nearest Neighbor Algorithm
		Incremental Insertion
		k-Optimal Methods
	2.6 Network Resilience
		Network Cuts
		The Deletion-Contraction Principle
3 Network Science
	3.1 The Small-World Phenomenon
	3.2 The Erdős-Rényi Model
		Graph Evolution
		Degree Distribution
		Clustering Coefficient
	3.3 Scale-Free Networks
		The Barabási-Albert Model
	3.4 Evolving Networks
	3.5 Degree Correlation
		Average Next Neighbor Degree
		The Correlation Coefficient
		Structural Cut-Off
	3.6 Importance
	3.7 Robustness
	3.8 Attack Tolerance
	3.9 Fault Propagation
	3.10 Improving Robustness
4 Self-Similarity, Fractality, and Chaos
	4.1 Self-Similarity: Causes and Implications
		Smooth Traffic
			The Poisson process
		Bursty Traffic
			The Markovian Additive Process
		Long Range-Dependent Traffic
			Fractional Brownian motion
	4.2 Stochastic Processes
		Basic Definitions
		Self-Similar and Long Range-Dependent Processes
	4.3 Detection and Estimation
		Detection of Poisson Characteristics
		Detection and Estimation of Long-Range Dependence and Self-Similarity
	4.4 Wavelet Analysis
	4.5 Fractal Maps
		The Iterated Function System
		The Fractal Dimension
			Box counting dimension
			Information dimension
			Correlation dimension
		Control Limits
		Online Process Monitoring
5 Optimization Techniques
	5.1 Optimization Problems in 5G
	5.2 Mixed-Integer Programs
		Dynamic Programming
		Branch-and-Bound
	5.3 Rounding
	5.4 Simulated Annealing
	5.5 Genetic Algorithms
		Binary representation
		Fitness function
		Reproduction
		Recombination (crossover)
		Mutation
	5.6 Swarm Algorithms
		Ant Colony Optimization
			Ant-based solution construction
			Pheromone update
		Particle Swarm Optimization
			Parameters
		Firefly Algorithm
6 Clustering
	6.1 Applications of Clustering
	6.2 Complexity
	6.3 Cluster Properties and Quality Measures
		Vertex Similarity
		Expansion
		Coverage
		Performance
		Conductance
	6.4 Heuristic Clustering Methods
		k-Nearest Neighbor
		k-Means and k-Median
	6.5 Spectral Clustering
		Similarity Matrices
			The ε-neighborhood
			k-Nearest neighbors
		Laplacians
		Eigenvectors
		Projection
	6.6 Iterative Improvement
		Uniform Graph Partitioning
7 Bayesian Analysis
	7.1 Bayesian Average
	7.2 The Gibbs Sampler
		Markov Chains
	7.3 The Expectation-Maximization Algorithm
		Mixtures of Bernoulli Distributions
	7.4 t-Distributed Stochastic Neighbor Embedding
	7.5 Methods for Image Recognition
8 Data Centers and Clouds
	8.1 Uncapacitated Facility Location
		Assignment
		Pruning
	8.2 A Primal-Dual Algorithm
		Assignment Phase
		Pruning Phase
		Conflict Resolution Phase
	8.3 Capacitated Facility Location
	8.4 Resilient Facility Location
	8.5 One-Dimensional Binpacking
	8.6 Multi-Dimensional Resource Allocation
		Cloud Resources and Descriptors
		Optimization Criteria
			Attractiveness
			Cost
		Algorithm for Resource Optimization
	8.7 An Example
		CloudSim Implementations
	8.8 Optimal Job Scheduling
		Rounding
		The Scheduler
9 Access Networks
	9.1 Capacitated Minimum Spanning Trees
		Esau-Williams Algorithm
			Initial feasible solutions
			Improvement strategies
	9.2 Mixture of Microwave and Fiber Access Network
	9.3 Resilience in Access Networks
	9.4 Centralized Radio Access Networks
	9.5 Antenna Systems
		Radiation Patterns
		Massive MIMO Antenna Arrays
10 Robust Backbone Design
	10.1 Network Resilience
	10.2 Connectivity and Cuts
		Minimum Cuts
	10.3 Spanning Trees
		The Kirchhoff Matrix Tree Theorem
		Graph Strength
		The Reliability Polynomial
		Bounds
		A Randomized Algorithm
	10.4 Minimum-Cost Survivable Network
		Testing Feasibility
		Generating an Initial Solution
		The Search Neighborhood
		Algorithm Summary
	10.5 A Primal-Dual Algorithm
11 Traffic Engineering
	11.1 Resilient Routing
		The K-Shortest Path
		Static and Dynamic Routes
	11.2 Multiprotocol Label Switching (MPLS)
		Route Assignment and Capacity Allocation
		Problem Formulation
		An Approximation Algorithm
			Selecting commodity to reroute
			Computing fraction to reroute
			Stopping conditions
	11.3 Wavelength Assignment
		Graph Coloring
		The Douglas-Rachford Algorithm
		The Bron-Kerbosch Algorithm
	11.4 Preplanned Cycle Protection
		Finding Cycles in Graphs
		p-Cycle Design
		The Straddling Span Approach
		Node Failures
12 Methods of Big Data Analytics
	12.1 Discretization
		The Discretization Problem
	12.2 Data Sketches
		Data Stream Models
		Hash Functions
		Approximate Counting
		Counting Distinct Elements
		Estimation of Vector Norms
		The AMS Algorithm
		The Johnson-Lindenstrauss Algorithm
		The Median Algorithm
		The Count-Min Sketch
		The Count-Median Sketch
		Heavy Hitters
	12.3 Sample Entropy Estimation
	12.4 Flow Size Distribution
		Multi-Resolution Estimation
		The Bitmap Algorithm
13 Dynamic Resource Management
	13.1 Network Traffic
		Characterization of Traffic
		Entropy
	13.2 Traffic Aggregation
	13.3 Congestion Control
		Congestion Control by Traffic Aggregation
		Congestion Control by Optimal Routing
		Simulation of Congestion Control
		Network Topology
		Node Capabilities
		Traffic Distribution
		Traffic Simulation
			Simulation of Poisson processes
			Simulation of Markovian additive processes
			Simulation of fractional Brownian motion
		Traffic Aggregation
		Routing Strategy
		Quality-of-Service Evaluation
	13.4 The Effect of Traffic Aggregation
		Node Level Traffic Aggregation
		Service Type Traffic Aggregation
		Dynamic Traffic Aggregation
			Relative difference between dynamic and RT/NRT aggregation
	13.5 The Effect of Optimal Routing
		Traffic Aggregation Under Minimum Total Delay Routing
		Dynamic Traffic Aggregation Under Shortest-Path Routing
		Traffic Aggregation Under Minimum Maximum-Delay Routing
14 The Internet of Things
	14.1 Architecture
		Routing Protocols
		Routing Protocols for the Internet of Things
			6LoWPAN
			Zigbee
			RPL
			LEACH
	14.2 Wireless Sensor Networks
		Energy Models
		Simulation Results
	14.3 Mobility Modeling Techniques
		Geometric Models
		Queueing Models
		Traffic Flow Theory
		Other Model Types
	14.4 Gibbsian Interaction Mobility Model
		Analysis of Dependence
		Fitting a Distribution
		Basic Assumptions
			Independence
			Stationarity
			Ergodicity
			Indistinguishability
		Dependence Structure
		Simulation of Source Density
		Gibbs Sampler Implementation
		Simulation Results
		Mathematical Analysis of the Mobility Model
		Analysis-Numerical Solution to the One-Dimensional Mobility Model
		Stochastic Fields
		Estimation for the One-Dimensional Mobility Model
		Concluding Remarks
Bibliography
Index
Back Cover