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 wavelength division multiplexing (WDM) mesh networks, wavelength utilization is limited by the mismatch between the high bandwidth that one wavelength can provide and the relatively low bandwidth request of a single connection. Traffic grooming which grooms multiple connections onto one wavelength is a desirable technique to improve resource utilization. However, with unpredictable traffic demand,...
With the developments in multimedia and other real-time group applications, the question of how to establish multicast trees satisfying Quality-of-Service (QoS) requirements is becoming a very important problem. In this paper, multicast routing and wavelength assignment with delay constraint (MCRWA-DC) in wavelength division multiplexing (WDM) networks with sparse wavelength conversions is studied...
In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a low-cost delay-constrained routing algorithm is proposed by applying the K-shortest-path strategy. The proposed algorithm has the following advantages: (1) finish routing and wavelength assignment in one step; (2) the total cost of lightpath is low; (3) the delay...
In this paper, the problem of integrated routing and wavelength assignment in wavelength division multiplexing (WDM) networks is studied. We propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a polynomial time algorithm with complexity O(N2) is also proposed to develop an integrated dynamic routing and wavelength assignment, where...
The construction of multicast light-trees in WDM network with sparse splitting has been proved to be an NP-complete problem. To reduce the diameter of the tree and average delay, an improved algorithm called Nearest Connector First Heuristic (NCFH) is proposed. The simulation results show that the proposed algorithm performs well.
In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a polynomial time algorithm with complexity O(N2) is also proposed to develop an integrated dynamic routing and wavelength assignment, where N is the number of nodes in a WDM network.
Recently, light-trail is becoming an appealing architecture for WDM networks which have been considered as promising backbone of the next generation network. Light-trail can inherently support multicast given its bus nature. In this paper, we study how to use the minimum number of light- trails to form a multicast tree for supporting the given multicast session. The problem for general light-trail...
This work studies optical-layer protection design in a WDM mesh network given that, a dual-homing infrastructure is implemented at the IP layer. The problem is formulated as an integer linear program and solved using CPLEX.
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.