Patent US5537468A successfully refreshed from Google Patents.
US5537468A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for the non-hierarchical routing of traffic in a communications network
Assignee: Nokia Solutions and Networks GmbH and Co KG
•
Filing: 1992-10-06
•
Granted: 1996-07-16
•
Expires: 2012-10-06
Abstract
Abstract A non-hierarchical method for routing traffic to achieve optimum throughput values under all traffic load states by modifying the number of alternate routes available for overflow traffic in substantially real time, independent of the traffic load states of the alternate routes. First and second switching centers (V1, V2) are connected to a non-hierarchical communications network comprising a number of interconnected switching nodes (A, B, C, D, E, F) including at least one originating switching node (A) and at least one destination switching node (D) such that a number of connection paths exist between the originating and destination switching nodes (A, D). Originating switching node (A) comprises a routing process (RP), a routing table (RT) and a local trunk status map (LTSM) for determining an alternate route sequence (AWS).
Inventors
- 👤 Harro L. Hartmann
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 15:09
CPC Classifications
H; H04; H04Q; H04Q3/00; H04Q3/0016; H04Q3/002; H04Q3/64; H04Q3/66; H04Q2213/00; H04Q2213/13103; H04Q2213/13141; H04Q2213/13146; H04Q2213/13164; H04Q2213/13166; H04Q2213/13332; H04Q2213/13344; H04Q2213/13352; H04Q2213/13353
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
237 words
A method for non-hierarchical routing of traffic in a communications network, comprising the steps of: providing a number of interconnected switching nodes including at least one originating switching node and at least one destination switching node such that a number of connection paths exist between said originating switching node and said destination switching node, said originating switching node comprising a routing process, a routing table and a local trunk status map for determining an alternate route sequence, directing the traffic between said originating switching node and said destination switching node via at least one planned route, directing said traffic only via real time alternate routes between said originating switching node and said destination switching node in accordance with a real time alternate route sequence when a connection via said at least one planned route is not possible, periodically determining the real time alternative routes and the real time alternate route sequence, that represents a sequence of real time alternate routes ordered in accordance with momentary traffic load states, in substantially real time intervals, said real time alternate route sequence being determined in said originating switching node, and the real time alternate route sequence being determined from a predetermined set of real time alternate routes, such that an alternate route in the set of real time alternate routes, the traffic load state of which exceeds a certain threshold value, is excluded from the real time alternate route sequence.
Claim 2
Independent Claim
237 words
A method for non-hierarchical routing of traffic in a communications network, comprising the steps of: providing a number of interconnected switching nodes including at least one originating switching node and at least one destination switching node such that a number of connection paths exist between said originating switching node and said destination switching node, said originating switching node comprising a routing process, a routing table and a local trunk status map for determining an alternate route sequence, directing the traffic between said originating switching node and said destination switching node via at least one planned route, directing said traffic only via real time alternate routes between said originating switching node and said destination switching node in accordance with a real time alternate route sequence when a connection via said at least one planned route is not possible, periodically determining the real time alternative routes and the real time alternate route sequence, that represents a sequence of real time alternate routes ordered in accordance with momentary traffic load states, in substantially real time intervals, said real time alternate route sequence being determined in said originating switching node, and the real time alternate route sequence being determined from a predetermined set of real time alternate routes, such that an alternate route in the set of real time alternate routes, the traffic load state of which exceeds a certain threshold value, is excluded from the real time alternate route sequence.
Claim 3
Dependent Claim
51 words
The method according to claim 1, wherein each of said alternate routes has links for interconnecting said switching nodes and wherein the traffic load state of an alternate route is determined by means of a seizure state of an outgoing primary link of the alternate route from the originating switching node.
Claim 4
Dependent Claim
37 words
The method according to claim 1, wherein each of said alternate routes has links for interconnecting said switching nodes and wherein the traffic load state of an alternate route is determined by means of blocking successor links.
Claim 5
Dependent Claim
55 words
The method according to claim 1, wherein each of said alternate routes has links for interconnecting said switching nodes and wherein the traffic load state of an alternate route is determined by means of a seizure state of all links forming the alternate route and availability of intermediate switching nodes located on the alternate route.
Claim 6
Dependent Claim
56 words
The method according to claim 1, wherein each of said alternate routes has links for interconnecting said switching nodes and wherein a particular threshold value is modified with regards to a specific link and in substantially real time in dependence on a difference in number, averaged over a prediction interval, between call arrivals and call completions.
References Cited (Backward Citations)
US4284852A
Cited
US4345116A
Cited
US4669113A
Cited
US4704724A
Cited
US4788721A
Cited
WO1990001237A1
Cited
US4991204A
Cited
EP0376556A2
Cited
EP0449480A2
Cited
US5058105A
Cited
WO1991020148A1
Cited
US5142570A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-07-16 | 2000-01-15 | 2000-07-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-07-16 | 2004-01-15 | 2004-07-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-07-16 | 2008-01-15 | 2008-07-16 | $7700.00 | Window Closed / Lapsed |