Graph contraction based self-organizing networks for future Internet

This paper is a proposal to arrange the way in which nodes in a future Internet are address according to a hierarchical scheme based on "graph contraction", in which nodes are organized into a hierarchical abstracted graph. We describe a new network architecture scheme-graph contraction based self-organizing networks and topology-aware addressing. Our proposed network design principle abstracts large-scale networks while preserving the topological characteristics of nodes. It also provides a way to define topology-aware address. This network architecture scheme can be a solution to the challenges of scalability, mobility, and the issue of rapid increase in routing table size through aggregatable address information. By means of a three-dimensional topology viewer and a self-organizing network simulator, we analyzed the self-organizing scheme and topology-aware address allocation process of our architecture.