Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

DOI10.1016/J.COMNET.2004.11.022zbMATH Open1075.68561OpenAlexW1988121136MaRDI QIDQ2485598FDOQ2485598

Authors: Yanyan Li 

Publication date: 5 August 2005

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2004.11.022

Recommendations

• Closed-form deterministic end-to-end performance bounds for the generalized processor sharing scheduling discipline
• A heuristic flow-decomposition approach for generalized processor sharing under self-similar traffic
• Generalized processor sharing queues with heterogeneous traffic classes
• A Network-Flow-Based Scheduler: Design, Performance History, and Experimental Analysis
• Heavy-traffic analysis of a multiple-phase network with discriminatory processor sharing
• Publication:4486410

zbMATH Keywords

Generalized processor sharingArbitrary weightingEnd-to-end delay boundTraffic characterization

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (4)

• mBm-based scalings of traffic propagated in internet
• Title not available (Why is that?)
• Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
• A generalized delay allocation model for rate-based packet scheduling algorithms

This page was built for publication: Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485598)