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 consider the Routing and Wavelength Assignment problem in WDM optical networks. We consider the dynamic traffic and assume that in each optical fiber the number of wavelengths has fixed. In this paper, our attempt is to minimize the call connection blocking ratio using Intelligent Water Drops (IWD) Algorithm for RWA problem in an optical network. The IWD algorithm employed has modified...
We consider the problem of provisioning multiple multicast requests in WDM networks simultaneously. We aims at minimizing the number of wavelengths used while satisfying all the requests. Instead of using the traditional light-trees, we propose to use the light-hierarchy structure to route multicast requests, which permits more flexible routes and thus enables us to reduce and/or balance the usage...
Given a sparse splitting WDM network, a set of available wavelengths, we investigate the problem of provisioning a set of multicast requests simultaneously with the objective of minimizing the blocking probability. Two blocking policies are taken into account: full blocking probability (FB) and partial blocking probability (PB). As the problem is NP-hard, we introduce several efficient adaptive heuristic...
Existing research has shown that the mode in which Routing and Wavelength Assignment (RWA) of lightpath requests are carried out can significantly affect resource consumption in optical WDM networks. The increase in resource consumption in turn directly affects the blocking probability for future lightpath requests. The RWA problem in all-optical networks is known to be NP-Complete. In this paper...
Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in a Wavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running...
Preemptive Routing and Wavelength Assignment (RWA) algorithms preempt established lightpaths in case not enough resources are available to set up a new lightpath in aWavelength Division Multiplexing (WDM) network. The selection of lightpaths to be preempted relies on internal decisions of the RWA algorithm. Thus, if dedicated properties of the network topology are required by the applications running...
As the survivable mapping is critical in IP-over-wavelength-division-multiplexing (WDM) network to guarantee the restorability of IP layer, provisioning survivability in network with dynamic traffic is essential. However, survivable mapping problem for dynamic traffic shows more complexity than that for static traffic: 1) How to guarantee a survivable mapping since the lightpath is established and...
This paper presents a comparative study between the dynamic survivability approaches in WDM mesh networks. The paper focuses on the diverse routing and the p-cycle approaches to protect mesh networks against single span failure under dynamic traffic. The computational complexity and the blocking performances of both approaches are analyzed and compared. Simulation results suggest that the p-cycle...
Dynamic grooming deals with requests for wavelength allocation based on a dynamic pattern of arrivals in contrast to the situation of static grooming in which the pattern of arrivals must be previously known. Solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network either...
This paper addresses the problem of reducing congestion during logical topology design in de Bruijn WDM networks that can withstand the failure of a single physical link. Survivable routing of a logical topology ensures that the lightpaths are routed in a way that a single link failure does not disconnect the network. Survivable routing of the logical topology demands setting up of additional lightpaths...
In a Wavelength Division Multiplexing (WDM) network, the performance of the virtual topology designed for a pre-specified traffic pattern can be improved by performing virtual topology reconfiguration. Simultaneously, the provision of survivability of WDM networks is important, because the transmission of huge data should be protected when a fiber fails. Thus, the combination of survivability and...
Traffic grooming in wavelength division multiplexing networks merges low-speed flows into large capacity pipes so that the bandwidth discrepancy between them will not lead to underutilization of resources. On-line solutions for dynamic grooming typically involve the construction of an auxiliary graph for deciding on the routing and wavelength assignment. An auxiliary graph can represent the network...
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.