Software Defined Network Partitioning with Graph Partitioning Algorithms
dc.authorid | Hassan, Suhaidi/0000-0002-5094-4929 | |
dc.authorid | Habbal, Adib/0000-0002-3939-2609 | |
dc.contributor.author | Arlimatti, Shivaleela | |
dc.contributor.author | Elbrieki, Walid | |
dc.contributor.author | Hassan, Suhaidi | |
dc.contributor.author | Habbal, Adib | |
dc.date.accessioned | 2024-09-29T15:50:51Z | |
dc.date.available | 2024-09-29T15:50:51Z | |
dc.date.issued | 2020 | |
dc.department | Karabük Üniversitesi | en_US |
dc.description | 4th International Conference of Reliable Information and Communication Technology (IRICT) -- SEP 22-23, 2019 -- Johor, MALAYSIA | en_US |
dc.description.abstract | Software Defined Networks is an emerging paradigm in Internet communication world that increases the flexibility of today's networks by decoupling control plane and data plane of the network devices. The fundamental aim is to centralize the control and reduce the complexity of the networks. The communication medium between control and data plane is through OpenFlow protocol, an open standard network protocol designed to manage the network traffic by software programs. To increase the scalability and flexibility of controllers the OpenFlow controllers are distributed based on location and network types. However, most critical issue is minimizing the communication cost between the controller domains. In this paper, two graph partitioning algorithms Fiduccia-Matthyses algorithm and Kernighan-Lin algorithm are used to minimize the communication cost between distributed OpenFlow controller domains. The implementation of the algorithms is under Matlab simulation environment. The methodology used for the proposed algorithms is to interchange the elements from one domain to other domain to calculate the gain. The simulated results show that Kernighan-Lin algorithm minimizes more communication cost rather than the Fiduccia-Matthyses algorithm. | en_US |
dc.description.sponsorship | Univ Teknologi Malaysia, Informat Engn Behav Informat Res Grp, Yemeni Scientists Res Grp,Taibah Univ, Coll Comp Sci & Engn, Data Sci Res Grp,Sch Sci & Technol,Charles Darwin Univ, Coll Engn, IT & Environm,Assoc Informat Syst Malaysia Chapter | en_US |
dc.identifier.doi | 10.1007/978-3-030-33582-3_54 | |
dc.identifier.endpage | 593 | en_US |
dc.identifier.isbn | 978-3-030-33582-3 | |
dc.identifier.isbn | 978-3-030-33581-6 | |
dc.identifier.issn | 2194-5357 | |
dc.identifier.issn | 2194-5365 | |
dc.identifier.scopus | 2-s2.0-85077771566 | en_US |
dc.identifier.scopusquality | N/A | en_US |
dc.identifier.startpage | 583 | en_US |
dc.identifier.uri | https://doi.org/10.1007/978-3-030-33582-3_54 | |
dc.identifier.uri | https://hdl.handle.net/20.500.14619/3761 | |
dc.identifier.volume | 1073 | en_US |
dc.identifier.wos | WOS:000583758100054 | en_US |
dc.identifier.wosquality | N/A | en_US |
dc.indekslendigikaynak | Web of Science | en_US |
dc.indekslendigikaynak | Scopus | en_US |
dc.language.iso | en | en_US |
dc.publisher | Springer International Publishing Ag | en_US |
dc.relation.ispartof | Emerging Trends in Intelligent Computing and Informatics: Data Science, Intelligent Information Systems and Smart Computing | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.subject | Fiduccia-Matthyses | en_US |
dc.subject | Kernighan-Lin | en_US |
dc.subject | Communication cost | en_US |
dc.subject | OpenFlow | en_US |
dc.title | Software Defined Network Partitioning with Graph Partitioning Algorithms | en_US |
dc.type | Conference Object | en_US |