Abstract: An improved solution for limiting the transmission rate of data over a network is provided according to an aspect of the invention. In particular, the transmission rate for a port is limited by rate limiting one of a plurality of queues (e.g., class/quality of service queues) for the port, and directing all data (e.g., packets) for transmission through the port to the single rate limited queue. In this manner, the transmission rate for the port can be effectively limited to accommodate, for example, a lower transmission rate for a port on a destination node.

Abstract: An improved solution for limiting the transmission rate of data over a network is provided according to an aspect of the invention. In particular, the transmission rate for a port is limited by rate limiting one of a plurality of queues (e.g., class/quality of service queues) for the port, and directing all data (e.g., packets) for transmission through the port to the single rate limited queue. In this manner, the transmission rate for the port can be effectively limited to accommodate, for example, a lower transmission rate for a port on a destination node.

Abstract: An improved solution for limiting the transmission rate of data over a network is provided according to an aspect of the invention. In particular, the transmission rate for a port is limited by rate limiting one of a plurality of queues (e.g., class/quality of service queues) for the port, and directing all data (e.g., packets) for transmission through the port to the single rate limited queue. In this manner, the transmission rate for the port can be effectively limited to accommodate, for example, a lower transmission rate for a port on a destination node.

Abstract: A method and system for reinserting a chain into a hash table of a computer system are described. The chain includes a plurality of keys. The hash table includes a key fields and link fields associated with the key fields. The hash table utilizes an initial collision resolution scheme that precludes coalescing of chains. The method and system include providing a binary tree including nodes corresponding to the keys of the chain. The nodes include a root node corresponding to a root key and at least one child node corresponding to at least one child key. The method and system also include storing a pair of child keys in two empty adjacent key fields and storing a first empty adjacent key value of one of the two empty adjacent key fields in the home link field if the root node is the parent node of more than one child node.

Abstract: A method and a computer program product for detecting link status in a blade system are provided. The method and computer program product provide for generating a first pattern of characters at a server blade of the blade system, transmitting the first pattern of characters from the server blade to an Ethernet switch of the blade system, and comparing a second pattern of characters to the first pattern of characters to determine whether a link from the Ethernet switch to a network is active in response to the server blade receiving the second pattern of characters from the Ethernet switch.

Abstract: Methods and arrangements to insert values in hash tables are contemplated. Embodiments include transformations, code, state machines or other logic to insert values in a hash table stored in electronic memory by hashing a value to determine a home address of an entry in the hash table, the hash table having a plurality of entries, each entry comprising an address, a value, and a link. The embodiments may include determining whether there is a collision of the value with a value stored in the entry; inserting the value in the entry if there is no collision; and generating the addresses of further entries until an entry is found in which the value can be inserted if there is a collision. The embodiments may include generating a plurality of addresses of entries based upon the address of a previously generated entry.

Abstract: An improved solution for limiting the transmission rate of data over a network is provided according to an aspect of the invention. In particular, the transmission rate for a port is limited by rate limiting one of a plurality of queues (e.g., class/quality of service queues) for the port, and directing all data (e.g., packets) for transmission through the port to the single rate limited queue. In this manner, the transmission rate for the port can be effectively limited to accommodate, for example, a lower transmission rate for a port on a destination node.

Abstract: A method and a computer program product for detecting link status in a blade system are provided. The method and computer program product provide for generating a first pattern of characters at a server blade of the blade system, transmitting the first pattern of characters from the server blade to an Ethernet switch of the blade system, and comparing a second pattern of characters to the first pattern of characters to determine whether a link from the Ethernet switch to a network is active in response to the server blade receiving the second pattern of characters from the Ethernet switch.

Abstract: A method and system for reinserting a chain into a hash table of a computer system are described. The chain includes a plurality of keys. The hash table includes a key fields and link fields associated with the key fields. The hash table utilizes an initial collision resolution scheme that precludes coalescing of chains. The method and system include providing a binary tree including nodes corresponding to the keys of the chain. The nodes include a root node corresponding to a root key and at least one child node corresponding to at least one child key. The method and system also include storing a pair of child keys in two empty adjacent key fields and storing a first empty adjacent key value of one of the two empty adjacent key fields in the home link field if the root node is the parent node of more than one child node.

Abstract: A method for storing data in a data storage area of a computer that utilizes hashing functions to avoid collision of data records. A first hash function attempts to place a new data record in a home address in the data table. If a data record already exists in that slot, a collision occurs, and a second hash function is applied on each of the new data record and the stored data record to determine a new target slot. Application of each second hash function results in an increment advancement amount for the new data record and an incremental advancement amount for the stored data record. The new data record is stored in the new target slot, where the new target slot is determined based on one or both of the incremental advancement amount for the new data record and the incremental advancement amount for the stored data record.

Abstract: Described is a circuit arrangement which reduces intersymbol interference among pulses in a fiber optic communications network. The circuit arrangement includes a wavelength separator which separates each pulse into a plurality of sections which are shifted in time and then realigned relative to its center section to form non-overlapping pulses.

Abstract: Described are a technique and an apparatus for deskewing data transmitted via a dispersive medium such as a fiber optic link. The relative delays in arrival time for a plurality of bits, propagated in separate channels are measured. The relative delays are used to calculate the wavelength (.lambda.) of one channel and the zero dispersion wavelength (.lambda..sub.0) of the medium. The relative delays in arrival times for the remaining bits in a group of bits are predicted using the measured relative delays, the spacing (.delta.) between the transmitters and the calculated wavelengths. An adjustable delay for storing data bits is provided in each channel. The relative delays are used to deskew the individual bits.

Abstract: When a byte of digital data is transmitted through a dispersive medium using frequency or wavelength division multiplexing (WDM) techniques, individual bits in the byte are normally delayed different amounts of time. This is referred to as bit skew. WDM apparatus is described along with a system for deskewing WDM data received after transit through a dispersive medium. Two bits in a given byte of data are detected. The relative times of arrival of the remaining bits in a byte are predicted using the relative delay between the two detected bits and the known frequency-related dispersion characteristics of the transmission medium. Certain bits in each received byte may be delayed using clock delay lines or registers to reduce the amount of time skew between the various bits in a byte.