US 6,147,971 A · Optimized routing method based on minimal hop count for use in PNNI based asynchronous transfer mode networks

Abstract

Two solutions are provided for optimizing the algorithm used by the local node in calculating the route to a destination node. A first method optimizes the route calculation by associating a port/link information with the PTSEs received by the node. The association is made using the first PTSE to arrive from an originating node. The routing algorithm is then steered to begin routing to a destination using the associated port/link. A second method optimizes the route calculation by utilizing a special PTSE termed a ROUTE.sub.-- PTSE into which is placed the route the PTSE takes upon being flooded from the creating node to the local node. When routing, the local node traverses the DTL already existing in the ROUTE.sub.-- PTSE received from a particular originating node that is the current destination node.

Claims6

Dependent claims

In an Asynchronous Transfer Mode (ATM) network, a method of improving the performance of a routing algorithm in calculating a route from a local node to a destination node, the nodes in said network running a Private Network to Network Interface (PNNI) protocol, said method comprising the steps of:

generating a PNNI Topology State Element (PTSE) on an originating node and flushing said PTSE throughout said network;
receiving said PTSE at a local node;
associating said originating node with a port/link said PTSE arrived on if said PTSE is not in a topology database within said local node or if said PTSE is in said topology database but with a lower sequence number associated thereto;
placing a neighbor of said local node associated with said port/link said PTSE arrived on onto a TENTATIVE list, in accordance with a call request, said PTSE received from said originating node currently being the destination;
and
continuing the route calculation in accordance with said routing algorithm.

3 more elements

generating a Routing PNNI Topology State Element (ROUTE.sub.-- PTSE) on an originating node and flushing said ROUTE.sub.-- PTSE throughout said network, said ROUTE.sub.-- PTSE including a routing list which is initially empty;
receiving said ROUTE.sub.-- PTSE at said local node;
adding said local node to said routing list if a neighboring node said ROUTE.sub.-- PTSE was received from is either said originating node or a node most recently added to said routing list;
calculating a best route to said node most recently added to said routing list and adding the resulting nodes to said routing list if the neighboring node said ROUTE.sub.-- PTSE was received from is neither said originating node nor the node most recently added to said routing list;
storing said ROUTE.sub.-- PTSE in a topology database in said local node and flooding said ROUTE.sub.-- PTSE to neighbors of said local node;
traversing a path on said routing list associated with said destination node, in accordance with a call request, if said ROUTE.sub.-- PTSE associated with said destination node is found in said topology database of said local node;
and routing said call in accordance with said routing algorithm using the contents of said routing list.

4 more elements

Dependencies are inferred from the claim text.

Optimized routing method based on minimal hop count for use in PNNI based asynchronous transfer mode networks

Life of this patent

Optimized routing method based on minimal hop count for use in PNNI based asynchronous transfer mode networks

Life of this patent

Abstract

Claims6