Abstract: Described herein are a method and device for determining paths in a network topology. The method and device provide a source/destination pair representing a source and a destination in the network topology, provide a channel list comprising a topological ordering of channel identifiers representing communication channels in the network topology, and provide at least one path connecting the source and the destination based on the channel list.

Abstract: Described herein are a method and device for determining paths in a network topology. The method and device provide a source/destination pair representing a source and a destination in the network topology, provide a channel list comprising a topological ordering of channel identifiers representing communication channels in the network topology, and provide at least one path connecting the source and the destination based on the channel list.

Abstract: A network comprises nodes and links. In addition to a default topology there are backup configurations. Each node is inhibited from transferring data between nodes in at least one backup configuration. When a node detects a fault in the reception of data transmitted to a neighbouring node, it switches to a backup configuration in which the neighbouring node is inhibited. In one arrangement a backup configuration has at least one link which is restricted by having a high weighting so that it transmits data to a node only if that node is the final destination node for that data. Additionally, if the neighbouring node is the final destination, and routing of data is still unsuccessful in the backup configuration, the detecting node selects and switches to an alternate backup configuration in which the detecting node is inhibited.

Abstract: A method for establishing a routing scheme defining a path between any given pair of source node and destination node in a network including a plurality of nodes connected by links. The method comprises defining a plurality of virtual network layers, each virtual network layer comprising addresses for identifying each node, and channels for communicating between said nodes using said addresses, and defining a routing function for each layer, the routing scheme comprising all routing functions, each routing function comprising a set of source node/destination node pairs and a path connecting each pair.

Abstract: A method for establishing a routing scheme defining a path between any given pair of source node and destination node in a network including a plurality of nodes connected by links. The method comprises defining a plurality of virtual network layers, each virtual network layer comprising addresses for identifying each node, and channels for communicating between said nodes using said addresses, and defining a routing function for each layer, the routing scheme comprising all routing functions, each routing function comprising a set of source node/destination node pairs and a path connecting each pair.

Abstract: A network comprises nodes and links. In addition to a default topology there are backup configurations. Each node is inhibited from transferring data between nodes in at least one backup configuration. When a node detects a fault in the reception of data transmitted to a neighbouring node, it switches to a backup configuration in which the neighbouring node is inhibited. In one arrangement a backup configuration has at least one link which is restricted by having a high weighting so that it transmits data to a node only if that node is the final destination node for that data. Additionally, if the neighbouring node is the final destination, and routing of data is still unsuccessful in the backup configuration, the detecting node selects and switches to an alternate backup configuration in which the detecting node is inhibited.

Abstract: The present invention describes a method and system that allows a network to alter its routing strategy from one routing function to another while the network is up and running. For networks with link level backpressure, the method provides a deadlock free transition between the routing strategies. A variant of the method also guarantees that all packets will be delivered in order.