4741

4460

كارشناسي ارشد

مخابرات

اصفهان: دانشگاه صنعتي اصفهان،دانشكده برق و كامپيوتر

1388

يازده،132،[I]ص.: مصور،جدول،نمودار

ص.ع.به: فارسي و انگليسي

پژمان خديوي،ابوالقاسم زيدآبادي نژاد

جواد عسگري

17/8/88

مهدي مهدوي

1396/07/25

كتابنامه

مهندسي برق و كامپيوتر

ID4460

به فارسي و انگليسي:قابل رويت در نسخه ديجيتالي

A New Method for Network Nodes Partitioning in Networks based on 1553 Data Bus Omid Talebi o talebi@ec iut ac ir Date of Submission 16 May 2009 Department of Electrical and Computer Engineering Isfahan University of Technology Isfahan 84156 83111 Iran Degree M Sc Language FarsiSupervisors Pejman Khadivi pkhadivi@ec iut ac ir Abolghasem Zeidaabadi Nezhad zeidabad@cc iut ac irAbstractThe 1553 Data Bus was invented during 1970s for intercommunication of digital avionic systems By thedevelopment of this network as a high reliability network it is used in many industries This standard hasapplied to satellites as well as payloads within the space shuttle and it is even being used in the InternationalSpace Station Likewise It is employed on large transports aerial refuelers bombers tactical fighters andhelicopters The U S Navy has applied the Data Bus to both surface and subsurface ships The U S Army inaddition to its helicopters has put 1553 into tanks and howitzers By using this standard many of point to pointconnections in the aircrafts have been removed and the 1553 Data Bus connect those systems together Also byusing this standard the development and changeability in the systems could be done simply The idea of mostmodern industrial and general networks such as CAN Profibus USB etc is based on 1553 Data Bus Currently one of the most important problem is to connect more terminals to a 1553 Data Bus However thisstandard has a limited bandwidth and due to its high reliability the standard changes slowly Any change in thestandard takes so many time and cost Therefore we have to apply a method to carry more data on existingnetwork One of the applicable methods is to connect multiple buses together Those buses should be connectedtogether with less intercommunication For using multiple buses that have less intercommunication we shallconsider a terminal for the most communicated bus For the achievement of this goal we can take theadvantages of graph partitioning The graph partitioning is a complicated problem however it is useful in somany applications In this problem a large weighted graph is segmented to some small graphs The small graphsshould have less connections with each other Some applications of this problem is in the data networks systemdesign VLSI etc First solution for this problem is named Complete Search method that is an NP completeproblem therefore it takes so much time Hence we need a method that can solve the graph partitioningproblem in less time Lots of methods have proposed for solving this problem but they could not solve thisproblem completely More famous graph partitioning methods are Karnighan Lin Tabu Search SimulatedAnealing Multilevel alogorithms etc Some of this algorithms are used to cut the main graph into two subset Inthis thesis a new method is proposed in order to solve the graph partitioning problem and it is applied to thelimited speed problem of 1553 Data bus This method is based on node swaping We simulated this method andapplied it on some random graphs Then the results are compared with the Complete Search method Accordingly the final simulation results will prove that the proposed algorithm is suitable enough for this kindof application so we can use this algorithm for the graph partitioning over the 1553 Data Bus Keywords 1553 Data Bus Graph Partitioning Complete Search Reliability Weighted Graph

پژمان خديوي،ابوالقاسم زيدآبادي نژاد

جواد عسگري

مهدي مهدوي