Abstract: A router (14) for use in a communication network (10) and an associated method. The router (14) includes input ports each having an associated input buffer for receiving data packets from a sending device and output ports for sending data packets to a receiving device. The router (14) also includes a means to direct data packets from the or each input port to one or more of the output ports and a means for providing information to each sending device such that a determination may be made as to whether or not the sending device may transmit packets in order to assure lossless transfer. The means to direct data packets from a particular input port includes a method of control in order to regulate the transfer of data packets, where this regulation is based on a count of the data packets previously transferred from that input port and not yet output from the output port.

Abstract: A router (14) for use in a communication network (10) and an associated method. The router (14) includes input ports each having an associated input buffer for receiving data packets from a sending device and output ports for sending data packets to a receiving device. The router (14) also includes a means to direct data packets from the or each input port to one or more of the output ports and a means for providing information to each sending device such that a determination may be made as to whether or not the sending device may transmit packets in order to assure lossless transfer. The means to direct data packets from a particular input port includes a method of control in order to regulate the transfer of data packets, where this regulation is based on a count of the data packets previously transferred from that input port and not yet output from the output port.

Abstract: A method of determining where to place routing constraints known as cuts in a network to result in a no-loop network, and a method of implementing such constraints in a hierarchical network; to avoid deadlocks. The method of determining where to place cuts in a network to result in a no-loop network comprises an algorithm for numbering the nodes within the network which is used to determine where the cuts are to be placed. The method of implementing constraints in a hierarchical network to result in a no-loop network comprises an algorithm for independently determining cuts and meta-cuts for each peer group, and imposing the necessary routing constraints in the network.

Abstract: A method of determining where to place routing constraints known as cuts in a network to result in a no-loop network, and a method of implementing such constraints in a hierarchical network; to avoid deadlocks. The method of determining where to place cuts in a network to result in a no-loop network comprises an algorithm for numbering the nodes within the network which is used to determine where the cuts are to be placed. The method of implementing constraints in a hierarchical network to result in a no-loop network comprises an algorithm for independently determining cuts and meta-cuts for each peer group, and imposing the necessary routing constraints in the network.

Abstract: A method of controlling the flow of traffic in synchronous transfer mode (ATM) network (10), which brings into possible existence a class (class II) of ATM cells. The ATM network (10) comprises one or more ATM switches (14) coupled by links (20) providing communication channels between the ATM switches (14). The method subjects the class II cells received at an input port of a particular ATM switch (14) to control, originating within the switching element of that ATM switch. The method allows only up to a fixed number of class II cells from a particular input port to be in the switch awaiting onward transfer. Although the control is on class, it nonetheless tends to produce fairness in service among different connections.