An Algorithm of Topology Design and Routing

Networks of workstations are rapidly emerging as a cost-effective alternative to parallel computers. Switch-based interconnects topology allow the wiring flexibility, scalability, and incremental expansion capability. Constantly growing demands of high productivity and security of computer systems and computer networks call the interest of specialists in the environment of construction of optimum topologies of computer mediums. In earliest phases of design, the study of the topological influence of the processes that happen in computer systems and computer networks allows to obtain useful information which possesses a significant value in the subsequent design. It has always been tried to represent the different computer network topologies using appropriate graph models. Graphs have huge contributions towards the performance improvement factor of a network. Some major contributors are de-Bruijn, Hypercube, Mesh and Pascal. They had been studied a lot and different new features were always a part of research outcome. As per the definition of interconnection network it is equivalent that a suitable graph can represent the physical and logical layout very efficiently. Our proposed network model can be implemented in different network environment and it can also be used to implement MAN, WAN and mobile communication. The proposed algorithm can design each region and then choose few stations from them to communicate with other regions.