Task Value Aware Optimization of Routing for Computing Power Network

An appealing technology that merges computing and network resources to offer convergent services is the computing power network, which has attracted a lot of interest. In this paper, we study the task routing problem in the heterogeneous computing power network to minimize the loss of task value of...

Full description

Saved in:
Bibliographic Details
Published in:IEEE International Symposium on Broadband Multimedia Systems and Broadcasting pp. 1 - 6
Main Authors: Huang, Xiaoyao, Lei, Bo, Wei, Min, Ji, Guoliang, Lv, Hang
Format: Conference Proceeding
Language:English
Published: IEEE 14.06.2023
Subjects:
Broadcasting
Complexity theory
Computational modeling
Computing Power Network
Directed graphs
Heterogeneous networks
Programming
Routing
Task Routing
Task Value Model
ISSN:2155-5052
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract An appealing technology that merges computing and network resources to offer convergent services is the computing power network, which has attracted a lot of interest. In this paper, we study the task routing problem in the heterogeneous computing power network to minimize the loss of task value of the system. We first formulate the problem as a mixed integer nonlinear programming problem (MINP). To solve the problem, we propose a task Value aware Ant Colony algorithm(VACO) and deduced the complexity of the algorithm. The proposed algorithm VACO searches for optimal traversal in the directed graph by multiple ants for multiple rounds based on the designed task value aware pheromone concentration and transition probability function to achieve the minimum value loss routing scheme. Finally, the proposed algorithm's excellent performance was demonstrated through comprehensive simulations conducted in the end.
AbstractList An appealing technology that merges computing and network resources to offer convergent services is the computing power network, which has attracted a lot of interest. In this paper, we study the task routing problem in the heterogeneous computing power network to minimize the loss of task value of the system. We first formulate the problem as a mixed integer nonlinear programming problem (MINP). To solve the problem, we propose a task Value aware Ant Colony algorithm(VACO) and deduced the complexity of the algorithm. The proposed algorithm VACO searches for optimal traversal in the directed graph by multiple ants for multiple rounds based on the designed task value aware pheromone concentration and transition probability function to achieve the minimum value loss routing scheme. Finally, the proposed algorithm's excellent performance was demonstrated through comprehensive simulations conducted in the end.
Author Ji, Guoliang
Lv, Hang
Lei, Bo
Wei, Min
Huang, Xiaoyao
Author_xml – sequence: 1
  givenname: Xiaoyao
  surname: Huang
  fullname: Huang, Xiaoyao
  email: huangxy32@chinatelecom.cn
  organization: Research Institute China Telecom,Network Technology Institute,Beijing,China
– sequence: 2
  givenname: Bo
  surname: Lei
  fullname: Lei, Bo
  email: leibo@chinatelecom.cn
  organization: Research Institute China Telecom,Network Technology Institute,Beijing,China
– sequence: 3
  givenname: Min
  surname: Wei
  fullname: Wei, Min
  email: weim6@chinatelecom.cn
  organization: Research Institute China Telecom,Network Technology Institute,Beijing,China
– sequence: 4
  givenname: Guoliang
  surname: Ji
  fullname: Ji, Guoliang
  email: jiguoliang15@mails.ucas.ac.cn
  organization: China Ordnance Industries,No.208 Research Institute,Beijing,China
– sequence: 5
  givenname: Hang
  surname: Lv
  fullname: Lv, Hang
  email: lvhang@chinatelecom.cn
  organization: Research Institute China Telecom,Network Technology Institute,Beijing,China
BookMark eNo1j81Og0AUhUejibXyBibOC4Az9zLALFv8Tao1Wt02A9wxYwvTAA3Rp5ekejZfzubLOefspPENMXYlRSSl0Nfzp7e5yjDREQjASAqQUip9xAKd6gyVQJAK4mM2GalCJRScsaDrvsQY1AoxnrCblek2_MNs98Rng2mJL3e9q92P6Z1vuLf81e9713xy61ue-3p3aC9-oJY_Uz_4dnPBTq3ZdhT8ccre725X-UO4WN4_5rNF6KTUfVgV1mRI2ljESoEEVVJFRWoNJDopLWgaRypjoCripCpNAqUWMYqUYgmlwim7PHgdEa13ratN-73-P46_hWhPJg
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/BMSB58369.2023.10211159
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9798350321524
EISSN 2155-5052
EndPage 6
ExternalDocumentID 10211159
Genre orig-research
GrantInformation_xml – fundername: Research and Development
  funderid: 10.13039/100006190
