DeViNE: A Decentralized Virtual Network Embedding Algorithm

2025-02-03

AI Summary

To address critical limitations of centralized virtual network embedding (VNE)—including poor scalability, single-point failure vulnerability, and susceptibility to denial-of-service (DoS) attacks—this paper proposes the first fully decentralized VNE framework. Our approach eliminates the central controller by integrating a dynamic multi-leader election mechanism with localized breadth-first search (BFS) for distributed virtual network request mapping. We further introduce a distributed cost-benefit evaluation model and an embedding result propagation protocol to ensure global consistency and resource efficiency. Experimental results demonstrate that the proposed framework improves virtual network request acceptance rate by 12% and increases the revenue-to-cost ratio by 21%, while significantly enhancing system robustness and resilience against DoS attacks. This work establishes a scalable, highly available, and attack-resilient VNE paradigm for large-scale network virtualization.

Technology Category

• Search and Optimization: Distributed Search
• Planning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
• Multiagent Systems: Distributed Problem Solving

Application Category

• Systems and Infrastructure for Web, Mobile and WoT: Virtualization and resource management in Web systems and infrastructures
• Graph Algorithms and Modeling for the Web: Graph embeddings and representation learning for Web-related graphs
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

Virtual Network Embedding (VNE) is a technique for mapping virtual networks onto a physical network infrastructure, enabling multiple virtual networks to coexist on a shared physical network. Previous works focused on implementing centralized VNE algorithms, which suffer from lack of scalability and robustness. This project aims to implement a decentralized virtual network embedding algorithm that addresses the challenges of network virtualization, such as scalability, single point of failure, and DoS attacks. The proposed approach involves selecting L leaders from the physical nodes and embedding a virtual network request (VNR) in the local network of each leader using a simple algorithm like BFS. The algorithm then uses a leader-election mechanism for determining the node with the lowest cost and highest revenue and propagates the embedding to other leaders. By utilizing decentralization, we improve the scalability and robustness of the solution. Additionally, we evaluate the effectiveness of our fully decentralized algorithm by comparing it with existing approaches. Our algorithm performs $12%$ better in terms of acceptance rate and improves the revenue-to-cost ratio by roughly $21%$ to compared approaches.

Problem

• Decentralized Virtual Network Embedding
• Scalability and Robustness Improvement
• Leader-election Mechanism for Cost Efficiency

Innovation

• Decentralized Virtual Network Embedding
• Leader-election mechanism
• Improved scalability and robustness