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...

Full description

Saved in:
Bibliographic Details
Published in:ICT express Vol. 10; no. 3; pp. 614 - 619
Main Authors: Ding, Hongqing, He, Fujun, Zhang, Pengfei, Zhang, Liang, Zhang, Xiaoxiao, Qi, Meiyu
Format: Journal Article
Language:English
Published: Elsevier B.V 01.06.2024
Elsevier
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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