Transmission Path Messaging for In-Network Data Service Functions
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication networks lack the ability to efficiently determine and implement a communication path that meets data service requirements, as nodes primarily focus on forwarding data packets without processing them.
Innovation Solution
A transmission method and apparatus that generate and send transmission path messages indicating nodes and their functions, allowing each node to perform data service functions such as collection, preprocessing, storage, analysis, and security, using IPv6 segment routing headers for flexible path planning.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If nodes only forward data packets without processing, then network simplicity is maintained, but data service requirements cannot be met
Solution Approach 1:
The patent segments the data service functionality into discrete message types (first message for node identification, second message for function indication, third message for parameters) that can be independently processed by different nodes. This allows nodes to perform specific data service functions without requiring complex overall node architecture, resolving the contradiction between service capability and node complexity.
Solution Approach 2:
The patent creates a universal message structure that can be applied across different nodes and data service scenarios. The transmission path message format with cascaded first, second, and third messages serves as a multi-functional framework that enables various data service operations (collection, preprocessing, storage, analysis) without requiring node-specific complex designs.
2Adaptability or versatility
If a complete service architecture is implemented for data processing, then data service requirements are met, but network complexity increases
Solution Approach 1:
The patent extracts the essential data service functionality from complex service architectures and represents it through simplified message structures. By taking out only the critical elements (node identification, function indication, parameters) and encoding them in standardized messages, the system achieves data service capabilities without requiring complex overall architecture.
Solution Approach 2:
The patent uses parameter messages to dynamically configure data service operations without changing the underlying network architecture. By adjusting parameters within the standardized message framework (such as function types, processing options, and node identifiers), the system achieves architectural flexibility and adaptability while maintaining structural simplicity.
3Ease of operation
If transmission path messages include detailed node and function information, then data service implementation is enabled, but message complexity increases
Solution Approach 1:
The patent segments message information into distinct components: first messages for node identification, second messages for function indication, and third messages for parameters. This segmentation allows each message type to carry specific information without overload, making the overall message structure manageable and easy to process despite the detailed information required for data service implementation.
Data Source
AI summary
A transmission method, apparatus, and system for a data service are provided. The method includes: A first apparatus generates a transmission path message, where the transmission path message includes cascaded at least one first message, the first message indicates a node on a transmission path, and the node is configured to implement a related function of the data service. The first apparatus sends the transmission path message to a first node, where the first node is a node indicated by a 1st first message in the cascaded at least one first message. In the technical solutions provided in this application, the data service can be implemented based on a node on a communication path.