Showing papers by "Alcatel-Lucent published in 2005"

Cooperative strategies and capacity theorems for relay networks

Abstract: Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant of multihopping, but in addition to having the relays successively decode the message, the transmitters cooperate and each receiver uses several or all of its past channel output blocks to decode. For the compress-and-forward scheme, the relays take advantage of the statistical dependence between their channel outputs and the destination's channel output. The strategies are applied to wireless channels, and it is shown that decode-and-forward achieves the ergodic capacity with phase fading if phase information is available only locally, and if the relays are near the source node. The ergodic capacity coincides with the rate of a distributed antenna array with full cooperation even though the transmitting antennas are not colocated. The capacity results generalize broadly, including to multiantenna transmission with Rayleigh fading, single-bounce fading, certain quasi-static fading problems, cases where partial channel knowledge is available at the transmitters, and cases where local user cooperation is permitted. The results further extend to multisource and multidestination networks such as multiaccess and broadcast relay channels.

DART: directed automated random testing

Abstract: We present a new tool, named DART, for automatically testing software that combines three main techniques: (1) automated extraction of the interface of a program with its external environment using static source-code parsing; (2) automatic generation of a test driver for this interface that performs random testing to simulate the most general environment the program can operate in; and (3) dynamic analysis of how the program behaves under random testing and automatic generation of new test inputs to direct systematically the execution along alternative program paths. Together, these three techniques constitute Directed Automated Random Testing, or DART for short. The main strength of DART is thus that testing can be performed completely automatically on any program that compiles -- there is no need to write any test driver or harness code. During testing, DART detects standard errors such as program crashes, assertion violations, and non-termination. Preliminary experiments to unit test several examples of C programs are very encouraging.

Joint channel assignment and routing for throughput optimization in multi-radio wireless mesh networks

Abstract: Multi-hop infrastructure wireless mesh networks offer increased reliability, coverage and reduced equipment costs over their single-hop counterpart, wireless LANs. Equipping wireless routers with multiple radios further improves the capacity by transmitting over multiple radios simultaneously using orthogonal channels. Efficient channel assignment and routing is essential for throughput optimization of mesh clients. Efficient channel assignment schemes can greatly relieve the interference effect of close-by transmissions; effective routing schemes can alleviate potential congestion on any gateways to the Internet, thereby improving per-client throughput. Unlike previous heuristic approaches, we mathematically formulate the joint channel assignment and routing problem, taking into account the interference constraints, the number of channels in the network and the number of radios available at each mesh router. We then use this formulation to develop a solution for our problem that optimizes the overall network throughput subject to fairness constraints on allocation of scarce wireless capacity among mobile clients. We show that the performance of our algorithms is within a constant factor of that of any optimal algorithm for the joint channel assignment and routing problem. Our evaluation demonstrates that our algorithm can effectively exploit the increased number of channels and radios, and it performs much better than the theoretical worst case bounds.

Skeleton of Euplectella sp.: Structural Hierarchy from the Nanoscale to the Macroscale

Abstract: Structural materials in nature exhibit remarkable designs with building blocks, often hierarchically arranged from the nanometer to the macroscopic length scales. We report on the structural properties of biosilica observed in the hexactinellid sponge Euplectella sp. Consolidated, nanometer-scaled silica spheres are arranged in well-defined microscopic concentric rings glued together by organic matrix to form laminated spicules. The assembly of these spicules into bundles, effected by the laminated silica-based cement, results in the formation of a macroscopic cylindrical square-lattice cagelike structure reinforced by diagonal ridges. The ensuing design overcomes the brittleness of its constituent material, glass, and shows outstanding mechanical rigidity and stability. The mechanical benefits of each of seven identified hierarchical levels and their comparison with common mechanical engineering strategies are discussed.

Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

Abstract: Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are characterized by the use of multiple orthogonal channels and nodes with the ability to simultaneously communicate with many neighbors using multiple radios (interfaces) over orthogonal channels. Networks based on the IEEE 802.11a/b/g and 802.16 standards are examples of these systems. However, due to the limited number of available orthogonal channels, interference is still a factor in such networks. In this paper, we propose a network model that captures the key practical aspects of such systems and characterize the constraints binding their behavior. We provide necessary conditions to verify the feasibility of rate vectors in these networks, and use them to derive upper bounds on the capacity in terms of achievable throughput, using a fast primal-dual algorithm. We then develop two link channel assignment schemes, one static and the other dynamic, in order to derive lower bounds on the achievable throughput. We demonstrate through simulations that the dynamic link channel assignment scheme performs close to optimal on the average, while the static link channel assignment algorithm also performs very well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.

