A server placement algorithm conscious of communication delays and relocation costs

DOI10.1007/3-540-45745-3_7MaRDI QIDQ3046632zbMATH OpenFDO

Authors Junho Shim, Tae-Hee Lee, Sang-Goo Lee

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2376/23760083.htm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99)

Recommendations

• Placement algorithm of web server replicas
• Placement algorithms for hierarchical cooperative caching
• scientific article; zbMATH DE number 1305451
• Approximation Algorithms for Data Placement Problems
• Cache placement in sensor networks under an update cost constraint

Cited in

(7)

• Cache placement in sensor networks under an update cost constraint
• Algorithmic background of the host recommendation in the adaptive distributed multimedia server
• scientific article; zbMATH DE number 3896624 (Why is no real title available?)
• scientific article; zbMATH DE number 1532272 (Why is no real title available?)
• A graph partitioning method to determine servers placement in CDN
• Placement of nodes in an adaptive distributed multimedia server
• Optimizing server placement in distributed systems in the presence of competition

This page was built for publication: A server placement algorithm conscious of communication delays and relocation costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046632)