Methods and apparatus for optimum path selection in packet transmission networks
Patent 5233604 Issued on August 3, 1993. Estimated Expiration Date: 
April 28, 2012. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.
April 28, 2012. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.Patent ReferencesMethod of maintaining a topology database Bit rate reservation in an asynchronous packet network Method and system for routing packets in a packet communication network Data communications network Patent #: 5142531 Inventors
ApplicationNo. 874917 filed on 04/28/1992US Classes:370/238, Least cost or minimum delay routing370/255, Using a particular learning algorithm or technique370/400, Having a plurality of nodes performing distributed switching370/468Assignment of variable bandwidth or time period for transmission or receptionExaminersPrimary: Safourek, Benedict V.Attorney, Agent or FirmInternational ClassH04L 012/56AbstractA packet communications system utilizes a route determining mechanism by identifying principal paths between the source and the destination in the system. Principal paths are minimum hop count paths with a transmission delay less than a specified threshold. Principal path links are accepted as legs of the optimum path, if feasible, i.e., if the resulting load on the link is less than a specified principal threshold. Secondary links are accepted only if the resulting load on the link is less than a specified secondary threshold, where the secondary threshold is less than the principal threshold. All paths must also have a transmission delay less than a specified threshold. Each request for a route includes the source node, the destination node, the load required, the maximum transmission delay and, if desired, the quality of service parameters which all of the legs of the route must satisfy. A modified Bellman-Ford breadth-first search algorithm is used to identify the principal links and, using these principal link identifications, determining the optimum path.Other References
| |
