Antti Yla-Jaaski

Work place: Department of Computer Science& Engineering, Aalto University, Helsinki, Finland



Research Interests: Computer systems and computational processes, Systems Architecture, Mathematics of Computing


Antti Yla-Jaaski is a Professor for the Data communications software laboratory(major and minor) since 2002 at the Department of Computer Science and Engineering, Aalto University, Helsinki Finland. He received his PhD from ETH Zurich in 1993. He has worked with Nokia from 1994-2004 in several research and research management positions with focus on future Internet, mobile networks, applications, services and service architectures. He was a Research Fellow on Internet Technologies in Nokia Research Center until 2008. In Data Communications Software, his expertise area is Internet technologies, application and service development in the Internet, and network architectures. Currently his primary research interests include Green ICT, energy efficient communications and computing, cloud computing, massive scale machine-to-machine communication systems and Internet of Things. 

Author Articles
Distributed Algorithms for Improving Search Efficiency in P2P Overlays

By Chittaranjan Hota Vikram Nunia Antti Yla-Jaaski

DOI:, Pub. Date: 8 Apr. 2012

Peer-to-peer (P2P) overlay is a distributed application architecture in which peers share their resources. Peers are equally privileged, equipotent participants in the application. Several algorithms for enhancing P2P file searching have been proposed in the literature. In this paper, we have proposed a unique approach of reducing the P2P search complexity and improving search efficiency by using distributed algorithms. In our approach a peer mounts other popular peer's files and also replicates other popular files or critical files identified using a threshold value. Once a file is mounted, file access requests can be serviced by transparently retrieving the file and sending it to the requesting peer. Replication used in this work improves the file retrieval time by allowing parallel transfer. We have shown the performance analysis of our proposed approach which shows improvement in the search efficiency.

[...] Read more.
Other Articles