A paracasting model for concurrent access to replicated content

We propose a framework to study how to download effectively a copy of the same document from a set of replicated servers. A generalized application-layer anycasting, known as paracasting, has been proposed to advocate concurrent access of a subset of replicated servers to satisfy cooperatively a client's request. Each participating server satisfies the request in part by transmitting a subset of the requested file to the client. The client can recover the complete file when different parts of the file sent from the participating servers are received. This framework allows us to estimate the average time to download a file from the set of homogeneous replicated servers, and the request blocking probability when each server can accept and serve a finite number of concurrent. requests. Our results show that the file download time drops when a request is served concurrently by a larger number of homogeneous replicated servers, although the performance improvement quickly saturates when the number of servers used increases. If the total number of requests that a server can handle simultaneously is finite, the request blocking probability increases with the number of replicated servers used to serve a request concurrently. Therefore, paracasting is effective in using a small number of servers, say, up to four, to serve a request concurrently.published_or_final_versio

A heterogeneous peer-to-peer network testbed

In this paper, we describe a heterogeneous peer-to-peer network testbed, which is developed as part of a joint research project to investigate novel resource discovery and content distribution protocols in a heterogeneous wired/wireless environment. We describe the testbed requirements, the testbed architecture, the multi-functional wireless node, and the software architecture. We also describe some of the proposed protocols to be developed and tested on the testbed. © 2009 IEEE.published_or_final_versionThe 1st International Conference on Ubiquitous and Future Networks (ICUFN 2009), Hong Kong, 7-9 June 2009. In Proceedings of the 1st ICUFN, 2009, p. 46-5

A paracasting model for concurrent access to replicated internet content

In this paper, we develop a model to study how to effectively download a document from a set of replicated servers. We propose a generalized application-layer anycasting protocol, known as paracasting, to advocate concurrent access of a subset of replicated servers to cooperatively satisfy a client's request. Each participating server satisfies the request in part by transmitting a subset of the requested file to the client. The client can recover the complete file when different parts of the file sent from the participating servers are received. This model allows us to estimate the average time to download a file from the set of homogeneous replicated servers, and the request blocking probability when each server can accept and serve a finite number of concurrent requests. Our results show that the file download time drops when a request is served concurrently by a larger number of homogeneous replicated servers, although the performance improvement quickly saturates when the number of servers increases. If the total number of requests that a server can handle simultaneously is finite, the request blocking probability increases with the number of replicated servers used to serve a request concurrently. Therefore, paracasting is effective when a small number of servers, say, up to four, are used to serve a request concurrently. © 2006 IEEE.published_or_final_versio