In this paper, we present a lightweight but powerful plug-in container which provides advanced features such as dynamic class loading, dependency, configuration, and security management. We highlight the deployment mechanism which allows to publish, install, and update plug-ins from arbitrary sources at runtime. Furthermore, we introduce the Trooth voting and trust system which is used to assess plug-ins but has been designed as a general ...

When being deployed, ad-hoc and sensor networks are unstructured and lack an efficient and reliable communication scheme. Hence, the organization of a MAC layer is the primary goal during and immediately after the deployment of such networks. Computing a good initial clustering facilitates this task and is therefore a vital part of the initialization process. A clustering based on a maximal independent set provides several highly desirable ...

In this paper we introduce the distributed approximative system information service (DASIS) as a useful means to collect approximate information about a peer-to-peer system. As an example application we show how this service can be employed for establishing an eective determinis- tic join algorithm. Through simulation we demonstrate that insertion of peers using the service results in a well- balanced system. Moreover, our join algorithm ...

Routing in the Internet is strongly shaped by the business relationships between administrative domains (Autonomous Systems, AS). In this paper we propose new techniques to classify these relationships. Inspired by Lixin Gao’s seminal work on valley-free paths, we explore several ways to measure the importance of an AS which go beyond the original degree-ranking. In addition we study what information can be gathered by parsing the Routing ...