Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks

Karasan, Ezhan; Ayanoğlu, Ender

doi:10.1109/90.664267

Cited by 301 publications

(135 citation statements)

References 23 publications

Supporting

Mentioning

129

Contrasting

Unclassified

Order By: Relevance

“…As proved in [18] by means of analytical calculations, the channel power and the maximum allowed distance of a lightpath is in a linear relation: L = L c × P mW , where L is the maximum allowed distance, P mW is the input power in mW and L c is the linear factor between them. For typical constant values used in telecommunications, L c is between 500, and 2000.…”

Section: Physical Impairment Constrained Routingmentioning

confidence: 99%

Methods for physical impairment constrained routing with selected protection in all-optical networks

2013

View full text Add to dashboard Cite

In this paper, we investigate the problem of survivable all-optical routing in WDM networks with physical impairments. One of the recent key issues in survivable optical network design refers to maximization of the ratio of routeable demands while keeping the overall network cost low. In WDM networks, this goal can be achieved by routing as many demands in all-optical way as possible. Based on the latest technical trends driven by deployment costs, technical constraints, and backward compatibility, this will not mean that all demands will be routed in all-optical way in the near future.Nowadays, operators are mostly willing to dedicate only a given ratio of their power budget to all-optical routing. This in turn implies a new problem to be solved: operators have to find a way to select demands that should be routed in all-optical way and which should not. The problem gets even more complicated, if we add demand protection issues.In this paper, we introduce and evaluate methods able to maximize the number of demands routed with protection in all-optical way in capacity-constrained networks with limitations on path lengths according to physical impairments.

show abstract

Section: Physical Impairment Constrained Routingmentioning

confidence: 99%

Methods for physical impairment constrained routing with selected protection in all-optical networks

2013

View full text Add to dashboard Cite

show abstract

“…Also, various studies show that the performance improvement obtained by using more than two paths is not significant when alternate routing is used. For WDM networks, it is shown in [17,18] that, when the number of alternate paths is increased from one to two, the performance improvement is significant. However, increasing the number of alternate paths further does not provide a significant improvement.…”

Section: Obs Grid Architecturesmentioning

confidence: 99%

Joint resource and network scheduling with adaptive offset determination for optical burst switched grids

Koseoglu

Karasan

2010

Future Generation Computer Systems

View full text Add to dashboard Cite

a b s t r a c tOptical burst switching (OBS) is a promising technology for optical grids with short-lived and interactive data communication requirements. On the other hand, burst losses are in the nature of the OBS protocol and these losses severely affect the grid job completion times. This paper first proposes a joint grid resource and network provisioning method to avoid congestion in the network in order to minimize grid job completion times. Simulations show that joint provisioning significantly reduces completion times in comparison to other methods that perform network provisioning after grid scheduling. An adaptive extra offset based quality of service (QoS) mechanism is also proposed in order to reduce grid burst losses in case of network congestion. Results show that this adaptive mechanism significantly reduces grid completion times by exploiting the trade-off between decreasing loss probability and increasing delay introduced by the extra offset time.

show abstract

“…• ll or least loaded algorithm (see [3] is similar to pcolor but here the chosen RW pair is the one which leaves most capacity free after the assignment, i.e. the minimal number of free wavelengths over the links used is maximized.…”

Section: Heuristic Algorithmsmentioning

confidence: 99%

“…[3][5] [7]). In this paper we study this problem in the setting of Markov Decision Processes (MDP) and propose a new approach, where we try to improve any given heuristic algorithm by the first policy iteration [9] [11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamic Routing and Wavelength Assignment Using First Policy Iteration, Inhomogeneous Traffic Case

Hyytiä¹,

Virtamo²

2001

Performance and QoS of Next Generation Networking

View full text Add to dashboard Cite

With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution because of the huge size of the state space. Only heuristic algorithms have been presented up till now. In this paper we propose an approach where, starting from a given heuristic algorithm, one obtains a better algorithm by the first policy iteration. In order to estimate the relative costs of states, we make a simulation on the fly studying, at each decision epoch, the consequences of all the alternatives actions. Being computationally intensive, this method can be used in real time only for systems with slow dynamics. Off-line it can be used to assess how close the heuristic algorithms come to the optimal policy. Numerical examples are given about the policy improvement.

show abstract

Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks

Cited by 301 publications

References 23 publications

Methods for physical impairment constrained routing with selected protection in all-optical networks

Methods for physical impairment constrained routing with selected protection in all-optical networks

Joint resource and network scheduling with adaptive offset determination for optical burst switched grids

Dynamic Routing and Wavelength Assignment Using First Policy Iteration, Inhomogeneous Traffic Case

Contact Info

Product

Resources

About