Optimal routing and heterogeneous resource allocation for computing-aware networks

Computing-aware networking (CAN) is introduced to unite the computing resources distributed in different platforms. This paper proposes a joint routing and resource allocation model to minimize the total operational cost in CAN. We formulate the problem as an integer linear programming problem. We i...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	ICT express Ročník 10; číslo 3; s. 614 - 619
Hlavní autoři:	Ding, Hongqing, He, Fujun, Zhang, Pengfei, Zhang, Liang, Zhang, Xiaoxiao, Qi, Meiyu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.06.2024 Elsevier
Témata:	Computing-aware networking Network routing Resource allocation Software defined networking Computing-aware networking Software defined networking Network routing Resource allocation
ISSN:	2405-9595, 2405-9595
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	Computing-aware networking (CAN) is introduced to unite the computing resources distributed in different platforms. This paper proposes a joint routing and resource allocation model to minimize the total operational cost in CAN. We formulate the problem as an integer linear programming problem. We introduce a polynomial-time algorithm for larger-size problems. The numerical results reveal that the introduced algorithm reduces the computation time 9.18 times, with increasing the objective no more than 4% compared to the optimal solution; the proposed model can reduce 70% of the total cost compared to a baseline adopting a two-stage strategy in our examined cases.
ISSN:	2405-9595 2405-9595
DOI:	10.1016/j.icte.2024.01.004