In this paper we give a brief introduction to five different distance vector routing protocols (RIP, AODV, EIGRP, RIP-MTI and Babel) and give some of our thoughts on how to solve the count to infinity problem. Our focus is how distance vector routing protocols, based on limited information, can prevent routing loops and the count to infinity problem.

This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards nearby particles of higher fitness, instead of attracting each particle towards just the best position discovered so far by any particle. This is accomplished by usin...

We propose a shape-matching algorithm based on distance ratio distribution, which is used to measure the regularity of the transformation between the shapes to be compared. The standard deviation is used to represent the distribution. Our algorithm is robust to translation, scaling and rotation. We illustrate the effectiveness of our algorithm in the retrieval of shapes by content using the sub...

A distance graph is an undirected graph on the integers where two integers are adjacent if their difference is in a prescribed distance set. The independence ratio of a distance graph G is the maximum density of an independent set in G. Lih, Liu, and Zhu [31] showed that the independence ratio is equal to the inverse of the fractional chromatic number, thus relating the concept to the well stud...

This paper presents a modification of tlte panicle swarm optimization algorithm (PSO) intended to combat the problem ofpremature convergence observed in many applications of PSO. The proposed new algorithm moves particles towards neorby particles of higher fitness, instead of amacting each panicle towards just the best position discovered so far by any particle. This is accomplished by using th...