Traceback Packet Transport Protocol Using Recursive Abbreviation Tokens
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing packet tracing methods in computer networking face challenges in accurately recording the route of packets due to varying hop counts and limited space in packet headers, leading to inefficiencies in bandwidth usage and route tracing accuracy.
Innovation Solution
The method involves using tokens derived from hardware features of network nodes to identify physical routing devices, with abbreviation tokens replacing sequences of tokens in packet headers to conserve space, allowing for recursive expansion of the packet route regardless of limited space, and secure encryption using next node tokens.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If space is allocated to record the maximum packet route in each packet, then route tracing accuracy is improved, but bandwidth is wasted for all packets taking less than the maximum route
Solution Approach 1:
The packet header uses dynamic space allocation where the token array expands or contracts based on the actual number of hops rather than reserving fixed maximum space. This allows the header to adapt its size to each packet's specific route length, eliminating bandwidth waste while maintaining complete route recording capability.
Solution Approach 2:
The patent changes the parameter of header space allocation from a static fixed value to a dynamic value that varies with the number of hops. By making the token array size dependent on actual route length rather than maximum possible length, the system achieves both accurate tracing and efficient bandwidth utilization.
2Loss of energy
If insufficient space is allocated to record the packet route, then bandwidth is conserved, but route tracing accuracy is defeated
Solution Approach 1:
The packet header implements dynamic space allocation where the token array size is determined by the actual number of hops traversed. This ensures that sufficient space is always allocated to record the complete route without over-allocating, achieving both bandwidth efficiency and complete route tracing.
3Device complexity
If fixed length packets are used, then packet structure simplicity is maintained, but the ability to record variable hop counts is limited
Solution Approach 1:
The patent introduces dynamic fields within the fixed-length packet structure. The token array and hop counter adapt their values based on the actual route, while the overall packet structure remains fixed-length. This maintains structural simplicity while enabling flexible recording of variable hop counts through dynamic content rather than dynamic structure.
Data Source
AI summary
Tokens identifying all of the physical routing devices, i.e., network nodes, through which a packet travels are recorded in a limited amount of space reserved in the header of the packet for such tokens. When insufficient space remains in the header of the packet for all tokens required to identify all physical routing devices through which the packet travels, sequences of multiple tokens are replaced with an abbreviation token representing the sequence. The sequence of tokens represented by an abbreviation token can also be abbreviation tokens, supporting recursive abbreviation of the token sequence in the header of the packet as needed to record the entire route of the packet through the network regardless of the limited space in the header for tracking the route of the packet.


