Queueing Theory Tutorial MIT排队论教程麻省理工学院.pptVIP

Networking Tutorials Objectives Provide some basic understanding of queuing phenomena Explain the available solution approaches and associated trade-offs Give guidelines on how to match applications and solutions Outline Basic concepts Source models Service models (demo) Single-queue systems Priority/shared service systems Networks of queues Hybrid simulation (demo) Outline Basic concepts Performance measures Solution methodologies Queuing system concepts Stability and steady-state Causes of delay and bottlenecks Source models Service models (demo) Single-queue systems Priority/shared service systems Networks of queues Hybrid simulation (demo) Performance Measures Delay Delay variation (jitter) Packet loss Efficient sharing of bandwidth Relative importance depends on traffic type (audio/video, file transfer, interactive) Challenge: Provide adequate performance for (possibly) heterogeneous traffic Solution Methodologies Analytical results (formulas) Pros: Quick answers, insight Cons: Often inaccurate or inapplicable Explicit simulation Pros: Accurate and realistic models, broad applicability Cons: Can be slow Hybrid simulation Intermediate solution approach Combines advantages and disadvantages of analysis and simulation Examples of Applications Queuing System Concepts: Arrival Rate, Occupancy, Time in the System Queuing system Data network where packets arrive, wait in various queues, receive service at various points, and exit after some time Arrival rate Long-term number of arrivals per unit time Occupancy Number of packets in the system (averaged over a long time) Time in the system (delay) Time from packet entry to exit (averaged over many packets) Stability and Steady-State A single queue system is stable if packet arrival rate system transmission capacity For a single queue, the ratio packet arrival rate / system transmission capacity is called the utilization factor Describes the loading of a queue In an unstable system packets accumulate in v