Dynamic partial-order reduction for model checking software

Abstract: We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent processes/threads, and dynamically tracking interactions between these to identify backtracking points where alternative paths in the state space need to be explored. We present examples of multi-threaded programs where our new dynamic partial-order reduction technique significantly reduces the search space, even though traditional partial-order algorithms are helpless.

Systematic treatment of displacements, strains, and electric fields in density-functional perturbation theory

Abstract: The methods of density-functional perturbation theory may be used to calculate various physical response properties of insulating crystals including elastic, dielectric, Born charge, and piezoelectric tensors. These and other important tensors may be defined as second derivatives of an appropriately defined energy functional with respect to atomic-displacement, electric-field, or strain perturbations, or as mixed derivatives with respect to two of these perturbations. The resulting tensor quantities tend to be coupled in complex ways in polar crystals, giving rise to a variety of variant definitions. For example, it is generally necessary to distinguish between elastic tensors defined under different electrostatic boundary conditions, and between dielectric tensors defined under different elastic boundary conditions. Here, we describe an approach for computing all of these various response tensors in a unified and systematic fashion. Applications are presented for two materials, hexagonal ZnO and rhombohedral $\mathrm{Ba}\mathrm{Ti}{\mathrm{O}}_{3}$, at zero temperature.

Magnetoelectric phase diagrams of orthorhombic R MnO 3 ( R = Gd , Tb, and Dy)

Abstract: Magnetoelectric phase diagrams have been investigated for rare-earth manganites with orthorhombically distorted perovskite structure, $R{\mathrm{MnO}}_{3}$ ($R=\mathrm{Gd}$, Tb, and Dy). A variety of magnetic and electric phases emerge with varying $R$-site ion, temperature, and magnetic field in these systems. The magnetoelectric phase diagram varies sensitively with the direction of a magnetic field relative to the crystallographic axes. Although the ground state of ${\mathrm{GdMnO}}_{3}$ with the largest ionic radius of $R({r}_{R})$ is not ferroelectric in zero magnetic fields $(H=0)$, a ferroelectric phase with electric polarization $(P)$ along the $a$ axis appears by applying $H(g\ensuremath{\sim}1\phantom{\rule{0.3em}{0ex}}\mathrm{T})$ along the $b$ axis. Both ${\mathrm{TbMnO}}_{3}$ and ${\mathrm{DyMnO}}_{3}$ show a ferroelectric order with $P$ along the $c$ axis even at $H=0$ below a lock-in transition temperature where nonzero wave vectors for magnetic and lattice modulations become nearly constant. These systems also exhibit a flop of the ferroelectric polarization ($P\ensuremath{\Vert}c$ to $P\ensuremath{\Vert}a$) when $H$ is applied along the $a$ or $b$ axis. By contrast, the application of $H$ above $\ensuremath{\sim}10\phantom{\rule{0.3em}{0ex}}\mathrm{T}$ along the $c$ axis completely suppresses the ferroelectricity in ${\mathrm{TbMnO}}_{3}$. Possible origins of the observed evolution of magnetoelectric phases are discussed in consideration of magnetism and lattice distortion in the perovskite rare-earth manganites.

Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Abstract: We study a model of controlled queueing network, which operates and makes control decisions in discrete time. An underlying random network mode determines the set of available controls in each time slot. Each control decision "produces" a certain vector of "commodities"; it also has associated "traditional" queueing control effect, i.e., it determines traffic (customer) arrival rates, service rates at the nodes, and random routing of processed customers among the nodes. The problem is to find a dynamic control strategy which maximizes a concave utility function H(X), where X is the average value of commodity vector, subject to the constraint that network queues remain stable. We introduce a dynamic control algorithm, which we call Greedy Primal-Dual (GPD) algorithm, and prove its asymptotic optimality. We show that our network model and GPD algorithm accommodate a wide range of applications. As one example, we consider the problem of congestion control of networks where both traffic sources and network processing nodes may be randomly time-varying and interdependent. We also discuss a variety of resource allocation problems in wireless networks, which in particular involve average power consumption constraints and/or optimization, as well as traffic rate constraints.

Impact of antenna correlation on the capacity of multiantenna channels

