Abstract
Network virtualization serves as a promising technique for providing a flexible and highly adaptable shared substrate network to satisfy the diversity of demands and overcoming the ossification of Internet infrastructure. As a key issue of constructing a virtual network (VN), various state-of-the-art algorithms have been proposed in many research works for addressing the VN mapping problem. However, these traditional works are efficient for mapping VN which with deterministic amount of network resources required, they even deal with the dynamic resource demand by using over-provisioning. These approaches are obviously not advisable, since the network resources are becoming more and more scarce. In this paper, we investigate the online stochastic VN mapping (StoVNM) problem, in which the VNs are generated as a Poisson process and each bandwidth demand x i follows a normal distribution, i.e., x i ~ N(μ i , σ 2 i ). Firstly, we formulate the model for StoVNM problem by mixed integer linear programming, which with objective including minimum-mapping-cost and load balance. Then, we devise a sliding window approach-based heuristic algorithm w-StoVNM for tackling this NP-hard StoVNM problem efficiently. The experimental results achieved from extensive simulation experiments demonstrate the effectiveness of the proposed approach and superiority than traditional solutions for VN mapping in terms of VN mapping cost, blocking ratio, and total net revenue in the long term.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Foster, I., Zhao, Y., Raicu, I., Lu, S.: Cloud computing and grid computing 360-degree compared. In: Grid Computing Environments Workshop (2008)
Baranovski A. et al.: Enabling distributed petascale science. J. Phys. Conf. Ser. 78, 012020 (2007)
Chowdhury N., Boutaba R.: A survey of network virtualization. Comput. Netw. 54, 862–876 (2010)
Anderson T., Peterson L., Shenker S., Turner J.: Overcoming the Internet impasse through virtualization. Computer 38(4), 34–41 (2005)
Mosharaf, N.M., Rahman, M.R., Boutaba, R.: Virtual network embedding with coordinated node and link embedding. In: IEEE INFOCOM (2009)
Yu, H., Anand, V., Qiao, C., Di, H. et al.: On the survivable virtual infrastructure embedding problem. In: IEEE International Conference on Computer Communication Networks (2010)
Cai, Z., Liu, F., Xiao, N., Liu, Q., Wang, Z.: Virtual network embedding for evolving networks. In: IEEE GLOBECOM, Miami (2010)
Luand, J., Turner, J.: Efficient Embedding of Virtual Networks onto a Shared Substrate. Washington University, Technical Report, WUCSE-2006-35 (2006)
Razzaq, A., Rathore, M.S.: An approach towards resource efficient virtual network embedding. In: Proceedings of 2nd International Conference on Evolving Internet, pp. 68–73 (2010)
Rahman, M., Aib, I., Boutaba, R.: Survivable Virtual Network Embedding. NETWORKING, vol. 6091 LNCS, pp. 40–52 (2010)
Zhu, Y., Ammar, M.: Algorithms for assigning substrate network resources to virtual network components. In: Proceedings of IEEE INFOCOM (2006)
Yu M., Yi Y., Rexford J., Chiang M.: Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM Comput. Commun. Rev. 38(2), 17–29 (2008)
Benson, T.A., Anand, A., Akella, A., Zhang, M.: Understanding data center traffic characteristics. In: ACM SIGCOMM WREN Workshop (2009)
Kandula, S., Sengupta, S., Greenberg, A., Patel, P.: The nature of datacenter traffic: measurements and analysis. In: ACM IMC (2009)
Meng, X., Pappas, V., Zhang, L.: Improving the scalability of data center networks with traffic-aware virtual machine placement. In: IEEE INFOCOM (2010)
Zhang, M., Wu, C., Jiang, M., Yang, Q.: Mapping multicast service-oriented virtual networks with delay and delay variation constraints. In: IEEE GLOBECOM (2010)
Shun-li Z., Xue-song Q., Singh V., Mazri T., El Amrani N., Riouch F., Hu Y., Zhang J., Khan F., Li Y.: A novel virtual network mapping algorithm for cost minimizing. J. Sel. Areas Telecommun. 1, 1–9 (2011)
Yu, H., Qiao, C., Anand, V., Liu, X. et al.: Survivable virtual infrastructure embedding in a federated computing and networking system under single regional failures. In: IEEE GLOBECOM (2010)
Sun, G., Yu, H., Li, L., Anand, V. et al.: Efficient algorithms for survivable virtual network embedding. In: Proceedings of Asia Communications and Photonics Conference and Exhibition, pp. 531–532 (2010)
Schrijver A.: Theory of Linear and Integer Programming. Wiley, New York (1986)
Andersen, D.: Theoretical Approaches to Node Assignment. Unpublished Manuscript. http://www.cs.cmu.edu/~dga/papers/andersen-assign.ps (2002)
Zhou, Y., Li, Y., Sun, G., Jin, D., Su, L., Zeng, L.: Game theory based bandwidth allocation scheme for network virtualization. In: IEEE GLOBECOM, Miami (2010)
Goel, A., Indyk, P.: Stochastic load balancing and related problems. In: Proceedings of 40th Annual Symposium on foundation of Computer Science, pp. 579–586 (1999)
Kleinberg, J., Rabani, Y., Tardos, E.: Allocating bandwidth for bursty connections. In: Proceedings of 29th ACM Symposium on Theory of Computing, pp. 664–673 (1997)
Wang, M., Meng, X., Zhang, L.: Consolidating virtual machines with dynamic bandwidth demand in data centers. In: IEEE INFOCOM, pp. 1–10. Shanghai, China (2011)
Mukherjee B.: Optical WDM Networks. Springer, Berlin (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Sun, G., Yu, H., Li, L. et al. Exploring online virtual networks mapping with stochastic bandwidth demand in multi-datacenter. Photon Netw Commun 23, 109–122 (2012). https://doi.org/10.1007/s11107-011-0341-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11107-011-0341-z