Graph-Based Packet Routing for Secure Decentralized Telecom Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing telecommunications networks face challenges in securely transmitting data with low latency and computational cost while maintaining decentralization, without the need for a central routing node.
Innovation Solution
A method involving nodes maintaining a shared digital ledger and using a graph database to identify receiver nodes for data packet transmission, enabling temporary nodes, and employing a proof-of-history protocol for secure and efficient data transfer.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If TOR network or VPN systems are used to maintain privacy and security of data exchange, then security and confidentiality are improved, but data transfer rate is significantly reduced
Solution Approach 1:
The system segments the network into autonomous nodes that independently maintain security through local cryptographic operations rather than centralized encryption/decryption, reducing processing overhead and improving data transfer rate while maintaining security
Solution Approach 2:
Nodes pre-compute and store cryptographic credentials and routing information in advance, eliminating real-time computational bottlenecks and enabling faster data transmission without compromising security
2Reliability
If blockchain technology is implemented to certify digital transactions and identity, then security and authenticity are improved, but computational resources and complexity are significantly increased
Solution Approach 1:
The system extracts the essential certification function from full blockchain implementation, using a simplified distributed ledger that maintains only the necessary authentication and routing information without the overhead of complete blockchain consensus mechanisms
Solution Approach 2:
The system uses lightweight, ephemeral cryptographic credentials that are generated and discarded rapidly for each transaction, replacing expensive long-term blockchain certificate verification with cheaper short-term authentication tokens
3Reliability
If decentralized network structure is used to eliminate central routing nodes, then robustness and security are improved, but routing efficiency and latency are worsened
Solution Approach 1:
Nodes pre-compute and cache optimal routing paths based on historical network conditions and topology information, enabling fast packet forwarding without real-time route discovery and reducing latency in decentralized architecture
Solution Approach 2:
The system introduces intermediary nodes that pre-establish secure channels and routing information, acting as local guides that reduce the search space for packet routing and decrease latency while maintaining decentralization
Data Source
Figure 1~2
Figure 3
Figure 4a~4b
AI summary
The present invention relates to a method (100, 200, 300, 400) of communication between nodes in a telecommunications network. In particular, each node maintains a copy of a shared digital ledger, is identified by a respective identification code and implements a software application configured to manage the transmission of data packets and maintain the shared digital ledger. The method (100, 200, 300, 400, 500) comprises that each sending node of a data packet executes the steps of: a. memorizing a list of identification codes, each identification code identifying a respective node comprised in a subset of nodes of the network, b. identifying (103; 200, 500) a receiver node to which to transmit said data packet, c. generating (105) a data packet to be delivered to a recipient node, d. transmitting (107) to the first node of said minimum sequence of nodes the data packet, e. issuing (109) a request to the network nodes to record said data packet transmission in the distributed ledger, and when a data packet is received, the method requires that each receiver node, other than the recipient node of the data packet, repeats at least the steps b., and D.. Advantageously, the step a. of identifying (103, 200; 500) a receiver node to which said data packet is transmitted comprises: - generating (203; 503) a graph database in which a respective arc connects the sender node or the receiver node, different from the recipient node, to each node of the network of which the identification code is comprised in the list of identification codes of the sender node or the receiver node, other than the recipient node, and - selecting (209; 505) the receiver node among the nodes of said graph database. Furthermore, if it is not possible to identify a receiver node, the method further comprises the steps of: - analyzing a contact list stored in the sending node, each contact in the contact list being associated with a corresponding device; - if at least one contact is identified in which is associated with a device having installed said software application but not enabled to exchange packets in the telecommunication network, enabling said device to exchange packets as a temporary node of the telecommunication network, and - selecting said device as receiver node of the data packet.