tions. Bootstrap has found many applications in engineering field, including artificial neural networks, biomedical engineering, environmental engineering, image processing, and radar and sonar signal processing. Basic concepts of the bootstrap are summarized in each section as a step-by-step algorithm for ease of implementation. Most of the applications are taken from the signal processing literature. The principles of the bootstrap are introduced in Chapter 2. Both the nonparametric and parametric bootstrap procedures are explained. Babu and Singh (1984) have demonstrated that in general, these two procedures behave similarly for pivotal (Studentized) statistics. The fact that the bootstrap is not the solution for all of the problems has been known to statistics community for a long time; however, this fact is rarely touched on in the manuscripts meant for practitioners. It was first observed by Babu (1984) that the bootstrap does not work in the infinite variance case. Bootstrap Techniques for Signal Processing explains the limitations of bootstrap method with an example. I especially liked the presentation style. The basic results are stated without proofs; however, the application of each result is presented as a simple step-by-step process, easy for nonstatisticians to follow. The bootstrap procedures, such as moving block bootstrap for dependent data, along with applications to autoregressive models and for estimation of power spectral density, are also presented in Chapter 2. Signal detection in the presence of noise is generally formulated as a testing of hypothesis problem. Chapter 3 introduces principles of bootstrap hypothesis testing. The topics are introduced with interesting real life examples. Flow charts, typical in engineering literature, are used to aid explanations of the bootstrap hypothesis testing procedures. The bootstrap leads to second-order correction due to pivoting; this improvement in the results due to pivoting is also explained. In the second part of Chapter 3, signal processing is treated as a regression problem. The performance of the bootstrap for matched filters as well as constant false-alarm rate matched filters is also illustrated. Chapters 2 and 3 focus on estimation problems. Chapter 4 introduces bootstrap methods used in model selection. Due to the inherent structure of the subject matter, this chapter may be difficult for nonstatisticians to follow. Chapter 5 is the most impressive chapter in the book, especially from the standpoint of statisticians. It provides real data bootstrap applications to illustrate the theory covered in the earlier chapters. These include applications to optimal sensor placement for knock detection and land-mine detection. The authors also provide a MATLAB toolbox comprising frequently used routines. Overall, this is a very useful handbook for engineers, especially those working in signal processing.

Probability and Random Processes

Studies stochastic models of queueing, reliability, inventory, and sequencing in which random influences are considered. One stochastic mode--rl is approximated by another that is simpler in structure or about which simpler assumptions can be made. After general results on comparison properties of random variables and stochastic processes are given, the properties are illustrated by application to various queueing models and questions in experimental design, renewal and reliability theory, PERT networks and branching processes.

https://link.springer.com/content/pdf/10.1057%2Fjors.1984.224.pdf

Comparison Methods for Queues and Other Stochastic Models

Many network applications, eg, industrial control, demand ultra-low latency (ULL) However, traditional packet networks can only reduce the end-to-end latencies to the order of tens of milliseconds The IEEE 8021 time sensitive networking (TSN) standard and related research studies have sought to provide link layer support for ULL networking, while the emerging IETF deterministic networking (DetNet) standards seek to provide the complementary network layer ULL support This paper provides an up-to-date comprehensive survey of the IEEE TSN and IETF DetNet standards and the related research studies The survey of these standards and research studies is organized according to the main categories of flow concept, flow synchronization, flow management, flow control, and flow integrity ULL networking mechanisms play a critical role in the emerging fifth generation (5G) network access chain from wireless devices via access, backhaul, and core networks We survey the studies that specifically target the support of ULL in 5G networks, with the main categories of fronthaul, backhaul, and network management Throughout, we identify the pitfalls and limitations of the existing standards and research studies This survey can thus serve as a basis for the development of standards enhancements and future ULL research studies that address the identified pitfalls and limitations

Ultra-Low Latency (ULL) Networks: The IEEE TSN and IETF DetNet Standards and Related 5G ULL Research

