Abstract: A routing protocol, the routing protocol includes the steps of: receiving a packet at an ingress node of a distributed router, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address; converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and routing the packet to the local destination address.

Abstract: A routing protocol, the routing protocol includes the steps of: receiving a packet at an ingress node of a distributed router, the ingress node having an ingress node address, and the packet having a packet header containing a global destination address; converting the global destination address into a local destination address, the local destination address identifying a location on the distributed router; and routing the packet to the local destination address.

Abstract: A method for synchronizing multicast message subflows in a switched network includes associating, with a processing device, a first destination identifier corresponding to a multicast message with a first queue that corresponds to a first output port of a switching device, associating, with a processing device, a second destination identifier corresponding to the multicast message with a second queue that corresponds to a second output port of the switching device, pausing the first queue in response to a message counter corresponding to the first queue crossing a first predetermined threshold, and unpausing the first queue in response to the message counter crossing a second predetermined threshold, wherein the message counter indicates a quantity of data that has been forwarded by the first queue but remains to be forwarded by the second queue.

Abstract: A multiprocessor computer system includes a plurality of processor nodes and at least a three-tier hierarchical network interconnecting the processor nodes. The hierarchical network includes a plurality of routers interconnected such that each router is connected to a subset of the plurality of processor nodes; the plurality of routers are arranged in a hierarchy of n?3 tiers (T1, . . . , Tn); the plurality of routers are partitioned into disjoint groups at the first tier T1, the groups at tier Ti being partitioned into disjoint groups (of complete Ti groups) at the next tier Ti+1 and a top tier Tn including a single group containing all of the plurality of routers; and for all tiers 1?i?n, each tier-Ti?1 subgroup within a tier Ti group is connected by at least one link to all other tier-Ti?1 subgroups within the same tier Ti group.

Abstract: A virtual network is implemented on a physical network. A virtual network data packet is tunneled through the physical network via encapsulation within a physical network data packet and via transmission of the physical network data packet through the physical network. A network congestion notification capability of the virtual network is preserved and modified during transmission of virtual network data through the physical network and vice-versa. Congestion notification metadata can be copied from a header of a virtual network data packet to a header of a physical network data packet when the virtual network data packet is encapsulated into the physical network data packet. Congestion notification metadata can be copied from a header of a physical network data packet to a header of a virtual network data packet when the virtual network data packet is decapsulated from the physical network data packet.

Abstract: A multiprocessor computer system includes a plurality of processor nodes and at least a three-tier hierarchical network interconnecting the processor nodes. The hierarchical network includes a plurality of routers interconnected such that each router is connected to a subset of the plurality of processor nodes; the plurality of routers are arranged in a hierarchy of n?3 tiers (T1, . . . , Tn); the plurality of routers are partitioned into disjoint groups at the first tier T1, the groups at tier Ti being partitioned into disjoint groups (of complete Ti groups) at the next tier Ti+1 and a top tier Tn including a single group containing all of the plurality of routers; and for all tiers 1?i?n, each tier-Ti?1 subgroup within a tier Ti group is connected by at least one link to all other tier-Ti?1 subgroups within the same tier Ti group.

Abstract: A method of monitoring transmission of data in a network is provided. The method includes: receiving data packets for one or more data flows by at least one of a plurality of network switches; sampling queue data in each of the plurality of network switches, the sampled queue data taken from at least one queue attached to a switch port to which the one or more data packets have been forwarded; and transmitting the sampled queue data to a logically centralized network controller connected to the plurality of switches, the network controller configured to control the plurality of network switches, the network controller configured to determine whether a congestion, unfairness or Service Level Agreement (SLA) infringement condition exists in one or more switches based on the sampled queue data and send a control message to one or more data flow sources based on the congestion, unfairness or SLA infringement condition.

Abstract: A multiprocessor computer system includes a plurality of processor nodes and at least a three-tier hierarchical network interconnecting the processor nodes. The hierarchical network includes a plurality of routers interconnected such that each router is connected to a subset of the plurality of processor nodes; the plurality of routers are arranged in a hierarchy of n?3 tiers (T1, . . . , Tn); the plurality of routers are partitioned into disjoint groups at the first tier T1, the groups at tier Ti being partitioned into disjoint groups (of complete Ti groups) at the next tier Ti+1 and a top tier Tn including a single group containing all of the plurality of routers; and for all tiers 1?i?n, each tier-Ti?1 subgroup within a tier Ti group is connected by at least one link to all other tier-Ti?1 subgroups within the same tier Ti group.

Abstract: A multiprocessor computer system includes a plurality of processor nodes and at least a three-tier hierarchical network interconnecting the processor nodes. The hierarchical network includes a plurality of routers interconnected such that each router is connected to a subset of the plurality of processor nodes; the plurality of routers are arranged in a hierarchy of n?3 tiers (T1, . . . , Tn); the plurality of routers are partitioned into disjoint groups at the first tier T1, the groups at tier Ti being partitioned into disjoint groups (of complete Ti groups) at the next tier Ti+1 and a top tier Tn including a single group containing all of the plurality of routers; and for all tiers 1?i?n, each tier-Ti?1 subgroup within a tier Ti group is connected by at least one link to all other tier-Ti?1 subgroups within the same tier Ti group.

