Manhattan Grid Address Resolution with Cached Lookup and Replicas
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing address resolution mechanisms are inadequate for Manhattan grid networks, particularly in satellite networks with dynamic membership changes, leading to scalability issues and inefficiencies.
Innovation Solution
A server-based address resolution mechanism with replica servers geometrically or topologically proximal to the main server, utilizing a lookup address function cached by nodes for predictable network dynamics, and a distributed hash table (DHT) with replica nodes for high availability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If hash based address resolution mechanisms are used for large networks, then address resolution can be performed in distributed networks, but the system becomes overly complex for simpler networks with static membership
Solution Approach 1:
The patent applies local quality by implementing different address resolution mechanisms for different network types. Simple networks with static membership use direct caching of address mappings, while large dynamic networks use hash-based distributed lookup. Each network configuration gets the appropriate level of complexity rather than forcing a uniform approach on all networks.
2Reliability
If nodes cache address mappings for frequent updates, then address resolution remains current, but scalability is reduced due to short cache periods
Solution Approach 1:
The patent implements dynamics by making the cache validity period adaptive rather than fixed. Cache periods are adjusted based on network characteristics and change frequency. For networks with frequent changes, shorter cache periods maintain accuracy, while for stable networks, longer periods improve scalability. The system dynamically adapts caching behavior to match actual network conditions.
3Reliability
If replica servers are added for high availability, then address resolution remains available during failures, but network complexity increases
Solution Approach 1:
The patent applies copying by creating replica address resolution servers that maintain copies of the address mapping data. These replicas provide backup capacity and can handle requests when the primary server is unavailable. The copying approach ensures availability without requiring complex distributed consensus protocols, simply replicating the essential data structure across multiple nodes.
4Ease of operation
If address resolution requests are sent to remote servers, then centralized address resolution is achieved, but lookup time increases
Solution Approach 1:
The patent implements preliminary action by pre-caching address mappings and resolution data at local nodes before they are needed. Instead of querying remote servers for every address resolution request, nodes maintain local copies of frequently accessed address mappings. This preliminary caching eliminates the need for repeated remote lookups, significantly reducing lookup time while maintaining centralized management through periodic updates from the central server.
Data Source
AI summary
A method for forwarding a packet in a network may be performed by a network node of a first packet network and includes the following steps. Receiving the packet that includes a destination packet address of the packet, where the destination packet address indicates a terminal of a second packet network. Obtaining a Manhattan address of a Manhattan node based on a time, the destination packet address, and a lookup address function, where the terminal accesses a Manhattan network through the Manhattan node, and the Manhattan network provides a connection between the first packet network and the second packet network. Sending a Manhattan routing packet addressed to the Manhattan node to the Manhattan network, where the Manhattan routing packet includes the packet.