dc.contributor.author | Pallis, George C. | en |
dc.contributor.author | Vakali, Athena I. | en |
dc.contributor.author | Stamos, Kostas | en |
dc.contributor.author | Sidiropoulos, Antonis | en |
dc.contributor.author | Katsaros, Dimitrios S. | en |
dc.contributor.author | Manolopoulos, Yannis | en |
dc.creator | Pallis, George C. | en |
dc.creator | Vakali, Athena I. | en |
dc.creator | Stamos, Kostas | en |
dc.creator | Sidiropoulos, Antonis | en |
dc.creator | Katsaros, Dimitrios S. | en |
dc.creator | Manolopoulos, Yannis | en |
dc.date.accessioned | 2019-11-13T10:41:37Z | |
dc.date.available | 2019-11-13T10:41:37Z | |
dc.date.issued | 2005 | |
dc.identifier.isbn | 0-7695-2471-0 | |
dc.identifier.isbn | 978-0-7695-2471-9 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/54680 | |
dc.description.abstract | Content Distribution Networks (CDNs) are increasingly being used to disseminate data in today's Internet. The growing interest in CDNs is motivated by a common problem across disciplines: how does one reduce the load on the origin server and the traffic on the Internet, and ultimately improve response time to users? In this direction, crucial data management issues should be addressed. A very important issue is the optimal placement of the outsourced content to CDN's servers. Taking into account that this problem is NP complete, an heuristic method should be developed. All the approaches developed so far assume the existence of adequate popularity statistics. Such information though, is not always available, or it is extremely volatile, turning such methods problematic. This paper develops a network-adaptive, non-parameterized technique to place the outsourced content to CDN's servers, which requires no a-priori knowledge of request statistics. We place the outsourced objects to these servers with respect to the network latency that each object produces. Through a detailed simulation environment, using both real and synthetic data, we show that the proposed technique can yield up to 25% reduction in user-perceived latency, compared with other heuristic schemes which have knowledge of the content popularity. © 2005 IEEE. | en |
dc.source | Proceedings - Third Latin American Web Congress, LA-WEB 2005 | en |
dc.source | 3rd Latin American Web Congress, LA-WEB 2005 | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-33750079356&doi=10.1109%2fLAWEB.2005.3&partnerID=40&md5=be1a6668d1b5c4d9f720908a461d2b3c | |
dc.subject | Information dissemination | en |
dc.subject | Statistical methods | en |
dc.subject | Computer networks | en |
dc.subject | Computational complexity | en |
dc.subject | Heuristic methods | en |
dc.subject | Servers | en |
dc.subject | Information management | en |
dc.subject | Telecommunication traffic | en |
dc.subject | Data management | en |
dc.subject | Content Distribution Networks (CDN) | en |
dc.subject | Disciplines | en |
dc.title | A latency-based object placement approach in content distribution networks | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.identifier.doi | 10.1109/LAWEB.2005.3 | |
dc.description.volume | 2005 | |
dc.description.startingpage | 140 | |
dc.description.endingpage | 147 | |
dc.author.faculty | 002 Σχολή Θετικών και Εφαρμοσμένων Επιστημών / Faculty of Pure and Applied Sciences | |
dc.author.department | Τμήμα Πληροφορικής / Department of Computer Science | |
dc.type.uhtype | Conference Object | en |
dc.description.notes | <p>Sponsors: CLEI-Latin American Center for Informatics Studies | en |
dc.description.notes | CYTED-Ibero American Program for Cooperation in Sci | en |
dc.description.notes | DCC-Center for Web Research, University of Chile | en |
dc.description.notes | Engineering School, National University of La Pampa, Argentina | en |
dc.description.notes | HP Research Labs | en |
dc.description.notes | Conference code: 69146 | en |
dc.description.notes | Cited By :27</p> | en |
dc.contributor.orcid | Pallis, George C. [0000-0003-1815-5468] | |
dc.contributor.orcid | Vakali, Athena I. [0000-0002-0666-6984] | |
dc.gnosis.orcid | 0000-0003-1815-5468 | |
dc.gnosis.orcid | 0000-0002-0666-6984 | |