A new scheduling scheme for high-speed packet networks: Earliest-virtual-deadline-first

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 397
  • Download : 3
A new scheduling scheme, called earliest- virtual-deadline-first (EVDF), is proposed to improve resource utilization in a high-speed packet network. The proposed EVDF scheduling is a generalized form of the earliest-deadline-first (EDF) scheduling [D. Ferrari, D. Verma, A scheme for real-time channel establishment in wide-area networks, IEEE J. Select Areas Commun. 8 (3) (1990) 368-379], using the concept of virtual delay bounds and it gives us the flexibility of controlling the delay violation probabilities of traffic flows. As a result, the EVDF scheduler can provide the flows with the quality-of-service (QoS) guarantees that cannot be supported by the EDF scheduler. The performance of the EVDF scheduler is very sensitive to the choice of virtual delay bounds. An iterative algorithm is developed to obtain the virtual delay bounds that achieve ideal service fairness while satisfying the QoS requirements of the flows. Numerical results show that the EVDF scheduler can utilize network resources more efficiently than the EDF scheduler. (c) 2007 Elsevier B.V. All rights reserved.
Publisher
ELSEVIER SCIENCE BV
Issue Date
2007-07
Language
English
Article Type
Article
Keywords

DELAY SERVICE; DIFFERENTIATION; ALGORITHMS; COMPLEXITY

Citation

COMPUTER COMMUNICATIONS, v.30, no.10, pp.2291 - 2300

ISSN
0140-3664
DOI
10.1016/j.comcom.2007.06.003
URI
http://hdl.handle.net/10203/5447
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0