Welcome to Journal of University of Chinese Academy of Sciences,Today is

Journal of University of Chinese Academy of Sciences ›› 2025, Vol. 42 ›› Issue (2): 248-259.DOI: 10.7523/j.ucas.2023.044

• Research Articles • Previous Articles    

Flow aggregation with constrained resource for in-network computation

SHENG Jiahua, HONG Peilin, WANG Hang   

  1. Laboratory of Information Network, Department of Electronic Engineering and Information Science, University of Science and Technology of China, Hefei 230027, China
  • Received:2022-12-27 Revised:2023-04-27

Abstract: In-network computation can greatly reduce the traffic generated during many-to-one transmission by establishing aggregation trees to merge data streams at the aggregation nodes. In this paper, we consider finding the minimum-cost aggregation tree under the constraints of a given amount of resources and the capacity of switch nodes. Since this problem is an NP-hard problem, a linear integer programming model and a heuristic algorithm called greedy cost aggregation tree (GCAT) are given to solve it. Simulation results show that the GCAT algorithm can generate a tree with less cost and utilize the resource more efficiently than other heuristics, and the performance is close to the optimal solution for small-scale networks.

Key words: in-network computation, aggregation tree, resource allocation, linear integer programming (ILP), greedy cost aggregation tree (GCAT)

CLC Number: