Energy Efficient Time-Aware Traffic Grooming in Wavelength Routing Networks

In this paper, we investigate both static and dynamic traffic grooming problems in a wavelength routing network, so as to minimize the total energy consumption of the core network, with the additional consideration of the holding times of the lightpaths and connection requests. In static case, all c...

Full description

Saved in:
Bibliographic Details
Published in2010 IEEE Global Telecommunications Conference GLOBECOM 2010 pp. 1 - 5
Main Authors Shuqiang Zhang, Dong Shen, Chun-Kit Chan
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2010
Subjects
Online AccessGet full text
ISBN1424456363
9781424456369
ISSN1930-529X
DOI10.1109/GLOCOM.2010.5683340

Cover

Loading…
Abstract In this paper, we investigate both static and dynamic traffic grooming problems in a wavelength routing network, so as to minimize the total energy consumption of the core network, with the additional consideration of the holding times of the lightpaths and connection requests. In static case, all connection requests with their setup and tear-down times are known in advance, we formulate an Integer Linear Programming (ILP) to minimize the energy consumption. In dynamic case, we adopt a layered graph model called Grooming Graph and propose a new traffic grooming heuristics called Time-Aware Traffic Grooming (TATG) which takes the holding time of a new arrival connection request and the remaining holding time of existing lightpaths into consideration. We compare the energy efficiency of different traffic grooming policies under various traffic loads, and the results provide implications to choose the most energy-efficient traffic grooming policies under various scenarios.
AbstractList In this paper, we investigate both static and dynamic traffic grooming problems in a wavelength routing network, so as to minimize the total energy consumption of the core network, with the additional consideration of the holding times of the lightpaths and connection requests. In static case, all connection requests with their setup and tear-down times are known in advance, we formulate an Integer Linear Programming (ILP) to minimize the energy consumption. In dynamic case, we adopt a layered graph model called Grooming Graph and propose a new traffic grooming heuristics called Time-Aware Traffic Grooming (TATG) which takes the holding time of a new arrival connection request and the remaining holding time of existing lightpaths into consideration. We compare the energy efficiency of different traffic grooming policies under various traffic loads, and the results provide implications to choose the most energy-efficient traffic grooming policies under various scenarios.
Author Dong Shen
Shuqiang Zhang
Chun-Kit Chan
Author_xml – sequence: 1
  surname: Shuqiang Zhang
  fullname: Shuqiang Zhang
  email: sqzhang@ie.cuhk.edu.hk
  organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
– sequence: 2
  surname: Dong Shen
  fullname: Dong Shen
  email: sd009@ie.cuhk.edu.hk
  organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
– sequence: 3
  surname: Chun-Kit Chan
  fullname: Chun-Kit Chan
  email: ckchan@ie.cuhk.edu.hk
  organization: Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Hong Kong, China
BookMark eNpFkMtOAjEYRmvERAZ9AjZ9gcHeL0tCEI3oJAajO9IOf7EKHdMZJby9EElcfTlncRZfgXqpSYDQkJIRpcTezObVpHocMXIQUhnOBTlDBRVMCKm4puf_oHgP9anlpJTMvl2iom0_CJHCSNpHD9MEeb3H0xBiHSF1eBG3UI53LgNeZHfUeJabZhvTGseEX90PbCCtu3f83Hx3R_sE3a7Jn-0Vughu08L1aQfo5Xa6mNyV82p2PxnPy0i17ErtzSHLQlBSeb5SyntrjHLGKeBBk7q2AiwLK89AWqu19zSsiGaMGCm94AM0_OtGAFh-5bh1eb88vcB_ARlBUbQ
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/GLOCOM.2010.5683340
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1424456371
9781424456383
9781424456376
142445638X
EndPage 5
ExternalDocumentID 5683340
Genre orig-research
GroupedDBID 29I
6IE
6IH
6IK
6IM
AAJGR
ACGFS
ALMA_UNASSIGNED_HOLDINGS
CBEJK
IPLJI
M43
RIE
RIO
RNS
ID FETCH-LOGICAL-i175t-7b8aff2ff656b3d66bb9886a8a6e3f70cc94e92fdb2e59977bb1fd07220855b43
IEDL.DBID RIE
ISBN 1424456363
9781424456369
ISSN 1930-529X
IngestDate Wed Aug 27 02:53:10 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-7b8aff2ff656b3d66bb9886a8a6e3f70cc94e92fdb2e59977bb1fd07220855b43
PageCount 5
ParticipantIDs ieee_primary_5683340
PublicationCentury 2000
PublicationDate 2010-Dec.
PublicationDateYYYYMMDD 2010-12-01
PublicationDate_xml – month: 12
  year: 2010
  text: 2010-Dec.
