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.
Recently, CPU and graphics processors have been increasing the degree of on-chip parallelism in order to combat the decrease in traditional Moore's Law scaling. As a result, these new processors are increasing their appetite for faster memory devices with higher bandwidth. Component manufacturers have resorted to disparate or hierarchical fast memory device architectures such as shared local memory...
Orchestration across multiple domains is important for providing end-to-end services in software defined infrastructures. In this paper, we address the service function chain (SFC) mapping problem in a multi-domain network with nodes having different functions, i.e., service functions and/or switch functions. We present two different abstractions of the topology graph at the distributed orchestrators...
Computation of service function chains in multi-domain networks is critical for enabling the wide deployment of network function visualization for providing end-to-end network services. In this paper, we present a vertex-centric distributed orchestration framework for multi-domain networks, in which physical infrastructure information is maintained locally within each domain without infrastructure...
In this paper, we study the reliable virtual network mapping (RVNM) problem for allocating virtual machines (VMs) from multiple data centers (DCs) with the objective of maximizing the total reliability of a virtual network under two capacity constraints: computing capacity constraint at each DC and bandwidth capacity constraint on each link. We first describe graph models of RVNM, formulate the RVNM...
We propose heuristics to allocate virtual machines among distributed data centers for a cloud request. Our objective is to minimize the maximum delay between selected data centers, while considering the reliability and computing resource constraints.
We demonstrate novel re-optimization design techniques for realizing agile and seamless service migration with minimum connection disruptions. We also show the effectiveness of our integer linear programming based approach through network simulations.
In this paper, we study the minimum failure resource allocation (MFRA) problem of allocating virtual machines (VMs) across multiple optically interconnected data centers (DCs) with the objective of minimizing the total failure probability based on the information obtained from the optical network virtulization. We first describe the framework of resource allocation, formulate the MFRA problem, and...
In this paper, we consider the problem of routing, modulation, and spectrum assignment (RMSA) for data- flow transfers in elastic optical networks. We design a two-dimensional resource model, in which each data transfer with known data size can be assigned a rectangular block of resources that spans both the spectrum and time dimensions. Furthermore, the dynamic spectral resource allocation problem...
In this paper, we study the reliable resource allocation (RRA) problem of allocating virtual machines (VMs) from multiple optically interconnected data centers (DCs) with the objective of minimizing the total failure probability based on the information obtained from the optical network virtulization. We first describe the framework of resource allocation, formulate the RRA problem, and prove that...
Emerging applications require networks to provide dynamic and reconfigurable services in order to efficiently use network resources for cost reduction. In this paper, we propose a novel integer linear programming (ILP) based approach for network reconfiguration to compute optimized routes for connections, and also to strategically migrate connections to their optimized routes, with the objective of...
We propose a heuristic connection rerouting scheme that iteratively bridges and rolls a subset of connections for improving network utilization. The proposed scheme has no disrupted connection and has low computation and control complexity.
In the current distributed network, the grid computing technology has already been an important technology widely used in resource sharing and resource cooperation. Resource sharing usually participates in the grid activities by joining the Virtual Organization (VO) to achieve the cooperation tasks, so the VO is an important technology, which resources can participate into grid events, collaborative...
A weight-based heuristic algorithm was developed to efficiently aggregate UPSR demands into SONET rings over DWDM networks in order to minimize the total number of optical line cards for a given set of demands.
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.