On Possible Connections between Ant Algorithms and Random Matrix Theory

  • Carlo Mastroianni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6234)


This paper reports on a conjecture concerning the statistical behavior of Self- Chord [1], a self-organizing P2P system in which the resource keys are dynamically sorted with an ant algorithm. In Self-Chord (, peers are organized in a logical ring, as in Chord, and a hash function is used to assign an index to every peer, and an access key to every resource. Contrary to Chord though, the values of resource keys are decoupled from those of peer indexes, and are dynamically sorted by ant-inspired agents through statistical pick and drop operations. This allows Self-Chord to keep the Chord capacity for serving discovery requests in logarithmic time, but leads to many further advantages, among which the possibility of assigning a semantic meaning to keys, a better load balancing among peers, and the efficient execution of range queries.


Hash Function Range Query Riemann Zeta Function Random Matrix Theory Semantic Meaning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Forestiero, A., Leonardi, E., Mastroianni, C., Meo, M.: Self-Chord: a bio-inspired P2P framework for self-organizing distributed systems. IEEE/ACM Transactions on Networking (2010)Google Scholar
  2. 2.
    Mastroianni, C.: A statistical analysis of Self-Chord: on possible connections between ant algorithms and random matrix theory. Tech. Rep. RT-ICAR-CS-10-02, ICAR-CNR, (May 2010),
  3. 3.
    Mehta, M.L.: Random Matrices. Academic Press Inc., Boston (1991)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Carlo Mastroianni
    • 1
  1. 1.ICAR-CNRRende(CS)Italy

Personalised recommendations