• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1801-1810
• /
• 2016

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.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.11
• /
• pp.453-462
• /
• 2017

OpenDaylight is an SDN (Software Defined Networking) open source framework, which is popular in network fields recently. This paper analyzes the performance of a controller cluster architecture by focusing on distributed datastore and Raft leader election algorithm. In addition, we propose an enhanced version of Raft algorithm in order to improve the performance of distributed datastore by distributing shard leaders over controller cluster. This paper compares the conventional Raft algorithm with the proposed version of the Raft algorithm. Moreover, we compare the performance of distributed datastore according to shard roles such as leader and follower. Experimental results show that Shard leaders provide better performance than followers and Shard updating requests need to be distributed over multiple controllers. So, by using proposed version of Raft algorithm, controller performance can be improved. The details of the experiment results are cleary described.

• KIISE Transactions on Computing Practices
• /
• v.21 no.11
• /
• pp.727-732
• /
• 2015

These days, many researchers are working on Future Internet and a new networking paradigm called Software Defined Networking draws a great attention. In this paper, we redefine Software Defined Networking as Service Defined Networking which means that packets are categorized according to types of services. By using Service Defined Networking, we are not only dealing with the way to utilize the network resources efficiently but we also propose an algorithm to minimize the waiting time for packets to be delivered. This proposed algorithm can solve the delay problem, one of the most significant problems caused by network congestion. Also, since we are adopting Service Defined Networking, network resource utilization can be improved compared to the existing network.