Performance Evaluation and Optimal Operation Strategy of OpenDaylight Controller Cluster 


Vol. 41,  No. 12, pp. 1801-1810, Dec.  2016


PDF
  Abstract

The OpenDaylight controller has been receiving significant attention as one of the enabling open source framework for SDN, and this paper analyzes the architecture and procedure of OpenDaylight based controller cluster. The OpenDaylight controller cluster uses shard based distributed datastore and Raft algorithm to maintain consistency among controllers inside a cluster. The performance evaluation analyzes the leader re-election time as well as latencies of CRUD and Routed RPC according to cluster size, shard role, and sharding strategy, and we discuss the optimal operation strategy for OpenDaylight controller cluster.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

T. Kim, D. Suh, S. Pack, M. Kim, C. Lim, S. Park, "Performance Evaluation and Optimal Operation Strategy of OpenDaylight Controller Cluster," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 12, pp. 1801-1810, 2016. DOI: .

[ACM Style]

Taehong Kim, Dongeun Suh, Sangheon Pack, Myung-Sup Kim, Chang-Gyu Lim, and Soomyung Park. 2016. Performance Evaluation and Optimal Operation Strategy of OpenDaylight Controller Cluster. The Journal of Korean Institute of Communications and Information Sciences, 41, 12, (2016), 1801-1810. DOI: .

[KICS Style]

Taehong Kim, Dongeun Suh, Sangheon Pack, Myung-Sup Kim, Chang-Gyu Lim, Soomyung Park, "Performance Evaluation and Optimal Operation Strategy of OpenDaylight Controller Cluster," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 12, pp. 1801-1810, 12. 2016.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880