OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
Scalable flow-based networking with DIFANE
Proceedings of the ACM SIGCOMM 2010 conference
Extensible and scalable network monitoring using OpenSAFE
INM/WREN'10 Proceedings of the 2010 internet network management conference on Research on enterprise networking
Network traffic characteristics of data centers in the wild
IMC '10 Proceedings of the 10th ACM SIGCOMM conference on Internet measurement
OpenTM: traffic matrix estimator for OpenFlow networks
PAM'10 Proceedings of the 11th international conference on Passive and active measurement
Can the production network be the testbed?
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Online measurement of large traffic aggregates on commodity switches
Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
| Hi-index | 0.00 |
Flow-based programmable networks must continuously monitor performance metrics, such as link utilization, in order to quickly adapt forwarding rules in response to changes in workload. However, existing monitoring solutions either require special instrumentation of the network or impose significant measurement overhead. In this paper, we propose a push-based approach to performance monitoring in flow-based networks, where we let the network inform us of performance changes, rather than query it ourselves on demand. Our key insight is that control messages sent by switches to the controller carry information that allows us to estimate performance. In OpenFlow networks, PacketIn and FlowRemoved messages--sent by switches to the controller upon the arrival of a new flow or upon the expiration of a flow entry, respectively--enable us to compute the utilization of links between switches. We conduct a) experiments on a real testbed, and b) simulations with real enterprise traces, to show accuracy, and that it can refresh utilization information frequently (e.g., at most every few seconds) given a constant stream of control messages. Since the number of control messages may be limited by the properties of traffic (e.g., long flows trigger sparse FlowRemoved's) or by the choices made by operators (e.g., proactive or wildcard rules eliminate or limit PacketIn's), we discuss how our proposed passive approach can be combined with active approaches with low overhead.