Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A relocation-based heuristic for restoring optical cloud services
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).ORCID iD: 0000-0002-5636-9910
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Optical Network Laboratory (ON Lab).ORCID iD: 0000-0001-6704-6554
Show others and affiliations
2014 (English)In: 2014 13th International Conference on Optical Communications and Networks, 2014Conference paper, Published paper (Refereed)
Abstract [en]

Optical clouds allow for an integrated management of optical transport and cloud resources (e.g., storage and computing resources running on datacenters). In this paradigm the concept of service relocation (i.e., the ability to re-allocate to a different datacenter node an already provisioned cloud service) offers a new way to restore the network upon failure. This paper presents a heuristic (called H-RELOCATION) based on the service relocation concept to be used for the dynamic restoration of optical cloud services. Upon the occurrence of a network failure, H-RELOCATION solves the routing and resource (i.e., transport plus cloud) allocation problem for each disrupted cloud service allowing, if necessary, to relocate some cloud services to different datacenter nodes. The proposed strategy is benchmarked against two optimal restoration strategies based on Integer Linear Programming (ILP) formulations, the first one without and the second one with the ability to use the service relocation idea. Simulation results show that H-RELOCATION offers performance (i.e., blocking probability, restorability levels and number of required relocations) very close to the optimum, offering on the other hand, a significant reduction in the processing time required for each successfully restored cloud service.

Place, publisher, year, edition, pages
2014.
Keywords [en]
Blocking probability, Image reconstruction, Integer programming
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-168524DOI: 10.1109/ICOCN.2014.6987081Scopus ID: 2-s2.0-84920862344ISBN: 978-147997218-0 (print)OAI: oai:DiVA.org:kth-168524DiVA, id: diva2:818716
Conference
2014 13th International Conference on Optical Communications and Networks, ICOCN 2014; Suzhou; China
Note

QC 20150609

Available from: 2015-06-09 Created: 2015-06-04 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Monti, PaoloWosinska, Lena

Search in DiVA

By author/editor
Monti, PaoloWosinska, Lena
By organisation
Optical Network Laboratory (ON Lab)
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf