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.
In this paper, we investigate energy-efficient resilience designs for the translucent optical networks using mixed regenerator placement (MRP). We consider both static and dynamic traffic scenarios and aim to provide 100% restoration against single-link failures while minimizing the total energy-cost on regenerators. For static traffic scenarios, we formulate an integer linear programming (ILP) model...
The restoration based on P-Cycle offers ring-like speed and mesh-like capacity efficiency, but the major challenge resides in finding an optimal set of P-Cycles. A new restoration method named Pre-planned restoration rail (P-Rail) is proposed, and formulates the optimized Integer Linear Programming (ILP) algorithm and the sub-cycle rerouting algorithm. P-Rail yields the harsh need of restoration time...
This paper studies the protection problem of pre-configuration cycles (p-cycles) in survivable mesh networks. A new algorithm called local-map-based finding p-cycles algorithm (LFCA) is proposed to find the candidate p-cycles. The major difference between the previous algorithms of finding cycles and LFCA is that LFCA can find node-encircling p-cycles and some special link p-cycles which must contain...
The major challenge of p-cycle network design resides in finding an optimal set of p-cycles protecting the network for a given working capacity. Existing solutions (exact and heuristic approaches), for solving the problem, find the set of p-cycles protecting the network through two steps: one step for generating candidate p-cycles and a second step for selecting the efficient ones. In this paper,...
We propose an efficiency-score based heuristic algorithm (ESHT) for p-cycle based multicast tree protection. Results show that the capacity-efficiency of ESHT is close to that of ILP-based algorithms, but with much reduced computational time.
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.