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.

Optical burst switching for service differentiation in the next-generation optical Internet

Abstract: In an effort to eliminate the electronic bottleneck, new optical switches/routers (hardware) are being built for the next-generation optical Internet where IP runs over an all-optical WDM layer. However, important issues yet to be addressed in terms of protocols (software) are how to develop a new paradigm that does not require any buffer at the WDM layer, as in circuit switching, and elimination of any layers between which exist mainly due to historical reasons. At the same time, such a paradigm should also efficiently support bursty traffic with high resource utilization as in packet switching. This article surveys design issues related to a new switching paradigm called optical burst switching, which achieves a balance between circuit and packet switching while avoiding their shortcomings. We describe how OBS can be applied to the next-generation optical Internet, and in particular how offset times and delayed reservation can help avoid the use of buffer, and support quality of service at the WDM layer.

Packet recovery in high-speed networks using coding and buffer management

Abstract: A technique for fiber-optic networks based on forward-error correction (FEC) that allows the destination to reconstruct missing data packets by using redundant parity packets that the source adds to each block of data packets is presented. Methods for generating several types of parity packets are described, along with decoding techniques and their implementations. Algorithms are presented for packet interleaving and selective rejection of packets from node buffers, both of which disperse missing packets among many blocks, thereby reducing the required coding complexity. Performance evaluation, by both analytic and simulation models, shows that this technique can result in a reduction of up to three orders of magnitude in the packet loss rate. >

Photonic packet switches: architectures and experimental implementations

Abstract: Photonic packet switches offer high speed, data rate and format transparency, and flexibility required by future computer communications and cell-based telecommunications networks. In this paper, we review experimental progress in state-of-the-art photonic packet switches with an emphasis on all-optical guided-wave systems. The term all-optical implies that the data portion of a packet remains in optical format from the source to the destination. While the data remain all-optical, both optical and optoelectronic techniques have been used to process packet routing functions based on extremely simple routing protocols. An overview of the design issues for all-optical photonic packet switching is given and contrasted with electronic packet switch implementations. Low-level functions that have been experimentally implemented include routing, contention resolution, synchronization, and header regeneration. System level demonstrations, including centralized photonic switching and distributed all-optical multihop networks, will be reviewed. >

Effects of Packet Losses in Waveform Coded Speech and Improvements Due to an Odd-Even Sample-Interpolation Procedure

Abstract: We have studied the effects of random packet losses in digital speech systems based on 12-bit PCM and 4-bit adaptive DPCM coding. The effects are a function of packet length B and probability of packet loss P L . We have also studied tbe benefits of an odd-even sample-interpolation procedure that mitigates these effects (at the cost of increased decoding delay). The procedure is based on arranging a 2B -block of codewords into two B -sample packets, an odd-sample packet and an even-sample packet. If one of these packets is lost, the odd (or even) samples of the 2B -block are estimated from the even (or odd) samples by means of adaptive interpolation. Perceptual considerations indicate that packet lengths most robust to losses are in the range 16-32 ms, irrespective of whether interpolation is used or not. With these packet lengths, tolerable P L values, which are strictly input-speech-dependent, can be as high as 2 to 5 percent without interpolation and 5 to 10 percent with interpolation. These observations are based on a computer simulation with three sentence-length speech inputs, and on informal listening tests.

Techniques for Packet Voice Synchronization

Abstract: Packet switching has been proposed as an effective technology for integrating voice and data in a single network. An important aspect of packet-switched voice is the reconstruction of a continuous stream of speech from the set of packets that arrive at the destination terminal, each of which may encounter a different amount of buffering delay in the packet network. The magnitude of the variation in delay may range from a few milliseconds in a local area network to hundreds of milliseconds in a long-haul packet voice and data network. This paper discusses several aspects of the packet voice synchronization problem, and techniques that can be used to address it. These techniques estimate in some way the delay encountered by each packet and use the delay estimate to determine how speech is reconstructed. The delay estimates produced by these techniques can be used in managing the flow of information in the packet network to improve overall performance. Interactions of packet voice synchronization techniques with other network design issues are also discussed.