Dynamic Multicast Address Mapping for Group Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing private radio communication systems face high traffic saturation due to the large number of copied packets transmitted between intermediate equipment, leading to bandwidth inefficiencies in unicast mode, which is exacerbated by the need for multiple copies of the same message being routed through the network.
Innovation Solution
Implementing a multicast addressing method that dynamically associates group identifiers with unique multicast addresses, allowing packets to be transmitted efficiently without storing mapping tables in intermediate equipment or terminals, and using biunivocal functions to calculate multicast addresses on the fly for each transmission, thereby reducing the need for direct affiliation of equipment with groups.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If unicast mode is used to transmit packets from source terminal to receiver terminals via intermediate equipment, then each receiver terminal can receive messages from any group member, but the number of copied packets becomes very high leading to traffic saturation in the packet network
Solution Approach 1:
The patent merges multiple unicast transmissions into a single multicast transmission by introducing a multicast address that represents the entire group. Instead of copying packets to each receiver individually, the system combines all group communication into one unified multicast stream that reaches all members simultaneously, thereby reducing the quantity of packet copies from O(n) to O(1).
Solution Approach 2:
The patent introduces a multicast address as an intermediary between the source terminal and receiver terminals. This intermediary serves as a virtual destination that aggregates all group members, allowing the network infrastructure to efficiently route and replicate packets only at appropriate network nodes rather than at every intermediate equipment, thus reducing overall traffic saturation.
2Adaptability or versatility
If multicast address allocation apparatus with database is used to manage group identifiers and multicast addresses, then multicast address allocation is achieved, but device complexity increases due to database storage and lookup requirements
Solution Approach 1:
The patent enables intermediate equipment and terminals to autonomously determine multicast addresses using a predetermined calculation function based on group identifiers, without requiring external database lookups. Each device independently computes the multicast address by applying the function f to the group identifier, eliminating the need for centralized allocation apparatus and database infrastructure.
Solution Approach 2:
The patent replaces the mechanical database storage and lookup system with a mathematical calculation function. Instead of storing and retrieving multicast address mappings from a database, the system uses a deterministic function that computes the multicast address directly from the group identifier, transforming a storage-intensive operation into a computation-intensive operation that requires minimal memory resources.
3Ease of operation
If mapping tables between group identifiers and multicast addresses are stored in intermediate equipment and terminals, then correspondence lookup is simplified, but memory space is occupied and table maintenance overhead increases
Solution Approach 1:
The patent replaces the memory-based mapping table storage mechanism with a computation-based address derivation mechanism. Instead of storing pre-computed multicast addresses in memory and performing table lookups, the system performs a mathematical calculation using function f on the group identifier to generate the multicast address on-demand, eliminating the need for memory allocation and table maintenance.
Solution Approach 2:
The patent enables each intermediate equipment and terminal to independently generate multicast addresses through local computation using the predetermined function, without relying on pre-stored mapping tables. This self-service approach eliminates memory overhead while maintaining ease of operation, as each device can autonomously determine the correct multicast address for any group identifier it encounters.
Data Source
Figure 1
Figure 2
AI summary
An identifier (IDp) designates a group of terminals accessible via the network (RP) by packets having a multicast address as destination address. An equipment (EIm) between the network and a terminal (Tn) belonging to a group calculates the multicast address of the group using a function depending on the identifier (IDp) of the group each time that a packet including a message transmitted by the terminal is to be transmitted to the network. The equipment also calculates a group identifier (IDp) using a function depending on a multicast address extracted each time that a packet transmitted from the network is received by the equipment in order to transmit a message content extracted from the packet to be received by the terminal if the calculated group identifier is identical to the identifier of the group to which the terminal belongs. No table of mappings between the identifiers of the groups and the multicast addresses is stored in the equipment.