The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the

Open_vSwitch − Open_vSwitch schema Adatabase with this schema holds the confi guration for one Open vSwitch daemon. The top-levelconfi gu- ration for the daemon is the Open_vSwitch table, which must have exactly one record. Records