CN108768855A - A kind of data-centered next generation network implementation method - Google Patents
A kind of data-centered next generation network implementation method Download PDFInfo
- Publication number
- CN108768855A CN108768855A CN201810542793.8A CN201810542793A CN108768855A CN 108768855 A CN108768855 A CN 108768855A CN 201810542793 A CN201810542793 A CN 201810542793A CN 108768855 A CN108768855 A CN 108768855A
- Authority
- CN
- China
- Prior art keywords
- data
- message
- thresholding
- fragment
- title
- 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.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Health & Medical Sciences (AREA)
- Computing Systems (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of data-centered next generation network implementation method, a type of data are by title unique mark and are divided into N number of fragment, and N is the positive integer more than 1, and each fragment is by fragment ID j unique marks, 1~N of j values；Data server can generate, preserve and provide a type of data, and a type of data can be generated by multiple data servers；One user node can obtain a type of data；Data router can preserve and provide a type of data；The data-centered next generation network implementation method that user node provides through the invention can quick obtaining data improve service quality to reduce data communication delays and cost.Present invention can apply to the numerous areas such as agricultural engineerization, intelligent medical, are with a wide range of applications.
Description
Technical field
The present invention relates to a kind of implementation method more particularly to a kind of data-centered next generation network realization sides
Method.
Background technology
Next generation network is a kind of new service mode.In recent years, many research work are dedicated to next generation network, so as to
User node being capable of quick obtaining network service.With the development of network technology, next generation network can become the following offer service
One mode.Currently, the data communication delays and cost of next generation network are all bigger, network service performance is reduced.Cause
How this, reduce next generation network and provide delay and the cost of service as the hot issue of Recent study.
Invention content
Goal of the invention：The technical problem to be solved by the present invention is in view of the deficiencies of the prior art, provide one kind with data
Centered on next generation network implementation method
Technical solution：The invention discloses a kind of data-centered next generation network implementation method, the network packets
Include data server, data router and user node；Data server and user node respectively with a data router chain
Road is connected；
A type of data are by title unique mark and are divided into N number of fragment, and N is the positive integer more than 1, each fragment
By fragment ID j unique marks, 1~N of j values；Data server can generate, preserve and provide a type of data, a type
The data of type can be generated by multiple data servers；One user node can obtain a type of data；Data are route
Device can preserve and provide a type of data；
For each type of data, data router safeguards that a routing table, the table name of the routing table are to identify this kind
The title of categorical data；
One route table items includes sequence number, next-hop, source server and distance domain；
Data server by new data message publication generate data, new data message include type of message, title, under
One jump, source server and distance domain；
One data server, user node and data router respectively safeguard a tables of data, each data table items
Including title-domain, the domains fragment ID, fragment domain and life cycle domain；
Data D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each data fragmentation is by dividing
Piece ID j1 marks；After data server S1 generates data D1, following process publication data are executed：
Step 101：Start；
Step 102：A variable k is arranged in data server S1, and the initial value of variable k is 1；
Step 103：Data server S1 creates a data table items, and the title-domain of the data table items is NA1, the domains fragment ID
Value is k, and fragment thresholding is sk, life cycle thresholding is to pre-set value, such as 30min；
Step 104：Variable k is incremented by 1 by data server S1, if variable k is more than N1, is thened follow the steps 105, is otherwise held
Row step 103；
Step 105：Data server S1 sends new data message, and the type of message of the new data message is 1, entitled
NA1, next-hop and source server thresholding are the hardware address of oneself, such as MAC Address, are 1 apart from thresholding；
Step 106：If user node or data server receive the new data message, 112 are thened follow the steps, it is no
Then follow the steps 107；
Step 107：The data router for receiving new data message judges oneself whether preserve a routing table, the routing
The table name of table is equal to the title of the new data message, if so, being then not necessarily to create routing table, if it is not, creating a road
By table, the table name of the routing table is equal to the title of the new data message；The data router checks that table name disappears equal to the new data
The routing table of title thresholding in breath, if there is a route table items, the next-hop and source server thresholding point of the route table items
Not Deng Yu the new data message next-hop and source server thresholding, then follow the steps 109, it is no to then follow the steps 108；
Step 108：The data router for receiving new data message checks that table name is equal to the road of the new data message title
By table, which calculates the route table items sum x of the routing table, creates a route table items, the sequence of the route table items
Row number is x+1, next-hop, source server and apart from thresholding be respectively equal to next-hop, the source server of the new data message with
And apart from thresholding, execute step 111；
Step 109：The data router for receiving new data message checks that table name is equal to the road of the new data message title
By table, a route table items are selected, the next-hop and source server thresholding of the route table items are respectively equal to the new data message
Next-hop and source server thresholding judge the distance domain of the route table items whether being more than apart from thresholding in the new data message
Value, if so, 110 are thened follow the steps, it is no to then follow the steps 112；
Step 110：The data router for receiving new data message checks that table name is equal to the road of the new data message title
By table, a route table items are selected, the next-hop and source server thresholding of the route table items are respectively equal to the new data message
Next-hop and source server thresholding, by the route table items apart from thresholding be updated in the new data message apart from thresholding；
Step 111；The new data message is incremented by 1 by the data router for receiving new data message apart from thresholding, will
Next-hop thresholding in the new data message is updated to the hardware address of oneself, forwards the new data message, executes step 103；
Step 112：Terminate.
Data server issues new data by the above process, the above process, the table name of routing table with title come identify from
And accelerate the routed path speed of inquiry arrival purpose data server；In addition, the above process created in tables of data it is multiple
The route table items for reaching data server, to realize the load balancing and network traffic flow between multiple data servers
The load balancing of amount；Each route table items are utilized ensures that the path length for reaching data server is most short apart from thresholding, to carry
High data communication quality.
In the method for the invention, if data server deletes the data of generation, updated using message is deleted
Routing table；It includes type of message, title and source server to delete message；
Data D1 is by title NA1 unique marks, and data server S1 creates and issued data D1, if data server
S1 prepares to delete data D1, then executes operations described below：
Step 201：Start；
Step 202：Data server S1 checks tables of data, and all title thresholdings is selected to be equal to the data table items of title NA1,
The data table items chosen described in deletion；Data server S1, which is sent, deletes message, and the type of message of the deletion message is 2, title
Thresholding is NA1, and source server is the hardware address of data server S1；
Step 203：If user node or data server receive the deletion message, 204 are thened follow the steps, otherwise
Execute step 205；
Step 204：It receives the user node of the deletion message or data server abandons the deletion message, execute step
Rapid 207；
Step 205：It receives and deletes the routing table that the data router of message checks table name equal to the deletion message name,
If at least there are a route table items, the source server thresholding of the route table items is equal to the source server domain of the deletion message
Value, thens follow the steps 206, no to then follow the steps 207；
Step 206：It receives and deletes the routing table that the data router of message checks table name equal to the deletion message name,
It selects all source server thresholdings to be equal to the route table items of the source server thresholding of the deletion message, deletes the routing table chosen
?；The data router forwards the deletion message, executes step 203；
Step 207：Terminate.
If data server deletes some data, routing table is updated by the above process, i.e. all-router is deleted
The route table items of the data server are reached, so that it is guaranteed that the real-time and correctness of routing, improve the success rate of data communication.
In the method for the invention, user node obtains a type of number by sending solicitation message and data-message
According to；
Solicitation message includes type of message, title, fragment ID, next-hop and previous hop domain；
Data-message includes type of message, title, fragment ID, next-hop and fragment domain；
Data D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each data fragmentation is by dividing
Piece ID j1 marks；
If data router receives a solicitation message, the entitled NA1 of this application message, fragment ID are y, and table
The route table items sum of the routing table of entitled title NA1 is t1, then the data router calculates next-hop data using formula (1)
Route table items sequence number r1 corresponding to router；
Each data router safeguards an application form, each to apply for that list item includes title-domain, the domains fragment ID and next-hop
Domain；
Each data router safeguards neighbours' application form and a data directory；One neighbour applies for that list item includes
Title-domain, the domains fragment ID, next hop domain and neighbouring domain；One data directory item include title-domain, the domains fragment ID, neighbouring domain and
Life cycle domain；
One data router periodically sends informational message in a jump range, and informational message includes type of message, neighbours
Domain and load domain, wherein load thresholding is the application form and tables of data of the data router；
Data router CR1 periodically sends informational message, and the value of message types of the informational message is 3, and neighbours' thresholding is certainly
Oneself hardware address, load thresholding are the application form and tables of data of oneself；
Data router CR2 is the neighbor data router of data router CR1, and data router CR2 receives data
After the informational message that router CR1 is sent, operations described below is executed：
Step 301：Start；
Step 302：After data router CR2 receives the informational message that data router CR1 is sent, check that the information disappears
Application form in breath load, for each of informational message load application list item, data router CR2 checks the neighbour of oneself
Application form is occupied, judges whether that a neighbours apply for that list item, the neighbours apply for that neighbours' thresholding of list item is equal to the informational message
Neighbours' thresholding, and the neighbours apply list item title thresholding, fragment ID and next-hop thresholding be respectively equal to this application table
Title thresholding, fragment ID and the next-hop thresholding of item, if it does not, data router CR2 then creates neighbours' application
List item, which applies for that neighbours' thresholding of list item is equal to neighbours' thresholding of the informational message, and the neighbours apply for the name of list item
Thresholding, fragment ID and next-hop thresholding is claimed to be respectively equal to title thresholding, fragment ID and the next-hop thresholding of this application list item；
If it is present without executing any operation；
Step 303：The data router CR2 for receiving informational message checks the neighbours' application form of oneself, selects all neighbours
The neighbours that thresholding is occupied equal to informational message neighbours' thresholding apply for list item, apply for list item, data road for each neighbours chosen
The application form in the informational message load received is checked by device CR2, judges to apply for list item with the presence or absence of one in this application table,
The title thresholding of this application list item, fragment ID and next-hop thresholding are respectively equal to the neighbours and apply for the title thresholding of list item, divide
Piece ID and next-hop thresholding, if it does not, data router CR2, which then deletes the neighbours, applies for list item；If it is present nothing
Any operation need to be executed；
Step 304：Receive informational message data router CR2 check the informational message load in tables of data, needle
Each data table items in being loaded to the informational message, data router CR2 check the data directory of oneself, judge whether to deposit
In a data directory item, neighbours' thresholding of the data directory list item is equal to neighbours' thresholding of the informational message, and the number
It is respectively equal to the title thresholding and fragment ID of the data table items according to the title thresholding and fragment ID of index list item, if it does, number
Then the life cycle thresholding of the data directory list item is set to according to router CR2 the life cycle thresholding of the data table items；Such as
Fruit is not present, and data router CR2 creates a data directory item, and neighbours' thresholding of the data directory list item is equal to the information
Neighbours' thresholding of message, and the title thresholding of the data directory list item, fragment ID and life cycle thresholding respectively equal to should
Title thresholding, fragment ID and the life cycle thresholding of data table items；
Step 305：Terminate；
If the life cycle of a data table items decays to 0, the data table items are deleted；If a data directory
The life cycle of item decays to 0, then deletes the data directory list item.
Real-time update neighbours application form and data directory, user node pass through neighbours to data server by the above process
Application form can fast implement the polymerization of data application, can be obtained quickly through neighbor data router by data directory
Data are to reduce data communication delays and cost.
In the method for the invention, data D1 is divided into N1 fragment s by title NA1 unique marksj1, j1 values 1~
N1, each fragment are identified by fragment ID j1；
User node U1 is connected with data router R1 links, if all data routers are all without preserving number in network
According to D1, such as when network just starts, user node U1 then passes through following processes and obtains data D1：
Step 401：Start；
Step 402：A variable k is arranged in user node U1, and the initial value of variable k is 1；
Step 403：User node U1 sends solicitation message, and the type of message of solicitation message is 4, entitled NA1, fragment ID
For k, next-hop is the hardware address of data router R1, and previous dive is the hardware address of user node U1；
Step 404：Variable k is incremented by 1 by user node U1, and whether judgment variable k is more than N1, thens follow the steps 405, otherwise
Execute step 403；
Step 405：Judge whether that data server receives this application message and is capable of providing this application message name institute
The data of mark are to then follow the steps 414, no to then follow the steps 406；
Step 406：If user node receives solicitation message, 415 are thened follow the steps, it is no to then follow the steps 407；
Step 407：The data router for receiving this application message judges whether the hardware address of oneself is equal to this application
The next-hop thresholding of message thens follow the steps 408 if be equal to, no to then follow the steps 415；
Step 408：The data router for receiving this application message checks application form, judges whether an application form
, the title and fragment ID of this application list item are respectively equal to the title of this application message and fragment ID and next-hop thresholding be equal to should
The previous dive thresholding of solicitation message is to then follow the steps 415, no to then follow the steps 409；
Step 409：The data router for receiving this application message checks application form, judges whether an application form
, the title and fragment ID of this application list item are respectively equal to the title and fragment ID of this application message, are to then follow the steps 410,
It is no to then follow the steps 411；
Step 410：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value executes step 415；
Step 411：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value；The data router checks neighbours' application form, judges whether that a neighbours apply for that list item, the neighbours apply for the name of list item
Claim and fragment ID is respectively equal to the title and fragment ID of this application message, is to then follow the steps 412, it is no to then follow the steps 413；
Step 412：The data router for receiving this application message checks neighbours' application form, selects neighbours' application form
, which applies for that the title of list item and fragment ID are respectively equal to the title and fragment ID of this application message, the data router
The next-hop thresholding of this application message is then updated to neighbours' thresholding that the neighbours apply for list item, by the previous dive of this application message
Thresholding is updated to the hardware address of oneself, forwards this application message, executes step 405；
Step 413：The data router for receiving this application message checks that table name is equal to title thresholding in this application message
Routing table, the sequence number r1 of the corresponding route table items of next-hop is calculated using formula (1), sequence number is selected from the routing table
For the route table items of r1, the next-hop thresholding of this application message is updated to the next-hop thresholding of the route table items, by this application
The previous dive thresholding of message is updated to the hardware address of oneself, forwards this application message, executes step 405；
Step 414：The data server for receiving solicitation message checks tables of data, selects a data table items, the data
The title and fragment ID of list item are respectively equal to the title and fragment ID of this application message, transmission data message, the data-message
Type of message is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, and next-hop is equal to this application message
Previous dive, fragment thresholding is equal to the data table items chosen；
Step 415：Judge whether that user node receives data-message, is to then follow the steps 419, it is no to then follow the steps
416；
Step 416：Judge whether that data server receives data-message, is to then follow the steps 421, it is no to then follow the steps
417；
Step 417：The data router for receiving data-message judges whether the hardware address of oneself disappears equal to the data
The next-hop thresholding of breath, it is no to then follow the steps 421 if it is thening follow the steps 418；
Step 418：Receive data-message data router create a data table items, the title of the data table items,
Fragment ID, fragment thresholding and life cycle are respectively equal to the title of data table items, fragment ID, fragment in data-message load
Thresholding and life cycle；The data router checks application form, and all title thresholdings and fragment ID thresholdings is selected to be respectively equal to
The title of the data-message and the application list item of fragment ID, for each application list item chosen, which will be next
The next-hop thresholding for being updated to this application list item is jumped, the data-message is forwarded, executes step 415；
Step 419：The user node for receiving data-message judges whether the hardware address of oneself is equal to the data-message
Next-hop thresholding, it is no to then follow the steps 421 if it is thening follow the steps 420；
Step 420：Data table items in data-message load are added to certainly by the user node for receiving data-message
In oneself tables of data；All N1 fragments for judging whether to contain data D1 in user's list item of the user node, are to hold
Row step 421, it is no to then follow the steps 415；
Step 421：Terminate.
User node obtains data by the above process；The above process realizes the polymerization of data application by application form, this
Sample, user node can obtain data by intermediate data router, and multiple user nodes pass through a data communication process energy
It is enough to obtain required data, to which data communication delays and cost be greatly lowered；The above process applies for that list item can by neighbours
The polymerization for fast implementing data application, to further decrease data communication delays and cost；In addition, the above process utilizes formula
(1) selection route table items are to realize the load balancing of load balancing and network traffic between data server；
In data return course, data router by tables of data preserve response data so as to provide data for user node, this
Sample user node can obtain data to reduce data communication delays and cost by intermediate data router；What data returned
Routed path is automatically performed without route establishment process by application form, therefore reduces data communication delays and cost.
In the method for the invention, data D1 is divided into N1 fragment s by title NA1 unique marksj1, j1 values 1~
N1, each fragment are identified by fragment ID j1；
User node U1 is connected with data router R1 links, if partial data router saves data in network
D1, then user node U1 pass through following processes and obtain data D1：
Step 501：Start；
Step 502：A variable k is arranged in user node U1, and the initial value of variable k is 1；
Step 503：User node U1 sends solicitation message, and the type of message of solicitation message is 4, entitled NA1, fragment ID
For k, next-hop is the hardware address of data router R1, and previous dive is the hardware address of user node U1；
Step 504：Variable k is incremented by 1 by user node U1；Whether judgment variable k is more than N1, is to then follow the steps 505, no
Then follow the steps 503；
Step 505：Judge whether that data server receives this application message and is capable of providing this application message name institute
The data of mark are to then follow the steps 518, no to then follow the steps 506；
Step 506：Judge whether that user node receives solicitation message, is to then follow the steps 519, it is no to then follow the steps
507；
Step 507：The data router for receiving this application message judges whether the hardware address of oneself is equal to this application
The next-hop thresholding of message is to then follow the steps 508, no to then follow the steps 519；
Step 508：The data router for receiving this application message checks the tables of data of oneself, if there is a data
List item, the title and fragment ID of the data table items are respectively equal to the title and fragment ID of this application message, then follow the steps 509,
It is no to then follow the steps 510；
Step 509：The data router for receiving solicitation message checks tables of data, selects a data table items, the data
The title and fragment ID of list item are respectively equal to the title and fragment ID of this application message, transmission data message, the data-message
Type of message is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, and next-hop is equal to this application message
Previous dive, fragment thresholding is equal to the data table items chosen, executes step 519；
Step 510：The data router for receiving this application message checks application form, applies for list item if there is one,
The title and fragment ID of this application list item are respectively equal to the title of this application message and fragment ID and next-hop thresholding are equal to the Shen
Please message previous dive thresholding, then follow the steps 519, it is no to then follow the steps 511；
Step 511：The data router for receiving this application message checks application form, applies for list item if there is one,
The title and fragment ID of this application list item are respectively equal to the title and fragment ID of this application message, then follow the steps 512, otherwise hold
Row step 513；
Step 512：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value executes step 519；
Step 513：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value；The data router checks data directory, if there is a data directory item, the title of the data directory list item and
Fragment ID is respectively equal to the title and fragment ID of this application message, thens follow the steps 514, no to then follow the steps 515；
Step 514：The data router for receiving this application message checks data directory, selects a data directory
, the title and fragment ID of the data directory list item are respectively equal to the title and fragment ID of this application message, by this application message
Next-hop thresholding be updated to neighbours' thresholding of the data directory list item, the previous dive thresholding of this application message is updated to oneself
Hardware address, forward this application message, execute step 505；
Step 515：The data router for receiving this application message checks neighbours' application form, if there is a neighbours Shen
Please list item, which applies for the title of list item and fragment ID is respectively equal to the title and fragment ID of this application message, then executes step
Rapid 516, it is no to then follow the steps 517；
Step 516：The data router for receiving this application message checks neighbours' application form, selects neighbours' application form
, which applies for that the title of list item and fragment ID are respectively equal to the title and fragment ID of this application message, the data router
The next-hop thresholding of this application message is updated to neighbours' thresholding that the neighbours apply for list item, by the previous hop domain of this application message
Value is updated to the hardware address of oneself, forwards this application message, executes step 505；
Step 517：The data router for receiving this application message checks that table name is equal to title thresholding in this application message
Routing table, the sequence number r1 of the corresponding route table items of next-hop is calculated using formula (1), sequence number is selected from the routing table
For the route table items of r1, the next-hop thresholding of this application message is updated to the next-hop thresholding of the route table items, by this application
The previous dive thresholding of message is updated to the hardware address of oneself, forwards this application message, executes step 505；
Step 518：The data server for receiving solicitation message checks tables of data, selects a data table items, the data
The title and fragment ID of list item are respectively equal to the title and fragment ID of this application message, transmission data message, the data-message
Type of message is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, and next-hop is equal to this application message
Previous dive, fragment thresholding is equal to the data table items chosen；
Step 519：Judge whether that user node receives data-message, is to then follow the steps 523, it is no to then follow the steps
520；
Step 520：Judge whether that data server receives data-message, is to then follow the steps 525, it is no to then follow the steps
521；
Step 521：The data router for receiving data-message judges whether the hardware address of oneself disappears equal to the data
The next-hop thresholding of breath is to then follow the steps 522, no to then follow the steps 525；
Step 522：Receive data-message data router create a data table items, the title of the data table items,
Fragment ID, fragment thresholding and life cycle are respectively equal to the title of data table items, fragment ID, fragment in data-message load
Thresholding and life cycle；The data router checks application form, and all title thresholdings and fragment ID thresholdings is selected to be respectively equal to
The title of the data-message and the application list item of fragment ID, for each application list item chosen, which will be next
The next-hop thresholding for being updated to this application list item is jumped, the data-message is forwarded, executes step 519；
Step 523：The user node for receiving data-message judges whether the hardware address of oneself is equal to the data-message
Next-hop thresholding, be to then follow the steps 524, it is no to then follow the steps 525；
Step 524：Data table items in data-message load are added to certainly by the user node for receiving data-message
In oneself tables of data；If containing all N1 fragments of data D1 in user's list item of the user node, then follow the steps
525, it is no to then follow the steps 519；
Step 525：Terminate.
User node obtains data to reduce data communication delays and generation from intermediate data router by the above process
Valence；Data router preserves data so as to provide data for user node by tables of data, and such user node can lead to
It crosses and obtains data apart from nearest data router to reduce data communication delays and cost；The above process passes through data directory
Table can be quickly from neighbor data router quick obtaining data, to further decrease data communication delays and cost；Meanwhile
The polymerization of data application is fast implemented by neighbours' application form and application form, such user node is total by intermediate data router
Data are enjoyed, multiple user nodes can obtain required data by a data communication process, logical to which data be greatly lowered
Letter delay and cost；In addition, the above process realizes bearing between data server using formula (1) selection route table items
Carry balanced and network traffic load balancing；In data return course, data router is preserved by tables of data and is responded
Data so as to provide data for user node, such user node can be obtained by intermediate data router data to
Reduce data communication delays and cost；The routed path that data return is automatically performed without route establishment process by application form,
Therefore data communication delays and cost are reduced.
Advantageous effect：The present invention provides a kind of data-centered next generation network implementation method, user node is logical
Cross data-centered next generation network implementation method provided by the invention can quick obtaining data, it is logical to reduce data
Letter delay and cost, improve service quality.Present invention can apply to the numerous areas such as agricultural engineerization, intelligent medical, have wide
General application prospect.
Description of the drawings
The present invention is done with reference to the accompanying drawings and detailed description and is further illustrated, of the invention is above-mentioned
And/or otherwise advantage will become apparent.
Fig. 1 is publication data flow diagram of the present invention.
Fig. 2 is routing table update flow diagram of the present invention.
Fig. 3 is update flow diagram of the present invention.
Fig. 4 is acquisition data flow diagram of the present invention.
Fig. 5 is data communication flow journey schematic diagram of the present invention.
Specific implementation mode：
The present invention provides a kind of data-centered next generation network implementation method, user node carries through the invention
Supply data-centered next generation network implementation method can quick obtaining data, to reduce data communication delays and generation
Valence is improved service quality.Present invention can apply to the numerous areas such as agricultural engineerization, intelligent medical, before having a wide range of applications
Scape.
Fig. 1 is publication data flow diagram of the present invention.The network includes data server, data router
And user node；Data server and user node are connected with a data router link respectively；
A type of data are by title unique mark and are divided into N number of fragment, and N is the positive integer more than 1, each fragment
By fragment ID j unique marks, 1~N of j values；Data server can generate, preserve and provide a type of data, a type
The data of type can be generated by multiple data servers；One user node can obtain a type of data；Data are route
Device can preserve and provide a type of data；
For each type of data, data router safeguards that a routing table, the table name of the routing table are to identify this kind
The title of categorical data；
One route table items includes sequence number, next-hop, source server and distance domain；
Data server by new data message publication generate data, new data message include type of message, title, under
One jump, source server and distance domain；
One data server, user node and data router respectively safeguard a tables of data, each data table items
Including title-domain, the domains fragment ID, fragment domain and life cycle domain；
Data D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each data fragmentation is by dividing
Piece ID j1 marks；After data server S1 generates data D1, following process publication data are executed：
Step 101：Start；
Step 102：A variable k is arranged in data server S1, and the initial value of variable k is 1；
Step 103：Data server S1 creates a data table items, and the title-domain of the data table items is NA1, the domains fragment ID
Value is k, and fragment thresholding is sk, life cycle thresholding is to pre-set value；
Step 104：Variable k is incremented by 1 by data server S1, if variable k is more than N1, is thened follow the steps 105, is otherwise held
Row step 103；
Step 105：Data server S1 sends new data message, and the type of message of the new data message is 1, entitled
NA1, next-hop and source server thresholding are the hardware address of oneself, are 1 apart from thresholding；
Step 106：If user node or data server receive the new data message, 112 are thened follow the steps, it is no
Then follow the steps 107；
Step 107：The data router for receiving new data message judges oneself whether preserve a routing table, the routing
The table name of table is equal to the title of the new data message, if so, being then not necessarily to create routing table, if it is not, creating a road
By table, the table name of the routing table is equal to the title of the new data message；The data router checks that table name disappears equal to the new data
The routing table of title thresholding in breath, if there is a route table items, the next-hop and source server thresholding point of the route table items
Not Deng Yu the new data message next-hop and source server thresholding, then follow the steps 109, it is no to then follow the steps 108；
Step 108：The data router for receiving new data message checks that table name is equal to the road of the new data message title
By table, which calculates the route table items sum x of the routing table, creates a route table items, the sequence of the route table items
Row number is x+1, next-hop, source server and apart from thresholding be respectively equal to next-hop, the source server of the new data message with
And apart from thresholding, execute step 111；
Step 109：The data router for receiving new data message checks that table name is equal to the road of the new data message title
By table, a route table items are selected, the next-hop and source server thresholding of the route table items are respectively equal to the new data message
Next-hop and source server thresholding judge the distance domain of the route table items whether being more than apart from thresholding in the new data message
Value, if so, 110 are thened follow the steps, it is no to then follow the steps 112；
Step 110：The data router for receiving new data message checks that table name is equal to the road of the new data message title
By table, a route table items are selected, the next-hop and source server thresholding of the route table items are respectively equal to the new data message
Next-hop and source server thresholding, by the route table items apart from thresholding be updated in the new data message apart from thresholding；
Step 111；The new data message is incremented by 1 by the data router for receiving new data message apart from thresholding, will
Next-hop thresholding in the new data message is updated to the hardware address of oneself, forwards the new data message, executes step 103；
Step 112：Terminate.
Fig. 2 is routing table update flow diagram of the present invention.If data server deletes the data of generation,
Then routing table is updated using message is deleted；It includes type of message, title and source server to delete message；
Data D1 is by title NA1 unique marks, and data server S1 creates and issued data D1, if data server
S1 prepares to delete data D1, then executes operations described below：
Step 201：Start；
Step 202：Data server S1 checks tables of data, and all title thresholdings is selected to be equal to the data table items of title NA1,
The data table items chosen described in deletion；Data server S1, which is sent, deletes message, and the type of message of the deletion message is 2, title
Thresholding is NA1, and source server is the hardware address of data server S1；
Step 203：If user node or data server receive the deletion message, 204 are thened follow the steps, otherwise
Execute step 205；
Step 204：It receives the user node of the deletion message or data server abandons the deletion message, execute step
Rapid 207；
Step 205：It receives and deletes the routing table that the data router of message checks table name equal to the deletion message name,
If at least there are a route table items, the source server thresholding of the route table items is equal to the source server domain of the deletion message
Value, thens follow the steps 206, no to then follow the steps 207；
Step 206：It receives and deletes the routing table that the data router of message checks table name equal to the deletion message name,
It selects all source server thresholdings to be equal to the route table items of the source server thresholding of the deletion message, deletes the routing table chosen
?；The data router forwards the deletion message, executes step 203；
Step 207：Terminate.
Fig. 3 is update flow diagram of the present invention.User node by send solicitation message and data-message come
Obtain a type of data；
Solicitation message includes type of message, title, fragment ID, next-hop and previous hop domain；
Data-message includes type of message, title, fragment ID, next-hop and fragment domain；
Data D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each data fragmentation is by dividing
Piece ID j1 marks；
If data router receives a solicitation message, the entitled NA1 of this application message, fragment ID are y, and table
The route table items sum of the routing table of entitled title NA1 is t1, then the data router calculates next-hop data using formula (1)
Route table items sequence number r1 corresponding to router；
Each data router safeguards an application form, each to apply for that list item includes title-domain, the domains fragment ID and next-hop
Domain；
Each data router safeguards neighbours' application form and a data directory；One neighbour applies for that list item includes
Title-domain, the domains fragment ID, next hop domain and neighbouring domain；One data directory item include title-domain, the domains fragment ID, neighbouring domain and
Life cycle domain；
One data router periodically sends informational message in a jump range, and informational message includes type of message, neighbours
Domain and load domain, wherein load thresholding is the application form and tables of data of the data router；
Data router CR1 periodically sends informational message, and the value of message types of the informational message is 3, and neighbours' thresholding is certainly
Oneself hardware address, load thresholding are the application form and tables of data of oneself；
Data router CR2 is the neighbor data router of data router CR1, and data router CR2 receives data
After the informational message that router CR1 is sent, operations described below is executed：
Step 301：Start；
Step 302：After data router CR2 receives the informational message that data router CR1 is sent, check that the information disappears
Application form in breath load, for each of informational message load application list item, data router CR2 checks the neighbour of oneself
Application form is occupied, judges whether that a neighbours apply for that list item, the neighbours apply for that neighbours' thresholding of list item is equal to the informational message
Neighbours' thresholding, and the neighbours apply list item title thresholding, fragment ID and next-hop thresholding be respectively equal to this application table
Title thresholding, fragment ID and the next-hop thresholding of item, if it does not, data router CR2 then creates neighbours' application
List item, which applies for that neighbours' thresholding of list item is equal to neighbours' thresholding of the informational message, and the neighbours apply for the name of list item
Thresholding, fragment ID and next-hop thresholding is claimed to be respectively equal to title thresholding, fragment ID and the next-hop thresholding of this application list item；
If it is present without executing any operation；
Step 303：The data router CR2 for receiving informational message checks the neighbours' application form of oneself, selects all neighbours
The neighbours that thresholding is occupied equal to informational message neighbours' thresholding apply for list item, apply for list item, data road for each neighbours chosen
The application form in the informational message load received is checked by device CR2, judges to apply for list item with the presence or absence of one in this application table,
The title thresholding of this application list item, fragment ID and next-hop thresholding are respectively equal to the neighbours and apply for the title thresholding of list item, divide
Piece ID and next-hop thresholding, if it does not, data router CR2, which then deletes the neighbours, applies for list item；If it is present nothing
Any operation need to be executed；
Step 304：Receive informational message data router CR2 check the informational message load in tables of data, needle
Each data table items in being loaded to the informational message, data router CR2 check the data directory of oneself, judge whether to deposit
In a data directory item, neighbours' thresholding of the data directory list item is equal to neighbours' thresholding of the informational message, and the number
It is respectively equal to the title thresholding and fragment ID of the data table items according to the title thresholding and fragment ID of index list item, if it does, number
Then the life cycle thresholding of the data directory list item is set to according to router CR2 the life cycle thresholding of the data table items；Such as
Fruit is not present, and data router CR2 creates a data directory item, and neighbours' thresholding of the data directory list item is equal to the information
Neighbours' thresholding of message, and the title thresholding of the data directory list item, fragment ID and life cycle thresholding respectively equal to should
Title thresholding, fragment ID and the life cycle thresholding of data table items；
Step 305：Terminate；
If the life cycle of a data table items decays to 0, the data table items are deleted；If a data directory
The life cycle of item decays to 0, then deletes the data directory list item.
Fig. 4 is acquisition data flow diagram of the present invention.Data D1 is divided into N1 by title NA1 unique marks
A fragment sj1, 1~N1 of j1 values, each fragment is by fragment ID j1 marks；
User node U1 is connected with data router R1 links, if all data routers are all without preserving number in network
According to D1, user node U1 then obtains data D1 by following processes：
Step 401：Start；
Step 402：A variable k is arranged in user node U1, and the initial value of variable k is 1；
Step 403：User node U1 sends solicitation message, and the type of message of solicitation message is 4, entitled NA1, fragment ID
For k, next-hop is the hardware address of data router R1, and previous dive is the hardware address of user node U1；
Step 404：Variable k is incremented by 1 by user node U1, and whether judgment variable k is more than N1, thens follow the steps 405, otherwise
Execute step 403；
Step 405：Judge whether that data server receives this application message and is capable of providing this application message name institute
The data of mark are to then follow the steps 414, no to then follow the steps 406；
Step 406：If user node receives solicitation message, 415 are thened follow the steps, it is no to then follow the steps 407；
Step 407：The data router for receiving this application message judges whether the hardware address of oneself is equal to this application
The next-hop thresholding of message thens follow the steps 408 if be equal to, no to then follow the steps 415；
Step 408：The data router for receiving this application message checks application form, judges whether an application form
, the title and fragment ID of this application list item are respectively equal to the title of this application message and fragment ID and next-hop thresholding be equal to should
The previous dive thresholding of solicitation message is to then follow the steps 415, no to then follow the steps 409；
Step 409：The data router for receiving this application message checks application form, judges whether an application form
, the title and fragment ID of this application list item are respectively equal to the title and fragment ID of this application message, are to then follow the steps 410,
It is no to then follow the steps 411；
Step 410：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value executes step 415；
Step 411：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value；The data router checks neighbours' application form, judges whether that a neighbours apply for that list item, the neighbours apply for the name of list item
Claim and fragment ID is respectively equal to the title and fragment ID of this application message, is to then follow the steps 412, it is no to then follow the steps 413；
Step 412：The data router for receiving this application message checks neighbours' application form, selects neighbours' application form
, which applies for that the title of list item and fragment ID are respectively equal to the title and fragment ID of this application message, the data router
The next-hop thresholding of this application message is then updated to neighbours' thresholding that the neighbours apply for list item, by the previous dive of this application message
Thresholding is updated to the hardware address of oneself, forwards this application message, executes step 405；
Step 413：The data router for receiving this application message checks that table name is equal to title thresholding in this application message
Routing table, the sequence number r1 of the corresponding route table items of next-hop is calculated using formula (1), sequence number is selected from the routing table
For the route table items of r1, the next-hop thresholding of this application message is updated to the next-hop thresholding of the route table items, by this application
The previous dive thresholding of message is updated to the hardware address of oneself, forwards this application message, executes step 405；
Step 414：The data server for receiving solicitation message checks tables of data, selects a data table items, the data
The title and fragment ID of list item are respectively equal to the title and fragment ID of this application message, transmission data message, the data-message
Type of message is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, and next-hop is equal to this application message
Previous dive, fragment thresholding is equal to the data table items chosen；
Step 415：Judge whether that user node receives data-message, is to then follow the steps 419, it is no to then follow the steps
416；
Step 416：Judge whether that data server receives data-message, is to then follow the steps 421, it is no to then follow the steps
417；
Step 417：The data router for receiving data-message judges whether the hardware address of oneself disappears equal to the data
The next-hop thresholding of breath, it is no to then follow the steps 421 if it is thening follow the steps 418；
Step 418：Receive data-message data router create a data table items, the title of the data table items,
Fragment ID, fragment thresholding and life cycle are respectively equal to the title of data table items, fragment ID, fragment in data-message load
Thresholding and life cycle；The data router checks application form, and all title thresholdings and fragment ID thresholdings is selected to be respectively equal to
The title of the data-message and the application list item of fragment ID, for each application list item chosen, which will be next
The next-hop thresholding for being updated to this application list item is jumped, the data-message is forwarded, executes step 415；
Step 419：The user node for receiving data-message judges whether the hardware address of oneself is equal to the data-message
Next-hop thresholding, it is no to then follow the steps 421 if it is thening follow the steps 420；
Step 420：Data table items in data-message load are added to certainly by the user node for receiving data-message
In oneself tables of data；All N1 fragments for judging whether to contain data D1 in user's list item of the user node, are to hold
Row step 421, it is no to then follow the steps 415；
Step 421：Terminate.
Fig. 5 is data communication flow journey schematic diagram of the present invention.Data D1 is divided into N1 by title NA1 unique marks
A fragment sj1, 1~N1 of j1 values, each fragment is by fragment ID j1 marks；
User node U1 is connected with data router R1 links, if partial data router saves data in network
D1, then user node U1 pass through following processes and obtain data D1：
Step 501：Start；
Step 502：A variable k is arranged in user node U1, and the initial value of variable k is 1；
Step 503：User node U1 sends solicitation message, and the type of message of solicitation message is 4, entitled NA1, fragment ID
For k, next-hop is the hardware address of data router R1, and previous dive is the hardware address of user node U1；
Step 504：Variable k is incremented by 1 by user node U1；Whether judgment variable k is more than N1, is to then follow the steps 505, no
Then follow the steps 503；
Step 505：Judge whether that data server receives this application message and is capable of providing this application message name institute
The data of mark are to then follow the steps 518, no to then follow the steps 506；
Step 506：Judge whether that user node receives solicitation message, is to then follow the steps 519, it is no to then follow the steps
507；
Step 507：The data router for receiving this application message judges whether the hardware address of oneself is equal to this application
The next-hop thresholding of message is to then follow the steps 508, no to then follow the steps 519；
Step 508：The data router for receiving this application message checks the tables of data of oneself, if there is a data
List item, the title and fragment ID of the data table items are respectively equal to the title and fragment ID of this application message, then follow the steps 509,
It is no to then follow the steps 510；
Step 509：The data router for receiving solicitation message checks tables of data, selects a data table items, the data
The title and fragment ID of list item are respectively equal to the title and fragment ID of this application message, transmission data message, the data-message
Type of message is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, and next-hop is equal to this application message
Previous dive, fragment thresholding is equal to the data table items chosen, executes step 519；
Step 510：The data router for receiving this application message checks application form, applies for list item if there is one,
The title and fragment ID of this application list item are respectively equal to the title of this application message and fragment ID and next-hop thresholding are equal to the Shen
Please message previous dive thresholding, then follow the steps 519, it is no to then follow the steps 511；
Step 511：The data router for receiving this application message checks application form, applies for list item if there is one,
The title and fragment ID of this application list item are respectively equal to the title and fragment ID of this application message, then follow the steps 512, otherwise hold
Row step 513；
Step 512：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value executes step 519；
Step 513：The data router for receiving this application message creates an application list item, the title of this application list item
It is respectively equal to the title of this application message with fragment ID and fragment ID and next-hop thresholding is equal to the previous hop domain of this application message
Value；The data router checks data directory, if there is a data directory item, the title of the data directory list item and
Fragment ID is respectively equal to the title and fragment ID of this application message, thens follow the steps 514, no to then follow the steps 515；
Step 514：The data router for receiving this application message checks data directory, selects a data directory
, the title and fragment ID of the data directory list item are respectively equal to the title and fragment ID of this application message, by this application message
Next-hop thresholding be updated to neighbours' thresholding of the data directory list item, the previous dive thresholding of this application message is updated to oneself
Hardware address, forward this application message, execute step 505；
Step 515：The data router for receiving this application message checks neighbours' application form, if there is a neighbours Shen
Please list item, which applies for the title of list item and fragment ID is respectively equal to the title and fragment ID of this application message, then executes step
Rapid 516, it is no to then follow the steps 517；
Step 516：The data router for receiving this application message checks neighbours' application form, selects neighbours' application form
, which applies for that the title of list item and fragment ID are respectively equal to the title and fragment ID of this application message, the data router
The next-hop thresholding of this application message is updated to neighbours' thresholding that the neighbours apply for list item, by the previous hop domain of this application message
Value is updated to the hardware address of oneself, forwards this application message, executes step 505；
Step 517：The data router for receiving this application message checks that table name is equal to title thresholding in this application message
Routing table, the sequence number r1 of the corresponding route table items of next-hop is calculated using formula (1), sequence number is selected from the routing table
For the route table items of r1, the next-hop thresholding of this application message is updated to the next-hop thresholding of the route table items, by this application
The previous dive thresholding of message is updated to the hardware address of oneself, forwards this application message, executes step 505；
Step 518：The data server for receiving solicitation message checks tables of data, selects a data table items, the data
The title and fragment ID of list item are respectively equal to the title and fragment ID of this application message, transmission data message, the data-message
Type of message is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, and next-hop is equal to this application message
Previous dive, fragment thresholding is equal to the data table items chosen；
Step 519：Judge whether that user node receives data-message, is to then follow the steps 523, it is no to then follow the steps
520；
Step 520：Judge whether that data server receives data-message, is to then follow the steps 525, it is no to then follow the steps
521；
Step 521：The data router for receiving data-message judges whether the hardware address of oneself disappears equal to the data
The next-hop thresholding of breath is to then follow the steps 522, no to then follow the steps 525；
Step 522：Receive data-message data router create a data table items, the title of the data table items,
Fragment ID, fragment thresholding and life cycle are respectively equal to the title of data table items, fragment ID, fragment in data-message load
Thresholding and life cycle；The data router checks application form, and all title thresholdings and fragment ID thresholdings is selected to be respectively equal to
The title of the data-message and the application list item of fragment ID, for each application list item chosen, which will be next
The next-hop thresholding for being updated to this application list item is jumped, the data-message is forwarded, executes step 519；
Step 523：The user node for receiving data-message judges whether the hardware address of oneself is equal to the data-message
Next-hop thresholding, be to then follow the steps 524, it is no to then follow the steps 525；
Step 524：Data table items in data-message load are added to certainly by the user node for receiving data-message
In oneself tables of data；If containing all N1 fragments of data D1 in user's list item of the user node, then follow the steps
525, it is no to then follow the steps 519；
Step 525：Terminate.
Embodiment 1
Based on the simulation parameter of table 1, the present embodiment simulates a kind of data-centered next generation network in the present invention
After data server generates data, data issuing process is executed to establish routing by executing step 101-112 for network implementation method
Table updates routing table, data router is by holding if data server deletes data by executing step 201-207
Row step 301-305 more new neighbor application form and data directory, at network startup initial stage, user node is by executing step
401-421 obtains data, and in the network operation middle and later periods, user node obtains data, performance evaluation by executing step 501-525
It is as follows：When the speed of movement increases, network performance declines, and data acquisition delay increased, when movement speed reduces, network
Performance improves, and data acquisition delay is declined, and the average retardation of data acquisition is 3.76s.
1 simulation parameter of table
The present invention provides a kind of thinkings of data-centered next generation network implementation method, implement the technology
There are many method and approach of scheme, the above is only a preferred embodiment of the present invention, it is noted that for the art
Those of ordinary skill for, various improvements and modifications may be made without departing from the principle of the present invention, these change
Protection scope of the present invention is also should be regarded as into retouching.The available prior art of each component part being not known in the present embodiment adds
To realize.
Claims (5)
1. a kind of data-centered next generation network implementation method, which is characterized in that the network include data server,
Data router and user node；Data server and user node are connected with a data router link respectively；
A type of data are by title unique mark and are divided into N number of fragment, and N is the positive integer more than 1, and each fragment is by dividing
Piece ID j unique marks, 1~N of j values；Data server can generate, preserve and provide a type of data, a type of
Data can be generated by multiple data servers；One user node can obtain a type of data；Data router energy
Preserve and provide a type of data；
For each type of data, data router safeguards a routing table, and the table name of the routing table is mark this type
The title of data；
One route table items includes sequence number, next-hop, source server and distance domain；
The data that data server is generated by new data message publication, new data message includes type of message, title, next
Jump, source server and distance domain；
One data server, user node and data router respectively safeguard that a tables of data, each data table items include
Title-domain, the domains fragment ID, fragment domain and life cycle domain；
Data D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each data fragmentation is by fragment ID
J1 is identified；After data server S1 generates data D1, following process publication data are executed：
Step 101：Start；
Step 102：A variable k is arranged in data server S1, and the initial value of variable k is 1；
Step 103：Data server S1 creates a data table items, and the title-domain of the data table items is NA1, and fragment ID thresholdings are
K, fragment thresholding are sk, life cycle thresholding is to pre-set value；
Step 104：Variable k is incremented by 1 by data server S1, if variable k is more than N1, is thened follow the steps 105, is otherwise executed step
Rapid 103；
Step 105：Data server S1 sends new data message, and the type of message of the new data message is 1, entitled NA1, under
One jump and source server thresholding are the hardware address of oneself, are 1 apart from thresholding；
Step 106：If user node or data server receive the new data message, 112 are thened follow the steps, is otherwise held
Row step 107；
Step 107：The data router for receiving new data message judges oneself whether preserve a routing table, the routing table
Table name is equal to the title of the new data message, if so, be then not necessarily to create routing table, if it is not, a routing table is created,
The table name of the routing table is equal to the title of the new data message；The data router checks that table name is equal to name in the new data message
Claim the routing table of thresholding, if there is a route table items, the next-hop and source server thresholding of the route table items are respectively equal to
The next-hop and source server thresholding of the new data message, then follow the steps 109, no to then follow the steps 108；
Step 108：The data router for receiving new data message checks that table name is equal to the routing table of the new data message title,
The data router calculates the route table items sum x of the routing table, creates a route table items, the Serial No. of the route table items
X+1, next-hop, source server and the next-hop, source server and the distance that are respectively equal to the new data message apart from thresholding
Thresholding executes step 111；
Step 109：The data router for receiving new data message checks that table name is equal to the routing table of the new data message title,
A route table items are selected, the next-hop and source server thresholding of the route table items are respectively equal to the next-hop of the new data message
With source server thresholding, judge the route table items apart from thresholding whether be more than the new data message in apart from thresholding, if
It is to then follow the steps 110, it is no to then follow the steps 112；
Step 110：The data router for receiving new data message checks that table name is equal to the routing table of the new data message title,
A route table items are selected, the next-hop and source server thresholding of the route table items are respectively equal to the next-hop of the new data message
With source server thresholding, by the route table items apart from thresholding be updated in the new data message apart from thresholding；
Step 111；The new data message is incremented by 1 by the data router for receiving new data message apart from thresholding, this is new
Next-hop thresholding in data-message is updated to the hardware address of oneself, forwards the new data message, executes step 103；
Step 112：Terminate.
2. a kind of data-centered next generation network implementation method according to claim 1, which is characterized in that if
Data server deletes the data of generation, then updates routing table using message is deleted；It includes type of message, name to delete message
Title and source server；
For data D1 by title NA1 unique marks, data server S1 creates and has issued data D1, if data server S1 is accurate
It is standby to delete data D1, then execute operations described below：
Step 201：Start；
Step 202：Data server S1 checks tables of data, and all title thresholdings is selected to be equal to the data table items of title NA1, deletes
The data table items chosen；Data server S1, which is sent, deletes message, and the type of message of the deletion message is 2, title thresholding
For NA1, source server is the hardware address of data server S1；
Step 203：If user node or data server receive the deletion message, 204 are thened follow the steps, is otherwise executed
Step 205；
Step 204：It receives the user node of the deletion message or data server abandons the deletion message, execute step
207；
Step 205：It receives and deletes the routing table that the data router of message checks table name equal to the deletion message name, if
At least there are a route table items, the source server thresholding of the route table items is equal to the source server thresholding of the deletion message, then
Step 206 is executed, it is no to then follow the steps 207；
Step 206：It receives and deletes the routing table that the data router of message checks table name equal to the deletion message name, selection
All source server thresholdings are equal to the route table items of the source server thresholding of the deletion message, delete the route table items chosen；It should
Data router forwards the deletion message, executes step 203；
Step 207：Terminate.
3. a kind of data-centered next generation network implementation method according to claim 1, which is characterized in that user
Node obtains a type of data by sending solicitation message and data-message；
Solicitation message includes type of message, title, fragment ID, next-hop and previous hop domain；
Data-message includes type of message, title, fragment ID, next-hop and fragment domain；
Data D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each data fragmentation is by fragment ID
J1 is identified；
If data router receives a solicitation message, the entitled NA1 of this application message, fragment ID are y, and table name is
The route table items sum of the routing table of title NA1 is t1, then the data router calculates next-hop data using formula (1) and route
Route table items sequence number r1 corresponding to device；
Each data router safeguards an application form, each to apply for that list item includes title-domain, the domains fragment ID and next hop domain；
Each data router safeguards neighbours' application form and a data directory；One neighbour applies for that list item includes title
Domain, the domains fragment ID, next hop domain and neighbouring domain；One data directory item includes title-domain, the domains fragment ID, neighbouring domain and life
Period region；
One data router periodically sends informational message in a jump range, informational message include type of message, neighbouring domain and
Domain is loaded, wherein load thresholding is the application form and tables of data of the data router；
Data router CR1 periodically sends informational message, and the value of message types of the informational message is 3, and neighbours' thresholding is oneself
Hardware address, load thresholding are the application form and tables of data of oneself；
Data router CR2 is the neighbor data router of data router CR1, and data router CR2 receives data routing
After the informational message that device CR1 is sent, operations described below is executed：
Step 301：Start；
Step 302：After data router CR2 receives the informational message that data router CR1 is sent, check that the informational message is negative
Application form in load, for each of informational message load application list item, data router CR2 checks the neighbours Shen of oneself
Please table, judge whether that neighbour apply for that list item, the neighbours apply for that neighbours' thresholding of list item is equal to the neighbour of the informational message
Thresholding is occupied, and the neighbours apply for that title thresholding, fragment ID and the next-hop thresholding of list item are respectively equal to this application list item
Title thresholding, fragment ID and next-hop thresholding, if it does not, data router CR2, which then creates a neighbours, applies for list item,
The neighbours apply for that neighbours' thresholding of list item is equal to neighbours' thresholding of the informational message, and the neighbours apply for the title-domain of list item
Value, fragment ID and next-hop thresholding are respectively equal to title thresholding, fragment ID and the next-hop thresholding of this application list item；If
In the presence of then without executing any operation；
Step 303：The data router CR2 for receiving informational message checks the neighbours' application form of oneself, selects all neighbouring domain
Value applies for list item equal to the neighbours of informational message neighbours' thresholding, applies for list item, data router for each neighbours chosen
CR2 checks the application form in the informational message load received, judges in this application table with the presence or absence of an application list item, the Shen
Please list item title thresholding, fragment ID and next-hop thresholding are respectively equal to the neighbours and apply for the title thresholding of list item, fragment ID
And next-hop thresholding, if it does not, data router CR2, which then deletes the neighbours, applies for list item；If it is present without holding
Any operation of row；
Step 304：Receive informational message data router CR2 check the informational message load in tables of data, for this
Each data table items in informational message load, data router CR2 check the data directory of oneself, judge whether one
A data directory item, neighbours' thresholding of the data directory list item are equal to neighbours' thresholding of the informational message, and the data rope
Draw the title thresholding of list item and fragment ID is respectively equal to the title thresholding and fragment ID of the data table items, if it does, data road
Then the life cycle thresholding of the data directory list item is set to by device CR2 the life cycle thresholding of the data table items；If no
In the presence of data router CR2 creates a data directory item, and neighbours' thresholding of the data directory list item is equal to the informational message
Neighbours' thresholding, and the title thresholding of the data directory list item, fragment ID and life cycle thresholding are respectively equal to the data
Title thresholding, fragment ID and the life cycle thresholding of list item；
Step 305：Terminate；
If the life cycle of a data table items decays to 0, the data table items are deleted；If data directory item
Life cycle decays to 0, then deletes the data directory list item.
4. a kind of data-centered next generation network implementation method according to claim 3, which is characterized in that data
D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each fragment is by fragment ID j1 marks；
User node U1 is connected with data router R1 links, if all data routers are all without preserving data in network
D1, user node U1 then obtain data D1 by following processes：
Step 401：Start；
Step 402：A variable k is arranged in user node U1, and the initial value of variable k is 1；
Step 403：User node U1 sends solicitation message, and the type of message of solicitation message is 4, and entitled NA1, fragment ID are k,
Next-hop is the hardware address of data router R1, and previous dive is the hardware address of user node U1；
Step 404：Variable k is incremented by 1 by user node U1, and whether judgment variable k is more than N1, thens follow the steps 405, otherwise executes
Step 403；
Step 405：Judge whether that data server receives this application message and is capable of providing this application message name to be identified
Data, be to then follow the steps 414, it is no to then follow the steps 406；
Step 406：If user node receives solicitation message, 415 are thened follow the steps, it is no to then follow the steps 407；
Step 407：The data router for receiving this application message judges whether the hardware address of oneself is equal to this application message
Next-hop thresholding then follow the steps 408 if be equal to, it is no to then follow the steps 415；
Step 408：The data router for receiving this application message checks application form, judges whether an application list item,
The title and fragment ID of this application list item are respectively equal to the title of this application message and fragment ID and next-hop thresholding are equal to the Shen
Please message previous dive thresholding, be to then follow the steps 415, it is no to then follow the steps 409；
Step 409：The data router for receiving this application message checks application form, judges whether an application list item,
The title and fragment ID of this application list item are respectively equal to the title and fragment ID of this application message, are to then follow the steps 410, otherwise
Execute step 411；
Step 410：Receive this application message data router create one application list item, the title of this application list item and point
Piece ID is respectively equal to the title of this application message and fragment ID and next-hop thresholding are equal to the previous dive thresholding of this application message, holds
Row step 415；
Step 411：Receive this application message data router create one application list item, the title of this application list item and point
Piece ID is respectively equal to the title of this application message and fragment ID and next-hop thresholding are equal to the previous dive thresholding of this application message；It should
Data router checks neighbours' application form, judges whether that neighbour apply for list item, the neighbours apply list item title and
Fragment ID is respectively equal to the title and fragment ID of this application message, is to then follow the steps 412, no to then follow the steps 413；
Step 412：The data router for receiving this application message checks neighbours' application form, and a neighbours is selected to apply for list item,
The neighbours apply for that the title of list item and fragment ID are respectively equal to the title and fragment ID of this application message, which then will
The next-hop thresholding of this application message is updated to neighbours' thresholding that the neighbours apply for list item, by the previous dive thresholding of this application message
It is updated to the hardware address of oneself, forwards this application message, executes step 405；
Step 413：The data router for receiving this application message checks that table name is equal to the road of title thresholding in this application message
By table, the sequence number r1 of the corresponding route table items of next-hop is calculated using formula (1), and Serial No. r1 is selected from the routing table
Route table items, the next-hop thresholding of this application message is updated to the next-hop thresholding of the route table items, by this application message
Previous dive thresholding be updated to the hardware address of oneself, forward this application message, execute step 405；
Step 414：The data server for receiving solicitation message checks tables of data, selects a data table items, the data table items
Title and fragment ID be respectively equal to the title and fragment ID of this application message, transmission data message, the message of the data-message
Type is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, before next-hop is equal to this application message
One jumps, and fragment thresholding is equal to the data table items chosen；
Step 415：Judge whether that user node receives data-message, is to then follow the steps 419, it is no to then follow the steps 416；
Step 416：Judge whether that data server receives data-message, is to then follow the steps 421, it is no to then follow the steps 417；
Step 417：The data router for receiving data-message judges whether the hardware address of oneself is equal to the data-message
Next-hop thresholding, it is no to then follow the steps 421 if it is thening follow the steps 418；
Step 418：The data router for receiving data-message creates a data table items, the title of the data table items, fragment
ID, fragment thresholding and life cycle are respectively equal to the title of data table items, fragment ID, fragment thresholding in data-message load
And life cycle；The data router checks application form, and all title thresholdings and fragment ID thresholdings is selected to be respectively equal to the number
According to the title of message and the application list item of fragment ID, for each application list item chosen, the data router by next-hop more
New is the next-hop thresholding of this application list item, forwards the data-message, executes step 415；
Step 419：The user node for receiving data-message judges whether the hardware address of oneself is equal under the data-message
One hop domain value, it is no to then follow the steps 421 if it is thening follow the steps 420；
Step 420：Data table items in data-message load are added to oneself by the user node for receiving data-message
In tables of data；All N1 fragments for judging whether to contain data D1 in user's list item of the user node, are to execute step
Rapid 421, it is no to then follow the steps 415；
Step 421：Terminate.
5. a kind of data-centered next generation network implementation method according to claim 3, which is characterized in that
Data D1 is divided into N1 fragment s by title NA1 unique marksj1, 1~N1 of j1 values, each fragment is by fragment ID j1
Mark；
User node U1 is connected with data router R1 links, if partial data router saves data D1 in network,
User node U1 obtains data D1 by following processes：
Step 501：Start；
Step 502：A variable k is arranged in user node U1, and the initial value of variable k is 1；
Step 503：User node U1 sends solicitation message, and the type of message of solicitation message is 4, and entitled NA1, fragment ID are k,
Next-hop is the hardware address of data router R1, and previous dive is the hardware address of user node U1；
Step 504：Variable k is incremented by 1 by user node U1；Whether judgment variable k is more than N1, is to then follow the steps 505, otherwise holds
Row step 503；
Step 505：Judge whether that data server receives this application message and is capable of providing this application message name to be identified
Data, be to then follow the steps 518, it is no to then follow the steps 506；
Step 506：Judge whether that user node receives solicitation message, is to then follow the steps 519, it is no to then follow the steps 507；
Step 507：The data router for receiving this application message judges whether the hardware address of oneself is equal to this application message
Next-hop thresholding, be to then follow the steps 508, it is no to then follow the steps 519；
Step 508：The data router for receiving this application message checks the tables of data of oneself, if there is a tables of data
, the title and fragment ID of the data table items be respectively equal to the title and fragment ID of this application message, thens follow the steps 509, no
Then follow the steps 510；
Step 509：The data router for receiving solicitation message checks tables of data, selects a data table items, the data table items
Title and fragment ID be respectively equal to the title and fragment ID of this application message, transmission data message, the message of the data-message
Type is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, before next-hop is equal to this application message
One jumps, and fragment thresholding is equal to the data table items chosen, and executes step 519；
Step 510：The data router for receiving this application message checks application form, if there is an application list item, the Shen
Please list item title and fragment ID is respectively equal to the title of this application message and fragment ID and next-hop thresholding disappear equal to this application
The previous dive thresholding of breath, thens follow the steps 519, no to then follow the steps 511；
Step 511：The data router for receiving this application message checks application form, if there is an application list item, the Shen
Please list item title and fragment ID be respectively equal to the title and fragment ID of this application message, then follow the steps 512, otherwise execute step
Rapid 513；
Step 512：Receive this application message data router create one application list item, the title of this application list item and point
Piece ID is respectively equal to the title of this application message and fragment ID and next-hop thresholding are equal to the previous dive thresholding of this application message, holds
Row step 519；
Step 513：Receive this application message data router create one application list item, the title of this application list item and point
Piece ID is respectively equal to the title of this application message and fragment ID and next-hop thresholding are equal to the previous dive thresholding of this application message；It should
Data router checks data directory, if there is a data directory item, the title and fragment of the data directory list item
ID is respectively equal to the title and fragment ID of this application message, thens follow the steps 514, no to then follow the steps 515；
Step 514：The data router for receiving this application message checks data directory, selects a data directory item,
The title and fragment ID of the data directory list item are respectively equal to the title and fragment ID of this application message, will be under this application message
One hop domain value is updated to neighbours' thresholding of the data directory list item, and the previous dive thresholding of this application message is updated to the hard of oneself
Part address forwards this application message, executes step 505；
Step 515：The data router for receiving this application message checks neighbours' application form, if there is neighbours' application form
, which applies for that the title of list item and fragment ID are respectively equal to the title and fragment ID of this application message, thens follow the steps
516, it is no to then follow the steps 517；
Step 516：The data router for receiving this application message checks neighbours' application form, and a neighbours is selected to apply for list item,
The neighbours apply for that the title of list item and fragment ID are respectively equal to the title and fragment ID of this application message, which should
The next-hop thresholding of solicitation message is updated to neighbours' thresholding that the neighbours apply for list item, more by the previous dive thresholding of this application message
It is newly the hardware address of oneself, forwards this application message, executes step 505；
Step 517：The data router for receiving this application message checks that table name is equal to the road of title thresholding in this application message
By table, the sequence number r1 of the corresponding route table items of next-hop is calculated using formula (1), and Serial No. r1 is selected from the routing table
Route table items, the next-hop thresholding of this application message is updated to the next-hop thresholding of the route table items, by this application message
Previous dive thresholding be updated to the hardware address of oneself, forward this application message, execute step 505；
Step 518：The data server for receiving solicitation message checks tables of data, selects a data table items, the data table items
Title and fragment ID be respectively equal to the title and fragment ID of this application message, transmission data message, the message of the data-message
Type is 5, and title and fragment ID are respectively equal to the title and fragment ID of this application message, before next-hop is equal to this application message
One jumps, and fragment thresholding is equal to the data table items chosen；
Step 519：Judge whether that user node receives data-message, is to then follow the steps 523, it is no to then follow the steps 520；
Step 520：Judge whether that data server receives data-message, is to then follow the steps 525, it is no to then follow the steps 521；
Step 521：The data router for receiving data-message judges whether the hardware address of oneself is equal to the data-message
Next-hop thresholding is to then follow the steps 522, no to then follow the steps 525；
Step 522：The data router for receiving data-message creates a data table items, the title of the data table items, fragment
ID, fragment thresholding and life cycle are respectively equal to the title of data table items, fragment ID, fragment thresholding in data-message load
And life cycle；The data router checks application form, and all title thresholdings and fragment ID thresholdings is selected to be respectively equal to the number
According to the title of message and the application list item of fragment ID, for each application list item chosen, the data router by next-hop more
New is the next-hop thresholding of this application list item, forwards the data-message, executes step 519；
Step 523：The user node for receiving data-message judges whether the hardware address of oneself is equal under the data-message
One hop domain value is to then follow the steps 524, no to then follow the steps 525；
Step 524：Data table items in data-message load are added to oneself by the user node for receiving data-message
In tables of data；If containing all N1 fragments of data D1 in user's list item of the user node, 525 are thened follow the steps,
It is no to then follow the steps 519；
Step 525：Terminate.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810542793.8A CN108768855B (en) | 2018-05-30 | 2018-05-30 | Method for realizing next generation network by taking data as center |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810542793.8A CN108768855B (en) | 2018-05-30 | 2018-05-30 | Method for realizing next generation network by taking data as center |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108768855A true CN108768855A (en) | 2018-11-06 |
| CN108768855B CN108768855B (en) | 2020-09-25 |
Family
ID=64004491
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810542793.8A Active CN108768855B (en) | 2018-05-30 | 2018-05-30 | Method for realizing next generation network by taking data as center |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108768855B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100125584A1 (en) * | 2008-11-20 | 2010-05-20 | Sap Ag | Intelligent event query publish and subscribe system |
| CN103957162A (en) * | 2014-05-14 | 2014-07-30 | 常熟理工学院 | Routing communication realization method of wireless network |
| CN106101210A (en) * | 2016-06-08 | 2016-11-09 | 常熟理工学院 | A kind of data-centered radio network data communication method |
| CN107979605A (en) * | 2017-12-06 | 2018-05-01 | 常熟理工学院 | A kind of safe big data network communication method |
| CN108040101A (en) * | 2017-12-06 | 2018-05-15 | 常熟理工学院 | A kind of reliable big data network implementation approach |
-
2018
- 2018-05-30 CN CN201810542793.8A patent/CN108768855B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100125584A1 (en) * | 2008-11-20 | 2010-05-20 | Sap Ag | Intelligent event query publish and subscribe system |
| CN103957162A (en) * | 2014-05-14 | 2014-07-30 | 常熟理工学院 | Routing communication realization method of wireless network |
| CN106101210A (en) * | 2016-06-08 | 2016-11-09 | 常熟理工学院 | A kind of data-centered radio network data communication method |
| CN107979605A (en) * | 2017-12-06 | 2018-05-01 | 常熟理工学院 | A kind of safe big data network communication method |
| CN108040101A (en) * | 2017-12-06 | 2018-05-15 | 常熟理工学院 | A kind of reliable big data network implementation approach |
Non-Patent Citations (1)
| Title |
|---|
| 谭云: ""数据命名网络上的一种存储高效、可并行的数据名查找方案"", 《万方数据库》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108768855B (en) | 2020-09-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP2614618B1 (en) | Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism | |
| US8817798B2 (en) | Constraining topology size and recursively calculating routes in large networks | |
| EP2899921B1 (en) | End-to-end route tracing over a named-data network | |
| CN104184664B (en) | Route forwarding table items generation method and device | |
| Fabrikant et al. | There's something about MRAI: Timing diversity can exponentially worsen BGP convergence | |
| CN105471747B (en) | A kind of intelligent router route selecting method and device | |
| EP3767880A1 (en) | Optimizing information related to a route and/or a next hop for multicast traffic | |
| CN106685862B (en) | A kind of packet segment processing method and processing device | |
| CN110113264A (en) | A kind of caching and route implementation method for naming data network | |
| CN104486224A (en) | Routing learning method and equipment | |
| CN110138663A (en) | A kind of data-centered new generation network implementation method | |
| CN106911570A (en) | A kind of reliable network data communication method | |
| CN109150723A (en) | A kind of routing Realization Method of Communication of Internet of Things | |
| US20210359941A1 (en) | Transforming a multi-level hybrid hierarchical forwarding information base format | |
| US20170111260A1 (en) | Trill isis-based route calculation method and device | |
| US8681792B2 (en) | Packet forwarding in a network | |
| CN111277497B (en) | Method for realizing network service deployment and discovery based on distribution | |
| CN108768855A (en) | A kind of data-centered next generation network implementation method | |
| CN109039908B (en) | Recursive routing switching method, router, switch and electronic equipment | |
| CN107623535A (en) | A kind of communication means of bandwidth carrier | |
| CN101483582B (en) | Method, system and router for implementing second and third layer multicast trace route | |
| CN110719208B (en) | Method for implementing new generation network based on shortest path | |
| Gasparyan et al. | IaDRA-SCN: Intra-domain routing architecture for service-centric networking | |
| CN106936710A (en) | A kind of Mesh Group collocation methods and device | |
| Tsilopoulos et al. | Adaptive semi-stateless forwarding for content-centric networks |
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 |