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.
We address the cost-effective 2R/3R regenerators placement problem. An optimal polynomial-time algorithm for line network topologies and a heuristic for mesh network topologies are proposed. The benefits of combined 2R/3R regenerators placement are evaluated.
In this paper, we address the problem of survivable traffic grooming and regenerator placement in optical wavelength division multiplexing (WDM) networks with impairment constraints. The working connections are protected end to end by provisioning bandwidth along a sequence of lightpaths through either a dedicated or a shared connection-level protection scheme. We propose an auxiliary-graph-based...
In this paper, we address the problem of survivable traffic grooming in optical WDM networks in which lightpaths are hop constrained. Survivability is provisioned at the wavelength granularity through either dedicated or shared path protection schemes. We propose an auxiliary-graph-based algorithm that addresses grooming, protection, and impairment constraints in a combined manner and that determines...
We investigate the sequential task anycast scheduling problem (STAS) for grid applications in an optical burst switched network. In STAS, the subtasks of a given request have sequential dependency and must be processed in order. Each node in the network provides a set of services and each subtask may demand a different type of service. The problem is to find an ordered set of nodes that can minimize...
Compared to energy-awareness research in wireless and copper networks, less attention has been given to energy awareness in optical counterparts. In this paper, we introduce energy-aware traffic grooming problems for optical networks. We show that by looking further into the modular physical architecture of a node during request allocations, we can significantly reduce the number of active components...
We consider traffic grooming and regenerator placement in an optical network in which lightpaths are hop-constrained by impairments. Combining grooming with regenerator placement reduces costs compared to addressing traffic grooming and regenerator placement separately.
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.