Abstract: Described herein are systems and methods for garbage collection prediction. A temporal graph is received, the temporal graph including nodes, the nodes including hash references to objects. An accumulated difference count is updated when a node is added to the temporal graph, the accumulated difference count including a number of hash differences between a parent node and its children nodes in the temporal graph. A divested difference count is updated when a node is removed from the temporal graph, the divested difference count including a number of hash differences referenced by the removed node but not by either a parent node of the removed node or any child nodes of the removed node. The outcome of the garbage collection is predicted based on at least one of the accumulated difference count and the divested difference count.

Abstract: Described herein are systems and methods for efficient data replication. A set of hashes for a source object to be replicated is sent from the source local deduplication store to the remote server. The remote server generates a set of object hashes representative of data in the source object that is already present on the remote server, and data indicative of source object hashes that are not present on the remote server. The remote server transmits the generated data to the source local deduplication store. The source local deduplication store identifies portions of the source object that are not already present on the remote server based on the received data. The source local deduplication store transmits the identified portions of the source object to the remote server to replicate the source object on the remote server.

Abstract: Described herein are systems and methods for efficient data replication. A set of hashes for a source object to be replicated is sent from the source local deduplication store to the remote server. The remote server generates a set of object hashes representative of data in the source object that is already present on the remote server, and data indicative of source object hashes that are not present on the remote server. The remote server transmits the generated data to the source local deduplication store. The source local deduplication store identifies portions of the source object that are not already present on the remote server based on the received data. The source local deduplication store transmits the identified portions of the source object to the remote server to replicate the source object on the remote server.

Abstract: Described herein are systems and methods for garbage collection prediction. A temporal graph is received, the temporal graph including nodes, the nodes including hash references to objects. An accumulated difference count is updated when a node is added to the temporal graph, the accumulated difference count including a number of hash differences between a parent node and its children nodes in the temporal graph. A divested difference count is updated when a node is removed from the temporal graph, the divested difference count including a number of hash differences referenced by the removed node but not by either a parent node of the removed node or any child nodes of the removed node. The outcome of the garbage collection is predicted based on at least one of the accumulated difference count and the divested difference count.

Abstract: A system and method for management of communication links between nodes in a wireless communication network (100). The system and method perform the operations of estimating an expected rate of change in the characteristics pertaining to communication over a communication link in the network (100), and assigning a value associated with the link based on the expected rate of change. The system and method also adjust the rate of change of the value associated with the link based on the condition of the link.

Abstract: A system and method for distributing proxying error information in wireless networks is provided. The includes associating a proxy node with a non-routable node; sending a data packet from an initiator node to the proxy node for delivery to the non-routable node; determining by the proxy node that the non-routable device has disassociated from the proxy node; sending a proxy error message from the proxy node to the initiator node to inform the initiator node that the non-routable node is no longer proxied by the proxy node; and starting a route discovery process for the non-routable device by the initiator node.

Abstract: The present invention provides a system and method for multihop packet forwarding within a multihop wireless communication network. The method uses a data frame format including at least the four address fields to forward packets in a multihop wireless network. The method includes generating a route request packet at a routable device in response to receiving a packet destined for an unknown destination. The route request packet includes an originating device field including an address of an originating device, wherein the originating device generated the packet originally; and a source field, wherein the source field includes an address of the first routable device which generated the route request packet.

Abstract: A method for switching the use of an access point (AP) in a wireless communication network without explicitly updating a proxy address resolution protocol (ARP) cache (200) includes first providing a communication between a network node (111) and a first access point (107) utilizing a first proxy ARP cache. The communication is then switched from the first access point (107) to a second access point (109) utilizing a second proxy ARP cache. In order to reduce messaging traffic in the wireless communications network, any future inquiries regarding the address of the network node (111?) continue to be serviced by the first access point (107) and its first proxy ARP cache.

Abstract: A method for testing links in a adhoc wireless network 100 is disclosed. The adhoc wireless network 100 comprises a plurality of nodes 305,310,315,320 linked together using a communication route 345. The method comprising the steps of triggering a link test requirement of a link 340 between a first node 305 and a second node 320 in the adhoc wireless network 100; and performing the link test by the first node 305 sending one or more test packets using one or more link test parameters directly from the first node 305 to the second node 320 irrespective of the communication route 345.

Abstract: A system and method for management of communication links between nodes in a wireless communication network (100). The system and method perform the operations of estimating an expected rate of change in the characteristics pertaining to communication over a communication link in the network (100), and assigning a value associated with the link based on the expected rate of change. The system and method also adjust the rate of change of the value associated with the link based on the condition of the link.

Abstract: A system and method for dynamic frequency selection at one or more access points (APs 106) in a multihop wireless network (100). The system and method maintain at the APs (106) a table comprising end-to-end network channel information that is indicative of the degree of channel performance in the network (100). The APs (106) are capable of dynamically selecting frequencies in response to the network channel information in the table.

Abstract: A method and system for routing data in a wireless network (400) that enables all nodes (106, 402, 404, 406, 408) to find routes to each other even if the nodes are incapable of operating as a router to route packets received from other nodes (106, 402, 404, 406, 408). The meshed nodes (106, 402) which are capable of performing packet routing act as proxy nodes for their associated non-meshed nodes (STA 13-STA 15) to route packets from their associated non-meshed nodes (STA 13-STA 15) to destination nodes. Some of the meshed nodes further operate as intelligent access points (106) to provide the non-meshed nodes and other meshed nodes with access to other networks, such as the Internet (402).

Abstract: A method and system for routing data in a wireless network (400) that enables all nodes (106, 402, 404, 406, 408) to find routes to each other even if the nodes (106, 402, 404, 406, 408) are non-meshed which are incapable of operating as a router to route packets received from other nodes (106, 402, 404, 406, 408), and for associating and reassociating the non-meshed and meshed nodes with other meshed nodes (106, 402, 404, 406, 408). The non-meshed nodes (STA 13-STA 15) request association with one of the meshed nodes (AP5) which are capable of performing packet routing, to request that the meshed node (AP5) with which the non-meshed node (STA 13) is associating operate as a proxy node to route packets between the associated non-meshed node (STA 13) and other meshed or non-meshed nodes (106, 402, 404, 406, 408).