{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T22:17:57Z","timestamp":1775341077171,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031360206","type":"print"},{"value":"9783031360213","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-36021-3_32","type":"book-chapter","created":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T09:06:16Z","timestamp":1688115976000},"page":"314-321","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Application of\u00a0Genetic Algorithm to\u00a0Load Balancing in\u00a0Networks with\u00a0a\u00a0Homogeneous Traffic Flow"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4645-967X","authenticated-orcid":false,"given":"Marek","family":"Bolanowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7406-8495","authenticated-orcid":false,"given":"Alicja","family":"Gerka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7573-3856","authenticated-orcid":false,"given":"Andrzej","family":"Paszkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7714-4844","authenticated-orcid":false,"given":"Maria","family":"Ganzha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8069-2152","authenticated-orcid":false,"given":"Marcin","family":"Paprzycki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,26]]},"reference":[{"key":"32_CR1","unstructured":"https:\/\/arxiv.org\/abs\/2304.09313"},{"key":"32_CR2","unstructured":"Research stand IoE. https:\/\/zsz.prz.edu.pl\/en\/research-stand-ioe\/about. Accessed: 2023-01-02"},{"key":"32_CR3","unstructured":"SDNGALB source code. https:\/\/bolanowski.v.prz.edu.pl\/download. Accessed: 2023-01-02"},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Babayigit, B., Ulu, B.: Load balancing on software defined networks. In: 2018 2nd International Symposium on Multidisciplinary Studies and Innovative Technologies (ISMSIT), pp. 1\u20134. IEEE, Ankara (Oct 2018). https:\/\/doi.org\/10.1109\/ISMSIT.2018.8567070","DOI":"10.1109\/ISMSIT.2018.8567070"},{"key":"32_CR5","doi-asserted-by":"publisher","unstructured":"Chen, Y.T., Li, C.Y., Wang, K.: A Fast Converging Mechanism for Load Balancing among SDN Multiple Controllers. In: 2018 IEEE Symposium on Computers and Communications (ISCC), pp. 00682\u201300687. IEEE, Natal (Jun 2018). https:\/\/doi.org\/10.1109\/ISCC.2018.8538552","DOI":"10.1109\/ISCC.2018.8538552"},{"issue":"1","key":"32_CR6","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). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"issue":"3","key":"32_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1014852026591","volume":"6","author":"M Ericsson","year":"2002","unstructured":"Ericsson, M., Resende, M., Pardalos, P.: A Genetic Algorithm for the Weight Setting Problem in OSPF Routing. J. Comb. Optim. 6(3), 299\u2013333 (2002). https:\/\/doi.org\/10.1023\/A:1014852026591","journal-title":"J. Comb. Optim."},{"key":"32_CR8","doi-asserted-by":"publisher","unstructured":"Gao, K., et al.: Predicting traffic demand matrix by considering inter-flow correlations. In: IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 165\u2013170 (2020). https:\/\/doi.org\/10.1109\/INFOCOMWKSHPS50562.2020.9163001","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9163001"},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Jain, A., Chaudhari, N.S.: Genetic algorithm for optimizing network load balance in MPLS network. In: 2012 Fourth International Conference on Computational Intelligence and Communication Networks, pp. 122\u2013126. IEEE, Mathura, Uttar Pradesh, India (Nov 2012). https:\/\/doi.org\/10.1109\/CICN.2012.119","DOI":"10.1109\/CICN.2012.119"},{"key":"32_CR10","doi-asserted-by":"publisher","unstructured":"Jain, P., Sharma, S.K.: A systematic review of nature inspired load balancing algorithm in heterogeneous cloud computing environment. In: 2017 Conference on Information and Communication Technology (CICT), pp. 1\u20137. IEEE, Gwalior, India (Nov 2017). https:\/\/doi.org\/10.1109\/INFOCOMTECH.2017.8340645","DOI":"10.1109\/INFOCOMTECH.2017.8340645"},{"issue":"6","key":"32_CR11","doi-asserted-by":"publisher","first-page":"1225","DOI":"10.1016\/j.cor.2010.12.003","volume":"39","author":"T Keskinturk","year":"2012","unstructured":"Keskinturk, T., Yildirim, M.B., Barut, M.: An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times. Comput. Oper. Res. 39(6), 1225\u20131235 (2012). https:\/\/doi.org\/10.1016\/j.cor.2010.12.003","journal-title":"Comput. Oper. Res."},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"39612","DOI":"10.1109\/ACCESS.2019.2906683","volume":"7","author":"G Li","year":"2019","unstructured":"Li, G., Wang, X., Zhang, Z.: SDN-based load balancing scheme for multi-controller deployment. IEEE Access 7, 39612\u201339622 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2906683","journal-title":"IEEE Access"},{"key":"32_CR13","doi-asserted-by":"publisher","unstructured":"Mahlab, U., et al.: Entropy-based load-balancing for software-defined elastic optical networks. In: 2017 19th International Conference on Transparent Optical Networks (ICTON), pp. 1\u20134. IEEE, Girona, Spain (Jul 2017). https:\/\/doi.org\/10.1109\/ICTON.2017.8024847","DOI":"10.1109\/ICTON.2017.8024847"},{"key":"32_CR14","doi-asserted-by":"publisher","unstructured":"Mazur, D., Paszkiewicz, A., Bolanowski, M., Budzik, G., Oleksy, M.: Analysis of possible SDN use in the rapid prototyping processas part of the Industry 4.0. Bull. Polish Acad. Sci. Tech. Sci. 67(1), 21\u201330 (2019). https:\/\/doi.org\/10.24425\/BPAS.2019.127334","DOI":"10.24425\/BPAS.2019.127334"},{"issue":"3","key":"32_CR15","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/s10489-016-0776-0","volume":"45","author":"MA Mohiuddin","year":"2016","unstructured":"Mohiuddin, M.A., Khan, S.A., Engelbrecht, A.P.: Fuzzy particle swarm optimization algorithms for the open shortest path first weight setting problem. Appl. Intell. 45(3), 598\u2013621 (2016). https:\/\/doi.org\/10.1007\/s10489-016-0776-0","journal-title":"Appl. Intell."},{"key":"32_CR16","unstructured":"Mulyana, E., Killat, U.: An Alternative Genetic Algorithm to Optimize OSPF Weights. Internet Traffic Engineering and Traffic Management, pp. 186\u2013192 (Jul 2002)"},{"key":"32_CR17","doi-asserted-by":"publisher","unstructured":"Paszkiewicz, A., Bolanowski, M., Budzik, G., Przesz\u0142owski, L., Oleksy, M.: Process of creating an integrated design and manufacturing environment as part of the structure of industry 4.0. Processes 8(9), 1019 (2020). https:\/\/doi.org\/10.3390\/pr8091019","DOI":"10.3390\/pr8091019"},{"key":"32_CR18","unstructured":"Smiler. S, K.: OpenFlow cookbook. Quick answers to common problems, Packt Publishing, Birmingham Mumbai, 1. publ edn. (2015)"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0024-3795(73)90023-2","volume":"6","author":"GP Styan","year":"1973","unstructured":"Styan, G.P.: Hadamard products and multivariate statistical analysis. Linear Algebra Appl. 6, 217\u2013240 (1973). https:\/\/doi.org\/10.1016\/0024-3795(73)90023-2","journal-title":"Linear Algebra Appl."},{"key":"32_CR20","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.comnet.2018.05.012","volume":"141","author":"H Wang","year":"2018","unstructured":"Wang, H., Xu, H., Huang, L., Wang, J., Yang, X.: Load-balancing routing in software defined networks with multiple controllers. Comput. Netw. 141, 82\u201391 (2018). https:\/\/doi.org\/10.1016\/j.comnet.2018.05.012","journal-title":"Comput. Netw."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36021-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,30]],"date-time":"2023-06-30T09:09:51Z","timestamp":1688116191000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36021-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360206","9783031360213"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36021-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2023\/","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":"530","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":"188","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":"94","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":"35% - 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":"2,8","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":"3,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)"}}]}}