2005 | OriginalPaper | Chapter
Dynamic Decentralized Packet Clustering in Networks
Authors : Daniel Merkle, Martin Middendorf, Alexander Scheidler
Published in: Applications of Evolutionary Computing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we study a dynamic version of the Decentralized Packet Clustering (DPC) Problem. For a network consisting of routers and application servers the DPC problem is to find a good clustering for packets that are sent between the servers through the network. The clustering is done according to a data vector in the packets. In the dynamic version of DPC the packets data vector can change. The proposed algorithms to solve the dynamic DPC are inspired by the odor recognition system of ants. We analyze the new algorithms for situations with different strengths of dynamic change and for different number of routers in the network.