Diameter route learning
Abstract
Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving a message at the network device; constructing a route key based on the message, wherein the route key comprises at least one value carried by the message; determining whether the network device stores a previous route record associated with the route key; and if the network device does not store a previous route record associated with the route key, generating a new route record based on the route key, and provisioning a new route based on the new route record into a routing table of the network device.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A method performed by a network device for learning routes, the method comprising:
receiving a message at the network device from a peer device; constructing a route key based on the message, wherein the route key comprises at least one value carried by the message, and wherein the route key identifies a realm that can be reached via the peer device; determining whether the network device stores a previous route record associated with the route key; and if the network device does not store a previous route record associated with the route key,
generating a new route record based on the route key, comprising assigning a priority to the new route record, wherein the priority assigned to the new route record is higher than any priority of each of a plurality of existing operator-created route records that match an application and destination realm of the message; and
provisioning a new route based on the new route record into a routing table of the network device.
2 . The method of claim 1 , further comprising designating as backup route records the plurality of existing operator-created route records.
3 . The method of claim 1 , further comprising deleting the plurality of existing operator-created route records.
4 . The method of claim 1 , further comprising flagging as inactive the plurality of existing operator-created route records.
5 . The method of claim 1 , further comprising:
determining a number of matching route records is less than or equal to a maximum count, wherein the matching route records are the route records that match an application and destination realm of the message.
6 . The method of claim 1 , further comprising:
determining a number of matching route records is greater than a maximum count, wherein the matching route records are the route records that match an application and destination realm of the message; determining an oldest route record, wherein the oldest route record is the route record among the matching route records with the oldest timestamp; and deleting the oldest route record.
7 . The method of claim 1 , further comprising
determining the peer device is disconnected; and deleting one or more route records associated with the peer device.
8 . The method of claim 7 , wherein the step of determining the peer device is disconnected further comprises polling the peer device.
9 . The method of claim 1 , further comprising:
determining whether route learning is enabled for the network device; and performing the steps of constructing, determining, and generating only when route learning is enabled for the network device.
10 . The method of claim 1 , further comprising:
determining whether the message was routed by at least one intermediate node prior to the network node receiving the message; and performing the steps of constructing, determining, generating, and provisioning only when the message was routed by at least one intermediate node prior to the network node receiving the message.
11 . A method performed by a network device for learning routes, the method comprising:
receiving a message at the network device from a peer device; constructing a route key based on the message, wherein the route key comprises at least one value carried by the message, and wherein the route key identifies a realm that can be reached via the peer device; determining whether the network device stores a previous route record similar to that associated with the route key; and if the network device stores a previous route record similar to that associated with the route key,
generating a new route record based on the route key, comprising assigning a priority to the new route record; and
provisioning a new route based on the new route record into a routing table of the network device.
12 . The method of claim 11 , further comprising designating the previous route record as a backup route record.
13 . The method of claim 11 , further comprising deleting the previous route record.
14 . The method of claim 11 , further comprising flagging as inactive the previous route record.
15 . The method of claim 11 , further comprising:
determining a number of matching route records is less than or equal to a maximum count, wherein the matching route records are the route records that match an application and destination realm of the message.
16 . The method of claim 11 , further comprising:
determining a number of matching route records is greater than a maximum count, wherein the matching route records are the route records that match an application and destination realm of the message; determining an oldest route record, wherein the oldest route record is the route record among the matching route records with the oldest timestamp; and deleting the oldest route record.
17 . The method of claim 11 , further comprising
determining the peer device is disconnected; and deleting one or more route records associated with the peer device.
18 . The method of claim 17 , wherein the step of determining the peer device is disconnected further comprises polling the peer device.
19 . The method of claim 11 , further comprising:
determining whether route learning is enabled for the network device; and performing the steps of constructing, determining, and generating only when route learning is enabled for the network device.
20 . The method of claim 11 , further comprising:
determining whether the message was routed by at least one intermediate node prior to the network node receiving the message; and performing the steps of constructing, determining, generating, and provisioning only when the message was routed by at least one intermediate node prior to the network node receiving the message.Join the waitlist — get patent alerts
Track US2014365684A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.