Abstract This article describes the Survivable Network Design Library (SNDlib), a data library for fixed telecommunication network design available at http://sndlib.zib.de . In current version 1.0, contains related to 22 networks which, combined with set of selected planning parameters, leads 830 problem instances. this article, we discuss concepts SNDlib and describe mathematical model each considered in library. We also provide information on characteristic features origin © 2009 Wiley...

Optimization models related to designing and operating complex systems are mainly focused on some efficiency metrics such as response time, queue length, throughput, cost. However, in which serve many entities there is also a need for respecting fairness: each system entity ought be provided with an adequate share of the system’s services. Still, due operations-dependant constraints, fair treatment does not directly imply that them assigned equal amount That leads concepts optimization...

Free Space Optical (FSO) communication is a quickly developing technology that designed to handle high data rates while maintaining good quality factor (Q-factor). Many novel techniques have been implemented cope with atmospheric attenuating factors, such as fog and rain. Here, we introduced circular polarization shift keying (C-PolSK) modulation produce stable uniform light beam. The plane of polarized keeps rotating along the propagation vector, which helps reduce phase variations...

Telecommunications networks are facing increasing demand for Internet services. Therefore, the problem of telecommunications network design with objective to maximize service data flows and provide fair treatment all services is very up-to-date. In this application, so-called maxmin (MMF) solution concept widely used formulate resource allocation scheme. It assumes that worst performance maximized additionally regularized lexicographic maximization second performance, third one, etc. paper...

Abstract In this article we prove 𝒩𝒫‐hardness of two well‐known optimization problems related to the design multicommodity flow networks with different methods for providing network resiliency against failures: path diversity and restoration. Path is a static mechanism that consists using, each demand, number paths oversizing flows assigned these so any failure total surviving not less than volume demand. By contrast, restoration dynamic reassigning failed backup when occurs. Both mechanisms...

We present an optimization platform for Fiber-to-the-Home network design. The is capable of minimizing the capital expenditures (CAPEX) deployment by optimizing locations optical equipment, signal splitters and cable cabinets, routes types cables as well number cards splitters. architecture platform, design process it implements, algorithms deploys. used to indicate parts that require complex with dedicated those can be left appropriately crafted engineering rules. while keeping computation...

Abstract An iterative algorithm of polynomial complexity is presented that solves a max‐min fairness problem which often encountered while dealing with traffic routing or capacity allocation problems. The does not depend on any specific formulation and sufficiently general to be applied broad class correctness the its are formally proved. Copyright © 2005 AEIT.

Abstract One of the major challenges in managing 5G networks is reconfiguration network slices. The task covers particular and relocation virtual functions (VNFs) so as to match service requirements slices availability resources data centers. In this article, we study deep problem optimal VNFs analyzing a number its variants. We define two exact, compact integer linear programming formulations problem, derive approximate solution algorithms, one them based on column generation method....

Primary and backup paths in MPLS fast reroute (FRR) may be established as shortest according to the administrative link costs of IP control plane, or explicitly calculated arbitrary paths. In both cases, path layout can optimized so that maximum utilization for a set considered failure scenarios is minimized. this paper, we propose linear program optimization paths, which either produce single route entire traffic along those generate multiple spread among providing load balancing. We...

We consider a network security and configuration management problem of locating service controllers so as to maximize availability services in case targeted attacks on the infrastructure. Assuming that attacker has full knowledge topology but can only try predict controller locations, we model attacker's behavior introducing set probabilistic measures formulating an optimization determines potentially most dangerous might launch. also formulate counter-part allows operator derive optimal...

In this paper we address the problem of routing optimization in IP networks. We assume that traffic is routed along shortest paths computed with respect to administrative link metrics. Metrics are distributed a network by open path first (OSPF) or similar protocol. If it happens not unique then equal-cost multi-path (ECMP) load balancing principle applied. It means demand destined specific node split among all node. The considered here determine shortest-path pattern satisfying demands, and...

We consider the problem of cooperative distributed routing optimization in multi-domain/multi-provider networks. The main object our investigation are ASON/G-MPLS transport networks, still results investigations could be extended to any multi-domain network where particular domains have limited mutual visibility intra-domain resources. This paper refines a decomposition mechanism for reliable flow reservation levels introduced, by considering fundamental issue fair income distribution....

The presented work is motivated by Free Space Optics (FSO) communications. FSO a well established wireless optical transmission technology considered as an alternative to radio communications for example in metropolitan mesh networks. An link means of laser beam between the transmitter and receiver placed line sight. A major disadvantage links (with respect fiber links) their sensitivity weather conditions such fog, rain snow, causing substantial loss power over channel due mostly absorption...

Abstract In this article, we revisit a classical optimization problem occurring in designing survivable multicommodity flow networks. The problem, referred to as FR, assumes restoration that takes advantage of the so‐called stub release. As no compact linear programming (LP) formulation FR is known and at same time all noncompact LP formulations exhibit \documentclass{article}\usepackage{mathrsfs}\usepackage{amsmath}\pagestyle{empty}\begin{document}\begin{align*}\mathcal{NP}\end{align*}...

The paper considers multi-hop wireless mesh networks that serve multicast periodic packet traffic. packets from each stream are generated at the stream's source node and traverse a number of nodes in order to reach their multiple destination nodes. Packet periodicity means common repeatable frame time slots is defined be transmitted arrive beginning consecutive frame. novel element by simultaneously received listening particular problem dealt with consists minimization length (which...

Abstract Flow thinning (FT) is a traffic protection mechanism for communication networks with variable link capacities, example wireless networks. With FT, end‐to‐end demands use dedicated logical tunnels, MPLS whose nominal capacity subject to in order follow fluctuations capacities availability. Moreover, instantaneous of each demand throttled at its originating node accordingly the current total available on demand's tunnels so that network always capable carrying admitted traffic. In...

Realizing node-to-node connections is a basic functionality of communication networks. In some networks, like SDN, to perform this function nodes must have access controllers – the devices (installed in selected node locations) necessary process setting-up connections. Hence, case an attack on set nodes, not only directly attacked are eliminated from service, but also that loose connection with located at unaffected nodes). order increase network resilience against node-targeted attacks,...

Abstract Path restoration (PR) is one of the basic mechanisms for securing telecommunication networks against failures. In paper, we discuss complexity certain variants a multi‐commodity flow network optimisation problem in directed graphs related to state‐independent path mechanisms. We demonstrate that most considered are $\cal{NP}$ ‐hard. Depending on variant, show how can be reduced either from partition or finding an arc‐disjoint pair paths connect two distinct pairs nodes. also at same...