The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Virtual Network Mapping (VNM) has been a key issue for network virtualization need to be addressed. A traditional substrate network is usually managed by multicast InPs, and many applications in the substrate network can be characterized by hybrid virtual networks with both unicast and multicast requests. However, to the best of our knowledge, few researches focus on the problem of hybrid virtual...
One of the challenge issues in network virtualization is the efficient mapping of a virtual network (VN) onto a shared substrate network. The VN mapping problem has been addressed by various researchers. However, these solutions and associated algorithms are only efficient for building unicast service oriented virtual networks, and are not applicable to multicast service oriented VNs. Furthermore,...
Network virtualization allows the coexistence of multiple virtual networks on a shared substrate network. A virtual network created by a service provider (SP) typically spans across multiple domains that may be managed by different infrastructure providers (InPs). The topology and resource information on each domain is confidential and kept private by the InP. However, a domain-level view is required...
With the increasingly popular virtualization of both computing and networking resources in a multi-datacenter system (called a physical substrate), multiple virtual infrastructures (VIs) can share the physical resources of the underlying substrate, and accordingly even a single failure in the substrate can affect a large number of VIs and the services they offer. Thus, the problem of efficiently mapping...
As network virtualization becomes popular, the problem of efficiently mapping a virtual infrastructure (VI) over a substrate network while guaranteeing its survivability in the event of failures becomes increasingly important. In this paper, we study the survivable VI mapping problem to recover from facility node failures. We develop two solutions namely the 1-redundant scheme and the K-redundant...
We propose l-redundant and K-redundant schemes for the design and mapping of survivable virtual infrastructure to recover from facility node failures while minimizing network costs. The efficiency of our solutions is compared using simulation.
As virtualization becomes more and more popular, how to guarantee survivability of a virtual infrastructure (VI) over a wide-area optical network is increasingly important. In this paper, we approach the problem of survivable VI mapping (SVIM) from a few unique perspectives. One of the most distinguishing perspectives is that a large-scale regional failure could destroy one or more facility nodes...
Network virtualization is a promising solution that can offer more flexibility and prevent Internet ossification without requiring extensive network redesign. Using virtualization multiple heterogeneous virtual network (VN) architectures can cohabit on a shared physical network substrate. Virtualization can be used to run multiple different applications (e.g., operating systems, servers, networking...
Network virtualization is an important technique for designing the future Internet architecture. Virtualization can help diversify the Internet by supporting multiple virtual network services and architectures on a shared substrate. Making efficient use of the underlying substrate network resources requires effective algorithms for virtual network embedding (VNE) that maps each virtual network (VN)...
In this work we propose two decomposition algorithms LR-SVNE and D-SVNE for solving the SVNE problem efficiently. We focus on the design of survivable VN embedding with resource constraints. The VN embedding problem with resource constraints is NP-hard, hence most work focuses on devising heuristic solutions. Simulation results show that our algorithms perform well in terms of both time complexity...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.