PROJECT TITLE :

WMGR: A Generic and Compact Routing Scheme for Data Center Networks - 2018

ABSTRACT:

Knowledge center networks (DCNs) connect lots and thousands of computers and, as a results of the exponential growth in their number of nodes, the look of scalable (compact) routing schemes plays a pivotal role within the optimal operation of the DCN. Ancient trends in the look of DCN architectures have led to solutions, where routing schemes and network topologies are interdependent, i.e., specialized routing schemes. Unlike these, we have a tendency to propose a routing theme that's compact and generic, i.e., independent of the DCN topology, the word-metric-based mostly greedy routing. In this scheme, every node is assigned to a coordinate (or label) within the word-metric space (WMS) of an algebraic cluster and then nodes forward packets to the closest neighbor to the destination in this WMS. We evaluate our scheme and compare it with other routing schemes in several topologies. We tend to prove that the memory house needs in nodes and the forwarding decision time grow sub-linearly (with respect to n, the number of nodes) in all of those topologies. The scheme finds the shortest paths in topologies based on Cayley graphs and trees (e.g. Fat tree), whereas in the rest of topologies, the length of any path is stretched by a factor that grows logarithmically (with respect to n). Moreover, the simulation results show that a lot of of the ways remain far below this upper certain.