10212072

Peer State Synchronization Mechanism for Dynamic Network Address Translation (dnat) in a Network Element

PublishedFebruary 19, 2019
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
20 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method for processing packets, comprising: maintaining, by a network element comprising a processor, a peer dynamic network address translation (DNAT) table associated with a peer network element; detecting, using the processor, that the peer network element has failed; merging, in response to the detecting and using the processor, the peer DNAT table into a local DNAT table to obtain a merged DNAT table; and processing, using the processor, an incoming packet using the merged DNAT table.

2

2. The method of claim 1 , wherein the network element and the peer network element are each one selected from a group consisting of a switch, a router, and a multilayer switch.

3

3. The method of claim 1 , wherein maintaining the peer DNAT table comprises: obtaining, from the peer network element, at least one entry of a second local DNAT table; storing the at least one entry of the second local DNAT table locally in the peer DNAT table; and obtaining, from the peer network element, updates to the second local DNAT table.

4

4. The method of claim 3 , wherein the at least one entry of the second local DNAT table is obtained via a push-mechanism.

5

5. The method of claim 3 , wherein the updates are obtained periodically.

6

6. The method of claim 1 , wherein detecting that the peer network element has failed, comprises: attempting to synchronize DNAT state with the peer network element; making a first determination that the attempting was unsuccessful; initiating, in response to the first determination, a timeout timer; and making a second determination that the peer network element has failed when the timeout timer has elapsed.

7

7. The method of claim 6 , wherein the synchronization of DNAT state is unsuccessful when an acknowledgement packet is not received from the peer network element.

8

8. The method of claim 1 , wherein the incoming packet is rerouted to the network element upon failure of the peer network element.

9

9. The method of claim 1 , further comprising: re-establishing a connection with the peer network element after the peer network element has rebooted; and providing, after the connection is established, the peer DNAT table to the peer network element.

10

10. The method of claim 9 , further comprising: prior to providing the peer DNAT table to the peer network element: updating the peer DNAT table using at least one entry of the merged DNAT table.

11

11. The method of claim 9 , further comprising: reconciling the merged DNAT table to obtain a new local DNAT table.

12

12. The method of claim 11 , wherein reconciling the local DNAT table comprises, for each entry of the peer DNAT table, deleting an entry of the local DNAT table matching the entry of the peer DNAT table.

13

13. The method of claim 1 , further comprising: the peer network element after re-initializing in response to a failure: re-establishing a connection with the network element; and recovering, after the connection is established, the peer DNAT table from the network element.

14

14. A network element, comprising: a processor; a memory; a persistent storage device; a physical port; and a control plane executing using the processor and comprising a system state database (SSD) and a network address translation (NAT) agent, wherein the SSD and the NAT agent are operatively connected, wherein the NAT agent is programmed to: maintain, on the SSD, a peer dynamic network address translation (DNAT) table associated with a peer network element; detect that the peer network element has failed; merge, in response to the detecting, the peer DNAT table into a local DNAT table to obtain a merged DNAT table; and process an incoming packet using the merged DNAT table.

15

15. The network element of claim 14 , wherein the NAT agent is further programmed to: re-establish a connection with the peer network element after the peer network element has rebooted; and provide, after the connection is established, the peer DNAT table to the peer network element.

16

16. The network element of claim 15 , wherein the NAT agent is further programmed to: reconcile the merged DNAT table to obtain a new local DNAT table.

17

17. A non-transitory computer readable medium comprising computer readable program code, which when executed by a processor enables the processor to perform a method, the method comprising: maintaining, by a network element, a peer dynamic network address translation (DNAT) table associated with a peer network element; detecting that the peer network element has failed; merging, in response to the detecting, the peer DNAT table into a local DNAT table to obtain a merged DNAT table; and processing an incoming packet using the merged DNAT table.

18

18. The non-transitory computer readable medium of claim 17 , wherein the method further comprises: re-establishing a connection the peer network element after the peer network element has rebooted; and providing, after the connection is established, the peer DNAT table to the peer network element.

19

19. The non-transitory computer readable medium of claim 18 , wherein the method further comprises: reconciling the merged DNAT table to obtain a new local DNAT table.

20

20. The non-transitory computer readable medium of claim 17 , wherein the method further comprises: the peer network element after re-initializing in response to a failure: re-establishing a connection with the network element; and recovering, after the connection is established, the peer DNAT table from the network element.

Patent Metadata

Filing Date

Unknown

Publication Date

February 19, 2019

Inventors

Jikai Yin
Sudip Regmi
Suresh Kumar Nalagatla

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “PEER STATE SYNCHRONIZATION MECHANISM FOR DYNAMIC NETWORK ADDRESS TRANSLATION (DNAT) IN A NETWORK ELEMENT” (10212072). https://patentable.app/patents/10212072

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.