Online Permutation Routing in Partitioned Optical Passive Star Networks

This paper establishes the state of the art in both deterministic and randomized online permutation routing in the POPS network. Indeed, we show that any permutation can be routed online on a POPS network either with $O(\frac{d}{g}\log g)$ deterministic slots, or, with high probability, with $5c\lceil d/g\rceil+o(d/g)+O(\log\log g)$ randomized slots, where constant $c=\exp (1+e^{-1})\approx 3.927$. When $d=\Theta(g)$, that we claim to be the "interesting" case, the randomized algorithm is exponentially faster than any other algorithm in the literature, both deterministic and randomized ones. This is true in practice as well. Indeed, experiments show that it outperforms its rivals even starting from as small a network as a POPS(2,2), and the gap grows exponentially with the size of the network. We can also show that, under proper hypothesis, no deterministic algorithm can asymptotically match its performance

Efficient restoration of simultaneous transport services within an NFV infrastructure

Proceedings of: IEEE Global Communications Conference (GLOBECOM), 7-11 Dec. 2021, Madrid, Spain.In 5G networks, heterogeneous vertical services with different requirements are rolled out over a common multi-technology infrastructure. A resource orchestrator entity automatically coordinates the operations and functions to support the service's lifecycle management (i.e., creation, update and termination). Moreover, it is essential that service needs are continuously assured even if transport network anomalies (e.g., link failures) occur. Herein, we present an implemented resource orchestrator architecture integrating monitoring capabilities to attain closed-loop operations for: i) gathering monitored information; ii) detecting transport network anomalies; and iii) triggering the required action (e.g., restoration) to keep the service continuity. When a link failure happens, several transport services may be disrupted requiring to be immediately restored. To this end, we propose a novel on-line restoration algorithm called as Global Concurrent Optimization (GCO). The GCO algorithm aims at attaining an enhanced restorability performance compared to a more traditional restoration algorithm (referred to as 1-by-1). Both algorithms are experimentally compared on top of the deployed resource orchestrator architecture. The evaluation is done upon both dynamic service arrival/departure and link failure generation using different performance metrics: the average restorability, the average network resource utilization, and the restoration computational time.Work supported in part by EU Commission H2020 5Growth project (Grant No. 856709), Spanish MICINN AURORAS (RTI2018-099178-B-I00) and Spanish MINECO 5G-REFINE (TEC2017-88373-R) projects and Generalitat de Catalunya grant 2017 SGR 1195

Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System

International audienceMany results exist in the literature describing technological and theoretical advances in optical network topologies and design. However, an essential effort has yet to be done in linking those results together. In this paper, we propose a step in this direction, by giving optical layouts for several graph-theoretical topologies studied in the literature, using the Optical Transpose Interconnection System (OTIS) architecture. These topologies include the family of Partitioned Optical Passive Star (POPS) and stack-Kautz networks as well as a generalization of the Kautz and de Bruijn digraphs

Using Agent Base Models to Optimize Large Scale Network for Large System Inventories

The aim of this paper is to use Agent Base Models (ABM) to optimize large scale network handling capabilities for large system inventories and to implement strategies for the purpose of reducing capital expenses. The models used in this paper either use computational algorithms or procedure implementations developed by Matlab to simulate agent based models in a principal programming language and mathematical theory using clusters, these clusters work as a high performance computational performance to run the program in parallel computational. In both cases, a model is defined as compilation of a set of structures and processes assumed to underlie the behavior of a network system

Lower Bounds for Oblivious Data Structures

An oblivious data structure is a data structure where the memory access patterns reveals no information about the operations performed on it. Such data structures were introduced by Wang et al. [ACM SIGSAC'14] and are intended for situations where one wishes to store the data structure at an untrusted server. One way to obtain an oblivious data structure is simply to run a classic data structure on an oblivious RAM (ORAM). Until very recently, this resulted in an overhead of $\omega(\lg n)$ for the most natural setting of parameters. Moreover, a recent lower bound for ORAMs by Larsen and Nielsen [CRYPTO'18] show that they always incur an overhead of at least $\Omega(\lg n)$ if used in a black box manner. To circumvent the $\omega(\lg n)$ overhead, researchers have instead studied classic data structure problems more directly and have obtained efficient solutions for many such problems such as stacks, queues, deques, priority queues and search trees. However, none of these data structures process operations faster than $\Theta(\lg n)$, leaving open the question of whether even faster solutions exist. In this paper, we rule out this possibility by proving $\Omega(\lg n)$ lower bounds for oblivious stacks, queues, deques, priority queues and search trees.Comment: To appear at SODA'1

Molecular mechanism for bidirectional regulation of CD44 for lipid raft affiliation by palmitoylations and PIP2

The co-localization of Cluster-of-Differentiation-44 protein (CD44) and cytoplasmic adaptors in specific membrane environments is crucial for cell adhesion and migration. The process is controlled by two different pathways: On the one hand palmitoylation keeps CD44 in lipid raft domains and disables the linking to the cytoplasmic adaptor, whereas on the other hand, the presence of phosphatidylinositol-4,5-biphosphate (PIP2) lipids accelerates the formation of the CD44-adaptor complex. The molecular mechanism explaining how CD44 is migrating into and out of the lipid raft domains and its dependence on both palmitoylations and the presence of PIP2 remains, however, elusive. In this study, we performed extensive molecular dynamics simulations to study the raft affinity and translocation of CD44 in phase separated model membranes as well as more realistic plasma membrane environments. We observe a delicate balance between the influence of the palmitoylations and the presence of PIP2 lipids: whereas the palmitoylations of CD44 increases the affinity for raft domains, PIP2 lipids have the opposite effect. Additionally, we studied the association between CD44 and the membrane adaptor FERM in dependence of these factors. We find that the presence of PIP2 lipids allows CD44 and FERM to associate in an experimentally observed binding mode whereas the highly palmitoylated species shows no binding affinity. Together, our results shed light on the sophisticated mechanism on how membrane translocation and peripheral protein association can be controlled by both protein modifications and membrane composition