Group priority scheduling

Authors:
Simon S. Lam;Geoffrey G. Xie
Affiliations:
Department of Computer Sciences, The University of Texas at Austin, Austin, Texas;Department of Computer Sciences, The University of Texas at Austin, Austin, Texas
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Year:
1996

Citing 10
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines

SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
An algorithm for lossless smoothing of MPEG video

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Leave-in-Time: a new service discipline for real-time communications in a packet-switching network

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Delay guarantee of virtual clock server

IEEE/ACM Transactions on Networking (TON)
Determining End-to-End Delay Bounds in Heterogeneous Networks

NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Burst Scheduling: Architecture and Algorithm for Switching VBR Video

Burst Scheduling: Architecture and Algorithm for Switching VBR Video
Group Priority Scheduling

Group Priority Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

For many applications, the end-to-end delay of an application-specific data unit is a more important performance measure than the end-to-end delays of individual packets within a network. From this observation, we propose the idea of group scheduling. Specafically, consecutive packet arrivals in a flow are partitioned into roups, and the same deadline (called group priorityg is assigned to every packet in a group. in this paper, we first present an end-to-end delay guamntee theorem for a network of guamnteed-deadline (GD) servers. The theorem can be instantiated to obtain end-to-end delay bounds for a variety of source control mechanisms and GD servers. We then specialize the delay guarantee theorem to group scheduling for a subclass of GD servers. We work out a detailed example to demonstrate how to use group scheduling in a particular class of networks. The advantages of group scheduling are discussed and illustrated with empirical results from simulation experiments.