Search For:

Displaying 1-9 out of 9 total
Modelling the Internet Delay Space Based on Geographical Locations
Found in: Parallel, Distributed, and Network-Based Processing, Euromicro Conference on
By Sebastian Kaune, Konstantin Pussep, Christof Leng, Aleksandra Kovacevic, Gareth Tyson, Ralf Steinmetz
Issue Date:February 2009
pp. 301-310
Existing approaches for modelling the Internet delay space predict end-to-end delays between two arbitrary hosts as static values. Further, they do not capture the characteristics caused by geographical constraints. Peer-to-peer (P2P) systems are, however,...
 
Towards Benchmarking of Structured Peer-to-Peer Overlays for Network Virtual Environments
Found in: Parallel and Distributed Systems, International Conference on
By Aleksandra Kovacevic, Kalman Graffi, Sebastian Kaune, Christof Leng, Ralf Steinmetz
Issue Date:December 2008
pp. 799-804
Network virtual environments (NVE) are an evolving trend combining millions of users in an interactive community. A distributed NVE platform promises to lower the administration costs and to benefit from research done in the peer-to-peer (p2p) domain. In o...
 
Peer-to-Peer Based Version Control
Found in: Parallel and Distributed Systems, International Conference on
By Patrick Mukherjee, Christof Leng, Wesley W. Terpstra, Andy Schürr
Issue Date:December 2008
pp. 829-834
Many software projects are developed by globally distributed teams. The nature of the peer-to-peer paradigm fits to such an application scenario. However, existing tools to support developer require a central instance, like it is the case in version control...
 
Piki - A Peer-to-Peer based Wiki Engine
Found in: Peer-to-Peer Computing, IEEE International Conference on
By Patrick Mukherjee, Christof Leng, Andy Schürr
Issue Date:September 2008
pp. 185-186
The wiki technology [4] proved to be an appropriate tool for sharing global knowledge, as it provides an easy way to contribute and consume information. The way wikis are used, e.g. consuming and contributing information, naturally matches the peer-to-peer...
 
An online gaming testbed for peer-to-peer architectures
Found in: Proceedings of the ACM SIGCOMM 2011 conference on SIGCOMM (SIGCOMM '11)
By Alejandro Buchmann, Christof Leng, Max Lehn, Robert Rehner, Tonio Triebel
Issue Date:August 2011
pp. 474-475
In this demo we present a testbed environment for Peer-to-Peer (P2P) game architectures. It is based on Planet PI4, an online multiplayer game whose gameplay provides a standard workload for a set of gaming-specific network interfaces. Its pluggable archit...
     
Designing a testbed for large-scale distributed systems
Found in: Proceedings of the ACM SIGCOMM 2011 conference on SIGCOMM (SIGCOMM '11)
By Alejandro Buchmann, Christof Leng, Max Lehn, Robert Rehner
Issue Date:August 2011
pp. 400-401
Different evaluation methods for distributed systems like prototyping, simulation and emulation have different tradeoffs. We present a testbed for Internet applications that supports real-network prototypes and multiple simulators with unchanged applicatio...
     
Maintaining replicas in unstructured P2P systems
Found in: Proceedings of the 2008 ACM CoNEXT Conference (CONEXT '08)
By Alejandro P. Buchmann, Bettina Kemme, Christof Leng, Wesley W. Terpstra, Wilhelm Stannat
Issue Date:December 2008
pp. 1-12
Replication is widely used in unstructured peer-to-peer systems to improve search or achieve availability. We identify and solve a subclass of replication problems where each object is associated with a maintainer node, and its replicas should only be avai...
     
Bubblestorm: resilient, probabilistic, and exhaustive peer-to-peer search
Found in: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM '07)
By Alejandro P. Buchmann, Christof Leng, Jussi Kangasharju, Wesley W. Terpstra
Issue Date:August 2007
pp. 652-652
Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness. Thus, they are an attractive platform for file sharing, distributed wikis, and search engines. These applications often store weakly structured data, requiring sophisticate...
     
Practical summation via gossip
Found in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (PODC '07)
By Alejandro P. Buchmann, Christof Leng, Wesley W. Terpstra
Issue Date:August 2007
pp. 390-391
Distributed summation is computed in asymptotically minimal rounds by Kempe et al's Push-Sum algorithm. Unfortunately it has minor problems in practise, resolved here.
     
 1