{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T04:51:38Z","timestamp":1693457498232},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T00:00:00Z","timestamp":1685491200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The object of the presented paper is to demonstrate the possibility of equalizing the transmission properties of networks described by graphs with an equal number of nodes of the same degree but differing in diameter and average path length. A node of a graph is understood to be a specialised device performing commutation and transmission functions, while an edge is understood to be a transmission link. It was assumed that this alignment can be achieved by controlling the transmission resources assigned to specific edges of a graph through which the network nodes communicate with each other. The concept of transmission resource, counted in contractual units, is understood as, for example, the number of time slots or the bandwidth of the links used to transmit information. The authors show that with the proposed method, the equalization of the mentioned network properties is achieved with a minimal increase in the global resources used for transmission.<\/jats:p>","DOI":"10.1007\/s11786-023-00559-6","type":"journal-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T04:16:44Z","timestamp":1685506604000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equalising the Transmission Properties of Graph-Modelled Networks by Introducing the Control of the Resources Used to Transmit Information"],"prefix":"10.1007","volume":"17","author":[{"given":"S\u0142awomir","family":"Bujnowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beata","family":"Marciniak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olutayo Oyeyemi","family":"Oyerinde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zbigniew","family":"Lutowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Flizikowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e1n Garc\u00eda","family":"Galan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,31]]},"reference":[{"issue":"4","key":"559_CR1","first-page":"291","volume":"100","author":"H Lee","year":"1981","unstructured":"Lee, H.: Analysis of chordal ring network. IEEE Trans. Comput. 100(4), 291\u2013295 (1981)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"559_CR2","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1049\/ip-e.1990.0038","volume":"137","author":"R Browne","year":"1990","unstructured":"Browne, R., Hodgson, R.: Symmetric degree-four chordal ring networks. IEE Proc. E-Comput. Digit. Tech. 137(4), 310\u2013318 (1990)","journal-title":"IEE Proc. E-Comput. Digit. Tech."},{"key":"559_CR3","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-23154-4_49","volume-title":"Image Processing and Communications Challenges 3","author":"S Bujnowski","year":"2011","unstructured":"Bujnowski, S., Dubalski, B., Zab\u0142udowski, A., Pedersen, J.M., Riaz, T.: Analysis of degree 5 chordal rings for network topologies. In: Chora\u015b, R.S. (ed.) Image Processing and Communications Challenges 3, pp. 445\u2013457. Springer, Berlin (2011)"},{"key":"559_CR4","unstructured":"Matroud, A.A.: Communication in chordal ring networks. PhD thesis, Universiti Putra Malaysia. Malaysia (2006)"},{"key":"559_CR5","first-page":"3","volume":"16","author":"RNF Azura","year":"2008","unstructured":"Azura, R.N.F., Othman, M., Selamat, M., Hock, P.: Modified degree six chordal rings network topology. Prosiding Simposium Kebangsaan Sains Mathematik Ke 16, 3\u20135 (2008)","journal-title":"Prosiding Simposium Kebangsaan Sains Mathematik Ke"},{"key":"559_CR6","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-16295-4_49","volume-title":"Image Processing and Communications Challenges 2","author":"S Bujnowski","year":"2010","unstructured":"Bujnowski, S., Dubalski, B., Zab\u0142udowski, A., Ledzi\u0144ski, D., Marciniak, T., Pedersen, J.: Comparison of modified degree 6 chordal rings. In: Chora\u015b, R.S. (ed.) Image Processing and Communications Challenges 2, pp. 435\u2013445. Springer, Berlin (2010)"},{"issue":"2\u20133","key":"559_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0166-218X(02)00569-3","volume":"129","author":"L Barri\u00e8re","year":"2003","unstructured":"Barri\u00e8re, L.: Symmetry properties of chordal rings of degree 3. Discrete Appl. Math. 129(2\u20133), 211\u2013232 (2003)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"559_CR8","first-page":"147","volume":"4","author":"RNF Azura","year":"2010","unstructured":"Azura, R.N.F., Othman, M., Hock, P.Y., Selamat, M.H.: On properties of modified degree six chordal rings network. Malays. J. Math. Sci. 4(2), 147\u2013157 (2010)","journal-title":"Malays. J. Math. Sci."},{"issue":"1","key":"559_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/PL00009251","volume":"23","author":"L Narayanan","year":"1999","unstructured":"Narayanan, L., Opatrny, J.: Compact routing on chordal rings of degree 4. Algorithmica 23(1), 72\u201396 (1999)","journal-title":"Algorithmica"},{"issue":"10","key":"559_CR10","first-page":"78","volume":"4","author":"RNFAB Raja","year":"2010","unstructured":"Raja, R.N.F.A.B., Shah, M., Othman, M., Selamat, M.H.: An optimum free-table routing algorithms of modified and traditional chordal ring networks of degree four. J. Mater. Sci. Eng. 4(10), 78\u201389 (2010)","journal-title":"J. Mater. Sci. Eng."},{"issue":"1","key":"559_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(00)00213-9","volume":"264","author":"L Barriere","year":"2001","unstructured":"Barriere, L., Cohen, J., Mitjana, M.: Gossiping in chordal rings under the line model. Theor. Comput. Sci. 264(1), 53\u201364 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"559_CR12","doi-asserted-by":"crossref","unstructured":"Masuyama, H., Taniguchi, H., Miyoshi, T.: All-to-all personalized communication algorithms in chordal ring networks. In: International Conference on Networking, pp. 877\u2013889. Springer, Berlin (2001)","DOI":"10.1007\/3-540-47734-9_87"},{"key":"559_CR13","doi-asserted-by":"crossref","unstructured":"Chien, S., Farah, R., Othman, M.: A \u2018snowflake\u2019geometrical representation for optimised degree six 3\u2014modified chordal ring networks. In: AIP Conference Proceedings, vol. 1847, p. 020005 . AIP Publishing LLC (2017)","DOI":"10.1063\/1.4983860"},{"issue":"3","key":"559_CR14","first-page":"1430","volume":"26","author":"D Ledzinski","year":"2018","unstructured":"Ledzinski, D., Smigiel, S., Zabludowski, L.: Analyzing methods of network topologies based on chordal rings. Turk. J. Electr. Eng. Comput. Sci. 26(3), 1430\u20131443 (2018)","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"559_CR15","doi-asserted-by":"publisher","DOI":"10.21303\/2461-4262.2021.001734","author":"NH Attrah","year":"2021","unstructured":"Attrah, N.H., Abdul-Majeed, G.H., Abdullah, M.Z.: Implementation of chordal ring network topology to enhance the performance of wireless broadband network. EUREKA: Phys. Eng. (2021). https:\/\/doi.org\/10.21303\/2461-4262.2021.001734","journal-title":"EUREKA: Phys. Eng."},{"issue":"9","key":"559_CR16","doi-asserted-by":"publisher","first-page":"155014771667064","DOI":"10.1177\/1550147716670646","volume":"12","author":"C Li","year":"2016","unstructured":"Li, C., Wang, J., Li, M.: Data transmission optimization algorithm for network utility maximization in wireless sensor networks. Int. J. Distrib. Sens. Netw. 12(9), 1550147716670646 (2016)","journal-title":"Int. J. Distrib. Sens. Netw."},{"key":"559_CR17","doi-asserted-by":"publisher","first-page":"215010","DOI":"10.1109\/ACCESS.2020.3040323","volume":"8","author":"EA Monakhova","year":"2020","unstructured":"Monakhova, E.A., Romanov, A.Y., Lezhnev, E.V.: Shortest path search algorithm in optimal two-dimensional circulant networks: implementation for networks-on-chip. IEEE Access 8, 215010\u2013215019 (2020)","journal-title":"IEEE Access"},{"issue":"5","key":"559_CR18","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1007\/s13538-020-00772-9","volume":"50","author":"ASD Mata","year":"2020","unstructured":"Mata, A.S.D.: Complex networks: a mini-review. Braz. J. Phys. 50(5), 658\u2013672 (2020)","journal-title":"Braz. J. Phys."},{"key":"559_CR19","unstructured":"Ledzi\u0144ski, D., Marciniak, B., \u015arutek, M.: Referential graphs. Zeszyty Naukowe, Telekomunikacja i Elektronika\/Uniwersytet Technologiczno-Przyrodniczy w Bydgoszczy (2013)"},{"key":"559_CR20","doi-asserted-by":"crossref","unstructured":"Bujnowski, S., Marciniak, T., Lutowski, Z., Marciniak, B., Bujnowski, D.: Modeling telecommunication networks with the use of reference graphs. In: International Conference on Image Processing and Communications, pp. 115\u2013126. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-68720-9_14"},{"issue":"14","key":"559_CR21","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.3390\/electronics10141684","volume":"10","author":"S Bujnowski","year":"2021","unstructured":"Bujnowski, S., Marciniak, B., Lutowski, Z., Flizikowski, A., Oyerinde, O.O.: Evaluation of transmission properties of networks described with reference graphs using unevenness coefficients. Electronics 10(14), 1684 (2021)","journal-title":"Electronics"},{"issue":"6","key":"559_CR22","first-page":"591","volume":"25","author":"S Bujnowski","year":"2019","unstructured":"Bujnowski, S., Marciniak, T., Marciniak, B., Lutowski, Z.: Impact of resource control in irregular networks on their transmission properties. J. Univ. Comput. Sci. 25(6), 591\u2013610 (2019)","journal-title":"J. Univ. Comput. Sci."},{"key":"559_CR23","doi-asserted-by":"crossref","unstructured":"Marciniak, B., Bujnowski, S., Marciniak, T., Lutowski, Z.: The influence of the number of uses of the edges of a reference graph on the transmission properties of the network described by the graph. In: International Conference on Image Processing and Communications, pp. 73\u201381. Springer, Berlin (2019)","DOI":"10.1007\/978-3-030-31254-1_10"},{"issue":"3","key":"559_CR24","first-page":"353","volume":"22","author":"S Bujnowski","year":"2021","unstructured":"Bujnowski, S., Marciniak, B., Marciniak, T., Lutowski, Z.: The method of determining the optimal transmission resources distribution of ICT networks modelled by graphs. Transp. Telecommun. 22(3), 353\u2013366 (2021)","journal-title":"Transp. Telecommun."},{"key":"559_CR25","doi-asserted-by":"crossref","unstructured":"Bujnowski, S., Marciniak, B., Oyerinde, O.O., Lutowski, Z., Flizikowski, A., Gal\u00e1n, S.G.: The possibility of equalising the transmission properties of networks described by chordal rings. In: 2021 15th International Conference on Signal Processing and Communication Systems (ICSPCS), pp. 1\u20138. IEEE (2021)","DOI":"10.1109\/ICSPCS53099.2021.9660228"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-023-00559-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11786-023-00559-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-023-00559-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T06:09:45Z","timestamp":1693375785000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11786-023-00559-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,31]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["559"],"URL":"https:\/\/doi.org\/10.1007\/s11786-023-00559-6","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,31]]},"assertion":[{"value":"19 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"12"}}