33,612 research outputs found
Performance Evaluation of Multiterminal Backhaul Compression for Cloud Radio Access Networks
In cloud radio access networks (C-RANs), the baseband processing of the
available macro- or pico/femto-base stations (BSs) is migrated to control
units, each of which manages a subset of BS antennas. The centralized
information processing at the control units enables effective interference
management. The main roadblock to the implementation of C-RANs hinges on the
effective integration of the radio units, i.e., the BSs, with the backhaul
network. This work first reviews in a unified way recent results on the
application of advanced multiterminal, as opposed to standard point-to-point,
backhaul compression techniques. The gains provided by multiterminal backhaul
compression are then confirmed via extensive simulations based on standard
cellular models. As an example, it is observed that multiterminal compression
strategies provide performance gains of more than 60% for both the uplink and
the downlink in terms of the cell-edge throughput.Comment: A shorter version of the paper has been submitted to CISS 201
Optimal Orchestration of Virtual Network Functions
-The emergence of Network Functions Virtualization (NFV) is bringing a set of
novel algorithmic challenges in the operation of communication networks. NFV
introduces volatility in the management of network functions, which can be
dynamically orchestrated, i.e., placed, resized, etc. Virtual Network Functions
(VNFs) can belong to VNF chains, where nodes in a chain can serve multiple
demands coming from the network edges. In this paper, we formally define the
VNF placement and routing (VNF-PR) problem, proposing a versatile linear
programming formulation that is able to accommodate specific features and
constraints of NFV infrastructures, and that is substantially different from
existing virtual network embedding formulations in the state of the art. We
also design a math-heuristic able to scale with multiple objectives and large
instances. By extensive simulations, we draw conclusions on the trade-off
achievable between classical traffic engineering (TE) and NFV infrastructure
efficiency goals, evaluating both Internet access and Virtual Private Network
(VPN) demands. We do also quantitatively compare the performance of our VNF-PR
heuristic with the classical Virtual Network Embedding (VNE) approach proposed
for NFV orchestration, showing the computational differences, and how our
approach can provide a more stable and closer-to-optimum solution
Safe Compositional Specification of Network Systems With Polymorphic, Constrained Types
In the framework of iBench research project, our previous work created a domain specific language TRAFFIC [6] that facilitates specification, programming, and maintenance of distributed applications over a network. It allows safety property to be formalized in terms of types and subtyping relations. Extending upon our previous work, we add Hindley-Milner style polymorphism [8] with constraints [9] to the type system of TRAFFIC. This allows a programmer to use for-all quantifier to describe types of network components, escalating power and expressiveness of types to a new level that was not possible before with propositional subtyping relations. Furthermore, we design our type system with a pluggable constraint system, so it can adapt to different application needs while maintaining soundness.
In this paper, we show the soundness of the type system, which is not syntax-directed but is easier to do typing derivation. We show that there is an equivalent syntax-directed type system, which is what a type checker program would implement to verify the safety of a network flow. This is followed by discussion on several constraint systems: polymorphism with subtyping constraints, Linear Programming, and Constraint Handling Rules (CHR) [3]. Finally, we provide some examples to illustrate workings of these constraint systems.National Science Foundation (CCR-0205294
- …