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.

Fault detection filter design for switched systems with quantisation effects and packet dropout

Abstract: The problem of fault detection for switched systems with quantisation effects and packet dropout is presented in this study. A dynamic quantiser is introduced, which is composed of a dynamic scaling and a static quantiser. Since a novel switched system is modelled according to packet dropout, a switching strategy which combines average dwell time switching with event-driven switching is proposed. The systems performance and the relationship between the switching signal and the packet dropout rate are simultaneously developed. Furthermore, sufficient conditions for the existence of fault detection filters are given in the framework of linear matrix inequality, and the filter gains and the quantiser range are derived by a convex optimised method. Finally, two illustrative examples demonstrate the effectiveness of the proposed method.

System and method for packet processor status monitoring

Abstract: Disclosed herein are a system and method for status monitoring, including debug error detection, during data packet processing. In general terms, the system for status monitoring during data packet processing can be implemented as a system including a packet processor and a buffer. The packet processor generates processing data based on one or more control structures while revising packet data. The packet processor generates the processing data while performing one or more lookup cycles. The buffer records the processing data and the status of the one or more control structures. The processing data includes a lookup number and the lookup number identifies the number of cycles performed by the packet processor.

Effective packet loss estimation on VoIP jitter buffer

Abstract: The paper deals with an influence of network jitter on effective packet loss in dejitter buffer We analyze behavior of jitter buffers with and without packet reordering capability and quantify the additional packet loss caused by packets dropped in buffer on top of the measured network packet loss We propose substitution of packet loss parameterP pl in ITU-T E-Model by effective packet loss P plef incorporating network jitter, a jitter buffer size and a packet size as additional input parameters for E-Model

Method and apparatus for buffering data within stations of a communication network with mapping of packet numbers to buffer's physical addresses

Abstract: Method and apparatus for buffering data packets in a data communication controller environment. In general, the communication controller is interfaceable with a host processor and includes a control unit for accessing a communication medium. Each data packet to be transmitted or received is assigned a unique packet number. Packet number assignment is carried out by a memory management unit which dynamically allocates to each assigned packet number, one or more pages in data packet buffer memory for the storage of the corresponding data packet. If requested storage space is unavailable at the time of request, the memory management unit will allocate a page or pages to an available packet number as the pages become free. Upon issuing the assigned packet number, the physical addresses of the allocated pages of buffer memory storage space are generated in a manner transparent to both the host processor and the control unit. With these physical addresses, a data packet can be accessed from buffer memory, in a simple manner. Upon completion of each data packet loading operation, the corresponding packet number is stored in a packet number queue maintained for subsequent retrieval in order to generate the physical addresses at which the corresponding data packet has been stored.

Apparatus for generating and restoring RTP packet and method thereof

Abstract: An apparatus and method to generate and restore an RTP (Real-Time Transmission Protocol) packet. A setting unit assigns a CTS (Composition TimeStamp), a DTS (Decoding TimeStamp), and a PSN (Packet Sequence Number) that sequentially increase according to a packet generation order for each of a plurality of SL (Synchronization Layer) packets, extracting a time stamp length and a packet sequence number length from an SLCD (SL Configuration Descriptor) within each SL packet. A packet generating unit generates a header of the SL packet accommodated in an RTP packet header and the RTP packet based on the CTS, the DTS, the PSN, the time stamp length and the packet sequence number length. Since only difference values in the CTS, the DTS, and the PSN information between a previous SL packet and the present SL packet, are recorded, a number of bits can be reduced if the CTS value rolls over and a multiple SL packet can be made for the SL packet having a time stamp length greater than 32 bits. Also, a condition that a DTS delta value should always be a positive number is met.