1,016 research outputs found
Power consumption evaluation of circuit-switched versus packet-switched optical backbone networks
While telecommunication networks have historically been dominated by a circuit-switched paradigm, the last decades have seen a clear trend towards packet-switched networks. In this paper we evaluate how both paradigms perform in optical backbone networks from a power consumption point of view, and whether the general agreement of circuit switching being more power-efficient holds. We consider artificially generated topologies of various sizes, mesh degrees and not yet previously explored in this context transport linerates. We cross-validate our findings with a number of realistic topologies. Our results show that, as a generalization, packet switching can become preferable when the traffic demands are lower than half the transport linerate. We find that an increase in the network node count does not consistently increase the energy savings of circuit switching over packet switching, but is heavily influenced by the mesh degree and (to a minor extent) by the average link length
A segmentation method for shared protection in WDM networks
Shared link and shared path protections have been recognized as preferred schemes to protect traffic flows against network failures. In recent years, another method referred to as Shared Segment Protection has been studied as an alternative solution for protection. This method is more flexible and efficient in terms of capacity utilization and restoration time. However, to our best knowledge, this method has mostly been studied in dynamic provisioning scenarios in which searching for restoration paths is dynamically performed after a failure has occurred. In this paper, based on the path segmentation idea, we propose a method to generate good candidate routes for traffic demands in static provisioning. These candidates are used as input parameters of an Integer Linear Programming (ILP) model for shared backup protection. Numerical results show that the capacity efficiency resulting from these candidates is much better than the best known Shared Backup Path Protection (SBPP) schemes. In addition, although the restoration time of our scheme is a little bit longer than those implementing link protection, it is still faster than path protection schemes
Restoration in multi-domain GMPLS-based networks
In this paper, we evaluate the efficiency of using restoration mechanisms in a dynamic multi-domain GMPLS network. Major challenges and solutions are introduced and two well-known restoration schemes (End-to-End and Local-to-End) are evaluated. Additionally, new restoration mechanisms are introduced: one based on the position of a failed link, called Location-Based, and another based on minimizing the additional resources consumed during restoration, called Shortest-New. A complete set of simulations in different network scenarios show where each mechanism is more efficient in terms, such as, resource overbuild or recovery delayPart of this work was supported by the Government of Catalonia (DURSI SGR-1202), and by the Spanish Science and Innovation Ministry (TRION TEC2009-10724
SPAD: a distributed middleware architecture for QoS enhanced alternate path discovery
In the next generation Internet, the network will evolve from a plain communication medium into one that provides endless services to the users. These services will be composed of multiple cooperative distributed application elements. We name these services overlay applications. The cooperative application elements within an overlay application will build a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS experienced on the communication paths of the corresponding overlay association. In this paper, we present SPAD (Super-Peer Alternate path Discovery), a distributed middleware architecture that aims at providing enhanced QoS between end-points within an overlay association. To achieve this goal, SPAD provides a complete scheme to discover and utilize composite alternate end-to end paths with better QoS than the path given by the default IP routing mechanisms
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
Genetic algorithm for holistic VNF-mapping and virtual topology design
Producción CientíficaNext generation of Internet of Things (IoT) services imposes stringent requirements to the future networks that current ones cannot fulfill. 5G is a technology born to give response to those requirements. However, the deployment of 5G is also accompanied by profound architectural changes in the network, including the introduction of technologies like multi-access edge computing (MEC), software defined networking (SDN), and network function virtualization (NFV). In particular, NFV poses diverse challenges like virtual network function (VNF) placement and chaining, also called VNF-mapping. In this paper, we present an algorithm that solves VNF-placement and chaining in a metro WDM optical network equipped with MEC resources. Therefore, it solves the VNF-mapping in conjunction with the virtual topology design of the underlying optical backhaul network. Moreover, a version of the method providing protection against node failures is also presented. A simulation study is presented to show the importance of designing the three problems jointly, in contrast to other proposals of the literature that do not take the design of the underlying network into consideration when solving that problem. Furthermore, this paper also shows the advantages of using collaboration between MEC nodes to solve the VNF-mapping problem and the advantage of using shared protection schemes. The new algorithm outperforms other proposals in terms of both service blocking ratio, and number of active CPUs (thus reducing energy consumption). Finally, the impact of deploying different physical topologies for the optical backhaul network is also presented.Ministerio de Economía, Industria y Competitividad (grant TEC2017-84423-C3-1-P)Ministerio de Industria, Comercio y Turismo (grant BES 2015-074514)Spanish Thematic Network (contract RED2018-102585-T)INTERREG V-A España-Portugal (POCTEP) program (project 0677_DISRUPTIVE_2_E
- …