KSII Transactions on Internet and Information Systems (TIIS)

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

DOI QR Code

The Top-K QoS-aware Paths Discovery for Source Routing in SDN

  • Chen, Xi (School of Computer Science and Technology, Southwest Minzu University) ;
  • Wu, Junlei (School of Computer Science, Chengdu University of Information Technology) ;
  • Wu, Tao (School of Computer Science, Chengdu University of Information Technology)
  • Received : 2017.05.29
  • Accepted : 2018.02.13
  • Published : 2018.06.30
Download PDF
⟨ Previous Next ⟩

Abstract

Source routing is the routing scheme that arranges the whole path from source to target at the origin node that may suit the requirements from the upper layer applications' perspective. The centralized control in SDN (Software-Defined Networking) networks enables the awareness of the global topology at the controller. Therefore, augmented source routing schemes can be designed to achieve various purposes. This paper proposes a source routing scheme that conducts the top-K QoS-aware paths discovery in SDN. First, the novel non-invasive QoS over LLDP scheme is designed to collect QoS information based on LLDP in a piggyback fashion. Then, variations of the KSP (K Shortest Paths) algorithm are derived to find the unconstrained/constrained top-K ranked paths with regard to individual/overall path costs, reflecting the Quality of Service. The experiment results show that the proposed scheme can efficiently collect the QoS information and find the top-K paths. Also, the performance of our scheme is applicable in QoS-sensitive application scenarios compared with previous works.

Keywords

References

  1. D. A. Maltz and D. C. Johnson, "The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4," IETF RFC, no. 4728, Feb. 2007.
  2. N. Mckeown et al., "OpenFlow: enabling innovation in campus networks," ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 2, pp. 69-74, 2008. https://doi.org/10.1145/1355734.1355746
  3. R. M. Ramos, M. Martinello, and C. E. Rothenberg, "SlickFlow: Resilient source routing in Data Center Networks unlocked by OpenFlow," in Proc. of IEEE Conference on Local Computer Networks (LCN), 2013, pp. 606-613.
  4. A. Abujoda, H. R. Kouchaksaraei, and P. Papadimitriou, "SDN-Based Source Routing for Scalable Service Chaining in Datacenters," in Proc. of 14th IFIP International Conference on Wired/Wireless Internet Communications (WWIC), pp. 66-77, 2016.
  5. X. Wang, C. Huang, X. Fan, and K. He, "Flow Table Update Method based on Load Balancing for SDN," J. Huazhong Univ. Sci. Technol. Nat. Sci. Ed., vol. 44, no. 11, pp. 75-81, 2016.
  6. M. Soliman, B. Nandy, I. Lambadaris, and P. Ashwood-Smith, "Exploring source routed forwarding in SDN-based WANs," in Proc. of IEEE International Conference on Communications (ICC), pp. 3070-3075, 2014.
  7. M. Soliman, B. Nandy, I. Lambadaris, and P. Ashwood-Smith, "Source routed forwarding with software defined control, considerations and implications," in Proc. of ACM Conference on Emerging Networking Experiments and Technology (CONEXT) Student Workshop, pp. 43-44, 2012.
  8. Y. Zhang, N. Beheshti, L. Beliveau, and G. Lefebvre, "StEERING: A software-defined networking for inline service chaining," in Proc. of IEEE International Conference on Network Protocols (ICNP), pp. 1-10, 2013.
  9. Z. A. Qazi, C. C. Tu, L. Chiang, R. Miao, V. Sekar, and M. Yu, "SIMPLE-fying middlebox policy enforcement using SDN," Acm Sigcomm Comput. Commun. Rev., vol. 43, no. 4, pp. 27-38, 2013. https://doi.org/10.1145/2534169.2486022
  10. Z. Qazi, C.-C. Tu, R. Miao, L. Chiang, V. Sekar, and M. Yu, "Practical and Incremental Convergence between SDN and Middleboxes," Open Network Summit, pp. 1-15, 2013.
  11. G. T. K. Nguyen, R. Agarwal, J. Liu, M. Caesar, P. B. Godfrey, and S. Shenker, "Slick packets," Acm Sigmetrics Perform. Eval. Rev., vol. 39, no. 1, pp. 205-216, 2012. https://doi.org/10.1145/2007116.2007141
  12. C. Guo et al., "SecondNet: a data center network virtualization architecture with bandwidth guarantees," in Proc. of ACM Conference on Emerging Networking Experiments and Technology (CONEXT), p. 15, 2010.
  13. C. E. Rothenberg, C. A. B. Macapuna, F. L. Verdi, M. F. Magalhaes, and A. Zahemszky, "Data center networking with in-packet Bloom filters," in Proc. of XXVIII Simposio Brasileiro de Redes de Computadores e Sistemas Distribuidos, pp. 553-566, 2010.
  14. M. Arumaithurai, J. Chen, E. Monticelli, X. Fu, and K. K. Ramakrishnan, "Exploiting ICN for Flexible Management of Software-defined Networks," in Proc. of ACM Conference on Information-Centric Networking (ACM-ICN), Paris, France, pp. 107-116, 2014.
  15. J. M. Halpern and C. Pignataro, "Service Function Chaining (SFC) Architecture," IETF RFC, no. RFC 7665, Oct. 2015.
  16. T. Nadeau and P. Quinn, "Problem Statement for Service Function Chaining," IETF RFC, no. RFC 7498, Apr. 2015.
  17. S. G. Kulkarni et al., "Name enhanced SDN framework for service function chaining of elastic Network functions," in Proc. of 2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 45-46, 2016.
  18. B. Pfaff et al., "The design and implementation of open vSwitch," in Proc. of 12th USENIX Symposium on Networked Systems Design and Implementation (NSDI), Oakland, CA, 2015, vol. 40, pp. 117-130.
  19. E. W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numer. Math., vol. 1, no. 1, pp. 269-271, 1959. https://doi.org/10.1007/BF01386390
  20. E. Q. V. Martins and M. M. B. Pascoal, "A new implementation of Yen's ranking loopless paths algorithm," 4OR, vol. 1, no. 2, pp. 121-133, 2003.
  21. "Home - Project Floodlight - OpenFlow news and projects," Project Floodlight. [Online]. Available: http://www.projectfloodlight.org/. [Accessed: 22-May-2017].
  22. "Mininet: An Instant Virtual Network on your Laptop (or other PC) - Mininet." [Online]. Available: http://mininet.org/. [Accessed: 22-May-2017].

Cited by

  1. LSEA: Software-Defined Networking-Based QoS-Aware Routing Mechanism for Live-Soccer Event Applications in Smart Cities vol.2020, pp.None, 2018, https://doi.org/10.1155/2020/8829868