#### Filter Results:

- Full text PDF available (54)

#### Publication Year

2003

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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 inspired by the recently introduced variation of greedy routing, called neighbor–of–neighbor (NoN), which allows to get optimal average path length with respect to the degree. Our… (More)

- Gennaro Cordasco, Alessandra Sala
- HOT-P2P
- 2005

— We present 2-Chord Halved, a distributed peer-to-peer lookup protocol. This protocol, as Chord [24], uses consistent hashing [5], [7] to assign keys to nodes. Consistent hashing tends to balance load, since each node receives roughly the same number of keys, and requires relatively little movement of keys when nodes join and leave the system. Our proposal… (More)

- Gennaro Cordasco, Arnold L. Rosenberg
- Int. J. Found. Comput. Sci.
- 2014

We describe a P2P system that offers a distributed, cooperative and adaptive environment for bookmark sharing. DAD offers an adaptive environment since it provides suggestions about the navigation based on (a) the bookmarks, (b) the feedback implicitly provided by users and (c) the structure of the Web. Our system is fully scalable because of its… (More)

- Ferdinando Cicalese, Gennaro Cordasco, Luisa Gargano, Martin Milanic, Ugo Vaccaro
- Theor. Comput. Sci.
- 2013

Motivated by applications in sociology, economy and medicine, we study variants of the Target Set Selection problem, first proposed by Kempe, Kleinberg and Tardos. In our scenario one is given a graph G = (V, E), integer values t(v) for each vertex v (thresholds), and the objective is to determine a small set of vertices (target set) that activates a given… (More)

- Biagio Cosenza, Gennaro Cordasco, Rosario De Chiara, Vittorio Scarano
- 2011 19th International Euromicro Conference on…
- 2011

We focus on agent-based simulations where a large number of agents move in the space, obeying to some simple rules. Since such kind of simulations are computational intensive, it is challenging, for such a contest, to let the number of agents to grow and to increase the quality of the simulation. A fascinating way to answer to this need is by exploiting… (More)

- Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
- IEEE Transactions on Parallel and Distributed…
- 2007

Earlier work has developed the underpinnings of the IC-scheduling theory, a framework for scheduling computations having intertask dependencies - modeled via directed acyclic graphs (DAGs) - for Internet-based computing. The goal of the schedules produced is to render tasks eligible for execution at the maximum possible rate, with the dual aim of 1)… (More)

- Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
- 2007 IEEE International Parallel and Distributed…
- 2007

Earlier work has developed the underpinnings of IC-scheduling theory, an algorithmic framework for scheduling computations having intertask dependencies for Internet-based computing (IC). The theory aims to produce schedules that render tasks eligible for execution at the maximum possible rate, so as to: (a) utilize remote clients' computational resources… (More)

- Gennaro Cordasco, Grzegorz Malewicz, Arnold L. Rosenberg
- 16th Euromicro Conference on Parallel…
- 2008

Earlier work has developed the rudiments of a scheduling theory for computations having intertask dependencies - modeled via dags - for Internet-based computing. The goal of the schedules produced is to render tasks eligible for execution as fast as possible, with the aim of: (a) utilizing clients' computational resources well, by always having work to… (More)

- Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, Mikael Hammar, Alberto Negro, Vittorio Scarano
- Theory Comput. Syst.
- 2009

We define a family of Distributed Hash Table systems whose aim is to combine the routing efficiency of randomized networks—e.g. optimal average path length O(log 2 n/δ log δ) with δ degree—with the programmability and startup efficiency of a uniform overlay—that is, a deterministic system in which the overlay network is transitive and greedy routing is… (More)