Abstract: A credit-based method for controlling data communications in a computer system between a sender and a receiver coupled by an ordered communication link is described herein. A request for a credit check is transmitted from the sender to the receiver via the ordered communication link. An initial number of credits are allocated to the sender in a credit counter. A snapshot counter is set to a value of the credit counter and us updated as returned credits are received. A number of reported credits are determined based on a credit check response message received from the receiver. The returned credits are ordered relative to the credit check response message. The number of credits is checked for consistency based on a number of the snapshot counter and the number of reported credits.

Abstract: Techniques are provided to trace packet descriptors. A received packet may be identified. A packet descriptor associated with the received packet may be created. A trace indicator in the packet descriptor may be set. The presence of a packet descriptor with the trace indicator set may be logged by a detector.

Abstract: Techniques are provided for sending request messages to destination nodes. Destination nodes may be indicated as unresolved. Request messages are sent to destination nodes indicated as unresolved.

Abstract: Techniques are provided for performing a delay. A request for a delay may be received. A plurality of delay queues may be provided, with each delay queue spanning a range of delay remaining. The request may be assigned to a delay queue based on the delay remaining. The request may be moved to a different delay queue as the delay remaining decreases.

Abstract: Techniques for using target issue intervals are provided. Request messages may identify the size of a data packet. A target issue interval may be determined based on the request messages. The target issue interval may be used to insert a delay between sending subsequent request messages.

Abstract: Techniques for delays based on packet sizes are provided. Request messages may identify the size of a data packet. Delays may be initiated based in part on a portion of the size of the data packet. The delays may also be based in part on target issue intervals. Request messages may be sent after the delays.

Abstract: Techniques described herein provide for sending data packets from source to destination nodes. Indicators, such as counters, may determine the configuration of node interfaces. The data packets may be sent based on a comparison of current and stored indicators.

Abstract: Techniques for taking corrective action based on probabilities are provided. Request messages may include a size of a data packet and a stated issue interval. A probability of taking corrective action based on the size of the data packet, the stated issue interval, and a target issue interval may be retrieved. Corrective action may be taken with the retrieved probability.

Abstract: Techniques are provided for performing a delay. A request for a delay may be received. A plurality of delay queues may be provided, with each delay queue spanning a range of delay remaining. The request may be assigned to a delay queue based on the delay remaining. The request may be moved to a different delay queue as the delay remaining decreases.

Abstract: Techniques are provided to trace packet descriptors. A received packet may be identified. A packet descriptor associated with the received packet may be created. A trace indicator in the packet descriptor may be set. The presence of a packet descriptor with the trace indicator set may be logged by a detector.

Abstract: Techniques described herein provide for sending and receiving messages. The messages are associated with streams. Indicators associated with the streams determine if the messages are sent.

Abstract: A system comprises a processor, a reassembly buffer that receives mini-packets, and at least one data structure that comprises bits. The bits indicate the presence or absence of each of the mini-packets in the reassembly buffer and further indicate whether one of the mini-packets is a final mini-packet in a series of the mini-packets. The processor uses the bits to determine whether all mini-packets forming the series are present in the reassembly buffer. As a result of the determination, the processor causes the series to be read from the reassembly buffer.

Abstract: Techniques described herein provide for sending packets to nodes based on distribution trees with stages. A packet may be received at a node. The stage of the node may be determined. A distribution tree may be selected. Based on the stage and the selected distribution tree, subsequent stage nodes may be determined. The packet may be sent to the subsequent stage nodes.

Abstract: Techniques for taking corrective action based on probabilities are provided. Request messages may include a size of a data packet and a stated issue interval. A probability of taking corrective action based on the size of the data packet, the stated issue interval, and a target issue interval may be retrieved. Corrective action may be taken with the retrieved probability.

Abstract: Techniques for delays based on packet sizes are provided. Request messages may identify the size of a data packet. Delays may be initiated based in part on a portion of the size of the data packet. The delays may also be based in part on target issue intervals. Request messages may be sent after the delays.

Abstract: Techniques for using target issue intervals are provided. Request messages may identify the size of a data packet. A target issue interval may be determined based on the request messages. The target issue interval may be used to insert a delay between sending subsequent request messages.

Abstract: Techniques described herein provide for sending data packets from source to destination nodes. Indicators, such as counters, may determine the configuration of node interfaces. The data packets may be sent based on a comparison of current and stored indicators.

Abstract: Techniques are provided for sending response messages based on pending requests. A request message identifying a data packet may be received. A pending request structure may be used to determine output queues that are in need of the data packet identified in the request message. A response message may be sent indicating if the request message is being refused based on the output queues.

Abstract: Techniques are provided for sending request messages to destination nodes. Destination nodes may be indicated as unresolved. Request messages are sent to destination nodes indicated as unresolved.

Abstract: Techniques described herein provide for sending request messages. The request messages may be sent in order. The request messages may be sent over a designated communications channel.