Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
A relocation-based heuristic for restoring optical cloud services
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikationssystem, CoS, Optical Network Laboratory (ON Lab).ORCID-id: 0000-0002-5636-9910
KTH, Skolan för informations- och kommunikationsteknik (ICT), Kommunikationssystem, CoS, Optical Network Laboratory (ON Lab).ORCID-id: 0000-0001-6704-6554
Vise andre og tillknytning
2014 (engelsk)Inngår i: 2014 13th International Conference on Optical Communications and Networks, 2014Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
2014.
Emneord [en]
Blocking probability, Image reconstruction, Integer programming
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-168524DOI: 10.1109/ICOCN.2014.6987081Scopus ID: 2-s2.0-84920862344ISBN: 978-147997218-0 (tryckt)OAI: oai:DiVA.org:kth-168524DiVA, id: diva2:818716
Konferanse
2014 13th International Conference on Optical Communications and Networks, ICOCN 2014; Suzhou; China
Merknad

QC 20150609

Tilgjengelig fra: 2015-06-09 Laget: 2015-06-04 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Monti, PaoloWosinska, Lena

Søk i DiVA

Av forfatter/redaktør
Monti, PaoloWosinska, Lena
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 24 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf