— Online games are an interesting challenge and chance for the future development of the Peer-to-Peer paradigm. Massively multiplayer online games (MMOGs) are becoming increasingly popular today. However, even high-budget titles like World of Warcraft that have gone through extensive beta-testing suffer from downtimes because of hard-and software problems.… (More)
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… (More)
In this position paper we propose an evaluation framework for networked mobile gaming, consisting of user, group, communication, and environment models. Each of these components acts as a detailed representation of real-world characteristics. The combination of these models allows a realistic modeling of mobile gaming scenarios. The main contribution of our… (More)
Structured Peer-to-Peer systems are designed for a highly scalable, self organizing, and efficient lookup for data. The key space of the so-called Distributed Hash Tables (DHTs) is partitioned and each partition with its keys and values is assigned to a node in the DHT. For data retrieval however, the very nature of hash tables allows only exact pattern… (More)
Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalable and self-organizing approach for efficient and persistent distribution and retrieval of data. However the scalability and performance of DHTs is strongly based on an equal distribution of… (More)
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… (More)
Strukturierte Peer-to-Peer (P2P) Netzwerke weisen heutzutage immer weni-ger Fehleranfälligkeit oder signifikante Skalierbarkeitsprobleme auf. Sie bilden daher eine gute Basis für anspruchsvolle Aufgaben, wie z.
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… (More)