FLICK: developing and running application-specific network services

Data centre networks are increasingly programmable, with application-specific network services proliferating, from custom load-balancers to middleboxes providing caching and aggregation. Developers must currently implement these services using traditional low-level APIs, which neither support natural operations on application data nor provide efficient performance isolation. We describe FLICK, a framework for the programming and execution of application-specific network services on multi-core CPUs. Developers write network services in the FLICK language, which offers high-level processing constructs and application-relevant data types. FLICK programs are translated automatically to efficient, parallel task graphs, implemented in C++ on top of a user-space TCP stack. Task graphs have bounded resource usage at runtime, which means that the graphs of multiple services can execute concurrently without interference using cooperative scheduling. We evaluate FLICK with several services (an HTTP load-balancer, a Memcached router and a Hadoop data aggregator), showing that it achieves good performance while reducing development effort

Understanding internet usage and network locality in a rural community wireless mesh network

© 2015 ACM. Community networks owned and operated by local communities have recently gained popularity as a low cost solution for Internet access. In this paper, we seek to understand the characteristics of Internet usage in community networks and provide useful insights on designing and improving community networks in rural areas. We report the results of a socio-technical study carried out during a three month measurement of a community wireless mesh network (CWMN) which has been operating for two years in a rural area of northern Thailand. An on-site social interview was also conducted to supplement our analysis. The results reveal several interesting findings: rural users do use online social networks, instant messaging applications and online games similarly to urban users; they install unnecessary applications on their mobile phones and are completely obvious to their side effects - the traffic from these applications accounts for a major share of the traffic leading to numerous network anomalies. Finally our analysis uncovers the characteristic of locality in community networks where users in close geographical proximity interact with each other.TakNet was achieved thanks to sponsorship from THNIC Foundation. Part of this work was also supported by EU H2020 UMobile Project (Grant agreement no: 645124)

FLICK: Developing and running application-specific network services

Data centre networks are increasingly programmable, with $\textit{application-specific}$ network services proliferating, from custom load-balancers to middleboxes providing caching and aggregation. Developers must currently implement these services using traditional low-level APIs, which neither support natural operations on application data nor provide efficient performance isolation. We describe FLICK, a framework for the programming and execution of application-specific network services on multi-core CPUs. Developers write network services in the FLICK $\textit{language}$, which offers high-level processing constructs and application-relevant data types. FLICK programs are translated automatically to efficient, parallel $\textit{task graphs}$, implemented in C++ on top of a user-space TCP stack. Task graphs have bounded resource usage at runtime, which means that the graphs of multiple services can execute concurrently without interference using cooperative scheduling. We evaluate FLICK with several services (an HTTP load-balancer, a Memcached router and a Hadoop data aggregator), showing that it achieves good performance while reducing development effort.Engineering and Physical Sciences Research CouncilThis is the author accepted manuscript. The final version is available from USENIX via https://www.usenix.org/conference/atc16/technical-sessions/presentation/ali

Extending programs with debug-related features, with application to hardware development

The capacity and programmability of reconfigurable hardware such as FPGAs has improved steadily over the years, but they do not readily provide any mechanisms for monitoring or debugging running programs. Such mechanisms need to be written into the program itself. This is done using ad hoc methods and primitive tools when compared to CPU programming. This complicates the programming and debugging of reconfigurable hardware. We introduce Program-hosted Directability (PhD), the extension of programs to interpret direction commands at runtime to enable debugging, monitoring and profiling. Normally in hardware development such features are fixed at compile time. We present a language of directing commands, specify its semantics in terms of a simple controller that is embedded with programs, and implement a prototype for directing network programs running in hardware. We show that this approach affords significant flexibility with low impact on hardware utilisation and performance.This work has received funding from the EPSRC NaaS grant EP/K034723/1, European Union's Horizon 2020 research and innovation programme 2014-2018 under the SSICLOPS (grant agreement No. 644866), the Leverhulme Trust Early Career Fellowship ECF-2016-289 and the Newton Trust

The effect of time since measles vaccination and age at first dose on measles vaccine effectiveness - A systematic review.

