US5793765A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for selecting links in networks
Assignee: Koninklijke PTT Nederland NV
•
Filing: 1994-09-06
•
Granted: 1998-08-11
•
Expires: 2014-09-06
Abstract
Abstract Determining, in a transport network, a link between a source and a destination. The network is partitioned into subnetworks between which sublinks are determined. Each subnetwork has access points which indicate the transport capacity of the subnetwork between the access points. The sublinks, in each case, extend from a first access point to a second access point. In a network having a distributed control, the sublinks are determined successively between the link already determined and a remaining subnetwork. In this arrangement, the remaining subnetwork, in each case, includes an access point already associated with the destination and does not include an access point already associated with the link. Preferably, the access points, in each case, indicate the available capacity of a subnetwork.
Inventors
- 👤 Cornelis Boer
- 👤 Johannes Cornelis De Kruif
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 03:29
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/46; H04L45/02; H04L45/04; H04L45/42
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
110 words
Method for determining, in a transport network, a link between a source and a destination, the method comprising steps of: a) partitioning the transport network into subnetworks; b) determining sublinks between the subnetworks; and c) designating, for each one of the subnetworks, access points which indicate the transport capacity of the one of the subnetworks between the access points, wherein, for each one of the sublinks, the one of the sublinks extends from one of the access points of one of the subnetworks to one of the access points of another of the subnetworks; and d) reducing the size of the sublinks to be determined by repeatedly partitioning the subnetworks.
Claim 2
Dependent Claim
110 words
Method for determining, in a transport network, a link between a source and a destination, the method comprising steps of: a) partitioning the transport network into subnetworks; b) determining sublinks between the subnetworks; and c) designating, for each one of the subnetworks, access points which indicate the transport capacity of the one of the subnetworks between the access points, wherein, for each one of the sublinks, the one of the sublinks extends from one of the access points of one of the subnetworks to one of the access points of another of the subnetworks; and d) reducing the size of the sublinks to be determined by repeatedly partitioning the subnetworks.
Claim 3
Dependent Claim
171 words
The method according to claim 1, wherein the transport network has a centralized control, wherein a source access point is associated with the source and a destination access point is associated with the destination, and wherein one of the access points of one of the subnetworks is initially equated with the source access point and one of the access points of an other of the subnetworks is initially equated with the destination access point, the method further comprising steps of: e) selecting mutually exclusive subnetworks, each having a first access point and a second access point, wherein each one of the mutually exclusive subnetworks has a sublink between the second access point of one of the mutually exclusive subnetworks and a first access point of another of the mutually exclusive subnetworks; f) recording the sublink; and g) partitioning the mutually exclusive subnetworks into further subnetworks, wherein steps (e) through (g) are repeated until an unbroken chain of sublinks has been recorded from the source access point to the destination access point.
Claim 4
Dependent Claim
157 words
The method of claim 1 wherein the transport network has a distributed control, and wherein one of the subnetworks is a network element, said one of the subnetworks having access points, the method comprising further steps of: e) equating one of the access points of the one of the subnetworks with the access point of the transport network; f) for each one of the other of the subnetworks, equating one of the access points of the one of the other of the subnetworks with the destination access point of the transport network; g) for each one of the other of the subnetworks, defining a link from another one of the access points of the one of the other of the subnetworks to another of the access points of the one of the subnetworks, wherein steps (e) through (g) are repeated until the network element has an access point including the destination access point of the transport network.
Claim 5
Dependent Claim
25 words
The method according to claim 1, wherein each of the access points represents an available free transport capacity of a corresponding one of the subnetworks.
Claim 6
Dependent Claim
16 words
The method according to claim 1, wherein the transport network is modeled in an object-oriented way.
Claim 7
Dependent Claim
30 words
The method according to claim 1, further comprising a step of e) allocating, to each one of the subnetworks, a control for determining links within the one of the subnetworks.
Claim 8
Dependent Claim
14 words
The method according to claim 1, wherein the transport network comprises a communication network.
Claim 9
Dependent Claim
17 words
The method according to claim 7, wherein communication occurs over the transport network through asynchronous transfer mode.
Claim 10
Dependent Claim
48 words
The method according to claim 2, further comprising a step of: b) coupling the transport network having a centralized control with a network having a distributed using a corresponding functional division of the respective controls, so that control information having a universal structure is exchanged between the controls.
Claim 11
Dependent Claim
51 words
The method according to claim 3 further comprising a step of: h) coupling a transport network having a centralized control and the transport network having a distributed control by using a corresponding functional division of the respective controls, so that control information having a universal structure is exchanged between the controls.
Claim 12
Independent Claim
159 words
A method for determining a link between a source access point of a network an a destination access point of a network, the method comprising steps of: a) partitioning the network into subnetworks, each one of the subnetworks having a first access point and a second access point, each of the first and second access points indicating a transport capacity of the one of the subnetworks; and b) for at least two of the subnetworks, determining a sublink from the first access point of a first of the two subnetworks, to the second access point of a second of the two subnetworks, wherein a first access point of one of the subnetworks corresponds to the source access point of the network, wherein a second access point of another of the subnetworks corresponds to the destination access point of the network, and wherein steps (a) and (b) are repeated such that at least one of the subnetworks is further partitioned.
Claim 13
Independent Claim
159 words
A method for determining a link between a source access point of a network an a destination access point of a network, the method comprising steps of: a) partitioning the network into subnetworks, each one of the subnetworks having a first access point and a second access point, each of the first and second access points indicating a transport capacity of the one of the subnetworks; and b) for at least two of the subnetworks, determining a sublink from the first access point of a first of the two subnetworks, to the second access point of a second of the two subnetworks, wherein a first access point of one of the subnetworks corresponds to the source access point of the network, wherein a second access point of another of the subnetworks corresponds to the destination access point of the network, and wherein steps (a) and (b) are repeated such that at least one of the subnetworks is further partitioned.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-08-10 | 2002-02-09 | 2002-08-11 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-08-10 | 2006-02-09 | 2006-08-11 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-08-10 | 2010-02-09 | 2010-08-11 | $7700.00 | Window Closed / Lapsed |