High-speed Networking Protocols Research Articles

A Framework of High-Speed Network Protocol Fuzzing Based on Shared Memory

A Framework of High-Speed Network Protocol Fuzzing Based on Shared Memory

A Packet Drop Guesser Module for Congestion Control Protocols for High speed Networks

Different high speed Transport layer protocols have been designed and proposed in the literature to improve the performanceof standard TCP on high BDP links. They are mainly different in their increase and decrease formulas of their respective congestion control algorithm. Most of these high speed protocols consider every packet drop in the network as an indication of congesti on and they immediately reduce their congestion window size. Such an approach will usually result in under utilization of available bandwidth in case of noisy channel conditions. We take CUBIC as a test case and have compared its performance in case of normal and noisy channel conditions. The throughput of CUBIC was drastically degraded from 50Mbps to 0.5Mbps when we introduced a random packet drops with 0.001 probability. When the probability of the packet drops increases then the throughput gets decreases . Indeed, we need to complement existing congestion control algorithms with some intelligent mechanisms that can differentiate whether a certain packet drop is because of congestion or channel error thus avoid unnecessary window reduction. In order to distinguish between packets drops, we have developed a k -NN based module to guess whether the packet drops are due to the congestion or any other reasons. After integrating this module with CUBIC algorithm, we have observed signi ficant performance improvement.

Different Protocols for High Speed Networks

New challenges arise with the presence of various types of physical links, such as wireless networks, high speed and satellite in today’s ever-changing network. It is clear that the TCP throughput deteriorates in high-speed networks with large bandwidth-delay product, and new congestion control algorithms have been proposed to address such deterioration. Traditional TCP protocols treat all packet loss as a sign of congestion. Their inability to recognize non-congestion related packet loss has significant effects on the communication efficiency. The proposed protocols such as TCP Adaptive Westwood, Scalable TCP, HS-TCP, BIC-TCP, FAST-TCP and H-TCP all have some improvement in functionality over the traditional TCP protocols. This survey gives a summarization of all the protocols for high speed networks.

Improving the compression and encryption of images using FPGA-based cryptosystems

Compression and encryption technologies are important to the efficient solving of network bandwidth and security issues. A novel scheme, called the Image Compression Encryption Scheme (ICES), is presented. It combines the Haar Discrete Wavelet Transform (DWT), Significance-Linked Connected Component Analysis (SLCCA), and the Advance Encryption Standard (AES). Because of above reason the ICES efficiently reduce the overall processing time. This study develops a novel hardware system to compress and encrypt an image in real-time using an image compression encryption scheme. The proposed system exploits parallel processing to increase the throughout of the cryptosystem for Internet multimedia applications to implement the ICES. Using hardware acceleration for encryption and decryption, the FPGA implementation of DWT, SLCCA and the AES algorithm can be used. Using a pipeline structure, a very high data throughput of 330 Mbit/s at a clock frequency of 40 MHz was obtained. Therefore, the ICES is secure, fast and suited to high speed network protocols such as ATM (Asynchronous Transfer Mode), FDDI (Fiber Distributed Data Interface) or Internet multimedia applications.

Performance evaluation of high speed network protocols by emulation on a versatile architecture

The goal of this study is to validate a new simulation technique for performance evaluation of discrete time queuing networks. This technique uses a versatile architecture, which has changed from its primary purpose: circuit emulation in the design flow of chips. It is shown that this technique can be used to highlight rare events, such as realistic packet loss probability in high-speed switched networks.

Parallel architectures for processing high speed network signaling protocols

We study the effectiveness of different parallel architectures for achieving the high throughputs and low latencies needed in processing signaling protocols for high speed networks. A key performance issue is the trade off between the load balancing gains and the call record management overhead. Arranging processors in large groups potentially yields higher load balancing gains but also incurs higher overhead in maintaining consistency among the replicated copies of the call records. We study this tradeoff and its impact on the design of protocol processing systems for two generic classes of parallel architectures, namely, shared memory and distributed memory architectures. In shared memory architectures, maintaining a common message queue in the shared memory can provide the maximal load balancing gains. We show, however, in order to optimize performance it is necessary to organize the processors in small groups since large groups result in higher call record management overhead. In distributed memory architectures with each processor maintaining its own message queue there is no inherent provision for load balancing. Based on a detailed simulation analysis we show that organizing the processors into small groups and using a simple distributed load balancing scheme yields modest performance gains even after call record management overheads are taken into account. We find that the common message queue architecture outperforms the distributed architecture in terms of lower response time due to its improved load balancing capability. Finally, we do a fault-tolerance analysis with respect to the call-record data structure. Using a simple failure recovery model of the processors and the local memory, we show that in the case of shared memory architecture, the availability is also optimized when processors are organized in small groups. This is because when comparing architectures the higher call record management overhead incurred for larger group sizes must be accounted for as system unavailability.

A 177 Mb/s VLSI implementation of the International Data Encryption Algorithm

