US5884043A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Conversion technique for routing frames in a source route bridge network
Assignee: Geberit Technik AG
•
Filing: 1995-12-21
•
Granted: 1999-03-16
•
Expires: 2015-12-21
Abstract
Abstract A conversion technique efficiently discovers an optimal path from a source station to a destination station over a computer network. The technique involves converting an explorer frame to a specifically-routed frame at a bridge interconnecting the source's local subnetwork to other subnetworks of the computer network. Such conversion is made possible by providing routing information, comprising at least global topological information, to the bridge. Armed with the routing information, the bridge computes the optimal path and forwards the converted frame to the destination over that path.
Inventors
- 👤 Jacob Teplitsky
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-31 01:10
CPC Classifications
H; H04; H04L; H04L45/00; H04L45/26
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
120 words
A method for efficiently discovering an optimal path from a source station to a destination station over a computer network having a plurality of subnetworks interconnected by a bridge, the method comprising the steps of: issuing an explorer frame from the source station to the bridge over the computer network; computing an entire optimal path to the destination station at the bridge using routing information stored at the bridge; directly converting, via single message conversion at said bridge, the explorer frame to a single non-explorer, non-broadcast, specifically-routed frame for routing to the destination station directly via only the computed optimal path; and forwarding the converted specifically-routed frame from the bridge to the destination station directly over the computed optimal path.
Claim 2
Independent Claim
120 words
A method for efficiently discovering an optimal path from a source station to a destination station over a computer network having a plurality of subnetworks interconnected by a bridge, the method comprising the steps of: issuing an explorer frame from the source station to the bridge over the computer network; computing an entire optimal path to the destination station at the bridge using routing information stored at the bridge; directly converting, via single message conversion at said bridge, the explorer frame to a single non-explorer, non-broadcast, specifically-routed frame for routing to the destination station directly via only the computed optimal path; and forwarding the converted specifically-routed frame from the bridge to the destination station directly over the computed optimal path.
Claim 3
Dependent Claim
24 words
The method of claim 1 further comprising the step of providing the routing information to the bridge using a database coupled to the bridge.
Claim 4
Dependent Claim
57 words
The method of claim 2 wherein the step of issuing comprises the steps of: creating a unicast explorer frame having an address of the destination station; transmitting the unicast explorer frame over a local subnetwork connected to the source station; and intercepting the unicast explorer frame at the bridge on the basis of the destination station address.
Claim 5
Dependent Claim
69 words
The method of claim 3 wherein the routing information comprises global network topology information pertaining to the computer network, and wherein the step of computing comprises the steps of: identifying the issued frame as the unicast explorer frame; accessing the database to acquire the global network topology information; and executing a conventional routing algorithm using the global nework topology information to compute the optimal path to the destination station.
Claim 6
Dependent Claim
66 words
The method of claim 4 wherein the step of converting comprises the steps of: copying the routing information relating to the optimal path into a routing information field of the frame; and changing the contents of (i) a type field of the frame to signify a specifically-routed frame and (ii) a routing field of the frame to indicate that routing information is contained in the frame.
Claim 7
Dependent Claim
33 words
The method of claim 5 further comprising the step of returning a response frame containing the routing information to the source station in response to the destination station receiving the converted specifically-routed frame.
Claim 8
Dependent Claim
67 words
The method of claim 2 wherein the step of issuing comprises the steps of: creating a broadcast explorer frame having a broadcast destination address of all stations coupled to a local subnetwork, the local subnetwork further connected to the source station; transmitting the broadcast explorer frame over the local subnetwork; and intercepting the broadcast explorer frame at the bridge on the basis of the broadcast destination address.
Claim 9
Dependent Claim
97 words
The method of claim 7 wherein the routing information comprises global network topology information and selected destination addresses, and wherein the step of computing comprises the steps of: identifying the issued frame as the broadcast explorer frame; analyzing network layer address information of the frame to determine the selected destination addresses of the frame; accessing the database to acquire those selected destination addresses and global network topology information; and executing a conventional routing algorithm using the global nework topology information to compute the optimal path to selected destination stations if the addresses are contained in the database.
Claim 10
Dependent Claim
66 words
The method of claim 8 wherein the step of converting comprises the steps of: copying the routing information relating to the optimal path into a routing information field of the frame; and changing the contents of (i) a type field of the frame to signify a specifically-routed frame and (ii) a routing field of the frame to indicate that routing information is contained in the frame.
Claim 11
Dependent Claim
33 words
The method of claim 9 further comprising the step of returning a response frame containing the routing information to the source station in response to the destination station receiving the converted specifically-routed frame.
References Cited (Backward Citations)
US5018133A
Cited
US5144622A
Cited
US5095480A
Cited
US5088090A
Cited
US5111453A
Cited
US5309437A
Cited
US5280480A
Cited
US5323394A
Cited
US5327424A
Cited
US5398242A
Cited
US5400333A
Cited
US5448565A
Cited
US5517620A
Cited
US5623532A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-03-15 | 2002-09-14 | 2003-03-16 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-03-15 | 2006-09-14 | 2007-03-16 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-03-15 | 2010-09-14 | 2011-03-16 | $7700.00 | Window Closed / Lapsed |