Enabling technologies for decentralized interpersonal communication
No Thumbnail Available
URL
Journal Title
Journal ISSN
Volume Title
Aalto-yliopiston teknillinen korkeakoulu |
Doctoral thesis (article-based)
Checking the digitized thesis and permission for publishing
Instructions for the author
Instructions for the author
Authors
Date
2010
Major/Subject
Mcode
Degree programme
Language
en
Pages
Verkkokirja (497 KB, 84 s.)
Series
TKK dissertations,
250
Abstract
In the recent years the Internet users have witnessed the emergence of Peer-to-Peer (P2P) technologies and applications. One class of P2P applications is comprised of applications that are targeted for interpersonal communication. The communication applications that utilize P2P technologies are referred to as decentralized interpersonal communication applications. Such applications are decentralized in a sense that they do not require assistance from centralized servers for setting up multimedia sessions between users. The invention of Distributed Hash Table (DHT) algorithms has been an important, but not an inclusive enabler for decentralized interpersonal communication. Even though the DHTs provide a basic foundation for decentralization, there are still a number of challenges without viable technological solutions. The main contribution of this thesis is to propose technological solutions to a subset of the existing challenges. In addition, this thesis also presents the preliminary work for the technological solutions. There are two parts in the preliminary work. In the first part, a set of DHT algorithms are evaluated from the viewpoint of decentralized interpersonal communication, and the second part gives a coherent presentation of the challenges that a decentralized interpersonal communication application is going to encounter in mobile networks. The technological solution proposals contain two architectures and two algorithms. The first architecture enables an interconnection between a decentralized and a centralized communication network, and the second architecture enables the decentralization of a set of legacy applications. The first algorithm is a load balancing algorithm that enables good scalability, and the second algorithm is a search algorithm that enables arbitrary searches. The algorithms can be used, for example, in DHT-based networks. Even though this thesis has focused on the decentralized interpersonal communication, some of the proposed technological solutions also have general applicability outside the scope of decentralized interpersonal communication.Description
Supervising professor
Ylä-Jääski, Antti, Prof.Keywords
peer-to-peer, distributed hash table, interconnection, decentralization, load balancing, search
Other note
Parts
-
© 2007 Association for Computing Machinery (ACM). By permission.
DOI: 10.1145/1329469.1329479 View at publisher
-
© 2009 IGI Global. By permission.
DOI: 10.4018/978-1-60566-715-7.ch015 View at publisher
-
© 2008 Institute of Electrical and Electronics Engineers (IEEE). By permission.
DOI: 10.1109/NGMAST.2008.60 View at publisher
- [Publication 4]: Jani Hautakorpi, Gonzalo Camarillo, and David López. Framework for decentralising legacy applications. International Journal of Grid and Utility Computing (IJGUC), Special Issue, 10 pages, accepted for publication. © 2010 Inderscience Enterprises. By permission.
-
© 2010 Association for Computing Machinery (ACM). By permission.
DOI: 10.1145/1774088.1774225 View at publisher
-
© 2010 Institute of Electrical and Electronics Engineers (IEEE). By permission.
DOI: 10.1109/ICCCN.2010.5560101 View at publisher