References
- AlmeidaJMEagerDLVernonMKWrightSJMinimizing delivery cost in scalable streaming content distribution systemsIEEE T Multimedia2004635636510.1109/TMM.2003.822796
- Bektaş T, Cordeau J-F, Erkut E and Laporte G (2008). Exact algorithms for the joint object placement and request routing problem in content distribution networks. Comput Opl Res doi: 10.1016/j.cor.2007.02.005.
- BektaşTOǧuzOOuveysiIDesigning cost-effective content distribution networksComput Opl Res2007342436244910.1016/j.cor.2005.09.013
- Breslau L, Cao P, Fan L, Phillips G and Shenker S (1999). Web caching and Zipf-like distributions: Evidence and implications. In: IEEE Communications Society (ed) Proceedings of IEEE INFOCOM'99, Vol. 1. IEEE Computer Society Press: New York, pp 126–134.
- ČernýVThermodynamical approach to the travelling salesman problem: An efficient simulation algorithmJ Optim Theory Appl198545415110.1007/BF00940812
- ChariKResource allocation and capacity assignment in distributed systemsComput Opl Res1996231025104110.1016/0305-0548(96)00017-2
- CidonIKuttenSSofferROptimal allocation of electronic contentComput Network20024020521810.1016/S1389-1286(02)00251-7
- ErçetinÖTassiulasLMarket-based resource allocation for content delivery in the InternetIEEE T Comput2003521573158510.1109/TC.2003.1252853
- FisherMLHochbaumDSDatabase location in computer networksJ Assoc Comput Mach19802771873510.1145/322217.322226
- GavishBSuhMWConfiguration of fully replicated distributed database system over wide area networksAnn Opns Res19923616719210.1007/BF02094329
- HakimiSLSchmeichelEFLocating replicas of a database on a networkNetworks199730313610.1002/(SICI)1097-0037(199708)30:1<31::AID-NET4>3.0.CO;2-M
- HuangCAbdelzaherTBounded-latency content distribution: Feasibility and evaluationIEEE T Comput2005541422143710.1109/TC.2005.175
- JohnsonKLCarrMSDayJFKaashoekMFThe measured performance of content distribution networksComput Commun20012420220610.1016/S0140-3664(00)00315-7
- KangasharjuJRobertsJRossKWObject replication strategies in content distribution networksComput Commun20022537638310.1016/S0140-3664(01)00409-1
- KirkpatrickSGelattCDVecchiMPOptimization by simulated annealingScience198322067168010.1126/science.220.4598.671
- LaoutarisNZissimopoulosVStavrakakisIJoint object placement and node dimensioning for Internet content distributionInform Process Lett20048927327910.1016/j.ipl.2003.12.002
- LaoutarisNZissimopoulosVStavrakakisIOn the optimization of storage capacity allocation for content distributionComput Network20054740942810.1016/j.comnet.2004.07.020
- Li B, Golin MJ, Italiano GF, Deng X and Sohraby K (1999). On the optimal placement of web proxies in the Internet. In: Proceedings of IEEE INFOCOM'99, Vol. 3, New York, pp 1282–1290.
- NguyenTVSafaeiFBousteadPChouCTProvisioning overlay distribution networksComput Network20054910311810.1016/j.comnet.2005.04.001
- PirkulHAn integer programming model for the allocation of databases in a distributed computer systemEur J Opl Res19862640141110.1016/0377-2217(86)90142-6
- QiuLPadmanabhanVNVoelkerGMProceedings of IEEE INFOCOM'01200115871596
- RadoslavovPGovindanREstrinDTopology-informed Internet replica placementComput Commun20022538439210.1016/S0140-3664(01)00410-8
- RyooJPanwarSSFile distribution in networks with multimedia storage serversNetworks20013814014910.1002/net.1032
- WautersTCoppensJDe TurckFDhoedtBDemeesterPReplica placement in ring based content delivery networksComput Commun2006293313332610.1016/j.comcom.2006.05.008
- XuJLiBLeeDLPlacement problems for transparent data replication proxy servicesIEEE J Select Areas Commun2002201383139810.1109/JSAC.2002.802068
- Xuanping Z, Weidong W, Xiaopeng T and Yonghu Z (2003). Data Replication at Web Proxies in Content Distribution Network, Lecture Notes in Computer Science, Vol.2642, Springer-Verlag: Xian, pp 560–569.
- YangMFeiZProceedings of IEEE International Conference on Communications (ICC '03)2003557561
- ZipfGKHuman Behavior and the Principle of Least-Effort1949