Linked e-resources
Details
Table of Contents
Intro; Preface; Contents; Acronyms; 1 Introduction; 1.1 Organization; 1.2 Current Trends in End-to-End QoS; 1.2.1 QoS in Wired Networks; 1.2.2 QoS in Wireless Networks; 1.3 QoS in M2M Networks; 1.4 Problem Statement; 1.5 Contributions; 2 Background Information; 2.1 Delay Characterization Using Queuing Theory; 2.1.1 G/G/1 Priority Queuing System; 2.1.2 G/M/1 Priority Queuing System; 2.1.3 M/G/1 Priority Queuing System; 2.1.3.1 Special Case: M/D/1 Priority Queue; 2.1.3.2 Special Case: M/M/1 Priority Queue; 2.2 Packet Schedulers; 2.2.1 FCFS Scheduling.
2.2.2 Non-preemptive Resume Priority Scheduling2.2.3 Preemptive Priority Scheduling; 2.3 Fairness of Resource Allocation; 2.3.1 Max-Min Fairness; 2.3.2 Proportional Fairness; 2.4 Convex Optimization: Lagrange Duality; 3 Delay-Efficient Multiclass Packet Scheduler; 3.1 Introduction; 3.2 Contributions; 3.3 M2M Uplink System Model; 3.4 Problem Formulation; 3.4.1 Application Utility Function; 3.4.1.1 ED Utility; 3.4.1.2 PU Utility; 3.4.2 Proportionally Fair System Utility Metric; 3.4.3 Optimization Problem; 3.5 Proposed Scheduler; 3.5.1 Service Order Between PU and ED Classes.
3.5.2 Service Order Among PU Classes3.5.3 Service Order Among ED Classes; 3.5.4 Service Order Among Packets of a Given PU/ED Class; 3.5.5 Optimization Search Space; 3.6 Simulation Results; 3.6.1 Toy Case 1: One PU and One ED Class; 3.6.1.1 Impact of PU Latency Threshold lt and ED Utility Parameter, b; 3.6.1.2 Impact of ED Utility Parameter, a; 3.6.1.3 Impact of ED Arrival Rate; 3.6.2 Toy Case 2: Two PU and Two ED Classes; 3.6.2.1 Impact of QoS Heterogeneity of M2M Uplink; 3.6.2.2 Impact of Choice of ED Threshold; 3.6.2.3 Impact of Penalizing PU Failures; 3.7 Chapter Summary; 3.8 MATLAB Code.
3.8.1 Utility Functions3.8.2 Packet Schedulers: One PU and One ED Class; 3.8.2.1 FCFS Policy; 3.8.2.2 EDD Policy; 3.8.2.3 Preemptive Priority Policy; 3.8.2.4 Proposed Packet Scheduler Without PU Packet Drops; 3.8.2.5 Proposed Packet Scheduler with PU Packet Drops; 3.8.3 Impact of ED Utility Parameter, a: One PU and One ED Class; 3.8.4 Impact of ED Utility Parameter, b: One PU and One ED Class; 3.8.5 Impact of ED Arrival Rate: One PU and OneED Class; 3.8.6 Packet Schedulers: Two PU and Two ED Classes; 3.8.6.1 FCFS Policy: Two PU and Two ED Classes; 3.8.6.2 EDD Policy: Two PU and Two ED Classes.
3.8.6.3 Preemptive Priority Policy: Two PU and Two ED Classes3.8.6.4 Proposed Packet Scheduler Without PU Packet Drops: Two PU and Two ED Classes; 3.8.6.5 Proposed Packet Scheduler with PU Packet Drops: Two PU and Two ED Classes; 3.8.7 Impact of QoS Heterogeneity and Penalizing PU Failures on Performance of Schedulers; 4 Delay-Optimal Multiclass Packet Scheduler; 4.1 Introduction; 4.2 Contributions; 4.3 System Model; 4.4 Problem Formulation; 4.4.1 Class-Wise Service Utility Function; 4.4.2 Proportionally Fair System Utility Metric; 4.4.3 Direct Optimization.
2.2.2 Non-preemptive Resume Priority Scheduling2.2.3 Preemptive Priority Scheduling; 2.3 Fairness of Resource Allocation; 2.3.1 Max-Min Fairness; 2.3.2 Proportional Fairness; 2.4 Convex Optimization: Lagrange Duality; 3 Delay-Efficient Multiclass Packet Scheduler; 3.1 Introduction; 3.2 Contributions; 3.3 M2M Uplink System Model; 3.4 Problem Formulation; 3.4.1 Application Utility Function; 3.4.1.1 ED Utility; 3.4.1.2 PU Utility; 3.4.2 Proportionally Fair System Utility Metric; 3.4.3 Optimization Problem; 3.5 Proposed Scheduler; 3.5.1 Service Order Between PU and ED Classes.
3.5.2 Service Order Among PU Classes3.5.3 Service Order Among ED Classes; 3.5.4 Service Order Among Packets of a Given PU/ED Class; 3.5.5 Optimization Search Space; 3.6 Simulation Results; 3.6.1 Toy Case 1: One PU and One ED Class; 3.6.1.1 Impact of PU Latency Threshold lt and ED Utility Parameter, b; 3.6.1.2 Impact of ED Utility Parameter, a; 3.6.1.3 Impact of ED Arrival Rate; 3.6.2 Toy Case 2: Two PU and Two ED Classes; 3.6.2.1 Impact of QoS Heterogeneity of M2M Uplink; 3.6.2.2 Impact of Choice of ED Threshold; 3.6.2.3 Impact of Penalizing PU Failures; 3.7 Chapter Summary; 3.8 MATLAB Code.
3.8.1 Utility Functions3.8.2 Packet Schedulers: One PU and One ED Class; 3.8.2.1 FCFS Policy; 3.8.2.2 EDD Policy; 3.8.2.3 Preemptive Priority Policy; 3.8.2.4 Proposed Packet Scheduler Without PU Packet Drops; 3.8.2.5 Proposed Packet Scheduler with PU Packet Drops; 3.8.3 Impact of ED Utility Parameter, a: One PU and One ED Class; 3.8.4 Impact of ED Utility Parameter, b: One PU and One ED Class; 3.8.5 Impact of ED Arrival Rate: One PU and OneED Class; 3.8.6 Packet Schedulers: Two PU and Two ED Classes; 3.8.6.1 FCFS Policy: Two PU and Two ED Classes; 3.8.6.2 EDD Policy: Two PU and Two ED Classes.
3.8.6.3 Preemptive Priority Policy: Two PU and Two ED Classes3.8.6.4 Proposed Packet Scheduler Without PU Packet Drops: Two PU and Two ED Classes; 3.8.6.5 Proposed Packet Scheduler with PU Packet Drops: Two PU and Two ED Classes; 3.8.7 Impact of QoS Heterogeneity and Penalizing PU Failures on Performance of Schedulers; 4 Delay-Optimal Multiclass Packet Scheduler; 4.1 Introduction; 4.2 Contributions; 4.3 System Model; 4.4 Problem Formulation; 4.4.1 Class-Wise Service Utility Function; 4.4.2 Proportionally Fair System Utility Metric; 4.4.3 Direct Optimization.