Datacenter Traffic Control: Understanding Techniques and Trade-offs

Datacenters provide cost-effective and flexible access to scalable compute and storage resources necessary for today's cloud computing needs. A typical datacenter is made up of thousands of servers connected with a large network and usually managed by one operator. To provide quality access to the variety of applications and services hosted on datacenters and maximize performance, it deems necessary to use datacenter networks effectively and efficiently. Datacenter traffic is often a mix of several classes with different priorities and requirements. This includes user-generated interactive traffic, traffic with deadlines, and long-running traffic. To this end, custom transport protocols and traffic management techniques have been developed to improve datacenter network performance. In this tutorial paper, we review the general architecture of datacenter networks, various topologies proposed for them, their traffic properties, general traffic control challenges in datacenters and general traffic control objectives. The purpose of this paper is to bring out the important characteristics of traffic control in datacenters and not to survey all existing solutions (as it is virtually impossible due to massive body of existing research). We hope to provide readers with a wide range of options and factors while considering a variety of traffic control mechanisms. We discuss various characteristics of datacenter traffic control including management schemes, transmission control, traffic shaping, prioritization, load balancing, multipathing, and traffic scheduling. Next, we point to several open challenges as well as new and interesting networking paradigms. At the end of this paper, we briefly review inter-datacenter networks that connect geographically dispersed datacenters which have been receiving increasing attention recently and pose interesting and novel research problems.Comment: Accepted for Publication in IEEE Communications Surveys and Tutorial

Just a Second -- Scheduling Thousands of Time-Triggered Streams in Large-Scale Networks

Deterministic real-time communication with bounded delay is an essential requirement for many safety-critical cyber-physical systems, and has received much attention from major standardization bodies such as IEEE and IETF. In particular, Ethernet technology has been extended by time-triggered scheduling mechanisms in standards like TTEthernet and Time-Sensitive Networking. Although the scheduling mechanisms have become part of standards, the traffic planning algorithms to create time-triggered schedules are still an open and challenging research question due to the problem's high complexity. In particular, so-called plug-and-produce scenarios require the ability to extend schedules on the fly within seconds. The need for scalable scheduling and routing algorithms is further supported by large-scale distributed real-time systems like smart energy grids with tight communication requirements. In this paper, we tackle this challenge by proposing two novel algorithms called Hierarchical Heuristic Scheduling (H2S) and Cost-Efficient Lazy Forwarding Scheduling (CELF) to calculate time-triggered schedules for TTEthernet. H2S and CELF are highly efficient and scalable, calculating schedules for more than 45,000 streams on random networks with 1,000 bridges as well as a realistic energy grid network within sub-seconds to seconds

Age-of-Information in Clocked Networks

We derive key features of the Age-of-Information distribution in a system whose activities are strictly limited to periodic instances on a global time grid. In particular, one agent periodically generates updates while the other agent periodically uses the most recently received of those updates. Likewise, transmission of those updates over a network can only occur periodically. All periods may differ. We derive results for two different models: a basic one in which the mathematical problems can be handled directly and an extended model which, among others, can also account for stochastic transmission failure, making the results applicable to instances with wireless communication. For both models, a suitable approximation for the expected Age-of-Information and an upper bound for its largest occurring value are developed. For the extended model (which is the more relevant one from a practical standpoint) we also present numerical results for the distribution of the approximation error for numerous parameter choices

Adaptive buffer power save mechanism for mobile multimedia streaming

With the proliferation of wireless networks, the use of mobile devices to stream multimedia is growing in popularity. Although the devices are improving in that they are becoming smaller, more complex and capable of running more applications than ever before, there is one aspect of them that is lagging behind. Batteries have seen little development, even though they are one of the most important parts of the devices. Multimedia streaming puts extra pressure on batteries, causing them to discharge faster. This often means that streaming tasks can not be completed, resulting in significant user dissatisfaction. Consequently, effort is required to devise mechanisms to enable and increase in battery life while streaming multimedia. In this context, this thesis presents a novel algorithm to save power in mobile devices during the streaming of multimedia content. The proposed Adaptive-Buffer Power Save Mechanism (AB-PSM) controls how the data is sent over wireless networks, achieving significant power savings. There is little or no effect on the user and the algorithm is very simple to implement. The thesis describes tests which show the effectiveness of AB-PSM in comparison with the legacy power save mechanism present in IEEE 802.11. The thesis also presents a detailed overview of the IEEE 802.11 protocols and an in-depth literature review in the area of power saving during multimedia streaming. A novel analysis of how the battery of a mobile device is affected by multimedia streaming in its different stages is given. A total-power-save algorithm is then described as a possible extension to the Adaptive-Buffer Power Save Mechanism

Low-latency Networking: Where Latency Lurks and How to Tame It

While the current generation of mobile and fixed communication networks has been standardized for mobile broadband services, the next generation is driven by the vision of the Internet of Things and mission critical communication services requiring latency in the order of milliseconds or sub-milliseconds. However, these new stringent requirements have a large technical impact on the design of all layers of the communication protocol stack. The cross layer interactions are complex due to the multiple design principles and technologies that contribute to the layers' design and fundamental performance limitations. We will be able to develop low-latency networks only if we address the problem of these complex interactions from the new point of view of sub-milliseconds latency. In this article, we propose a holistic analysis and classification of the main design principles and enabling technologies that will make it possible to deploy low-latency wireless communication networks. We argue that these design principles and enabling technologies must be carefully orchestrated to meet the stringent requirements and to manage the inherent trade-offs between low latency and traditional performance metrics. We also review currently ongoing standardization activities in prominent standards associations, and discuss open problems for future research

Parallel and Distributed Computing

The 14 chapters presented in this book cover a wide variety of representative works ranging from hardware design to application development. Particularly, the topics that are addressed are programmable and reconfigurable devices and systems, dependability of GPUs (General Purpose Units), network topologies, cache coherence protocols, resource allocation, scheduling algorithms, peertopeer networks, largescale network simulation, and parallel routines and algorithms. In this way, the articles included in this book constitute an excellent reference for engineers and researchers who have particular interests in each of these topics in parallel and distributed computing

Efficient Passive Clustering and Gateways selection MANETs

Passive clustering does not employ control packets to collect topological information in ad hoc networks. In our proposal, we avoid making frequent changes in cluster architecture due to repeated election and re-election of cluster heads and gateways. Our primary objective has been to make Passive Clustering more practical by employing optimal number of gateways and reduce the number of rebroadcast packets