Packet loss

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

A taxonomy for congestion control algorithms in packet switching networks

Abstract: The authors propose a new taxonomy for congestion control algorithms in packet switching computer networks based on control theory. They view a network as a large, distributed control system, in which a congestion control scheme is a (distributed) control policy executable at each node (host or switches) of the network in order to a certain level of stable conditions. This taxonomy provides a coherent framework for the comparative study of existing algorithms and offers clues toward the development of new congestion control strategies. >

Method and apparatus for capturing and filtering datagrams for network security monitoring

Abstract: A method and system for security monitoring in a computer network has a packet sink with filtering and data analysis capabilities. The packet sink is a default destination for data packets having an address unrecognized by the network routers. At the packet sink, the packets are filtered and statistical summaries about the data traffic are created. The packet sink then forwards the data to a monitor, the information content depending on the level of traffic in the network.

Distributed admission control

Abstract: This paper describes a framework for admission control for a packet-based network where the decisions are taken by edge devices or end-systems, rather than resources within the network. The decisions are based on the results of probe packets that the end-systems send through the network, and require only that resources apply a mark to packets in a way that is load dependent. One application example is the Internet, where marking information is fed back via an ECN bit, and we show how this approach allows a rich QoS framework for flows or streams. Our approach allows networks to be explicitly analyzed, and consequently engineered.

Method and system for packet communication employing path diversity

Abstract: Communication over lossy packet networks such as the Internet is hampered by limited bandwidth and packet loss. The present invention provides a path diversity transmission system for improving the quality of communication over a lossy packet network. The path diversity transmission system explicitly sends different subsets of packets over different paths, thereby enabling the end-to-end application to effectively see an average path behavior. Generally, seeing this average path behavior provides better performance than seeing the behavior of any individual random path. For example, the probability that all of the multiple paths are simultaneously congested is much less than the probability that a single path is congested. The resulting path diversity can provide a number of benefits, including enabling real-time multimedia communication and simplifying system design (e.g., error correction system design). Two exemplary architectures for achieving path diversity are described herein. The first architecture is based on source routing, and the second architecture is based on a relay infrastructure. The second architecture routes traffic through semi-intelligent nodes at strategic locations in the Internet, thereby providing a service of improved reliability while leveraging the infrastructure of the Internet.