An Improved Upper Bound for the Ring Loading Problem

The Ring Loading Problem emerged in the 1990s to model an important special case of telecommunication networks (SONET rings) which gained attention from practitioners and theorists alike. Given an undirected cycle on $n$ nodes together with non-negative demands between any pair of nodes, the Ring Loading Problem asks for an unsplittable routing of the demands such that the maximum cumulated demand on any edge is minimized. Let $L$ be the value of such a solution. In the relaxed version of the problem, each demand can be split into two parts where the first part is routed clockwise while the second part is routed counter-clockwise. Denote with $L^*$ the maximum load of a minimum split routing solution. In a landmark paper, Schrijver, Seymour and Winkler [SSW98] showed that $L \leq L^* + 1.5D$, where $D$ is the maximum demand value. They also found (implicitly) an instance of the Ring Loading Problem with $L = L^* + 1.01D$. Recently, Skutella [Sku16] improved these bounds by showing that $L \leq L^* + \frac{19}{14}D$, and there exists an instance with $L = L^* + 1.1D$. We contribute to this line of research by showing that $L \leq L^* + 1.3D$. We also take a first step towards lower and upper bounds for small instances

Metallic tube type energy absorbers: a synopsis

This paper presents an overview of energy absorbers in the form of tubes in which the material used is predominantly mild steel and/or aluminium. A brief summary is also made of frusta type energy absorbers. The common modes of deformation such as lateral and axial compression, indentation and inversion are reviewed. Theoretical, numerical and experimental methods which help to understand the behaviour of such devices under various loading conditions are outlined. Although other forms of energy absorbing materials and structures exist such as composites and honeycombs, this is deemed outside the scope of this review. However, a brief description will be given on these materials. It is hoped that this work will provide a useful platform for researchers and design engineers to gain a useful insight into the progress made over the last few decades in the field of tube type energy absorbers

TOPOLOGICAL PLANNING OF COMMUNICATION NETWORKS

In this paper, we concentrate on topological planning process of large-scale communication networks such as those used by telecom operators. Such networks are usually spread over large geographical area, and finding an optimal topology is very important part of the planning process. Network equipment used in such network is very expensive, and two connection points can be hundreds of kilometers apart. These networks, in most cases, form a backbone network of telecom operator, meaning that majority of traffic is carried through high-speed communication links of such network. Any cable cuts or equipment malfunctions could result in huge data losses. Therefore, such networks require high degree of availability and fault resistance, which must be considered during the planning process. Network topology providing fault resistance should offer at least two separate communication paths between any pair of network nodes. Most important issue in network topology planning is finding topology with lowest possible overall network price, while keeping all requirements (such as fault tolerance, availability, maximal number of hops, maximal blocking probability etc.) satisfied. Network design process can be divided into three stages. First step is making decisions about which network elements (nodes, existing edges) should be included in a backbone network (for instance, one of sub-problems appearing in this phase is facility location problem). Second step includes selection of network topology, so that all elements selected in first step will be interconnected satisfying given requirements. Last phase is used to determine node and link capacities needed for successful traffic transport as well as routings of traffic demands, including protection. Depending on technologies used in network, different routing and protection mechanisms, as well as specific topology models, can be used (e.g. SDH/WDM SHR, mesh, dual-homing etc.)

On-board B-ISDN fast packet switching architectures. Phase 2: Development. Proof-of-concept architecture definition report

For the next-generation packet switched communications satellite system with onboard processing and spot-beam operation, a reliable onboard fast packet switch is essential to route packets from different uplink beams to different downlink beams. The rapid emergence of point-to-point services such as video distribution, and the large demand for video conference, distributed data processing, and network management makes the multicast function essential to a fast packet switch (FPS). The satellite's inherent broadcast features gives the satellite network an advantage over the terrestrial network in providing multicast services. This report evaluates alternate multicast FPS architectures for onboard baseband switching applications and selects a candidate for subsequent breadboard development. Architecture evaluation and selection will be based on the study performed in phase 1, 'Onboard B-ISDN Fast Packet Switching Architectures', and other switch architectures which have become commercially available as large scale integration (LSI) devices

Optimization in Telecommunication Networks

Network design and network synthesis have been the classical optimization problems intelecommunication for a long time. In the recent past, there have been many technologicaldevelopments such as digitization of information, optical networks, internet, and wirelessnetworks. These developments have led to a series of new optimization problems. Thismanuscript gives an overview of the developments in solving both classical and moderntelecom optimization problems.We start with a short historical overview of the technological developments. Then,the classical (still actual) network design and synthesis problems are described with anemphasis on the latest developments on modelling and solving them. Classical results suchas Menger’s disjoint paths theorem, and Ford-Fulkerson’s max-flow-min-cut theorem, butalso Gomory-Hu trees and the Okamura-Seymour cut-condition, will be related to themodels described. Finally, we describe recent optimization problems such as routing andwavelength assignment, and grooming in optical networks.operations research and management science;

Ono: an open platform for social robotics

In recent times, the focal point of research in robotics has shifted from industrial ro- bots toward robots that interact with humans in an intuitive and safe manner. This evolution has resulted in the subfield of social robotics, which pertains to robots that function in a human environment and that can communicate with humans in an int- uitive way, e.g. with facial expressions. Social robots have the potential to impact many different aspects of our lives, but one particularly promising application is the use of robots in therapy, such as the treatment of children with autism. Unfortunately, many of the existing social robots are neither suited for practical use in therapy nor for large scale studies, mainly because they are expensive, one-of-a-kind robots that are hard to modify to suit a specific need. We created Ono, a social robotics platform, to tackle these issues. Ono is composed entirely from off-the-shelf components and cheap materials, and can be built at a local FabLab at the fraction of the cost of other robots. Ono is also entirely open source and the modular design further encourages modification and reuse of parts of the platform