publication . Research . Preprint . 2010

Generalized and Resource-Efficient VNet Embeddings with Migrations

Schaffrath, Gregor; Schmid, Stefan; Feldmann, Anja;
Open Access English
  • Published: 18 Dec 2010
Abstract
This paper attends to the problem of embedding flexibly specified CloudNets, virtual networks connecting cloud resources (such as storage or computation). We attend to a scenario where customers can request CloudNets at short notice, and an infrastructure provider (or a potential itermediate broker or reseller) first embeds the CloudNet fast (e.g., using a simple heuristic). Later, however, long-lived CloudNets embeddings are optimized by migrating them to more suitable locations, whose precise definition depends on a given objective function. For instance, such migrations can be useful to reduce the peak resource loads in the network by spreading CloudNets acro...
Subjects
free text keywords: Computer Science - Networking and Internet Architecture
20 references, page 1 of 2

[1] D. Andersen. Theoretical approaches to node assignment. In CS CMU Report, 2002.

[2] N. F. Butt, M. Chowdhury, and R. Boutaba. Topology-awareness and reoptimization mechanism for virtual network embedding. In Proc. IFIP/TC6 NETWORKING, 2010.

[3] K. Chowdhury, M. R. Rahman, and R. Boutaba. Virtual network embedding with coordinated node and link mapping. In Proc. IEEE INFOCOM, 2009. [OpenAIRE]

[4] M. K. Chowdhury and R. Boutaba. A survey of network virtualization. Elsevier Computer Networks, 54(5), 2010. [OpenAIRE]

[5] L. P. Cordella, P. Foggia, C. Sansone, and M. Vento. An improved algorithm for matching large graphs. In Proc. Workshop on Graphbased Representations in Pattern Recognition, 2001.

[6] G. Even, M. Medina, G. Schaffrath, and S. Schmid. Competitive and deterministic embeddings of virtual networks. In Proc. 13th International Conference on Distributed Computing and Networking (ICDCN), 2012.

[7] J. Fan and M. H. Ammar. Dynamic topology configuration in service overlay networks: A study of reconfiguration policies. In Proc. IEEE INFOCOM, 2006.

[8] A. Haider, R. Potter, and A. Nakao. Challenges in resource allocation in network virtualization. In Proc. ITC Specialist Seminar on Network Virtualization, 2009. [OpenAIRE]

[9] I. Houidi, W. Louati, and D. Zeghlache. A distributed virtual network mapping algorithm. 2008. [OpenAIRE]

[10] A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener. Algorithms for provisioning virtual private networks in the hose model. IEEE/ACM Trans. Netw., 10(4), 2002.

[11] J. Lischka and H. Karl. A virtual network mapping algorithm based on subgraph isomorphism detection. In Proc. ACM SIGCOMM VISA, 2009. [OpenAIRE]

[12] J. Lu and J. Turner. Efficient mapping of virtual networks onto a shared substrate. In WUCSE-2006-35, Washington University, 2006.

[13] Y.-W. E. S. D. M. S. R. K. S. M. T. M. Hajjat, X. Sun. Cloudward bound: Planning for beneficial migration of enterprise applications to the cloud. In Proc. ACM SIGCOMM, 2011.

[14] R. Ricci, C. Alfeld, and J. Lepreau. A solver for the network testbed mapping problem. ACM SIGCOMM CCR, 33(2), 2003. [OpenAIRE]

[15] G. Schaffrath, C. Werle, P. Papadimitriou, A. Feldmann, R. Bless, A. Greenhalgh, A. Wundsam, M. Kind, O. Maennel, and L. Mathy. Network virtualization architecture: Proposal and initial prototype. In Proc. ACM SIGCOMM VISA, pages 63-72, 2009. [OpenAIRE]

20 references, page 1 of 2
Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue