What main problems does BRIGHT aim to solve in the OpenFlow/SDN traffic monitoring? (Budget constraints, high costs, inaccurate estimations, etc.)
BRIGHT targets three core problems in SDN/OpenFlow traffic monitoring:
Tight monitoring budget constraints: In large networks, polling all flows at high frequency is infeasible due to limited control-plane bandwidth and switch/controller CPU capacity. BRIGHT must deliver accurate traffic matrix estimates while keeping monitoring overhead within budget.
Lack of adaptive monitoring: Existing methods rely on static heuristics or fixed polling periods and cannot dynamically adjust monitoring intensity in response to traffic dynamics, especially under bursty conditions.
Weak coupling between monitoring and inference: Prior approaches do not maintain explicit per-flow uncertainty models, making it difficult to know which flows actually need more frequent probing and which can be safely compressed.
Unbalanced and costly spatio-temporal scheduling: Existing systems treat spatial (which switch) and temporal (how often) decisions separately, ignoring heterogeneous switch costs and leading to monitoring hotspots, excessive control-plane overhead, and uneven load distribution.
In short, BRIGHT aims to jointly solve the problem of doing more with less — achieving accurate traffic matrix estimation under strict resource constraints, while continuously adapting to changing network conditions.
