Dynamic routing and spectrum allocation to minimize fragmentation in elastic optical networks

The exponential growth in Internet traffic requires a high-capacity transmission platform and emphasizes the importance of a multi-granularity transport network due to heterogeneous connection requests. Elastic Optical Network has been considered as a promising solution because of large transport ca...

Full description

Saved in:
Bibliographic Details
Published in2017 20th Conference of Open Innovations Association (FRUCT) Vol. 776; no. 20; pp. 512 - 518
Main Authors Yadi Xu, Young-Chon Kim
Format Conference Proceeding Journal Article
LanguageEnglish
Published FRUCT 01.04.2017
Subjects
Online AccessGet full text

Cover

Loading…
Abstract The exponential growth in Internet traffic requires a high-capacity transmission platform and emphasizes the importance of a multi-granularity transport network due to heterogeneous connection requests. Elastic Optical Network has been considered as a promising solution because of large transport capacity and bandwidth flexibility. Routing and spectrum allocation is one of important problems in EON. However, with spectrum continuity constraint and contiguity constraint, the set-up and tear-down of light paths may cause fragmentation problem which refers to small-sized and uncontiguous spectrums. The fragmentation increases the connection blocking probability and decrease spectrum utilization. In this paper a novel routing and spectrum allocation algorithm is proposed to minimize fragmentation in EON. The proposed algorithm consists of routing problem and the spectrum allocation problem. In the first step, K-shortest paths algorithm is employed and candidate paths are found according to the distance between source and destination. In the second step, fragmentation-aware spectrum allocation algorithm is applied. We define block cost function to determine appropriate spectral block for connection request. The block cost function is based on the state of neighboring frequency slots to minimize the fragmentation after spectrum allocation. The performance of proposed algorithm is evaluated in terms of blocking probability and spectrum utilization.
AbstractList The exponential growth in Internet traffic requires a high-capacity transmission platform and emphasizes the importance of a multi-granularity transport network due to heterogeneous connection requests. Elastic Optical Network has been considered as a promising solution because of large transport capacity and bandwidth flexibility. Routing and spectrum allocation is one of important problems in EON. However, with spectrum continuity constraint and contiguity constraint, the set-up and tear-down of light paths may cause fragmentation problem which refers to small-sized and uncontiguous spectrums. The fragmentation increases the connection blocking probability and decrease spectrum utilization. In this paper a novel routing and spectrum allocation algorithm is proposed to minimize fragmentation in EON. The proposed algorithm consists of routing problem and the spectrum allocation problem. In the first step, K-shortest paths algorithm is employed and candidate paths are found according to the distance between source and destination. In the second step, fragmentation-aware spectrum allocation algorithm is applied. We define block cost function to determine appropriate spectral block for connection request. The block cost function is based on the state of neighboring frequency slots to minimize the fragmentation after spectrum allocation. The performance of proposed algorithm is evaluated in terms of blocking probability and spectrum utilization.
Author Yadi Xu
Young-Chon Kim
Author_xml – sequence: 1
  surname: Yadi Xu
  fullname: Yadi Xu
  email: yadixueng@gmail.com
  organization: Chonbuk Nat. Univ., Jeonju, South Korea
– sequence: 2
  surname: Young-Chon Kim
  fullname: Young-Chon Kim
  email: yckim@jbnu.ac.kr
  organization: Chonbuk Nat. Univ., Jeonju, South Korea
