We propose routing schemes that optimize the average number of hops for lookup requests in Peer–to–Peer (P2P) systems without adding any overhead to the system. Our work is in...
Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Vi...
Abstract. In engineering and other ‘real-world’ applications, multiobjective optimization problems must frequently be tackled on a tight evaluation budget — tens or hundreds ...
We consider the fault hamiltonian properties of m×n meshes with two wraparound edges in the first row and the last row, denoted by M2(m, n), m ≥ 2, n ≥ 3. M2(m, n) is a spann...
Kyoung-Wook Park, Hyeong-Seok Lim, Jung-Heum Park,...
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
— Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general app...
Miguel Castro, Michael B. Jones, Anne-Marie Kermar...