Stochastische Analyse und lernbasierte Algorithmen zur Ressourcenbereitstellung in optischen Netzwerken

The unprecedented growth in Internet traffic has driven the innovations in provisioning of optical resources as per the need of bandwidth demands such that the resource utilization and spectrum efficiency could be maximized. With the advent of the next generation flexible optical transponders and switches, the flexible-grid-based elastic optical network (EON) is foreseen as an alternative to the widely deployed fixed-grid-based wavelength division multiplexing networks. At the same time, the flexible resource provisioning also raises new challenges for EONs. One such challenge is the spectrum fragmentation. As network traffic varies over time, spectrum gets fragmented due to the setting up and tearing down of non-uniform bandwidth requests over aligned (i.e., continuous) and adjacent (i.e., contiguous) spectrum slices, which leads to a non-optimal spectrum allocation, and generally results in higher blocking probability and lower spectrum utilization in EONs. To address this issue, the allocation and reallocation of optical resources are required to be modeled accurately, and managed efficiently and intelligently. The modeling of routing and spectrum allocation in EONs with the spectrum contiguity and spectrum continuity constraints is well-investigated, but existing models do not consider the fragmentation issue resulted by these constraints and non-uniform bandwidth demands. This thesis addresses this issue and considers both the constraints to computing exact blocking probabilities in EONs with and without spectrum conversion, and with spectrum reallocation (known as defragmentation) for the first time using the Markovian approach. As the exact network models are not scalable with respect to the network size and capacity, this thesis proposes load-independent and load-dependent approximate models to compute approximate blocking probabilities in EONs. Results show that the connection blocking due to fragmentation can be reduced by using a spectrum conversion or a defragmentation approach, but it can not be eliminated in a mesh network topology. This thesis also deals with the important network resource provisioning task in EONs. To this end, it first presents algorithmic solutions to efficiently allocate and reallocate spectrum resources using the fragmentation factor along spectral, time, and spatial dimensions. Furthermore, this thesis highlights the role of machine learning techniques in alleviating issues in static provisioning of optical resources, and presents two use-cases: handling time-varying traffic in optical data center networks, and reducing energy consumption and allocating spectrum proportionately to traffic classes in fiber-wireless networks.Die flexible Nutzung des Spektrums bringt in Elastischen Optischen Netze (EON) neue Herausforderungen mit sich, z.B., die Fragmentierung des Spektrums. Die Fragmentierung entsteht dadurch, dass die Netzwerkverkehrslast sich im Laufe der Zeit ändert und so wird das Spektrum aufgrund des Verbindungsaufbaus und -abbaus fragmentiert. Das für eine Verbindung notwendige Spektrum wird durch aufeinander folgende (kontinuierliche) und benachbarte (zusammenhängende) Spektrumsabschnitte (Slots) gebildet. Dies führt nach den zahlreichen Reservierungen und Freisetzungen des Spektrums zu einer nicht optimalen Zuordnung, die in einer höheren Blockierungs-wahrscheinlichkeit der neuen Verbindungsanfragen und einer geringeren Auslastung von EONs resultiert. Um dieses Problem zu lösen, müssen die Zuweisung und Neuzuordnung des Spektrums in EONs genau modelliert und effizient sowie intelligent verwaltet werden. Diese Arbeit beschäftigt sich mit dem Fragmentierungsproblem und berücksichtigt dabei die beiden Einschränkungen: Kontiguität und Kontinuität. Unter diesen Annahmen wurden analytische Modelle zur Berechnung einer exakten Blockierungswahrscheinlichkeit in EONs mit und ohne Spektrumskonvertierung erarbeitet. Außerdem umfasst diese Arbeit eine Analyse der Blockierungswahrscheinlichkeit im Falle einer Neuzuordnung des Sprektrums (Defragmentierung). Diese Blockierungsanalyse wird zum ersten Mal mit Hilfe der Markov-Modelle durchgeführt. Da die exakten analytischen Modelle hinsichtlich der Netzwerkgröße und -kapazität nicht skalierbar sind, werden in dieser Dissertation verkehrslastunabhängige und verkehrslastabhängige Approximationsmodelle vorgestellt. Diese Modelle bieten eine Näherung der Blockierungswahrscheinlichkeiten in EONs. Die Ergebnisse zeigen, dass die Blockierungswahrscheinlichkeit einer Verbindung aufgrund von einer Fragmentierung des Spektrums durch die Verwendung einer Spektrumkonvertierung oder eines Defragmentierungsverfahrens verringert werden kann. Eine effiziente Bereitstellung der optischen Netzwerkressourcen ist eine wichtige Aufgabe von EONs. Deswegen befasst sich diese Arbeit mit algorithmischen Lösungen, die Spektrumressource mithilfe des Fragmentierungsfaktors von Spektral-, Zeit- und räumlichen Dimension effizient zuweisen und neu zuordnen. Darüber hinaus wird die Rolle des maschinellen Lernens (ML) für eine verbesserte Bereitstellung der optischen Ressourcen untersucht und das ML basierte Verfahren mit der statischen Ressourcenzuweisung verglichen. Dabei werden zwei Anwendungsbeispiele vorgestellt und analysiert: der Umgang mit einer zeitveränderlichen Verkehrslast in optischen Rechenzentrumsnetzen, und eine Verringerung des Energieverbrauchs und die Zuweisung des Spektrums proportional zu Verkehrsklassen in kombinierten Glasfaser-Funknetzwerken

