Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications

In this paper, we consider the problem of minimising the cost of data transmission as a function of the capacity of telecommunication links. To solve this problem, we first formulated a mathematical model, and then we designed and developed a software that enables the optimisation of the given or ra...

Full description

Saved in:
Bibliographic Details
Published in:Promet Vol. 36; no. 4; pp. 608 - 622
Main Authors: MLADENOVIĆ, Snežana, STEFANOVIĆ, Ivana, JANKOVIĆ, Slađana, UZELAC, Ana, MARKOVIĆ, Goran, ZDRAVKOVIĆ, Stefan
Format: Journal Article
Language:English
Published: Sveučilište u Zagrebu Fakultet prometnih znanosti 01.01.2024
University of Zagreb, Faculty of Transport and Traffic Sciences
Subjects:
ISSN:0353-5320, 1848-4069
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In this paper, we consider the problem of minimising the cost of data transmission as a function of the capacity of telecommunication links. To solve this problem, we first formulated a mathematical model, and then we designed and developed a software that enables the optimisation of the given or randomly generated telecommunications network. Declarative programming is a good choice for optimisation problems because it is enough to specify only the relations that must be satisfied, without giving any effective procedure for finding the values for the decision variables. To test the application, we developed a software that randomly generates a telecommunications network that meets the given requirements. This enables us to test the application on an arbitrary number of different telecommunication networks with different numbers of nodes and links, and analyse the impact of changing network parameters on the flow and results of the optimisation. As telecommunications networks operate in conditions of uncertainty, the subject of special analysis was the potential failure of some of the network links. The paper presents and thoroughly analyses the optimisation results for several selected networks, as well as summary results for a number of telecommunications networks.
AbstractList In this paper, we consider the problem of minimising the cost of data transmission as a function of the capacity of telecommunication links. To solve this problem, we first formulated a mathematical model, and then we designed and developed a software that enables the optimisation of the given or randomly generated telecommunications network. Declarative programming is a good choice for optimisation problems because it is enough to specify only the relations that must be satisfied, without giving any effective procedure for finding the values for the decision variables. To test the application, we developed a software that randomly generates a telecommunications network that meets the given requirements. This enables us to test the application on an arbitrary number of different telecommunication networks with different numbers of nodes and links, and analyse the impact of changing network parameters on the flow and results of the optimisation. As telecommunications networks operate in conditions of uncertainty, the subject of special analysis was the potential failure of some of the network links. The paper presents and thoroughly analyses the optimisation results for several selected networks, as well as summary results for a number of telecommunications networks.
Author MARKOVIĆ, Goran
MLADENOVIĆ, Snežana
ZDRAVKOVIĆ, Stefan
UZELAC, Ana
JANKOVIĆ, Slađana
STEFANOVIĆ, Ivana
Author_xml – sequence: 1
  givenname: Snežana
  surname: MLADENOVIĆ
  fullname: MLADENOVIĆ, Snežana
– sequence: 2
  givenname: Ivana
  orcidid: 0000-0002-8025-8970
  surname: STEFANOVIĆ
  fullname: STEFANOVIĆ, Ivana
– sequence: 3
  givenname: Slađana
  surname: JANKOVIĆ
  fullname: JANKOVIĆ, Slađana
– sequence: 4
  givenname: Ana
  surname: UZELAC
  fullname: UZELAC, Ana
– sequence: 5
  givenname: Goran
  surname: MARKOVIĆ
  fullname: MARKOVIĆ, Goran
– sequence: 6
  givenname: Stefan
  surname: ZDRAVKOVIĆ
  fullname: ZDRAVKOVIĆ, Stefan
BookMark eNp1kU9PAjEQxRuDiYgcve8XWOxu_-7REFESFA94btpuVyu7lLRFwre3LEajiaeZvPzmZWbeJRhs3MYAcF3ACUOQ3WxjnHwgavGEMHYGhgXHPMeQVgMwhIignKASXoBxCFZBxCEjsMBDsJq6ELPlNtrOBhmt22Qr59qscT573LXRatd1rrbxkD2ZuHd-nc1at8-evVOt6TKbeNOaI7XbWN07hCtw3sg2mPFXHYGX2d1q-pAvlvfz6e0i12mBmDZSnMGqMqowRGJealpo1dBG8oYn2dC6RpVimMKa0Boilqos6wLzShtUoRGYn3xrJ9_F1ttO-oNw0opecP5VSJ9OaI2QlCJKSmRKUmKucSVxBYlSWCHekFIlr_zk9ea1XP8yOynBa5Nakd5YsuKH196F4E3zPVJAcUxEpEREn4hIiSQe_eG1jf27ope2_WfqE6NslEU
CODEN POMEEZ
CitedBy_id crossref_primary_10_3390_su16198352
ContentType Journal Article
DBID AAYXX
CITATION
VP8
DOA
DOI 10.7307/ptt.v36i4.577
DatabaseName CrossRef
Portal of Croatian Scientific and Professional Journals – HRČAK
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef


Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
EISSN 1848-4069
EndPage 622
ExternalDocumentID oai_doaj_org_article_a6636523e25248c49a4905bb4b38f52b
oai_hrcak_srce_hr_320271
10_7307_ptt_v36i4_577
GroupedDBID 5VS
AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
GROUPED_DOAJ
KQ8
VP8
IPNFZ
M~E
RIG
ID FETCH-LOGICAL-c380t-53b87099eb1e5a482c61cbf6fa8f899ee6dd39b7460d56d0370d5a2d1489ce393
IEDL.DBID DOA
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001299861500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0353-5320
IngestDate Fri Oct 03 12:32:13 EDT 2025
Wed Aug 28 04:10:12 EDT 2024
Sat Nov 29 01:33:59 EST 2025
Tue Nov 18 22:34:57 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
License https://creativecommons.org/licenses/by-nc/4.0
cc-by: openAccess
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c380t-53b87099eb1e5a482c61cbf6fa8f899ee6dd39b7460d56d0370d5a2d1489ce393
Notes 320271
ORCID 0000-0002-8025-8970
OpenAccessLink https://doaj.org/article/a6636523e25248c49a4905bb4b38f52b
PageCount 15
ParticipantIDs doaj_primary_oai_doaj_org_article_a6636523e25248c49a4905bb4b38f52b
hrcak_primary_oai_hrcak_srce_hr_320271
crossref_primary_10_7307_ptt_v36i4_577
crossref_citationtrail_10_7307_ptt_v36i4_577
PublicationCentury 2000
PublicationDate 2024-01-01
PublicationDateYYYYMMDD 2024-01-01
PublicationDate_xml – month: 01
  year: 2024
  text: 2024-01-01
  day: 01
