Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Bottorff
Kyle J. Bottorff, Newark, DE US
| Patent application number | Description | Published |
|---|---|---|
| 20110146926 | Paper Sizing Composition - A stable paper sizing composition comprising a dispersion of ketene dimer and a pH adjusted vinylamine containing polymer is disclosed. The method of preparing the stable sizing composition and the method of using the stable sizing composition is also disclosed. | 06-23-2011 |
Paul Bottorff, Portola Valley, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100284413 | DUAL HOMED E-SPRING PROTECTION FOR NETWORK DOMAIN INTERWORKING - A system for controlling packet forwarding through a dual-homed connection between first and second network domains, the dual-homed connection including two peer nodes connected to the first and second network domains. A sub-ring network is instantiated in the first network domain, and includes at least two nodes connected in a linear topology between a pair of end-nodes. Each end-node corresponds with a respective one of the peer nodes. A virtual link through the second network domain for conveys traffic of the sub-ring network between the peer nodes, and closes the sub-ring network to define a ring topology. Each of the nodes of the sub-ring network is controlled to forward packets of the sub-ring network in accordance with a ring network routing scheme. | 11-11-2010 |
Paul Bottorff, Palo Alto, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100189015 | Planning Routes and Allocating Identifiers to Routes in a Managed Frame-Forwarding Network - A method is provided of planning routes and allocating route identifiers in a managed frame-forwarding network. The network comprises a plurality of nodes interconnected by links, with each node being arranged to forward data frames according to a combination of an identifier and a network address carried by a received data frame and forwarding instructions stored at the node. A first step of the method identifies a sub-set of nodes which are core nodes of the network. The remaining nodes are termed outlying nodes. A spanning tree is then built off each of the identified core nodes, with the spanning tree stopping one link short of any other core node. Each spanning tree defines a loop-free path between a core node at the root of the spanning tree and a set of outlying nodes. Connections are planned between roots of the spanning trees and a different identifier is allocated to each planned connection between a pair of spanning trees. | 07-29-2010 |
Paul A. Bottorff, Palo Alto, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20100215045 | Method and Apparatus for Direct Frame Switching Using Frame Contained Destination Information - Frame contained destination information may be used by a switch to identify an appropriate output port for a given frame without performing a table access operation. This reduces the processing requirements of the switch to enable the switch to handle frames more efficiently. The frame contained destination information may be contained in the frame's local destination MAC addresses (DA) such that a portion of the DA directly indicates, for each switch that handles the frame, an output port for that switch. Different portions of the DA may be used by different switches, depending on where they are in the network hierarchy. Large switches may also use sub-fields within their allocated portion in the DA to identify internal switching components. A location resolution server may be provided to store and distribute IP and MAC addresses and respond to local ARP requests on the local domain. | 08-26-2010 |
Paul Allen Bottorff, Portola Valley, CA US
| Patent application number | Description | Published |
|---|---|---|
| 20120101987 | DISTRIBUTED DATABASE SYNCHRONIZATION - Systems and methods of fast synchronization failure detection in distributed databases are disclosed. An example of a method includes receiving a digest of a database stored at a sending node in a network, the digest broadcast by the sending node to N number of nodes in the network. The method also includes generating a digest of a database stored at a receiving node in the network. The method also includes comparing the generated digest to the received digest. The method also includes issuing a lost synchronization signal by the receiving node when the comparison indicates a change in the database stored at the sending node. | 04-26-2012 |