Abstract
The availability of network latency information enables network content providers to obtain a cost-effective solution to mirroring their web servers. Due to the scale and decentralized administration of the Internet, companies have a limited number of sites (relative to the size of the Internet) where they can place mirrors. We formalize the mirror placement problem as a case of constrained mirror placement, where mirrors can only be placed on a pre-selected set of candidates. We study the performance improvement in terms of client round-trip time (RTT) and server load, when clients are clustered by the Autonomous Systems (AS) in which they reside. Our results show that, regardless of the mirror placement algorithm used, only a surprisingly small number of mirrors is needed to realize the full benefit of having mirrors on all candidate sites. For the number of mirrors in this range, we show that greedy placement performs the best.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
