Distributed Heuristic Algorithm for Migration and Replication of Self-organized Services in Future Networks

Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the n...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Majallat Baghdād lil-ʻulūm Ročník 19; číslo 6; s. 1335
Hlavní autori: AL-jabr, Manar, Diab, Ali, AL-Diab, Jomana
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: University of Baghdad, College of Science for Women 01.12.2022
Predmet:
Communication Cost, Heuristic, Migration, Replication, Service Placement
ISSN:2078-8665, 2411-7986
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject area is the optimal self-organized service placement. In this paper a heuristic-based algorithm for service placement in future networks was presented. This algorithm achieves the ideal placement of services replicas by monitoring the load within the server and its neighborhood, choosing the node that contributes with the highest received load, and finally replicating or migrating the service to it based on specific criteria, so that the distance of requests coming from clients becomes as small as possible because of placing services within nearby locations. It was proved that our proposed algorithm achieves an improved performance by meeting the services within a shorter time, a smaller bandwidth, and thus a lower communication cost. It was compared with the traditional client-server approach and the random placement algorithm. Experimental results showed that the heuristic algorithm outperforms other approaches and meets the optimal performance with different network sizes and varying load scenarios.
AbstractList Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject area is the optimal self-organized service placement. In this paper a heuristic-based algorithm for service placement in future networks was presented. This algorithm achieves the ideal placement of services replicas by monitoring the load within the server and its neighborhood, choosing the node that contributes with the highest received load, and finally replicating or migrating the service to it based on specific criteria, so that the distance of requests coming from clients becomes as small as possible because of placing services within nearby locations. It was proved that our proposed algorithm achieves an improved performance by meeting the services within a shorter time, a smaller bandwidth, and thus a lower communication cost. It was compared with the traditional client-server approach and the random placement algorithm. Experimental results showed that the heuristic algorithm outperforms other approaches and meets the optimal performance with different network sizes and varying load scenarios.
Author AL-jabr, Manar
AL-Diab, Jomana
Diab, Ali
Author_xml – sequence: 1
  givenname: Manar
  surname: AL-jabr
  fullname: AL-jabr, Manar
– sequence: 2
  givenname: Ali
  orcidid: 0000-0001-7718-7924
  surname: Diab
  fullname: Diab, Ali
– sequence: 3
  givenname: Jomana
  surname: AL-Diab
  fullname: AL-Diab, Jomana
BookMark eNo9kMtOwzAQRS0EEqV0y9o_kOJHYsfLilcrFZAorC0_i9s0RnYCgq8nbRGrmTuLo7nnApy2sXUAXGE0JRgTeq3zZkoQIVNGaX0CRqTEuOCiZqfDjnhd1IxV52CSc9AIl1hgQtgIbG9D7lLQfecsnLs-DTEYOGvWMYXufQd9TPAxrJPqQmyhai18cR9NMMccPVy5xhcxrVUbfgbGyqXPYFyGoYX3fdcnB59c9xXTNl-CM6-a7CZ_cwze7u9eb-bF8vlhcTNbFoYi1BVcc-M5tqgknpWCYGMcN8KakhFkFPZVba2hQ2tnleLUW6S1oqzSXGjEFB2DxZFro9rIjxR2Kn3LqII8HIZfpUpDy8ZJymhZ6cpyxXxZ21qpiojaCVI5wwQWA2t6ZJkUc07O__MwkgfzcjAv9-bl3jz9BVJPepY
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.21123/bsj.2022.6338
DatabaseName CrossRef
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 2411-7986
ExternalDocumentID oai_doaj_org_article_36345b5d7a6f48d8aa5298e925ec6919
10_21123_bsj_2022_6338
GroupedDBID .4S
AAYXX
ADBBV
AFWDF
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
H13
GROUPED_DOAJ
ID FETCH-LOGICAL-c300t-7b7cf71d042f64921cce7c9dc4620ca1f58ddc3112edaa73fd0bba365b79b06a3
IEDL.DBID DOA
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000922621600018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2078-8665
IngestDate Fri Oct 03 12:50:59 EDT 2025
Sat Nov 29 08:06:24 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License http://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c300t-7b7cf71d042f64921cce7c9dc4620ca1f58ddc3112edaa73fd0bba365b79b06a3
ORCID 0000-0001-7718-7924
OpenAccessLink https://doaj.org/article/36345b5d7a6f48d8aa5298e925ec6919
ParticipantIDs doaj_primary_oai_doaj_org_article_36345b5d7a6f48d8aa5298e925ec6919
crossref_primary_10_21123_bsj_2022_6338
PublicationCentury 2000
PublicationDate 2022-12-01
PublicationDateYYYYMMDD 2022-12-01
PublicationDate_xml – month: 12
  year: 2022
  text: 2022-12-01
  day: 01
