Dynamic lightpath establishment in wavelength routed WDM networks

Zang, Hui; Jue, Jason P.; Sahasrabuddhe, L.; Ramamurthy, Ramu; Mukherjee, Biswanath

doi:10.1109/35.948897

Cited by 208 publications

(12 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The parameters used were similar to those presented in Zang (2001), and comparisons were made of the relevant indicators, such as the probability of blocking and using the network, varying the load in the [0,180] interval with increases of 5 erlangs. The number of connections made during the simulation exercise in each and every one of the contexts, including Simulated Annealing (SA), Genetic Algorithms (AG), Tabu Search, and Snake-One (SNK1), was 108 connection requests.…”

Section: Simulation Exercise Contextmentioning

confidence: 99%

“…The RWA problem is called SLE (Static Lightpath Establishment) if traffic is static, and DLE (Dynamic Lightpath Establishment) if the traffic is dynamic, as noted in Khan (2005), Rodriguez (2008) and Zang (2001). Traffic is dynamic when the requested average connection time (t C ) is less than the average time between arrivals (t LL ) of the request for service, as shown in Figure 2.…”

Section: Description Of the Rwa Problemmentioning

confidence: 99%

“…The most widely used are First Fit (FF), which assigns the first wavelength that fits; Best Fit (BF), which assigns the wavelength that fits best; Next Fit (NF), which tests the next wavelength after the last one that was assigned; Worst Fit (WF), which tests the wavelength under the criterion of maximum network utilization (it does not improve the use of the network. However, it increases blocking probability); Random Fit (RF), which tests the wavelengths randomly; Least Used (LU), which tests the least used one; and Most Used (MU) which tests the most used one as noted in Zang (2001). Finally, regarding the criteria used for optimizing, we can find research based on minimizing or maximizing some criterion such as ASE noise, total congestion, congestion at a link, jitter, total delay, blocking probability, network utilization, congestion of a specific commutator, and others.…”

Section: Description Of the Rwa Problemmentioning

confidence: 99%

“…The number of connections made during the simulation exercise in each and every one of the contexts, including Simulated Annealing (SA), Genetic Algorithms (AG), Tabu Search, and Snake-One (SNK1), was 108 connection requests. The non-heuristic algorithm used as reference is the one shown in Zang (2001), which made 104 requests and loads of up to 160 erlangs.…”

Section: Simulation Exercise Contextmentioning

confidence: 99%

See 3 more Smart Citations

New Heuristic Algorithm for Dynamic Traffic in WDM Optical Networks

2015

View full text Add to dashboard Cite

This paper presents the results from the simulation of Snake One, a new heuristic algorithm, and the comparison made between three heuristic algorithms: Genetic Algorithms, Simulated Annealing, and Tabu Search, using blocking probability and network utilization as standard indicators. The simulation exercise was conducted on WDM NSFNET under dynamic traffic conditions. The results show a substantial decrease of blocking. However, this causes a relative network utilization growth. There are also load intervals which lead to performance improvement, decreasing the number of blocked requests.Keywords: WDM networks, heuristic algorithm, optical cross connect, dynamic traffic, NSFNET. RESUMENEn este artículo se presentan los resultados y la comparación de la simulación de un nuevo algoritmo heurístico llamado Serpiente Uno. La comparación se hace con tres algoritmos heurísticos: Algoritmos Genéticos, Simulated Annealing y Búsqueda Tabú, utilizando como indicadores estándar la probabilidad de bloqueo y la utilización de la red. La simulación se realizó sobre la WDM NSFNET en condiciones de tráfico dinámicos. Los resultados muestran una disminución sustancial de la probabilidad de bloqueo. Sin embargo, esto causa un aumento relativo de la utilización de la red. También hay intervalos de carga donde el rendimiento mejora, disminuyendo el número de solicitudes bloqueadas.

show abstract

Section: Simulation Exercise Contextmentioning

confidence: 99%

Section: Description Of the Rwa Problemmentioning

confidence: 99%

Section: Description Of the Rwa Problemmentioning

confidence: 99%

Section: Simulation Exercise Contextmentioning

confidence: 99%

See 2 more Smart Citations

New Heuristic Algorithm for Dynamic Traffic in WDM Optical Networks

2015

View full text Add to dashboard Cite

show abstract

“…Although RWA is categorized to static and dynamic, we focus on dynamic RWA in which lightpaths are dynamically established as lightpath-setup requests arrive (Zang et al, 2001). The performance metric in networks using dynamic RWA is typically the blocking probability of lightpath establishment.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Routing and Wavelength Assignment in Multifiber WDM Networks with Wavelength Conversion Capability

Hirata¹,

Dewiani²

2012

NCT

View full text Add to dashboard Cite

This paper proposes a dynamic routing and wavelength assignment (RWA) scheme in multifiber WDM networks with wavelength conversion capability. In multifiber WDM networks, each link consists of multiple fibers. Thus, multiple lightpaths with the same wavelength can be established in the same link as long as they use different fibers. In WDM networks with wavelength conversion, the network nodes have wavelength conversion capability which can convert one wavelength to another. In order to efficiently utilize multifiber and wavelength conversion capability, an appropriate RWA scheme is necessary. The proposed scheme provides RWA for multifiber WDM networks with sparse and full wavelength conversion capability. In the proposed scheme, a route and wavelengths are selected for each lightpath based on wavelength availability and location of nodes with wavelength conversion capability. Through simulation experiments, we show that the proposed scheme reduces the blocking probability of lightpath establishment efficiently.

show abstract