Cart (Loading....) | Create Account
Close category search window
 

A Stochastic Clustering Algorithm for Swarm Compact Routing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Huaiyuan Ma ; Centre for Quantifiable Quality of Service in Commun. Syst., Norwegian Univ. of Sci. & Technol., Trondheim, Norway ; Wittner, O.J. ; Helvik, B.E.

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.

Published in:

Next Generation Internet Networks, 2009. NGI '09

Date of Conference:

1-3 July 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.