Data communications network
First Claim
1. A distributed communications comprising:
- a plurality of nodes which are each capable of acting as source, sub-destination and destination nodes, the nodes being interconnected by links and each node having local processing and memory means,each node including in its memory means a stored list of destination nodes in association with a first stored list and a second stored list of its links of neighboring nodes,each entry in the stored list of destination nodes being associated with a respective link or neighboring node in said first stored list and in said second stored list,the processing means being arranged such that a datagram can be sent between one of said nodes acting as a source node and another of said nodes acting as a destination node via one or more other of said nodes acting as sub-destination nodes in response to the source node calling the destination node,each sub-destination node being determined by the link or neighboring node selected from said first stored list in the source node or in a preceding sub-destination node,the datagram being arranged to designate at least some of said sub-destination nodes as circuit nodes and to store circuit data in the memory means for the circuit nodes,said circuit data establishing a temporary circuit for date transmission between the source and destination nodes via said circuit nodes,each node traversed by said datagram which is not the source node, the destination node or a circuit node being determined by selecting that link or neighboring node from said second stored list in the immediately preceding node which is associated with a following designated circuit node in the path of the datagram,the criteria on which said first and second stored lists in each node are based being distinct and being biased towards optimum transmission of said data in said temporary circuit and optimum establishment of said temporary circuit, respectively.
1 Assignment
0 Petitions
Accused Products
Abstract
A network is arranged to generate circuits between source node (NS) and destination nodes (ND) by means of datagrams which are guided at each node over a path (D) which minimizes delay in establishing the circuit. Certain sub-destination nodes (NB and NC) are designated as intermediate circuit nodes by the datagram and accordingly a circuit (C) is established. Each circuit node is determined by the preceding circuit node in such a manner as to minimize the hop count to the destination node (ND). To this end, each node incorporates in its memory (M) a first list (LIST 1) showing the link with the best hop count to each possible destination node and also incorporates a list (LIST 2) of its links with the best transmission delay to the destination node. These lists are updated dynamically by means of routing information packets which are exchanged between neighboring nodes. However, best hop count and best delay information is not transmitted over those links (L) which are themselves the subject of that information. In this manner "ping-pong" type looping is avoided.
-
Citations
27 Claims
-
1. A distributed communications comprising:
-
a plurality of nodes which are each capable of acting as source, sub-destination and destination nodes, the nodes being interconnected by links and each node having local processing and memory means, each node including in its memory means a stored list of destination nodes in association with a first stored list and a second stored list of its links of neighboring nodes, each entry in the stored list of destination nodes being associated with a respective link or neighboring node in said first stored list and in said second stored list, the processing means being arranged such that a datagram can be sent between one of said nodes acting as a source node and another of said nodes acting as a destination node via one or more other of said nodes acting as sub-destination nodes in response to the source node calling the destination node, each sub-destination node being determined by the link or neighboring node selected from said first stored list in the source node or in a preceding sub-destination node, the datagram being arranged to designate at least some of said sub-destination nodes as circuit nodes and to store circuit data in the memory means for the circuit nodes, said circuit data establishing a temporary circuit for date transmission between the source and destination nodes via said circuit nodes, each node traversed by said datagram which is not the source node, the destination node or a circuit node being determined by selecting that link or neighboring node from said second stored list in the immediately preceding node which is associated with a following designated circuit node in the path of the datagram, the criteria on which said first and second stored lists in each node are based being distinct and being biased towards optimum transmission of said data in said temporary circuit and optimum establishment of said temporary circuit, respectively. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27)
-
Specification