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

/pdf/sndlib-1-0-survivable-network-design-library-20x8gxsidg.pdf

SNDlib 1.0—Survivable Network Design Library

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

SNDlib 1.0 - survivable network design library

The traffic to be carried by today's European backbone networks increases very rapidly. An important portion of this traffic consists of data traffic (mainly IP-related). In the future data traffic is expected to become the abundantly dominant traffic type, while voice traffic will only account for a very small portion of the total traffic volume. In this paper, some network topologies for such a pan-European fiber-optic backbone network are presented (more details can be found in [1]). These topologies are compared in terms of the efficiency of the network design both from a cost and capacity point of view and in terms of the availability of the connections routed over this network. In order to be able to assess the network topologies under realistic circumstances, the expected traffic demand is forecasted. This enables to make the comparison for the current traffic volume as well as for the traffic patterns of the future. As not all types of (data) traffic require the same degree of survivability and in order to leverage the total capacity cost of the network design, a distinction is made between different recovery options in the optical layer for the different traffic types considered.

Pan-European optical transport networks: An availability-based comparison

OpenFlow: Meeting carrier-grade recovery requirements

Probabilistic Reliability: an Engineering Approach

This paper reports the main results obtained in the framework of the COST239 project on the implementation of transparent optical network schemes to connect main European cities. The investigation on transmission limitations has shown that transmission systems, for which 1662:5 Gbit/s WDM systems are used due to traf®c reasons, have a maximum range shorter than 1000 km. This condition does not allow a completely transparent network. Two solutions, the partitioned and the gridconnected network architecture, are proposed, described, and compared in the paper.

Study on the Implementation of Optical Transparent Transport Networks in the European Environment—Results of the Research Project COST 239

The paper presents an application of genetic algorithms to wavelength assignment in all-optical networks with wavelength division multiplexing (WDM). Two approaches, the shortest path routing and optimized routing are considered. The assignment results for a case study, a core part of the European Optical Network, are presented.

A heuristic approach to wavelength assignment in all-optical networks

Network resource management is one of the most important issues in any communication network and this is also the case for optical networks with burst switching (OBS - Optical Burst Switching). Efficient management system can improve network performances in great deal. By the term managing system, we mean algorithms and procedures that are preformed in network nodes and are responsible for scheduling packets on the right outgoing link on their way to the destination. In OBS networks these algorithms are more important than in other networks due to the one way reservation policy. In the article we investigate in more details various algorithms, and present new burst scheduling algorithm. Also, we investigate behavior of these algorithms for different scales of network loads.

A Comparative Analysis of Data Scheduling Algorithms in Optical Burst Switching Networks

Network resource management is important issue in any communication network and, as a consequence, in our case study of optical networks with burst switching (OBS - Optical Burst Switching). Efficient management system can improve network performances in great deal. By the term managing system, we mean algorithms and procedures that are preformed in network nodes responsible for scheduling packets on the appropriate outgoing link on their way to the destination. In OBS networks these algorithms have high importance due to the one way reservation policy which doesn't implements burst loss notification mechanism. In the paper we analyze in detail existing scheduling algorithms and present a new burst scheduling algorithm (BFUC - Best Fit Unscheduled Channel). Also, we analyze behavior of the algorithms for different scales of network loads. Index Terms—OBS, Data Channel Scheduling Algorithms (DCS), FFUC, LAUC, LAUC-VF BFUC.

http://ieeexplore.ieee.org/iel5/9770/30813/01427032.pdf

R. Inkret

Papers

Pan-European optical transport networks: An availability-based comparison

Study on the Implementation of Optical Transparent Transport Networks in the European Environment—Results of the Research Project COST 239

A heuristic approach to wavelength assignment in all-optical networks

A Comparative Analysis of Data Scheduling Algorithms in Optical Burst Switching Networks

A comparative analysis of data scheduling algorithms in optical burst switching networks