Optical Switching and Networking最新文献

Space-division multiplexing (SDM) is regarded as one of the most promising technologies to satisfy the explosively growing internet traffic. Elastic optical networks with SDM is one of the newest network architectures for network planning in the future. However, the resource allocation problem in these networks becomes more complicated due to the expansion of spatial dimensions. In this paper, we propose a novel channel-based integer linear programming (ILP) model for the problem of routing, space, and spectrum assignment (RSSA) in consideration of space lane change in SDM-EON. To evaluate our model, we make a comparison with the slot-based model [15] via simulation experiments. Different spatial switching granularities are considered in our performance evaluation because they will greatly change the detailed results of allocation. By the numerical results, we find that our novel model has an overwhelming advantage over the previous slot-based one in computing time for the optimization process.

Inter-core crosstalk causes severe signal impairment in Space Division Multiplexing Elastic Optical Networks (SDM-EON) with multi-core fibre (MCF). In order to mitigate the influence of crosstalk between cores, bidirectional MCF is used. SDM-EON has dramatically increased the network bandwidth and is the mainstream trend of future communications, but the overall cost of such an SDM-EON will increase with traditional hard-connected node structures. On-demand architecture node (AoD) in SDM-EON can dynamically select modes based on incoming services with less cost than traditional node. Although bidirectional multi-core optical fibres can mitigate the impact of crosstalk between adjacent cores, it is still necessary to develop appropriate routing, spectrum, and core assignment strategies to reduce the impact of crosstalk. In addition, the resource allocation strategy will affect the type of on-demand architecture node. This paper develops a core selection method for classified services on a multi-dimensional optical network with bidirectional multi-core fibres. It also proposes an on-demand architecture node suitable for this services classification scheme. According to the proposed core classification method, a routing and resource allocation algorithm that considers the impact of spectrum fragmentation and crosstalk between cores is proposed. The final simulation results prove that the algorithm is beneficial to improve network performance.

The Internet is a collection of interconnected Autonomous Systems (ASes) that use the Border Gateway Protocol (BGP) to exchange reachability information. In this regard, BGP stability and scalability in the inter-domain scope have been matters of major concern for many years, and network engineers have been applying several techniques to cope with these issues. BGP is also used intra-domain (internal BGP - iBGP), to disseminate reachability information inside each AS, and works together with the Interior Gateway Protocols (IGPs) such as OSPF or IS-IS, to build routing tables. Route reflection is a widely adopted technique to tackle BGP scalability in the intra-domain scope, and choosing which routers will play the reflector role and which BGP sessions will be established among reflectors and clients (i.e. the routers which are not elected as reflectors), building an overlay of iBGP sessions, is known as the iBGP overlay design problem. The design of an optimal iBGP overlay is known to be a NP-Hard problem, and we proposed solutions for pure IP networks (i.e. best effort traffic forwarding) in our previous work. However, most Internet providers implement their backbones by combining IP routing with MPLS (Multiprotocol Label Switching) for QoS-aware traffic forwarding. MPLS forwarding incorporates traffic engineering and more efficient failover mechanisms; under this traffic forwarding paradigm, the design of traffic-engineered Label Switched Paths (LSPs, also referred as MPLS tunnels) shall be combined with the aforementioned iBGP overlay design. The present work introduces a coordinated design of both the iBGP overlay and the IP/MPLS substrates. Our contribution is the proposal of an optimal and resilient topology design for an IP/MPLS Internet backbone, which takes advantage of traffic engineering features to optimize the demands, while guaranteeing iBGP overlay optimality. We present a complete solution for a real world scenario, and we study the scalability of the solution for synthetic topologies, achieving encouraging results.

This work considers the joint problem of securing confidential demands against eavesdropping attacks and protecting the network against link failures in elastic optical networks (EONs). Network coding is used to provide security for confidential connections by encrypting the data through XOR operations at the physical layer with other established connections in the network. Backup paths are also computed for protecting the primary path of the confidential connections, while ensuring that the level of security for the confidential demands is preserved in case of a link failure on the primary path or on any of the paths involved in the XOR process. A realistic network scenario is modeled, where four different classes of connections are considered with respect to their protection and security requirements, while a combination of novel integer linear programming (ILP) and heuristic algorithms are used to establish each class of demands in the network. The proposed algorithms are evaluated in terms of spectrum utilization, network blocking, and level of security provided. From the results obtained it is evident that confidential connections can be transmitted in a secure manner, while for the classes that require both security and protection, the connections retain their required level of security in the event of any single link failure in the network.

For several decades, optical networks, due to their high capacity and long-distance transmission range, have been used as the major communication technology to serve network traffic, especially in the core and metro segments of communication networks. Unfortunately, our society has often experienced how the correct functioning of these critical infrastructures can be substantially hindered by massive failures triggered by natural disasters, weather-related disruptions and malicious human activities.

