Alberto Montresor

Alberto Montresor

Auto-generated profile, based on publicly available information

Alberto Montresor

University of Trento

Research Focus & Metrics

Academic Career Length

29Years (1998-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2005 in ACM Transactions on Computer Systems
Verified
Journal Article
Open access
PDF file
MJMárk Jelasity
Márk Jelasity
AMAlberto Montresor
Alberto Montresor
OBOzalp Babaoglu
Ozalp Babaoglu
As computer networks increase in size, become more heterogeneous and span greater geographic distances, applications must be designed to cope with the very large scale, poor reliability, and often, with the extreme dynamism of the underlying network. Aggregation is a key functional building block for such applications: it refers to a set of functions that provide components of a distributed system access to global information including network size, average load, average uptime, location and description of hotspots, and so on. Local access to global information is often very useful, if not indispensable for building applications that are robust and adaptive. For example, in an industrial control application, some aggregate value reaching a threshold may trigger the execution of certain actions; a distributed storage system will want to know the total available free space; load-balancing protocols may benefit from knowing the target average load so as to minimize the load they transfer. We propose a gossip-based protocol for computing aggregate values over network components in a fully decentralized fashion. The class of aggregate functions we can compute is very broad and includes many useful special cases such as counting, averages, sums, products, and extremal values. The protocol is suitable for extremely large and highly dynamic systems due to its proactive structure---all nodes receive the aggregate value continuously, thus being able to track any changes in the system. The protocol is also extremely lightweight, making it suitable for many distributed applications including peer-to-peer and grid computing systems. We demonstrate the efficiency and robustness of our gossip-based protocol both theoretically and experimentally under a variety of scenarios including node and communication failures.

1 September 2009
Verified
Conference Paper
Closed access
AMAlberto Montresor
Alberto Montresor
MJMark Jelasity
Mark Jelasity
The key features of peer-to-peer (P2P) systems are scalability and dynamism. The evaluation of a P2P protocol in realistic environments is very expensive and difficult to reproduce, so simulation is crucial in P2P research. PeerSim is an extremely scalable simulation environment that supports dynamic scenarios such as churn and other failure models. Protocols need to be specifically implemented for the PeerSim Java API, but with a reasonable effort they can be evolved into a real implementation. Testing in specified parameter-spaces is supported as well. PeerSim started out as a tool for our own research.

1 September 2006 in ACM Transactions on Autonomous and Adaptive Systems
Verified
Journal Article
Open access
OBOzalp Babaoglu
Ozalp Babaoglu
GCGeoffrey Canright
Geoffrey Canright
ADAndreas Deutsch
Andreas Deutsch
GCGianni A. Di Caro
Gianni A. Di Caro
FDFrederick Ducatelle
Frederick Ducatelle
TUTore Urnes
Tore Urnes
Recent developments in information technology have brought about important changes in distributed computing. New environments such as massively large-scale, wide-area computer networks and mobile ad hoc networks have emerged. Common characteristics of these environments include extreme dynamicity, unreliability, and large scale. Traditional approaches to designing distributed applications in these environments based on central control, small scale, or strong reliability assumptions are not suitable for exploiting their enormous potential. Based on the observation that living organisms can effectively organize large numbers of unreliable and dynamically-changing components (cells, molecules, individuals, etc.) into robust and adaptive structures, it has long been a research challenge to characterize the key ideas and mechanisms that make biological systems work and to apply them to distributed systems engineering. In this article we propose a conceptual framework that captures several basic biological processes in the form of a family of design patterns. Examples include plain diffusion, replication, chemotaxis, and stigmergy. We show through examples how to implement important functions for distributed computing based on these patterns. Using a common evaluation methodology, we show that our bio-inspired solutions have performance comparable to traditional, state-of-the-art solutions while they inherit desirable properties of biological systems including adaptivity and robustness.

1 August 2009 in Computer Networks
Verified
Journal Article
Closed access
MJMárk Jelasity
Márk Jelasity
AMAlberto Montresor
Alberto Montresor
OBOzalp Babaoglu
Ozalp Babaoglu

24 April 2012 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
AMAlberto Montresor
Alberto Montresor
FPFrancesco De Pellegrini
Francesco De Pellegrini
DMDaniele Miorandi
Daniele Miorandi
Several novel metrics have been proposed in recent literature in order to study the relative importance of nodes in complex networks. Among those, k-coreness has found a number of applications in areas as diverse as sociology, proteinomics, graph visualization, and distributed system analysis and design. This paper proposes new distributed algorithms for the computation of the k-coreness of a network, a process also known as k-core decomposition. This technique 1) allows the decomposition, over a set of connected machines, of very large graphs, when size does not allow storing and processing them on a single host, and 2) enables the runtime computation of k-cores in “live” distributed systems. Lower bounds on the algorithms complexity are given, and an exhaustive experimental analysis on real-world data sets is provided.

25 June 2003
Verified
Conference Paper
Closed access
OBO. Babaoglu
O. Babaoglu
HMH. Meling
H. Meling
AMA. Montresor
A. Montresor