BookMark eNpN0FFLwzAQB_AoE9zmPsFe8gU2k8uSNI8ynQ4GgmyPUtL2MjLbZKQVmZ_e4ob4cv_jDn4cNyKDEAMSMuVsDsJwc7962y23c2BczzOmuZDqioyMBJUpKbi6JkMQTM40yMXgX39LJm17YIxBJpUxekjeH0_BNr6kKX52PuypDRVtj1h26bOhtq5jaTsfA-0ibXzwjf9G6pLdNxi688YHirVtux6Jx77amgbsvmL6aO_IjbN1i5NLjslu9bRdvsw2r8_r5cNmVsGCdzPACjlTTjLJgWNhM5dVfShg6CRgaSxXAhwyxTPHZCWEY8JopqEA1EqMyfrsVtEe8mPyjU2nPFqf_w5i2uc29afVmAOUBdOmkiDkgqMrpFOGa-lEKVGqoremZ8sj4p91-bL4Af8NchM
ContentType Conference Proceeding
Journal Article
DBID 6IE
6IL
CBEJK
RIE
RIL
DOA
DOI 10.23919/FRUCT.2017.8071356
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library Online
IEEE Proceedings Order Plans (POP All) 1998-Present
DOAJ Directory of Open Access Journals
DatabaseTitleList

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: RIE
  name: IEEE Electronic Library Online
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9526865316
9789526865300
9789526865317
9526865308
EISSN 2305-7254
2343-0737
EndPage 518
ExternalDocumentID oai_doaj_org_article_22cb079d523541efb5f69175f3c5e56b
8071356
Genre orig-research
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
ABLEC
ADBBV
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
GROUPED_DOAJ
IEGSK
IPLJI
IPNFZ
OCL
RIE
RIG
RIL
ID FETCH-LOGICAL-d241t-2ede106f505121eba8f8deba620ef52ec9a1632fe0618f05d33f0397072b2e763
IEDL.DBID DOA
ISSN 2305-7254
IngestDate Tue Oct 22 15:16:26 EDT 2024
Wed Jun 26 19:27:31 EDT 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 20
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-d241t-2ede106f505121eba8f8deba620ef52ec9a1632fe0618f05d33f0397072b2e763
OpenAccessLink https://doaj.org/article/22cb079d523541efb5f69175f3c5e56b
PageCount 7
ParticipantIDs doaj_primary_oai_doaj_org_article_22cb079d523541efb5f69175f3c5e56b
ieee_primary_8071356
PublicationCentury 2000
PublicationDate 2017-April
PublicationDateYYYYMMDD 2017-04-01
PublicationDate_xml – month: 04
  year: 2017
  text: 2017-April
PublicationDecade 2010
PublicationTitle 2017 20th Conference of Open Innovations Association (FRUCT)
PublicationTitleAbbrev FRUCT
PublicationYear 2017
Publisher FRUCT
Publisher_xml – name: FRUCT
SSID ssj0002856997
ssib030420611
Score 2.1210837
Snippet The exponential growth in Internet traffic requires a high-capacity transmission platform and emphasizes the importance of a multi-granularity transport...
SourceID doaj
ieee
SourceType Open Website
Publisher
StartPage 512
SubjectTerms Bandwidth
Elastic Optical Network
Fragmentation
Frequency selective surfaces
Heuristic algorithms
Modulation
Optical fiber networks
Resource management
Routing
Routing and Spectrum Allocation Algorithm
Wavelength Division Multiplexing
SummonAdditionalLinks – databaseName: IEEE Electronic Library Online
  dbid: RIE
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3NS8MwFA_bTp5UNnF-kYNH27Vp0zZXp2MIisgGu0hpmhcZsnbM9rK_3pe0VhQPnlpCU8LLx_vI7_0eIde-FIkfZbi_OZdOyEXuJFwasD8z0CbwA21Rvk_RfBk-rPiqR266XBgAsOAzcM2rvctXZV6bUNkksQXloj7px0I0uVpdPIUlPBIiboiFWCB8MZm9LKcLg96K3bZnS8z_o5KKVSSzQ_L4NYQGP_Lu1pV08_0vdsb_jvGIjL5T9uhzp4yOSQ-KIXm9a-rN011ZG3gzzQpFbW7lrt5Qc-XeBOxoVVLDMbJZ74HqXfa2aTOSCrouKKCBjcuLllsb96ZFgxz_GJHl7H4xnTttPQVHoZ6uHAYK0APUaPT4zAeZJTpR-IiYB5ozyEWG1hnTgDo-0R5XQaA9tFe8mEkGeBCdkEFRFnBKaIZHgQ5FpONchiCkUDF-nkkfdBgqT4_JrRF0um0oM1JDYm0bUFZpuydSxnLpxUKhL8xD7Cm5jtB75DrIOfBIjsnQyLf7SSvas7-bz8mBmeoGVXNBBihJuESDoZJXdqV8Ao_lwgI
  priority: 102
  providerName: IEEE
