Statistical Analysis of Link Scheduling on Long Paths

2011/01/06 by Yashar Ghiassi-Farrokhfal, Ghiassi-Farrokhfal, Yashar, Jörg Liebeherr +3
Computer Science · Engineering · #Advanced Wireless Network Optimization #FOS: Computer and information sciences #Interconnection Networks and Systems #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI) #Performance (cs.PF)

paper · pdf · doi:10.48550/arxiv.1101.1237

openalex publication_date 2011/01/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We study how the choice of packet scheduling algorithms influences end-to-end performance on long network paths. Taking a network calculus approach, we consider both deterministic and statistical performance metrics. A key enabling contribution for our analysis is a significantly sharpened method for computing a statistical bound for the service given to a flow by the network as a whole. For a suitably parsimonious traffic model we develop closed-form expressions for end-to-end delays, backlog, and output burstiness. The deterministic versions of our bounds yield optimal bounds on end-to-end backlog and output burstiness for some schedulers, and are highly accurate for end-to-end delay bounds.

Related

• Probabilistic Performance Analysis of Networks using an Improved Network Service Envelope Approach
• A Simple Proof of Linear Scaling of End-to-End Probabilistic Bounds using Network Calculus
• Network Calculus Bounds for Time-Sensitive Networks: A Revisit
• Design of a Stochastic Traffic Regulator for End-to-End Network Delay Guarantees
• Link Capacity Distributions and Optimal Capacities for Competent Network Performance