ISSN: 2455-2631 © June 2018 IJSDR | Volume 3, Issue 6 IJSDR1806069 International Journal of Scientific Development and Research (IJSDR) www.ijsdr.org 426 An Overly Architecture for throughput Optimal Routing using Cluster Based network M.Archana 1 , Ajay Kushwaha 2 , Dharmendra Roy 3 1 M.TECH Scholar, 2,3 Assistant Professor Department of Computer Science, Rungta College of Engineering &Technology Bhilai (C.G.) INDIA Abstract—Cluster-based network control structures endorse more capable utilize of resources in controlling large dynamic networks. Therefore they are very good candidates for ad hoc networks. There are many types of cluster-based architectures proposed in the literature for definite purposes. Of them link-cluster architecture is specifically designed for transmission management in ad hoc networks. Bequest networks are frequently planned to operate with plain single-path routing, like the shortest path, which is known to be throughput suboptimal. On the other hand, earlier proposed throughput optimal policies (i.e., backpressure) need each machine in the network to make active routing decisions. We study overlay architecture for dynamic routing; only a subset of devices (overlay nodes) require to make the dynamic routing decisions. We conclude the necessary compilation of nodes that must bifurcate traffic for achieving the utmost multi-commodity network throughput. Keywords— Cluster based, overlay networks, bequest network, network control, backpressure routing I. INTRODUCTION This paper presents quite a few cluster based control structures and associated control algorithms for large dynamic networks. Applicability of these structures and algorithms to ad hoc networks are also investigated predominantly on routing functions. Cluster-based control networks improve efficiency of resource use by creating contexts for:  Managing wireless transmission between multiple nodes to reduce channel contention.  Forming routing backbones to reduce network diameter.  Abstracting network state information to reduce its quantity and variability. We study best possible routing in networks where some bequest nodes are replaced with overlay nodes. While the bequest nodes execute only forwarding on pre-specified paths, the overlay nodes are capable to animatedly route packets. Dynamic backpressure is known to be an optimal routing policy, but it usually requires a uniform network, where all nodes contribute in organize decisions. As an alternative, we guess that only a division of the nodes are convenient; these nodes form a network overlay inside the bequest network. The option of the overlay nodes is shown to conclude the throughput area of the network. We relate our best possible node assignment algorithm to a number of graphs and the consequences demonstrate that a small fraction of overlay nodes is sufficient for achieving highest throughput. Finally, we propose a threshold-based policy (BP- T) and a heuristic policy (OBP), which animatedly control traffic bifurcations at overlay nodes. Policy BP-T is proved to make the most of throughput for the case when underlay paths do not partly cover. We estimate our algorithm on numerous classes of usual and random graphs. In the case of random networks with a power-law degree distribution, which is a general model for the Internet. We find that smaller number than 80 out of 1000 nodes are necessary to be convenient to allow the complete throughput area.