Differentiable Algorithm Networks for Composable Robot Learning

This paper introduces the Differentiable Algorithm Network (DAN), a composable architecture for robot learning systems. A DAN is composed of neural network modules, each encoding a differentiable robot algorithm and an associated model; and it is trained end-to-end from data. DAN combines the strengths of model-driven modular system design and data-driven end-to-end learning. The algorithms and models act as structural assumptions to reduce the data requirements for learning; end-to-end learning allows the modules to adapt to one another and compensate for imperfect models and algorithms, in order to achieve the best overall system performance. We illustrate the DAN methodology through a case study on a simulated robot system, which learns to navigate in complex 3-D environments with only local visual observations and an image of a partially correct 2-D floor map.Comment: RSS 2019 camera ready. Video is available at https://youtu.be/4jcYlTSJF4

A Clustered Overflow Configuration of Inpatient Beds in Hospitals

Problem Definition: The shortage of inpatient beds is a major cause of delays and cancellations in many hospitals. It may also lead to patients being admitted to inappropriate wards, whereby resulting in a lower quality of care and a longer length of stay. Academic/Practical Relevance: Investment in additional beds is not always feasible. Instead, new and creative solutions for a more efficient use of existing resources must be sought. Methodology: We propose a new configuration of inpatient beds which we call the clustered overflow configuration. In this configuration, patients who are denied admission to their primary wards as a result of beds being fully occupied are admitted to overflow wards, with each designated to serve overflows from a certain subset of specialties and providing the same quality of care as in primary wards. We propose two different formulations for partitioning and bed allocation in the proposed configuration: one minimizing the sum of average daily costs of turning patients away and nursing teams, and another minimizing the numbers turned away subject to nursing cost falling below a given threshold. We heuristically solve instances from both formulations. Results: Applying the models to real data shows that the configurations obtained from our models compare very well with the other configurations proposed in the literature, provided that patients' willingness to wait is relatively short. Managerial Implications: The proposed configuration provides the combined advantages of the dedicated configuration, wherein patients are only admitted to their primary wards, and the exible configuration, in which all specialties share a single ward. On the other hand, it restricts the adverse impacts of pooling and minimizes cross-training costs through appropriate partitioning and bed allocation. As such, it serves as a viable alternative to existing inpatient configurations

Representative queueing network models of computer systems in terms of time delay probability distributions

Imperial Users onl

Semiparametric Bayesian inference in smooth coefficient models

We describe procedures for Bayesian estimation and testing in cross-sectional, panel data and nonlinear smooth coefficient models. The smooth coefficient model is a generalization of the partially linear or additive model wherein coefficients on linear explanatory variables are treated as unknown functions of an observable covariate. In the approach we describe, points on the regression lines are regarded as unknown parameters and priors are placed on differences between adjacent points to introduce the potential for smoothing the curves. The algorithms we describe are quite simple to implement - for example, estimation, testing and smoothing parameter selection can be carried out analytically in the cross-sectional smooth coefficient model. We apply our methods using data from the National Longitudinal Survey of Youth (NLSY). Using the NLSY data we first explore the relationship between ability and log wages and flexibly model how returns to schooling vary with measured cognitive ability. We also examine a model of female labor supply and use this example to illustrate how the described techniques can been applied in nonlinear settings

Irreversible cooperative processes on lattices

Kinetic models for irreversible cooperative processes on lattices are developed. Hierarchial rate equations for the probabilities of configurations of empty sites are discussed in detail and the concept of shielding is introduced. Several, exactly soluble, one-dimensional processes are treated including (1) those incorporating a cooperative range of influence of one lattice vector beyond a fixed number of blocking sites, (2) filling in stages for highly repulsive interactions, (3) correlation functions, (4) configurational entropy of ring lattices, (5) processes with competing events, (6) periodic lattices and (7) limited mobility. Approximate solution techniques for analyzing other one-dimensional processes are also discussed;A special irreversible kinetic process on a two-dimensional square lattice is also treated and a computer program is described which has been developed to generate the appropriate two-dimensional kinetic equations. The resultant equations are treated using various factorization/truncation schemes;A method is given to determine rate constants for irreversible polymer reactions from experimental measurements of the fraction of converted sites with time. Other aspects of irreversible polymer reactions are also treated;The chemisorption of nitrogen onto the (100) face of tungsten is discussed as an example of how irreversibility influences surface processes;A short discussion of irreversible three-dimensional processesin crystalline solids concludes the work;*DOE Report IS-T-1035. This work was performed under ContractW-7405-eng-82 with the Department of Energy