2,243 research outputs found
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
Optimised Design and Analysis of All-Optical Networks
This PhD thesis presents a suite of methods for optimising design and for analysing blocking probabilities of all-optical networks. It thus contributes methodical knowledge to the field of computer assisted planning of optical networks. A two-stage greenfield optical network design optimiser is developed, based on shortest-path algorithms and a comparatively new metaheuristic called simulated allocation. It is able to handle design of all-optical mesh networks with optical cross-connects, considers duct as well as fibre and node costs, and can also design protected networks. The method is assessed through various experiments and is shown to produce good results and to be able to scale up to networks of realistic sizes. A novel method, subpath wavelength grouping, for routing connections in a multigranular all-optical network where several wavelengths can be grouped and switched at band and fibre level is presented. The method uses an unorthodox routing strategy focusing on common subpaths rather than individual connections, and strives to minimise switch port count as well as fibre usage. It is shown to produce cheaper network designs than previous methods when fibre costs are comparatively high. A new optical network concept, the synchronous optical hierarchy, is proposed, in which wavelengths are subdivided into timeslots to match the traffic granularity. Various theoretical properties of this concept are investigated and compared in simulation studies. An integer linear programming model for optical ring network design is presented. Manually designed real world ring networks are studied and it is found that the model can lead to cheaper network design. Moreover, ring and mesh network architectures are compared using real world costs, and it is found that optical cros..
Recommended from our members
QoS - Aware content oriented flow routing in optical computer network
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.In this thesis, one of the most important issues in the field of networks communication is tackled and addressed. This issue is represented by QoS, where the increasing demand on highquality
applications together with the fast increase in the rates of Internet users have led to
massive traffic being transmitted on the Internet. This thesis proposes new ideas to manage the flow of this huge traffic in a manner that contributes in improving the communication QoS. This can be achieved by replacing the conventional application-insensitive routing schemes by others
which take into account the type of applications when making the routing decision. As a first contribution, the effect on the potential development in the quality of experience on the loading of
Basra optical network has been investigated. Furthermore, the traffic due to each application was dealt with in different ways according to their delay and loss sensitivities. Load rate distributions
over the various links due to the different applications were deployed to investigate the places of possible congestions in the network and the dominant applications that cause such congestions. In addition, OpenFlow and Optica Burst Switching (OBS) techniques were used to provide a wider range of network controllability and management. A centralised routing protocol
that takes into account the available bandwidth, delay, and security as three important QoS parameters, when forwarding traffics of different types, was proposed and implemented using OMNeT++ networks simulator. As a novel idea, security has been incorporated in our QoS requirements by incorporating Oyster Optics Technology (OOT) to secure some of the optical links aiming to supply the network with some secure paths for those applications that have high
privacy requirements. A particular type of traffic is to be routed according to the importance of these three QoS parameters for such a traffic type. The link utilisation, end to end delays and securities due to the different applications were recorded to prove the feasibility of our proposed
system. In order to decrease the amount of traffic overhead, the same QoS constraints were implemented on a distributed Ant colony based routing. The traditional Ant routing protocol was improved by adopting the idea of Red-Green-Blue (RGB) pheromones routing to incorporate these QoS constraints. Improvements of 11% load balancing, and 9% security for private data was achieved compared to the conventional Ant routing techniques. In addition, this Ant based
routing was utilised to propose an improved solution for the routing and wavelength assignment problem in the WDM optical computer networks
Intelligent design of optical networks: which topology features help maximise throughput in the nonlinear regime?
The overarching goal in intelligent network design is to deliver capacity when and where it is
needed. The key to this is to understand which network topology characteristics impact the achievable
network throughput. This is explored through the use of a new generative network model, taking into
account physical layer network characteristics
Virtualisation and resource allocation in MECEnabled metro optical networks
The appearance of new network services and the ever-increasing network traffic and number
of connected devices will push the evolution of current communication networks towards the
Future Internet.
In the area of optical networks, wavelength routed optical networks (WRONs) are evolving
to elastic optical networks (EONs) in which, thanks to the use of OFDM or Nyquist WDM,
it is possible to create super-channels with custom-size bandwidth. The basic element in
these networks is the lightpath, i.e., all-optical circuits between two network nodes. The
establishment of lightpaths requires the selection of the route that they will follow and the
portion of the spectrum to be used in order to carry the requested traffic from the source to
the destination node. That problem is known as the routing and spectrum assignment (RSA)
problem, and new algorithms must be proposed to address this design problem.
Some early studies on elastic optical networks studied gridless scenarios, in which a slice
of spectrum of variable size is assigned to a request. However, the most common approach to
the spectrum allocation is to divide the spectrum into slots of fixed width and allocate multiple,
consecutive spectrum slots to each lightpath, depending on the requested bandwidth. Moreover,
EONs also allow the proposal of more flexible routing and spectrum assignment techniques,
like the split-spectrum approach in which the request is divided into multiple "sub-lightpaths".
In this thesis, four RSA algorithms are proposed combining two different levels of
flexibility with the well-known k-shortest paths and first fit heuristics. After comparing the
performance of those methods, a novel spectrum assignment technique, Best Gap, is proposed
to overcome the inefficiencies emerged when combining the first fit heuristic with highly
flexible networks. A simulation study is presented to demonstrate that, thanks to the use of
Best Gap, EONs can exploit the network flexibility and reduce the blocking ratio.
On the other hand, operators must face profound architectural changes to increase the
adaptability and flexibility of networks and ease their management. Thanks to the use of
network function virtualisation (NFV), the necessary network functions that must be applied
to offer a service can be deployed as virtual appliances hosted by commodity servers, which
can be located in data centres, network nodes or even end-user premises. The appearance of
new computation and networking paradigms, like multi-access edge computing (MEC), may
facilitate the adaptation of communication networks to the new demands. Furthermore, the
use of MEC technology will enable the possibility of installing those virtual network functions
(VNFs) not only at data centres (DCs) and central offices (COs), traditional hosts of VFNs, but
also at the edge nodes of the network. Since data processing is performed closer to the enduser,
the latency associated to each service connection request can be reduced. MEC nodes
will be usually connected between them and with the DCs and COs by optical networks.
In such a scenario, deploying a network service requires completing two phases: the
VNF-placement, i.e., deciding the number and location of VNFs, and the VNF-chaining,
i.e., connecting the VNFs that the traffic associated to a service must transverse in order to
establish the connection. In the chaining process, not only the existence of VNFs with available
processing capacity, but the availability of network resources must be taken into account to
avoid the rejection of the connection request. Taking into consideration that the backhaul of
this scenario will be usually based on WRONs or EONs, it is necessary to design the virtual
topology (i.e., the set of lightpaths established in the networks) in order to transport the tra c
from one node to another. The process of designing the virtual topology includes deciding the
number of connections or lightpaths, allocating them a route and spectral resources, and finally
grooming the traffic into the created lightpaths.
Lastly, a failure in the equipment of a node in an NFV environment can cause the
disruption of the SCs traversing the node. This can cause the loss of huge amounts of data
and affect thousands of end-users. In consequence, it is key to provide the network with faultmanagement
techniques able to guarantee the resilience of the established connections when a
node fails.
For the mentioned reasons, it is necessary to design orchestration algorithms which solve
the VNF-placement, chaining and network resource allocation problems in 5G networks
with optical backhaul. Moreover, some versions of those algorithms must also implements
protection techniques to guarantee the resilience system in case of failure.
This thesis makes contribution in that line. Firstly, a genetic algorithm is proposed to solve
the VNF-placement and VNF-chaining problems in a 5G network with optical backhaul based
on star topology: GASM (genetic algorithm for effective service mapping). Then, we propose
a modification of that algorithm in order to be applied to dynamic scenarios in which the
reconfiguration of the planning is allowed. Furthermore, we enhanced the modified algorithm
to include a learning step, with the objective of improving the performance of the algorithm.
In this thesis, we also propose an algorithm to solve not only the VNF-placement and
VNF-chaining problems but also the design of the virtual topology, considering that a WRON
is deployed as the backhaul network connecting MEC nodes and CO. Moreover, a version
including individual VNF protection against node failure has been also proposed and the
effect of using shared/dedicated and end-to-end SC/individual VNF protection schemes are
also analysed.
Finally, a new algorithm that solves the VNF-placement and chaining problems and
the virtual topology design implementing a new chaining technique is also proposed.
Its corresponding versions implementing individual VNF protection are also presented.
Furthermore, since the method works with any type of WDM mesh topologies, a technoeconomic
study is presented to compare the effect of using different network topologies in
both the network performance and cost.Departamento de Teoría de la Señal y Comunicaciones e Ingeniería TelemáticaDoctorado en Tecnologías de la Información y las Telecomunicacione
Investigation of the tolerance of wavelength-routed optical networks to traffic load variations.
This thesis focuses on the performance of circuit-switched wavelength-routed optical network with unpredictable traffic pattern variations. This characteristic of optical networks is termed traffic forecast tolerance. First, the increasing volume and heterogeneous nature of data and voice traffic is discussed. The challenges in designing robust optical networks to handle unpredictable traffic statistics are described. Other work relating to the same research issues are discussed. A general methodology to quantify the traffic forecast tolerance of optical networks is presented. A traffic model is proposed to simulate dynamic, non-uniform loads, and used to test wavelength-routed optical networks considering numerous network topologies. The number of wavelengths required and the effect of the routing and wavelength allocation algorithm are investigated. A new method of quantifying the network tolerance is proposed, based on the calculation of the increase in the standard deviation of the blocking probabilities with increasing traffic load non-uniformity. The performance of different networks are calculated and compared. The relationship between physical features of the network topology and traffic forecast tolerance is investigated. A large number of randomly connected networks with different sizes were assessed. It is shown that the average lightpath length and the number of wavelengths required for full interconnection of the nodes in static operation both exhibit a strong correlation with the network tolerance, regardless of the degree of load non-uniformity. Finally, the impact of wavelength conversion on network tolerance is investigated. Wavelength conversion significantly increases the robustness of optical networks to unpredictable traffic variations. In particular, two sparse wavelength conversion schemes are compared and discussed: distributed wavelength conversion and localized wavelength conversion. It is found that the distributed wavelength conversion scheme outperforms localized wavelength conversion scheme, both with uniform loading and in terms of the network tolerance. The results described in this thesis can be used for the analysis and design of reliable WDM optical networks that are robust to future traffic demand variations
Particle swarm optimization for routing and wavelength assignment in next generation WDM networks.
PhDAll-optical Wave Division Multiplexed (WDM) networking is a promising technology for long-haul backbone and large metropolitan optical networks in order to meet the non-diminishing bandwidth demands of future applications and services. Examples could include archival and recovery of data to/from Storage Area Networks (i.e. for banks), High bandwidth medical imaging (for remote operations), High Definition (HD) digital broadcast and streaming over the Internet, distributed orchestrated computing, and peak-demand short-term connectivity for Access Network providers and wireless network operators for backhaul surges. One desirable feature is fast and automatic provisioning. Connection (lightpath) provisioning in optically switched networks requires both route computation and a single wavelength to be assigned for the lightpath. This is called Routing and Wavelength Assignment (RWA). RWA can be classified as static RWA and dynamic RWA. Static RWA is an NP-hard (non-polynomial time hard) optimisation task. Dynamic RWA is even more challenging as connection requests arrive dynamically, on-the-fly and have random connection holding times. Traditionally, global-optimum mathematical search schemes like integer linear programming and graph colouring are used to find an optimal solution for NP-hard problems. However such schemes become unusable for connection provisioning in a dynamic environment, due to the computational complexity and time required to undertake the search. To perform dynamic provisioning, different heuristic and stochastic techniques are used.
Particle Swarm Optimisation (PSO) is a population-based global optimisation scheme that belongs to the class of evolutionary search algorithms and has successfully been used to solve many NP-hard optimisation problems in both static and dynamic environments. In this thesis, a novel PSO based scheme is proposed to solve the static RWA case, which can achieve optimal/near-optimal solution. In order to reduce the risk of premature convergence of the swarm and to avoid selecting local optima, a search scheme is proposed to solve the static RWA, based on the position of swarm‘s global best particle and personal best position of each particle.
To solve dynamic RWA problem, a PSO based scheme is proposed which can provision a connection within a fraction of a second. This feature is crucial to provisioning services like bandwidth on demand connectivity. To improve the convergence speed of the swarm towards an optimal/near-optimal solution, a novel chaotic factor is introduced into the PSO algorithm, i.e. CPSO, which helps the swarm reach a relatively good solution in fewer iterations. Experimental results for PSO/CPSO based dynamic RWA algorithms show that the proposed schemes perform better compared to other evolutionary techniques like genetic algorithms, ant colony optimization. This is both in terms of quality of solution and computation time. The proposed schemes also show significant improvements in blocking probability performance compared to traditional dynamic RWA schemes like SP-FF and SP-MU algorithms
- …