The 1553 Data Bus was invented during 1970s for intercommunication of digital avionic systems. By the development of this network, as a high reliability network, it is used in many industries. This standard has applied to satellites as well as payloads within the space shuttle, and it is even being used in the International Space Station. Likewise, It is employed on large traorts, aerial refuelers, bombers, tactical fighters, and helicopters. The U.S. Navy has applied the Data Bus to both surface and subsurface ships. The U.S. Army, in addition to its helicopters, has put 1553 into tanks and howitzers. By using this standard, many of point-to-point connections in the aircrafts have been removed and the 1553 Data Bus connect those systems together. Also by using this standard, the development and changeability in the systems could be done simply. The idea of most modern 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, this standard has a limited bandwidth, and, due to its high reliability, the standard changes slowly. Any change in the standard takes so many time and cost. Therefore we have to apply a method to carry more data on existing network. One of the applicable methods is to connect multiple buses together. Those buses should be connected together, with less intercommunication. For using multiple buses that have less intercommunication, we shall consider a terminal for the most communicated bus. For the achievement of this goal, we can take the advantages of graph partitioning. The graph partitioning is a complicated problem, however, it is useful in so many applications. In this problem, a large weighted graph is segmented to some small graphs. The small graphs should have less connections with each other. Some applications of this problem is in the data networks, system design, VLSI, etc. First solution for this problem is named Complete Search method that is an NP-complete problem; therefore, it takes so much time. Hence, we need a method that can solve the graph partitioning problem in less time. Lots of methods have proposed for solving this problem but they could not solve this problem completely. More famous graph partitioning methods are Karnighan-Lin, Tabu Search, Simulated Anealing, Multilevel alogorithms, etc. Some of this algorithms are used to cut the main graph into two subset. In this thesis, a new method is proposed in order to solve the graph partitioning problem, and it is applied to the limited speed problem of 1553 Data bus. This method is based Keywords : 1553 Data Bus, Graph Partitioning, Complete Search, Reliability, Weighted Graph