Fast packet switching

About: Fast packet switching is a research topic. Over the lifetime, 5641 publications have been published within this topic receiving 111603 citations.

Slotted Random Access Spread-Spectrum Networks: An Analytical Framework

Abstract: An analytic framework is proposed for the study of singlehop spread-spectrum networks using random access and packet switching under various network topologies and channel conditions. The key feature of the theory is the identification of a set of probabilistic parameters, which, based on a symmetry argument, serve to efficiently summarize the effect on performance of various network considerations such as transmitter-receiver configuration, spreadspectrum code allocation, error correction and detection mechanisms, spreading format, jamming conditions, etc. Examples investigating capture effects, coding tradeoffs, and scheduling optimizations are presented. Various previously known results are shown to be special cases of the framework that we describe.

Traffic management for ATM local area networks

Abstract: Asynchronous transfer mode (ATM) is the first switching technology to be capable of supporting circuit switching and packet switching within a single integrated switching mechanism. This was one of the research goals that led to the development of ATM. Considerable progress has already been made in implementing constant bit-rate services, similar to conventional circuit switching, over ATM. The authors briefly consider how to support LAN emulation over an ATM network and then explore how to offer the dynamic bandwidth sharing in the local area. Considerable progress has already been made in implementing constant bit-rate services, similar to conventional circuit switching, over ATM. However, the bursty nature of data traffic requires dynamic bandwidth sharing similar to packet switching, and this is still under investigation. >

Circuit switching under the radar with REACToR

Abstract: The potential advantages of optics at high link speeds have led to significant interest in deploying optical switching technology in data-center networks. Initial efforts have focused on hybrid approaches that rely on millisecond-scale circuit switching in the core of the network, while maintaining the flexibility of electrical packet switching at the edge. Recent demonstrations of microsecond-scale optical circuit switches motivate considering circuit switching for more dynamic traffic such as that generated from a top-of-rack (ToR) switch. Based on these technology trends, we propose a prototype hybrid ToR, called REACToR, which utilizes a combination of packet switching and circuit switching to appear to end-hosts as a packet-switched ToR.In this paper, we describe a prototype REACToR control plane which synchronizes end host transmissions with end-to-end circuit assignments. This control plane can react to rapid, bursty changes in the traffic from end hosts on a time scale of 100s of microseconds, several orders of magnitude faster than previous hybrid approaches. Using the experimental data from a system of eight end hosts, we calibrate a hybrid network simulator and use this simulator to predict the performance of larger-scale hybrid networks.

Packet processors and packet filter processes, circuits, devices, and systems

Abstract: A packet filter (2500) for incoming communications packets includes extractor circuitry (2510) operable to extract data from a packet, and packet processor circuitry (2520) operable to concurrently mask (3010) the packet data from the extractor circuitry (2510), perform an arithmetic/logic operation (3020) on the packet to supply a packet drop signal (DROP), and perform a conditional limit operation and a conditional jump operation (3030).

A Model for Evaluating the Performance of an Integrated Circuit- and Packet-Switched Multiplex Structure

Abstract: Recent papers have introduced a multiplexing structure for mixing voice and data traffic in an integrated telecommunications system. This structure utilizes a master frame format of a time division statistical multiplex facility. A certain portion of the frame is allocated to voice calls, and data traffic is assigned to the remaining frame capacity. To achieve a high transmission utilization, data are allowed to use any residual voice capacity momentarily available due to statistical variations in the voice traffic. The voice traffic is treated as a loss system and data packets are buffered. In this paper we derive exact analytical expressions for the key system perfomance measures, the probability of loss for voice calls, and the expected waiting time for data packets. Actually, two cases are considered, the one discussed above, called the movable boundary case, and one where the boundary is fixed; i.e., data are not allowed to utilize the residual voice capacity. The computational aspects of calculating actual numbers are discussed in some detail, and results are presented for typical cases.