Manhattan Grid Packet Forwarding With Wraparound Distance Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing routing strategies for Manhattan grid networks fail to leverage the specific geometry of the network, leading to inefficiencies and the need for improved routing methods that take advantage of its characteristics.
Innovation Solution
A method and apparatus for packet forwarding in a Manhattan grid network that utilizes a distance metric based on vertical and horizontal hops, with additional links wrapping around the edges, and incorporates an Equal Cost Multi-Path (ECMP) hint to optimize routing decisions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If Equal Cost Multi-Path (ECMP) routing strategy is used in Manhattan grid networks, then routing flexibility is improved, but the specific geometric characteristics of the Manhattan grid are not utilized, leading to suboptimal routing efficiency
Solution Approach 1:
The patent applies local quality by making routing decisions specific to the Manhattan grid geometry. Instead of using generic ECMP routing, the invention calculates distances based on the unique Manhattan grid structure with wraparound links, determining horizontal and vertical distances separately and selecting paths that exploit the grid's geometric properties for optimal routing efficiency
Solution Approach 2:
The patent changes the routing parameters by introducing geometry-aware distance calculations that consider the Manhattan grid's specific structure. The invention computes distances using horizontal and vertical hop counts along with wraparound link considerations, transforming the generic ECMP approach into a geometry-optimized routing method that improves productivity while maintaining adaptability
2Measurement precision
If traditional distance calculation methods are used in Manhattan grid networks, then all possible paths must be calculated, but this increases computational complexity and processing time
Solution Approach 1:
The patent applies segmentation by dividing the distance calculation into separate horizontal and vertical components. Instead of calculating all possible paths between nodes, the invention independently computes the horizontal distance (considering wraparound links) and vertical distance, then combines them to determine the optimal path, significantly reducing computational complexity while maintaining measurement precision
Solution Approach 2:
The patent applies preliminary action by pre-establishing the Manhattan grid geometry parameters and wraparound link configurations before routing decisions are made. This allows the routing algorithm to quickly calculate distances using the pre-defined geometric structure, avoiding the need to recalculate all possible paths for each routing decision, thus reducing processing time while maintaining accuracy
Data Source
AI summary
A method of routing a packet in a network with a Manhattan grid geometry arranged in columns and rows, including receiving, by a source network node, a packet and extracting a destination address of the destination node. Each of the links of the network has a nominal routing cost of one hop and the plurality of links including additional links connecting respective opposing ends of each of the plurality of columns and opposing ends of each of the plurality of rows of the Manhattan grid. Then determining a plurality of distances between the source network node and the destination network node based on the Manhattan grid geometry. Selecting a minimum distance from the plurality of distances and transmitting the packet on an interface associated with the minimum distance.