پديد آورنده :
سپاهي، امير
عنوان :
مكان يابي كنترلرها در شبكه هاي مبتني بر نرم افزار با بهره گيري از مجموعه چيره
مقطع تحصيلي :
كارشناسي ارشد
محل تحصيل :
اصفهان : دانشگاه صنعتي اصفهان
صفحه شمار :
دوازده، 92ص.: مصور، جدول، نمودار
استاد راهنما :
فروغ السادات طباطبا
استاد مشاور :
مسعودرضا هاشمي
توصيفگر ها :
شبكه مبتني بر نرم افزار , جايگذاري كنترلرها , مجموعه چيره , خوشه بندي
استاد داور :
علي فانيان، حسين فلسفين
تاريخ ورود اطلاعات :
1398/06/04
دانشكده :
مهندسي برق و كامپيوتر
تاريخ ويرايش اطلاعات :
1398/06/05
چكيده انگليسي :
Controller Placement in Software Defined Networks using Dominating Set Amir Sepahi a sepahi@ec iut ac ir spring 2019 Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language Farsi Supervisor Dr Foroogh Sadat Tabataba fstabataba@cc iut ac ir Advisor Dr Massoud Reza Hashemi hashemim@cc iut ac ir Abstract Nowadays a lot of smart devices need to be connected to the internet continuously which develops the concept ofInternet of Things IoT Therefore there is a high demand for the network traffic and hence internet service providers ISPs should increase their network capacity In traditional network infrastructure network management becomes morecomplicated by network growth since each node has its own control plane and data plane Software defined networking SDN is designed as a powerful infrastructure for future networking Some of the technical and the practical advantagesof SDN are separation of data plane and control plane control centralization automation and virtualization Using acentralized controller in the control plane of SDN we are able to monitor and control forwarding devices located in the dataplane Since only one controller would not be adequate to monitor the network it is necessary to place multiple controllersfor the management of large networks Controller placement problem CPP is a new important issue in SDN relatedresearches This issue consists of two parts 1 what the minimum number of controllers are and 2 where the best placefor each controller is In this thesis we propose an algorithm based on the concept of the minimum dominating set in graphtheory to find the minimum number of the required controllers and their appropriate places Then we cluster nodes basedon reducing the average total latency between the switches and their corresponding controllers Next a modified version ofour algorithm is proposed in order to achieve a smaller average total latency for each controller Consequently for variablenumber of controllers in each network the best nodes to place controllers are determined in which average total latencyis minimized Finally we define a cost function based on the average total latency and other variables such as purchasecost and installation cost to find the total cost for any number of controller and the importance of each variable of the costfunction All the proposed algorithms are evaluated on real WAN topologies For the comparison of the results we modifyan important algorithm in data mining i e k means algorithm to be applicable to these topologies Next we compare theresults of our proposed algorithms with that of modified k means algorithm on several topologies We also compare ourresults with two similar works Finally we limit the capacity of the controllers and then propose an algorithm to find theminimum dominating set by considering the capacity of controllers Key Words Software Defined Networking SDN Controller Placement Dominating Set Cluster ing
استاد راهنما :
فروغ السادات طباطبا
استاد مشاور :
مسعودرضا هاشمي
استاد داور :
علي فانيان، حسين فلسفين