PublicationDecade 2020
PublicationTitle Promet
PublicationYear 2024
Publisher Sveučilište u Zagrebu Fakultet prometnih znanosti
University of Zagreb, Faculty of Transport and Traffic Sciences
Publisher_xml – name: Sveučilište u Zagrebu Fakultet prometnih znanosti
– name: University of Zagreb, Faculty of Transport and Traffic Sciences
SSID ssib038075014
ssib002808337
ssib036260299
ssj0001862430
ssib023170004
ssib044757108
Score 2.2733612
SecondaryResourceType review_article
Snippet In this paper, we consider the problem of minimising the cost of data transmission as a function of the capacity of telecommunication links. To solve this...
SourceID doaj
hrcak
crossref
SourceType Open Website
Open Access Repository
Enrichment Source
Index Database
StartPage 608
SubjectTerms capacity of telecommunication links
data transmission cost optimisation
declarative programming
link failure
network flow
Title Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications
URI https://hrcak.srce.hr/320271
https://doaj.org/article/a6636523e25248c49a4905bb4b38f52b
Volume 36
WOSCitedRecordID wos001299861500003&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: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1848-4069
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001862430
  issn: 0353-5320
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1848-4069
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044757108
  issn: 0353-5320
  databaseCode: M~E
  dateStart: 20120101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T-QwELYQoqA53QkQ3HEnF4iKgNdvl4BuRbVQLBJd5KduxbJBuwH-PuM4sKFANFclika2PBnPw4_vQ-goJE81Ca5SwZiKi8gqC3lr5axjEuKVs4l3ZBNqMtF3d-ZmQPWVz4QVeOCiuDMLIVFCtRSpoFx7biw3RDjHHdNJUJe9L1FmUEz1-4WarQMvJDGKDHDcMwYLoetEPKOui8F-YkbBg9Cr16s1-R5FR1xCmGBVZlMogJ0wQdTZYwvOhMkZPxVKfQhwHQ8A5L3_lt7eDwLX-Dv61mec-LyM9AfaiIsdNL1sVi2-Bn_x0J_nwdOmmWNIYXF3JxcM8aEJkKLjSTkojsfz5gXfFP4ZPAP5zKAzvF6y2kW347_Ty6uqJ1ioPIy4hWE4mK7GgL-OwnJNvRx5l2SyOkEdFqMMgRmnuCRByECYgqelAUoo4yMzbA9tLppF3EdYj0YuUEqS5JozFgxzMLODiVDj8UTTATp500rte_TxTIIxr6EKyUqsQYl1p8QalHiAjt_FHwvsxmeCF1nF70IZLbv7ADZU9zZUf2VD0Fv3gz60Ur6slj7Ca51p5tXo5__o7RfahsZ4Wcc5RJvt8in-Rlv-uZ2tln86O34FYSzuZg
linkProvider Directory of Open Access Journals
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=Cost+Optimisation+Tool+for+Multicommodity+Network+Flow+Problem+in+Telecommunications&rft.jtitle=Promet&rft.au=MLADENOVI%C4%86%2C+Sne%C5%BEana&rft.au=STEFANOVI%C4%86%2C+Ivana&rft.au=JANKOVI%C4%86%2C+Sla%C4%91ana&rft.au=UZELAC%2C+Ana&rft.date=2024-01-01&rft.issn=0353-5320&rft.eissn=1848-4069&rft.volume=36&rft.issue=4&rft.spage=608&rft.epage=622&rft_id=info:doi/10.7307%2Fptt.v36i4.577&rft.externalDBID=n%2Fa&rft.externalDocID=10_7307_ptt_v36i4_577
thumbnail_s http://cvtisr.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fhrcak.srce.hr%2Flogo_broj%2F24815.jpg