Benefits of Clustering in Landmark-Aided Positioning Algorithms
暂无分享,去创建一个
[1] Yuval Shavitt,et al. Big-Bang simulation for embedding network distances in Euclidean space , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[2] Magnus Karlsson,et al. Turning heterogeneity into an advantage in overlay routing , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[3] Miguel Castro,et al. PIC: practical Internet coordinates for distance estimation , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..
[4] Mark Handley,et al. Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[5] Robert Tappan Morris,et al. Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.
[6] Hui Zhang,et al. A Network Positioning System for the Internet , 2004, USENIX Annual Technical Conference, General Track.
[7] Hui Zhang,et al. Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[8] Jon Crowcroft,et al. Lighthouses for Scalable Distributed Location , 2003, IPTPS.
[9] Yuval Shavitt,et al. Big-bang simulation for embedding network distances in Euclidean space , 2004, IEEE/ACM Transactions on Networking.
[10] Robert Tappan Morris,et al. Practical, distributed network coordinates , 2004, Comput. Commun. Rev..
[11] Mark Crovella,et al. Virtual landmarks for the internet , 2003, IMC '03.
[12] Steven Lerman,et al. PCoord: network position estimation using peer-to-peer measurements , 2004, Third IEEE International Symposium on Network Computing and Applications, 2004. (NCA 2004). Proceedings..