81results about How to "Reduce network overhead" patented technology

A method of setting a routing path for transmitting a packet from a source node to a destination node in a wireless multi-hop network including plural nodes and plural links for connecting two nodes with each other. The method includes calculating carrier sense interference weights representing carrier sense interference related to the respective links and combining the carrier sense interference weights of the links included in at least one specific path connecting the source node with the destination node. The method further includes calculating hidden node weights representing hidden node problems related to the respective links and accumulating the hidden node weights of the links included in the path. The method further includes calculating a metric value for the specific path by combining the carrier sense interference weights and the hidden node weights, and determining the specific path with the least metric value as the routing path.

Embodiments of systems and methods for efficient hand-off in a wireless network employ a neighbor report which may include, in addition to more convention information about neighboring access point, search thresholds, target beacon transmission time of neighboring access points, and execution thresholds. The present systems and methods also provide a mechanism of updating neighbor report and its elements. A faster and lower spectrum cost active search scheme based on sending a null packet may also be used by the systems and methods.

A system and method for detecting global positioning system (GPS) spoofing attacks includes collecting GPS readings along with inertial navigational system (INS) readings as a ground truth, and sequentially testing the GPS readings and INS readings through the use of a sequential probability ratio testing (SPRT) process.

A method for communicating packets in a network environment is provided that includes communicating, by a first network element, a first summary update to a second network element. The method further includes receiving a second summary update from the second network element. The exchange of the first and second summary updates achieves adjacency between the first and second network elements. The first and second summary updates include, at least, locally generated state information and a single link state.

An apparatus for communicating packets in a network environment is provided that includes a first network element that includes a first neighbor list, the first network element being coupled to a second network element and a third network element. The first network element is operable to receive a second neighbor list from the second network element and a third neighbor list from the third network element. The first network element is further operable to determine one or more overlaps provided by the second and third neighbor lists when compared to the first neighbor list, the first network element relaying an update that it receives based on the one or more overlaps.

A method for communicating packets in a network environment is provided that includes receiving a packet at a network element and identifying a sequence number included in the packet that correlates to awareness information associated with one or more adjacent network elements. A table included in the network element may be updated in order to account for the awareness information included within the packet that has not been accounted for by the network element. In cases where the awareness information included in the packet has already been accounted for, the packet may be ignored.

In a wireless network according to embodiments of the present invention, fast control messaging frames are used to signal control information. A fast control messaging (“FCM”) frame includes MAC layer control bits in a PLCP header, obviating the need for a PSDU. These frames can be used in 802.11n wireless networks as well as in other suitable 802.11x networks as well as non-802.11x networks to exchange control information while significantly reducing network overhead. In some embodiments, some information that might have been conveyed to a receiver's MAC layer in a PSDU is conveyed by including that information is a PLCP header and having logic within the receiver's PHY layer processing to process that information and convey that information up to the receiver's MAC layer in a simulated PSDU or other method. The indicator of an FCM frame can be a bit in a PLCP header, a modification of a CRC field of the PLCP header, or other indicator. The medication of the CRC field of the PLCP header can be an inversion of the CRC field, a translation of the CRC field by a constant value, or both, or some other variation.

The invention relates to an erasure code updating method based on copy data logsreplica data log-based erasure code updating method, which comprises the following steps of: receiving updated data, and storing the updated data to a replica data log of a data end; when the copy data log is full, obtaining a verification difference value by using the updated data and the data block, updating the corresponding data block by using the verification difference value, and forwarding the verification difference value to a verification end for storing the verification block; and storing the verification difference value to a verification log of the verification end, generating verification data through the verification difference value when the verification log is full, and updating a verification block by using the verification data. According to the erasure code updating method provided by the invention, on the premise that the consistency is ensured, the calculation overhead, the network overhead and the disk channel finding overhead generated in the updating process are reduced, the updating efficiency of the erasure codes is improved, and the performance improvement of one order of magnitude is achieved in some application scenarios compared with other updating methods.

An improved MAC aggregation technique is disclosed that yields an aggregate MAC much shorter than the concatenation of constituent MACs while achieving improved resilience to denial-of-service (DoS) attacks. The aggregate MAC is constructed in a manner wherein upon instance of channel impairments or malicious attack (e.g., from a rogue node or man-in-the-middle attacker), only a portion of the aggregate MAC will include corrupted data, at least a portion of the aggregate MAC thereby including valid verifiable data. A source of corruption of the aggregate MAC may be ascertained based on indicia of which constituent MACs are included in the valid portion; and constituent MACs that are wholly included in the valid portion may be declared valid.

Gang migration refers to the simultaneous live migration of multiple Virtual Machines (VMs) from one set of physical machines to another in response to events such as load spikes and imminent failures. Gang migration generates a large volume of network traffic and can overload the core network links and switches in a datacenter. In this paper, we present an approach to reduce the network overhead of gang migration using global deduplication (GMGD). GMGD identifies and eliminates the retransmission of duplicate memory pages among VMs running on multiple physical machines in the cluster. The design, implementation and evaluation of a GMGD prototype is described using QEMU / KVM VMs. Evaluations on a 30-node Gigabit Ethernet cluster having 10 GigE core links shows that GMGD can reduce the network traffic on core links by up to 65% and the total migration time of VMs by up to 42% when compared to the default migration technique in QEMU / KVM. Furthermore, GMGD has a smaller adverse performance impact on network-bound applications.