Method for routing data in a near-optimal manner in a distribute

Details Method for routing data in a near-optimal manner in a distribute Method for routing data in a near-optimal manner in a distribute

1990-02-06

1993-10-12

Envall, Jr., Roy N.

Boots, shoes, and leggings

370 941, 370 60, 370 53, G06F 1520, H04J 324, H04Q 1104, H04Q 1100

Patent

active

052531619

ABSTRACT:
A method to produce near-optimal routes for the flow of data between clusters in a distributed data communications network. A backbone traffic matrix and a backbone topology at the cluster level are used to produce minimum hop routes, minimum delay routes, or routes which maximize throughput. The inputs of the system are the number of requirements, the number of backbone links, and the number of backbone nodes.

REFERENCES:
patent: 4081612 (1978-03-01), Hafner
patent: 4974224 (1990-11-01), Boone

Affiliated with

Also associated with

Rating

Method for routing data in a near-optimal manner in a distribute 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 routing data in a near-optimal manner in a distribute, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method for routing data in a near-optimal manner in a distribute will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1910271