CoTree:Borderless and decentralized server cooperation in edge computing.

Saved in:

Bibliographic Details
Title:	CoTree:Borderless and decentralized server cooperation in edge computing.
Authors:	YUAN, Xin¹, LI, Ning¹, GAO, Mingfeng², FANG, Shutong³, ZHANG, Zhaoxin¹, YU, Changli¹
Source:	Computer Engineering & Science / Jisuanji Gongcheng yu Kexue. May2026, Vol. 48 Issue 5, p810-827. 18p.
Subjects:	Edge computing, Distributed algorithms, Distributed computing, Capacity management (Computers), Resource allocation
Abstract:	In edge computing (EC), offloading tasks to edge servers or the cloud can significantly enhance system performance. However, due to the heterogeneous and dynamic traffic distribution in edge computing, it is challenging for a single edge server to provide satisfactory computing services anytime and anywhere. This issue has spurred research on collaboration among edge servers. Previous server cooperation algorithms have been limited by a one-hop cooperation area restriction. Even though some studies have extended the cooperation area to multiple hops, they still fail to support the core issue in edge computing, namely task offloading. This paper proposes a novel distributed, borderless server cooperation algorithm model called CoTree, which incorporates task offloading strategies. Its cooperation domain is unrestricted, with each server forming its own basic cooperation unit (BCU) and calculating its declared capacity based on the BCU. Additionally, it considers factors such as server computing capacity, processing delay, and the forwarding delay of tasks and computation results. Simulation results demonstrate that CoTree outperforms previous research efforts in terms of performance. [ABSTRACT FROM AUTHOR]
	Copyright of Computer Engineering & Science / Jisuanji Gongcheng yu Kexue is the property of Computer Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	In edge computing (EC), offloading tasks to edge servers or the cloud can significantly enhance system performance. However, due to the heterogeneous and dynamic traffic distribution in edge computing, it is challenging for a single edge server to provide satisfactory computing services anytime and anywhere. This issue has spurred research on collaboration among edge servers. Previous server cooperation algorithms have been limited by a one-hop cooperation area restriction. Even though some studies have extended the cooperation area to multiple hops, they still fail to support the core issue in edge computing, namely task offloading. This paper proposes a novel distributed, borderless server cooperation algorithm model called CoTree, which incorporates task offloading strategies. Its cooperation domain is unrestricted, with each server forming its own basic cooperation unit (BCU) and calculating its declared capacity based on the BCU. Additionally, it considers factors such as server computing capacity, processing delay, and the forwarding delay of tasks and computation results. Simulation results demonstrate that CoTree outperforms previous research efforts in terms of performance. [ABSTRACT FROM AUTHOR]
ISSN:	1007130X
DOI:	10.3969/j.issn.1007-130X.2026.05.006