nach oben

Erschienen in:

2020 | OriginalPaper | Buchkapitel

A Resource Usage Efficient Distributed Allocation Algorithm for 5G Service Function Chains

verfasst von : Guillaume Fraysse, Jonathan Lejeune, Julien Sopena, Pierre Sens

Erschienen in: Distributed Applications and Interoperable Systems

Verlag: Springer International Publishing

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Recent evolution of networks introduce new challenges for the allocation of resources. Slicing in 5G networks allows multiple users to share a common infrastructure and the chaining of Network Function (NFs) introduces constraints on the order in which NFs are allocated. We first model the allocation of resources for Chains of NFs in 5G Slices. Then we introduce a distributed mutual exclusion algorithm to address the problem of the allocation of resources. We show with selected metrics that choosing an order of allocation of the resources that differs from the order in which resources are used can give better performances. We then show experimental results where we improve the usage rate of resources by more than 20% compared to the baseline algorithm in some cases. The experiments run on our own simulator based on SimGrid.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Vorheriges Kapitel DroidAutoML: A Microservice Architecture to Automate the Evaluation of Android Machine Learning Detection Systems

Nächstes Kapitel A Self-stabilizing One-To-Many Node Disjoint Paths Routing Algorithm in Star Networks

Awerbuch, B., Saks, M.: A dining philosophers algorithm with polynomial response time. In: Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, vol. 1, pp. 65–74 (1990)

Bouabdallah, A., Laforest, C.: A Distributed Token-Based Algorithm for the Dynamic Resource Allocation Problem. SIGOPS Oper. Syst. Rev. 34(3), 60–68 (2000)CrossRef

Casanova, H., et al.: Versatile, scalable, and accurate simulation of distributed applications and platforms. J. Parallel Distrib. Comput. 74(10), 2899–2917 (2014)CrossRef

Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6(4), 632–646 (1984)CrossRef

Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269–271 (1959)MathSciNetCrossRef

Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115–138 (1971)MathSciNetCrossRef

Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)CrossRef

Ginat, D., Shankar, A.U., Agrawala, A.K.: An efficient solution to the drinking philosophers problem and its extensions. In: Bermond, J.-C., Raynal, M. (eds.) WDAG 1989. LNCS, vol. 392, pp. 83–93. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-51687-5_34CrossRef

ETSI NFV ISG. ETSI GS NFV 001: Network Functions Virtualisation (NFV) Use Cases (2013). https://www.etsi.org/deliver/etsi_gs/NFV/001_099/001/01.01.01_60/gs_NFV001v010101p.pdf

10.

ETSI NFV ISG. ETSI GS NFV-MAN 001 V1.1.1 Network Functions Virtualisation (NFV); Management and Orchestration (2014)

11.

Jennings, B., Stadler, R.: Resource management in clouds: survey and research challenges. J. Netw. Syst. Manage. 23(3), 567–619 (2014). https://doi.org/10.1007/s10922-014-9307-7CrossRef

12.

Jhawar, R., et al.: Supporting security requirements for resource management in cloud computing. In: 2012 IEEE 15th International Conference on Computational Science and Engineering, pp. 170–177 (2012)

13.

Knight, S., et al.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765–1775 (2011)CrossRef

14.

Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)CrossRef

15.

Lejeune, J., et al.: Reducing synchronization cost in distributed multi- resource allocation problem. In: 2015 44th International Conference on Parallel Processing, pp. 540–549 (2015)

16.

Garey, M.R., et al.: The complexity of flowshop and jobshop scheduling - mathematics of operations research (1976). https://pubsonline.informs.org/doi/abs/10.1287/moor.1.2.117

17.

Machida, F., et al.: Redundant virtual machine placement for fault-tolerant consolidated server clusters. In: 2010 IEEE Network Operations and Management Symposium - NOMS 2010, pp. 32–39 (2010)

18.

Maddi, A.: Token based solutions to m resources allocation problem. In: Proceedings of the 1997 ACM Symposium on Applied Computing. SAC 1997, pp. 340–344. ACM, New York (1997)

19.

Maekawa, M.: A N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145–159 (1985)CrossRef

20.

Mills, K., et al.: Comparing VM-placement algorithms for on-demand clouds. In: 2011 IEEE Third International Conference on Cloud Computing Technology and Science, pp. 91–98 (2011)

21.

Naimi, M., et al.: A log (N) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput. 34(1), 1–13 (1996)CrossRef

22.

Pignataro, C., Halpern, J.: Service Function Chaining (SFC) Architecture (2015). https://tools.ietf.org/html/rfc7665

23.

Previdi, S., et al.: Segment Routing Architecture (2018). https://tools.ietf.org/html/rfc8402

24.

Rai, A., et al.: Generalized resource allocation for the cloud. In: Proceedings of the Third ACM Symposium on Cloud Computing, SoCC 2012, pp. 15:1–15:12. ACM, New York (2012)

25.

Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61–77 (1989)CrossRef

26.

Raynal, M.: A distributed solution to the k-out of-M resources allocation problem. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds.) ICCI 1991. LNCS, vol. 497, pp. 599–609. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-54029-6_209CrossRef

27.

Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9–17 (1981)MathSciNetCrossRef

28.

Rost, P., et al.: Network slicing to enable scalability and flexibility in 5G mobile networks. IEEE Commun. Mag. 55(5), 72–79 (2017)CrossRef

29.

SLICENET. Deliverables - SLICENET (2018). https://slicenet.eu/deliverables/

30.

Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst. 3(4), 344–349 (1985)CrossRef

31.

Widjajarto, A., et al.: Cloud computing reference model: the modelling of service availability based on application profile and resource allocation. In: 2012 International Conference on Cloud Computing and Social Networking (ICCCSN), pp. 1–4 (2012)

Titel: A Resource Usage Efficient Distributed Allocation Algorithm for 5G Service Function Chains
verfasst von: Guillaume Fraysse
Jonathan Lejeune
Julien Sopena
Pierre Sens
Verlag: Springer International Publishing
Buch: Distributed Applications and Interoperable Systems
Print ISBN: 978-3-030-50322-2

Electronic ISBN: 978-3-030-50323-9

Copyright-Jahr: 2020
DOI: https://doi.org/10.1007/978-3-030-50323-9_11

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"