Journal of Communications and Networks

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

QuLa: Queue and Latency-Aware Service Selection and Routing in Service-Centric Networking

  • Smet, Piet (Department of Information Technology (INTEC), Ghent University - iMinds) ;
  • Simoens, Pieter (Department of Information Technology (INTEC), Ghent University - iMinds) ;
  • Dhoedt, Bart (Department of Information Technology (INTEC), Ghent University - iMinds)
  • Received : 2014.07.23
  • Accepted : 2015.03.09
  • Published : 2015.06.30
⟨ Previous Next ⟩

Abstract

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

Keywords

References

  1. E. Nygren, R. K. Sitaraman, and J. Sun, "The akamai network: A platform for high-performance internet applications," ACM SIGOPS Operating Syst. Rev., vol. 44, no. 3, pp. 2-19, 2010. https://doi.org/10.1145/1842733.1842736
  2. A.-J. Su et al., "Drafting behind akamai (travelocity-based detouring)," ACM SIGCOMM Comput. Commun. Rev., vol. 36, no. 4, pp. 435-446, 2006.
  3. G. Carofiglio et al., "From content delivery today to information centric networking," Comput. Netw., vol. 57, no. 16, pp. 3116-3127, 2013. https://doi.org/10.1016/j.comnet.2013.07.002
  4. B. Ahlgren et al., "A survey of information-centric networking," IEEE Commun., vol. 50, no. 7, pp. 26-36, 2012.
  5. Y. Xu et al., "A novel cache size optimization scheme based on manifold learning in content centric networking," J. Netw. Comput. Appl., vol. 37, no. 0, pp. 273-281, 2014. https://doi.org/10.1016/j.jnca.2013.03.002
  6. W. K. Chai et al., "Cache less for more in information-centric networks (extended version)," Comput. Commun., vol. 36, no. 7, pp. 758-770, 2013. https://doi.org/10.1016/j.comcom.2013.01.007
  7. C. Dannewitz, M. D'Ambrosio, and V. Vercellone, "Hierarchical dhtbased name resolution for information-centric networks," Comput. Commun., vol. 36, no. 7, pp. 736-749, 2013. https://doi.org/10.1016/j.comcom.2013.01.014
  8. L. Zhang et al., "Named data networking (ndn) project," Relatorio Tecnico NDN-0001, Xerox Palo Alto Research Center-PARC, 2010.
  9. N. Fotiou et al., "Developing information networking further: From psirp to pursuit," in Broadband Commun. Netw. Syst., pp. 1-13, Springer, 2012.
  10. W. K. Chai et al., "Curling: Content-ubiquitous resolution and delivery infrastructure for next-generation services," IEEE Commun., vol. 49, pp. 112-120, Mar. 2011.
  11. T. Koponen et al., "A data-oriented (and beyond) network architecture," SIGCOMM Comput. Commun. Rev., vol. 37, pp. 181-192, Aug. 2007.
  12. C. Dannewitz et al., "Network of information (netinf): An informationcentric networking architecture," Comput. Commun., vol. 36, no. 7, pp. 721-735, 2013. https://doi.org/10.1016/j.comcom.2013.01.009
  13. OGF, "Open cloud computing interface l open standard l open community," 2013.
  14. M. Satyanarayanan et al., "The case for vm-based cloudlets in mobile computing," IEEE Pervasive Comput., vol. 8, no. 4, pp. 14-23, 2009. https://doi.org/10.1109/MPRV.2009.82
  15. A.-F. Antonescu et al., "Sla-driven predictive orchestration for distributed cloud-based mobile services," in Proc. IEEE ICC, June 2013, pp. 738-743.
  16. Q. Yu, "Cloudrec: a framework for personalized service recommendation in the cloud," Knowledge and Information Syst., pp. 1-27, 2014.
  17. T. Braun et al., "Service-centric networking," in Proc. IEEE ICC Commun. Workshops, June 2011, pp. 1-6.
  18. M. Freedman et al., "Serval: An end-host stack for service-centric networking," in Proc. USENIX NSDI, Apr. 2012.
  19. M. J. Freedman et al., "Service-centric networking with scaffold," Princeton University, Sept., 2010.
  20. K.-W. Lee, B.-J. Ko, and S. Calo, "Adaptive server selection for large scale interactive online games," Comput. Netw., vol. 49, no. 1, pp. 84-102, 2005. https://doi.org/10.1016/j.comnet.2005.04.006
  21. P. Wendell et al., "Donar: Decentralized server selection for cloud services," in ACM SIGCOMM Comput. Commun. Rev., vol. 40, pp. 231-242, 2010.
  22. L. Zhao et al., "Flexible service selection with user-specific qos support in service-oriented architecture," J. Netw. Comput. Appl., vol. 35, no. 3, pp. 962-973, 2012. https://doi.org/10.1016/j.jnca.2011.03.013
  23. H. Xu and B. Li, "Joint request mapping and response routing for geo-distributed cloud services," in Proc. IEEE INFOCOM, Apr. 2013, pp. 854-862.
  24. H. A. Alzoubi et al., "Anycast cdns revisited," in Proc. WWW, pp. 277-286, May 2008.
  25. L. WangA. Hoque et al., "Ospfn: An ospf based routing protocol for named data networking," U. Memphis and U. Arizona, Tech. Rep., 2012.
  26. C. Li, K. Okamura, and W. Liu, "Ant colony based forwarding method for content-centric networking," in Proc. WAINA, pp. 306-311, Mar. 2013.
  27. S. Shanbhag et al., "Soccer: Services over content-centric routing," in Proc. ACM SIGCOMM ICN workshop, Toronto, Canada, Aug. 2011.
  28. E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische mathematik, vol. 1, no. 1, pp. 269-271, 1959. https://doi.org/10.1007/BF01386390
  29. K. A. Dowsland and C. Reeves, "Modern heuristic techniques for combinatorial problems," simulated annealing. In Reevees, CR, Editor, John Wiley and Sons, NY, USA, no. 2, 1993.
  30. S. Abimannan et al., "Join-the-shortest queue policy in web server farms," Global J. Comput. Sci. Tech., vol. 10, no. 4, 2010.
  31. V. Gupta, M. H. Balter, K. Sigman, and W. Whitt, "Analysis of join-theshortest-queue routing for web server farms," Performance Evaluation, vol. 64, no. 9-12, pp. 1062-1081, 2007. https://doi.org/10.1016/j.peva.2007.06.012
  32. J. Kruskal, Joseph B., "On the shortest spanning subtree of a graph and the traveling salesman problem," Proc. the American Mathematical Society, vol. 7, no. 1, pp. 48-50, 1956. https://doi.org/10.1090/S0002-9939-1956-0078686-7
  33. "The clouds lab: Flagship projects - gridbus and cloudbus," 2013.
  34. "Brite: Boston university representative internet topology generator," 2013.
  35. "ilab.t virtual wall l Internet based communication networks and services," 2013.