GroupedDBID 6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-i119t-dbfa83e9af33d52125cedeb7fa2696cf29e5055aa2db46dca62c904307e412c53
IEDL.DBID RIE
IngestDate Wed Aug 27 02:18:33 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i119t-dbfa83e9af33d52125cedeb7fa2696cf29e5055aa2db46dca62c904307e412c53
PageCount 6
ParticipantIDs ieee_primary_10211159
PublicationCentury 2000
PublicationDate 2023-June-14
PublicationDateYYYYMMDD 2023-06-14
PublicationDate_xml – month: 06
  year: 2023
  text: 2023-June-14
  day: 14
PublicationDecade 2020
PublicationTitle IEEE International Symposium on Broadband Multimedia Systems and Broadcasting
PublicationTitleAbbrev BMSB
PublicationYear 2023
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0000395334
Score 2.222494
Snippet An appealing technology that merges computing and network resources to offer convergent services is the computing power network, which has attracted a lot of...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Broadcasting
Complexity theory
Computational modeling
Computing Power Network
Directed graphs
Heterogeneous networks
Programming
Routing
Task Routing
Task Value Model
Title Task Value Aware Optimization of Routing for Computing Power Network
URI https://ieeexplore.ieee.org/document/10211159
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELZoxQALryLe8sDqNokTOx4pULFQKlFQt8qPs1QBDeoD_j6-JC0wMLDZli1ZZ8l3uvu--wi5DIveRcIzCO6FBQ_lmdYGWG6w_Rook0tTik3Ifj8fjdSgJquXXBgAKMFn0MZhWct3hV1iqqyDMtQhglEN0pBSVGStdUIl4oiUTGsMVxypTvf-sZvlXCAfJeHt1elfOiqlG-nt_PMCu6T1Tcijg7Wr2SMbMN0n2z96CR6Qm6Gev9Bn_boEevWpZ0Afwm_wVtMsaeEpgn_CVhrCVFqJOeBsgDJptF-hwVvkqXc7vL5jtUQCm8SxWjBnvM6DSbXn3CENN7PgwEivE6GE9YmCEOJkWifOpMJZLRKrsM2XhDRObMYPSXNaTOGI0NgIrpUASCKXei10brGIa60Ej5T5Y9JCg4zfqy4Y45UtTv5YPyVbaHaEVcXpGWkuZks4J5v2YzGZzy7Kt_sCBcibOQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aBfXiq-LbHLxuu5vdzW6OVi0V27Vgld5KHhMoait96N83s7utevDgLRkSCBPIDJnvm4-QS2e0xufWAxdePBehrCelAi9V2H4NhEoTlYtNJFmW9vuiW5LVcy4MAOTgM6jhMK_lm7Ge41dZHWWoXQYjVslaHEXML-hayy8VP0SsZFSiuAJf1Budx0achhwZKSysLfb_UlLJA0lz-59H2CHVb0oe7S6DzS5ZgdEe2frRTXCf3PTk9IU-y9c50KtPOQH64N6Dt5JoSceWIvzHLaUuUaWFnAPOuiiURrMCD14lT83b3nXLK0USvGEQiJlnlJWpc6q0YWiQiBtrMKASKxkXXFsmwCU5sZTMqIgbLTnTAht9JRAFTMfhAamMxiM4JDRQPJSCAzDfRFZymWos42qdgEXS_BGpokMG70UfjMHCF8d_2C_IRqvXaQ_ad9n9CdnEK0CQVRCdkspsMoczsq4_ZsPp5Dy_xy9KDJ6A
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%3Abook&rft.genre=proceeding&rft.title=IEEE+International+Symposium+on+Broadband+Multimedia+Systems+and+Broadcasting&rft.atitle=Task+Value+Aware+Optimization+of+Routing+for+Computing+Power+Network&rft.au=Huang%2C+Xiaoyao&rft.au=Lei%2C+Bo&rft.au=Wei%2C+Min&rft.au=Ji%2C+Guoliang&rft.date=2023-06-14&rft.pub=IEEE&rft.eissn=2155-5052&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FBMSB58369.2023.10211159&rft.externalDocID=10211159