Network Modeling for Improving Scalability Using Graph Contraction Scheme

The objective of this work is to suggest the self-organizing algorithm by communication nodes with topological information. This paper describes the noble concept of future Internet architecture, graph contraction based self-organizing networks and the topology-aware address. The proposed network principle abstracts logical layers from large-scale physical networks with topological characteristic of nodes and defines the address of nodes by hierarchical logical layers. This concept can be a solution of some problems of current Internet such as scalability, mobility and the rapid increase of the routing table size. To validate proposed network model, we implemented network simulator focusing on self-organizing with proposed graph contraction algorithm and analyzed the proposed architecture. This simulator can show the organizing process and the allocation of topology-aware address through the three-dimensional windows and 3D viewer.