Packet Header Local Node Identifier Routing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication protocols, such as Connection-Oriented and Connection-Less networks, face limitations in header overhead, processing power, and complexity, especially when dealing with multi-access links like Ethernet, and require globally unique IP addresses, which are costly and resource-intensive.
Innovation Solution
The introduction of a packet header using local node identifiers (LNIs) for routing information, which are locally valid and reduce header overhead, allowing for independent paths between source-destination pairs and efficient forwarding through networks with multi-access links without the need for IP addresses or port identifiers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If globally unique IP addresses are used for routing, then packet communication between heterogeneous networks is enabled, but header overhead increases and processing resources are consumed
Solution Approach 1:
The routing information is segmented into two parts: a network identifier (global) and a local node identifier (local to the network). This segmentation allows the packet header to carry only the local node identifier when traversing within a network, reducing header overhead while maintaining the ability to communicate across heterogeneous networks through the network identifier portion.
Solution Approach 2:
The patent introduces local node identifiers that are unique only within their own network rather than requiring globally unique identifiers throughout the entire internet. This local quality approach reduces the size and complexity of routing information in packet headers while still enabling proper routing through the combination of network identifier and local node identifier.
2Adaptability or versatility
If Connection-Oriented protocols with connection identifiers are used, then routing paths can be established, but the size of connection identifier space is limited by computational power and memory of forwarders
Solution Approach 1:
The routing functionality is segmented between the network layer (which handles path establishment using network identifiers) and the link layer (which uses local node identifiers for forwarding). This segmentation allows routing path establishment without requiring large connection identifier spaces in forwarder memory, as the local node identifiers are small and locally scoped.
Solution Approach 2:
The network identifier acts as an intermediary that enables path establishment across heterogeneous networks, while local node identifiers handle the actual forwarding decisions. This intermediary approach allows routing functionality without requiring forwarders to maintain large connection identifier tables.
3Device complexity
If Connection-Less networks with destination address look-up are used, then connection identifiers are not required, but the look-up operation is more complex and output port is selected independent of source
Solution Approach 1:
The addressing scheme is segmented into network identifier and local node identifier components. This segmentation enables simpler look-up operations using local node identifiers while still supporting independent paths for different source-destination pairs through the network identifier portion, combining the benefits of both Connection-Oriented and Connection-Less approaches.
Data Source
AI summary
A packet header for a data packet (14) includes a routing information field for containing at least one local node identifier data which identifies one or more nodes through which the data packet is intended to be transported. The packet header further contains a pointer field containing a pointer (PTR), which pointer indicates the position of individual local node identifier data in the routing information field. The pointer is operable to be incremented at each node so as to indicate the position of data, which identifies the node to which the data packet is to be subsequently transported.