[show abstract][hide abstract] ABSTRACT: In recent years, content-centric networking has become an active area of research. However, the proposals in this area often use custom protocols for the last mile communication between end users and content networks, which makes the technologies hard to be adopted. In this paper we present a content aware publish-subscribe protocol, called CAT, that can become a common solution for end users to access different content-centric networks. We discuss how CAT protocol can be implemented implemented with HTTP. We analyze the performance of a CAT proxy and discuss the potential performance improvements brought by parallel access and data caching.
Communications Workshops (ICC), 2011 IEEE International Conference on; 07/2011
[show abstract][hide abstract] ABSTRACT: Platforms, runtimes, and middleware play a vital role in an evolving mobile computing environment in which the trend is toward converged communication, where Web resources integrate seamlessly with mobile systems.
[show abstract][hide abstract] ABSTRACT: In a segmented peer-to-peer video-on-demand system the video file is split into a number of segments and the downloading of the video file proceeds in a more or less sequential manner from one segment to another (i.e., in stages). We present an analytical fluid model for such systems. Notably, for this model we derive an explicit condition when the system has a unique positive steady-state solution and that the viewing quality is acceptable. The analytical results are complemented with extensive simulations from the corresponding stochastic model, as well as traces from a more realistic BitTorrent simulator.
Teletraffic Congress (ITC), 2010 22nd International; 10/2010
[show abstract][hide abstract] ABSTRACT: In this paper, we present an outline of a new system called Canopy that supports publish/subscribe over the Internet by using upgraph information. In order to be able to derive pub/sub multicast structures for subscribers and publishers, a content distribution system, called rendezvous system, needs to know about packet replication points and policy-compliant paths. This information can be given to the rendezvous system by the subscribers and publishers by sending their upgraphs to pertinent rendezvous entities. The upgraphs contain all the possible paths from a given node to the tier-1 core networks. The upgraphs can then be combined to determine the subset or subspace of network topology that is relevant for the distribution of the information. We consider issues such a upgraph representation,peer-to-peer links between autonomous domains, multi-path operation, and applications of the technique.
INFOCOM IEEE Conference on Computer Communications Workshops , 2010; 04/2010
[show abstract][hide abstract] ABSTRACT: Many network solutions and overlay networks utilize probabilistic techniques to reduce information processing and networking costs. This survey article presents a number of frequently used and useful probabilistic techniques. Bloom filters and their variants are of prime importance, and they are heavily used in various distributed systems. This has been reflected in recent research and many new algorithms have been proposed for distributed systems that are either directly or indirectly based on Bloom filters. In this survey, we give an overview of the basic and advanced techniques, reviewing over 20 variants and discussing their application in distributed systems, in particular for caching, peer-to-peer systems, routing and forwarding, and measurement data summarization.