Chapter

Applications of Evolutionary Computing

Volume 3449 of the series Lecture Notes in Computer Science pp 574-583

Dynamic Decentralized Packet Clustering in Networks

  • Daniel MerkleAffiliated withDepartment of Computer Science, University of Leipzig
  • , Martin MiddendorfAffiliated withDepartment of Computer Science, University of Leipzig
  • , Alexander ScheidlerAffiliated withDepartment of Computer Science, University of Leipzig

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.