Loading

The Selection of Mesh in Networks
Attipalli Avinash1, Tarik Eltaeib2

1Attipalli Avinash, Department of computer Science University of Bridgeport, USA.
2Tarik Eltaeib, Department of computer Science University of Bridgeport, USA.

Manuscript received on 15 April 2015 | Revised Manuscript received on 25 April 2015 | Manuscript Published on 30 April 2015 | PP: 129-132 | Volume-4 Issue-4, April 2015 | Retrieval Number: D3924044415/15©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The mesh network structure is vastly implemented in Multi-computers and networks for parallel and distributed computing. In mesh network each computer or processor have maximum of four neighbors. This kind of architecture is implemented in dedicated supercomputers. But, the problem occurs when it comes to the practical implementation in networks. In networks each computer is connected to each other. In this we implement an algorithm to make the mesh network more efficient. The efficient mesh structure is possible in between the best nodes in a network. The proposed algorithm in this mesh network is AGMS ie., Adaptation Genetic Algorithm.
Keywords: AGAMS Algorithm, Cost of Link, Topology

Scope of the Article: Algorithm Engineering