Packet loss

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

Comparison of deflection and store-and-forward techniques in the Manhattan Street and Shuffle-Exchange Networks

Abstract: The Manhattan Street Network (MS-Net) and Shuffle-Exchange Network (SX-Net) are two-connected networks with significantly different topologies. Fixed-size packets are transmitted between nodes in these networks. The nodes are synchronized so that all of the packets that are received by a node within a slot transmission time arrive at a switching point simultaneously. Instead of storing large numbers of packets at intermediate nodes, a deflection strategy similar to hot-potato routing is used. There are characteristics of the MS-Net that make it well suited for deflection routing. With no buffer, 55-70% of the throughput with an infinite number of buffers has been obtained; with a single buffer per node, the throughput increases to 80-90%. With uniform load the throughput does not decrease significantly as the network utilization increases. Therefore, additional flow control mechanisms are not required to achieve the highest network throughput. The SX-Net does not have the above characteristics of the MS-Net. However, deflection routing still provides a significant portion of the available throughput. In the SX-Net, more buffers are required than in the MS-Net, and a flow control mechanism must be used to achieve the greatest throughput. >

Method and apparatus for preventing network traffic analysis

Abstract: A system and method for generating and transmitting false packets along with a true packet to thereby hide or obscure the actual message traffic. A new extension header having a plurality of fields is positioned in the hierarchy of Internet protocol headers that control passage of the false packets and the true packet through the network. A sending host computer generates a plurality of false packets for each true packet and transmits the false packets and the true packet containing the Internet protocol headers and the extension header over the network. The new extension header is decrypted and re-encrypted each host that handles a message packet that uses the new extension header to control the random re-encryption of the true packet body at random hosts and the random generation of false packets at each host visited by a true packet, at the recipient of the true packet, and at any hosts that receive a false packet.

Experimental Study of Coexistence Issues Between IEEE 802.11b and IEEE 802.15.4 Wireless Networks

Abstract: Coexistence issues between IEEE 802.11b wireless communication networks and IEEE 802.15.4 wireless sensor networks, operating over the 2.4-GHz industrial, scientific, and medical band, are assessed. In particular, meaningful experiments that are performed through a suitable testbed are presented. Such experiments involve both the physical layer, through measurements of channel power and the SIR, and the network/transport layer, by means of packet loss ratio estimations. Different configurations of the testbed are considered; major characteristics, such as the packet rate, the packet size, the SIR, and the network topology, are varied. The purpose of this paper is to gain helpful information and hints to efficiently face coexistence problems between such networks and optimize their setup in some real-life conditions. Details concerning the testbed, the measurement procedure, and the performed experiments are provided.

Packet radio system and methods for a protocol-independent routing of a data packet in packet radio networks

Abstract: The present invention relates to a protocol-independent routing of data packets between a mobile station of a packet radio network and a party (Host) connected to an external network. In the invention, a data packet of an extraneous protocol (IPX) is transferred through a packet radio network using a second protocol (X.25) as encapsulated in a data packet according to the second protocol. The transferring packet radio network does not thus need to understand the protocol of the transferred extraneous data packet or to be able to interpret the contents of the data packet. A data packet network is connected to other packet radio networks, data networks or the backbone network between packet data networks via a gateway node (GPRS GSN), which uses the network-internal protocol (X.25) towards the dedicated packet network and the protocol of each network towards other networks. When a data packet is transferred via a gateway node from a network into another network, the data packet is encapsulated in a packet according to the protocol of the new network. When the encapsulated data packet arrives in a node which supports the protocol of the encapsulated data packet, the encapsulation is stripped away and the data packet is routed forward according to the protocol of the data packet.

Method and apparatus for high-speed network rule processing

Abstract: As Internet packet flow increases, the demand for high speed packet filtering has grown. The present invention introduces a high-speed rule processing method that may be used for packet filtering. The method pre-processes a set of packet filtering rules such that the rules may be searched in parallel by a set of independent search units. Specifically, the rules are divided into N orthogonal dimensions that comprise aspects of each packet that may be examined and tested. Each of the N dimensions are then divided into a set of dimension rule ranges. Each rule range is assigned a value that specifies the rules that may apply in that range. The rule preprocessing is completed by creating a search structure to be used for classifying a packet into one of the rule ranges in each of the N dimensions. Each search structure may be used by an independent search unit such that all N dimensions may be searched concurrently. The packet processing method of the present invention activates the N independent search units to search the N pre-processor created search structures. The output of each of the N search structures is then logically combined to select a rule to be applied.