Robust Backup Path Selection in Overlay Routing with Bloom Filters |
Zhou, Xiaolei
(Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology)
Guo, Deke (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology) Chen, Tao (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology) Luo, Xueshan (Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology) |
1 | J. Liao, J. Wang, T. Li and X. Zhu, "Introducing multipath selection for concurrent multipath transfer in the future Internet," Computer Networks, vol. 55, no.4, pp. 1024-1035, March, 2011. DOI ScienceOn |
2 | D. Sontag, Y. Zhang, A. Phanishayee, D. G. Andersen, D. Karger, "Scaling All-Pairs Overlay Routing," in Proc. of the 5th international conference on Emerging networking experiments and technologies (CoNext), pp. 145-156, December 1-4, 2009. |
3 | T. Fei, S. Tao, L. Gao and R. Guerin, "How to Select a Good Alternate Path in Large Peer-to-Peer Systems?," in Proc. of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1106-1118, April 23-29, 2006. |
4 | M. Luckie, Y. Hyun and B. Huffaker, "Traceroute probe method and forward IP path inference," in Proc. of the 8th ACM SIGCOMM conference on Internet measurement, pp. 311-324, 2008. |
5 | A. Nakao, L. Peterson and A. Bavier, "A Routing Underlay for Overlay Networks," in Proc. of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), pp. 11-18, August 25-29, 2003. |
6 | S. Tao, K. Xu, A. Estepa, T. Fei, L. Gao, R. Gurin, J. F. Kurose, D. F. Towsley and Z. L. Zhang, "Improving voip quality through path switching," in Proc. of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 2268-2278 vol. 4, March 13-17, 2005. |
7 | All-pairs-ping dataset, [Online]. Available: http://pdos.csail.mit.edu/-strib/ pl_app/. |
8 | H. V. Madhyastha, T. Isdal, M. Piatek, C. Dixon, T. Anderson, A. Krishnamurthy and A. Venkataramani, "iPlane: An Information Plane for Distributed Services," in Proc. of USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp.367-380, November 6-8, 2006. |
9 | E. Katz-Bassett, H. V. Madhyastha, V. K. Adhikari, C. Scott, J. Sherry, P. van Wesep, T. Anderson, A. Krishnamurthy, "Reverse traceroute," in Proc. of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 15-31, April 28-30, 2010. |
10 | D. Guo, H. Jin, T. Chen, J. Wu, L. Lu, D. Li, and X. Zhou, "Partial Probing for Scaling Overlay Routing," Online published at IEEE Transactions on Parallel and Distributed Systems, November 29, 2012. |
11 | D. Guo, J. Wu, Y. Liu, H. Jin, H. Chen, and T. Chen, "Quasi-Kautz Digraphs for Peer-to-Peer Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 6, pp. 1042-1055, June, 2011. DOI ScienceOn |
12 | D. Guo, Y. Liu, H. Jin, Z. Liu, and W. Zhang, "Theory and Network Applications of Balanced Kautz Tree Structures," ACM Transactions on Internet Technology, vol. 13 no. 1, Article No. 3, June, 2012. |
13 | D. Guo, Y. Liu and X. Li, "BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks," in Proc. of the 27th IEEE International Conference on Computer Communications, April 13-18, 2008. |
14 | D. Andersen, H. Balakrishnan, F. Kaashoek and R. Morris, "Resilient Overlay Networks," in Proc. of 18th ACM Symposium on Operating Systems Principles (SOSP), pp. 131-145, October 21-24, 2001. |
15 | B. Y. Zhao, L. Huang, J. Stribling, S. C. Rhea, A. D. Joseph and J. D. Kubiatowicz, "Tapestry: A Resilient Global-scale Overlay for Service Deployment," IEEE Journal on Selected Areas In Communications, vol. 22, no. 1, pp. 41-53, Jan. 2004. DOI ScienceOn |
16 | M. Zhang, J. Lai, A. Krishnamurthy, R. Wang and L. Peterson, "A Transport Layer Approach for Improving End-to-End Performance and Robustness Using Redundant Paths," in Proc. of USENIX the annual conference on USENIX Annual Technical Conference, pp. 99-112, Jun 27- July 2, 2004. |
17 | M. Vukolić, "Quorum systems: With applications to storage and consensus," Synthesis Lectures on Distributed Computing Theory, vol. 3, no. 1, pp. 1-146, Feb. 2012. |
18 | K. P. Gummadi, H. V. Madhyastha, "Improving the Reliability of Internet Paths with One-hop Source Routing," in Proc. of 6th USENIX Symposium on Operating Systems Design and Implementation (OSDI), pp. 183-198, December 5, 2004. |
19 | M. Naor and U. Wieder, "Scalable and dynamic quorum systems", Distributed Computing, vol. 17, no. 4, pp. 311-322, May, 2005. DOI |
20 | B. H. Bloom, "Space/Time Trade-offs in Hash Coding with Allowable Errors," Communications of the ACM, vol. 13 no. 7, pp. 422-426, July, 1970. DOI |
21 | A. Broder and M. Mitzenmacher, "Network Applications of Bloom Filters: A Survey," Internet Mathematics, vol. 1, no. 4, pp. 485-509, January, 2004. DOI |
22 | iplane dataset, [Online]. Available: http://iplane.cs.washington.edu/. |
23 | D. Guo, J. Wu, H. Chen and X. Luo, "Theory and Network Applications of Dynamic Bloom Filters," in Proc. of the 25th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pp. 1-12, April 23-29, 2006. |
24 | B. Donnet, B. Gueye and M. A. Kaafar, "Path similarity evaluation using Bloom filters," Computer Networks, vol. 56, no. 2 pp. 858-869, Feb. 2012. DOI ScienceOn |