Learn More
Personal Digital Assistants (PDAs) and other mobile computing devices rely on synchronization protocols in order to maintain data consistency. These protocols operate in environments where network resources such as bandwidth, memory and processing power are limited. In this paper, we examine a number of popular and representative synchronization protocols,(More)
Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as " slow sync " for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage, latency, and energy consumption, since the PDA and PC typically share many common records. We propose,(More)
— The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applications, ranging from digital video broadcast to software updates. Yet, traditional rateless codes usually make no use of a feedback communication channel, a feature available in(More)
The rapid advent of " Web 2.0 " applications has unleashed new HTTP traffic patterns which differ from the conventional HTTP request-response model. In particular, asynchronous pre-fetching of data in order to provide a smooth web browsing experience and richer HTTP payloads (e.g., Javascript libraries) of Web 2.0 applications induce larger, heavier, and(More)
— Modern Personal Digital Assistant (PDA) architectures often utilize a wholesale data transfer protocol known as " slow sync " for synchronizing PDAs with Personal Computers (PCs). This approach is markedly inefficient with respect to bandwidth usage and latency, since the PDA and PC typically share many common records. We propose, analyze, and implement a(More)
— We present novel rateless codes that generalize and outperform LT codes (with respect to overall communication and computation complexity) when some input symbols are already available at the decoding host. This case can occur in data synchronization scenarios, or where feedback is provided or can be inferred from transmission channel models. We provide(More)
At the ECRYPT Hash Workshop 2007, Finiasz, Gaborit, and Sendrier proposed an improved version of a previous provably secure syndrome-based hash function. The main innovation of the new design is the use of a quasi-cyclic code in order to have a shorter description and to lower the memory usage. In this paper, we look at the security implications of using a(More)
Organizations opt to reduce costs by contracting their day-today computing needs to service providers who offer large-scale data centers and cloud computing services. Like other computing commodities, data centers provide paid services that require careful pricing. Using a Stackelberg game formulation, we present a demand-based pricing model for maximizing(More)
Of considerable interest in recent years has been the problem of exchanging correlated data with minimum communication. We thus consider the problem of exchanging two similar strings held by different hosts. Our approach involves transforming a string into a multi-set of substrings that are reconciled efficiently using known multi-set reconciliation(More)
This paper proposes a novel expert peering system for information exchange. Our objective is to develop a real-time search engine for an online community where users can query experts, who are simply other participating users knowledgeable in that area, for help on various topics. We consider a graph-based scheme consisting of an ontology tree where each(More)