Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Smart content delivery on the Internet|
|Citation:||Lecture Notes in Artificial Intelligence, 2008 / Bourgeois, A., Zheng, S. (ed./s), vol.5022 LNCS, pp.1-1|
|Publisher:||Springer Berlin Heidelberg|
|Series/Report no.:||Lecture Notes in Computer Science; v. 5022|
|Conference Name:||8th International Conference on Algorithms and Architectures for Parallel Processing (ICA3PP 2008) (9 Jun 2008 - 11 Jun 2008 : Ayia Napa, Cyprus)|
|Abstract:||As the ever-growing Internet applications in the emerging e-society are centered in sharing of various types of digital contents, content delivery on the Internet as a hot topic has been attracting most attentions. Web caching is an important technology for improving the efficiency of content delivery. As an emerging technology en-route caching computes locations among caches on access paths to store copies of an object such that specified objectives (such as satisfying future access demands to the object) are achieved. In this talk, I will first give an overview on recent developments in efficient content delivery. I will then introduce our recent work in tackling this problem by applying the technique of en-route caching, and present efficient solutions to the problem in systems containing single server and multiple servers respectively. While the problem is NP-hard in the general case, our solutions apply dynamic programming technique and run in polynomial-time in the worst case for both unconstrained and constrained cases in the network topologies of trees (for broadcast delivery) and linear arrays (for point-to-point delivery) respectively. They are shown theoretically either optimal or convergent to optimal. Finally, I will show some possible extensions of our solutions to other system settings. © 2008 Springer-Verlag Berlin Heidelberg.|
|Rights:||© Springer-Verlag Berlin Heidelberg 2008|
|Appears in Collections:||Aurora harvest 2|
Computer Science publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.