Communications: electrical – Continuously variable indicating – With meter reading
Patent
1988-06-23
1989-10-10
Yusko, Donald J.
Communications: electrical
Continuously variable indicating
With meter reading
340827, 379220, 370 54, H04Q 1104, H04L 1120
Patent
active
048735175
ABSTRACT:
When computing a least weight path from an origin node to a destination node in a data communication network, a route-computing network node uses information provided by the origin and destination nodes to compute least weight routes from those nodes to adjacent network nodes. The route-computing network node uses information in the topology database to compute least weight routes from network nodes adjacent the origin node to network nodes adjacent the destination node. The results of the computations are concatenated to determine an optimum route from the origin node to the destination node. The topology database need not include information about the transmission groups connecting the origin/destination nodes to network nodes.
REFERENCES:
patent: 4317193 (1982-02-01), Joel, Jr.
patent: 4320500 (1982-03-01), Barberis et al.
patent: 4748660 (1988-05-01), Deveze
Baratz Alan E.
Clarke Kathryn E.
Gray James P.
Pollard Melinda R.
Pozefsky Diane P.
International Business Machines - Corporation
Pudpud E. O.
Woods Gerald R.
Yusko Donald J.
LandOfFree
Method for selecting least weight end node to end node route in does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method for selecting least weight end node to end node route in , we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for selecting least weight end node to end node route in will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1959960