IEEE/ACM Transactions on Networking (TON)
ProWGen: a synthetic workload generation tool for simulation evaluation of web proxy caches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Dynamic Replica Placement for Scalable Content Delivery
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Content Delivery Networks: Status and Trends
IEEE Internet Computing
Verification and validation of simulation models
WSC '05 Proceedings of the 37th conference on Winter simulation
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
Ranking of ACM SIGCOMM computer communication review
ACM SIGCOMM Computer Communication Review
Distributed Dynamic Replica Placement and Request Redirection in Content Delivery Networks
MASCOTS '07 Proceedings of the 2007 15th International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Robust CDN replica placement techniques
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
CDNsim: A simulation tool for content distribution networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On traffic locality and QoE in hybrid CDN-P2P networks
Proceedings of the 44th Annual Simulation Symposium
Object replication strategies in content distribution networks
Computer Communications
A case for virtualization of content delivery networks
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
Content Distribution Networks (CDN) are a popular technology used to deliver content and have attracted great interest in recent years. CDNs place content replicas closer to end users by geographically distributing replica servers. One important research point concerning the CDN universe concerns decisions about where replica servers should be placed. Algorithms that try to tackle this problem are Replica Placement Algorithms (RPA). In this paper we propose a new dynamic RPA strategy, very similar to the Greedy strategy, based on the count of data flows through network nodes. Our experiments show better results using the proposed Flow Count Strategy than using Greedy or Hotspot algorithms when considering cross traffic with a similar quality of experience. Also, the obtained results show that Flow Count seems to place replica servers more efficiently during local flash crowd events.