Controllable Information Diffusion via Read-Only Memory Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data transmission methods in communication networks often lead to perpetual circulation loops of requests, causing inconvenience and unnecessary network congestion, as recipients can freely retransmit messages without control from the instigator terminal, resulting in obsolete information being propagated excessively.
Innovation Solution
A method where the instigator terminal stores information in a memory space with read-only access for non-initiators, transmitting a request message with a location indication and response address, allowing controlled access and management of responses, including the option to restrict access or delete obsolete information, thereby preventing loop formation and maintaining user control over the broadcast.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If recipients are allowed to freely retransmit request messages, then information dissemination is enhanced, but perpetual circulation loops are created causing network congestion
Solution Approach 1:
The system performs preliminary actions by storing the request message in a memory space and setting access rights before transmission. The instigator terminal pre-configures the message with location indications and response addresses, and pre-establishes read-only access rights for non-initiator terminals. This preliminary setup prevents unauthorized modifications and potential loop formations while allowing controlled dissemination.
Solution Approach 2:
The patent introduces a memory space as an intermediary between the instigator terminal and non-initiator terminals. The message is stored in this intermediary space with controlled access rights, allowing recipients to read and potentially retransmit the message without being able to modify it or create unauthorized circulation loops. The memory space acts as a mediator that enables information flow while maintaining control.
2Reliability
If the instigator terminal maintains control over message broadcast, then circulation loops are prevented, but information dissemination flexibility is reduced
Solution Approach 1:
The system implements dynamic control through configurable access rights. The instigator terminal can dynamically adjust who has read access to the stored message by modifying access rights in the memory space. This allows the system to adapt between different dissemination modes: fully controlled (read-only for instigator only) or more flexible (read access granted to specific non-initiator terminals), while always preventing circulation loops through the immutable storage mechanism.
3Ease of operation
If access rights are modified to allow read access for non-initiator terminals, then information accessibility is improved, but control over information durability is reduced
Solution Approach 1:
The patent segments access rights into different levels: the instigator terminal retains full control (read and write access) over the stored message, while non-initiator terminals are granted only read access. This segmentation allows non-initiators to access and potentially retransmit the information, improving accessibility, while the instigator maintains durability control by being the only entity that can modify or delete the stored message.
Data Source
Figure 1
Figure 2
AI summary
The invention relates to a method for transmitting data via at least one communication network NTWK used for connecting two different terminals (TO Tj TN) consisting in recording at least one information item (Inf0), upon the command of the initiator terminal (TO), in a memory space S(Inf0), which is accessible for non-initiator terminals (Tl... Tj... TN) in reading mode only and in transmitting, to at least one non-initiator terminal, a requesting message Sm(l,P,A0,T1,T2) displaying the location (AO) of said memory space. Said invention makes it possible to prevent the formation of the of endless circulation loops of obsolete requests.