PublicationDecade 2010
PublicationTitle 2010 IEEE Global Telecommunications Conference GLOBECOM 2010
PublicationTitleAbbrev GLOCOM
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0054851
ssj0000507002
Score 1.5308578
Snippet In this paper, we investigate both static and dynamic traffic grooming problems in a wavelength routing network, so as to minimize the total energy consumption...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Energy consumption
Equations
Optical fiber networks
Peer to peer computing
Power demand
Telecommunication traffic
WDM networks
Title Energy Efficient Time-Aware Traffic Grooming in Wavelength Routing Networks
URI https://ieeexplore.ieee.org/document/5683340
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwELVKT3BhaRG7fOBIWtd2nPiIqi4C2nKgorfKdmyokFJUUiHx9YyTNCziwC0ZJU5iRZo39ntvELpMpKKWGKhNpAoDzpUOFE9EQJnTMcAHQ40XCo_GYjjlN7NwVkNXlRbGWpuTz2zLH-Z7-cnSrP1SWTsUMWMcCvQtKNwKrVa1nkIA2BBSWUcBEM9bLwI-IVBsydlG1BUKJtjG66k8l6UdUYfI9uBu0p2MCs5X-bwfjVfyvNPfRaPNGxd0k5fWOtMt8_HLzPG_n7SHml8KP3xf5a59VLPpAdr5Zk7YQLe9XBaIe7nJBIyCvVwkuH5XK4shxfkwHnjgDZfjRYoflW9ikT5lz9jzjHx0XJDM35po2u89dIdB2XohWACeyIJIxzAMdQ7gnmaJEFrLOBYqVsIyFxFjJLeSukRTG0rAkFp3XEIi6lt-hpqzQ1RPl6k9QtgCClAy6oSJU1xoAfjAxY5LZuBubuwxavhpmb8W7hrzckZO_g6fom1aEUrOUD1bre05wIJMX-T_wyfD1rC0
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3JTsMwELWqcgAuLC1ixweOpE1jx4mPqOoCbVoOreitsh0bKqQUlVRIfD3jJA2LOHBLRomTWJHmjf3eG4SuYy487SqoTbjwHUqFdASNmeMRI0OAD8pTVigcjVh_Su9n_qyCbkotjNY6I5_phj3M9vLjpVrbpbKmz0JCKBToW5D3Kc_VWuWKigvQxnVL8yiA4lnzRUAoLpRbfLaRdfmMMLJxeyrOeWFI1HJ5szcct8dRzvoqnvij9UqWebp7KNq8c044eWmsU9lQH7_sHP_7Ufuo_qXxww9l9jpAFZ0cot1v9oQ1NOhkwkDcyWwmYBRsBSPO7btYaQxJzoZxz0JvuBwvEvwobBuL5Cl9xpZpZKOjnGb-VkfTbmfS7jtF8wVnAYgidQIZwjCeMQD4JIkZk5KHIROhYJqYwFWKU809E0tP-xxQpJQtE7uBZ5t--pKSI1RNlok-RlgDDhA8aPmxEZRJBgjBhIZyouBuqvQJqtlpmb_m_hrzYkZO_w5foe3-JBrOh3ejwRna8Up6yTmqpqu1vgCQkMrL7N_4BEIYtAQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2010+IEEE+Global+Telecommunications+Conference+GLOBECOM+2010&rft.atitle=Energy+Efficient+Time-Aware+Traffic+Grooming+in+Wavelength+Routing+Networks&rft.au=Shuqiang+Zhang&rft.au=Dong+Shen&rft.au=Chun-Kit+Chan&rft.date=2010-12-01&rft.pub=IEEE&rft.isbn=9781424456369&rft.issn=1930-529X&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FGLOCOM.2010.5683340&rft.externalDocID=5683340
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1930-529X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1930-529X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1930-529X&client=summon