Network Packet Space Calculation for Data Stream Transport
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods fail to efficiently determine the available space in network packets for multimedia data streams, particularly when multiple clients and services are involved, leading to inefficient memory and processor usage due to the need for duplicating or moving payload data and managing varying header sizes.
Innovation Solution
A method that determines the requirements of each module for different types of header and extension data, computes a maximum space requirement, and calculates the available space by combining these requirements, allowing for dynamic management of payload data without duplication or movement, even across multiple recipients and service activations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If payload data are placed in buffer memory with space reserved for headers, then headers can be added without copying or moving payload data, but it becomes difficult to determine the available space when multiple clients and services with varying header requirements are involved
Solution Approach 1:
The patent segments the header space requirements into distinct components: base RTP header (12 bytes), UDP/IP headers, and variable service-specific headers. Each module (RTP module, service modules) independently declares its header space requirements, which are then aggregated to determine the total reserved space. This segmentation allows complex multi-client scenarios to be broken down into manageable modular components.
Solution Approach 2:
The patent performs preliminary calculation of header space requirements by having each module declare its needs in advance. The available space is computed before packetization occurs, using the formula: available space = maximum packet size - sum of all declared header requirements. This preliminary action ensures that payload data can be placed with sufficient space reserved, avoiding later copying or moving operations.
2Quantity of substance
If the same payload data are sent to multiple clients with different header requirements, then memory efficiency is improved by not duplicating payload data, but the available space calculation becomes more complex due to varying header sizes
Solution Approach 1:
The patent creates a universal buffer memory structure that serves multiple clients simultaneously. The buffer is allocated with sufficient space for the maximum possible header requirements across all clients. Payload data are placed once in this universal buffer, and different clients receive packets with their specific headers added to the appropriate positions. This universal approach allows the same payload data to be efficiently served to multiple clients with varying header needs.
Solution Approach 2:
The patent implements dynamic header space allocation where each client's header requirements are calculated and reserved independently. The available space for payload data is dynamically determined based on the specific combination of services each client requires. This dynamic approach allows the system to adapt to different client configurations while maintaining memory efficiency through shared payload data.
3Adaptability or versatility
If maximum space is reserved for all possible headers and service data, then all client requirements can be met, but the available space for payload data is reduced
Solution Approach 1:
The patent changes the parameter of header space allocation from a fixed maximum reservation to a dynamic calculation based on actual client requirements. Each module declares its specific header space needs, and the total reserved space is the sum of these actual requirements rather than a conservative maximum. This parameter change optimizes the balance between adaptability and payload space availability.
Solution Approach 2:
Each module (RTP module, service modules) independently determines and declares its own header space requirements. The system self-adjusts the total reserved space by aggregating these self-declared needs. This self-service approach ensures that the available space for payload data is maximized while still meeting all actual client requirements, avoiding the waste of over-reserving space.
Data Source
AI summary
The method of computing the available space in a packet for data stream transport comprises:a step of determining the requirements of each module of a data stream manager, for space in the packet for at least two types of header and/or extension data required by each protocol and/or service used by said module,a step of determining a maximum space requirement in the packet to meet all these requirements, by implementing different rules for combining space requirements for the different types of data and a sum of the combined requirements for the different types of data anda step of computing a difference between the space of the packet and the maximum space requirement in the packet in order to determine the available space for data stream transport.