Traditional routing schemes, such as OSPF, optimize data plane routing efficiency by maintaining full view of the network at the control plane. However, maintaining full network view and handling frequent routing information updates are costly in large-scale complex networks, which are considered to be the root causes for the routing scalability issue. Recently, it is suggested that routing on local or partial information is plausible if slight performance degradation is acceptable. This paper proposes a routing scheme, operating on an integrated network view at each node that consists of its local neighborhood and a globally unique skeleton tree. This scheme significantly reduces storage, communication and processing costs. On scale-free networks, this benefit only comes at the cost of marginal performance degradation, which implies that it is not worthwhile to do shortest path routing based on full view of the network on scale-free networks. In contrast, the routing efficiency is severely aggravated on purely random networks, indicating the inappropriateness of this scheme and the rationality of maintaining full network view on random networks.
- complex networks
- scale-free networks