Παρακαλώ χρησιμοποιήστε αυτό το αναγνωριστικό για να παραπέμψετε ή να δημιουργήσετε σύνδεσμο προς αυτό το τεκμήριο: https://ruomo.lib.uom.gr/handle/7000/303
Πλήρης εγγραφή μεταδεδομένων
Πεδίο DCΤιμήΓλώσσα
dc.contributor.authorDietrich, David-
dc.contributor.authorAbujoda, Ahmed-
dc.contributor.authorRizk, Amr-
dc.contributor.authorPapadimitriou, Panagiotis-
dc.date.accessioned2019-10-30T08:55:44Z-
dc.date.available2019-10-30T08:55:44Z-
dc.date.issued2017-03-
dc.identifier10.1109/TNSM.2017.2654681en_US
dc.identifier.issn1932-4537en_US
dc.identifier.urihttps://doi.org/10.1109/TNSM.2017.2654681en_US
dc.identifier.urihttps://ruomo.lib.uom.gr/handle/7000/303-
dc.description.abstractNetwork function (NF) virtualization decouples NFs from the underlying middlebox hardware and promotes their deployment on virtualized network infrastructures. This essentially paves the way for the migration of NFs into clouds (i.e., NF-as-a-Service), achieving a drastic reduction of middlebox investment and operational costs for enterprises. In this context, service chains (expressing middlebox policies in the enterprise network) should be mapped onto datacenter networks, ensuring correctness, resource efficiency, as well as compliance with the provider's policy. The network service embedding (NSE) problem is further exacerbated by two challenging aspects: 1) traffic scaling caused by certain NFs (e.g., caches and WAN optimizers) and 2) NF location dependencies. Traffic scaling requires resource reservations different from the ones specified in the service chain, whereas NF location dependencies, in conjunction with the limited geographic footprint of NF providers (NFPs), raise the need for NSE across multiple NFPs. In this paper, we present a holistic solution to the multi-provider NSE problem. We decompose NSE into: 1) NF-graph partitioning performed by a centralized coordinator and 2) NF-subgraph mapping onto datacenter networks. We present linear programming formulations to derive near-optimal solutions for both problems. We address the challenging aspect of traffic scaling by introducing a new service model that supports demand transformations. We also define topology abstractions for NF-graph partitioning. Furthermore, we discuss the steps required to embed service chains across multiple NFPs, using our NSE orchestrator (Nestor). We perform an evaluation study of multi-provider NSE with emphasis on NF-graph partitioning optimizations tailored to the client and NFPs. Our evaluation results further uncover significant savings in terms of service cost and resource consumption due to the demand transformations.en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.sourceIEEE Transactions on Network and Service Managementen_US
dc.subjectFRASCATI::Engineering and technology::Electrical engineering, Electronic engineering, Information engineeringen_US
dc.subject.otherNetwork function virtualizationen_US
dc.subject.otherNFV orchestrationen_US
dc.subject.otherService chainingen_US
dc.titleMulti-Provider Service Chain Embedding With Nestoren_US
dc.typeArticleen_US
dc.contributor.departmentΤμήμα Εφαρμοσμένης Πληροφορικήςen_US
local.identifier.volume14en_US
local.identifier.issue1en_US
local.identifier.firstpage91en_US
local.identifier.lastpage105en_US
Εμφανίζεται στις Συλλογές: Τμήμα Εφαρμοσμένης Πληροφορικής

Αρχεία σε αυτό το Τεκμήριο:
Αρχείο Περιγραφή ΜέγεθοςΜορφότυπος 
nestor.pdfPaper2,25 MBAdobe PDFΠροβολή/Ανοιγμα


Τα τεκμήρια στο Αποθετήριο προστατεύονται από πνευματικά δικαιώματα, εκτός αν αναφέρεται κάτι διαφορετικό.