Distributed Middlebox Placement Based on Potential Game - International Journal of Communications, Network and System Sciences

IJCNS > Vol.10 No.5, May 2017

Distributed Middlebox Placement Based on Potential Game ()

HTML XML

Download as PDF (Size: 387KB) PP. 264-273

DOI: 10.4236/ijcns.2017.105B026 955 Downloads 1,609 Views

Author(s)

Yongwen Li, Zhiyi Qu

Affiliation(s)

School of Information Science & Engineering, Lanzhou University, Lanzhou, China.

ABSTRACT

In this paper, we analyse the deployment of middlebox. For a given network information and policy requirements, an attempt is made to determine the optimal location of middlebox to achieve the best performance. In terms of the end-to-end delay as a performance optimization index, a distributed middlebox placement algorithm based on potential game is proposed. Through extensive simulations, it demonstrates that the proposed algorithm achieves the near-optimal solution, and the end-to-end delay decreases significantly.

KEYWORDS

Middlebox Placement, Performance Optimization, Potential Game, Matching Graph, Distributed Algorithm

Share and Cite:

Li, Y. and Qu, Z. (2017) Distributed Middlebox Placement Based on Potential Game. International Journal of Communications, Network and System Sciences, 10, 264-273. doi: 10.4236/ijcns.2017.105B026.

Journals Menu

Follow SCIRP

	+1 323-425-8868
	customer@scirp.org
	+86 18163351462(WhatsApp)
	1655362766

	Paper Publishing WeChat

Journals Menu

Home

About SCIRP

Service

Policies