BACKGROUND: In settings where measles has been eliminated, vaccine-derived immunity may in theory wane more rapidly due to a lack of immune boosting by circulating measles virus. We aimed to assess whether measles vaccine effectiveness (VE) waned over time, and if so, whether differentially in measles-eliminated and measles-endemic settings. METHODS: We performed a systematic literature review of studies that reported VE and time since vaccination with measles-containing vaccine (MCV). We extracted information on case definition (clinical symptoms and/or laboratory diagnosis), method of vaccination status ascertainment (medical record or vaccine registry), as well as any biases which may have arisen from cold chain issues and a lack of an age at first dose of MCV. We then used linear regression to evaluate VE as a function of age at first dose of MCV and time since MCV. RESULTS: After screening 14,782 citations, we identified three full-text articles from measles-eliminated settings and 33 articles from measles-endemic settings. In elimination settings, two-dose VE estimates increased as age at first dose of MCV increased and decreased as time since MCV increased; however, the small number of studies available limited interpretation. In measles-endemic settings, one-dose VE increased by 1.5% (95% CI 0.5, 2.5) for every month increase in age at first dose of MCV. We found no evidence of waning VE in endemic settings. CONCLUSIONS: The paucity of data from measles-eliminated settings indicates that additional studies and approaches (such as studies using proxies including laboratory correlates of protection) are needed to answer the question of whether VE in measles-eliminated settings wanes. Age at first dose of MCV was the most important factor in determining VE. More VE studies need to be conducted in elimination settings, and standards should be developed for information collected and reported in such studies

Search for Exclusive Charmless Hadronic B Decays

We have searched for two-body charmless hadronic decays of $B$ mesons. Final states include $\pi\pi$, $K \pi$, and $KK$ with both charged and neutral kaons and pions; $\pi\rho$, $K \rho$, and $K^*\pi$; and $K\phi$, $K^*\phi$, and $\phi\phi$. The data used in this analysis consist of 2.6~million $B\bar{B}$~pairs produced at the $\Upsilon(4S)$ taken with the CLEO-II detector at the Cornell Electron Storage Ring (CESR). We measure the branching fraction of the sum of $B^0 \rightarrow \pi^+\pi^-$ and $B^0 \rightarrow K^+\pi^-$ to be $(1.8^{+0.6+0.2}_{-0.5-0.3}\pm0.2) \times 10^{-5}$. In addition, we place upper limits on individual branching fractions in the range from $10^{-4}$ to $10^{-6}$.Comment: 33 page LATEX file, uses REVTEX and psfig, 14 figures in a separate uuencoded postscript file, postscript version also available through http://w4.lns.cornell.edu/public/CLN

Semileptonic Branching Fraction of Charged and Neutral B Mesons

An examination of leptons in ${\Upsilon (4S)}$ events tagged by reconstructed $B$ decays yields semileptonic branching fractions of $b_-=(10.1 \pm 1.8\pm 1.4)\%$ for charged and $b_0=(10.9 \pm 0.7\pm 1.1)\%$ for neutral $B$ mesons. This is the first measurement for charged $B$. Assuming equality of the charged and neutral semileptonic widths, the ratio $b_-/b_0=0.93 \pm 0.18 \pm 0.12$ is equivalent to the ratio of lifetimes. A postscript version is available through World-Wide-Web in http://w4.lns.cornell.edu/public/CLNS/1994Comment: 9 pages (in REVTEX format) Preprint CLNS94-1286, CLEO 94-1

Observation of the Isospin-Violating Decay Ds∗+→Ds+π0D_s^{*+}\to D_s^+\pi^0

Using data collected with the CLEO~II detector, we have observed the isospin-violating decay $D_s^{*+}\to D_s^+\pi^0$. The decay rate for this mode, relative to the dominant radiative decay, is found to be $\Gamma(D_s^{*+}\to D_s^+\pi^0)/\Gamma(D_s^{*+}\to D_s^+\gamma)= 0.062^{+0.020}_{-0.018}\pm0.022$.Comment: 8 page uuencoded postscript file, also available through http://w4.lns.cornell.edu/public/CLN