The rapid growth of applications with diverse computational and network demands exacerbates challenges like uneven resource distribution and management complexity. The Computing Force Network (CFN) emerges to integrate the orchestration of computing and networking resources. Leveraging Software-Defined Networking (SDN), this paper proposes RL-CFR, a reinforcement learning-based multipath routing method that holistically considers both computational and network states. Within a Knowledge-Defined Networking (KDN) architecture, RL-CFR intelligently selects routes by evaluating service node computation status, flow latency, transmission rate, and packet loss. By utilizing SDN’s global control, RL-CFR precomputes and installs optimal paths. Experimental results demonstrate that RL-CFR significantly outperforms benchmarks in latency, link utilization, and packet loss, validating its effectiveness and practicality.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Multipath Routing Optimization Algorithm Based on SDN and Reinforcement Learning for Computing First Networks

  • Bin Guo,
  • Xiangyu Bai,
  • Haoran Cheng

摘要

The rapid growth of applications with diverse computational and network demands exacerbates challenges like uneven resource distribution and management complexity. The Computing Force Network (CFN) emerges to integrate the orchestration of computing and networking resources. Leveraging Software-Defined Networking (SDN), this paper proposes RL-CFR, a reinforcement learning-based multipath routing method that holistically considers both computational and network states. Within a Knowledge-Defined Networking (KDN) architecture, RL-CFR intelligently selects routes by evaluating service node computation status, flow latency, transmission rate, and packet loss. By utilizing SDN’s global control, RL-CFR precomputes and installs optimal paths. Experimental results demonstrate that RL-CFR significantly outperforms benchmarks in latency, link utilization, and packet loss, validating its effectiveness and practicality.