Method of forming routing data

• US 6,333,918 B1
• Filed: 04/08/1999
• Issued: 12/25/2001
• Est. Priority Date: 12/21/1995
• Status: Expired due to Term

• Current Assignee: Transpacific Silica LLC (Intellectual Ventures LLC)
• Original Assignee: Siemens AG
• Inventors: Hummel, Heinrich
• Primary Examiner(s): HSU, ALPUS
• Application Number:
  US09/091,636
• Time in Patent Office: 992 Days
• Field of Search: 370/217, 370/218, 370/225, 370/228, 370/229, 370/235, 370/238, 370/254, 370/255, 370/256, 370/389, 370/395, 370/396, 370/397, 370/400, 370/401, 709/238, 709/239, 709/240, 709/241, 709/242, 709/243
• US Class Current: 370/238
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/34 Source routing

Abstract

Switching nodes of a communications network are assigned subnetworks and are interconnected to one another in any desired fashion. Stored in a source switching node is at least topology information on the node'"'"'s own subnetwork and on the interconnection of the subnetworks. In addition, the source switching node is provided with the communications conditions which are required for the communications link to be set up. By reference to the topology information, a subset of switching nodes and connecting lines which satisfies the communications conditions is selected and a route to the destination switching node is determined. Included in this process is a route which, in the direction from the source switching node to the destination switching node, leaves at least one subnetwork once and returns to the subnetwork again in the further course of the route. The routing information is then formed from the route which has been determined.

Claims

1. A method for forming routing information for a connection set-up, satisfying adjustable communications conditions, from a source switching node to a destination switching node, in a communications network having at least two subnetworks with switching nodes and connecting lines which connect the at least two subnetworks, subnetworks being connected to one another via connecting lines and topology information on the subnetwork to which the source switching node belongs, and at least on an interconnection of the subnetworks being stored so as to be available for said source switching node, comprising the steps of:

selecting a subset of the switching nodes and connecting lines which satisfies the communications conditions and whose topology information is stored in the source switching node;

determining a route using elements of this set, which, in a direction from the source switching node to the destination switching node, leaves at least one subnetwork once and returns to said at least one subnetwork, and

forming routing information from the route which has been determined.

2. The method as claimed in claim 1, wherein based on hierarchically organized switching nodes which are represented by logical nodes of different orders, the route is determined with exclusion of parts of the hierarchy.

3. The method as claimed in claim 1, wherein a subnetwork which contains the destination switching node is determined in the source switching node from the topology information.

4. The method as claimed in claim 1, wherein a route and a description of a route is determined in accordance with principles of a Private Network Node Protocol.

5. The method as claimed in claim 4, wherein based on topology information, at least one subnetwork is represented by a complex switching node.

6. The method as claimed in claim 5, wherein a complex switching node is defined by at least one port node, a nucleus node, port-nucleus connecting lines and port-port connecting lines.

7. The method as claimed in claim 6, wherein connecting lines relating to port-nucleus links and port-port links are removed during formation of the routing information.

8. The method as claimed in claim 1, wherein connecting lines between two switching nodes in both traffic directions are handled independently.

9. The method as claimed in claim 1, wherein the route is determined according to a Dijkstra algorithm.

10. The method as claimed in claim 1, wherein when the communications conditions for a route which has already been determined are not fulfilled, at least one of a respective switching node and respective connecting line are signalled to the source switching node.