SWH: A Small-World Heuristic for future network

Graphs with a minimum diameter have applications in the design of building-block switching systems, communication networks [1], and distributed computer systems [2]. Several methods of constructing directed graphs with a small diameter are proposed [3]. This paper presents a heuristic network topology that allows a wide trade-off between node degree, and diameter. This called ldquoSmall-World Heuristicrdquo (SWH) that feature minimum diameter properties using only nodes of degree 4. The ldquoSWHrdquo is highly clustered like a regular graph where the edges are randomly rewired with a gaussian distribution and has a small characteristic path length, like a random graph. This heuristic explores different graphs to suitable for large parallel computer networks.