Christoph Lindemann

Learn More
Establishing peer-to-peer (P2P) file sharing for mobile ad hoc networks (MANET) requires the construction of a search algorithm for transmitting queries and search results as well as the development of a transfer protocol for downloading files matching a query. In this paper, we present a specialpurpose system for searching and file transfer tailored to(More)
In this paper, we introduce a novel congestion control algorithm for TCP over multihop IEEE 802.11 wireless networks implementing rate-based scheduling of transmissions within the TCP congestion window. We show how a TCP sender can adapt its transmission rate close to the optimum using an estimate of the current 4-hop propagation delay and the coefficient(More)
Stochastic Petri nets (SPNs) with generally distributed firing times can model a large class of systems, but simulation is the only feasible approach for their solution. We explore a hierarchy of SPN classes where modeling power is reduced in exchange for an increasingly efficient solution. Generalized stochastic Petri nets (GSPNs), deterministic and(More)
In what case do you like reading so much? What about the type of the performance modelling with deterministic and stochostic petri nets book? The needs to read? Well, everybody has their own reason why should read some books. Mostly, it will relate to their necessity to get knowledge from the book and want to read just to get entertainment. Novels, story(More)
In this paper, we present the concept of Passive Distributed Indexing, a general-purpose distributed search service for mobile file sharing applications, which is based on peer-to-peer technology. The service enables resource-effective searching for files distributed across mobile devices based on simple queries. Building blocks of PDI constitute local(More)
In this paper, we show how to utilize the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the batch Markovian arrival process (BMAP). In fact, effective computational formulas for the E-step of the EM algorithm are presented, which utilize the well-known randomization technique and a stable calculation of(More)
This paper characterizes the query behavior of peers in a peer-to-peer (P2P) file sharing system. In contrast to previous work, which provides various aggregate workload statistics, we characterize peer behavior in a form that can be used for constructing representative synthetic workloads for evaluating new P2P system designs. In particular, the analysis(More)
In this paper, we identify the batch Markovian arrival process (BMAP) as analytically tractable model of choice for aggregated traffic modeling of IP networks. The key idea of this aggregated traffic model lies in customizing the batch Markovian arrival process such that the different lengths of IP packets are represented by rewards (i.e., batch sizes of(More)
In this paper, we present a synthetic traffic model for the Universal Mobile Telecommunication Systems (UMTS) based on measured trace data. The analysis and scaling process of the measured trace data with respect to different bandwidth classes constitutes the basic concept of the UMTS traffic characterization. Furthermore, we introduce an aggregated traffic(More)