In this survey, we present state-of-the-art bitrate adaptation algorithms for HTTP adaptive streaming (HAS). As a key distinction from other streaming approaches, the bitrate adaptation algorithms in HAS are chiefly executed at each client, i.e. , in a distributed manner. The objective of these algorithms is to ensure a high quality of experience (QoE) for viewers in the presence of bandwidth fluctuations due to factors like signal strength, network congestion, network reconvergence events, etc. While such fluctuations are common in public Internet, they can also occur in home networksor even managed networks where there is often admission control and QoS tools. Bitrate adaptation algorithms may take factors like bandwidth estimations, playback buffer fullness, device features, viewer preferences, and content features into account, albeit with different weights. Since the viewer’s QoE needs to be determined in real-time during playback, objective metrics are generally used including number of buffer stalls, duration of startup delay, frequency and amount of quality oscillations, and video instability. By design, the standards for HAS do not mandate any particular adaptation algorithm, leaving it to system builders to innovate and implement their own method. This survey provides an overview of the different methods proposed over the last several years.

/pdf/a-survey-on-bitrate-adaptation-schemes-for-streaming-media-u6c6xtu7aa.pdf

A Survey on Bitrate Adaptation Schemes for Streaming Media Over HTTP

Software defined networking (SDN) has emerged as a promising paradigm for making the control of communication networks flexible. SDN separates the data packet forwarding plane, i.e., the data plane, from the control plane and employs a central controller. Network virtualization allows the flexible sharing of physical networking resources by multiple users (tenants). Each tenant runs its own applications over its virtual network, i.e., its slice of the actual physical network. The virtualization of SDN networks promises to allow networks to leverage the combined benefits of SDN networking and network virtualization and has therefore attracted significant research attention in recent years. A critical component for virtualizing SDN networks is an SDN hypervisor that abstracts the underlying physical SDN network into multiple logically isolated virtual SDN networks (vSDNs), each with its own controller. We comprehensively survey hypervisors for SDN networks in this paper. We categorize the SDN hypervisors according to their architecture into centralized and distributed hypervisors. We furthermore sub-classify the hypervisors according to their execution platform into hypervisors running exclusively on general-purpose compute platforms, or on a combination of general-purpose compute platforms with general- or special-purpose network elements. We exhaustively compare the network attribute abstraction and isolation features of the existing SDN hypervisors. As part of the future research agenda, we outline the development of a performance evaluation framework for SDN hypervisors.

Survey on Network Virtualization Hypervisors for Software Defined Networking

The aim of the stochastic network calculus is to comprehend statistical multiplexing and scheduling of non-trivial traffic sources in a framework for end-to-end analysis of multi-node networks. To date, several models, some of them with subtle yet important differences, have been explored to achieve these objectives. Capitalizing on previous works, this paper contributes an intuitive approach to the stochastic network calculus, where we seek to obtain its fundamental results in the possibly easiest way. In detail, the method that is assembled in this work uses moment generating functions, known from the theory of effective bandwidths, to characterize traffic arrivals and network service. Thereof, affine envelope functions with an exponentially decaying overflow profile are derived to compute statistical end-to-end backlog and delay bounds for networks.

A Guide to the Stochastic Network Calculus

QUIC is the emerging transport layer protocol, providing encrypted, stream-multiplexed, low-latency data transfer. In this paper, we propose multipath-enabled QUIC (MPQUIC) to leverage multiple network interfaces, such as WiFi and LTE on today's mobile devices. We show how our MPQUIC design conceptually evolves beyond existing multipathing protocols, such as MPTCP, as it provides fine-grained stream-to-path scheduling, reduced head-of-line blocking, and faster subflow establishment. We present an userland implementation of MPQUIC that is deployable without operating system changes. Our evaluation results show that MPQUIC increases throughput in comparison to traditional QUIC, TCP and even the currently de facto multipath transport protocol MPTCP. First real world measurements confirm that MPQUIC is deployable in the Internet to reduce download times. Moreover, we show that MPQUIC's conceptual advantages over MPTCP efficiently reduce head-of-line blocking in heterogeneous environments. With multipathing support, QUIC is ready to become the universal stream transport protocol in today's Internet.

