Certain investigations on topological design of networks using graph theoretical algorithms in grid environment

Abstract

The continuous developments in the field of grid computing networks over the last few decades can be directly attributed to the enormous amount of research work that has been put into the various aspects of the analysis and design of grid computing networks The vastness of computer newlinenetworks and the plethora of applications that it provides to the society make study of grid computing networks imperative Applications of grid computing networks have grown in many fields of human activity such as education infotainment etc All of the aforementioned applications demand an intransigent need to design fault tolerant survivable networks with minimum transmission delay response time and maximum throughput Topological design of grid computing networks can be modeled by a graph Practically it has been demonstrated that graph theory is a powerful mathematical tool for the design and analysis of topological structure of computer networks In the design of interconnection networks one fundamental consideration is fault tolerance Researchers have used graph theoretical concept of connectivity as a key measure for fault tolerance This thesis focuses on the issues of fault tolerance transmission delay embeddability and extendability One of the basic principles in the topological design of computer communication networks is to achieve maximum survivability It is the ability of the network to provide continuous service in the presence of link and or node failures It is an essential and considerable concern in the design of high speed communication networks In order to resolve the above computer network issues four objectives are proposed newline newline