Nothing Special   »   [go: up one dir, main page]

CN114697347B - Data transmission system with network memory capacity - Google Patents

Data transmission system with network memory capacity Download PDF

Info

Publication number
CN114697347B
CN114697347B CN202011473017.0A CN202011473017A CN114697347B CN 114697347 B CN114697347 B CN 114697347B CN 202011473017 A CN202011473017 A CN 202011473017A CN 114697347 B CN114697347 B CN 114697347B
Authority
CN
China
Prior art keywords
node
data
network
message
data block
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202011473017.0A
Other languages
Chinese (zh)
Other versions
CN114697347A (en
Inventor
王劲林
邓浩江
尤佳莉
韩锐
程钢
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Zhongkehai Suzhou Network Technology Co ltd
Institute of Acoustics CAS
Original Assignee
Zhongkehai Suzhou Network Technology Co ltd
Institute of Acoustics CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Zhongkehai Suzhou Network Technology Co ltd, Institute of Acoustics CAS filed Critical Zhongkehai Suzhou Network Technology Co ltd
Priority to CN202011473017.0A priority Critical patent/CN114697347B/en
Priority to JP2023535901A priority patent/JP2023554345A/en
Priority to PCT/CN2022/073398 priority patent/WO2022127938A1/en
Publication of CN114697347A publication Critical patent/CN114697347A/en
Application granted granted Critical
Publication of CN114697347B publication Critical patent/CN114697347B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/40Support for services or applications
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/1097Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L69/00Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
    • H04L69/22Parsing or analysis of headers

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Security & Cryptography (AREA)
  • Multimedia (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a data transmission system with network memory capacity, which comprises a data request node, a data source service node and an intermediate transmission node, wherein each node is provided with a unique Identifier (ID) of the whole network, at least has a Network Address (NA), and is provided with a unit for processing a transmission layer protocol message based on the ID; the data request node is used for generating and sending a data request message and receiving a data response message; the data source service node is used for responding to the data request, providing a sending service of the content of the data block when the node stores the data block identified by the ID, and generating and sending a data response message; the intermediate transmission node is used for processing the transmission layer protocol message based on the ID, has a self-decision data storage function, can decide the subsequent processing behavior from the information acquired from the message and the network state of the node, can respond to a data request, and provides a sending service of the content of the data block when the node stores the data block identified by the ID, and generates and sends a data response message.

Description

Data transmission system with network memory capacity
Technical Field
The present invention relates to computer network technology, and in particular, to a data transmission system with network memory capacity.
Background
With the high-speed development of the internet of things and the mobile internet, the existing IP network technology system integrating IP identification and address gradually reveals inherent defects in the aspects of mobility, expansibility, data distribution efficiency and the like. An information center network (Information Centric Network, ICN) technology featuring identification and address separation realizes content nearby service based on in-network caching, and provides an efficient and flexible data acquisition mode for a 5G novel mobile network to cope with massive data processing in eMBB, URLLC and mMTC scenes. In ICN networks, intermediate transmission nodes may also be used as response nodes for content requests, so that conventional end-to-end transport layer protocol based transmission systems cannot be applied to ICN networks.
The named data network (Named Data Network, NDN) or the content-centric network (Content Centric Network, CCN) is an ICN network, is based on name hop-by-hop routing addressing, is a subverted architecture of addressing and routing coupling, and is difficult to deploy and evolve in existing networks; another way of decoupling addressing and routing, such as a mobile first architecture, maps Network entities and data names to an ID (Identifier) and binds the ID to a Network Address (NA) to which the ID is attached, where the ID is used for addressing and the NA is used for routing, so that the Network architecture can be compatible with an existing Network architecture, such as an IP Network, and has current Network implementation. Therefore, how to make full use of the storage and calculation capabilities of the intermediate transmission nodes of the network to perform data transmission with the network memory storage capability on the premise of being compatible with the existing network routing mechanism is a problem which needs to be solved at present.
Disclosure of Invention
The present invention aims to solve the above problems, and provides a data transmission system with network memory capacity, where the data transmission system includes a data request node, a data source service node and an intermediate transmission node, each node has a unique Identifier (ID) of a whole network, at least has a Network Address (NA), and includes a unit for processing a transport layer protocol packet based on the ID, and a transmission object of the data transmission system is a data block with the unique ID identifier of the whole network;
the data request node is used for generating and sending a data request message and receiving a data response message;
the data source service node is used for responding to the data request, providing a sending service of the content of the data block when the data block identified by the ID exists in the node, and generating and sending a data response message;
the intermediate transmission node is used for processing the transmission layer protocol message based on the ID, has a self-decision data storage function, can decide the subsequent processing behavior from the information acquired from the message and the network state of the node, can respond to a data request, and provides a sending service of the content of the data block when the node stores the data block identified by the ID, and generates and sends a data response message.
As an improvement of the above system, the header fields of the ID-based transport layer protocol message include, but are not limited to, a data block ID, a data request node ID, a source address, a destination address, a message type, and a decision process indication field; the data block ID and the data request node ID remain unchanged in the transmission process, the message types include but are not limited to a data request message and a data response message, and the decision processing indication field includes but is not limited to a preference indication field, a cache indication field, a QoS indication field and a combination thereof; the corresponding indication information contained in the decision processing indication field is not limited to be transmitted through a message field, and can be transmitted through a message load.
As an improvement of the above system, the source address in the data request message is a network address of the data request node corresponding to the data request node ID, the destination address is an address of the node which stores the data block identified by the data block ID and can provide the content transmission service of the data block, and the destination address changes in transmission according to the change of the node providing the transmission service and the network address thereof.
As an improvement of the above system, the source address of the data response message is the address of the node which stores the data block ID and can provide the content transmission service of the data block; the destination address is an address of a data requesting node corresponding to the data requesting node ID, wherein the source address is changed in transmission according to a change in the node providing the transmission service and its network address.
As an improvement to the above system, the value of the preference indication field expresses optimal network location indication information for caching or storing data blocks, including, but not limited to, near data requesting nodes, near data sources, near network cores, and combinations;
the value of the buffer indicating field expresses buffer behavior indicating information of the content of the data block in the message of the field on a transmission path, including but not limited to the number of times that the data block is buffered on the transmission path and the number of times that the data block is buffered;
the value of the QoS indication field expresses QoS requirement indication information of the data block content during transmission, buffering and storage, including but not limited to delay, throughput and reliability.
As an improvement of the above system, the intermediate transmission node is provided with a decision unit, the inputs of which are a set of transmission processing information and a set of network states of the node, the output of which is used for deciding whether to perform the corresponding post-processing action.
As an improvement of the above system, the transmission processing information set is composed of information obtained by the intermediate transmission node by parsing the message, including, but not limited to, header field information of the message and indication information transmitted in the message payload; the network state set comprises the self state of the intermediate transmission node and the state of the adjacent node; the self state is used for indicating the resource providing capability of the current intermediate transmission node, including but not limited to available buffer space, available storage space and available bandwidth; the neighboring node status is used to indicate relevant status information of other neighboring intermediate transmission nodes of the current intermediate transmission node, including but not limited to network addresses of neighboring intermediate transmission nodes, available memory space, and network distance from the own node; the number of other intermediate transmission nodes in the vicinity is not limited to 1, and the state thereof is obtained by means of active or passive detection.
As an improvement of the above system, the decision unit may be characterized by a calculation of a set of decision functions, a set of decision functions corresponding to a set of post-processing actions, the values of the decision functions being used to decide whether to perform the corresponding post-processing actions, each decision function taking a different functional form; one decision function corresponds to one or more post-processing actions;
assuming that there are N post-processing actions, for the former, the decision function of the nth post-processing action
Figure SMS_1
The expression of (2) is as follows:
Figure SMS_2
wherein n=1, 2, …, N
The input Xe (PV U NV) of the function, PV is the transmission processing information set, NV is the network state set, n is the label of the post-processing action, and the decision function
Figure SMS_3
The value d of (2) n For deciding whether to perform a post-processing action numbered n;
for the latter, the post-processing actions are divided into M subgroups, 1.ltoreq.M < N, one decision function corresponding to each subgroup, each subgroup containing k l A post-processing action, namely:
Figure SMS_4
wherein k is 1.ltoreq.k l ≤N,
Decision function
Figure SMS_5
The expression of (2) is as follows:
Figure SMS_6
wherein l=1, 2, …, M
Wherein,,
Figure SMS_7
is the first decision function->
Figure SMS_8
Each corresponding to a post-processing action in the first subgroup.
As an improvement to the above system, the post-processing action specifies the forwarding processing behavior of the intermediate transmission node for the received transport layer protocol message, including, but not limited to, direct forwarding, caching, storing, proximity forwarding, and modified forwarding.
As an improvement of the above system, the proximity forwarding action includes: the destination address in the message is modified to be the address of the adjacent node and then forwarded, and the original message can be forwarded or the relevant indication information in the message can be modified and then forwarded; the adjacent nodes are other intermediate transmission nodes selected according to the distance from the current node; including but not limited to network distance or geographic distance.
As an improvement of the above system, the address of the neighboring node is filled in according to the output value of the neighboring node selection function SN (Y), which has the expression:
SN(Y)={NA i ,i=1,…,I)
the function selects proper adjacent node from other adjacent intermediate transmission nodes of the current intermediate transmission node according to the adjacent node state, the function is not limited in form, the input Y is the adjacent node state, and the output value NA i Is the network address of the I-th neighboring node that meets the selection function selection condition, and I is the total number of neighboring nodes that meets the selection function selection condition.
As an improvement of the above system, a name resolution system is configured outside the data transmission system, for managing and maintaining a mapping relationship between an ID and a network address of each node of the data transmission system, and between a data block ID and a network address of a node storing the data block, where a data block ID may correspond to a plurality of network addresses; thereby providing an ID to NA resolution service; the node storing the data block is a data source service node or an intermediate transmission node storing the data block identified by the ID and capable of providing the content sending service of the data block.
As an improvement of the above system, the modified forwarding is forwarding after modifying the destination address in the message, and the modified corresponding address is filled in by the output value of the selection function G (CNA), where the expression of the selection function is:
G(CNA)={NA j ,NA j ∈CNA,j=1,…,J},
wherein CNA is the set of network addresses, or number, of nodes holding data blocks identified as IDsA set of data requesting node network addresses corresponding to the requesting node IDs, which set may be, but is not limited to, obtained by querying a name resolution system, G (CNA) may define one or more based on the application and network requirements; output value NA j Is the network address of the J-th node having the data block identified as ID stored therein, J is the total number of nodes having the data block identified as ID stored therein.
The invention has the advantages that:
based on the unchanged data block ID and the data request node ID, the system of the invention realizes the transmission of the data block between the data request node and the intermediate transmission node or the data source service node, and realizes the caching and storage of the data block in the transmission process through the decision and the processing of the message field by the intermediate transmission node.
Drawings
Fig. 1 is a schematic diagram illustrating a data transmission system with network memory capability according to the present invention;
FIG. 2 is a diagram of a message segment containing decision processing indication information;
FIG. 3 is a message diagram of a message payload containing decision processing indication information;
FIG. 4 is a functional block diagram of an intermediate transmission node;
FIG. 5 is a schematic diagram A of a data request and response flow;
fig. 6 is a schematic diagram B of a data request and response flow.
Detailed Description
The technical scheme of the invention is described in detail below with reference to the accompanying drawings.
As shown in fig. 1, the data transmission system with network memory capability provided by the invention is composed of nodes such as a data request node, a data source service node, an intermediate transmission node capable of processing a transmission layer message and having a self-decision data storage function, and each node has a unique Identifier (ID) of the whole network and at least has a Network Address (NA); the transmission object of the system is a data block (such as ID-c in the figure) with a unique ID of the whole network, the intermediate transmission node and the data source service node of the system can respond to the request initiated by the data request node, and all the nodes of the system comprise a unit module for processing the transmission layer protocol message based on the ID.
The data request node of the system has the functions of generating and sending data request messages and receiving data response messages; the data source service node of the system has the function of responding to the data request message and generating and sending the data response message.
The system is externally responsible for managing and maintaining the mapping relation between each node ID and the node network address of the data transmission system and between the data block ID and the node network address storing the data block by a name analysis system, and provides analysis service from ID to NA; the mapping relationship may be that one data block ID corresponds to a plurality of network addresses, for example, the data block ID-c in the figure corresponds to two network addresses NA-s and NA-t3.
The header fields of the transport layer protocol packet proposed in the present invention may include, but are not limited to, a data block ID, a data request node ID, a source address, a destination address, a packet type, and a decision processing indication field, and fig. 2 is a schematic diagram of the packet in an IPv6 network.
Wherein, the data block ID and the data request node ID remain unchanged during the transmission process, the message types include, but are not limited to, a data request message and a data response message, and the decision processing indication field includes, but is not limited to, a preference indication, a buffer indication and a QoS indication, and can be combined. The source address of the data request message is the network address of the data request node corresponding to the data request node ID, the destination address is the address of the node which stores the data block identified as ID and can provide the content transmission service of the data block, and the destination address can be changed in transmission according to the change of the node providing the transmission service and the network address thereof.
The source address of the data response message is the address of the node which stores the data block identified as ID and can provide the content sending service of the data block, and the destination address is the address of the data request node corresponding to the data request node ID, wherein the source address can be changed in transmission according to the change of the node providing the sending service and the network address thereof.
In the decision process indication field, the value of the preference indication field expresses preferred network location indication information for caching or storing the data block, including, but not limited to, near the data requesting node, near the data source, near the network core, combinations thereof, and the like; the value of the buffer indicating field expresses buffer behavior indicating information of the content of the data block in the message of the field on the transmission path, including but not limited to the number of times the data block is buffered on the transmission path, the number of times the data block is buffered, and the like; the value of the QoS indication field expresses QoS requirement indication information of the data block content during transmission, buffering and storage, including but not limited to time delay, throughput, reliability and the like.
Decision processing indication information in the message field can also be transmitted through a message load, fig. 3 is a schematic diagram of a message for transmitting the information through the message load, and a TLV (Length, value) coding format is adopted, wherein tags 1,2 and 3 respectively correspond to information such as QoS indication, preference indication, cache indication and the like.
A functional block diagram of the intermediate transmission node is shown in FIG. 4, and includes a transport layer protocol message processing module, a decision module and a post-processing module, wherein:
the transport layer protocol message processing module is responsible for receiving and identifying an ID-based transport layer protocol message, analyzing the message, acquiring information such as a data block ID, a data request node ID, a source address, a destination address, a message type, a decision processing instruction and the like contained in a head field or a load of the transport layer protocol message, and constructing a transport processing information set based on the information and transmitting the information to the decision module. And the message processed by the post-processing module is also transmitted to the network layer to be sent out.
The input of the decision module is the transmission processing information set and the network state set of the current node which are transmitted by the transmission layer protocol message processing module, and the output result is transmitted to the post-processing module for deciding whether to execute the corresponding post-processing action.
The decision module may be characterized by a calculation of a set of decision functions, which correspond to a set of post-processing actions, the values of the decision functions being used to decide whether to perform the corresponding post-processing actions,each decision function may take a different functional form. One decision function may correspond to one post-processing action or may correspond to a plurality of post-processing actions. Without loss of generality, it is assumed that there are N post-processing actions (N.gtoreq.1), for the former, the decision function of the nth post-processing action
Figure SMS_9
The expression of (2) is as follows:
Figure SMS_10
wherein n=1, 2, …, N
The input Xe (PV U NV) of the function, PV is the transmission processing information set, NV is the network state set, n is the label of the post-processing action, and the decision function
Figure SMS_11
The value d of (2) n For deciding whether to perform a post-processing action numbered n.
For the latter, the post-processing action is divided into M subgroups (1 MN), one decision function corresponding to each subgroup, each subgroup containing k l A post-processing action, namely:
Figure SMS_12
wherein k is 1.ltoreq.k l ≤N,
The expression of the decision function is as follows:
Figure SMS_13
where l=1, 2, …, M,
wherein,,
Figure SMS_14
is the first decision function->
Figure SMS_15
Each corresponding to a post-processing action of the first subgroup.
The post-processing module decides whether to execute post-processing actions such as direct forwarding, caching, storing, proximity forwarding, modified forwarding and the like based on the output of the decision module. Wherein,,
the direct forwarding does not modify the message, and directly forwards the message.
The buffer memory stores the data block content in the message in the local of the intermediate transmission node, and forwards the original message or forwards the message after modifying the relevant indication information in the message.
The storing is to store the content of the data block in the message locally at the intermediate transmission node.
The adjacent forwarding is to modify the destination address in the message into the address of the adjacent node and then forward the message, and simultaneously forward the original message or modify the relevant indication information in the message and then forward the message. The neighboring nodes of the current node are other intermediate transmission nodes selected based on distance from the current node, which distance may be measured, but is not limited to, by network distance or geographic distance. The destination address of the neighbor forwarding modification may be filled in according to the output value of the neighbor node selection function SN (Y),
SN(Y)={NA i ,i=1,…,I}
the function selects other suitable transmission nodes from the transmission nodes adjacent to the current intermediate transmission node according to the adjacent node state, the function is not limited in form, the input Y is the adjacent node state, and the output value NA i Is the network address of the neighboring intermediate transmission node that meets the selection function selection condition.
The modified forwarding is forwarding after modifying the destination address in the message, and the modified corresponding address is filled in by the output value of a selection function G (CNA), wherein the expression of the selection function is as follows:
G(CNA)={NA j ,NA j ∈CNA,j=1,…,J}
wherein, CNA is a node network address set corresponding to a data block ID and storing a data block identified as the ID, or a data request node network address set corresponding to a data request node ID, where the set may be, but is not limited to, obtained by querying a name resolution system, and G (CNA) may define one or more based on an application and a network requirement.
Decision function
Figure SMS_16
The method can adopt a two-step decision mode, firstly, relatively independent decision matters such as the data block caching/storage requirement, the current node caching/storage capability, the selection of adjacent nodes, the caching capability and the like are judged once, and then a joint decision is carried out based on the judgment result, namely, the decision function can be expressed as a joint decision function of output values of a decision function of a series of decision matters:
Figure SMS_17
wherein,,
Figure SMS_18
is a joint decision function for the nth post-processing action, the input of which is a decision function triggering the nth post-processing action related decision item +.>
Figure SMS_19
Output value of>
Figure SMS_20
And->
Figure SMS_21
Is not limited in form.
The decision function of the relevant decision event can be expressed as:
Figure SMS_22
a buffer determination function is shown for determining whether the content of a data block in a message needs to be buffered at a current intermediate transmission node, and its output value may be, but is not limited to, characterized by a boolean value:
Figure SMS_23
Figure SMS_24
representing a buffering capacity decision function, usingIn determining whether the current intermediate transmission node has the capability to buffer the data block, its output value may be, but is not limited to, characterized by a boolean value:
Figure SMS_25
Figure SMS_26
a neighbor cache determination function is indicated for determining whether the current intermediate transmission node can cache the message forwarded to the neighbor intermediate transmission node, and the output value thereof may be, but is not limited to, characterized by a boolean value:
Figure SMS_27
Figure SMS_28
representing a store determination function for determining whether the contents of a data block in a message need to be stored at a current intermediate transfer node, the output value of which may be, but is not limited to, characterized by a boolean value:
Figure SMS_29
Figure SMS_30
representing a capacity decision function for deciding whether the current intermediate transmission node has capacity to store a data block, the output value of which may be, but is not limited to, characterized by a boolean value:
Figure SMS_31
Figure SMS_32
represents a destination address determination function for determining whether to modify a destination address, the output value of which may beBut are not limited to, characterized by boolean values:
Figure SMS_33
Figure SMS_34
representing a source address decision function for deciding whether to modify a source address, the output value of which may be, but is not limited to, characterized by a boolean value:
Figure SMS_35
Figure SMS_36
is a function of other decisions related to the application or network requirements.
Thus, the joint decision function for post-processing actions such as direct forwarding, caching, storing, proximity forwarding, and modified forwarding may be:
(1) Directed to direct forwarding actions
Figure SMS_37
(2) Directed to cache actions
Figure SMS_38
(3) For storage actions
Figure SMS_39
(4) For proximity forwarding actions
Figure SMS_40
(5) Directed to modifying forwarding actions
Figure SMS_41
When the output value of the joint decision function is true, a corresponding post-processing action is performed, the output of which may also be a continuous value, and a decision is made as to whether to perform the corresponding post-processing action by comparing with a threshold value.
The specific implementation of a data request and response flow of the transmission system proposed by the present invention is shown in fig. 5 and 6.
For fig. 5, without loss of generality, it is assumed that each intermediate transmission node does not cache or store any data blocks at initialization; the data source service node is provided with a network address NA-s, stores a data block identified by the ID-c, and registers the mapping relation between the ID-c and the data source service node address NA-s in the name resolution system; the data request node 1 is provided with a unique identifier ID-r1 of the whole network and a network address NA-r1; the intermediate transmission nodes 1,2, 3 are respectively provided with network addresses NA-t1, NA-t2 and NA-t3, and decision functions in decision modules adopt a two-step decision mode, wherein the decision functions are cached
Figure SMS_42
The assumption is +.>
Figure SMS_43
I.e. the current node always needs to be cached; in the header field of the transport layer protocol message, the value of the message type field is set to 0 and 1, wherein 0 represents a data request message, and 1 represents a data response message.
(101) The data request node 1 sends an analysis request to a name analysis system, wherein the request carries a data block ID-c, and the name analysis system returns a data source service node address NA-s storing the data block ID-c;
(102) The method comprises the steps that a transmission layer protocol message processing module of a data request node 1 generates and sends a data request message, and initiates a request for a data block, wherein the message type is set to 0, the data block ID is set to ID-c, the data request node ID is set to ID-r1, a destination address is set to NA-s, a source address is set to NA-r1, and the message is forwarded to an intermediate transmission node 1 according to a routing mechanism of a network where the message is located;
(103) The transmission layer protocol message processing module of the intermediate transmission node 1 receives the data request message, identifies and analyzes the message, reads the message type as 0, and reads the destination address which is not the node address, and directly forwards the message to the intermediate transmission node 2 according to the routing mechanism of the network;
(104) The transmission layer protocol message processing module of the intermediate transmission node 2 receives the data request message, identifies and analyzes the message, reads the message type as 0, and reads the destination address which is not the node address, and directly forwards the message to the data source service node according to the routing mechanism of the network;
(105) The transmission layer protocol message processing module of the data source service node receives the data request message, identifies and analyzes the message, reads the message type as 0, reads the data request message, reads the destination address, and the destination address NA-s is the network address of the node, so that a data response message is generated in response to the data request, the message type is set as 1, the data block ID is set as ID-c, the data request node ID is set as ID-r1, the destination address is set as NA-r1, the source address is set as NA-s, decision processing indication field information at least comprises a buffer indication, then encapsulates the data block content corresponding to the ID-c, and sends the message, and the message is forwarded to the intermediate transmission node 3 according to the routing mechanism of the network.
(106) The transmission layer protocol message processing module of the intermediate transmission node 3 receives the data response message, recognizes and analyzes the message, reads the message type 1, reads the decision processing instruction information for the data response message, and transmits the decision processing instruction information to the decision module; decision module computation
Figure SMS_44
And->
Figure SMS_45
Figure SMS_46
Needs to be cached and has the ability to cache, +.>
Figure SMS_47
Based on this, a joint decision function for the caching action is calculated>
Figure SMS_48
The decision result is that the buffer processing is executed, so that the post-processing module executes the buffer action to buffer the content of the data block, and then executes the step (107) after the success, and forwards the original message, or modifies the buffer indication information in the message to forward, and the message is forwarded to the intermediate transmission node 1 according to the routing mechanism of the network.
(107) The intermediate transmission node 3 registers the mapping relation between the data block ID and the network address NA-t3 of the intermediate transmission node 3 with the name resolution system.
(108) The transmission layer protocol message processing module of the intermediate transmission node 1 receives the data response message, recognizes and analyzes the message, reads the message type 1, reads the decision processing instruction information for the data response message, and transmits the decision processing instruction information to the decision module; decision module computation
Figure SMS_49
And->
Figure SMS_50
Figure SMS_51
Needs to be cached and has the ability to cache, +.>
Figure SMS_52
Based on this, a joint decision function for the caching action is calculated>
Figure SMS_53
The decision result is to execute the buffer processing, so the post-processing module executes the buffer action to buffer the content of the data block, and the step is executed after success109 And forwarding the original message, or modifying the buffer indication information in the message to forward, wherein the message is forwarded to the data request node 1 according to the routing mechanism of the network.
(109) The intermediate transmission node 1 registers the mapping relation between the data block ID and the network address NA-t1 of the intermediate transmission node 1 with the name resolution system.
(110) The transmission layer protocol message processing module of the data request node 1 receives the data response message, identifies and analyzes the message, reads the message type 1, reads the destination address of the data response message, and the destination address NA-r1 is the network address of the node, thus reading the content of the data block and providing the read content of the data block to the upper layer application.
In the executing process of the step (105), the step (105 a) may be executed first to update the destination address, and then the message is sent.
(105a) The data source service node sends an analysis request to a name analysis system, wherein the request carries a data request node 1 identification ID-r1, and the name analysis system returns an address NA-r1 corresponding to the ID-r1 to update a destination address;
in the executing process of the step (106), the step (106 a) may be executed first to update the destination address, and then the message is forwarded.
(106a) The intermediate transmission node 3 sends an analysis request to a name analysis system, wherein the request carries a data request node 1 identification ID-r1, and the name analysis system returns an address NA-r1 corresponding to the ID-r1 to update a destination address;
in the executing process of the intermediate transmission node 1 in the step (108), the destination address may be updated first and then the message is forwarded, and the steps are similar to the step (106 a) and will not be repeated.
The step (105) of the above-mentioned flow starts, and the data response message is sequentially transmitted to the intermediate transmission nodes 3, 1 and the data request node 1 according to the routing mechanism of the network itself, and may also be transmitted along the paths of the intermediate transmission nodes 2, 1 and the data request node 1 according to the routing mechanism of the network itself.
In step (105) of the above flow, when the data source service node transport layer protocol packet processing module encapsulates the data response packet, the size of the data block may be larger than the maximum length of the network layer packet, and the data block corresponding to the ID-c may be split into smaller data pieces, and encapsulated into multiple data packets for transmission, where the transmission time may be, but is not limited to, continuous transmission, or transmission according to the request condition of the data request node.
For fig. 6, a data request node 2 is added on the basis of fig. 5, and has a unique identifier ID-r2 of the whole network and a network address NA-r2. Furthermore, it is assumed that the data requesting node 1 has requested and obtained a data block identified by ID-c according to the flow of fig. 5, which data block has also been successfully buffered and registered in the intermediate transmitting node 3, 1; the specific implementation flow of the data block identified by the request ID-c of the data request node 2 is as follows:
(201) The data request node 2 sends an analysis request to a name analysis system, wherein the request carries a data block ID-c, the name analysis system returns a network address set CNA storing the data block ID-c, the network address set CNA comprises a data source service node address NA-s, addresses NA-r3 and NA-r1 of intermediate transmission nodes 3 and 1, and the NA-r3 is assumed to be selected; the name resolution system may also select an address return, the method of selection is not limited, and it is assumed that NA-r3 is returned;
(202) The method comprises the steps that a transmission layer protocol message processing module of a data request node 2 generates and sends a data request message, and initiates a request for a data block, wherein the message type is set to 0, the data block ID is set to ID-c, the data request node ID is set to ID-r2, a source address is set to NA-r1, and a destination address is set to NA-r3; the message is forwarded to the intermediate transmission node 1 according to the routing mechanism of the network itself;
(203) The transmission layer protocol message processing module of the intermediate transmission node 1 receives a data request message, identifies and analyzes the message, reads the message type as 0, reads a destination address which is not the node address, directly forwards the message, and forwards the message to the intermediate transmission node 3 according to a routing mechanism of the network;
(204) The transport layer protocol message processing module of the intermediate transmission node 3 receives the data request message, identifies and analyzes the message, reads the message type 0, reads the data request message, reads the destination address, and the destination address is the node address, so that a data response message is generated in response to the data request, the message type 1 is set, the data block ID is set as ID-c, the data request node ID is set as ID-r2, the destination address is set as NA-r2, the source address is set as NA-t3, the decision processing indication field information at least comprises a buffer indication, then encapsulates the data block content corresponding to the ID-c, and sends the message, and the message is forwarded to the intermediate transmission node 1 according to the routing mechanism of the network.
(205) The transmission layer protocol message processing module of the intermediate transmission node 1 receives the data response message, recognizes and analyzes the message, reads the message type 1, reads the decision processing instruction information for the data response message, and transmits the decision processing instruction information to the decision module; decision module computation
Figure SMS_54
And->
Figure SMS_55
Figure SMS_56
Requiring buffering, assuming the current node is currently capable of buffering,
Figure SMS_57
based on this, a joint decision function for the caching action is calculated>
Figure SMS_58
The decision result is that the buffer processing is executed, so that the post-processing module executes the buffer action to buffer the content of the data block, and the node is used for buffering the data block without re-buffering, forwarding the original message, and also modifying the buffer indication information in the message for re-forwarding, wherein the message is forwarded to the data request node 2 according to the routing mechanism of the network.
(206) The transmission layer protocol message processing module of the data request node 2 receives the data response message, identifies and analyzes the message, reads the message type 1, reads the destination address of the data response message, and reads the content of the data block because the destination address NA-r2 is the network address of the node, and provides the read content of the data block for the upper layer application.
In the executing process of the steps (204) and (205), the destination address may be updated first and then the message may be forwarded, and the steps are similar to the step (106 a) and will not be repeated.
Finally, it should be noted that the above embodiments are only for illustrating the technical solution of the present invention and are not limiting. Although the present invention has been described in detail with reference to the embodiments, it should be understood by those skilled in the art that modifications and equivalents may be made thereto without departing from the spirit and scope of the present invention, which is intended to be covered by the appended claims.

Claims (12)

1. A data transmission system with network memory capacity, characterized in that the data transmission system comprises a data request node, a data source service node and an intermediate transmission node, each node has a unique Identifier (ID) of the whole network, at least has a Network Address (NA), and has a unit for processing a transport layer protocol message based on the ID, and the transmission object of the data transmission system is a data block, and the data block has a unique identifier of the data block ID of the whole network;
the data request node is used for generating and sending a data request message and receiving a data response message;
the data source service node is used for responding to the data request, providing a sending service of the content of the data block when the data block identified by the ID exists in the node, and generating and sending a data response message;
the intermediate transmission node is used for processing the transmission layer protocol message based on the ID, has a self-decision data storage function, decides the subsequent processing behavior from the information acquired from the message and the network state of the node, responds to a data request, provides a sending service of the content of the data block when the node stores the data block identified by the ID, and generates and sends a data response message;
the intermediate transmission node is provided with a decision unit, the input of which is a transmission processing information set and a network state set of the node, and the output of which is used for deciding whether to execute corresponding post-processing actions;
the decision unit is characterized by calculating a group of decision functions, the group of decision functions correspond to a group of post-processing actions, the values of the decision functions are used for deciding whether to execute the corresponding post-processing actions, and each decision function adopts different function forms; one decision function corresponds to one or more post-processing actions.
2. The network memory capable data transmission system of claim 1, wherein the header field of the ID-based transport layer protocol message comprises a data block ID, a data request node ID, a source address, a destination address, a message type, and a decision process indication field; the data block ID and the data request node ID are kept unchanged in the transmission process, the message type comprises a data request message and a data response message, and the decision processing indication field comprises a preference indication field, a cache indication field, a QoS indication field and a combination thereof; the corresponding indication information contained in the decision processing indication field is transmitted through a message segment or transmitted through a message load.
3. The data transmission system with network memory capability according to claim 2, wherein the source address in the data request message is a network address of the data request node corresponding to the data request node ID, and the destination address is an address of a node storing the data block identified by the data block ID and capable of providing the content transmission service of the data block, and the destination address varies in transmission according to a variation of the node providing the transmission service and its network address.
4. The data transmission system with network memory capacity according to claim 2, wherein the source address of the data response message is an address of a node that stores a data block identified by a data block ID and can provide a content transmission service of the data block; the destination address is an address of a data requesting node corresponding to the data requesting node ID, wherein the source address is changed in transmission according to a change in the node providing the transmission service and its network address.
5. The network-capable data transmission system of claim 2, wherein the value of the preference indication field expresses optimal network location indication information for caching or storing data blocks, including near data requesting nodes, near data sources, near network cores, and combinations thereof;
the value of the buffer indicating field expresses buffer behavior indicating information of the content of the data block in the message of the field on a transmission path, wherein the buffer behavior indicating information comprises the buffered times of the data block on the transmission path and the times of the data block to be buffered;
the value of the QoS indication field expresses QoS requirement indication information of the content of the data block during transmission, buffering and storage, including time delay, throughput and reliability.
6. The data transmission system with network memory capacity according to claim 1, wherein the transmission processing information set is composed of information obtained by an intermediate transmission node through parsing a message, and includes header field information of the message and indication information transmitted in a message load; the network state set comprises the self state of the intermediate transmission node and the state of the adjacent node; the self state is used for indicating the resource providing capability of the current intermediate transmission node, and comprises an available cache space, an available storage space and an available bandwidth; the state of the adjacent node is used for indicating relevant state information of other adjacent intermediate transmission nodes of the current intermediate transmission node, including network addresses of the adjacent intermediate transmission nodes, available storage space and network distance from the node; the number of other intermediate transmission nodes in the vicinity is not limited to 1, and the state thereof is obtained by means of active or passive detection.
7. The network-capable data transmission system of claim 1, wherein a decision function corresponds to one or more post-processing actions, and further comprising:
there are N post-processing actions, and for the former, the nth post-processing actionDecision function
Figure FDA0004253581260000021
The expression of (2) is as follows:
Figure FDA0004253581260000022
wherein n=1, 2, …, N
The input Xe (PV U NV) of the function, PV is the transmission processing information set, NV is the network state set, n is the label of the post-processing action, and the decision function
Figure FDA0004253581260000023
The value d of (2) n For deciding whether to perform a post-processing action numbered n;
for the latter, the post-processing actions are divided into M subgroups, 1.ltoreq.M<N, a decision function corresponds to a subgroup, each subgroup containing k l A post-processing action, namely:
Figure FDA0004253581260000024
wherein k is 1.ltoreq.k l ≤N,
Decision function
Figure FDA0004253581260000025
The expression of (2) is as follows:
Figure FDA0004253581260000026
wherein l=1, 2, …, M
Wherein,,
Figure FDA0004253581260000031
is the first decision function->
Figure FDA0004253581260000032
Each corresponding to a post-processing action in the first subgroup.
8. The network-capable data transmission system of claim 1, wherein the post-processing actions specify forwarding processing actions of the intermediate transmission node on the received transport layer protocol messages, including direct forwarding, caching, storing, proximity forwarding, and modified forwarding.
9. The network-capable data transmission system of claim 8, wherein the proximity forwarding comprises: the destination address in the message is modified to be the address of the adjacent node and then forwarded, and the original message is forwarded or the relevant indication information in the message is modified and then forwarded; the adjacent nodes are other intermediate transmission nodes selected according to the distance from the current node; the distance includes a network distance or a geographic distance.
10. The network-capable data transmission system of claim 9, wherein the address of the neighboring node is filled in according to an output value of a neighboring node selection function SN (Y), the function having the expression:
SN(Y)={NA i ,i=1,...,I}
the function selects a suitable neighboring node from other neighboring intermediate transmission nodes based on the neighboring node state, the input Y of which is the neighboring node state, and the output value NA i Is the network address of the I-th neighboring node that meets the selection function selection condition, and I is the total number of neighboring nodes that meets the selection function selection condition.
11. The data transmission system with network memory capacity according to claim 8, wherein a name resolution system is configured outside the data transmission system for managing and maintaining a mapping relationship between an ID of each node of the data transmission system and a network address, a data block ID corresponding to a plurality of network addresses, and a network address of a node storing the data block; thereby providing an ID to NA resolution service; the node storing the data block is a data source service node or an intermediate transmission node storing the data block identified by the ID and capable of providing the content sending service of the data block.
12. The network-capable data transmission system according to claim 11, wherein the modified forwarding is forwarding after modifying the destination address in the message, and the modified corresponding address is filled in by an output value of a selection function G (CNA), and the expression of the selection function is:
G(CNA)={NA j ,NA j ∈CNA,j=1,...,J},
wherein, the CNA is a network address set of nodes storing data blocks identified as IDs, or a network address set of data request nodes corresponding to the IDs of the data request nodes, the set is inquired and obtained from a name resolution system, and G (CNA) can define one or more based on application and network requirements; output value NA j Is the network address of the J-th node having the data block identified as ID stored therein, J is the total number of nodes having the data block identified as ID stored therein.
CN202011473017.0A 2020-12-15 2020-12-15 Data transmission system with network memory capacity Active CN114697347B (en)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CN202011473017.0A CN114697347B (en) 2020-12-15 2020-12-15 Data transmission system with network memory capacity
JP2023535901A JP2023554345A (en) 2020-12-15 2022-01-24 Data transmission system with storage function within the network
PCT/CN2022/073398 WO2022127938A1 (en) 2020-12-15 2022-01-24 Data transmission system having in-network storage capability

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011473017.0A CN114697347B (en) 2020-12-15 2020-12-15 Data transmission system with network memory capacity

Publications (2)

Publication Number Publication Date
CN114697347A CN114697347A (en) 2022-07-01
CN114697347B true CN114697347B (en) 2023-06-27

Family

ID=82058947

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011473017.0A Active CN114697347B (en) 2020-12-15 2020-12-15 Data transmission system with network memory capacity

Country Status (3)

Country Link
JP (1) JP2023554345A (en)
CN (1) CN114697347B (en)
WO (1) WO2022127938A1 (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2023151354A2 (en) * 2022-12-01 2023-08-17 黄建邦 Data transmission method and system, and first end, intermediate network device and control device

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104780205A (en) * 2015-03-24 2015-07-15 清华大学深圳研究生院 Content request and transmission method and system for content center network

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2002006961A2 (en) * 2000-07-19 2002-01-24 Speedera Networks, Inc. Method for determining metrics of a content delivery
US8762570B2 (en) * 2012-02-21 2014-06-24 Futurewei Technologies, Inc. Method and apparatus for adaptive forwarding strategies in content-centric networking
CN104901860B (en) * 2014-03-04 2018-03-23 中国科学院声学研究所 The system and method that a kind of NDN and CDN interconnects
CN105812261B (en) * 2016-03-07 2019-02-26 北京交通大学 Message forwarding method and system in information centre's network
CN107395500B (en) * 2017-08-25 2020-03-31 中国科学技术大学 Intelligent network architecture integrating perception, calculation and storage and implementation method
CN109561355B (en) * 2017-09-27 2020-07-17 中国科学院声学研究所 System and method for CCN/NDN content registration, content location analysis and content routing
CN111107000B (en) * 2019-12-13 2021-09-07 东南大学 Content caching method in named data network based on network coding
CN111314224B (en) * 2020-02-13 2021-03-09 中国科学院计算技术研究所 Network caching method for named data

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104780205A (en) * 2015-03-24 2015-07-15 清华大学深圳研究生院 Content request and transmission method and system for content center network

Also Published As

Publication number Publication date
CN114697347A (en) 2022-07-01
JP2023554345A (en) 2023-12-27
WO2022127938A1 (en) 2022-06-23

Similar Documents

Publication Publication Date Title
US8677011B2 (en) Load distribution system, load distribution method, apparatuses constituting load distribution system, and program
CN102714629B (en) Communication system, forward node, route managing server and communication means
EP1134933B1 (en) System and method for multicasting
CN103118013B (en) The method of packet incidentally reverse interest bag in content center network
CN102056333A (en) WAP (wireless application protocol) gateway, service processing method thereof and WAP proxy server
KR102134454B1 (en) Communication method of node overhearing contents in a content centric network and the node
CN108293023B (en) System and method for supporting context-aware content requests in information-centric networks
CN104885431A (en) Content based traffic engineering in software defined information centric networks
CA2281321A1 (en) Programmable network
CN101360046B (en) Bandwidth resource saving method
CN109525304B (en) Space intelligent network architecture integrating perception, calculation and storage
CN109218111B (en) Method for processing message and repeater
US20230300726A1 (en) Data processing method and apparatus, network element device, storage medium, and program product
US6965591B1 (en) System and method for gatekeeper-to-gatekeeper communication
Xing et al. MPTCP meets big data: Customizing transmission strategy for various data flows
CN108234320A (en) Message transmitting method and interchanger
CN114697347B (en) Data transmission system with network memory capacity
US20120257555A1 (en) Forwarding a packet in a sensor personal area network
Khan et al. A Hierarchal Clustered Based Proactive Caching in NDN-Based Vehicular Network.
WO2023169374A1 (en) Routing method and system, and node
CN109716310A (en) Server unit, transmitting device and program for content distribution system
EP4395253A1 (en) Routing method and apparatus, cloud resource registration method and apparatus, storage medium, and electronic apparatus
CN116566897A (en) Addressing routing method, device, equipment and medium
CN115996199A (en) Network-on-chip and multicast message transmission method
CN114363240B (en) Network forwarding device and data forwarding method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant