In streaming systems the content distribution network routes streams based on interests registered by the consuming entities. In hierarchical streaming, the dissemination is also predicated on the resolution of hierarchical dependencies between various streams. Entities specify explicit wildcards, in addition to the implicit ones in place, to further control the types of streams within a given ...

Fast Flux Service Networks (FFSN) apply high availability server techniques to the business of malware distribution. FFSNs are similar to commercial content distribution networks (CDN), such as Akamai, in terms of size, scope, and business model, serving as an outsourced content delivery service for clients. Using an analysis of DNS traffic, we derive a sequential hypothesis-testing algorithm b...

In this work, we consider a large-scale distributed network of servers and a problem of content distribution across it. We propose a novel algorithm, called FastReplica, for an efficient and reliable replication of large files in the Internet environment. There are a few basic ideas exploited in FastReplica. In order to replicate a large file among n nodes (n is in the range of 10-30 nodes), th...

Assignment problem in content distribution networks (CDN) is unsplittable hard-capacitated facility location problem (UHCFLP) because of underlying anycast routing protocol. We extend assignment problem in CDN to multidimensional facility location problem (MFLP). With our devised algorithm, assignment cost considers CPU utilization parameter along with request size and distance between client a...

The growing online traffic that is bringing the infrastructure to its limits induces an urgent demand for an efficient content delivery model. Capitalizing social networks and using advanced delivery networks potentially can help to solve this problem. However, due to the complex nature of the involved networks such a model is difficult to assess. In this paper we use a simulative approach to a...

Content distribution networks (CDNs) are a recent development to improve the performance of networked applications. The design of replica placement algorithms is one of the foremost problems in CDNs. Current replica placement methods do not guarantee a bound on the maximum latency to any client. In this paper, we propose several algorithms for replica placement with latency constraints. The alg...

In vehicular networking, contacts have short duration and may seldom occur. Hence, maximizing the amount of data transferred per contact opportunity is of utmost importance. In this work, we propose TraC which combines network nodes caching, typically used in Content-Centric Networks (CCNs), and users’ trajectory knowledge. The idea is to improve data delivery by proactively caching the content...

As the World Wide Web continues to grow in size, content is being co-located throughout the world in Content Distribution Networks (CDNs). These CDNs need entirely new methods of distributing client requests. The idea of a URL router has been introduced and in this dissertation the performance of URL routing is addressed. A URL router that uses HTTP redirection to automatically forward requests...

In peer-to-peer content distribution the lack of a central authority makes authentication difficult. Without authentication, adversary nodes can spoof identity and falsify messages in the overlay. This enables malicious nodes to launch man-in-the-middle or denial-of-service attacks. In this paper, we present a trust based content distribution for peer-to-peer overlay networks, which is built on...

This paper uses modified economic growth theory to compare and contrast two currently available ways of digital content distribution; the client-server model and the peer-to-peer model. We describe a monopolistic pricing scheme for distributing digital content over peer-to-peer networks that rewards peer users who actively participate in the distribution process. Our results show that digital d...