| Silver Spring Networks Patent applications |
| Patent application number | Title | Published |
|---|
| 20100195495 | System and method of monitoring packets in flight for optimizing packet traffic in a network - Systems and methods of optimizing packet flow in a network are disclosed. An internetwork includes plural networks, each network having plural non-router nodes and at least one router node. The non-router node of a first network can be configured to perform congestion control. The non-router node sends a request packet to a node in a second network. The value of a packet-in-flight counter associated with the network is adjusted when the request packet is sent to the second network node and when a response packet is received from the second network node. The non-router node determines whether another request packet can be sent to another network in the internetwork based on a value of the packet-in-flight counter. | 08-05-2010 |
| 20090309749 | Utility Network Interface Device With Visual Indication of Network Connectivity - A network interface device includes a transceiver capable of connecting a utility meter to a wireless network, and a visual indicator capable of displaying a status of a connection between the utility meter and the wireless network. The visual indicator can be an LED, whose display state indicates the status of network connectivity. Alternatively, the visual indicator can be an integrated digital display of the meter that is typically used to indicate a metering parameter, such as total consumption or rate of consumption. | 12-17-2009 |
| 20090303972 | Dynamic Scrambling Techniques for Reducing Killer Packets in a Wireless Network - Techniques are disclosed in which a parameter used for scrambling packet data is changed. If the initial scrambling of a packet causes a killer packet to be generated, the packet is re-scrambled using a different value for the parameter, so that a killer packet is avoided. In a network that employs frequency-hopping spread spectrum communications, a channel identifier can be employed as an input to the scrambling algorithm. In this implementation, a given packet of data will be transmitted on one channel with a first sequence of bits when it is scrambled, and on another channel with a different sequence of bits. If the scrambled packet for one of these channels results in a killer packet, it is statistically unlikely that it will also be a killer packet when it is re-transmitted on the other channel. | 12-10-2009 |
