Packet loss

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

Forward error correction system for packet based data and real time media, using cross-wise parity calculation

Abstract: A computationally simple yet powerful forward error correction code scheme for transmission of real-time media signals, such as digitized voice, video or audio, in a packet switched network, such as the Internet. For each window of k data packets, the invention generates and transmits at least one cross-wise parity packet taken as an index-shifted function over the k data packets. The invention thereby enables a receiving end to recover from packet loss.

Recovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correction

Abstract: A method and apparatus for staggercasting are described including encoding and compressing a first data sequence, packetizing the compressed encoded data sequence to form a data packet, performing forward error correction (FEC) encoding on the data packet in order to generate a second data sequence related to the first data sequence, appending FEC control information as padding to the end of payload data of the data packet, packetizing the second data sequence to form a packet, multicasting the data packet to a first multicast group, multicasting the packet formed using the second data sequence delayed by an offset time to a second multicast group.

Packet switch and congestion notification method

Abstract: A packet switch for setting a connection between a transmission source of a packet and a reception destination thereof so as to perform communication. The invention includes a packet buffer which includes at least one input port and a plurality of output ports. An input packet from the input port is delivered to at least one output port in accordance with address information of the input packet and connection information having been set in the packet switch at the time of setting the connection between the transmission source and the reception destination. A bandwidth management packet for giving notice of a congested state of the packet switch is transferred on the connection. The invention further includes a register which holds threshold value information for indicating an amount of use of the packet buffer that causes congestion, a counter which provides a count representative of a current amount of use of the packet buffer, a comparator which compares the count from the counter and the threshold value information from the register and outputs a result of the comparison, and a congestion decision/notification circuit which writes congestion notification information into the bandwidth management packet based on a result of the comparison by the comparator.

Learning and Generating Distributed Routing Protocols Using Graph-Based Deep Learning

Abstract: Automated network control and management has been a long standing target of network protocols. We address in this paper the question of automated protocol design, where distributed networked nodes have to cooperate to achieve a common goal without a priori knowledge on which information to exchange or the network topology. While reinforcement learning has often been proposed for this task, we propose here to apply recent methods from semi-supervised deep neural networks which are focused on graphs. Our main contribution is an approach for applying graph-based deep learning on distributed routing protocols via a novel neural network architecture named Graph-Query Neural Network. We apply our approach to the tasks of shortest path and max-min routing. We evaluate the learned protocols in cold-start and also in case of topology changes. Numerical results show that our approach is able to automatically develop efficient routing protocols for those two use-cases with accuracies larger than 95%. We also show that specific properties of network protocols, such as resilience to packet loss, can be explicitly included in the learned protocol.

SenseCode: Network coding for reliable sensor networks

Abstract: Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goals. We present the design and implementation of SenseCode, a collection protocol for sensor networks—and, to the best of our knowledge, the first such implemented protocol to employ network coding. SenseCode provides a way to gracefully introduce a configurable amount of redundant information into the network, thereby decreasing end-to-end packet error rate in the face of packet loss. We compare SenseCode to the best (to our knowledge) existing alternative and show that it reduces end-to-end packet error rate in highly dynamic environments, while consuming a comparable amount of network resources. We have implemented SenseCode as a TinyOS module and evaluate it through extensive TOSSIM simulations.