LABERIO: Dynamic load-balanced routing in OpenFlow-

enabled networks

Author:Hui Long, Yao Shen*, Minyi Guo,

Feilong Tang

1

2013 IEEE 27th International Conference on Advanced Information Networking and Applications

Outline

• Introduction–What is load balancing ?

• Architectural

• Load-Balanced Routing Algorithm

• Experiments

• Conclusion

• Reference

2

Introduction

• What is load balancing ?

Load-balancing algorithms

DynamicStatic

Deterministic Probabilistic Centralized Distributed

Cooperative Noncooperative

參考網址 : Load-balancing algorithms3

Introduction Cont.

• Static versus Dynamic– Static algorithms use only information about the

average behavior of the system– Static algorithms ignore the current state or load of

the nodes in the system – Dynamic algorithms collect state information and

react to system state if it changed– Static algorithms are much more simpler– Dynamic algorithms are able to give significantly

better performance

參考網址 : Load-balancing algorithms4

Introduction Cont.

• Deterministic versus Probabilistic– Deterministic algorithms use the information about

the properties of the nodes and the characteristic of processes to be scheduled

– Probabilistic algorithms use information of static attributes of the system (e.g. number of nodes, processing capability, topology) to formulate simple process placement rules

– Deterministic approach is difficult to optimize– Probabilistic approach has poor performance

參考網址 : Load-balancing algorithms5

Introduction Cont.

• Centralized versus Distributed– Centralized approach collects information to server

node and makes assignment decision

– Distributed approach contains entities to make decisions on a predefined set of nodes

– Centralized algorithms can make efficient decisions, have lower fault-tolerance

– Distributed algorithms avoid the bottleneck of collecting state information and react faster

參考網址 : Load-balancing algorithms6

Introduction Cont.

• Cooperative versus Noncooperative– In Noncooperative algorithms entities act as

autonomous ones and make scheduling decisions independently from other entities

– In Cooperative algorithms distributed entities cooperatewith each other

– Cooperative algorithms are more complex and involve larger overhead

– Stability of Cooperative algorithms are better

參考網址 : Load-balancing algorithms7

• LABERIO (LoAd-BalancEd Routing wIth OpenFlow)– A group of routing algorithms that theoretically

achieve better performance on maximizing the throughput while reducing the total transmission time.

– A non-blocking full-populated network topology and a typical fat-tree network topology.

8

Introduction Cont.

Architectural

9

10

Architectural Cont.

Load-Balanced Routing Algorithm

11

Experiments

12

Conclusion• We have designed a novel algorithm targeting

at load balancing issue in an OpenFlow network.

• Although existing algorithms for load balancing and routing strategy in SDN, being placed to the large-scale distributed network because fail to take into account the load crash in the middle of flows’ transmission.

• An efficient path switching algorithm to remediate the load imbalance issue generated during the transmission.

13

Reference

• Load-balancing algorithms

14