Delay-optimal Congestion-aware Routing and Computation Offloading in Arbitrary Network
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915346825347072 |
|---|---|
| author | Zhang, Jinkun Liu, Yuezhou Yeh, Edmund |
| author_facet | Zhang, Jinkun Liu, Yuezhou Yeh, Edmund |
| contents | Emerging edge computing paradigms enable heterogeneous devices to collaborate on complex computation applications. However, for arbitrary heterogeneous edge networks, delay-optimal forwarding and computation offloading remains an open problem. In this paper, we jointly optimize data/result routing and computation placement in arbitrary networks with heterogeneous node capabilities, and congestion-dependent nonlinear transmission and processing delay. Despite the non-convexity of the formulated problem, based on analyzing the KKT condition, we provide a set of sufficient optimality conditions that solve the problem globally. To provide the insights for such global optimality, we show that the proposed non-convex problem is geodesic-convex with mild assumptions. We also show that the proposed sufficient optimality condition leads to a lower hemicontinuous solution set, providing stability against user-input perturbation. We then extend the framework to incorporate utility-based congestion control and fairness. A fully distributed algorithm is developed to converge to the global optimum. Numerical results demonstrate significant improvements over multiple baselines algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_13626 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Delay-optimal Congestion-aware Routing and Computation Offloading in Arbitrary Network Zhang, Jinkun Liu, Yuezhou Yeh, Edmund Networking and Internet Architecture Emerging edge computing paradigms enable heterogeneous devices to collaborate on complex computation applications. However, for arbitrary heterogeneous edge networks, delay-optimal forwarding and computation offloading remains an open problem. In this paper, we jointly optimize data/result routing and computation placement in arbitrary networks with heterogeneous node capabilities, and congestion-dependent nonlinear transmission and processing delay. Despite the non-convexity of the formulated problem, based on analyzing the KKT condition, we provide a set of sufficient optimality conditions that solve the problem globally. To provide the insights for such global optimality, we show that the proposed non-convex problem is geodesic-convex with mild assumptions. We also show that the proposed sufficient optimality condition leads to a lower hemicontinuous solution set, providing stability against user-input perturbation. We then extend the framework to incorporate utility-based congestion control and fairness. A fully distributed algorithm is developed to converge to the global optimum. Numerical results demonstrate significant improvements over multiple baselines algorithms. |
| title | Delay-optimal Congestion-aware Routing and Computation Offloading in Arbitrary Network |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2506.13626 |