% % This file was created by the TYPO3 extension % bib % --- Timezone: UTC % Creation date: 2024-10-06 % Creation time: 16-42-32 % --- Number of references % 9 % @Conference { rieche2004thermaldissipation, title = {A Thermal-Dissipation-based Approach for Balancing Data Load in Distributed Hash Tables}, year = {2004}, month = {11}, pages = {15-23}, abstract = {A major objective of peer-to-peer (P2P) systems is the management of large amounts of data distributed across many systems. Distributed hash tables (DHT) are designed for highly scalable, self-organizing, and efficient distribution and lookup of data, whereby data is stored globally persistent. The range of values of the corresponding hash function is partitioned and each interval is assigned to a node of the DHT. Because the assignment of data to nodes is based on hash functions, one assumes that the respective data load is distributed evenly across all participating nodes. However most DHT show difficulties with load balancing as we demonstrate in this paper. As a solution for this problem, we present a new and very simple approach for balancing stored data between peers in a fashion analogous to the dissipation of heat energy in materials. We compare this algorithm with other approaches for load balancing and present results based on simulations and a prototype implementation. This new algorithm improves the distribution of load in DHT without requiring major changes of the DHT themselves. In addition, we show that the fault tolerance of peer-to-peer systems is increased by the proposed algorithm.}, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?isnumber=29935\&arnumber=1367197\&count=128\&index=2}, misc2 = {Print}, publisher = {IEEE Press}, booktitle = {Proceedings of LCN 2004 – 29th IEEE Conference on Local Computer Networks}, organization = {IEEE}, event_place = {Tampa, Florida, USA}, event_name = {LCN 2004 – 29th IEEE Conference on Local Computer Networks}, event_date = {November 2004}, language = {en}, ISBN = {0-7695-2260-2}, DOI = {10.1109/LCN.2004.10}, author = {Rieche, Simon and Petrak, Leo and Wehrle, Klaus} } @Inproceedings { 200410riechehotp2preliability, title = {Reliability of Data in Structured Peer-to-Peer Systems}, year = {2004}, month = {10}, pages = {108-113}, abstract = {Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. For this purpose Distributed Hash Tables (DHT) offer a highly scalable and self-organizing paradigm for efficient distribution and retrieval of data. Thereby a common assumption of P2P-Systems is, that the participating nodes are unreliable and may fail at any time. Since many of research goes into the design of DHT lookup services, these systems aim to provide a stable global addressing structure. But to storage data reliable in a DHT only few techniques were already developed. However since data has to be stored persistent in the network, it should be retrieved anytime, even if nodes fail. In this work we discuss possibilities to store data fault tolerant in a structured Peer-to-Peer system.}, misc2 = {Print}, booktitle = {Proceedings of HOT-P2P '04: Hot Topics in Peer-to-Peer Computing at 12th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)}, event_place = {Volendam, Netherlands}, event_name = {HOT-P2P '04: Hot Topics in Peer-to-Peer Computing at 12th Annual Meeting of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer}, event_date = {Oct. 2004}, language = {en}, reviewed = {1}, author = {Rieche, Simon and Wehrle, Klaus and Landsiedel, Olaf and G{\"o}tz, Stefan and Petrak, Leo} } @Inproceedings { rieche2004comparison, title = {Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems}, year = {2004}, month = {9}, volume = {51}, misc2 = {Print}, publisher = {GI. LNI}, address = {Bonn, Germany}, series = {LNI}, booktitle = {Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004}, event_place = {Ulm, Germany}, event_name = {GI-Jahrestagung Informatik 2004}, language = {en}, reviewed = {1}, author = {Rieche, Simon and Petrak, Leo and Wehrle, Klaus} } @Inproceedings { 2006-heer-gi2004, title = {On the Use of Structured P2P Indexing Mechanisms in Mobile Ad-Hoc Scenarios}, year = {2004}, month = {9}, volume = {51}, pages = {239-244}, abstract = {Recently, Distributed Hash Tables evolved to a preferred approach for decentralized data management in widely distributed systems. Due to their crucial characteristics – namely scalability, flexibility, and resilience – they are quite interesting for being applied in ad-hoc networks. But, there are plenty of open questions concerning the applicability of Distributed Hash Tables in mobile ad-hoc scenarios: Do new problems arise when both technologies are used together? Are there any synergy effects when both technologies are combined? Are the results and assumptions, made for the infrastructural Internet, still true if a mobile ad-hoc network is used instead? In this paper, we discuss these and further questions and offer some solutions for using Distributed Hash Tables in ad-hoc networks.}, misc2 = {Print}, publisher = {GI. LNI}, address = {Bonn, Germany}, series = {LNI}, booktitle = {Proceedings of Workshop on Algorithms and Protocols for Efficient Peer-to-Peer Applications (PEPPA), GI-Jahrestagung Informatik 2004, Bonn, Germany}, event_place = {Ulm, Germany}, event_name = {GI-Jahrestagung Informatik 2004}, language = {en}, ISBN = {3-88579-380-6}, reviewed = {1}, author = {Heer, Tobias and Niedermayer, Heiko and Petrak, Leo and Rieche, Simon and Wehrle, Klaus} } @Article { 2004steinmetzwehrleP2PNetworking, title = {Peer-to-Peer-Networking \& -Computing}, journal = {Informatik-Spektrum}, year = {2004}, volume = {27}, number = {1}, pages = {51-54}, author = {Steinmetz, Ralf and Wehrle, Klaus} } @Inproceedings { 200410wehrlefgpcintegriertekonstruktionsmethode, title = {Integrierte Konstruktionsmethoden f{\"u}r flexible Protokolle in ubiquit{\"a}ren Kommunikationssystemen}, year = {2004}, address = {Stuttgart, Germany}, booktitle = {Proceedings of the GI/ITG KuVS Fachgespr{\"a}ch Systemsoftware f{\"u}r Pervasive Computing}, author = {Wehrle, Klaus and Landsiedel, Olaf and Rieche, Simon and G{\"o}tz, Stefan and Petrak, Leo} } @Inproceedings { 200407wehrlesmsoipncontentoriented, title = {Content-oriented Bridging of Today's Internet Heterogeneity}, year = {2004}, number = {04411}, editor = {Matthias Bossardt and Georg Carle and D. Hutchison and Hermann de Meer and Bernhard Plattner}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, series = {Dagstuhl Seminar Proceedings}, booktitle = {Service Management and Self-Organization in IP-based Networks}, author = {Wehrle, Klaus and G{\"o}tz, Stefan} } @Inproceedings { 200410acmmultimediai3composition, title = {Support for Service Composition in i3}, year = {2004}, url = {http://i3.cs.berkeley.edu}, address = {New York, USA}, booktitle = {Proceedings of ACM Multimedia 2004}, organization = {ACM}, author = {Lakshminarayanan, Karthik and Stoica, Ion and Wehrle, Klaus} } @Techreport { 200606i3proxytechreport, title = {Supporting Legacy Applications over i3}, year = {2004}, number = {UCB/CSD-04-1342}, abstract = {Providing support for legacy applications is a crucial component of many overlay networks, as it allows end-users to instantly benefit from the functionality introduced by these overlays. This paper presents the design and implementation of a proxy-based solution to support legacy applications in the context of the i3 overlay [24]. The proxy design relies on an address virtualization technique which allows the proxy to tunnel the legacy traffic over the overlay transparently. Our solution can preserve IP packet headers on an end-to-end basis, even when end-host IP addresses change, or when endhosts live in different address spaces (e.g., behind NATs). In addition, our solution allows the use of human-readable names to refer to hosts or services, and requires no changes to applications or operating systems. To illustrate how the proxy enables legacy applications to take advantage of the overlay (i.e., i3) functionality, we present four examples: enabling access to machines behind NAT boxes, secure Intranet access, routing legacy traffic through Bro, an intrusion detection system, and anonymous web download. We have implemented the proxy on Linux andWindows XP/2000 platforms, and used it over the i3 service on PlanetLab over a three month period with a variety of legacy applications ranging from web browsers to operating system-specific file sharing.}, url = {http://i3.cs.berkeley.edu}, address = {UCB, Berkeley, USA}, institution = {University of California at Berkeley}, type = {Technical Report}, author = {Kannan, Jayanthkumar and Kubota, Ayumu and Lakshminarayanan, Karthik and Stoica, Ion and Wehrle, Klaus} }