Patent US1755112A successfully refreshed from Google Patents.
Patent US5586116A successfully refreshed from Google Patents.
US5586116A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for routing messages
Assignee: Siemens AG
•
Filing: 1991-12-16
•
Granted: 1996-12-17
•
Expires: 2011-12-16
Abstract
Abstract PCT No. PCT/EP91/02412 Sec. 371 Date Jun. 24, 1993 Sec. 102(e) Date Jun. 24, 1993 PCT Filed Dec. 16, 1991 PCT Pub. No. WO92/11718 PCT Pub. Date Jul. 9, 1992In a network with switching elements, a transmission path is found in that each destination address at a switching element is allocated a group of outputs via which messages can be transmitted to this destination address. Within this group of outputs, a search is made for a free output and messages are buffered as long as there is no output free within this group. Thus, in the process, there is deliberately no exclusive use of a specific output and each destination address is allocated a plurality of possible outputs. As a result, the probability of a blockage of outputs is reduced and the network throughput is increased.
Inventors
- 👤 Holm Hofestadt
- 👤 Erwin Reyzl
- 👤 Peter Thompson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 12:24
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/25; H04L49/256; H04L49/15; H04L49/1553
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
114 words
A method for routing messages to destination addresses in networks with switching elements, comprising the steps of: assigning to each destination address at each switching element a group of outputs of said each switching element, searching for a free output within said group of outputs, delaying each of said messages as long as no output is free within the group, and connecting individual outputs of the group to different transmission paths, wherein said step of assigning said group of outputs takes place in such a way that each destination address has a sub-set of all the destination addresses assigning to it and each of these sub-sets has a group of outputs assigned to it.
Claim 2
Independent Claim
114 words
A method for routing messages to destination addresses in networks with switching elements, comprising the steps of: assigning to each destination address at each switching element a group of outputs of said each switching element, searching for a free output within said group of outputs, delaying each of said messages as long as no output is free within the group, and connecting individual outputs of the group to different transmission paths, wherein said step of assigning said group of outputs takes place in such a way that each destination address has a sub-set of all the destination addresses assigning to it and each of these sub-sets has a group of outputs assigned to it.
Claim 3
Independent Claim
113 words
A method for routing messages to destination addresses in networks with switching elements, comprising the steps of: assigning to each destination address at each switching element a group of outputs of said each switching element, searching for a free output within said group of outputs, delaying each of said messages as long as no output is free within the group, and connecting individual outputs of the group to different transmission paths assigning to the set of all destination addresses an address interval which is subdivided into address sub-intervals, assigning to the set of all outputs an output interval which is subdivided into output sub-intervals, and assigning to each address sub-interval an output sub-interval.
Claim 4
Independent Claim
113 words
A method for routing messages to destination addresses in networks with switching elements, comprising the steps of: assigning to each destination address at each switching element a group of outputs of said each switching element, searching for a free output within said group of outputs, delaying each of said messages as long as no output is free within the group, and connecting individual outputs of the group to different transmission paths assigning to the set of all destination addresses an address interval which is subdivided into address sub-intervals, assigning to the set of all outputs an output interval which is subdivided into output sub-intervals, and assigning to each address sub-interval an output sub-interval.
References Cited (Backward Citations)
US4754451A
Cited
US5179558A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-12-17 | 2000-06-17 | 2000-12-17 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-12-17 | 2004-06-17 | 2004-12-17 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-12-17 | 2008-06-17 | 2008-12-17 | $7700.00 | Window Closed / Lapsed |