img
img
KLA-based partitioning mechanism for inter-domain cost minimization in software defined networks     
Yazarlar (3)
Shivaleela Arlimatti
Suhaidi Hassan
Doç. Dr. Adıb HABBAL Doç. Dr. Adıb HABBAL
Karabük Üniversitesi, Türkiye
Devamını Göster
Özet
Software Defined Networking (SDN) is a new emerging paradigm, yearning for a programmable network by increasing flexibility of today’s network. The fundamental idea behind this new architecture is to simplify the network complexity by decoupling network control logic from it’s data-forwarding by centralizing the control logic. To increase the scalability and flexibility of controllers, the OpenFlow controllers are distributed into domains based on location and network types. However, most critical issue is minimizing the communication cost between the controller domains. This paper addresses the cost minimization issue by proposing Kernighan-Lin-based Partitioning (KLAP) mechanism applied to partition the network by distributing the workload between network devices. The implementation of the mechanism is under OMNeT++ simulation environment with INET framework and OpenFlow module. The evaluation has been carried out by comparing the performance through network throughput and delay for SDN along with the adapted graph theory. The results show that the proposed mechanism is faster and more stable than the existing solutions, as well as in terms of minimizing the communication cost significantly.
Anahtar Kelimeler
Distributed controllers | Kernighan-Lin algorithm | OpenFlow | Software defined networks (SDN)
Makale Türü Özgün Makale
Makale Alt Türü SCOPUS dergilerinde yayımlanan tam makale
Dergi Adı Advanced Science Letters
Dergi ISSN 1936-6612 Wos Dergi Scopus Dergi
Makale Dili İngilizce
Basım Tarihi 01-2017
Cilt No 23
Sayı 6
Sayfalar 5487 / 5491
Doi Numarası 10.1166/asl.2017.7405