Name
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. |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1109/90.588083 | INFOCOM '96. Fifteenth Annual Joint Conference of the IEEE Computer Societies. Networking the Next Generation. Proceedings IEEE |
Keywords | DocType | Volume |
Scheduling algorithm,Network servers,Intserv networks,Delay effects,USA Councils,Performance gain,Throughput,Communication channels,Admission control,Computer science | Journal | 5 |
Issue | ISSN | ISBN |
2 | 0743-166X | 0-8186-7292-7 |
Citations | PageRank | References |
12 | 0.86 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Simon S. Lam | 1 | 3516 | 1370.30 |
| Geoffrey G. Xie | 2 | 793 | 97.20 |