Current computer networks are challenged by the overwhelming multiplication of available content and the increasing requirements of the content delivery applications. Content caching is already playing its role in content delivery solutions. In this paper we identify the parameters and conditions that affect the performance of content caching solutions and the improvement of the content delivery process.We evaluate caching solutions performing simulation under varying external conditions based on typical service provision considering user requests, content features and network conditions awareness. Based on the simulation results we then describe the mechanisms of a cache federation using various algorithms. We propose novel ways of multimedia data object identification and the exploitation of the network awareness, for further enhancing of the caching capabilities and related service provision.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
The results of the PLATON project in the area of HD multimedia production and delivery will provide the community with the integrated service that will promote the research outcome, support the educational scenarios and ease the knowledge sharing. It will also open the possibility to promote locally the content produced in other countries and host/deliver it for better end-user experience. In the paper we present the principles and conceptual design of country-wide service for interactive delivery of HD television within the PIONIER network. The concept covers five functional components which we are describing: media production, digital media repositories, live virtual channels creation and management, scalable content delivery, interactive application-on-demand provisioning (AoD).
Content delivery network (CDN) is an efficient and inexpensive method to improve Internet service quality. In this paper we formulate an optimisation problem of replica location in a CDN using MPLS techniques. A novelty, comparing to previous work on this subject, is modelling the network flow as connection-oriented and introduction of capacity constraint on network links to the problem. Since the considered optimisation problem is NP-complete, we propose and discuss exact algorithm based on the branch-and-cut and branch-and-bound methods. We present results of numerical experiments showing comparison of branch-and-cut and branch-and-bound methods.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.