Title Dynamic routing and spectrum allocation to minimize fragmentation in elastic optical networks
URI https://ieeexplore.ieee.org/document/8071356
https://doaj.org/article/22cb079d523541efb5f69175f3c5e56b
Volume 776
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV09T8MwELVQJxYEKojyUXlgDY0dO7FHKFQVAwNqpS4oiuMz6tCkKu3Cr-dsh6pMLEyRosiy3vnjnfN8j5A7ZrRieYXzW0qTCKnrREnjxf7cS5uAZS6ofF_z6Vy8LOTiwOrLa8JieeAI3Ijz2qSFtpgwScHAGelyTDGky2oJMjdh9U31QTKFI8nn6LhRsf1pC1cy18FpBSm392-VIpYg4plmejR5m49nXudV3KtgWvdTwv-X50rYcian5KTjivQh9vGMHEHTJ-9P0UOebtqdlyzTqrE03Jfc7FbU_0aPh3B021JfN2S1_ALqNtXHqrtl1NBlQwFJM7ZK23U4y6ZNVIN_npP55Hk2niadR0Jice_dJhwsYFbnkMgwzsBUyimLj5yn4CSHWlfIuLgDhEO5VNoscylykLTghgMuLhek17QNXBJa4fR2QueuqI0AbbQt8PPKIOhC2NQNyKOHpFzHMhilL0wdXmC4yi5c5V_hGpC-B3TfSAf31X-0fU2OfQijruaG9BB3uEXKsDXDMDqG4XbfN5ZsvEk
link.rule.ids 310,311,315,783,787,792,793,799,867,2109,23942,23943,25152,27936,27937,55086
linkProvider Directory of Open Access Journals
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELYKDDABahFvPDCSkDixE68UqgIFIdRKXVAUx2eEUBNU2oVfz9kJQSAGpkRWHFnnxz383XeEnIZKpqHIcX9zrryYy8JLubJgf2ahTRBGxqF878VwEt9M-bRDztpcGABw4DPw7au7y9dVsbShsvPUFZQTK2QN7epU1NlabUSFpVxImdTUQiySoTwfPE76Y4vfSvymb0PN_6OWilMlg01y9zWIGkHy6i8Xyi8-fvEz_neUW6T3nbRHH1p1tE06UHbJ02VdcZ7Oq6UFONO81NRlV86XM2ov3euQHV1U1LKMzF4-gJp5_jxrcpJK-lJSQBMbFxit3lzkm5Y1dvy9RyaDq3F_6DUVFTyNmnrhMdCAPqBBsydkIag8NanGh2ABGM6gkDnaZ8wAavnUBFxHkQnQYgkSphjgUbRDVsuqhF1CczwMTCyFSQoVg1RSJ_h5rkIwcawDs0curKCzt5o0I7M01q4BZZU1uyJjrFBBIjV6wzzGnoobgf4jN1HBgQu1R7pWvu1PGtHu_918QtaH47tRNrq-vz0gG3baa4zNIVlFqcIRmg8LdexWzSfa6MVN
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%3Ajournal&rft.genre=proceeding&rft.title=2017+20th+Conference+of+Open+Innovations+Association+%28FRUCT%29&rft.atitle=Dynamic+routing+and+spectrum+allocation+to+minimize+fragmentation+in+elastic+optical+networks&rft.au=Yadi+Xu&rft.au=Young-Chon+Kim&rft.date=2017-04-01&rft.pub=FRUCT&rft.eissn=2305-7254&rft.spage=512&rft.epage=518&rft_id=info:doi/10.23919%2FFRUCT.2017.8071356&rft.externalDocID=8071356
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2305-7254&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2305-7254&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2305-7254&client=summon