Mixed scheduling disciplines for network flows

Hanhua Feng · Vishal Misra

47 citations0/0 files storedACM SIGMETRICS Performance Evaluation Review

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Network Traffic and Congestion Control Age of Information Optimization

Abstract

We introduce a novel method to prove that the FBPS discipline has optimal mean sojourn time and mean slowdown ratio for DHR service time distributions in an M/G/1 queue. We then discuss the problems related to FBPS, and propose a new scheduling discipline to overcome these problems.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 47 citations exist upstream.

References

2001Analysis of SRPT scheduling 1989Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures 1990On extremal service disciplines in single-stage queueing systems 1972Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System

Cited by

2004Two-level processor-sharing scheduling disciplines 2018SOAP 2012Minimizing slowdown in heterogeneous size-aware dispatching systems 2006Handling load with less stress 2018SOAP 2006Mean Delay Analysis of Multi Level Processor Sharing Disciplines 2007Scheduling in practice 2012Minimizing slowdown in heterogeneous size-aware dispatching systems

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.