Fair Adaptive Resouce Allocation Scheme for an OpenFlow-Based Virtual Network

In an OpenFlow-based network, the resources arepartitioned in slices. For isolation reasons, each slice has its ownforwarding plane and therefore its own flow table. The searchmemory is so pre-partitioned between the slices. This pre-setmechanism for memory slicing would easily crash the controllerbecause of only one of the slices memory overload. To solvethis problem, we propose, in this paper, a linear program forfair search memory allocation between the slices and a method to control the allocation stability based on a per-slice ageing function.