Abstract: This paper applies random matrix theory to obtain analytical characterizations of the capacity of correlated multiantenna channels. The analysis is not restricted to the popular separable correlation model, but rather it embraces a more general representation that subsumes most of the channel models that have been treated in the literature. For arbitrary signal-to-noise ratios (SNR), the characterization is conducted in the regime of large numbers of antennas. For the low- and high-SNR regions, in turn, we uncover compact capacity expansions that are valid for arbitrary numbers of antennas and that shed insight on how antenna correlation impacts the tradeoffs among power, bandwidth, and rate.

Measurement-induced entanglement for excitation stored in remote atomic ensembles

Abstract: A critical requirement for diverse applications in quantum information science is the capability to disseminate quantum resources over complex quantum networks. For example, the coherent distribution of entangled quantum states together with quantum memory (for storing the states) can enable scalable architectures for quantum computation, communication and metrology. Here we report observations of entanglement between two atomic ensembles located in distinct, spatially separated set-ups. Quantum interference in the detection of a photon emitted by one of the samples projects the otherwise independent ensembles into an entangled state with one joint excitation stored remotely in 10(5) atoms at each site. After a programmable delay, we confirm entanglement by mapping the state of the atoms to optical fields and measuring mutual coherences and photon statistics for these fields. We thereby determine a quantitative lower bound for the entanglement of the joint state of the ensembles. Our observations represent significant progress in the ability to distribute and store entangled quantum states.

Magnetically driven ferroelectric order in Ni3V2O8.

Abstract: We show that long-range ferroelectric and incommensurate magnetic order appear simultaneously in a single phase transition in Ni3V2O8. The temperature and magnetic-field dependence of the spontaneous polarization show a strong coupling between magnetic and ferroelectric orders. We determine the magnetic symmetry using Landau theory for continuous phase transitions, which shows that the spin structure alone can break spatial inversion symmetry leading to ferroelectric order. This phenomenological theory explains our experimental observation that the spontaneous polarization is restricted to lie along the crystal b axis and predicts that the magnitude should be proportional to a magnetic order parameter.

Absence of ferromagnetism in Co and Mn substituted polycrystalline ZnO

Abstract: We discuss the properties of semiconducting bulk ZnO when substituted with the magnetic transition metal ions Mn and Co, with substituent fraction ranging from $x=0.02$ to $x=0.15$. The magnetic properties were measured as a function of magnetic field and temperature and we find no evidence for magnetic ordering in these systems down to $T=2\phantom{\rule{0.3em}{0ex}}\mathrm{K}$. The magnetization can be fit by the sum of a Curie-Weiss term with a Weiss temperature of $\ensuremath{\Theta}⪢100\phantom{\rule{0.3em}{0ex}}\mathrm{K}$ and a Curie term. We attribute this behavior to contributions from both $t\mathrm{M}$ ions with $t\mathrm{M}$ nearest neighbors and from isolated spins. This particular functional form for the susceptibility is used to explain why no ordering is observed in $t\mathrm{M}$ substituted ZnO samples despite the large values of the Weiss temperature. We also discuss in detail the methods we used to minimize any impurity contributions to the magnetic signal.

A cost-based model and effective heuristic for repairing constraints by value modification

Abstract: Data integrated from multiple sources may contain inconsistencies that violate integrity constraints. The constraint repair problem attempts to find "low cost" changes that, when applied, will cause the constraints to be satisfied. While in most previous work repair cost is stated in terms of tuple insertions and deletions, we follow recent work to define a database repair as a set of value modifications. In this context, we introduce a novel cost framework that allows for the application of techniques from record-linkage to the search for good repairs. We prove that finding minimal-cost repairs in this model is NP-complete in the size of the database, and introduce an approach to heuristic repair-construction based on equivalence classes of attribute values. Following this approach, we define two greedy algorithms. While these simple algorithms take time cubic in the size of the database, we develop optimizations inspired by algorithms for duplicate-record detection that greatly improve scalability. We evaluate our framework and algorithms on synthetic and real data, and show that our proposed optimizations greatly improve performance at little or no cost in repair quality.

Shock Geometry, Seed Populations, and the Origin of Variable Elemental Composition at High Energies in Large Gradual Solar Particle Events

