Management of Digital Video Broadcasting Services in Open Delivery Platforms

The future of Digital Video Broadcasting (DVB) is moving towards solutions offering an efficient way of carrying interactive IP multimedia services over digital terrestrial broadcasting networks to handheld terminals. One of the most promising technologies is Digital Video Broadcasting-Handheld (DVB-H), at present under standardisation. Services deployed via this type of DVB technologies should enjoy reliability comparable to TV services and high quality standards. However, the market at present does not provide effective and economical solutions for the deployment of such services over multi-domain IP networks, due to their high level of unreliability. This paper focuses on service management, service level agreement (SLA) and network performance requirements of DVB-H services. Experimental results are presented concerning QoS sensitivity to network performance of DVB-H services delivered over a multi-domain IP network. Moreover, a solution for efficient and cost effective service management via QoS monitoring and control and network SLA design is proposed. The solution gives DVB-H operators the possibility of fully managing service QoS without being tied to third party operators

Security in Locally Repairable Storage

In this paper we extend the notion of {\em locally repairable} codes to {\em secret sharing} schemes. The main problem that we consider is to find optimal ways to distribute shares of a secret among a set of storage-nodes (participants) such that the content of each node (share) can be recovered by using contents of only few other nodes, and at the same time the secret can be reconstructed by only some allowable subsets of nodes. As a special case, an eavesdropper observing some set of specific nodes (such as less than certain number of nodes) does not get any information. In other words, we propose to study a locally repairable distributed storage system that is secure against a {\em passive eavesdropper} that can observe some subsets of nodes. We provide a number of results related to such systems including upper-bounds and achievability results on the number of bits that can be securely stored with these constraints.Comment: This paper has been accepted for publication in IEEE Transactions of Information Theor

Heavy Hitters and the Structure of Local Privacy

We present a new locally differentially private algorithm for the heavy hitters problem which achieves optimal worst-case error as a function of all standardly considered parameters. Prior work obtained error rates which depend optimally on the number of users, the size of the domain, and the privacy parameter, but depend sub-optimally on the failure probability. We strengthen existing lower bounds on the error to incorporate the failure probability, and show that our new upper bound is tight with respect to this parameter as well. Our lower bound is based on a new understanding of the structure of locally private protocols. We further develop these ideas to obtain the following general results beyond heavy hitters. $\bullet$ Advanced Grouposition: In the local model, group privacy for $k$ users degrades proportionally to $\approx \sqrt{k}$, instead of linearly in $k$ as in the central model. Stronger group privacy yields improved max-information guarantees, as well as stronger lower bounds (via "packing arguments"), over the central model. $\bullet$ Building on a transformation of Bassily and Smith (STOC 2015), we give a generic transformation from any non-interactive approximate-private local protocol into a pure-private local protocol. Again in contrast with the central model, this shows that we cannot obtain more accurate algorithms by moving from pure to approximate local privacy

Clinical Persistence of Chlamydia trachomatis Sexually Transmitted Strains Involves Novel Mutations in the Functional αββα Tetramer of the Tryptophan Synthase Operon.

