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.
PCE is an emerging technology to aggregate path computation tasks in some certain elements. The location of these elements may influence network performance. In this paper, an ILP model for PCEs location problem is formulated and a heuristic algorithm is proposed. Simulations are conducted to evaluate the effectiveness of the algorithm presented.
This paper investigates the diverse routing problem in the presence of shared risk link groups (SRLGs) and proposes two ILP models for partial SRLG-disjoint protection based on grouping of the individual SRLGs in classes. We demonstrate our approach with SRLGs constructed from seismic maps, hence reducing the likelihood of a single earthquake affecting large portions of the network. Compared with...
In this article, a new technique for grooming low-speed traffic demands into high-speed optical routes is proposed. This enhancement allows a transparent wavelength-routing switch (WRS) to aggregate traffic en route over existing optical routes without incurring expensive optical-electrical-optical (OEO) conversions. This implies that: a) an optical route may be considered as having more than one...
In this paper we propose a new framework for computing an efficient set of p-cycles which can lead to superior performance in terms of capacity utilization in network protection. We first propose an algorithm for finding all fundamental cycles. Then, the set of candidate p-cycles is constructed by merging fundamental cycles. The number of proposed candidate p-cycles is small but they can construct...
We propose a joint optimization model for capacity design of networks with p-cycles. The model is based on a modified definition of network fundamental cycles and the available straddling links. Concepts about visible and hidden straddling links, which are essential components of our model are also introduced. This is the first ILP model for joint optimization of p-cycle network that can be solved...
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.