Route selection using cached partial trees in a data communicati

Details Route selection using cached partial trees in a data communicati Route selection using cached partial trees in a data communicati

1992-10-16

1994-06-14

Shaw, Gareth D.

Communications: electrical

Land vehicle alarms or indicators

Internal alarm or indicator responsive to a condition of the...

340827, 364DIG2, 36494092, G06F 1314

Patent

active

053218159

ABSTRACT:
A process for selecting a least weight path between two nodes in a data communication network uses partial trees created and cached in prior route selection operations. All root nodes on possible paths between the two nodes are identified. Any cached tree having a root matching one of the identified root nodes is retrieved from storage. If necessary, each retrieved tree is extended until it includes all possible destination nodes. The extended and/or retrieved trees are used to select the least weight path between the two nodes. The extended tree is then cached for possible use in future route selection operations.

REFERENCES:
patent: 3703006 (1972-11-01), Sharma
patent: 4466060 (1984-08-01), Riddle
patent: 4825206 (1989-04-01), Brice, Jr. et al.
patent: 4873517 (1989-10-01), Baratz et al.
patent: 4914571 (1990-04-01), Baratz et al.
patent: 4987536 (1991-01-01), Humblet

Affiliated with

Also associated with

Rating

Route selection using cached partial trees in a data communicati does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Route selection using cached partial trees in a data communicati, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Route selection using cached partial trees in a data communicati will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1255869