Decentralized packet clustering in networks

Summary form only given. A new type of a decentralized clustering problem for networks is studied in this paper. The so called decentralized packet clustering (DPC) problem is to find for a set of packets that are send around in a network a clustering where the clustering has to be done by the routers without using neither much computational power nor a large amount of memory. Further, no direct information transfer between the routers is allowed. We investigate the behavior of a type of decentralized k-means algorithm $called DPClust - for the DPC problem. DPClust has also some similarities with ant based clustering algorithms. We investigate the clustering behavior DPClust for different cluster problems and for networks that consist of several subnetworks so that there is only a limited amount of packet exchange between the subnetworks. A dynamic situation where the packet exchange rates varies over time is also considered. The proposed DPC problem leads to further interesting research problems for network clustering.

[1]  Inderjit S. Dhillon,et al.  A Data-Clustering Algorithm on Distributed Memory Multiprocessors , 1999, Large-Scale Parallel Data Mining.

[2]  Nicolas Monmarché,et al.  AntClust: Ant Clustering and Web Usage Mining , 2003, GECCO.

[3]  Nicolas Monmarché,et al.  Visual Clustering with Artificial Ants Colonies , 2003, KES.

[4]  Alexander Dekhtyar,et al.  Information Retrieval , 2018, Lecture Notes in Computer Science.

[5]  Pascale Kuntz,et al.  Emergent colonization and graph partitioning , 1994 .

[6]  Nicolas Monmarché,et al.  A new clustering algorithm based on the chemical recognition system of ants , 2002 .

[7]  Marco Dorigo,et al.  On the Performance of Ant-based Clustering , 2003, HIS.

[8]  Ajith Abraham,et al.  Web usage mining using artificial ant colony clustering and linear genetic programming , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[9]  Frances M. T. Brazier,et al.  A method for decentralized clustering in large multi-agent systems , 2003, AAMAS '03.

[10]  Juan Julián Merelo Guervós,et al.  Self-Organized Stigmergic Document Maps: Environment as a Mechanism for Context Learning , 2004, ArXiv.

[11]  Jean-Louis Deneubourg,et al.  The dynamics of collective sorting robot-like ants and ant-like robots , 1991 .

[12]  Juan Julián Merelo Guervós,et al.  Parallel Problem Solving from Nature — PPSN VII , 2002, Lecture Notes in Computer Science.

[13]  Aravind Srinivasan,et al.  Clustering and server selection using passive monitoring , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[14]  Parag M. Kanade,et al.  Fuzzy ants as a clustering concept , 2003, 22nd International Conference of the North American Fuzzy Information Processing Society, NAFIPS 2003.

[15]  Marco Dorigo,et al.  Strategies for the Increased Robustness of Ant-Based Clustering , 2003, Engineering Self-Organising Systems.

[16]  Julia Handl,et al.  Improved Ant-Based Clustering and Sorting , 2002, PPSN.

[17]  Wolfgang Müller,et al.  Classifying Documents by Distributed P2P Clustering , 2003, GI Jahrestagung.

[18]  Nicolas Monmarché,et al.  AntClass: discovery of clusters in numeric data by an hybridization of an ant colony with the Kmeans , 1999 .

[19]  Baldo Faieta,et al.  Diversity and adaptation in populations of clustering ants , 1994 .