On network-aware clustering of Web clients
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
IDMaps: a global internet host distance estimation service
IEEE/ACM Transactions on Networking (TON)
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Distributed distance measurement for large-scale networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modeling distances in large-scale networks by matrix factorization
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
ADAPTIVE AND INTELLIGENT REQUEST DISTRIBUTION FOR CONTENT DELIVERY NETWORKS
Cybernetics and Systems
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
On the geographic location of Internet resources
IEEE Journal on Selected Areas in Communications
Using Data Mining Algorithms in Web Performance Prediction
Cybernetics and Systems
| Hi-index | 0.00 |
The main problem we explore in this paper involves predicting the performance of Web-resource downloads from unknown Web servers, based on knowledge about client-to-unknown-server network paths and performance measurements carried out on the set of known Web servers. We propose unknown-server-to-known-server topology-aware distance metrics based on the knowledge of network paths to both unknown and known servers at the autonomous systems level of Internet organization. The throughput value we want to predict for an unknown-server is approximated by the value achievable for the known-server—called the best one—with the least value of unknown-server-to-known-server distance metrics. The best server is selected using the nearest neighbor algorithm. The usefulness of this method for Web-performance prediction has been confirmed in real-life experiments. The results of the work allowed us to formulate positive recommendations for applying this approach to efficient gaining of Web resources in replicated content systems, file mirrors, content delivery networks, and digital libraries.