SwePub
Sök i LIBRIS databas

  Extended search

onr:"swepub:oai:research.chalmers.se:88ebf7a9-8d24-4f06-816a-d9d6d1f9d52f"
 

Search: onr:"swepub:oai:research.chalmers.se:88ebf7a9-8d24-4f06-816a-d9d6d1f9d52f" > Content placement i...

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Content placement in 5G‐enabled edge/core datacenter networks resilient to link cut attacks

Natalino Da Silva, Carlos, 1987 (author)
Chalmers tekniska högskola,Chalmers University of Technology
de Sousa, Amaro (author)
Universidade de Aveiro,University of Aveiro
Wosinska, Lena, 1951 (author)
Chalmers tekniska högskola,Chalmers University of Technology
show more...
Furdek Prekratic, Marija, 1985 (author)
Chalmers tekniska högskola,Chalmers University of Technology
show less...
 (creator_code:org_t)
Wiley, 2020
2020
English.
In: Networks. - : Wiley. - 1097-0037 .- 0028-3045. ; 75:4, s. 392-392
  • Journal article (peer-reviewed)
Abstract Subject headings
Close  
  • High throughput, resilience, and low latency requirements drive the development of 5G‐enabled content delivery networks (CDNs) which combine core data centers (cDCs) with edge data centers (eDCs) that cache the most popular content closer to the end users for traffic load and latency reduction. Deployed over the existing optical network infrastructure, CDNs are vulnerable to link cut attacks aimed at disrupting the overlay services. Planning a CDN to balance the stringent service requirements and increase resilience to attacks in a cost‐efficient way entails solving the content placement problem (CPP) across the cDCs and eDCs. This article proposes a framework for finding Pareto‐optimal solutions with minimal user‐to‐content distance and maximal robustness to targeted link cuts, under a defined budget. We formulate two optimization problems as integer linear programming (ILP) models. The first, denoted as K‐best CPP with minimal distance (K‐CPP‐minD), identifies the eDC/cDC placement solutions with minimal user‐to‐content distance. The second performs critical link set detection to evaluate the resilience of the K‐CPP‐minD solutions to targeted fiber cuts. Extensive simulations verify that the eDC/cDC selection obtained by our models improves network resilience to link cut attacks without adversely affecting the user‐to‐content distances or the core network traffic mitigation benefits.

Subject headings

NATURVETENSKAP  -- Data- och informationsvetenskap -- Datavetenskap (hsv//swe)
NATURAL SCIENCES  -- Computer and Information Sciences -- Computer Sciences (hsv//eng)
TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Datorsystem (hsv//swe)
ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Computer Systems (hsv//eng)
NATURVETENSKAP  -- Matematik -- Diskret matematik (hsv//swe)
NATURAL SCIENCES  -- Mathematics -- Discrete Mathematics (hsv//eng)

Keyword

network resilience
malicious attacks
critical link set detection
content cashing
optical network
content delivery network

Publication and Content Type

art (subject category)
ref (subject category)

Find in a library

  • Networks (Search for host publication in LIBRIS)

To the university's database

  • 1 of 1
  • Previous record
  • Next record
  •    To hitlist

Search outside SwePub

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view