PublicationDecade 2020
PublicationTitle Majallat Baghdād lil-ʻulūm
PublicationYear 2022
Publisher University of Baghdad, College of Science for Women
Publisher_xml – name: University of Baghdad, College of Science for Women
SSID ssib014191226
ssj0002013441
ssib044752010
ssib012089588
ssib060617717
Score 2.2095823
Snippet Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating...
SourceID doaj
crossref
SourceType Open Website
Index Database
StartPage 1335
SubjectTerms Communication Cost, Heuristic, Migration, Replication, Service Placement
Title Distributed Heuristic Algorithm for Migration and Replication of Self-organized Services in Future Networks
URI https://doaj.org/article/36345b5d7a6f48d8aa5298e925ec6919
Volume 19
WOSCitedRecordID wos000922621600018&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: 2411-7986
  dateEnd: 20241231
  omitProxy: false
  ssIdentifier: ssib060617717
  issn: 2078-8665
  databaseCode: DOA
  dateStart: 20040101
  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: 2411-7986
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044752010
  issn: 2078-8665
  databaseCode: M~E
  dateStart: 20090101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T-QwELYQoqBBIA7xOJALpKsCid8uea1oWJ10h0QX-QnLcVm0u1BcwW9nbG8gHc01kRJFI_vLl8yMPfkGoWPgjHNesMoAOyqmAq-MdqqC0EgT4rWJLOZmE3I8Vnd3-ueg1VeqCSvywAW4Uyoo45Z7aURkyitjONEqaMKDEzoLfpJa6kEyBUxqSK00_xTiahikJYNAI6ncpW3g_lwkR94nNo95e66hLLe9BOMwciF4UXyEfInQUzt_hNSSkBNB048tA482EP7PHmq0iTaWoSU-K1PaQiuh20Z_LpMybmpqFTy-Di9FmBmfPd1PZ5PFw18MQSu-mdwXImDTeQwxeb-Sh6cR_wpPsSrNn_6Bjf7jgicdHmVBEjwupeTzb-h2dPX74rpaNlioHK3rRSVtEiVqPLy4UTBN4LEF6bR3TJDamSZy5b2jMOXgjZE0-tpaQwW3UgNohu6g1W7ahV2EPdFROG-BEpJZ4XSI0cuGSwshlqLNHvrRg9Q-Fx2NFvKPDGcLcLYJzjbBuYfOE4YfdyX963wBZtouWdF-xYr9_2HkAK2nUZXile9odTF7CYdozb0uJvPZUSYcHG_ert4BA5LVLQ
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=Distributed+Heuristic+Algorithm+for+Migration+and+Replication+of+Self-organized+Services+in+Future+Networks&rft.jtitle=Majallat+Baghd%C4%81d+lil-%CA%BBul%C5%ABm&rft.au=AL-jabr%2C+Manar&rft.au=Diab%2C+Ali&rft.au=AL-Diab%2C+Jomana&rft.date=2022-12-01&rft.issn=2078-8665&rft.eissn=2411-7986&rft.volume=19&rft.issue=6&rft.spage=1335&rft_id=info:doi/10.21123%2Fbsj.2022.6338&rft.externalDBID=n%2Fa&rft.externalDocID=10_21123_bsj_2022_6338
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2078-8665&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2078-8665&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2078-8665&client=summon