Dynamic decentralized packet clustering in networks

Authors:
Daniel Merkle;Martin Middendorf;Alexander Scheidler
Affiliations:
Department of Computer Science, University of Leipzig, Leipzig, Germany;Department of Computer Science, University of Leipzig, Leipzig, Germany;Department of Computer Science, University of Leipzig, Leipzig, Germany
Venue:
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Year:
2005

Citing 2
Cited 1

On the performance of ant-based clustering

Design and application of hybrid intelligent systems
AntClust: ant clustering and web usage mining

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Using decentralized clustering for task allocation in networks with reconfigurable helper units

IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems

Quantified Score

Hi-index	0.00

Visualization

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.