Name
Abstract | ||
|---|---|---|
A simplified layered scheduling scheme is presented, which is based on utility-based scheduling, such as Max-Delay-Utility (MDU) scheduling in this paper. In this scheme, the scheduling is divided into two steps- macro and micro scheduling. In macro step, the utility functions of traffics are defined, according to which the scheduling order of various services is determined. Then in micro step, the scheduling is among all users of the traffic type which is determined in macro step. By simulation in a multi-user orthogonal frequency division multiplexing (OFDM) network, it is demonstrated that the simplified layered MDU scheduling can effectively handle multiple traffic types with diverse QoS requirements and achieve almost the same performance from the view of utility, delay, throughput and fairness as MDU does. Moreover, the simplified layered MDU scheduling has much lower computational complexity than the MDU scheduling and almost the same utility values. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/VETECF.2007.388 | 2007 IEEE 66TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5 |
Keywords | Field | DocType |
OFDM, scheduling, Max-Delay-Utility (MDU), low complexity, untility function | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Scheduling (computing),Deadline-monotonic scheduling,Computer network,Two-level scheduling,Rate-monotonic scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference |
Volume | Issue | ISSN |
null | null | 1550-2252 |
Citations | PageRank | References |
2 | 0.42 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zhe Liu | 1 | 14 | 4.42 |
| Zhiqiang He | 2 | 215 | 41.14 |
| weiling wu | 3 | 42 | 9.81 |
| Xinglin Wang | 4 | 13 | 2.83 |