2019
DOI: 10.3390/fi11120252
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Dynamic Load Balancing Scheme Based on Nash Bargaining in SDN

Abstract: Static multi-controller deployment architecture cannot adapt to the drastic changes of network traffic, which will lead to a load imbalance between controllers, resulting in a high packet loss rate, high latency, and other network performance degradation problems. In this paper, an efficient dynamic load balancing scheme based on Nash bargaining is proposed for a distributed software-defined network. Firstly, considering the connectivity of network nodes, the switch migration problem is transformed into a netw… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 26 publications
0
2
0
Order By: Relevance
“…Experimental findings demonstrate that the proposed method gives away tasks equally between devices and shows an average reduction turnaround time and average waiting time and increased performance processing. In this paper Li et al [25] developed the Nash game bargaining method to reasonably enhance the two conflicting objectives of migration costs and load balance. An enhanced firefly technique is used to overcome the problem, and the optimum network configuration status is achieved.…”
Section: Related Researchmentioning
confidence: 99%
“…Experimental findings demonstrate that the proposed method gives away tasks equally between devices and shows an average reduction turnaround time and average waiting time and increased performance processing. In this paper Li et al [25] developed the Nash game bargaining method to reasonably enhance the two conflicting objectives of migration costs and load balance. An enhanced firefly technique is used to overcome the problem, and the optimum network configuration status is achieved.…”
Section: Related Researchmentioning
confidence: 99%
“…where f 1 and f 2 are the payoff functions of the players in the game and d 1 and d 2 are their respective worst possible payoffs. Nash proved that the solution that maximizes the Nash volume under the four axioms is the equilibrium solution of this problem [26].…”
Section: Bargaining Modelmentioning
confidence: 99%