Abstract: Above a few tens of MeV per nucleon, large, gradual solar energetic particle (SEP) events are highly variable in their spectral characteristics and elemental composition. The origin of this variability has been a matter of intense and ongoing debate. In this paper, we propose that this variability arises from the interplay of two factors—shock geometry and a compound seed population, typically comprising both solar-wind and flare suprathermals. Whereas quasi-parallel shocks generally draw their seeds from solar-wind suprathermals, quasi-perpendicular shocks—by requiring a higher initial speed for effective injection—preferentially accelerate seed particles from flares. Solar-wind and flare seed particles have distinctive compositional characteristics, which are then reflected in the accelerated particles. We first examine our hypothesis in the context of particles locally accelerated near 1 AU by traveling interplanetary shocks. We illustrate the implications of our hypothesis for SEPs with two very large events, 2002 April 21 and 2002 August 24. These two events arise from very similar solar progenitors but nevertheless epitomize extremes in high-energy SEP variability. We then test our hypothesis with correlation studies based on observations of 43 large SEP events in 1997-2003 by the Advanced Composition Explorer, Wind, the Interplanetary Monitoring Platform 8, and GOES. We consider correlations among high-energy Fe/O, event size, spectral characteristics, the presence of GeV protons, and event duration at high energies. The observed correlations are all qualitatively consistent with our hypothesis. Although these correlation studies cannot be construed as proof of our hypothesis, they certainly confirm its viability. We also examine the alternative hypothesis in which a direct flare component—rather than flare particles subsequently processed through a shock—dominates at high energies. This alternative would produce compositional characteristics similar to those of our hypothesis. However, the observed longitude distribution of the enhanced Fe/O events, their spectral characteristics, and recent timing studies all pose serious challenges for a direct flare component. We also comment on measurements of the mean ionic charge state of Fe at high energies. We conclude that shock geometry and seed population potentially provide a framework for understanding the overall high-energy variability in large SEP events. We suggest additional studies for testing this hypothesis.

A road to future broadband wireless access: MIMO-OFDM-Based air interface

Abstract: Orthogonal frequency-division multiplexing is a popular method for high-data-rate wireless transmission. OFDM may be combined with multiple antennas at both the access point and mobile terminal to increase diversity gain and/or enhance system capacity on a time-varying multipath fading channel, resulting in a multiple-input multiple-output OFDM system. In this article we give a brief technical overview of MIMO-OFDM system design. We focus on various research topics for the MIMO-OFDM-based air interface, including spatial channel modeling, MIMO-OFDM transceiver design, MIMO-OFDM channel estimation, space-time techniques for MIMO-OFDM, and error correction code. The corresponding link-level simulation results are encouraging, and show that MIMO-OFDM is a promising road to future broadband wireless access.

Electric polarization rotation in a hexaferrite with long-wavelength magnetic structures.

Abstract: We report on the control of electric polarization (P) by using magnetic fields (B) in a hexaferrite having magnetic order above room temperature (RT). The material investigated is hexagonal Ba0.5Sr1.5Zn2Fe12O22, which is a nonferroelectric helimagnetic insulator in the zero-field ground state. By applying B, the system undergoes successive metamagnetic transitions, and shows concomitant ferroelectric order in some of the B-induced phases with long-wavelength magnetic structures. The magnetoelectrically induced P can be rotated 360 degrees by external B. This opens up the potential for not only RT magnetoelectric devices but also devices based on the magnetically controlled electro-optical response.

Demand responsive pricing and competitive spectrum allocation via a spectrum server

Abstract: In this paper we develop a framework for competition of future operators likely to operate in a mixed commons/property-rights regime under the regulation of a spectrum policy server (SPS). The operators dynamically compete for customers as well as portions of available spectrum. The operators are charged by the SPS for the amount of bandwidth they use in their services. Through demand responsive pricing, the operators try to come up with convincing service offers for the customers, while trying to maximize their profits. We first consider a single-user system as an illustrative example. We formulate the competition between the operators as a non-cooperative game and propose an SPS-based iterative bidding scheme that results in a Nash equilibrium of the game. Numerical results suggest that, competition increases the user's (customer's) acceptance probability of the offered service, while reducing the profits achieved by the operators. It is also observed that as the cost of unit bandwidth increases relative to the cost of unit infrastructure (fixed cost), the operator with superior technology (higher fixed cost) becomes more competitive. We then extend the framework to a multiuser setting where the operators are competing for a number of users at once. We propose an SPS-based bandwidth allocation scheme in which the SPS optimally allocates bandwidth portions for each user-operator session to maximize its overall expected revenue resulting from the operator payments. Comparison of the performance of this scheme to one in which the bandwidth is equally shared between the user-operator pairs reveals that such an SPS-based scheme improves the user acceptance probabilities and the bandwidth utilization in multiuser systems

