A method for establishing a secure private interconnection over a multipath network
A path and network technology, applied in the field of communication network, can solve problems such as impossible to find, not having high performance efficiency, compromising data packet transmission performance, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
example 2
[0096] Example 2: Managed Network
[0097] In another embodiment, the method proposed by the present invention proposes to use secret distribution in conjunction with a management network such as SDN, to enable the secret distribution scheme to be managed by the SDN controller. The general concept of the proposed solution is to use SDN to be able to create several tunnels between each pair of data centers communicating with each other. The source encrypts its data using a secret distribution technique and creates n shares. In order to reconstruct data, the destination must have at least k shares in addition to the n shares sent by the sender. The present invention proposes a method of creating these tunnels under the constraint that only less than k shares of the same information can reach a single router. In this way, a private and secure interconnection between data centers is obtained. To guarantee this privacy, n-k secret shares are used to encrypt the data. A source...
example 3
[0105] Example 3: Data separation using primary and backup channels
[0106] Almost any enterprise has a primary channel and a backup channel for exchanging data, the two channels are completely independent and separate (otherwise, if the primary channel fails, the backup channel would not be able to be a true replacement). In this case, no node intercepts k or more shares because there are no relevant segments along each path from source to destination.
[0107] data separation problem
[0108] Check the problem of data separation between tunnels as in the theoretical problem. Given a graph G=(V,E), where source node s (with only output streams) and sink node t (with only input streams) is given. Each node v∈V has a certain non-negative capacity C v . The goal is to push as many flows as possible from s to t in the graph. each path p i has flow f pi , the rule is that the sum of the flows of all paths intercepted by each node cannot exceed its capacity. In the form...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com