UsefulLinks
Systems Science
Queueing Theory and Scheduling
1. Introduction to Queueing Systems
2. Mathematical Foundations
3. Basic Markovian Queueing Models
4. Advanced Queueing Models
5. Queueing Networks
6. Fundamentals of Scheduling
7. Single Machine Scheduling
8. Parallel Machine Scheduling
9. Flow Shop and Job Shop Scheduling
10. Real-Time Scheduling
11. Network Scheduling
12. Analysis Techniques and Tools
13. Performance Evaluation and Optimization
14. Applications and Case Studies
11.
Network Scheduling
11.1.
Packet Scheduling Fundamentals
11.1.1.
Quality of Service (QoS)
11.1.2.
Traffic Characteristics
11.1.3.
Performance Metrics
11.2.
Basic Scheduling Disciplines
11.2.1.
First-In First-Out (FIFO)
11.2.2.
Priority Queuing
11.2.3.
Round Robin
11.3.
Fair Queuing Algorithms
11.3.1.
Weighted Fair Queuing (WFQ)
11.3.1.1.
Virtual Time Concept
11.3.1.2.
Packet-by-Packet GPS
11.3.1.3.
Implementation Issues
11.3.2.
Worst-case Fair Weighted Fair Queuing (WF²Q)
11.3.3.
Self-Clocked Fair Queuing (SCFQ)
11.4.
Rate-Based Scheduling
11.4.1.
Virtual Clock Algorithm
11.4.2.
Packet-Pair GPS
11.5.
Deficit-Based Scheduling
11.5.1.
Deficit Round Robin (DRR)
11.5.2.
Smoothed Round Robin (SRR)
11.6.
Traffic Shaping and Policing
11.6.1.
Token Bucket Algorithm
11.6.2.
Leaky Bucket Algorithm
11.6.3.
Traffic Contracts
Previous
10. Real-Time Scheduling
Go to top
Next
12. Analysis Techniques and Tools