Packet loss

About: Packet loss is a research topic. Over the lifetime, 21235 publications have been published within this topic receiving 302453 citations.

Evaluating the limitations of and alternatives in beaconing

Abstract: In position-based routing protocols, each node periodically transmits a short hello message (called beacon) to announce its presence and position. Receiving nodes list all known neighbor nodes with their position in the neighbor table and remove entries after they have failed to receive a beacon for a certain time from the corresponding node. In highly dynamic networks, the information stored in the neighbor table is often outdated and does no longer reflect the actual topology of the network causing retransmissions and rerouting that consume bandwidth and increase latency. An analysis on the possible impact of beacons due outdated and inaccurate neighbor tables is needed. We quantify by analytical and simulation means the possible performance loss and explore the limitations of position-based routing protocols which use beaconing. In highly mobile ad-hoc networks, the delay can increase by a factor of 20. The neighbor table inaccuracy is the main source of packet loss in uncongested networks. We propose and evaluate several concrete mechanisms to improve the accuracy of neighborhood information, e.g., by dynamic adaptation of the timer values when beacons are broadcasted, and show their effectiveness by extensive simulation.

Selection of receive-queue based on packet attributes

Abstract: According to embodiments of the invention, there is provided a method for operating a network processor. The network processor receiving a first data packet in a stream of data packets and a set of receive-queues adapted to store receive data packets. The network processor processing the first data packet by reading a flow identification in the first data packet; determining a quality of service for the first data packet; mapping the flow identification and the quality of service into an index for selecting a first receive-queue for routing the first data packet; and utilizing the index to route the first data packet to the first receive-queue.

Methods and apparatus for analyzing and management of application traffic on networks

Abstract: An apparatus and method are provided for analyzing traffic on a network by monitoring packets sent between devices on the network and identifying applications occurring between devices on the network based on information derived from monitoring the packets. Techniques are provided to examine header information of the packets, such as information in the header of Internet Protocol (IP) packets, to identify applications that are occurring on the network. In some cases, information about the packet beyond the header information is examined to match a packet to a particular application. Using these techniques, a list is built of all of the applications occurring between devices on the network. Parameters may be generated to track one or more of the response time, latency and traffic volume associated with a particular device on the network.

Method and apparatus for selectively discarding packets

Abstract: In a packet voice system, discarding of a packet is performed as a function of previously discarded packets. In one embodiment, a packet voice system includes an ATM Adaptation Layer Type 2 (AAL2) and Service Specific Convergence Sublayer (SSCS) System. In this system, a transmission buffer stores AAL2 voice packets for transmission, each AAL2 voice packet comprising a sequence number, the values of which range from 0 to n−1, and a source identifier, k. When traffic congestion is detected, the transmitter portion of the SSCS System selectively discards one packet from a source k at the output of the transmission buffer if no packet from source k was dropped in either the last n−1 packets or over a predefined prior interval of time. Another embodiment of the invention discards packets at the input of the transmission buffer.

Fec architecture for streaming services including symbol based operations and packet tagging

Abstract: In a packet communications system stream data is transported over a channel over which packet loss or corruption is possible, with forward error correction (“FEC”) information. A transmitter receives source packets comprising source data, generates FEC source packets formatted to allow for identification of lost or corrupted source packets at a receiver, arranges source data from the source packets into a plurality of source symbols wherein at least one source packet is arranged into more than one source symbol, associates a plurality of source symbols with a source block, generates a plurality of repair symbols from the source block according to a predetermined FEC encoding process and groups the plurality of repair symbols into one or more FEC repair packets associated with the source block. A receiver can use the FEC repair symbols from the FEC repair packets to recover source symbols, as needed.