Clinical persistence of Chlamydia trachomatis (Ct) sexually transmitted infections (STIs) is a major public health concern. In vitro persistence is known to develop through interferon gamma (IFN-γ) induction of indoleamine 2,3-dioxygenase (IDO), which catabolizes tryptophan, an essential amino acid for Ct replication. The organism can recover from persistence by synthesizing tryptophan from indole, a substrate for the enzyme tryptophan synthase. The majority of Ct strains, except for reference strain B/TW-5/OT, contain an operon comprised of α and β subunits that encode TrpA and TrpB, respectively, and form a functional αββα tetramer. However, trpA mutations in ocular Ct strains, which are responsible for the blinding eye disease known as trachoma, abrogate tryptophan synthesis from indole. We examined serial urogenital samples from a woman who had recurrent Ct infections over 4 years despite antibiotic treatment. The Ct isolates from each infection episode were genome sequenced and analyzed for phenotypic, structural, and functional characteristics. All isolates contained identical mutations in trpA and developed aberrant bodies within intracellular inclusions, visualized by transmission electron microscopy, even when supplemented with indole following IFN-γ treatment. Each isolate displayed an altered αββα structure, could not synthesize tryptophan from indole, and had significantly lower trpBA expression but higher intracellular tryptophan levels compared with those of reference Ct strain F/IC-Cal3. Our data indicate that emergent mutations in the tryptophan operon, which were previously thought to be restricted only to ocular Ct strains, likely resulted in in vivo persistence in the described patient and represents a novel host-pathogen adaptive strategy for survival.IMPORTANCE Chlamydia trachomatis (Ct) is the most common sexually transmitted bacterium with more than 131 million cases occurring annually worldwide. Ct infections are often asymptomatic, persisting for many years despite treatment. In vitro recovery from persistence occurs when indole is utilized by the organism's tryptophan synthase to synthesize tryptophan, an essential amino acid for replication. Ocular but not urogenital Ct strains contain mutations in the synthase that abrogate tryptophan synthesis. Here, we discovered that the genomes of serial isolates from a woman with recurrent, treated Ct STIs over many years were identical with a novel synthase mutation. This likely allowed long-term in vivo persistence where active infection resumed only when tryptophan became available. Our findings indicate an emerging adaptive host-pathogen evolutionary strategy for survival in the urogenital tract that will prompt the field to further explore chlamydial persistence, evaluate the genetics of mutant Ct strains and fitness within the host, and their implications for disease pathogenesis

Linear Support Vector Machines for Error Correction in Optical Data Transmission

Reduction of bit error rates in optical transmission systems is an important task that is difficult to achieve. As speeds increase, the difficulty in reducing bit error rates also increases. Channels have differing characteristics, which may change over time, and any error correction employed must be capable of operating at extremely high speeds. In this paper, a linear support vector machine is used to classify large-scale data sets of simulated optical transmission data in order to demonstrate their effectiveness at reducing bit error rates and their adaptability to the specifics of each channel. For the classification, LIBLINEAR is used, which is related to the popular LIBSVM classifier. It is found that is possible to reduce the error rate on a very noisy channel to about 3 bits in a thousand. This is done by a linear separator that can be built in hardware and can operate at the high speed required of an operationally useful decode

Performance analysis using timed Petri Nets

Petri Nets have been successfully used to model and evaluate the performance of distributed systems. Several researchers have extended the basic Petri Net model to include time, and have demonstrated that restricted classes of Petri Nets can be analyzed efficiently. Unfortunately, the restrictions prohibit the techniques from being applied to many interesting systems, e.g. communication protocols. This paper proposes a version of timed Petri Nets which accurately models communication protocols, and which can be analyzed using Timed Reachability Graphs. Procedures for constructing and analyzing these graphs are presented. The analysis is shown to be applicable to a larger class of Timed Petri Nets than previously thought. The model and the analysis technique are demonstrated using a simple communication protocol

Beyond the Cut-Set Bound: Uncertainty Computations in Network Coding with Correlated Sources

Cut-set bounds on achievable rates for network communication protocols are not in general tight. In this paper we introduce a new technique for proving converses for the problem of transmission of correlated sources in networks, that results in bounds that are tighter than the corresponding cut-set bounds. We also define the concept of "uncertainty region" which might be of independent interest. We provide a full characterization of this region for the case of two correlated random variables. The bounding technique works as follows: on one hand we show that if the communication problem is solvable, the uncertainty of certain random variables in the network with respect to imaginary parties that have partial knowledge of the sources must satisfy some constraints that depend on the network architecture. On the other hand, the same uncertainties have to satisfy constraints that only depend on the joint distribution of the sources. Matching these two leads to restrictions on the statistical joint distribution of the sources in communication problems that are solvable over a given network architecture.Comment: 12 pages, A short version appears in ISIT 201

A support architecture for reliable distributed computing systems

The Clouds kernel design was through several design phases and is nearly complete. The object manager, the process manager, the storage manager, the communications manager, and the actions manager are examined