Loading…

On minimizing flow monitoring costs in large‐scale software‐defined network networks

Summary Recent years have witnessed the rise of novel network applications such as telesurgery, telepresence, and holoportation. As such applications have stringent performance requirements, timely and accurate traffic monitoring becomes of paramount importance to be able to react in a timely and ef...

Full description

Saved in:
Bibliographic Details
Published in:International journal of network management 2023-03, Vol.33 (2), p.n/a
Main Authors: Yahyaoui, Haythem, Zhani, Mohamed Faten, Bouachir, Ouns, Aloqaily, Moayad
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Summary Recent years have witnessed the rise of novel network applications such as telesurgery, telepresence, and holoportation. As such applications have stringent performance requirements, timely and accurate traffic monitoring becomes of paramount importance to be able to react in a timely and efficient manner, and swiftly adjust the network configuration to achieve the sought‐after requirements. However, existing monitoring schemes are either incurring high cost (e.g., high bandwidth consumption) due to the large number of monitoring messages or inefficient when they incur high reporting delay (i.e., the time needed for a monitoring message to reach the controller) making the collected statistics obsolete. In this paper, we address this problem and propose monitoring mechanisms for software defined networks that minimize the monitoring cost while satisfying an upper bound on the reporting delay of the statistics. Our solutions allow to carefully select the switch that should report the statistics about each flow crossing the network taking into consideration the available bandwidth and the capacity of the switch (i.e., the maximum number of flows that it can monitor). In particular, we formulate the switch‐to‐flow selection problem as an integer linear program and propose two heuristic algorithms to cope with large‐scale instances of the problem. We consider the scenario where a single controller is collecting statistics and another where statistics are collected by multiple controllers. Simulation results show that the proposed algorithms provide near‐optimal solutions with minimal computation time and outperform existing monitoring strategies in terms of monitoring cost and reporting delay. We propose a novel traffic monitoring strategy for large‐scale software‐defined networks. The new strategy minimizes not only the monitoring cost, which is expressed in bandwidth consumption, but also the statistics reporting delay in the switch‐to‐controller path. This delay is critical for the controller to make efficient traffic management decisions.
ISSN:1055-7148
1099-1190
DOI:10.1002/nem.2220