A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

Abstract: The multiple knapsack problem (MKP) is a natural and well-known generalization of the single knapsack problem and is defined as follows. We are given a set of $n$ items and $m$ bins (knapsacks) such that each item $i$ has a profit $p(i)$ and a size $s(i)$, and each bin $j$ has a capacity $c(j)$. The goal is to find a subset of items of maximum profit such that they have a feasible packing in the bins. MKP is a special case of the generalized assignment problem (GAP) where the profit and the size of an item can vary based on the specific bin that it is assigned to. GAP is APX-hard and a 2-approximation, for it is implicit in the work of Shmoys and Tardos [Math. Program. A, 62 (1993), pp. 461-474], and thus far, this was also the best known approximation for MKP\@. The main result of this paper is a polynomial time approximation scheme (PTAS) for MKP\@. Apart from its inherent theoretical interest as a common generalization of the well-studied knapsack and bin packing problems, it appears to be the strongest special case of GAP that is not APX-hard. We substantiate this by showing that slight generalizations of MKP are APX-hard. Thus our results help demarcate the boundary at which instances of GAP become APX-hard. An interesting aspect of our approach is a PTAS-preserving reduction from an arbitrary instance of MKP to an instance with $O(\log n)$ distinct sizes and profits.

Microstructure of Fragile Metallic Glasses Inferred from Ultrasound-Accelerated Crystallization in Pd-Based Metallic Glasses

Abstract: By utilizing ultrasonic annealing at a temperature below (or near) the glass transition temperature Tg, we revealed a microstructural pattern of a partially crystallized Pd-based metallic glass with a high-resolution electron microscopy. On the basis of the observed microstructure, we inferred a plausible microstructural model of fragile metallic glasses composed of strongly bonded regions surrounded by weakly bonded regions (WBRs). The crystallization in WBRs at such a low temperature under the ultrasonic vibrations is caused by accumulation of atomic jumps associated with the beta relaxation being resonant with the ultrasonic strains. This microstructural model successfully illustrates a marked increase of elasticity after crystallization with a small density change and a correlation between the fragility of the liquid and the Poisson ratio of the solid.

Spin-charge separation and localization in one dimension.

Abstract: We report on measurements of quantum many-body modes in ballistic wires and their dependence on Coulomb interactions, obtained by tunneling between two parallel wires in an GaAs/AlGaAs heterostructure while varying electron density. We observed two spin modes and one charge mode of the coupled wires and mapped the dispersion velocities of the modes down to a critical density, at which spontaneous localization was observed. Theoretical calculations of the charge velocity agree well with the data, although they also predict an additional charge mode that was not observed. The measured spin velocity was smaller than theoretically predicted.

Universally composable password-based key exchange

Abstract: We propose and realize a definition of security for password-based key exchange within the framework of universally composable (UC) security, thus providing security guarantees under arbitrary composition with other protocols. In addition, our definition captures some aspects of the problem that were not adequately addressed by most prior notions. For instance, it does not assume any underlying probability distribution on passwords, nor does it assume independence between passwords chosen by different parties. We also formulate a definition of password-based secure channels, and show that such a definition is achievable given password-based key exchange. Our protocol realizing the new definition of password-based key exchange is in the common reference string model and relies on standard number-theoretic assumptions. The components of our protocol can be instantiated to give a relatively efficient solution which is conceivably usable in practice. We also show that it is impossible to satisfy our definition in the “plain” model (e.g., without a common reference string).

An improved exponential-time algorithm for k-SAT

