A stochastic clustering algorithm for swarm compact routing

Authors:
Huaiyuan Ma;Otto J. Wittner;Bjarne E. Helvik
Affiliations:
The Centre for Quantifiable Quality of Service in Communication Systems, Norwegian University of Science and Technology, Norway;The Centre for Quantifiable Quality of Service in Communication Systems, Norwegian University of Science and Technology, Norway;The Centre for Quantifiable Quality of Service in Communication Systems, Norwegian University of Science and Technology, Norway
Venue:
NGI'09 Proceedings of the 5th Euro-NGI conference on Next Generation Internet networks
Year:
2009

Citing 9
Cited 2

Compact routing with minimum stretch

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Cross-Entropy Guided Ant-Like Agents Finding Cyclic Paths in Scarcely Meshed Networks

ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
Robust Implementation of policies using ant-like agents

net-Con '02 Proceedings of the IFIP TC6 / WG6.2 & WG6.7 Conference on Network Control and Engineering for QoS, Security and Mobility
Modeling Autonomous-System Relationships

Proceedings of the 20th Workshop on Principles of Advanced and Distributed Simulation
AS relationships: inference and validation

ACM SIGCOMM Computer Communication Review
Cross entropy guided ant-like agents finding dependable primary/backup path patterns in networks

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
On compact routing for the internet

ACM SIGCOMM Computer Communication Review
Scaling IP Routing with the Core Router-Integrated Overlay

ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols

A compact routing scheme with lower stretch

NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
HDLBR: A name-independent compact routing scheme for power-law networks

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Internet community is still looking for a long term solution for their interdomain routing scalability issues. Compact routing based Algorithms are promising candidates. Cowen's compact routing scheme is the first stretch-3 scheme found. This paper presents a new swarm-based stochastic clustering algorithm based on Cowen's scheme. By simulation and analysis, the stretch distribution of all paths generated by the clustering algorithm is derived. The algorithm is applied as an compact routing scheme on an Internet-like inter-domain topology with 3000 autonomous systems. Conservative analysis (ignoring potential "short cut" paths) output an average stretch of 1.04 and an maximum stretch of 3. Further investigations show that more than 90% of all paths have stretch-1. By manual check of all stretch-3 paths, it is found that the source nodes of these paths have more immediate neighbors than they may include in their neighborhood due to Cowen's neighborhood size limit. The simulation results show that each node has around 240 routing entries in total, which is indeed comparable to the Cowen's original scheme.