{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:31:47Z","timestamp":1743100307709,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030503222"},{"type":"electronic","value":"9783030503239"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50323-9_11","type":"book-chapter","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T23:02:48Z","timestamp":1591570968000},"page":"169-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Resource Usage Efficient Distributed Allocation Algorithm for 5G Service Function Chains"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8269-4701","authenticated-orcid":false,"given":"Guillaume","family":"Fraysse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6922-2451","authenticated-orcid":false,"given":"Jonathan","family":"Lejeune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Sopena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5156-7715","authenticated-orcid":false,"given":"Pierre","family":"Sens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,8]]},"reference":[{"key":"11_CR1","unstructured":"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\u201374 (1990)"},{"issue":"3","key":"11_CR2","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1145\/506117.506125","volume":"34","author":"A Bouabdallah","year":"2000","unstructured":"Bouabdallah, A., Laforest, C.: A Distributed Token-Based Algorithm for the Dynamic Resource Allocation Problem. SIGOPS Oper. Syst. Rev. 34(3), 60\u201368 (2000)","journal-title":"SIGOPS Oper. Syst. Rev."},{"issue":"10","key":"11_CR3","doi-asserted-by":"publisher","first-page":"2899","DOI":"10.1016\/j.jpdc.2014.06.008","volume":"74","author":"H Casanova","year":"2014","unstructured":"Casanova, H., et al.: Versatile, scalable, and accurate simulation of distributed applications and platforms. J. Parallel Distrib. Comput. 74(10), 2899\u20132917 (2014)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"KM Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The drinking philosophers problem. ACM Trans. Program. Lang. Syst. 6(4), 632\u2013646 (1984)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"EW Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica 1(2), 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"issue":"9","key":"11_CR7","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/365559.365617","volume":"8","author":"EW Dijkstra","year":"1965","unstructured":"Dijkstra, E.W.: Solution of a problem in concurrent programming control. Commun. ACM 8(9), 569 (1965)","journal-title":"Commun. ACM"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-51687-5_34","volume-title":"Distributed Algorithms","author":"D Ginat","year":"1989","unstructured":"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\u201393. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/3-540-51687-5_34"},{"key":"11_CR9","unstructured":"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"},{"key":"11_CR10","unstructured":"ETSI NFV ISG. ETSI GS NFV-MAN 001 V1.1.1 Network Functions Virtualisation (NFV); Management and Orchestration (2014)"},{"issue":"3","key":"11_CR11","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10922-014-9307-7","volume":"23","author":"B Jennings","year":"2014","unstructured":"Jennings, B., Stadler, R.: Resource management in clouds: survey and research challenges. J. Netw. Syst. Manage. 23(3), 567\u2013619 (2014). https:\/\/doi.org\/10.1007\/s10922-014-9307-7","journal-title":"J. Netw. Syst. Manage."},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013177 (2012)","DOI":"10.1109\/ICCSE.2012.32"},{"issue":"9","key":"11_CR13","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1109\/JSAC.2011.111002","volume":"29","author":"S Knight","year":"2011","unstructured":"Knight, S., et al.: The internet topology zoo. IEEE J. Sel. Areas Commun. 29(9), 1765\u20131775 (2011)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"7","key":"11_CR14","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Lejeune, J., et al.: Reducing synchronization cost in distributed multi- resource allocation problem. In: 2015 44th International Conference on Parallel Processing, pp. 540\u2013549 (2015)","DOI":"10.1109\/ICPP.2015.63"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1287\/moor.1.2.117"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"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\u201339 (2010)","DOI":"10.1109\/NOMS.2010.5488431"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Maddi, A.: Token based solutions to m resources allocation problem. In: Proceedings of the 1997 ACM Symposium on Applied Computing. SAC 1997, pp. 340\u2013344. ACM, New York (1997)","DOI":"10.1145\/331697.332307"},{"issue":"2","key":"11_CR19","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M Maekawa","year":"1985","unstructured":"Maekawa, M.: A N algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst. 3(2), 145\u2013159 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"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\u201398 (2011)","DOI":"10.1109\/CloudCom.2011.22"},{"issue":"1","key":"11_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jpdc.1996.0041","volume":"34","author":"M Naimi","year":"1996","unstructured":"Naimi, M., et al.: A log (N) distributed mutual exclusion algorithm based on path reversal. J. Parallel Distrib. Comput. 34(1), 1\u201313 (1996)","journal-title":"J. Parallel Distrib. Comput."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Pignataro, C., Halpern, J.: Service Function Chaining (SFC) Architecture (2015). https:\/\/tools.ietf.org\/html\/rfc7665","DOI":"10.17487\/RFC7665"},{"key":"11_CR23","unstructured":"Previdi, S., et al.: Segment Routing Architecture (2018). https:\/\/tools.ietf.org\/html\/rfc8402"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"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\u201315:12. ACM, New York (2012)","DOI":"10.1145\/2391229.2391244"},{"issue":"1","key":"11_CR25","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst. 7(1), 61\u201377 (1989)","journal-title":"ACM Trans. Comput. Syst."},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/3-540-54029-6_209","volume-title":"Advances in Computing and Information \u2014 ICCI 1991","author":"M Raynal","year":"1991","unstructured":"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\u2013609. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54029-6_209"},{"issue":"1","key":"11_CR27","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G Ricart","year":"1981","unstructured":"Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM 24(1), 9\u201317 (1981)","journal-title":"Commun. ACM"},{"issue":"5","key":"11_CR28","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MCOM.2017.1600920","volume":"55","author":"P Rost","year":"2017","unstructured":"Rost, P., et al.: Network slicing to enable scalability and flexibility in 5G mobile networks. IEEE Commun. Mag. 55(5), 72\u201379 (2017)","journal-title":"IEEE Commun. Mag."},{"key":"11_CR29","unstructured":"SLICENET. Deliverables - SLICENET (2018). https:\/\/slicenet.eu\/deliverables\/"},{"issue":"4","key":"11_CR30","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/6110.214406","volume":"3","author":"I Suzuki","year":"1985","unstructured":"Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst. 3(4), 344\u2013349 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"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\u20134 (2012)","DOI":"10.1109\/ICCCSN.2012.6215736"}],"container-title":["Lecture Notes in Computer Science","Distributed Applications and Interoperable Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50323-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T23:04:00Z","timestamp":1717801440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50323-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030503222","9783030503239"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50323-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Distributed Applications and Interoperable Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dais2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2020\/dais","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}