Abstract: The invention is directed to a switching device (Sij) adapted to connects parts of a computer interconnection network, having N input ports (Ia-Ih) and N output ports (Oa-Oh), the device adapted for routing data packets by means of direct crosspoints (CPxy), the direct crosspoints configured for enabling direct connectivity between each of the N input ports to a subset m<N of the output ports only, in accordance with connectivity needs of the computer interconnection network. Preferably, it further comprises an additional circuitry (L) and additional crosspoints (APx,L, APL,y) configured such that at least some of the input ports of the switching device can be indirectly connected to at least some of the output ports of the switching device, through the additional circuitry. The invention further concerns an interconnection network and a method for routing data.

Abstract: A method for synchronizing multicast message subflows in a switched network includes associating, with a processing device, a first destination identifier corresponding to a multicast message with a first queue that corresponds to a first output port of a switching device, associating, with a processing device, a second destination identifier corresponding to the multicast message with a second queue that corresponds to a second output port of the switching device, pausing the first queue in response to a message counter corresponding to the first queue crossing a first predetermined threshold, and unpausing the first queue in response to the message counter crossing a second predetermined threshold, wherein the message counter indicates a quantity of data that has been forwarded by the first queue but remains to be forwarded by the second queue.

Abstract: The invention is directed to a switching device (Sij) adapted to connects parts of a computer interconnection network, having N input ports (Ia-Ih) and N output ports (Oa-Oh), the device adapted for routing data packets by means of direct crosspoints (CPxy), the direct crosspoints configured for enabling direct connectivity between each of the N input ports to a subset m<N of the output ports only, in accordance with connectivity needs of the computer interconnection network. Preferably, it furelm.) they comprises an additional circuitry (L) and additional crosspoints (APx,L, APL,y) configured such that at least some of the input ports of the switching device can be indirectly connected to at least some of the output ports of the switching device, through the additional circuitry. The invention further concerns an interconnection network and a method for routing data.

Abstract: An example of a method comprises the steps of generating at a local node where a congestion emerges a first congestion information; sending the first congestion information to at least one upstream node; responsive to one received first congestion information comparing the content of the received first congestion information with a present local status based on a set of predefined rules in order to identify at least one packet stream causing the congestion, and generating a second congestion information comprising the identified at least one packet stream causing the congestion; and sending the second congestion information to at least one further upstream node from where the identified at least one packet stream was received.

Abstract: The present invention discloses a memory sharing mechanism based on priority elevation. In accordance with the present invention, there is provided an apparatus and method for transporting packets of data in a communication device, wherein each packet is assigned one of several priorities and received based on memory state information. The method comprises the steps of storing the received packets in a memory and modifying the assigned priority of any of the packets causing congestion within the memory.

Abstract: A method and system for reducing arbitration latency employs speculative transmission (STX) without prior arbitration in combination with routing fabric scheduled arbitration. Packets are sent from source locations to a routing fabric through scheduled arbitration, and also through speculative arbitration, to non-contentiously allocate outputs that were not previously reserved in the routing fabric to the speculatively transmitted packets.

Abstract: A method for scheduling unicast and multicast traffic in an interconnecting fabric performs within each time slot the following steps. First a multicast cell scheduling (61) and independently thereof a unicast cell scheduling (62) is performed. Then, the unicast cell schedule and the multicast cell schedule are merged to a merged schedule (63), wherein in the case a scheduled connection cannot be included in the merged schedule the scheduled connection is included in the merged schedule in a later time slot (66, 63).

Abstract: A network switch device receives a communication packet having a source MAC address s and a destination MAC address d at a switch port p. Then, the network switch device determines whether a valid routing table entry (s, p) exists, there by indicating that the source MAC address s is reachable via a switch port p. The network switch device further determines for the destination MAC address d whether there is at least one switch port q for which a valid routing table entry (d, q) exists, there by indicating that d is reachable via a switch port q. When the routing table entries (s, p) and (d, q) exist, the network switch device routes the communication packet to the switch port q.

Abstract: The invention is directed to a system comprising routing nodes, computing nodes, first communication links, wherein the first communication links connect pairs consisting of two routing nodes together, the routing nodes and the first communication links forming a hypercube structure, second communication links, wherein the second communication links connect pairs consisting of a routing node and a computing node together, third communication links, wherein the third communication links connect pairs consisting of two routing nodes together.

Abstract: A method is described to operate a crossbar switch comprising a crossbar fabric with N sending and M receiving ports, with port cards connected to at least one sending and/or receiving port each of the crossbar fabric, said crossbar switch further comprising a control unit connected with the port cards via discrete control channel links, wherein C ports are clustered on a single receiving port card so that such a receiving port card in a single time-step can receive up to C data cells from C sending port cards simultaneously. According to said method the control channel links are used to relay up to C acknowledgements between at least one receiving port card and at least one sending port card.

Abstract: A network switch device receives a communication packet having a source MAC address s and a destination MAC address d at a switch port p. Then, the network switch device determines whether a valid routing table entry (s, p) exists, there by indicating that the source MAC address s is reachable via a switch port p. The network switch device further determines for the destination MAC address d whether there is at least one switch port q for which a valid routing table entry (d, q) exists, there by indicating that d is reachable via a switch port q. When the routing table entries (s, p) and (d, q) exist, the network switch device routes the communication packet to the switch port q.