Universal Network Protocol Encapsulation for Low-Latency Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current packet transmission protocols in networks face challenges with scalability, agility, and efficiency due to outdated encapsulation methods that fail to adapt to the increasing complexity and dynamism of modern network environments, leading to difficulties in achieving ultra-low-latency communications and efficient resource allocation across virtual networks and slices.
Innovation Solution
The introduction of universal network protocol encapsulation (universal-NPE) that groups data units into 'connection,' 'network function,' and 'application' categories with distinct encapsulation rules, using a 'network identifier' as a primary key, and employing message tagging to reduce control field overhead and optimize packet transmission, enabling vertical transparency and improved throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional packet encapsulation methods are used, then network compatibility is maintained, but network agility and adaptability to modern dynamic environments deteriorate
Solution Approach 1:
The packet structure is segmented into distinct functional groups: connection group (network identifier, source/destination identifiers, flow tag), network function group (routing vector, timestamp, sequence number), and application group (payload-specific data). This segmentation allows each group to be independently managed and optimized, improving network agility while maintaining structured complexity.
Solution Approach 2:
The encapsulation method dynamically adapts to different network conditions and application requirements. The protocol allows flexible inclusion/exclusion of optional data units based on specific transmission needs, enabling the system to adjust its complexity level dynamically rather than being fixed.
2Productivity
If comprehensive data units are included in every packet, then complete information is provided, but control field overhead and network utilization efficiency worsen
Solution Approach 1:
The protocol extracts and separates essential connection-maintaining data units (network identifier, flow tag, identifiers) from every packet, while allowing optional functional and application-specific data units to be included only when needed. This extraction reduces overhead for routine transmissions while preserving completeness when required.
Solution Approach 2:
The encapsulation uses partial action by including only the minimum necessary data units for basic packet transmission (connection group), and adds optional data units (network function group, application group) only when specific functionalities are required, avoiding excessive overhead in simple cases.
3Speed
If outdated encapsulation methods are used, then protocol simplicity is maintained, but ability to support ultra-low-latency communications and virtual network operations deteriorates
Solution Approach 1:
The protocol performs preliminary actions by pre-establishing connection context through the connection group data units (network identifier, source/destination identifiers, flow tag) that are processed first. This preliminary structuring enables faster subsequent processing of packet data, reducing overall latency for time-sensitive communications.
Solution Approach 2:
The encapsulation method applies local quality by providing different levels of detail and processing for different packet components. The connection group receives structured, priority processing for rapid routing decisions, while optional functional and application groups provide specialized handling only where needed, optimizing latency for critical path operations.
Data Source
AI summary
A network node configured to transmit packets to a destination node in a packet network, includes at least one processor and at least one memory including computer program code. The at least one memory and the computer program code are configured to, with the at least one processor, cause the network node to: assemble at least a first packet including a plurality of data units, each of the plurality of data units being grouped into one of a connection group, a network function group or an application group; and transmit the first packet to the destination node.