778 research outputs found
A multipopulation parallel genetic simulated annealing based QoS routing and wavelength assignment integration algorithm for multicast in optical networks
Copyright @ 2008 Elsevier B.V. All rights reserved.In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoS multicast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation parallel genetic simulated annealing algorithm, and then assigns wavelengths to the tree based on the wavelength graph. In the algorithm, routing and wavelength assignment are integrated into a single process. For routing, the objective is to find a cost suboptimal multicast tree. For wavelength assignment, the objective is to minimize the delay of the multicast tree, which is achieved by minimizing the number of wavelength conversion. Thus both the cost of multicast tree and the user QoS satisfaction degree can approach the optimal. Our algorithm also considers load balance. Simulation results show that the proposed algorithm is feasible and effective. We also discuss the practical realization mechanisms of the algorithm.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant nos. 60673159 and 70671020, the National High-Tech Research and Development Plan of China under Grant no. 2006AA01Z214, Program for New Century Excellent Talents in University, and the Key Project of Chinese Ministry of Education under Grant no. 108040
High speed all optical networks
An inherent problem of conventional point-to-point wide area network (WAN) architectures is that they cannot translate optical transmission bandwidth into comparable user available throughput due to the limiting electronic processing speed of the switching nodes. The first solution to wavelength division multiplexing (WDM) based WAN networks that overcomes this limitation is presented. The proposed Lightnet architecture takes into account the idiosyncrasies of WDM switching/transmission leading to an efficient and pragmatic solution. The Lightnet architecture trades the ample WDM bandwidth for a reduction in the number of processing stages and a simplification of each switching stage, leading to drastically increased effective network throughputs. The principle of the Lightnet architecture is the construction and use of virtual topology networks, embedded in the original network in the wavelength domain. For this construction Lightnets utilize the new concept of lightpaths which constitute the links of the virtual topology. Lightpaths are all-optical, multihop, paths in the network that allow data to be switched through intermediate nodes using high throughput passive optical switches. The use of the virtual topologies and the associated switching design introduce a number of new ideas, which are discussed in detail
Optical network planning for static applications
Traffic demands on optical transport networks continue to grow, both in numbers
and in size, at an incredible rate. Consequently, the efficient use of network resources has
never been as important as today. A possible solution to this problem is to plan, develop
and implement efficient algorithms for static and/or dynamic applications in order to
minimize the probability of blocking and/or minimizing the number of wavelengths.
Static Routing and Wavelength Assignment (RWA) algorithms use a given set of optical
path requests and are intended to provide a long-term plan for future traffic. Static RWA
algorithms are important for current and future WDM (Wavelength-Division
Multiplexing) networks, especially when there is no wavelength conversion, the network
is highly connected or the traffic load is moderate to high.
In this dissertation, we propose to develop an optical network planning tool capable
of choosing the best optical path and assigning as few wavelengths as possible. This tool
is structured in five phases: in the first phase, the network physical topology is defined
by the adjacency matrix or by the cost matrix and the logical topology is defined by the
traffic matrix; in a second phase, the Dijkstra algorithm is used to find the shortest path
for each connection; in the third phase, the traffic routing is accomplished considering
one traffic unit between the source and destination nodes; in the fourth phase, the paths
are ordered using various ordering strategies, such as Shortest Path First, Longest Path
First and Random Path Order; finally, in the fifth phase, the heuristic algorithms for
wavelength assignment, such as Graph Coloring, First-Fit and Most-Used are used. This
tool is first tested on small networks (e.g. ring and mesh topologies), and then applied to
real networks (e.g. COST 239, NSFNET and UBN topologies). We have concluded that
the number of wavelengths calculated for each network is almost independent of the
Wavelength Assignment (WA) heuristics, as well as the ordering strategy, when a full
mesh logical topology is considered.Os pedidos de tráfego nas redes de transporte ópticas continuam a crescer, tanto em
número como em tamanho, a um ritmo incrÃvel. Consequentemente, a utilização eficiente
dos recursos das redes nunca foi tão importante como hoje. Uma solução possÃvel para
este problema passa por planear, desenvolver e implementar algoritmos eficientes para
aplicações estáticas e/ou dinâmicas de modo a minimizar a probabilidade de bloqueio
e/ou minimizar o número de comprimentos de onda. Os algoritmos de encaminhamento
e de atribuição de comprimentos de onda (RWA) estáticos utilizam um determinado
conjunto de pedidos de caminhos ópticos e visam fornecer um plano de longo prazo para
tráfego futuro. Os algoritmos RWA estáticos são importantes para as redes em
multiplexagem por divisão de comprimento de onda (WDM) atuais e futuras,
especialmente quando não há conversão de comprimento de onda, a rede é altamente
ligada ou a carga de tráfego é de moderada a alta.
Nesta dissertação, propomos desenvolver uma ferramenta de planeamento de redes
ópticas capaz de escolher o melhor caminho óptico e atribuir o mÃnimo de comprimentos
ondas possÃveis. Esta ferramenta está estruturada em cinco fases: numa primeira fase é
definida a topologia fÃsica de rede pela matriz das adjacências ou pela matriz de custo e a
topologia lógica é definida pela matriz de tráfego; numa segunda fase é utilizado o
algoritmo Dijkstra para encontrar o caminho mais curto para cada ligação; na terceira fase
o encaminhamento de tráfego é realizado considerando uma unidade de tráfego entre os
nós de origem e destino; na quarta fase os caminhos são ordenados tendo em conta as
várias estratégias de ordenação, tais como Shortest Path First, Longest Path First e
Random Path Order; finalmente, na quinta fase, os algoritmos heurÃsticos são utilizados
para atribuição de comprimentos de onda, como Graph Coloring, First-Fit e Most-Used.
Esta ferramenta é primeiramente testada em redes pequenas (por exemplo, topologias em
anel e em malha), e depois é aplicada a redes reais (por exemplo, redes COST 239,
NSFNET e UBN). ConcluÃmos que o número de comprimentos de onda calculados para
cada rede é quase independente da heurÃstica para atribuição dos cumprimentos de onda,
bem como da estratégia de ordenação dos caminhos, quando uma topologia lógica em
malha completa é considerada
Network Coding for WDM All-Optical Multicast
Network coding has become a useful means for achieving efficient multicast, and the optical community has started to examine its application to optical networks. However, a number of challenges, including limited processing capability and coarse bandwidth granularity, need to be overcome before network coding can be effectively used in optical networks. In this paper, we address some of these problems. We consider the problem of finding efficient routes to use with coding, and we study the effectiveness of using network coding for optical-layer dedicated protection of multicast traffic. We also propose architectures for all-optical circuits capable of performing the processing required for network coding. Our experiments show that network coding provides a moderate improvement in bandwidth efficiency for unprotected multicast while significantly outperforming existing approaches for dedicated multicast protection
Survivability and performance optimization in communication networks using network coding
The benefits of network coding are investigated in two types of communication networks: optical backbone networks and wireless networks. In backbone networks, network coding is used to improve survivability of the network against failures. In particular, network coding-based protection schemes are presented for unicast and multicast traffic models. In the unicast case, network coding was previously shown to offer near-instantaneous failure recovery at the bandwidth cost of shared backup path protection. Here, cost-effective polynomial-time heuristic algorithms are proposed for online provisioning and protection of unicast traffic. In the multicast case, network coding is used to extend the traditional live backup (1+1) unicast protection to multicast protection; hence called multicast 1+1 protection. It provides instantaneous recovery for single failures in any bi-connected network with the minimum bandwidth cost. Optimal formulation and efficient heuristic algorithms are proposed and experimentally evaluated. In wireless networks, performance benefits of network coding in multicast transmission are studied. Joint scheduling and performance optimization formulations are presented for rate, energy, and delay under routing and network coding assumptions. The scheduling component of the problem is simplified by timesharing over randomly-selected sets of non-interfering wireless links. Selecting only a linear number of such sets is shown to be rate and energy effective. While routing performs very close to network coding in terms of rate, the solution convergence time is around 1000-fold compared to network coding. It is shown that energy benefit of network coding increases as the multicast rate demand is increased. Investigation of energy-rate and delay-rate relationships shows both parameters increase non-linearly as the multicast rate is increased
Recommended from our members
Wavelengths switching and allocation algorithms in multicast technology using m-arity tree networks topology
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University London.In this thesis, the m-arity tree networks have been investigated to derive equations for their nodes, links and required wavelengths. The relationship among all parameters such as leaves nodes, destinations, paths and wavelengths has been found. Three situations have been explored, firstly when just one server and the leaves nodes are destinations, secondly when just one server and all other nodes are destinations, thirdly when all nodes are sources and destinations in the same time. The investigation has included binary, ternary, quaternary and finalized by general equations for all m-arity tree networks.
Moreover, a multicast technology is analysed in this thesis to transmit data carried by specific wavelengths to several clients. Wavelengths multicast switching is well examined to propose split-convert-split-convert (S-C-S-C) multicast switch which consists of light splitters and wavelengths converters. It has reduced group delay by 13% and 29% compared with split-convert (S-C) and split-convert-split (S-C-S) multicast switches respectively. The proposed switch has also increased the received signal power by a significant value which reaches 28% and 26.92% compared with S-C-S and S-C respectively.
In addition, wavelengths allocation algorithms in multicast technology are proposed in this thesis using tree networks topology. Distributed scheme is adopted by placing wavelength assignment controller in all parents’ nodes. Two distributed algorithms proposed shortest wavelength assignment (SWA) and highest number of destinations with shortest wavelength assignment (HND-SWA) algorithms to increase the received signal power, decrease group delay and reduce dispersion. The performance of the SWA algorithm was almost better or same as HND-SWA related to the power, dispersion and group delay but they are always better than other two algorithms. The required numbers of wavelengths and their utilised converters have been examined and calculated for the researched algorithms. The HND-SWA has recorded the superior performance compared with other algorithms. It has reduced number of utilised wavelengths up to about 19% and minimized number of the used wavelengths converters up to about 29%.
Finally, the centralised scheme is discussed and researched and proposed a centralised highest number of destinations (CHND) algorithm with static and dynamic scenarios to reduce network capacity decreasing (Cd) after each wavelengths allocation. The CDHND has reduced (Cd) by about 16.7% compared with the other algorithms
Performance Analysis of Artificial Bee-Colony Algorithm for Routing and Wavelength Assignment in DWDM Transport Network
Setting up lightpaths for a set of requested connection of wavelength division multiplexing (WDM) network, is by routing and assigning wavelengths to each connection. So as to minimize the use of network resources or maximize the traffic served, is called the routing and wavelength assignment (RWA) problem. A new idea based on Artificial Bee Colony (ABC) algorithm is introduced for solving RWA problem which is known to be an NP-hard problem. In the proposed ABC-RWA approach every food source represents a possible and feasible candidate lightpath between each original and destination node span in demand matrix. The situation of the food source is modified by some artificial bee in the population where the aim is to discover the places of food sources. The food source with the highest nectar value seems to be a solution which is evaluated by the fitness function.
This thesis proposes solutions to solve the RWA problem using artificial bee-colony algorithm in order to achieve better performance of the network connection to serve a given demand matrix of an optical network to reach RWA global solution. The work will evaluate the path length (propagation delay) for solving RWA problem with ABC algorithm in a real-world optical networks test bench to find optimal routes for connection request in demand matrix according to objective function and some physical and operational constraints in Dense Wavelength Division Multiplexing (DWDM) optical networks.
Based on simulation with several generated traffic distribution, ABC algorithm can be used to solve routing and wavelength problem at DWDM transport network as shown that in line with iteration process the path length observed toward minimum value. The number of iteration needed to reach the fitness value depends on several parameter such as number of connection request, number of wavelength and alternative path, the distribution of generated traffic and also population size
- …