Multipath QUIC: A Deployable Multipath Transport Protocol

The application-layer based control loops of dynamic adaptive streaming over HTTP (DASH) make video bitrate selection a complex problem. In this work, we review and present new insights into the challenges of DASH rate adaptation. We identify several critical issues that contribute to the degradation of DASH performance with respect to the rate control loops of DASH and TCP. We then introduce a novel DASH quality adaptation algorithm SQUAD, which is specifically designed to ensure high quality of experience (QoE). We implement and test our algorithm together with a number of state-of-the-art quality adaptation algorithms. Through extensive experiments on both testbed and cross-Atlantic Internet scenarios, we show that by sacrificing little to none in average quality bitrate, SQUAD provides significantly better QoE in terms of number and magnitude of quality switches.

SQUAD: a spectrum-based quality adaptation for dynamic adaptive streaming over HTTP

Network function (NF) virtualization decouples NFs from the underlying middlebox hardware and promotes their deployment on virtualized network infrastructures. This essentially paves the way for the migration of NFs into clouds (i.e., NF-as-a-Service), achieving a drastic reduction of middlebox investment and operational costs for enterprises. In this context, service chains (expressing middlebox policies in the enterprise network) should be mapped onto datacenter networks, ensuring correctness, resource efficiency, as well as compliance with the provider’s policy. The network service embedding (NSE) problem is further exacerbated by two challenging aspects: 1) traffic scaling caused by certain NFs (e.g., caches and WAN optimizers) and 2) NF location dependencies. Traffic scaling requires resource reservations different from the ones specified in the service chain, whereas NF location dependencies, in conjunction with the limited geographic footprint of NF providers (NFPs), raise the need for NSE across multiple NFPs. In this paper, we present a holistic solution to the multi-provider NSE problem. We decompose NSE into: 1) NF-graph partitioning performed by a centralized coordinator and 2) NF-subgraph mapping onto datacenter networks. We present linear programming formulations to derive near-optimal solutions for both problems. We address the challenging aspect of traffic scaling by introducing a new service model that supports demand transformations. We also define topology abstractions for NF-graph partitioning. Furthermore, we discuss the steps required to embed service chains across multiple NFPs, using our NSE orchestrator (Nestor). We perform an evaluation study of multi-provider NSE with emphasis on NF-graph partitioning optimizations tailored to the client and NFPs. Our evaluation results further uncover significant savings in terms of service cost and resource consumption due to the demand transformations.

/pdf/multi-provider-service-chain-embedding-with-nestor-cv1x6o15ym.pdf

Multi-Provider Service Chain Embedding With Nestor

Many of today's Internet applications such as mobile web browsing and live video streaming are delay and throughput sensitive. In face of the great success of cellular networking, especially with the advent of the high-speed LTE access tech-nology, it is noteworthy that there is little consensus on the performance experienced by applications running over cellular networks. In this paper we present application-level performance results measured in a major commercial LTE network. We replicate measurements in a wired access network to provide a reference for the wireless results. We investigate the performance of common web application scenarios over LTE. In addition, we deploy controlled measurement nodes to discover transparent middleboxes in the LTE network. The introduction of middle-boxes to LTE results in a faster connection establishment on the client side and notable performance gain for HTTP. However, this improvement comes at the price of ambiguity as some middlebox operations may introduce unnecessary timeouts. Further, we pinpoint LTE specific delays that arise from network signalling, energy saving algorithms and Hybrid Automatic Repeat reQuest (HARQ). Our analysis provides insights into the interaction between transport protocols and LTE.

Amr Rizk

Papers

A Guide to the Stochastic Network Calculus

Multipath QUIC: A Deployable Multipath Transport Protocol

SQUAD: a spectrum-based quality adaptation for dynamic adaptive streaming over HTTP

Multi-Provider Service Chain Embedding With Nestor

A measurement study on the application-level performance of LTE