{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:47:15Z","timestamp":1743000435513,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031042058"},{"type":"electronic","value":"9783031042065"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-04206-5_10","type":"book-chapter","created":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T19:07:51Z","timestamp":1649704071000},"page":"126-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["De Bruijn-Based and\u00a0k-Ary n-Cube-Based Algebraic Models in\u00a0Fog Environments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8391-8946","authenticated-orcid":false,"given":"Pedro Juan","family":"Roig","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3701-5583","authenticated-orcid":false,"given":"Salvador","family":"Alcaraz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8985-0639","authenticated-orcid":false,"given":"Katja","family":"Gilly","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9537-415X","authenticated-orcid":false,"given":"Cristina","family":"Bernad","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0034-2855","authenticated-orcid":false,"given":"Sonja","family":"Filiposka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,12]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Prabhu, C.S.R.: Overview - fog computing and Internet-of-Things (IOT). EAI Endors. Trans. Cloud Syst. 3(10), 1\u201323 (2017). https:\/\/doi.org\/10.4108\/eai.20-12-2017.154378","DOI":"10.4108\/eai.20-12-2017.154378"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Anwar, M., et al.: Fog computing: an overview of big IoT data analytics. Wirel. Commun. Mobile Comput. 2018, 7157192 (2018). https:\/\/doi.org\/10.1155\/2018\/7157192","DOI":"10.1155\/2018\/7157192"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Bittencourt, L.F., Lopes, M.M., Petri, I., Rana, O.F.: Towards virtual machine migration in fog computing. In: Proceedings of 10th International Conference on P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), pp. 1\u20138 (2015). https:\/\/doi.org\/10.1109\/3PGCIC.2015.85","DOI":"10.1109\/3PGCIC.2015.85"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Osanaiye, O., Chen, S., Yan, Z., Lu, R., Choo, K.R., Dlodlo, M.: From cloud to fog computing: a review and a conceptual live VM migration framework. IEEE Access 5, 8284\u20138300 (2017). https:\/\/doi.org\/10.1109\/ACCESS.2017.2692960","DOI":"10.1109\/ACCESS.2017.2692960"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Mahmud, R., Ramamohanarao, K., Buyya, R.: Application management in fog computing environments: a taxonomy, review and future directions. ACM Comput. Surv. 53(4), pp. 1\u201343 (2020). https:\/\/doi.org\/10.1145\/3403955","DOI":"10.1145\/3403955"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Darlagiannis, V., Mauthe, A., Heckmann, O., Liebau, N., Steinmetz, R.: On routing in a two-tier overlay network based on de Bruijn digraphs. In: IEEE\/IFIP Network Operations and Management Symposium (NOMS), pp. 186\u2013197 (2006). NOMS.2006.1687550","DOI":"10.1109\/NOMS.2006.1687550"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-642-24550-3_31","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Richa","year":"2011","unstructured":"Richa, A., Scheideler, C., Stevens, P.: Self-stabilizing De Bruijn networks. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 416\u2013430. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24550-3_31"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Gal\u00e1n-Jim\u00e9nez, J., Gazo-Cervero, A., Overview and challenges of overlay networks: a survey. Int. J. Comput. Sci. Eng. Surv. (IJCSES) 2 (1), 19\u201337 (2011). https:\/\/doi.org\/10.5121\/ijcses.2011.2102","DOI":"10.5121\/ijcses.2011.2102"},{"key":"10_CR9","unstructured":"West, R., Fry, G., Wong, G.: Comparison of $$k$$-ary $$n$$-cube and de Bruijn Overlays in QoS-constrained Multicast Applications. In: Proceedings of the International Conference of Parallel and Distributed Processing Techniques and Applications (PDPTA), pp. 1\u201311. (2005). https:\/\/hdl.handle.net\/2144\/1829"},{"key":"10_CR10","unstructured":"de Bruijn, N.G.: A combinatorial problem. Proc. Koninklijke Nederlandse Akademie V. Wetenschappen 49, 758\u2013764 (1946). https:\/\/www.dwc.knaw.nl\/DL\/publications\/PU00018235.pdf"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Chee Y.M., Etzion, T., Kiah, H.M., Vu, V.K., Yaakobi, E.: Constrained de Bruijn codes and their applications. In: IEEE International Symposium on Information Theory (ISIT), pp. 2369\u20132373 (2019). https:\/\/doi.org\/10.1109\/ISIT.2019.8849237","DOI":"10.1109\/ISIT.2019.8849237"},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Almansi, E., Becher, V.: Completely uniformly distributed sequences based on de Bruijn sequences. Math. Comput. 89, 2537\u20132551 (2020). https:\/\/doi.org\/10.1090\/mcom\/3534","DOI":"10.1090\/mcom\/3534"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W.: Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence. In: SIAM J. Discrete Math. 30(4), 2027\u20132046 (2016). https:\/\/doi.org\/10.1137\/15M1043248","DOI":"10.1137\/15M1043248"},{"key":"10_CR14","unstructured":"Lytle, M.: Edge-disjoint hamiltonian cycles in De Bruijn graphs. Thesis degree of Honors Baccalaureate of Science in Mathematics, Oregon State University, pp. 1\u201319 (2013). https:\/\/ir.library.oregonstate.edu\/downloads\/8049g733b?locale=en"},{"key":"10_CR15","unstructured":"Wong, C.H.: Novel universal cycle constructions for a variety of combinatorial objects. Ph.D. Thesis in Computer Science, University of Guelph, pp. 1\u2013117 (2015). https:\/\/atrium.lib.uoguelph.ca\/xmlui\/handle\/10214\/8812"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Sawada, J., Williams, A, Wong D.: A simple shift rule for $$k$$-ary de Bruijn sequences. Discrete Math. 340(3), 524\u2013531 (2017). https:\/\/doi.org\/10.1016\/j.disc.2016.09.008","DOI":"10.1016\/j.disc.2016.09.008"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Darlagiannis, V., et al.: On routing in a two-tier overlay network based on de Bruijn digraphs. In: IEEE\/IFIP Network Operations and Management Symposium, pp. 186\u2013197 (2006). https:\/\/doi.org\/10.1109\/NOMS.2006.1687550","DOI":"10.1109\/NOMS.2006.1687550"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Mousavi, M.R.: Modelling and Analysis of Communicating Systems, pp. 1\u2013392. MIT Press, London (2014). https:\/\/dl.acm.org\/citation.cfm?id=2628007","DOI":"10.7551\/mitpress\/9946.001.0001"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Fokkink, W.: Introduction to Process Algebra, pp. 11\u201374. Springer, Berlin (2000). https:\/\/doi.org\/10.1007\/978-3-662-04293-9","DOI":"10.1007\/978-3-662-04293-9"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Horan, V., Stevens, B.: Locating patterns in the De Bruijn Torus. Discrete Math. 339(4), 1274\u20131292 (2016). https:\/\/doi.org\/10.1016\/j.disc.2015.11.015","DOI":"10.1016\/j.disc.2015.11.015"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Hurlbert, G., Isaak, G.: On the De Bruijn torus problem. J. Combin. Theory Ser. A 64(1), 50\u201362 (1993). https:\/\/doi.org\/10.1016\/0097-3165(93)90087-O","DOI":"10.1016\/0097-3165(93)90087-O"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Pudwell, L., Rockey, R.: de Bruijn arrays for L-fillings. Math. Mag. 87(1), 57\u201360 (2014). https:\/\/doi.org\/10.4169\/math.mag.87.1.57","DOI":"10.4169\/math.mag.87.1.57"},{"key":"10_CR23","unstructured":"Kapinya, J.B.: Evolutionary computing solutions for the de Bruijn torus problem. Master\u2019s thesis in Computer Science, University of Vrije, pp. 1\u201333 (2004). http:\/\/compalg.inf.elte.hu\/~tony\/Kutatas\/PerfectArrays\/Kapinyathesis.pdf"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Horv\u00e1th, M., Iv\u00e1nyi, A.: Growing perfect cubes. Discrete Math. 308(19), 4378\u20134388 (2008). https:\/\/doi.org\/10.1016\/j.disc.2007.08.031","DOI":"10.1016\/j.disc.2007.08.031"},{"key":"10_CR25","unstructured":"Casteels, K., Tinker, T.: De Bruijn sequences of higher dimension. Master\u2019s thesis of Ted Tinker, directed by Karel Casteels, University of California, pp. 1\u201341 (2018). http:\/\/web.math.ucsb.edu\/~casteels\/TedTinkerSenior_Thesis.pdf"},{"key":"10_CR26","doi-asserted-by":"publisher","unstructured":"Mao, W., Nicol, D.M.: On $$k$$-ary $$n$$-cubes: theory and applications. Discrete Appl. Math. 129(1), 171.193 (2003). https:\/\/doi.org\/10.1016\/S0166-218X(02)00238-X","DOI":"10.1016\/S0166-218X(02)00238-X"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Shih, Y.K., Kao, S.S.: One-to-one disjoint path covers on $$k$$-ary $$n$$-cubes. Theor. Comput. Sci. 412, 4513\u20134530 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.04.035","DOI":"10.1016\/j.tcs.2011.04.035"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Boutin, D., Horan, V., Pelto, M.: Identifying codes on directed de Bruijn graphs. Discrete Appl. Math. 262, 29\u201341 (2019). https:\/\/doi.org\/10.1016\/j.dam.2019.02.005","DOI":"10.1016\/j.dam.2019.02.005"}],"container-title":["Communications in Computer and Information Science","ICT Innovations 2021. Digital Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04206-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,11]],"date-time":"2022-04-11T19:10:23Z","timestamp":1649704223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04206-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031042058","9783031042065"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04206-5_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"12 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICT Innovations","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on ICT Innovations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictinnovations2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictinnovations.org\/13th-ict-innovations-conference-2021","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":"58","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":"15","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":"0","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":"26% - 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.6","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":"1.95","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}