Show simple item record

dc.contributor.authorFossati, Francesca
dc.contributor.authorMoretti, Stefano
dc.contributor.authorPerny, Patrice
dc.contributor.authorSecci, Stefano
dc.date.accessioned2020-11-18T10:15:31Z
dc.date.available2020-11-18T10:15:31Z
dc.date.issued2020
dc.identifier.issn1063-6692
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/21212
dc.language.isoenen
dc.subject5G slicingen
dc.subjectOWAen
dc.subjectmulti-resource allocationen
dc.subject.ddc004en
dc.titleMulti-Resource Allocation for Network Slicingen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenAmong the novelties introduced by 5G networks, the formalization of the 'network slice' as a resource allocation unit is an important one. In legacy networks, resources such as link bandwidth, spectrum, computing capacity are allocated independently of each other. In 5G environments, a network slice is meant to directly serve end-to-end services, or verticals: behind a network slice demand, a tenant expresses the need to access a precise service type, under a fully qualified set of computing and network requirements. The resource allocation decision encompasses, therefore, a combination of different resources. In this paper, we address the problem of fairly sharing multiple resources between slices, in the critical situation in which the network does not have enough resources to fully satisfy slice demands. We model the problem as a multi-resource allocation problem, proposing a versatile optimization framework based on the Ordered Weighted Average (OWA) operator. We show how, adapting the OWA utility function, our framework can generalize classical single-resource allocation methods, existing multi-resource allocation solutions at the state of the art, and implement novel multi-resource allocation solutions. We compare analytically and by extensive simulations the different methods in terms of fairness and system efficiency. We conclude the paper adapting the proposed framework to Service Level Agreement (SLA)-driven services. Two algorithms, considering minimum capacity requirements and time-fairness are proposed and tested.en
dc.relation.isversionofjnlnameIEEE/ACM Transactions on Networking
dc.relation.isversionofjnlvol28en
dc.relation.isversionofjnlissue3en
dc.relation.isversionofjnldate2020-06
dc.relation.isversionofjnlpages1311-1324en
dc.relation.isversionofdoi10.1109/TNET.2020.2979667en
dc.identifier.urlsitehttps://hal.archives-ouvertes.fr/hal-02008115en
dc.relation.isversionofjnlpublisherIEEE - Institute of Electrical and Electronics Engineersen
dc.subject.ddclabelInformatique généraleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidatenonen
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2020-11-18T10:13:29Z
hal.person.labIds
hal.person.labIds989
hal.person.labIds
hal.person.labIds


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record