SearcharxivSearch

arXiv subjects

Yejin Yang

Publications and source records attributed to Yejin Yang.

2 recordsLinked to original sources

A Novel Node Selection Method in Wireless Distributed Edge Storage Based on SDN and Multi-attribute Decision Model

The distributed edge storage system can store data collected at the edge of the network in a decentralised manner, with low latency, high security, and flexibility. Traditional edge-distributed storage systems only consider one single factor, such as node capacity, when storing data, ignoring network and storage node load conditions that affecting the system's read/write performance. At the same time, it could be more scalable in the widely used wireless terminal application scenarios. To tackle these challenges, this paper proposes an innovative software-defined edge storage architecture based on SDN (Software-Defined Networking) and SMB (Server Message Block) protocols, A data storage node selection algorithm that integrates the network state and storage node load state is designed based on multi-attribute decision model, and a system prototype is realised in conjunction with 5G wireless communication technology. Experimental results demonstrate significant improvements in the performance of high-load write operations compared to traditional edge-distributed storage systems. The proposed wireless distributed edge storage system also demonstrates superior scalability and adaptability, effectively addressing the challenge of limited system scalability and improving compatibility with edge scenarios in mobile applications. In addition, it results in cost savings in hardware deployment and presents a promising advancement in edge storage technology.

cs.NI

DHRL-FNMR: An Intelligent Multicast Routing Approach Based on Deep Hierarchical Reinforcement Learning in SDN

The optimal multicast tree problem in the Software-Defined Networking (SDN) multicast routing is an NP-hard combinatorial optimization problem. Although existing SDN intelligent solution methods, which are based on deep reinforcement learning, can dynamically adapt to complex network link state changes, these methods are plagued by problems such as redundant branches, large action space, and slow agent convergence. In this paper, an SDN intelligent multicast routing algorithm based on deep hierarchical reinforcement learning is proposed to circumvent the aforementioned problems. First, the multicast tree construction problem is decomposed into two sub-problems: the fork node selection problem and the construction of the optimal path from the fork node to the destination node. Second, based on the information characteristics of SDN global network perception, the multicast tree state matrix, link bandwidth matrix, link delay matrix, link packet loss rate matrix, and sub-goal matrix are designed as the state space of intrinsic and meta controllers. Then, in order to mitigate the excessive action space, our approach constructs different action spaces at the upper and lower levels. The meta-controller generates an action space using network nodes to select the fork node, and the intrinsic controller uses the adjacent edges of the current node as its action space, thus implementing four different action selection strategies in the construction of the multicast tree. To facilitate the intelligent agent in constructing the optimal multicast tree with greater speed, we developed alternative reward strategies that distinguish between single-step node actions and multi-step actions towards multiple destination nodes.

cs.AI