← Back to Patent Explorer
US6333918B1 Expired / Lapsed US ⏱️ 0.0 years remaining

Method of forming routing data

Assignee: TRANSPACIFIC SILICA LLC
•
Filing: 1996-12-04
•
Granted: 2001-12-25
•
Expires: 2016-12-04
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

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.

Inventors

  • 👤 Heinrich Hummel

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-08 22:06
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/02; H04L45/04; H04L45/34

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 166 words
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.
Claim 2
Independent Claim 166 words
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.
Claim 3
Dependent Claim 35 words
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.
Claim 4
Dependent Claim 28 words
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.
Claim 5
Dependent Claim 29 words
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.
Claim 6
Dependent Claim 24 words
The method as claimed in claim 4 , wherein based on topology information, at least one subnetwork is represented by a complex switching node.
Claim 7
Dependent Claim 31 words
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.
Claim 8
Dependent Claim 26 words
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.
Claim 9
Dependent Claim 22 words
The method as claimed in claim 1 , wherein connecting lines between two switching nodes in both traffic directions are handled independently.
Claim 10
Dependent Claim 18 words
The method as claimed in claim 1 , wherein the route is determined according to a Dijkstra algorithm.
Claim 11
Dependent Claim 43 words
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.

References Cited (Backward Citations)

US5144619A Cited
US5265092A Cited
US5541915A Cited
US5408469A Cited
US5491690A Cited
US5495479A Cited
US5488608A Cited
US5781537A Cited
US5629930A Cited
US5831982A Cited
US5781529A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2004-12-24 2005-06-25 2005-12-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2008-12-24 2009-06-25 2009-12-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2012-12-24 2013-06-25 2013-12-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag