Networking in distributed real-time systems.

Distributed computing systems are increasingly being used for many critical real-time applications. In these systems, large or unpredictable delays in the delivery of messages can adversely affect the execution of tasks dependent on these messages. Consequently, there are usually deadlines associated with messages between cooperating processes. The goal of this dissertation is to design and develop a communication scheme for a distributed real-time system which guarantees the delivery of messages within certain deadline constraints. We are particularly interested in systems with partially connected point-to-point interconnection networks, mainly due to their potential for high performance and fault tolerance. This dissertation also presents solutions to several other important problems related to communication in systems with this type of interconnection. We first present an abstraction called a real-time channel which provides a mechanism for expressing the timing constraints and other requirements for inter-process communication. We develop methods to compute worst-case delays and buffer space requirements for messages belonging to real-time channels, so that their delivery time can be guaranteed. Following this, we deal with the problem of routing in networks with virtual cut-through switching. In this mode of switching, the message delivery delay depends upon the number of times that a message gets buffered at intermediate nodes on the route. We develop algorithms to select routes that balance the network load and minimize the number of times that a message gets buffered. To increase the efficiency of broadcasting, which is an important issue in point-to-point networks, we develop a broadcast primitive that can be easily integrated into the switching hardware. Using this primitive, we then develop a family of algorithms for broadcasting in mesh-connected networks. These algorithms ensure reliable delivery in the presence of possibly unknown network failures. Finally, we present the design and implementation of a communication subsystem for HARTS, which is an experimental distributed real-time system being developed in the Real-Time Computing Laboratory. This subsystem makes use of a communication coprocessor to offload communication overheads from the main processors. Among other things, it supports real-time channels and provides a global time-base for the system.Ph.D.Computer Science and EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/105726/1/9208576.pdfDescription of 9208576.pdf : Restricted to UM users only

Explicit TCP Rate Shaping: Architecture and Applications

The emergence of new applications, the increasing differences in bandwidth between intra-nets and the Internet, and the introduction of Quality of Service differentiation has changed the requirements for the underlying Transport Control Protocol TCP. This paper uses two types of applications to demonstrate weaknesses of TCP that can lead to a degradation of network service in the perception of a user/application: Streaming applications often use HTTP/TCP to avoid blocking by firewalls. Instead of a high throughput these applications depend on small packet loss rates and reduced jitter to play out frames in real time. We show that regular TCP does not allow these applications to perform well. Bulk TCP data transfer in intra-nets can cause the throughput to drop significantly if socket buffers are not chosen carefully and differently from connections over long fat pipes. In both cases the window based flow control of TCP constantly tries to probe for the maximum bandwidth available, whic..

Performance Issues in WWW Servers

This paper evaluates performance issues in WWW servers on UNIX-style platforms. While other work has focused on reducing the use of kernel primitives, we consider ways in which the operating system and the network protocol stack can improve support for high-performance WWW servers. We study techniques in 3 categories: new socket functions, per-byte optimizations, and per-connection optimizations. We examine two proposed socket functions, acceptex() and send file(), comparing send file()'s effectiveness with an mmap()/writev()combination. We show how send file()provides the necessary semantic support to eliminate copies and checksums in the kernel, and quantify the utility of the function's header and close options. We also present mechanisms to reduce the number of packets exchanged in an HTTP transaction, both increasing server performance and reducing network utilization, without compromising interoperability. We evaluate these issues with a high-performance WWW server, using IBM AIX ..

Protocol Architecture for Multimedia Applications over ATM Networks

At the data-link layer, ATM offers a number of features, such as high-bandwidth and per-session quality of service (QoS) guarantees, making it particularly attractive to multimedia applications. Unfortunately, many of these features are not visible to applications because of the inadequacies of existing higher-level protocol architectures. Although there is considerable effort underway to tune these protocols for ATM networks, we believe that a new ATM specific protocol stack is essential to effectively exploit all the benefits of ATM. In this paper we describe the semantics of such a protocol stack, and discuss its advantages over traditional protocol architectures from the perspective of multimedia applications. The performance impact of the new protocol architecture is experimentally demonstrated on a video conferencing testbed built around IBM RS/6000s equipped with prototype hardware for video/audio processing, and connected via ATM links. 1 Introduction At the data-link layer,..

Downloading and Stream Conversion: Supporting Interactive Playout of Videos in a Client Station

In this paper we address the problem of supporting interactive playout, both forward and backward, of an MPEG encoded video stream at a player device. We propose a method for transforming the standard MPEG stream to a local form at the player device, which then enables the device to support interactive playout even when the buffer space available is constrained. Specifically, we devise a stream conversion scheme that encodes P frames as I frames after the decompression and playout of each P frame. Such a scenario of transforming a P frame to an I frame is termed P-I conversion. Note that since this P-I conversion is performed after a P frame is decompressed and played out, there is no extra cost required for decoding. Also, since there is no motion estimation and compensation required for compressing a single frame into an I frame, this I frame encoding is done very efficiently. We have evaluated several potential interactive playout methods using video experiments. P-I conversion is s..

Exploring the Performance Impact of QoS Support in TCP/IP Protocol Stacks

Significant efforts are being made by the Internet Engineering Task Force (IETF) to enhance the service model of the Internet to support integrated services for voice, video, and data transport. This is being done via a new resource reservation protocol (RSVP) and associated service classes for handling of traffic at network routers and end hosts. Given that the new service model is expected to be widely deployed and utilized, it is important to understand the extent and nature of overheads imposed relative to the best-effort data path. This paper explores the performance impact of supporting QoS guarantees on communication in TCP/IP protocol stacks at end hosts, in the context of an RSVP-based QoS architecture for an integrated services Internet developed and implemented earlier by the authors. We first demonstrate the efficacy of the architecture in providing the desired QoS to individual connections via application-level experiments on an ATM network. In these experiments we show th..

RSVP and Integrated Services in the Internet

This paper presents the design and implementation of a quality of service architecture for the Internet. The architecture is based on the emerging standards for resource reservation in the Internet, namely the RSVP protocol and the associated service specifications defined by the Internet Engineering Task Force (IETF). Our architecture represents a major functional enhancement to the traditional sockets based communication subsystem, while preserving application programming interface and binary compatibility with existing applications. It is scalable and supports a wide variety of network interfaces ranging from legacy LAN interfaces, such as Token Ring and Ethernet, to high-speed ATM interfaces. 1 Introduction As audio and video annotations become common features on Web pages and as applications like InternetPhone, NetRadio, and WebTV become ubiquitous on the Internet, the need for "better than best effort" network connectivity will become inevitable. To address this, the Internet En..

On the Performance Impact of Supporting QoS . . .

this paper, we address the issues related to the impact of QoS communications on protocol stack performance in large Internet servers. A QoS-enhanced protocol stack requires various additional components in both control and data planes. The control plane components are responsible for traffic and resource management, admission control, and signaling. On the data plane, the additional functionality includes traffic classification to associate individual packets to application flows/reservations, traffic enforcement via policing and shaping, and packet queueing and scheduling. In this paper, we focus on the performance impact of the components on the data plane. In the rest of this abstract, we present (i) a brief overview of the QoS architecture, (ii) quantify the data path overheads introduced by various QoS components, and (iii) identify possible approaches to mask and/or reduce some of these overheads. The performance profiling has been performed on a prototype implementation of our QoS architecture on rs/6000 based servers running ai