Map Server Entry Hierarchies for Wireless Mesh Roaming Updates
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems fail to efficiently manage network topology changes in wireless mesh networks, particularly in scenarios where access points roam, causing disruptions and inefficiencies in network topology changes, due to the lack of hierarchical relational entries in the network database, which leads to network instability and inefficiencies.
Innovation Solution
Implementing a method for updating map server entries using hierarchical relational entries in a fabric control plane database, which includes generating a map server database with relational fields and recursively updating network locations based on roaming events, ensuring efficient data transmission and reducing control plane message overload.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional flat database structure is used for map server entries, then database simplicity is maintained, but network topology update efficiency deteriorates during access point roaming
Solution Approach 1:
The patent segments the database structure into hierarchical levels (root access points, mesh access points, and client devices) with relational fields that establish parent-child relationships. This segmentation allows targeted updates to propagate efficiently through the hierarchy during roaming events, improving update efficiency without requiring complete database restructuring.
Solution Approach 2:
The patent introduces a hierarchical dimension to the traditionally flat database structure by adding relational fields that create multi-level associations between database entries. This dimensional transformation enables efficient topology updates by allowing changes to propagate through hierarchical relationships rather than requiring flat, broadcast-style updates.
2Reliability
If complete topology updates are performed during access point roaming, then network consistency is maintained, but control plane message overhead increases
Solution Approach 1:
The patent applies local quality by updating only the specific hierarchical subtree affected by a roaming event rather than performing global database updates. When an access point roams, only the entries within its parent hierarchy and dependent entries are updated, maintaining network consistency while minimizing control plane message overhead.
Solution Approach 2:
The patent performs preliminary actions by pre-establishing hierarchical relational fields and parent-child relationships in the database structure before roaming events occur. This preliminary structuring enables efficient, targeted updates during roaming by allowing the system to quickly identify and update only the affected hierarchical segments without extensive searching or global notifications.
3Stability of the object's composition
If hierarchical relational entries are implemented in map server database, then roaming disruption is reduced, but database structure complexity increases
Solution Approach 1:
The patent implements a nested doll structure by creating hierarchical database entries where parent access point entries contain references to child entries, and child entries contain references back to parents. This nested structure stabilizes the database during roaming events by maintaining clear parent-child relationships that automatically propagate updates through the hierarchy, reducing disruption while managing complexity through organized nesting.
Data Source
AI summary
A method of updating map server entries may include generating a map server database (DB) at a map server. The map server DB may include a plurality of relational fields for a plurality of entries. The method may further include, based at least in part on a first entry of the plurality of entries being updated including a change to a first network location of the first entry, updating a second network location of a second entry of the plurality of entries that has a relation with the first entry based on the relational fields.