Multi-constrained network occupancy optimization
The greater the number of devices on a network, the higher load in the network, the more chance of a collision occurring, and the longer it takes to transmit a message. The size of load can be identified by measuring the network occupancy, hence it is desirable to minimize the latter. In this paper,...
Gespeichert in:
| Veröffentlicht in: | Computer Science and Information Systems Jg. 20; H. 1; S. 251 - 276 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| ISSN: | 1820-0214, 2406-1018 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The greater the number of devices on a network, the higher load in the network, the more chance of a collision occurring, and the longer it takes to transmit a message. The size of load can be identified by measuring the network occupancy, hence it is desirable to minimize the latter. In this paper, we present an approach for network occupancy minimization by optimizing the packing process while satisfying multiple constraints. We formulate the minimization problem as a bin packing problem and we implement a modification of the Best-Fit Decreasing algorithm to find the optimal solution. The approach considers grouping signals that are sent to different destinations in the same package. The analysis is done on a medium-sized plant model, and different topologies are tested. The results show that the proposed solution lowers the network occupancy compared to a reference case. |
|---|---|
| AbstractList | The greater the number of devices on a network, the higher load in the network, the more chance of a collision occurring, and the longer it takes to transmit a message. The size of load can be identified by measuring the network occupancy, hence it is desirable to minimize the latter. In this paper, we present an approach for network occupancy minimization by optimizing the packing process while satisfy-ing multiple constraints. We formulate the minimization problem as a bin packing problem and we implement a modification of the Best-Fit Decreasing algorithm to find the optimal solution. The approach considers grouping signals that are sent to different destinations in the same package. The analysis is done on a medium-sized plant model, and different topologies are tested. The results show that the proposed solution lowers the network occupancy compared to a reference case. The greater the number of devices on a network, the higher load in the network, the more chance of a collision occurring, and the longer it takes to transmit a message. The size of load can be identified by measuring the network occupancy, hence it is desirable to minimize the latter. In this paper, we present an approach for network occupancy minimization by optimizing the packing process while satisfying multiple constraints. We formulate the minimization problem as a bin packing problem and we implement a modification of the Best-Fit Decreasing algorithm to find the optimal solution. The approach considers grouping signals that are sent to different destinations in the same package. The analysis is done on a medium-sized plant model, and different topologies are tested. The results show that the proposed solution lowers the network occupancy compared to a reference case. |
| Author | Feyzmahdavian, Hamid Halilovic, Amar Zaimovic, Nedim Seceleanu, Tiberiu |
| Author_xml | – sequence: 1 givenname: Amar surname: Halilovic fullname: Halilovic, Amar organization: Ulm University, Ulm, Germany – sequence: 2 givenname: Nedim surname: Zaimovic fullname: Zaimovic, Nedim organization: ALTEN AB, Västerås, Sweden – sequence: 3 givenname: Tiberiu surname: Seceleanu fullname: Seceleanu, Tiberiu organization: Mälardalen University, Västerås, Sweden – sequence: 4 givenname: Hamid surname: Feyzmahdavian fullname: Feyzmahdavian, Hamid organization: ABB AB, Västerås, Sweden |
| BackLink | https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-62096$$DView record from Swedish Publication Index (Mälardalens högskola) |
| BookMark | eNpVkE1LAzEYhINUsNZePfcHuPVNNptkj6V-tFDxUPUaknezGmyTJdlS6q-3UhGEgbk8MwxzSQYhBkfINYUpY7W6na-Xa0YpwFFqcUaGjIMoKFA1IEOqGBTAKL8g45y9Bc5lWXIuhgSedpveFxhD7pPxwTWT4Pp9TJ-TiLjrTMDDJHa93_ov0_sYrsh5azbZjX99RF4f7l_mi2L1_Licz1YFMkn7onFQY2lQGi7QgbKC2sopqThwVLWs29Ja2QgUsjKokDb8uKd1wmJVWdeUI3Jz6s171-2s7pLfmnTQ0Xh9599mOqZ3vW0-tGBQiyM-PeGYYs7JtX8BCvrnIf3_ofIbz3Jb5w |
| Cites_doi | 10.1007/978-3-642-33065-0_20 10.1109/ICPP.1999.797428 10.1145/2834050.2834095 10.1016/j.cie.2017.04.021 10.1109/ICTAI.2013.100 10.1016/S0305-0548(00)00082-4 10.1007/978-3-662-43948-7_36 10.1016/j.cor.2006.10.021 10.1137/0207001 10.1145/3352700.3352713 10.3390/electronics8020134 10.1016/S0377-2217(99)00357-4 10.1109/12.8704 10.1007/978-3-319-08422-0_127 10.1016/j.disopt.2005.01.002 10.1109/TCYB.2019.2954181 10.1016/j.ejor.2007.06.032 10.1007/s10878-017-0140-2 10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00181 10.1007/978-3-540-74450-4_1 10.1137/0222004 10.1002/(SICI)1099-0526(199711/12)3:2<52::AID-CPLX12>3.0.CO;2-R 10.1016/j.ifacol.2015.06.129 10.1007/s11518-018-5387-3 |
| ContentType | Journal Article |
| DBID | AAYXX CITATION ABGEM ADTPV AOWAS D8T DF7 ZZAVC |
| DOI | 10.2298/CSIS211001008H |
| DatabaseName | CrossRef SWEPUB Mälardalens högskola full text SwePub SwePub Articles SWEPUB Freely available online SWEPUB Mälardalens högskola SwePub Articles full text |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| EISSN | 2406-1018 |
| EndPage | 276 |
| ExternalDocumentID | oai_DiVA_org_mdh_62096 10_2298_CSIS211001008H |
| GroupedDBID | AAYXX ALMA_UNASSIGNED_HOLDINGS CITATION M~E ABGEM ADTPV AOWAS D8T DF7 ZZAVC |
| ID | FETCH-LOGICAL-c271t-de09c3ac7a46ce08b61b5e878404c8979f3bb7d6c675ac8c1d4446fe6bc55bed3 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000935481500017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1820-0214 |
| IngestDate | Thu Oct 30 11:22:41 EDT 2025 Sat Nov 29 03:58:36 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | http://creativecommons.org/licenses/by-nc-nd/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c271t-de09c3ac7a46ce08b61b5e878404c8979f3bb7d6c675ac8c1d4446fe6bc55bed3 |
| OpenAccessLink | https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-62096 |
| PageCount | 26 |
| ParticipantIDs | swepub_primary_oai_DiVA_org_mdh_62096 crossref_primary_10_2298_CSIS211001008H |
| PublicationCentury | 2000 |
| PublicationDate | 2023-00-00 2023 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – year: 2023 text: 2023-00-00 |
| PublicationDecade | 2020 |
| PublicationTitle | Computer Science and Information Systems |
| PublicationYear | 2023 |
| References | ref13 ref12 ref15 ref14 ref31 ref30 ref11 ref10 ref32 ref2 ref1 ref17 ref16 ref19 ref18 ref24 ref23 ref26 ref25 ref20 ref22 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref1 – ident: ref15 doi: 10.1007/978-3-642-33065-0_20 – ident: ref5 – ident: ref16 doi: 10.1109/ICPP.1999.797428 – ident: ref31 doi: 10.1145/2834050.2834095 – ident: ref27 doi: 10.1016/j.cie.2017.04.021 – ident: ref14 doi: 10.1109/ICTAI.2013.100 – ident: ref10 doi: 10.1016/S0305-0548(00)00082-4 – ident: ref9 doi: 10.1007/978-3-662-43948-7_36 – ident: ref19 doi: 10.1016/j.cor.2006.10.021 – ident: ref6 doi: 10.1137/0207001 – ident: ref24 doi: 10.1145/3352700.3352713 – ident: ref30 doi: 10.3390/electronics8020134 – ident: ref13 doi: 10.1016/S0377-2217(99)00357-4 – ident: ref18 doi: 10.1109/12.8704 – ident: ref23 doi: 10.1007/978-3-319-08422-0_127 – ident: ref22 doi: 10.1016/j.disopt.2005.01.002 – ident: ref11 – ident: ref32 doi: 10.1109/TCYB.2019.2954181 – ident: ref17 doi: 10.1016/j.ejor.2007.06.032 – ident: ref4 – ident: ref2 – ident: ref29 doi: 10.1007/s10878-017-0140-2 – ident: ref3 doi: 10.1109/ISPA-BDCloud-SocialCom-SustainCom51426.2020.00181 – ident: ref21 – ident: ref7 doi: 10.1007/978-3-540-74450-4_1 – ident: ref20 doi: 10.1137/0222004 – ident: ref26 doi: 10.1002/(SICI)1099-0526(199711/12)3:2<52::AID-CPLX12>3.0.CO;2-R – ident: ref25 doi: 10.1016/j.ifacol.2015.06.129 – ident: ref8 – ident: ref28 doi: 10.1007/s11518-018-5387-3 – ident: ref12 |
| SSID | ssib044733446 |
| Score | 2.2463884 |
| Snippet | The greater the number of devices on a network, the higher load in the network, the more chance of a collision occurring, and the longer it takes to transmit a... |
| SourceID | swepub crossref |
| SourceType | Open Access Repository Index Database |
| StartPage | 251 |
| SubjectTerms | industrial control networking network performance packing algorithms |
| Title | Multi-constrained network occupancy optimization |
| URI | https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-62096 |
| Volume | 20 |
| WOSCitedRecordID | wos000935481500017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2406-1018 dateEnd: 99991231 omitProxy: false ssIdentifier: ssib044733446 issn: 1820-0214 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV27TsMwFLV4DSwIBIi3MoCYAnk4foyoFJWlIBUQW2Q7DlSiKSotAga-nevYDQkwwMASVW7UpD7OyT1XvucitE-zDGMulc8JxSBQ4tAX1PQ3iSglXMQhUXnZbIJ2u-z2ll-6ZpxPZTsBWhTs5YU__ivUMAZgm9LZP8Bd_SgMwGcAHY4AOxx_BXxZUusrE_eZ9g8QUHbtVm_nKGxKLS-AKAauArMenk57PFSPvN0tXFU4NgzOS9566D8MgWxKijmqstACVoAb7VajPa3gHSeKiV0jEiZj8hmJvr4NxH0mnvs2I9s5qucjbLGwI0-IJnzjwVZnV5fPqK8iR5XWaPYrhUcRN2UJrd55z2jTwJgPdT5fVg1b7NP-zUk6HN2lg-w-JRGosVk0H1HQSGYP53t7SiwY0zjGttJseo_WwNNc7bh5rUaA0rCPLUOOq2W05LSCd2IxXkEzulhFwTd8PYevV-Hr1fFdQ9dn7atWx3dtL3wV0XDsZzrgKhaKCkyUDpgkoUw0oyDFsWKc8jyWkmZEgdYTiqkQnjZMck2kShKps3gdzRXDQm8gTxIIPlgO3ycE5wHhLMqSEBQsZzyJI7aJDqf_NX207iYpqEIzK2lzVjbRgZ2K6ryfAdj65XnbaNEsHpvM2kFz49FE76IF9TzuP432SvQ-AGyjVms |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multi-constrained+Network+Occupancy+Optimization&rft.jtitle=Computer+Science+and+Information+Systems&rft.au=Halilovic%2C+A.&rft.au=Zaimovic%2C+N.&rft.au=Seceleanu%2C+Tiberiu&rft.au=Feyzmahdavian%2C+H.&rft.date=2023&rft.issn=1820-0214&rft.volume=29&rft.issue=1&rft.spage=251&rft_id=info:doi/10.2298%2FCSIS211001008H&rft.externalDocID=oai_DiVA_org_mdh_62096 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1820-0214&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1820-0214&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1820-0214&client=summon |