Patent application number | Description | Published |
20090013175 | METHOD AND APPARATUS FOR CONTROLLING THE FLOW OF DATA ACROSS A NETWORK INTERFACE - The present invention performs “flow control” based on the remaining encryption capacity of an encrypted outbound network interface link of a network routing device, such as a router or switch. As the encrypted link begins to run low on encryption key material, this invention begins to discard datagrams queued for transit across that link, in order to signal distant host computers that they should slow down the rate at which they are sending datagrams. The invention, which is particularly useful in cryptographically protected networks that run the TCP/IP protocol stack, allows fine-grained flow control of individual traffic classes because it can determine, for example, how various classes of data traffic (e.g., voice, video, TCP) should be ordered and transmitted through a network. Thus, the invention can be used to implement sophisticated flow control rules so as to give preferential treatment to certain people, departments or computers. | 01-08-2009 |
20100020824 | PACKET HEADER COMPRESSION FOR LOSSY CHANNELS - The disclosed systems and methods provide for the compression and decompression of packet headers. An uncompressed header can be compressed in size to form a smaller, compressed header, such that the compressed header can include values that can be used to re-produce the uncompressed header. A compressed header can include at least two such values. A first value of the at least two values can be computed based on a second, earlier uncompressed header and can be used to derive the uncompressed header. Similarly, a second value of the at least two values can be computed based on a third uncompressed header and can be used to derive the same uncompressed header. Accordingly, the uncompressed header can be derived based on the first value and the second uncompressed header, or based on the second value and the third uncompressed header. The uncompressed header, second uncompressed header, and third uncompressed header can be associated with different packets. | 01-28-2010 |
20100027556 | HYBRID COMMUNICATIONS LINK - A hybrid communications link includes a slow, reliable communications link and a fast unreliable communications link. Communication via the hybrid communications link selectively uses both the slow, reliable communications link and the fast, unreliable communications link. | 02-04-2010 |
20100046484 | TIME DIVISION MULTIPLE ACCESS FOR NETWORK NODES WITH MULTIPLE RECEIVERS - A system facilitates communication among nodes in a wireless network. A timeslot is assigned to each of a group of nodes ( | 02-25-2010 |
20100046555 | METHOD AND APPARATUS FOR INFORMATION DISSEMINATION - A system and method for transmitting information to a group of recipient devices [ | 02-25-2010 |
20100214974 | HYBRID COMMUNICATIONS LINK - A hybrid communications link includes a slow, reliable communications link and a fast unreliable communications link. Communication via the hybrid communications link selectively uses both the slow, reliable communications link and the fast, unreliable communications link. | 08-26-2010 |
20110271012 | PACKET HEADER COMPRESSION FOR LOSSY CHANNELS - The disclosed systems and methods provide for the compression and decompression of packet headers. An uncompressed header can be compressed in size to form a smaller, compressed header, such that the compressed header can include values that can be used to re-produce the uncompressed header. A compressed header can include at least two such values. A first value of the at least two values can be computed based on a second, earlier uncompressed header and can be used to derive the uncompressed header. Similarly, a second value of the at least two values can be computed based on a third uncompressed header and can be used to derive the same uncompressed header. Accordingly, the uncompressed header can be derived based on the first value and the second uncompressed header, or based on the second value and the third uncompressed header. The uncompressed header, second uncompressed header, and third uncompressed header can be associated with different packets. | 11-03-2011 |
20150029914 | ENERGY EFFICIENT FORWARDING IN AD-HOC WIRELESS NETWORKS - A system for conserving energy in a multi-node network ( | 01-29-2015 |
20150063325 | RECEIVER SCHEDULING IN WIRELESS NETWORKS - A wireless apparatus utilizes a wireless transceiver, in communication with a processor, to transmit and receive messages via a wireless network. The wireless transceiver may receive a schedule definition for devices affiliated with a node of the wireless network. The processor may determine, from the received schedule definition, one or more time periods allocated to the wireless apparatus. The wireless transceiver may communicate with the wireless network in accordance with at least one of the one or more time periods. | 03-05-2015 |