DEAR: Delay-Guaranteed Energy Profile-Aware Routing Toward the Green Internet

Cited 1 time in webofscience Cited 0 time in scopus
  • Hit : 441
  • Download : 0
The existing energy-efficient routing algorithms have limitations when considering energy profiles and delay guarantees. In order to overcome these limitations, a delay-guaranteed energy profile-aware routing (DEAR) algorithm is proposed for a green Internet. In order to achieve this, a delay-guaranteed least energy path problem is defined, and then, the DEAR algorithm that can heuristically determine the delay-guaranteed least energy path for a flow using the well-known ant colony optimization technique is proposed. The simulation results demonstrate that the energy efficiency of the DEAR algorithm is approximately two times higher than that of the GreenOSPF, whereas the DEAR guarantees delay requirements of the flows, although the network elements have various energy profiles.
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Issue Date
2014-11
Language
English
Article Type
Article
Keywords

OPTIMIZATION; NETWORKS

Citation

IEEE COMMUNICATIONS LETTERS, v.18, no.11, pp.1943 - 1946

ISSN
1089-7798
DOI
10.1109/LCOMM.2014.2359437
URI
http://hdl.handle.net/10203/193903
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 1 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0