During the past decade, differential privacy has become the gold standard for protecting the privacy of individuals. However, verifying that a particular program provides differential privacy often remains a manual task to be completed by an expert in the field. Language-based techniques have been proposed for fully automating proofs of differential privacy via type system design, however these results have lagged behind advances in differentially-private algorithms, leaving a noticeable gap in programs which can be automatically verified while also providing state-of-the-art bounds on privacy. We propose Duet, an expressive higher-order language, linear type system and tool for automatically verifying differential privacy of general-purpose higher-order programs. In addition to general purpose programming, Duet supports encoding machine learning algorithms such as stochastic gradient descent, as well as common auxiliary data analysis tasks such as clipping, normalization and hyperparameter tuning - each of which are particularly challenging to encode in a statically verified differential privacy framework. We present a core design of the Duet language and linear type system, and complete key proofs about privacy for well-typed programs. We then show how to extend Duet to support realistic machine learning applications and recent variants of differential privacy which result in improved accuracy for many practical differentially private algorithms. Finally, we implement several differentially private machine learning algorithms in Duet which have never before been automatically verified by a language-based tool, and we present experimental results which demonstrate the benefits of Duet's language design in terms of accuracy of trained machine learning models.

Multi-user video conferencing is a ubiquitous technology. Increasingly end-hosts in a conference are assisted by cloud-based servers that improve the quality of experience for end users. This paper evaluates the impact of strategies for placement of such servers on user experience and deployment cost. We consider scenarios based upon the Amazon EC2 infrastructure as well as future scenarios in which cloud instances can be located at a larger number of possible sites across the planet. We compare a number of possible strategies for choosing which cloud locations should host services and how traffic should route through them. Our study is driven by real data to create demand scenarios with realistic geographical user distributions and diurnal behaviour. We conclude that on the EC2 infrastructure a well chosen static selection of servers performs well but as more cloud locations are available a dynamic choice of servers becomes important.

Low-cost video conferencing systems have provided an existence proof for the value of video communication in a home setting. At the same time, current systems have a number of fundamental limitations that inhibit more general social interactions among multiple groups of participants. In our work, we describe the development, implementation and evaluation of a domestic video conferencing system that is geared to providing true 'togetherness' among conference participants. We show that such interactions require sophisticated support for high-quality audiovisual presentation, and processing support for person identification and localisation. In this paper, we describe user requirements for effective interpersonal interaction. We then report on a system that implements these requirements. We conclude with a systems and user evaluation of this work. We present results that show that participants in a video conference can be made feel as 'together' as collocated players of a board game.

This paper describes a videoconferencing system that meets performance constraints and functional requirements for use in consumer homes. Our system improves existing home technologies (such as video chat) by providing high-quality audiovisual communication, efficient encoding mechanisms, and low end-to-end delay. Moreover, the system includes a control interface that is capable of dynamically manipulating and compositing audiovisual content streams. This innovative architectural component is required for a domestic setting, where the television acts as the main screen and multiple people gather around it. Apart from the requirements and architecture, this paper analyses the performance of our system. The results validate our architectural decisions and provide a valuable input for further research in domestic videoconferencing.

Systematic Luby Transform (SLT) codes constitute rateless codes, which are capable of adaptively adjusting their code rate depending on the channel quality without any explicit channel state information (CSI) at the transmitters. In this paper, we investigate the performance of an SLT coded wireless system communicating over a correlated fading channel within an 802.11b network. The simulation results show that the SLT coded system can achieve a 3 dB gain in term of fading deviation when fading correlation changes from 1 Hz to 5 Hz. Moreover, it is found that a system employing an SLT code can provide similar performance to other rateless codes, namely the Luby Transform (LT) code and the Random Linear Fountain Code (RLFC). However, this level of performance is achieved with a reduced number of decoding operations. A 20% reduction is achieved when the standard deviation of the fading amplitude is 10 dB and the communication distance is 7 m. Greater reductions are observed under more benign propagation conditions.

The tolerable packet-loss ratio of an Internet Protocol (IP) based wireless networks varies according to the specific services considered. File transfer for example must be error free but tolerates higher delays, whereas maintaining a low delay is typically more important in interactive Voice Over IP (VOIP) or video services. Classic Forward Error Correction (FEC) may be applied to the data to provide resilience against bit errors. A wireless IP network provides the opportunity for the inclusion of FEC at the physical, transport and application layers. The demarcation between the analogue and digital domain imposed at the Physical layer (PHY) predetermines the nature of the FEC scheme implemented at the various layers. At the PHY individual packets may be offered FEC protection, which increases the likelihood of their error-free insertion into the protocol stack. Higher layers receive packets that are error free and the purpose of a FEC scheme implemented here is to regenerate any missing packets obliterated for example by the Binary Erasure Channel (BEC) of the IP network's routers. A rateless code may be beneficially employed at a higher Open Systems Interconnection (OSI) layer for replenishing the obliterated packets, but unless the characteristics of the channel are considered, the ultimate rate achieved by such a code may be compromised, as shown in this contribution.

Grid computing aims to realize a high-performance computing environment, while increasing the usage efficiency of installed resources. This puts considerable constraints on the network technology, and ultimately has led to the development of Grids over optical networks. In this paper, we investigate the fundamental question of how to optimize the performance of such Grid networks. We start with an analysis of different architectural approaches (and their respective technological choices) to integrate Grid computing with optical networks. This results in models and algorithms to design optical Grid networks, and we show the importance to combine both dimensioning (offline) and scheduling (online) in the design phase of such systems. Finally, the concept of anycast routing is introduced and motivated. Both exact and heuristic algorithms are proposed, and their performance in terms of blocking probability and latency is presented.

Notwithstanding IP anycast's introduction in Internet standards dates back to 1993 and its more recent adoption in IPv6 standards, its use in production environments is limited to date. This is mainly because native IP anycast lacks routing scalability and does not support session-based communications, thereby limiting its applicability to single request-response services such as DNS. For this reason, we propose a transparent anycast overlay architecture that retains the strengths of native anycast and neutralizes above-mentioned limitations. The resulting proxy infrastructure unleashes the power of anycast by opening up new opportunities for transparent distributed service provisioning. Taking into account user demands, available resources, network overhead and anycast infrastructure costs, we provide near- optimal heuristics for the placement of proxy nodes and dimensioning the infrastructure in large networks. We show that even modest overlay infrastructures, consisting of a small number of proxy routers, provide an effective stateful anycast solution where the detour via the proxy routers is negligible in terms of extra network load. Furthermore, simulation results illustrate that server state aggregation in the proxy nodes lessens control plane overhead, which contributes significantly to service robustness.

As the popularity of resource-constrained devices such as hand-held computers increases, a new network service off loading complex processing tasks towards computational resources located in the access- or core network, sounds very promising. In a consumer-oriented environment, characterized by a large diversity in connected devices, a transparent network-based request processing strategy offers a clear flexibility advantage, as the installation and configuration of extra software components on all client devices can be avoided. In this work, this is achieved by linking computational resources to an any cast group, which allows intermediate router nodes to decide upon the target server. It is shown in the paper that the anycast routing problem can be reduced to unicast routing. Consequently, unicast multiple constraints routing algorithms can be applied to compute an optimal path based on several server selection criteria, including server load, path delay, path cost, etc. For this purpose, we envision the SAMCRA algorithm. A new evaluation ordering strategy for previously computed sub-paths is introduced, which guarantees optimality for the complete SAMCRA path between source and destination. Simulation results show that an effective distribution of the job scheduling requests over the available resources can be achieved by applying the described algorithm.