Abstract: We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, followed by a search stage that uses a simple randomized greedy procedure to look for a satisfying assignment. Currently, this is the fastest known probabilistic algorithm for k-CNF satisfiability for k g 4 (with a running time of O(20.5625n) for 4-CNF). In addition, it is the fastest known probabilistic algorithm for k-CNF, k g 3, that have at most one satisfying assignment (unique k-SAT) (with a running time O(2(2 ln 2 − 1)n p o(n)) = O(20.386 … n) in the case of 3-CNF). The analysis of the algorithm also gives an upper bound on the number of the codewords of a code defined by a k-CNF. This is applied to prove a lower bounds on depth 3 circuits accepting codes with nonconstant distance. In particular we prove a lower bound Ω(21.282…√>i/ii/ii/i

Method and apparatus for mirroring traffic over a network

Abstract: A method and apparatus for mirroring traffic from a first network device to a second network device are disclosed. The method includes the selecting of one or more ingress frames from an ingress stream using mirror classification criteria; duplicating the one or more ingress frames; appending a mirrored flow encapsulation header with a virtual local area network tag; transmitting the duplicate frames with tags from the first network device to the second network device; and removing the mirrored flow encapsulation header at the target network device to regenerate the ingress frames originally received at the first network device. The ingress frames may then be forwarded to an egress port of the second network device and analyzed by a traffic analysis tool, for example. With the invention, the traffic received at the first network device may be analyzed remotely.

Automatic composition of transition-based semantic web services with messaging

Abstract: In this paper we present Colombo, a framework in which web services are characterized in terms of (i) the atomic processes (i.e., operations) they can perform; (ii) their impact on the "real world" (modeled as a relational database); (iii) their transition-based behavior; and (iv) the messages they can send and receive (from/to other web services and "human" clients). As such, Colombo combines key elements from the standards and research literature on (semantic) web services. Using Colombo, we study the problem of automatic service composition (synthesis) and devise a sound, complete and terminating algorithm for building a composite service. Specifically, the paper develops (i) a technique for handling the data, which ranges over an infinite domain, in a finite, symbolic way, and (ii) a technique to automatically synthesize composite web services, based on Propositional Dynamic Logic.

Softrouter protocol disaggregation

Abstract: A SoftRouter architecture deconstructs routers by separating the control entities of a router from its forwarding components, enabling dynamic binding between them. In the SoftRouter architecture, control plane functions are aggregated and implemented on a few smart servers which control forwarding elements that are multiple network hops away. A dynamic binding protocol performs network-wide control plane failovers. Network stability is improved by aggregating and remotely hosting routing protocols, such as OSPF and BGP. This results in faster convergence, lower protocol messages processed, and fewer route changes following a failure. The SoftRouter architecture includes a few smart control entities that manage a large number of forwarding elements to provide greater support for network-wide control. In the SoftRouter architecture, routing protocols operate remotely at a control element and control one or more forwarding elements by downloading the forwarding tables, etc. into the forwarding elements. Intra-domain routing and inter-domain routing are also included.

Softrouter separate control network

Abstract: An embodiment of the exemplary SoftRouter architecture includes two physically separate networks, a control plane network and a data plane network. The data plane network is one physical network for the data traffic, while the control plane network is another physical network for the control traffic. The topology of the data plane network is made up of interconnected forwarding elements (FEs). The topology of the control plane network is made up interconnected control elements (CEs). This physical independence of the control plane network from the data plane network provides for a secure mechanism to communicate among the CEs in the control plane network. In addition, this physical independence provides improved reliability and improved scalability, when compared to the traditional router architecture, where control plane message are in-band with the data plane.

Sketching streams through the net: distributed approximate query tracking

Abstract: Emerging large-scale monitoring applications require continuous tracking of complex data-analysis queries over collections of physically-distributed streams. Effective solutions have to be simultaneously space/time efficient (at each remote monitor site), communication efficient (across the underlying communication network), and provide continuous, guaranteed-quality approximate query answers. In this paper, we propose novel algorithmic solutions for the problem of continuously tracking a broad class of complex aggregate queries in such a distributed-streams setting. Our tracking schemes maintain approximate query answers with provable error guarantees, while simultaneously optimizing the storage space and processing time at each remote site, and the communication cost across the network. They rely on tracking general-purpose randomized sketch summaries of local streams at remote sites along with concise prediction models of local site behavior in order to produce highly communication- and space/time-efficient solutions. The result is a powerful approximate query tracking framework that readily incorporates several complex analysis queries (including distributed join and multi-join aggregates, and approximate wavelet representations), thus giving the first known low-overhead tracking solution for such queries in the distributed-streams model.

NGN architecture: generic principles, functional architecture, and implementation

Abstract: This article summarizes the architectural aspects of a next-generation network in terms of general principles, functional representation, and typical implementation. According to the general reference model, which assumes decoupling of services and transport, NGN can be represented by multiple functional groups. One of the key implementations for session-based services, utilizing an IP multimedia subsystem, is introduced with enhanced features to meet both fixed and mobile network requirements.