KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Resilient Routing Overlay Network Construction with Super-Relay Nodes

  • Tian, Shengwen (School of Information and Electrical Engineering, Ludong University) ;
  • Liao, Jianxin (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Li, Tonghong (Department of Computer Science, Technical University of Madrid) ;
  • Wang, Jingyu (State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Cui, Guanghai (School of Information and Electrical Engineering, Ludong University)
  • Received : 2015.10.06
  • Accepted : 2017.02.08
  • Published : 2017.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

Overlay routing has emerged as a promising approach to improve reliability and efficiency of the Internet. The key to overlay routing is the placement and maintenance of the overlay infrastructure, especially, the selection and placement of key relay nodes. Spurred by the observation that a few relay nodes with high betweenness centrality can provide more optimal routes for a large number of node pairs, we propose a resilient routing overlay network construction method by introducing Super-Relay nodes. In detail, we present the K-Minimum Spanning Tree with Super-Relay nodes algorithm (SR-KMST), in which we focus on the selection and connection of Super-Relay nodes to optimize the routing quality in a resilient and scalable manner. For the simultaneous path failures between the default physical path and the overlay backup path, we also address the selection of recovery path. The objective is to select a proper one-hop recovery path with minimum cost in path probing and measurement. Simulations based on a real ISP network and a synthetic Internet topology show that our approach can provide high-quality overlay routing service, while achieving good robustness.

Keywords

References

  1. N. Ramzan, E. Quacchio, T. Zgaljic, S. Asioli, L. Celetto, et al. "Peer-to-peer streaming of scalable video in future Internet applications," IEEE Communications Magazine, vol. 49, no. 3, pp. 128-135, January, 2011. https://doi.org/10.1109/MCOM.2011.5723810
  2. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proc. of ACM SIGCOMM, pp. 149-160, August 27-31, 2001.
  3. Z. Li, G. Xie, K. Hwang, and Z. Li, "Churn-resilient protocol for massive data dissemination in P2P networks," IEEE Transaction on Parallel and Distributed Systems, vol. 22, no. 8, pp. 1342-1349, August, 2011. https://doi.org/10.1109/TPDS.2011.15
  4. M. Amad, A. Meddahi, D. Aissani, and G. Vanwormhoudt, "GPM: a generic and scalable P2P model that optimizes tree depth for multicast communications," International Journal of Communication Systems (IJCS), vol. 25, no. 4, pp. 491-514, April, 2012. https://doi.org/10.1002/dac.1275
  5. M. Hosseini, D. T. Ahmed, S. Shirmohammadi, and N. D. Georganas, "A survey of application-layer multicast protocols," IEEE Communications Surveys and Tutorials, vol. 9, no. 3, pp. 58-74, September, 2007. https://doi.org/10.1109/COMST.2007.4317616
  6. D. Anderson, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient overlay network," In Proc. of ACM Symposium on Operating System Principle (SOSP), vol. 35, no. 5, pp. 131-145, June, 2001.
  7. Z. Li and P. Mohpratra, "QRON: QoS-aware routing in overlay networks," IEEE Journal on Selected Areas in Communications(JSAC), vol. 22, no. 1, pp. 29-40, January, 2004. https://doi.org/10.1109/JSAC.2003.818782
  8. L. Subramanian, I. Stoica, H. Balakrishnan, and R. H. Katz, "OverQoS: an overlay based architecture for enhancing internet QoS," In Proc. of USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 29-31, March 29-31, 2004.
  9. A. Capone, J. Elias, and F. Martignon, "Routing and resource optimization in service overlay networks," Computer Networks, vol. 53, no. 2, pp. 180-190, February, 2009. https://doi.org/10.1016/j.comnet.2008.09.011
  10. S. Roy, H. Pucha, Z. Zhang, Y. C. Hu, and L. Qiu, "On the placement of infrastructure overlay nodes," IEEE/ACM Transactions on Networking, vol. 17, no. 4, pp. 1298-1311, August, 2009. https://doi.org/10.1109/TNET.2008.2007433
  11. R. Cohen, D. Raz, "Cost-effective resource allocation of overlay routing relay nodes," IEEE/ACM Transactions on Networking (TON), vol. 22, no. 2, pp. 636-646, April, 2014. https://doi.org/10.1109/TNET.2013.2260867
  12. M. Cha, S. Moon, C. D. Park, and A. Shaikh, "Placing relay nodes for intra-domain path diversity," In Proc. of IEEE INFOCOM, pp. 1-12, April 23-29, 2006.
  13. R. Kawahara, S. Kamei, N. Kamiyama, H. Hasegawa, H. Yoshino, E. K. Lua, and A. Nakao, "A method of constructing QoS overlay network and its evaluation," In Proc. of IEEE GLOBECOM, pp. 1-6, November, 2009.
  14. A. Young, J. Chen, Z. Ma, A. Krishnamurthy, L. Peterson, and R. Y. Wang, "Overlay mesh construction using interleaved spanning trees," In Proc. of IEEE INFOCOM, pp. 396-407, March 7-11, 2004.
  15. 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 IEEE INFOCOM, pp. 1-13, April, 23-29, 2006.
  16. S. Banerjee, S. Jee, B. Bhattacharjee, and A. Srinivasan, "Resilient multicast using overlays," IEEE/ACM Transactions on Networking, vol. 14, no. 2, pp. 237-248, April, 2006. https://doi.org/10.1109/TNET.2006.872579
  17. A. Nakao, L. Peterson, and A. Bavier, "A routing underlay for overlay networks," In Proc. of ACM SIGCOMM, pp. 25-29, August 25-29, 2003.
  18. Z. Li, and P. Mohapatra, "On investigating overlay service topologies," Computer Networks, vol. 51, no. 1, pp. 54-68, January, 2007. https://doi.org/10.1016/j.comnet.2006.04.011
  19. D. Adami, C. Callegari, S. Giordano, G. Pagano, et al, "Design and performance evaluation of service overlay networks topologies," Journal of Networks, vol. 6, no. 4, pp. 556-566, April, 2011.
  20. J. Liao, J. Wang, B. Wu, and W. Wu, "Toward a Multi-plane Framework of NGSON: a Required Guideline to Achieve Pervasive Services and Efficient Resource Utilization," IEEE Communications Magazine, vol. 50, no. 1, pp. 90-97, January, 2012. https://doi.org/10.1109/MCOM.2012.6122537
  21. Q. Wang, J. Wang, J. Yu, M. Yu, and Y. Zhang, "Trust-aware query routing in P2P social networks," International Journal of Communication Systems (IJCS), vol. 25, no. 10, pp. 1260-1280, October, 2012. https://doi.org/10.1002/dac.1320
  22. J. Fan, and M. H. Ammar, "Dynamic topology configuration in service overlay networks: a study of reconfiguration policies," In Proc. of IEEE INFOCOM, Vol. 2, no. 9, pp. 1-12, April 23-29, 2006.
  23. W. Cui, I. Stoica, and R. H. Katz, "Backup path allocation based on a correlated link failure probability model in overlay networks," In Proc. of IEEE International Conference on Network Protocol (INCP), pp. 236-245, November, 12-15, 2002.
  24. Z. M. Mao, L. Qiu, J. Wang, and Y. Zhang, "On AS path inference," In Proc. of ACM SIGMETRICS, Vol. 33, no. 1, pp. 339-349, June, 06-10, 2005. https://doi.org/10.1145/1071690.1064257
  25. X. Zhou, D. Guo, T. Chen, Z. Shu, and X. Luo, "ABPS: an accurate backup path selecting approach in overlay networks," In Proc. of IEEE 14th International Conference on High Performance Computing and Communications (HPCC), pp. 1247-1252, June 25-27, 2012.
  26. K. P. Gummadi, H. Madhyastha, S. D. Gribble, H. M. Levy, and D. J. Wetherall, "Improving the reliability of internet paths with one-hop source routing," In Proc. of USENIX Symposium on Operating System Design and Implementation (OSDI), pp. 13-27, December, 2004.
  27. U. Brandes, "On variants of shortest-path betweenness centrality and their generic computation," Social Network, vol. 30, no. 2, pp. 136-145, May, 2008. https://doi.org/10.1016/j.socnet.2007.11.001
  28. G. Zhang, "An algorithm for Internet AS graph betweenness centrality based on Backtrack," Journal of Computer Research and Development, vol. 43, no. 10, pp. 1790-1796, October, 2006. https://doi.org/10.1360/crad20061017
  29. GT-ITM: Modeling Topology of Large Internetworks [online]. Available from: -http://www.cc.gatech.edu/projects/gtitm/.
  30. B. M. Waxman, "Routing of multipoint connections," IEEE Journal on Selected Areas in Communication(JSAC), vol. 6, no. 9, pp. 1617-1622, December, 1988. https://doi.org/10.1109/49.12889
  31. J. Liao, S. Tian, J. Wang, et al, "Load-Balanced One-hop Overlay Multipath Routing with Path Diversity," KSII Transactions on Internet and Information Systems (TIIS), vol. 8, no. 2, pp. 443-461, February, 2014. https://doi.org/10.3837/tiis.2014.02.007
  32. Y. Chen, S. Radhakrishnan, S. Dhall, and S. Karabuk, "The service overlay network design problem for interactive internet applications," Computer & Operations Research, vol. 57, pp. 73-82, May, 2015. https://doi.org/10.1016/j.cor.2014.11.003
  33. J. Liao, L. Yang, J. Wang, and X. Zhu, "Service composition based on niching particle swarm optimization in service overlay networks," KSII Transactions on Internet and Information Systems (TIIS), vol. 6, no. 4, April, 2012.
  34. J. Kim, S. W. Han, D. Yi, and N. Kim, "Media-Oriented Service Composition with Service Overlay Networks: Challenges, Approaches and Future Trends," Journal of Communications, vol. 5, no. 5, pp. 374-389, May, 2010.
  35. S. Tian, J. Liao, J. Wang, Q. Qi, "Overlay routing network construction by introducing super-relay nodes," IEEE Symposium on Computers and Communication (ISCC), 23-26, September, 2014.
  36. N. D. Han, Y. Chung, and M. Jo, "Green Data Centers for Cloud-assisted Mobile Ad-hoc Networks in 5G", IEEE Network, Vol.29, No.2 , pp. 70-76, March, 2015. https://doi.org/10.1109/MNET.2015.7064906
  37. D. Satria, D. Park, and M. Jo, "Recovery for Overloaded Mobile Edge Computing", Future Generation Computer Systems, Vol. 70, pp. 138-147, May, 2017. https://doi.org/10.1016/j.future.2016.06.024