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.
When planning survivable WDM mesh networks, conventional solutions to provide differentiated reliability under shared risk link group (SRLG) constraints mostly assume explicit knowledge of traffic matrices, and consider the failure probability of a fiber link with single criteria (e.g., the link length). Due to the highly variation of nowadays demand patterns and multiple causes of SRLG failures,...
We address the issue of traffic-oblivious routing (i.e., robust routing) in WDM networks dealing with both link and node failures under load-balancing architectures. Two distinct schemes are proposed. One is static with the goal of minimizing total network cost given a set of multiple failures. The other considers dynamic network environment (i.e., connection requests arrive one after another), and...
Valiant load-balancing [1] (VLB) has attracted considerable research interest in recent years, as it guarantees 100% throughput for any traffic matrix satisfying hose model[2] constraints without obtaining precise traffic matrix. However, when the traffic variation tends to be gentle, the measurement of traffic demands between certain node pairs becomes feasible. Then it is likely to adjust the VLB...
In this paper, we propose a novel method to address the problem of designing virtual topology over WDM networks under traffic demand uncertainties. We present a traffic model under uncertainties. The optimization goal of virtual topology design is defined as minimizing the maximum value among p percentiles of the traffic distribution on all light-paths. Correspondingly, we propose a heuristic algorithm...
In this paper, we introduce a novel oblivious routing scheme based on valiant load-balancing for the model of polyhedral uncertainty (i.e., hose model), and the scheme is implemented with traffic-grooming approach in WDM mesh networks. Considering that a high-speed connection request in optical networks is difficult to be divided into low-speed connections, we propose the method of hose-model separation...
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.