Cisco Technology, Inc.

Evonik Degussa Gmbh

Evonik Operations Gmbh

Robert Hoffman

Raymond Kloth

James Douglas Tobias

Jonathan M Parlan

Juan Jesus Burdeniuc

Maurilio Cometto

Timothy J Miller

Yiren Huang

Jean Louise Vincent

Alessandro Fulli

Guglielmo Marco Morandin

Boxun Leng

Xiubing Hu

Calvin C Wong

Raymond J Kloth

Juanjesus Burdeniuc

The present invention provides trimerization catalyst compositions having a sterically hindered carboxylate salt used in combination with a tertiary amine catalysts having isocyanate reactive groups and methods to produce a polyisocyanurate/polyurethane foam using such trimerization catalyst compositions.

Trimerization catalysts from sterically hindered salts and tertiary amines having isocyanate reactive groups

A composition and process to make polyisocyanurate or polyurethane foam using a catalyst composition comprising at least one bismuth carboxylate catalyst and one or more co-catalysts selected from the group of alkali metal carboxylates and quaternary ammonium carboxylate salts, such that the resultant foam has improved insulation properties. The polyisocyanurate or polyurethane foams produced by this catalyst composition and method are useful for laminated boardstock, construction panels, appliance insulation, and spray-applied insulation.

Catalyst compositions and methods for making foam

Methods and devices are provided for the efficient allocation and deletion of virtual output queues. According to some implementations, incoming packets are classified according to a queue in which the packet (or classification information for the packet) will be stored, e.g., according to a 'Q' value. For example, a Q value may be a Q number defined as {Egress port number&#x2225;Priority number&#x2225;Ingress port number}. Only a single physical queue is allocated for each classification. When a physical queue is empty, the physical queue is preferably de-allocated and added to a 'free list' of available physical queues. Accordingly, the total number of allocated physical queues preferably does not exceed the total number of classified packets. Because the input buffering requirements of Fiber Channel (&#x201c;FC&#x201d;) and other protocols place limitations on the number of incoming packets, the dynamic allocation methods of the present invention result in a sparse allocation of physical queues.

Scalable approach to large scale queuing through dynamic resource allocation

A method and a system for controlling a packet passing through a network device are provided. The method includes timestamping the packet with an arrival time when it arrives at the network device, and determining the time the packet spends in the network device. The time spent is calculated by comparing the arrival time stamp and the exit time stamp. Subsequently, the packet is labeled, based on a function of the determined time spent in the network device. The packet can be labeled, to be dropped, suppressed or temporarily stopped. The system for controlling the packet passing through the network device comprises the means for performing the above mentioned steps.

System and method for regulating data traffic in a network device

Methods and apparatus are provided for controlling congestion in a network such as a fibre channel network. Techniques are provided for characterizing traffic flow at a congested network node. The congested network node can generate various instructions such as quench messages to control traffic flow towards the congested network node. The quench messages can optionally include information about the characteristics of the congestion. The instructions are distributed to other nodes in the network. The other network nodes can interpret the instructions and control traffic flow towards the congested node.

Methods and apparatus for network congestion control

Methods and apparatus are disclosed for generating and checking CRC values using a multi-byte CRC generator and a binary Galois field (&ldquo;GF2&rdquo;) multiplier. These methods and apparatus could be used in an unlimited number of applications and environments, such as part of computer or communications device (e.g., router or switch). The CRC generator and/or checker may be implemented singularly or in a combination of technologies, including, but not limited to, software, firmware, hardware, customized circuitry, application-specific integrated circuits, etc. A CRC generator is used to calculate a preliminary CRC value on a block of information. This CRC generator may be a balanced XOR tree or some other implementation, which calculates the preliminary CRC value on groups of n bytes of data at a time, where n is some integer greater than one. For example, when data is transferred over a 512 wide bit bus, typically the value of n would be 64 (i.e., 512 bits divided by 8 bits per byte). Because the number of bytes in the data group may not be an even multiple of the value of n, one or more bytes of value zero may be appended to the data group to make it an even multiple, with the preliminary CRC being calculated on the entire appended data group. A GF2 multiplier uses the preliminary CRC value and the number of appended bytes of value zero to calculate the actual CRC value of the information.

Method and apparatus for generating and checking cyclic redundancy code (CRC) values using a CRC generator and binary galois field multiplier

A method of managing free entries in a CAM using virtual page pre-fetch is defined. The memory locations in a CAM are partitioned into multiple virtual pages (VP). The allocation of memory location to VPs is independent of the physical address of the location. The address of an empty location (free entry) from each VP is pre-fetched and is maintained in a free entry list. Consecutive write operations are scheduled in different VPs to avoid a back-to-back write in the same VP which eliminates resource contention. When data is retrieved from a location in the CAM, that location becomes available for next write. Because the allocation of a location to VPs is independent of the physical address of the location, when the location becomes available, a new VP assignment is made for that location.

Growing community of inventors

Santa Clara, CA, United States of America

Robert Hoffman