# US 2019/0245776 A1 · System and method for managing and controlling a dynamic tunneling protocol in a mesh network > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2019/0245776 A1 - Document ID: US20190245776A1 - Status: Published application - Kind: A1 - Application number: 16/369,756 - Filed: 2019-03-29 - Published: 2019-08-08 - Earliest claimed: 2018-02-07 - Assignees: Gooee Limited - Applicants: Gooee Limited - Inventors: Simon Coombes; Shmuel Silverman - Web page: https://patentgrep.com/patent/US20190245776A1 ## CPC - H04L 45/125: based on throughput or bandwidth - H04L 47/2475: for supporting traffic characterised by the type of applications - H04L 45/44: Distributed routing - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) ## Abstract According to some embodiments, a system and method for managing dynamic tunneling in in a mesh network is disclosed. The method comprises associating an application that transmits high density data packets with a first of a plurality of nodes in a mesh network. The first of the plurality of nodes functions as an originator station for transmitting the high-density data packets to a second of the plurality of nodes in the mesh network that functions as a target station. An auto-trigger to be initiated by the application in a case that the application requires more bandwidth is created. In response to the auto-trigger being activated, a message is generated across the plurality of nodes to activate a best path through the mesh network where the message indicates a time duration that the application will require more bandwidth. ## Claims ### Claim 1 A system for managing dynamic tunneling in a mesh network, the system comprising: a first of a plurality of nodes in a mesh network to function as an originator station, where the first of the plurality of nodes is associated with an application that transmits high-density data packets; a second of the plurality of nodes in the mesh network to function as a target station and to receive the high-density data packets from the application; and a third of the plurality of nodes in the mesh network to function as a coordinating node and to generate a message, via a processor, across the plurality of nodes to activate a best path through the mesh network when the application requires more bandwidth, wherein the message indicates a time duration that the application will require more bandwidth and each node of the plurality of nodes that is not associated with the best path through the mesh network will stop transmitting during the time duration that the application will require more bandwidth. ### Claim 2 (depends on 1) The system of claim 1, wherein the coordinating node functions to associate the application with the originator station and create an auto-trigger for the application to initiate when the application requires more bandwidth, and the message is generated in response to the auto-trigger being activated. ### Claim 3 (depends on 2) The system of claim 2, wherein the best path includes exiting and reentering the mesh network via the internet. ### Claim 4 (depends on 2) The system of claim 2, wherein associating the application with the originator station is based on at least one of an automatic discovery process and a registration process through an interface. ### Claim 5 (depends on 1) The system of claim 1, wherein the nodes that are not associated with the best path will resume transmitting after the time duration that the application will require more bandwidth. ### Claim 6 (depends on 1) The system of claim 1, wherein the generated message is transmitted via the coordinating node. ### Claim 7 (depends on 1) The system of claim 1, wherein the generated message includes a list of forwarding nodes in the mesh network. ### Claim 8 (depends on 1) The system of claim 1, wherein the best path is based on one or both of historic data associated with actual use of the mesh network and current data associated with actual use of the mesh network. ### Claim 9 (depends on 8) The system of claim 8, wherein the one or both of the historic data associated with actual use of the mesh network and the current data associated with actual use of the mesh network includes a combination of data rates, numbers of collisions, times of arrival of data packets, times of origination of data packets, or distances of paths from the originator station to the target station. ### Claim 10 (depends on 8) The system of claim 8, where the one or both of historic data associated with actual use of the mesh network and current data associated with actual use of the mesh network is collected during normal operation of the mesh network. ### Claim 11 (depends on 8) The system of claim 8, wherein in a case that the current data indicates that an alternate path would be faster than the best path, the coordinating node generates a second message across the plurality of nodes to activate the alternate path through the mesh network. ### Claim 12 A method for managing dynamic tunneling in a mesh network, the method comprising: associating an application that transmits high density data packets with a first of a plurality of nodes in a mesh network that functions as an originator station for transmitting the high density data packets to a second of the plurality of nodes in the mesh network that functions as a target station; creating an auto-trigger to be initiated by the application in a case that the application requires more bandwidth; in response to the auto-trigger being activated, generating a message, via a processor, across the plurality of nodes to activate a best path through the mesh network, wherein the message indicates a time duration that the application will require more bandwidth; and stopping each node of the plurality of nodes that is not associated with the best path through the mesh network from transmitting during the time duration that the application will require more bandwidth. ### Claim 13 (depends on 12) The method of claim 12, wherein the associating an application that transmits high density data packets step is based on an automatic discovery process or a registration process through an interface. ### Claim 14 (depends on 13) The method of claim 13, further comprising re-activating each node of the plurality of nodes that is not associated with the best path through the mesh network for which transmitting was stopped, after the time duration that the application will require more bandwidth. ### Claim 15 (depends on 14) The method of claim 14, further comprising: generating, after the time duration that the application will require more bandwidth, a second message, via the processor, across the plurality of nodes to deactivate the best path through the mesh network. ### Claim 16 (depends on 12) The method of claim 12, wherein a header of the message includes a hop by hop route of the specific set of nodes associated with the best path, and the hop by hop route is truncated after every hop. ### Claim 17 A non-transitory computer readable medium, comprising computer executable steps that, when executed by a processor, perform a method for managing dynamic tunneling in a mesh network, the method comprising: associating an application that transmits high density data packets with a first of a plurality of nodes in a mesh network that functions as an originator station for transmitting the high density data packets to a second of the plurality of nodes in the mesh network that functions as a target station; creating an auto-trigger to be initiated by the application in a case that the application requires more bandwidth; in response to the auto-trigger being activated, generating a message, via a processor, across the plurality of nodes to activate a best path through the mesh network, wherein the message indicates a time duration that the application will require more bandwidth; and stopping each node of the plurality of nodes that is not associated with the best path through the mesh network from transmitting during the time duration that the application will require more bandwidth. ### Claim 18 (depends on 17) The medium of claim 17, wherein the wherein the associating an application that transmits high density data packets step is based on an automatic discovery process or a registration process through an interface. ### Claim 19 (depends on 17) The medium of claim 17, further comprising: re-activating each node of the plurality of nodes that is not associated with the best path through the mesh network for which transmitting was stopped, after the time duration that the application will require more bandwidth. ### Claim 20 (depends on 17) The medium of claim 17, wherein the best path is based on one or both of historic data associated with actual use of the mesh network and current data associated with actual use of the mesh network, and in a case that the current data indicates that an alternate path would be faster than the best path the coordinating node generates a second message that indicates the alternate path in response to the application requiring more bandwidth.