By Topic

Profitable connection assignment for incremental traffic in all-optical WDM networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Anand, Vishal ; Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA ; Katarki, T. ; Chunming Qiao

In this paper, we investigate the routing and wavelength assignment problem for incremental connection requests in all-optical wavelength-division-multiplexed networks, with the objective of maximizing the profit that can be made. Specifically, each connection request between a pair of nodes in the network is associated with an earning, which can be obtained by satisfying the connection request. Each wavelength on a link is associated with a cost of using that wavelength on that link. We assume that the connection requests come in one by one (incrementally) and once a connection request is satisfied, the connection stays in the network for a long period of time. To establish a connection between a pair of nodes in the network, a path and a wavelength on that path through the network is found, such that connections whose paths share a common link in the network are assigned different wavelengths. We propose profit maximizing heuristics which try to satisfy the incremental connection requests, as they arrive, possibly by re-routing the existing connections in the network, in a manner which maximizes the over-all profit obtained from the network. The heuristics are then compared with a profit maximizing heuristic, which does not re-route any existing connections

Published in:

Research Challenges, 2000. Proceedings. Academia/Industry Working Conference on

Date of Conference: