International Journal of Education and Science Research Review EXAMINATION OF COMPACT ROUTING USING SWARM ALGORITHM

Farid Ahmad
2017 unpublished
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 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.
more » ... s 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. KEY WORDS: swarm intelligence, collective intelligence algorithm INTRODUCTION A network is a collection of computers and other hardware interconnected by communication channels that allow sharing of resources and information. The process of selecting paths in a network along which to send network traffic is called routing. Routing may be divided in the following categories: a. Proactive, reactive, and hybrid routing b. Source and next hop routing c. Flat and hierarchical routing d. Distributed and centralized routing e. Single path and multipath routing In proactive routing fresh lists of destinations and their routes is maintained by periodically distributing routing tables throughout the network. Respective amount of data for maintenance is required to be handled and there is slow reaction on restructuring and failures. This technique is also referred to as table driven routing. In reactive routing which also called on demand routing we find a route on demand by flooding the network with Route Request packets. Here the latency time in route finding is high. Hybrid routing combines the advantages of proactive and of reactive routing. The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding. The choice for one or the other method requires predetermination for special cases.
fatcat:qwgmzzexjjbsdg6hg3xqo5weuu