A VLSI implementation of the International Data Encryption Algorithm is presented. Security considerations led to novel system concepts in chip design including protection of sensitive information and on-line failure detection capabilities. BIST was instrumental for reconciling contradicting requirements of VLSI testability and cryptographic security. The VLSI chip implements data encryption and decryption in a single hardware unit. All important standardized modes of operation of block ciphers, such as ECB, CBC, CFB, OFB, and MAC, are supported. In addition, new modes are proposed and implemented to fully exploit the algorithm's inherent parallelism. With a system clock frequency of 25 MHz the device permits a data conversion rate of more than 177 Mb/s. Therefore, the chip can be applied to on-line encryption in high-speed networking protocols like ATM or FDDI.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The DTM Gigabit Network

DTM is a set of protocols for high-speed networks, based on bandwidth reservation and with support for dynamic reallocation of bandwidth. It is designed for real-time multimedia applications and for high-speed computer communication. DTM uses a novel medium-access technique and provides a multicast, fast circuit-switched service. Several DTM networks can be connected into one large network. A prototype implementation and testbed is being constructed.

Protocols for high-speed networks: some questions and a few answers

Abstract A personal view of the goals and challenges of gigabit networking is presented. The paper takes the form of a series of questions and attempts to answer (or characterize the possible answers to) the questions.

Performance Improvement in Broadband Networks Using Forward Error Correction for Lost Packet Recovery

In this paper we analyze and provide simulation results for the use of forward error control (FEC) to improve the delay-throughput performance of packetized high-speed networks. The major source of errors in high-speed networks is expected to be buffer overflow during congested conditions, resulting in lost packets. A single lost or errored packet will have to be retransmitted, or may even cause the window it belongs to to be retransmitted, causing a large delay. In high-speed networks, as in satellite and deep-space systems, the effect of retransmission delays is greatly amplified by the small ratio of packet duration to propagation delay. Consequently, the performance of delay sensitive applications, such as distributed processing, will be degraded by the retransmissions associated with the conventional error detection and retransmission (ARQ) protocols. FEC can be used to make the performance of the end-to-end system much less sensitive to packet loss. The result is a significant increase in network throughput and an associated decrease in delay, since retransmissions are avoided. Also, reliable transmission might permit simpler higher-layer processing. Because of the performance gains described above, the use of FEC is a strong candidate for inclusion in high-speed network protocols for delay and loss sensitive applications.

Message authentication with one-way hash functions

Fast message integrity and authentication services are much desired in today's high-speed network protocols. Current message authentication techniques are mostly encryption-based which is undesirable for several reasons. In this brief paper, we introduce encryption-free message authentication based entirely on fast one-way hash functions. Two methods are presented and their strength is analyzed. The security of the proposed methods is based on the strength of the underlying one-way hash function.

Performance of trunk grouping in packet switch design

This paper studies the performance of trunk grouping in packet switch system design, with emphasis on the analysis of maximum throughput, input queue delay and packet loss rate. The trunk grouping technique can be implemented on both sides of the switch. In principle, the output trunk grouping relieves traffic output contentions, while the input trunk grouping, proposed in this paper, prevents individual input links from overloading. The study shows a significant advantage of both input and output trunk groupings in removing local congestions caused by individual links, especially in a highly nonuniform traffic environment. To implement trunk grouping, we suggest not to designate the connection of each virtual circuit to individual links in high speed network protocol design.

Machnet: a simple access protocol for high speed or long haul communications

In high-speed networks, the ratio of the end-to-end propagation delay to the transmission delay may exceed one. Under these conditions, neither token-passing nor conventional CSMA/CD schemes can work efficiently. Previous work on access protocols for high-speed networks is generally based on round-robin service and can only operate on unidirectional media. This paper introduces new high-speed access protocols which can work on various LAN's topologies (star, tree, unidirectional media) and also on satellite networks. Based on a tree algorithm with deferred collision detection, this protocol includes mechanisms which reduce collisions and increase throughput. The maximum channel utilization can reach 100% whatever the propagation delay and the total connected population may be.

A survey of light-weight transport protocols for high-speed networks

A comparative survey is presented of techniques used at the transport layer in eight representative protocols, most of which were designed to improve the protocol processing rate. The protocols are the relevant portions of the APPN, Datakit, Delta-t, NETBLT, OSI/TP4, TCP, VMTP, and XTP architectures. The protocols are described, and the functions under consideration are defined. No distinction is made as to whether these functions are carried out in a LAN, MAN, or WAN environment. The objective is to provide reliable, end-to-end transmission of data. The mechanisms required to support connection management, acknowledgements, flow control, and error handling are examined. Suitable techniques for designing light-weight transport protocols are identified. A discussion is presented as to which technique seems the most promising.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Implementation of physical and media access protocols for high-speed networks

Existing protocols for high-speed local area networks (HSLANs) and metropolitan area networks (MANs) are dealt with from an implementation standpoint. Emphasis is put on the lowest layers of the ISO OSI (Open Systems Interconnection) Reference Model, i.e. the physical layer and media access control sublayer of the data-link layer. Seven representative state-of-the-art HSLAN and MAN media-access protocols are surveyed and classified, and implementations of these protocols that are used in prototype and commercial networks are analyzed. The complexity, technology, and performance of the implementation are described and compared.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>