US5327544A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for designing gateways for computer networks
Assignee: AMERICAN AND TELEGRAPH Co
•
Filing: 1991-08-29
•
Granted: 1994-07-05
•
Expires: 2011-08-29
Abstract
Abstract A method for synthesizing gateways from formal specifications. We present an efficient procedure that computes protocol converters from formal specifications. This procedure has a polynomial number of computation steps. The method involves computation of a common subset of services. This common subset is used to compute the converter. Conditions under which the converter can be stateless are also described.
Inventors
- 👤 David Lee
- 👤 Arun N. Netravali
- 👤 Krishan K. Sabnani
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 05:50
CPC Classifications
H; H04; H04L; H04L69/00; H04L69/08
Claims Analysis
Total Claims: 4
Claim 1
Independent Claim
200 words
A method for synthesizing a gateway between a plurality of protocols, wherein a protocol provides a set of services, wherein each protocol is represented by a set of one or more directed graphs, wherein each directed graph includes a set of one or more edges, the method comprising the steps of: (a) determining a set of common services equal to a subset of the intersection of the sets of services provided by at least two of the protocols; and (b) determining a set of one or more processes to represent the set of common services; wherein the step of determining a set of one or more processes comprises the steps of: (1) deleting an edge of a first directed graph when the edge does not correspond to a member of the set of common services to form a first pruned directed graph; (2) deleting an edge of the first pruned directed graph which is not within a strongly connected component of the first pruned graph that contains the initial state to form a second pruned directed graph; and (3) deleting an edge of a second directed graph which does not corresponding to an edge in the second pruned directed graph.
Claim 2
Independent Claim
200 words
A method for synthesizing a gateway between a plurality of protocols, wherein a protocol provides a set of services, wherein each protocol is represented by a set of one or more directed graphs, wherein each directed graph includes a set of one or more edges, the method comprising the steps of: (a) determining a set of common services equal to a subset of the intersection of the sets of services provided by at least two of the protocols; and (b) determining a set of one or more processes to represent the set of common services; wherein the step of determining a set of one or more processes comprises the steps of: (1) deleting an edge of a first directed graph when the edge does not correspond to a member of the set of common services to form a first pruned directed graph; (2) deleting an edge of the first pruned directed graph which is not within a strongly connected component of the first pruned graph that contains the initial state to form a second pruned directed graph; and (3) deleting an edge of a second directed graph which does not corresponding to an edge in the second pruned directed graph.
Claim 3
Independent Claim
216 words
A method for synthesizing a gateway between a plurality of protocols, wherein a protocol provides a set of services, wherein each protocol is represented by a set of one or more directed graphs, wherein said directed graph includes a set of one or more edges, the method comprising the steps of: (a) determining a set of common services equal to a subset of the intersection of the sets of services provided by at least two of the protocols; and (b) determining a set of one or more processes to represent the set of common serves; wherein the step of determining a set of one or more processes comprises the steps of: (1) deleting an edge of a first graph when the edge does not correspond to a member of the set of common services to from a first pruned directed graph; (2) determining a strong connected component of the first pruned directed graph which contains the initial state to form a strongly connected graph; (3) removing an edge of the first pruned directed graph which does not correspond to an edge within the strongly connected graph to form a second pruned directed graph; and (4) deleting an edge of a second directed graph which does not correspond to an edge in the second pruned directed graph.
Claim 4
Independent Claim
216 words
A method for synthesizing a gateway between a plurality of protocols, wherein a protocol provides a set of services, wherein each protocol is represented by a set of one or more directed graphs, wherein said directed graph includes a set of one or more edges, the method comprising the steps of: (a) determining a set of common services equal to a subset of the intersection of the sets of services provided by at least two of the protocols; and (b) determining a set of one or more processes to represent the set of common serves; wherein the step of determining a set of one or more processes comprises the steps of: (1) deleting an edge of a first graph when the edge does not correspond to a member of the set of common services to from a first pruned directed graph; (2) determining a strong connected component of the first pruned directed graph which contains the initial state to form a strongly connected graph; (3) removing an edge of the first pruned directed graph which does not correspond to an edge within the strongly connected graph to form a second pruned directed graph; and (4) deleting an edge of a second directed graph which does not correspond to an edge in the second pruned directed graph.
References Cited (Backward Citations)
US4648061A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1997-07-04 | 1998-01-03 | 1998-07-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2001-07-04 | 2002-01-03 | 2002-07-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2005-07-04 | 2006-01-03 | 2006-07-05 | $7700.00 | Window Closed / Lapsed |