13,577 research outputs found
Automated Network Service Scaling in NFV: Concepts, Mechanisms and Scaling Workflow
Next-generation systems are anticipated to be digital platforms supporting
innovative services with rapidly changing traffic patterns. To cope with this
dynamicity in a cost-efficient manner, operators need advanced service
management capabilities such as those provided by NFV. NFV enables operators to
scale network services with higher granularity and agility than today. For this
end, automation is key. In search of this automation, the European
Telecommunications Standards Institute (ETSI) has defined a reference NFV
framework that make use of model-driven templates called Network Service
Descriptors (NSDs) to operate network services through their lifecycle. For the
scaling operation, an NSD defines a discrete set of instantiation levels among
which a network service instance can be resized throughout its lifecycle. Thus,
the design of these levels is key for ensuring an effective scaling. In this
article, we provide an overview of the automation of the network service
scaling operation in NFV, addressing the options and boundaries introduced by
ETSI normative specifications. We start by providing a description of the NSD
structure, focusing on how instantiation levels are constructed. For
illustrative purposes, we propose an NSD for a representative NS. This NSD
includes different instantiation levels that enable different ways to
automatically scale this NS. Then, we show the different scaling procedures the
NFV framework has available, and how it may automate their triggering. Finally,
we propose an ETSI-compliant workflow to describe in detail a representative
scaling procedure. This workflow clarifies the interactions and information
exchanges between the functional blocks in the NFV framework when performing
the scaling operation.Comment: This work has been accepted for publication in the IEEE
Communications Magazin
Characterizing neuromorphologic alterations with additive shape functionals
The complexity of a neuronal cell shape is known to be related to its
function. Specifically, among other indicators, a decreased complexity in the
dendritic trees of cortical pyramidal neurons has been associated with mental
retardation. In this paper we develop a procedure to address the
characterization of morphological changes induced in cultured neurons by
over-expressing a gene involved in mental retardation. Measures associated with
the multiscale connectivity, an additive image functional, are found to give a
reasonable separation criterion between two categories of cells. One category
consists of a control group and two transfected groups of neurons, and the
other, a class of cat ganglionary cells. The reported framework also identified
a trend towards lower complexity in one of the transfected groups. Such results
establish the suggested measures as an effective descriptors of cell shape
Single-Shot Clothing Category Recognition in Free-Configurations with Application to Autonomous Clothes Sorting
This paper proposes a single-shot approach for recognising clothing
categories from 2.5D features. We propose two visual features, BSP (B-Spline
Patch) and TSD (Topology Spatial Distances) for this task. The local BSP
features are encoded by LLC (Locality-constrained Linear Coding) and fused with
three different global features. Our visual feature is robust to deformable
shapes and our approach is able to recognise the category of unknown clothing
in unconstrained and random configurations. We integrated the category
recognition pipeline with a stereo vision system, clothing instance detection,
and dual-arm manipulators to achieve an autonomous sorting system. To verify
the performance of our proposed method, we build a high-resolution RGBD
clothing dataset of 50 clothing items of 5 categories sampled in random
configurations (a total of 2,100 clothing samples). Experimental results show
that our approach is able to reach 83.2\% accuracy while classifying clothing
items which were previously unseen during training. This advances beyond the
previous state-of-the-art by 36.2\%. Finally, we evaluate the proposed approach
in an autonomous robot sorting system, in which the robot recognises a clothing
item from an unconstrained pile, grasps it, and sorts it into a box according
to its category. Our proposed sorting system achieves reasonable sorting
success rates with single-shot perception.Comment: 9 pages, accepted by IROS201
Representability of algebraic topology for biomolecules in machine learning based scoring and virtual screening
This work introduces a number of algebraic topology approaches, such as
multicomponent persistent homology, multi-level persistent homology and
electrostatic persistence for the representation, characterization, and
description of small molecules and biomolecular complexes. Multicomponent
persistent homology retains critical chemical and biological information during
the topological simplification of biomolecular geometric complexity.
Multi-level persistent homology enables a tailored topological description of
inter- and/or intra-molecular interactions of interest. Electrostatic
persistence incorporates partial charge information into topological
invariants. These topological methods are paired with Wasserstein distance to
characterize similarities between molecules and are further integrated with a
variety of machine learning algorithms, including k-nearest neighbors, ensemble
of trees, and deep convolutional neural networks, to manifest their descriptive
and predictive powers for chemical and biological problems. Extensive numerical
experiments involving more than 4,000 protein-ligand complexes from the PDBBind
database and near 100,000 ligands and decoys in the DUD database are performed
to test respectively the scoring power and the virtual screening power of the
proposed topological approaches. It is demonstrated that the present approaches
outperform the modern machine learning based methods in protein-ligand binding
affinity predictions and ligand-decoy discrimination
Understand Your Chains: Towards Performance Profile-based Network Service Management
Allocating resources to virtualized network functions and services to meet
service level agreements is a challenging task for NFV management and
orchestration systems. This becomes even more challenging when agile
development methodologies, like DevOps, are applied. In such scenarios,
management and orchestration systems are continuously facing new versions of
functions and services which makes it hard to decide how much resources have to
be allocated to them to provide the expected service performance. One solution
for this problem is to support resource allocation decisions with performance
behavior information obtained by profiling techniques applied to such network
functions and services.
In this position paper, we analyze and discuss the components needed to
generate such performance behavior information within the NFV DevOps workflow.
We also outline research questions that identify open issues and missing pieces
for a fully integrated NFV profiling solution. Further, we introduce a novel
profiling mechanism that is able to profile virtualized network functions and
entire network service chains under different resource constraints before they
are deployed on production infrastructure.Comment: Submitted to and accepted by the European Workshop on Software
Defined Networks (EWSDN) 201
- …