MARVELO: Wireless Virtual Network Embedding for Overlay Graphs with Loops

TL;DR

MARVELO is a novel approach for wireless virtual network embedding that efficiently handles complex overlay graphs with loops by leveraging multicast advantages and interference-aware routing, enabling better scheduling and resource utilization.

Contribution

It introduces MARVELO, a multicast-aware routing method for embedding overlay graphs with loops in wireless networks, addressing scheduling, routing, and interference considerations.

Findings

Handles complex scenarios quickly in simulations

Effectively manages overlay graphs with feedback loops

Improves scheduling and routing efficiency

Abstract

When deploying resource-intensive signal processing applications in wireless sensor or mesh networks, distributing processing blocks over multiple nodes becomes promising. Such distributed applications need to solve the placement problem (which block to run on which node), the routing problem (which link between blocks to map on which path between nodes), and the scheduling problem (which transmission is active when). We investigate a variant where the application graph may contain feedback loops and we exploit wireless networks? inherent multicast advantage. Thus, we propose Multicast-Aware Routing for Virtual network Embedding with Loops in Overlays (MARVELO) to find efficient solutions for scheduling and routing under a detailed interference model. We cast this as a mixed integer quadratically constrained optimisation problem and provide an efficient heuristic. Simulations show that our approach handles complex scenarios quickly.