In this position paper, we discuss the impact on optical networks of all major classes of disaster events mentioned above, and we overview recent relevant techniques that have been proposed to increase the disaster resilience of optical networks against the various classes of disaster events. We start by presenting some proactive methods to be applied before the occurrence of a disaster. Then we move our focus also on other preparedness methods that can be executed in the (typically short) time frame between the occurrence of an early alert of an incoming disaster and the time a disaster actually hits the network. Finally, we discuss reactive procedures that allow performing post-disaster recovery operations effectively. The analysis of disaster resilience mechanisms provided in this paper covers both wired and optical wireless communication infrastructures and also contains explicit remarks covering the role of emerging technologies (e.g., fixed-mobile convergence in the 5G era and beyond) in disaster resilience.

This work deals with dimensioning of wireless mesh networks (WMN) composed of FSO (free space optics) links. Although FSO links realize broadband transmission at low cost, their drawback is sensitivity to adverse weather conditions causing transmission degradation on multiple links. Hence, designing such FSO networks requires an optimization model to find the cheapest configuration of link capacities that will be able to carry an acceptable level of the demanded traffic in all weather states that can be foreseen in network operation. Such a model can be achieved using robust optimization techniques, and for that it is important to find a tractable way of characterizing possible link (capacity) degradation states corresponding to weather conditions not known in advance. In the paper we show how the set of link degradation states may be represented mathematically in a compact and tractable way to be exploited in optimization. To solve this task we will make use of a generalization of a combinatorial problem of finding a minimum hitting set to deduce a compact set approximating a given set of link degradation states, (called uncertainty set). Finally, we provide a mathematical model with respect to a general form of uncertainty sets and illustrate the effectiveness of our model by means of a numerical study.

In this paper, we propose the design of a survivable energy-efficient and crosstalk-aware routing, spectrum, and core allocation (RSCA) scheme for online multiclass traffic in both spectral and temporal domains in SDM-EON. Multipath based protection scheme is applied to ensure survivability against single link failure. Advanced reservation (AR) connections being a part of multiclass traffic may withstand some delay in its service from its arrival. Six heuristic algorithms are developed by using three resource allocation schemes associated with both core-classified and non-core classified approaches which are presented in this paper. Extensive simulation experiments are conducted using three well-known network topologies and the performances of the heuristics are evaluated in terms of bandwidth blocking ratio, total energy consumption, and resource occupation rate versus traffic load as well as percentage of AR connections in multiclass traffic.

In Software-Defined Networking (SDN), the control and data planes are decoupled, leading to a more programmable and efficient network management. In this paper, the controller placement problem in SDN is addressed, jointly with the problem of exploring a high-availability tree subgraph, in order to support delay and availability requirements between the switches and the controllers. We consider that each switch connects to a primary and to a backup controller. We formulate the joint optimization model as an integer linear programming model (ILP), and propose a heuristic method when the exact model becomes impractical. Furthermore, we compare two ILP formulations, and we also compare the controller redundancy solutions with those considering path redundancy alone.

We propose, and experimentally demonstrate, an SDN (Software Defined Networking) new management solution for legacy GPONs (Gigabit Passive Optical Networks), which allows users to dynamically control their residential networks by means of a management application. In this way, users can customize the allocation of resources (and set constraints, if desired) to connected devices in their residential network, fast and efficiently. This real-time customization enables new business models for network operators and service providers. As a proof of concept and to validate the management solution, we demonstrate, in a testbed environment, the operation of a dynamic network scenario where an operator has a business model in which users have a contracted basic bandwidth, but they are allowed to increase it temporarily when using highly demanding services.

The interdependence between communication networks, e.g., an optical backbone network, and power grids is a critical issue to take into account when designing and operating both systems. In fact, failures in one network may cause further failures in the other network and vice versa. This is because nodes in power grids (i.e., power generators, loads or interchange nodes) are controlled and managed by telecommunication equipment, which, in turn, rely on the electricity grid for their power supply. Therefore, failures occurring on a limited portion of one network can cascade multiple times between these two networks, and a robust “interdependency network” (i.e., consisting of the interconnections between nodes in the two networks) is needed. This paper investigates the problem of designing a resilient interconnection against interdependent cascading-failures in interdependent power grid - optical networks. We formalize, using an Integer Linear Program, the new problem of Power Grid - Optical Network Interconnection (PGON-I), which consists in designing an interconnection between the power grid and the optical network that is resilient to cascading failures, i.e., avoids/reduces cascade. For this problem, we derive analytically upper and lower bounds on the number of interconnection links which ensure resilience against cascading failures initiated from a single node-failure. Starting from the analytical model, we develop a heuristic algorithm to solve large instances of the problem. Our results show that the higher the difference between the number of nodes in the two networks, the more interconnection links are needed to ensure resilience against failures cascade.