Hewlett Packard Enterprise Development LP

Mark Shillingburg

Jonathan Michael Seely

Brian Peter L'Ecuyer

Eric Pelletier

Jonathan Greenlaw

Shiro Suzuki

Example implementations relate to segment size determination. In an example, the system may include a processing resource and a memory resource storing machine-readable instructions to cause the processing resource to determine a quantity of segments to be generated from a packet, and alter, in response to the determined quantity of segments and a memory block size of a destination port, a segment size for each of the quantity of segments.

Segment size determination

Examples include sampling a transmit rate of an egress port queue on a destination node, determining a utilization percentage of the egress port queue based on the transmit rate and a total rate capacity of the egress port, and determining a backlog percentage of the egress port queue. Examples also include determining an output rate for a virtual output queue on a source node based on the utilization percentage and the backlog percentage. The virtual output queue is for the egress port queue.

Output rates for virtual output queses

Example implementations relate to packet transmission credit allocation. In some examples, a system may include a processing resource and a memory resource storing instructions executable by the processing resource to allocate a first amount of packet transmission credits from a destination node to a source node; determine a modification to the first amount of packet transmission credits allocated from the destination node to the source node based on a comparison of a quantity of redeemed packet transmission credits by the source node to a packet transmission credit threshold of the source node; adjust the modification based on a condition at a buffer associated with the destination node; and apply the adjusted modification to the first amount of packet transmission credits to produce a second amount of packet transmission credits to allocate from the destination node to the source node.

Packet transmission credit allocation

Examples herein relate to crossbar switches and related circuitry. An example crossbar switch includes a plurality of abutted tiles forming a crossbar. The plurality of abutted tiles includes a plurality of edge tiles and at least one middle tile, where each side of each middle tile abuts an edge tile or another middle tile. Each middle tile includes data inputs connected to data outputs, switched data inputs connected to switched data outputs, and pipeline delay registers coupled to data inputs and switched data outputs to allow transmission of a data signal to change directions inside each middle tile. Each edge tile includes a crossbar input, a crossbar output, and a set of inputs, outputs, and pipeline delay registers to allow transmission of data signals from any side of the edge tile to any other side of the edge tile.

Crossbar switch with pipeline delay registers

Example implementations relate to an arbitration node. For example, an arbitration node can include instructions to receive, at the arbitration node at a level of a binary tree structure, a first request including a first request signal and a first priority signal and receive a second request including a second request signal and a second priority signal. In some examples, the arbitration node can include instructions to determine priority of requests by comparing the first request signal and the second request signal and by comparing the first priority signal and the second priority, and send a request signal and a priority signal of the request with the determined priority to a subsequent arbitration node at a subsequent level of the binary tree structure.

Determine priority of requests using request signals and priority signals at an arbitration node

An example of a system may include a processing resource and a controller including a memory resource storing instructions executable by the processing resource to determine a rate of traffic communication at each of a plurality of ingresses participating in a communication of a packet flow context, determine a rate of traffic communication at each of a plurality of egresses participating in the communication of the packet flow context, determine a target packet admission rate applicable to each of the plurality of ingresses from the rate of traffic communication at each of the plurality of ingresses and the rate of traffic communication at each of the plurality of egresses, and communicate the target packet admission rate to an ingress of the plurality of ingresses.

Growing community of inventors

Roseville, CA, United States of America

Mark Shillingburg