The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Feb. 27, 1996
Filed:
Jun. 20, 1994
Claude Galaand, Cagnes sur Mer, FR;
Paolo Scotton, Vence, FR;
International Business Machines Corporation, Armonk, NY (US);
Abstract
The object of the invention is to perform an automatic decomposition of a packet switching network in backbone nodes and subareas nodes to speed up the routing path search without degrading the optimization criterion of the routing algorithm and without generating additional control messages on the network. Currently, routing algorithms compute all the available paths in the network, from the source node to the destination node before to select an optimal route. However, networks are rarely fully meshed. They are usually built around a hierarchical structure: a set of nodes, interconnected by high throughput lines, are used to build a backbone with a high degree of meshing and then, local nodes are grouped in geographical subareas themselves attached to the backbone. Routing algorithms can take advantage of this particular network topology to drastically reduce the complexity of paths computation. For a given connection, only a limited number of nodes are defined as usable and are taken in account by the algorithm in its path calculation.