CN106209645A - The initial lookup node of a kind of packet determines method and device - Google Patents
The initial lookup node of a kind of packet determines method and device Download PDFInfo
- Publication number
- CN106209645A CN106209645A CN201610609682.5A CN201610609682A CN106209645A CN 106209645 A CN106209645 A CN 106209645A CN 201610609682 A CN201610609682 A CN 201610609682A CN 106209645 A CN106209645 A CN 106209645A
- Authority
- CN
- China
- Prior art keywords
- sequence number
- node
- field sequence
- name prefix
- identity field
- 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.)
- Pending
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/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- 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/50—Network services
- H04L67/56—Provisioning of proxy services
- H04L67/568—Storing data temporarily at an intermediate stage, e.g. caching
Abstract
The initial lookup node that the embodiment of the invention discloses a kind of packet determines method and device, it is applied to content center network, described method includes: receives data request packet, comprises the first name prefix and the first identity field sequence number of target data bag in described data request packet；According to described data request packet and Current Content indexed cache table, determine the initial lookup node of described target data bag, wherein, including at least the second name prefix of packet, the second identity field sequence number of primary nodal point and the identity field sequence number group of secondary nodal point in described content indexing cache table, wherein, primary nodal point is the node of packet of the second name prefix that the last time finds, described；Secondary nodal point is node node pointed by less than described second identity field sequence number.Utilize the embodiment of the present invention, improve the search efficiency of packet.
Description
Technical field
The present invention relates to content center network technical field, particularly to the initial lookup node side of determination of a kind of packet
Method and device.
Background technology
Current the Internet develops into rapidly the propagation of content, content center network (Content from Information Communication end to end
Centric Networking, is called for short CCN) as a kind of novel Future network architectures, slow by increasing content in a network
Deposit and cater to this trend.CCN passes through the most built-in caching capabilities, and by this way, the content requests of part can
Directly it is satisfied in a network and without going remote server is asked, thus improves the delivery efficiency of content, reduce net
Network is congested.
In the CCN router prototype of a kind of entitled NFD (NDN Forwarding Daemon), skip list is used to make
Bottom data structure for content caching (CS).Skip list is a kind of balanced tree based on probability selection, and the content of lookup is deposited
Storage is in node.Node is the construction unit of composition skip list, and each node includes key and value, it is believed that key is
The name of node, can store content in value, it is also possible to store a pointer pointing to content (packet).The name of content
Word is hierarchical structure, and name prefix and id field by content form.Wherein, the key of node to be found and content name,
The name of data request packet is identical.
Existing lookup algorithm is that data request packet begins look for from head node, after finding the node of storage packet,
Find the packet of storage in node.After finding the packet of request, at the upper joint once searched and comprise same name prefix
During the packet stored in point, it is still desirable to using the head node in skip list as initial lookup node, actually carry out
Repeat to search, and seeking scope spreads all over whole skip list, it is impossible to be quickly found out in node to be found the content of storage, cause number
Search efficiency according to bag is the highest.
Summary of the invention
The purpose of the embodiment of the present invention is that the initial lookup node providing a kind of packet determines method and device, to carry
The search efficiency of high packet.
For reaching above-mentioned purpose, the initial lookup node that the embodiment of the invention discloses a kind of packet determines method, should
For content center network, method includes:
Receive data request packet, described data request packet comprises the first name prefix and first identity of target data bag
Field sequence number；
According to described data request packet and Current Content indexed cache table, determine the initial lookup joint of described target data bag
Point, wherein, including at least the second name prefix of packet, the second identity word of primary nodal point in described content indexing cache table
Section sequence number and the identity field sequence number group of secondary nodal point, wherein, primary nodal point is the second name that the last time finds, described
The node of the packet of prefix；Secondary nodal point is node node pointed by less than described second identity field sequence number.
It is also preferred that the left described secondary nodal point is:
In the node pointed by node less than described second identity field sequence number, identity field sequence number is not less than described the
The node of two identity field sequence numbers.
It is also preferred that the left described according to described data request packet with Current Content indexed cache table, determine described target data bag
Initial lookup node, including:
Judge whether Current Content indexed cache table exists the second name prefix identical with described first name prefix；
If there is, it is judged that described first identity field sequence number whether not less than identical with described first name prefix the
The second identity field sequence number that two name prefixes are corresponding；
If it is not, by identity field sequence number group corresponding for the second name prefix identical with described first name prefix
In, it is not more than and the secondary nodal point corresponding to identity field sequence number of closest described first identity field sequence number, is defined as institute
State the initial lookup node of target data bag.
It is also preferred that the left described method also includes:
The second name prefix identical with described first name prefix, or institute is there is not in Current Content indexed cache table
State the second identity field that the first identity field sequence number is corresponding less than the second name prefix identical with described first name prefix
In the case of sequence number, head node is defined as the initial lookup node of described target data bag.
It is also preferred that the left described method also includes:
According to described first name prefix and described first identity field sequence number, update described content indexing cache table.
It is also preferred that the left described method also includes:
Receive the renewal for the node in the skip list of described content center network to instruct；
Determine the described name prefix updating instruction correspondence；
According to described name prefix, update described content indexing cache table.
For reaching above-mentioned purpose, the initial lookup node that the embodiment of the invention discloses a kind of packet determines device, should
For content center network, device includes:
First receiver module, is used for receiving data request packet, comprises the first of target data bag in described data request packet
Name prefix and the first identity field sequence number；
First determines module, for according to described data request packet and Current Content indexed cache table, determines described target
The initial lookup node of packet, wherein, in described content indexing cache table including at least packet the second name prefix, the
Second identity field sequence number of one node and the identity field sequence number group of secondary nodal point, wherein, primary nodal point is to look into the last time
The node of the packet of the second name prefix that find, described；Secondary nodal point is the joint less than described second identity field sequence number
Node pointed by Dian.
It is also preferred that the left described secondary nodal point is:
In the node pointed by node less than described second identity field sequence number, identity field sequence number is not less than described the
The node of two identity field sequence numbers.
It is also preferred that the left described first determines module, including:
First judging unit, is used for judging whether exist in Current Content indexed cache table and described first name prefix phase
The second same name prefix；
Second judging unit, for existing identical with described first name prefix the in Current Content indexed cache table
In the case of two name prefixes, it is judged that whether described first identity field sequence number is not less than identical with described first name prefix
The second identity field sequence number that second name prefix is corresponding；
First determines unit, for being not less than identical with described first name prefix in described first identity field sequence number
In the case of the second identity field sequence number that second name prefix is corresponding, by second name identical with described first name prefix
In the identity field sequence number group that prefix is corresponding, it is not more than and the identity field sequence number institute of closest described first identity field sequence number
Corresponding secondary nodal point, is defined as the initial lookup node of described target data bag.
It is also preferred that the left described first determines module, also include:
Second determines unit, identical with described first name prefix for not existing in Current Content indexed cache table
Second name prefix, or described first identity field sequence number is less than the second name prefix pair identical with described first name prefix
In the case of the second identity field sequence number answered, head node is defined as the initial lookup node of described target data bag.
It is also preferred that the left described device also includes:
First more new module, for according to described first name prefix and described first identity field sequence number, updates described
Content indexing cache table.
It is also preferred that the left described device also includes:
Second receiver module, refers to for receiving the renewal for the node in the skip list of described content center network
Order；
Second determines module, for determining the described name prefix updating instruction correspondence；
Second more new module, for according to described name prefix, updates described content indexing cache table.
As seen from the above technical solutions, the initial lookup node side of determination of a kind of packet that the embodiment of the present invention provides
Method and device, be applied to content center network, receives data request packet, comprises the of target data bag in described data request packet
One name prefix and the first identity field sequence number；According to described data request packet and Current Content indexed cache table, determine described
The initial lookup node of target data bag, wherein, before including at least the second name of packet in described content indexing cache table
Sew, the second identity field sequence number of primary nodal point and the identity field sequence number group of secondary nodal point, wherein, primary nodal point is nearest one
The node of the packet of secondary second name prefix that find, described；Secondary nodal point is less than described second identity field sequence number
The node pointed by node.
Visible, after the data request packet that formerly arrives has searched target data bag, search bag in data request packet later
During packet content containing same name prefix, it is not necessary to using head node as the initial lookup node of packet, seeking scope
Without spreading all over whole skip list, it is to avoid the repeating of node is searched, thus improves the search efficiency of packet.
Certainly, arbitrary product or the method for implementing the present invention must be not necessarily required to reach all the above excellent simultaneously
Point.
Accompanying drawing explanation
In order to be illustrated more clearly that the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
In having technology to describe, the required accompanying drawing used is briefly described, it should be apparent that, the accompanying drawing in describing below is only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, it is also possible to
Other accompanying drawing is obtained according to these accompanying drawings.
The initial lookup node of a kind of packet that Fig. 1 provides for the embodiment of the present invention determines the schematic flow sheet of method；
The initial lookup node of a kind of packet that Fig. 2 provides for the embodiment of the present invention determines the structural representation of device；
The schematic flow sheet of the basic search procedure of the skip list that Fig. 3 provides for the embodiment of the present invention.
Detailed description of the invention
Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete
Describe, it is clear that described embodiment is only a part of embodiment of the present invention rather than whole embodiments wholely.Based on
Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under not making creative work premise
Embodiment, broadly falls into the scope of protection of the invention.
First below the initial lookup node of a kind of packet that the embodiment of the present invention provides is determined that method is carried out in detail
Explanation.
The initial lookup node seeing a kind of packet that Fig. 1, Fig. 1 provide for the embodiment of the present invention determines the flow process of method
Schematic diagram, is applied to content center network, may include steps of:
S101, receives data request packet, comprises the first name prefix and the of target data bag in described data request packet
One identity field sequence number；
Concrete, current the Internet quickly grow the propagation developing into content from Information Communication end to end, in content
Heart network (CCN), as a kind of novel Future network architectures, caters to this trend by increase content caching in a network.
CCN passes through the most built-in caching capabilities, and by this way, the content requests of part can be satisfied the most in a network
And without going remote server is asked, thus improve the delivery efficiency of content, reduce network congestion.In CCN, pay close attention to
Content itself rather than its storage position.Different contents with name distinguish, the name of content is hierarchical structure, by multiple specifically
The name prefix of layering and identity field sequence number (id field) composition.With content name " baidu.com/news/guonei/
1 " as a example by, wherein " baidu.com/news/guonei " is the name prefix of this content, and " 1 " is then id field.Apply in reality
In, content can be packet.
Concrete, packet can be stored in the content caching (CS) of CCN router, with skip list (abbreviation skip list)
Bottom data structure as CS.Skip list is a quick indexing structure, is used for being quickly found out packet.Packet can be direct
It is stored in the node of skip list, the node of skip list can also carry the address that data wrap in content caching.Substantially
Skip list in, each node comprises key and the value of correspondence thereof and one and points to the pointer number of the next node with layer chained list
Group, key can be the name of node, can store packet in value, it is also possible to store a pointer pointing to packet.
Such as, for packet A, its name is aaa/bbb/ccc/13, then its name prefix is aaa/bbb/ccc/, it
Id field is 13.Packet A address in content caching is 0x898, and then the node B in skip list is used for storing this data
Bag A, this address of node is 0x999.In fact the node B in skip list comprises two territories, and key therein is exactly aaa/bbb/
Ccc/13, value are exactly the pointer pointing to packet A, i.e. 0x898.When carrying content name i.e. packet name aaa/bbb/
When the data request packet of ccc/13 arrives, it is possible to wrapping in skip list by this request of data and make a look up, finding key is aaa/
The node of bbb/ccc/13.Find this node, packet A can be found.
Exemplary, receive data request packet " baidu.com/news/guonei/37 ", wherein, this data request packet bag
The first name prefix containing target data bag is " baidu.com/news/guonei ", the first identity field serial number " 37 ".
S102, according to described data request packet and Current Content indexed cache table, determines the initial of described target data bag
Search node, wherein, in described content indexing cache table including at least the second name prefix of packet, the second of primary nodal point
The identity field sequence number group of identity field sequence number and secondary nodal point, wherein, primary nodal point is that the last time finds, described
The node of the packet of two name prefixes；Secondary nodal point is joint node pointed by less than described second identity field sequence number
Point.
Concrete, secondary nodal point can be: in the node pointed by node less than described second identity field sequence number, body
Part field sequence number is not less than the node of described second identity field sequence number.
Concrete, in actual applications, it can be determined that whether Current Content indexed cache table exists and described first place
The second name prefix that word prefix is identical；If there is, it is judged that described first identity field sequence number whether not less than with described the
The second identity field sequence number that the second name prefix that one name prefix is identical is corresponding；If it is not, will be with described first place
In the identity field sequence number group that the second name prefix that word prefix is identical is corresponding, it is not more than and closest to described first identity field
The secondary nodal point corresponding to identity field sequence number of sequence number, is defined as the initial lookup node of described target data bag.
Exemplary, as it is shown on figure 3, the stream of the basic search procedure of skip list that Fig. 3 provides for the embodiment of the present invention
Journey schematic diagram.Wherein, the address of the head node at head pointer place is 0x0, identity field serial number 3,7,14,17,21,32,37,
41,55, the address of node of NIL is respectively 0x1,0x2,0x3,0x4,0x5,0x6,0x7,0x8,0x9 and 0xA.Receive
Data request packet is " baidu.com/news/guonei/37 ", and this data request packet comprises first name of target data bag x
Prefix is " baidu.com/news/guonei ", the first identity field serial number " 37 ".Current Content indexed cache table wraps
Contain: the second name prefix " baidu.com/news/guonei " of packet, the second of the primary nodal point that this name prefix is corresponding
Identity field serial number " 14 ", the identity field sequence number group of secondary nodal point is that " NIL, 41,17,14 " (NIL is empty, represents infinite
Greatly, in actual applications, can deposit and can not deposit in the identity field sequence number group of secondary nodal point), it is also possible to comprise secondary nodal point
Node address " 0xA, 0x8,0x4,0x3 "；Second name prefix " www.fnlab.net/research " of packet, this name
Second identity field serial number " 6 " of the primary nodal point that prefix is corresponding, the identity field sequence number group of secondary nodal point be " NIL, 31,
20,6 ", it is also possible to comprise the node address " 0xA, 0x9,0xB, 0xE " of secondary nodal point.Judge to draw Current Content indexed cache
Table exists the second name prefix " baidu.com/news/guonei " identical with the first name prefix, then carries out judging
To the second identity word that the first identity field sequence number " 37 " is corresponding not less than the second name prefix identical with the first name prefix
Section sequence number " 14 ".By corresponding for the second name prefix identical with the first name prefix identity field sequence number group " NIL, 41,17,
14 ", in, it is not more than and the secondary nodal point corresponding to identity field sequence number " 17 " of closest described first identity field sequence number, really
It is set to the initial lookup node of target data bag.Begin look for from this initial node of searching, target data bag x can be found.
In actual applications, the data knot of entitled " content indexing caching " can in router based on content center network, be defined
Structure, thus obtain content indexing cache table.
Concrete, in actual applications, can not exist in Current Content indexed cache table with described first name before
Sew the second identical name prefix, or described first identity field sequence number is less than the second place identical with described first name prefix
In the case of the second identity field sequence number that word prefix is corresponding, head node is defined as the initial lookup joint of described target data bag
Point.
Exemplary, for data request packet " baidu.com/news/yule/37 ", this data request packet comprises target
The first name prefix of packet y is " baidu.com/news/yule ", the first identity field serial number " 37 ".Current Content
Second name prefix of the packet comprised in indexed cache table be respectively " baidu.com/news/guonei " and
" www.fnlab.net/research ", it is seen that do not exist identical for " baidu.com/news/yule " with the first name prefix
The second name prefix, then head node is defined as the initial lookup node of target data bag y.Or, for data request packet
" baidu.com/news/guonei/7 ", the first name prefix that this data request packet comprises target data bag z is
" baidu.com/news/guonei ", the first identity field serial number " 7 ", the data comprised in Current Content indexed cache table
Second name prefix of bag is respectively " baidu.com/news/guonei " and " www.fnlab.net/research ", wherein
Second body of the primary nodal point that the second name prefix " baidu.com/news/guonei " identical with the first name prefix is corresponding
Part field serial number " 14 ", more than the first identity field sequence number " 7 " of target data bag z, is then defined as number of targets by head node
Initial lookup node according to bag z.
Concrete, in actual applications, can be according to described first name prefix and described first identity field sequence number, more
New described content indexing cache table.
Exemplary, Current Content indexed cache table comprises: the second name prefix " baidu.com/ of packet
News/guonei ", the second identity field sequence number " 14 " of the primary nodal point that this name prefix is corresponding, the identity word of secondary nodal point
Section sequence number group is " NIL, 41,17,14 ", it is also possible to comprise the node address " 0xA, 0x8,0x4,0x3 " of secondary nodal point；Packet
The second name prefix " www.fnlab.net/research ", the second identity field of the primary nodal point that this name prefix is corresponding
Sequence number " 6 ", the identity field sequence number group of secondary nodal point is " NIL, 31,20,6 ", it is also possible to comprise the node address of secondary nodal point
" 0xA, 0x9,0xB, 0xE ".For data request packet " baidu.com/news/guonei/37 ", in the target finding correspondence
After packet x, the second identity field sequence number of primary nodal point corresponding for this name prefix is updated to " 37 ", the body of secondary nodal point
Part field sequence number group is updated to " NIL, 41,41,37 ", and the node address of secondary nodal point is updated to " 0xA, 0x8,0x8,0x7 "；Right
In data request packet " baidu.com/news/yule/37 ", after the target data bag y finding correspondence, by name prefix
Before second identity field sequence number " 37 " of the primary nodal point that " baidu.com/news/yule ", this name prefix are corresponding, this name
Sew correspondence secondary nodal point identity field sequence number group " NIL, 55,41,37 " and correspondence secondary nodal point node address " 0xA,
0x9,0x8,0x7 " add in Current Content indexed cache table；For data request packet " baidu.com/news/guonei/
7 ", after the target data bag z finding correspondence, by the second identity field sequence number of primary nodal point corresponding for this name prefix more
It is newly " 7 " that the identity field sequence number group of secondary nodal point is updated to " 7,7,7,7, ", and the node address of secondary nodal point is updated to
" 0x2,0x2,0x2,0x2 ".
Concrete, in actual applications, node in the skip list for described content center network can be received
Update instruction；Determine the described name prefix updating instruction correspondence；According to described name prefix, update described content indexing caching
Table.
Concrete, updating instruction can be to insert node and deletion of node.The insertion of skip list and deletion action need to ensure
Insert and delete correctness and the correctness of content indexing cache table of posterior nodal point structure.Insert and after deletion of node, content
Indexed cache table also can change accordingly.In the insertion technology of existing basic skip list, insertion process first has to by searching
Rope algorithm finds the position of node to be inserted, and then produces the random number of plies and proceeds by update and be updated node.
In embodiments of the present invention, need to be also carried out content indexed cache table updating.
Exemplary, receive the instruction inserting node, determine that name prefix corresponding to this instruction is " baidu.com/
news/guonei”.According to this name prefix, by the second name prefix identical with this name prefix in content indexing cache table,
It is invalid that second identity field sequence number of the primary nodal point that this name prefix is corresponding and the identity field sequence number group of secondary nodal point are set to,
I.e. it is set to down state.After inserting node, searching name prefix for the first time is " baidu.com/news/guonei "
During packet, head node is defined as the initial lookup node of target data bag.After finding target data bag, can be as above
Described, according to the first name prefix and the first identity field sequence number of target data bag, update Current Content indexed cache table, and
And by primary nodal point corresponding to the second name prefix identical with this name prefix in content indexing cache table, this name prefix
The identity field sequence number group of the second identity field sequence number and secondary nodal point is set to upstate again.The deletion action of basic skip list
The most first find the position wanting deletion of node, after finding, this node carried out deletion action and interdependent node is updated,
Content indexed cache table is updated simultaneously.The operation of deletion of node is similar with the operation inserting node, the embodiment of the present invention
It is not repeated at this.
Visible, after the data request packet that formerly arrives has searched target data bag, search bag in data request packet later
During packet content containing same name prefix, it is not necessary to using head node as the initial lookup node of packet, seeking scope
Without spreading all over whole skip list, it is to avoid the repeating of node is searched, thus improves the search efficiency of packet.
The initial lookup node seeing a kind of packet that Fig. 2, Fig. 2 provide for the embodiment of the present invention determines the structure of device
Schematic diagram, corresponding with the flow process shown in Fig. 1, it is applied to content center network, this determines that device may include that the first reception mould
Block 201, first determine module 202.
First receiver module 201, is used for receiving data request packet, comprises the of target data bag in described data request packet
One name prefix and the first identity field sequence number；
First determines module 202, for according to described data request packet and Current Content indexed cache table, determines described mesh
Mark packet initial lookup node, wherein, in described content indexing cache table including at least packet the second name prefix,
Second identity field sequence number of primary nodal point and the identity field sequence number group of secondary nodal point, wherein, primary nodal point is the last
The node of the packet of the second name prefix that find, described；Secondary nodal point is less than described second identity field sequence number
Node pointed by node.
Concrete, in actual applications, described secondary nodal point can be:
In the node pointed by node less than described second identity field sequence number, identity field sequence number is not less than described the
The node of two identity field sequence numbers.
Concrete, first determines module 202, may include that the first judging unit, the second judging unit and first determine list
Unit's (not shown)；
First judging unit, is used for judging whether exist in Current Content indexed cache table and described first name prefix phase
The second same name prefix；
Second judging unit, for existing identical with described first name prefix the in Current Content indexed cache table
In the case of two name prefixes, it is judged that whether described first identity field sequence number is not less than identical with described first name prefix
The second identity field sequence number that second name prefix is corresponding；
First determines unit, for being not less than identical with described first name prefix in described first identity field sequence number
In the case of the second identity field sequence number that second name prefix is corresponding, by second name identical with described first name prefix
In the identity field sequence number group that prefix is corresponding, it is not more than and the identity field sequence number institute of closest described first identity field sequence number
Corresponding secondary nodal point, is defined as the initial lookup node of described target data bag.
Concrete, in actual applications, first determines module 202, it is also possible to including:
Second determines unit, identical with described first name prefix for not existing in Current Content indexed cache table
Second name prefix, or described first identity field sequence number is less than the second name prefix pair identical with described first name prefix
In the case of the second identity field sequence number answered, head node is defined as the initial lookup node of described target data bag.
Concrete, in actual applications, described device can also include:
First more new module, for according to described first name prefix and described first identity field sequence number, updates described
Content indexing cache table.
Concrete, in actual applications, described device can also include:
Second receiver module, refers to for receiving the renewal for the node in the skip list of described content center network
Order；
Second determines module, for determining the described name prefix updating instruction correspondence；
Second more new module, for according to described name prefix, updates described content indexing cache table.
Visible, after the data request packet that formerly arrives has searched target data bag, search bag in data request packet later
During packet content containing same name prefix, it is not necessary to using head node as the initial lookup node of packet, seeking scope
Without spreading all over whole skip list, it is to avoid the repeating of node is searched, thus improves the search efficiency of packet.
It should be noted that in this article, the relational terms of such as first and second or the like is used merely to a reality
Body or operation separate with another entity or operating space, and deposit between not necessarily requiring or imply these entities or operating
Relation or order in any this reality.And, term " includes ", " comprising " or its any other variant are intended to
Comprising of nonexcludability, so that include that the process of a series of key element, method, article or equipment not only include that those are wanted
Element, but also include other key elements being not expressly set out, or also include for this process, method, article or equipment
Intrinsic key element.In the case of there is no more restriction, statement " including ... " key element limited, it is not excluded that
Including process, method, article or the equipment of described key element there is also other identical element.
Each embodiment in this specification all uses relevant mode to describe, identical similar portion between each embodiment
Dividing and see mutually, what each embodiment stressed is the difference with other embodiments.Real especially for device
For executing example, owing to it is substantially similar to embodiment of the method, so describe is fairly simple, relevant part sees embodiment of the method
Part illustrate.
One of ordinary skill in the art will appreciate that all or part of step realizing in said method embodiment is can
Completing instructing relevant hardware by program, described program can be stored in computer read/write memory medium,
The storage medium obtained designated herein, such as: ROM/RAM, magnetic disc, CD etc..
The foregoing is only presently preferred embodiments of the present invention, be not intended to limit protection scope of the present invention.All
Any modification, equivalent substitution and improvement etc. made within the spirit and principles in the present invention, are all contained in protection scope of the present invention
In.
Claims (10)
1. the initial lookup node of packet determines a method, is applied to content center network, it is characterised in that described method
Including:
Receive data request packet, described data request packet comprises the first name prefix and first identity field of target data bag
Sequence number；
According to described data request packet and Current Content indexed cache table, determine the initial lookup node of described target data bag,
Wherein, including at least the second name prefix of packet, the second identity field of primary nodal point in described content indexing cache table
The identity field sequence number group of sequence number and secondary nodal point, wherein, before primary nodal point is the second name that the last time finds, described
The node of the packet sewed；Secondary nodal point is node node pointed by less than described second identity field sequence number.
Method the most according to claim 1, it is characterised in that described secondary nodal point is:
In the node pointed by node less than described second identity field sequence number, identity field sequence number is not less than described second body
The node of part field sequence number.
Method the most according to claim 2, it is characterised in that described index according to described data request packet and Current Content
Cache table, determines the initial lookup node of described target data bag, including:
Judge whether Current Content indexed cache table exists the second name prefix identical with described first name prefix；
If there is, it is judged that whether described first identity field sequence number is not less than the second place identical with described first name prefix
The second identity field sequence number that word prefix is corresponding；
If it is not, by identity field sequence number group corresponding for the second name prefix identical with described first name prefix,
It is not more than and the secondary nodal point corresponding to identity field sequence number of closest described first identity field sequence number, is defined as described mesh
The initial lookup node of mark packet.
Method the most according to claim 3, it is characterised in that described method also includes:
The second name prefix identical with described first name prefix, or described is there is not in Current Content indexed cache table
The second identity field sequence number that one identity field sequence number is corresponding less than the second name prefix identical with described first name prefix
In the case of, head node is defined as the initial lookup node of described target data bag.
5. according to the method described in claim 3 or 4, it is characterised in that described method also includes:
According to described first name prefix and described first identity field sequence number, update described content indexing cache table.
6. according to the method described in any one of claim 1-4, it is characterised in that described method also includes:
Receive the renewal for the node in the skip list of described content center network to instruct；
Determine the described name prefix updating instruction correspondence；
According to described name prefix, update described content indexing cache table.
7. the initial lookup node of packet determines a device, is applied to content center network, it is characterised in that described device
Including:
First receiver module, is used for receiving data request packet, comprises the first name of target data bag in described data request packet
Prefix and the first identity field sequence number；
First determines module, for according to described data request packet and Current Content indexed cache table, determines described target data
The initial lookup node of bag, wherein, including at least the second name prefix of packet, first segment in described content indexing cache table
Second identity field sequence number of point and the identity field sequence number group of secondary nodal point, wherein, primary nodal point is to find the last time
, the node of the packet of described second name prefix；Secondary nodal point is the node institute less than described second identity field sequence number
The node pointed to.
Device the most according to claim 7, it is characterised in that described secondary nodal point is:
In the node pointed by node less than described second identity field sequence number, identity field sequence number is not less than described second body
The node of part field sequence number.
Device the most according to claim 8, it is characterised in that described first determines module, including:
Whether the first judging unit is identical with described first name prefix for judging to exist in Current Content indexed cache table
Second name prefix；
, for there is the second place identical with described first name prefix in Current Content indexed cache table in the second judging unit
In the case of word prefix, it is judged that whether described first identity field sequence number is not less than identical with described first name prefix second
The second identity field sequence number that name prefix is corresponding；
First determines unit, for being not less than second identical with described first name prefix in described first identity field sequence number
In the case of the second identity field sequence number that name prefix is corresponding, by the second name prefix identical with described first name prefix
In corresponding identity field sequence number group, it is not more than and closest to corresponding to the identity field sequence number of described first identity field sequence number
Secondary nodal point, be defined as the initial lookup node of described target data bag.
Device the most according to claim 9, it is characterised in that described first determines module, also includes:
Second determines unit, for there is not second identical with described first name prefix in Current Content indexed cache table
Name prefix, or described first identity field sequence number is corresponding less than the second name prefix identical with described first name prefix
In the case of second identity field sequence number, head node is defined as the initial lookup node of described target data bag.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610609682.5A CN106209645A (en) | 2016-07-29 | 2016-07-29 | The initial lookup node of a kind of packet determines method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610609682.5A CN106209645A (en) | 2016-07-29 | 2016-07-29 | The initial lookup node of a kind of packet determines method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106209645A true CN106209645A (en) | 2016-12-07 |
Family
ID=57496781
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610609682.5A Pending CN106209645A (en) | 2016-07-29 | 2016-07-29 | The initial lookup node of a kind of packet determines method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106209645A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107679212A (en) * | 2017-10-17 | 2018-02-09 | 安徽慧视金瞳科技有限公司 | A kind of data query optimization method for being applied to jump list data structure |
| CN109428822A (en) * | 2017-09-01 | 2019-03-05 | 华为技术有限公司 | A kind of Name Lookup method and the network equipment |
| WO2020007288A1 (en) * | 2018-07-06 | 2020-01-09 | 第四范式（北京）技术有限公司 | Method and system for managing memory data and maintaining data in memory |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095724A (en) * | 2013-02-05 | 2013-05-08 | 西安电子科技大学 | Content-centric networking multi-interest package compression sending and processing method |
| CN103428093A (en) * | 2013-07-03 | 2013-12-04 | 北京邮电大学 | Route prefix storing, matching and updating method and device based on names |
| WO2015068929A1 (en) * | 2013-11-06 | 2015-05-14 | 삼성전자주식회사 | Operation method of node considering packet characteristic in content-centered network and node |
| CN105376212A (en) * | 2014-08-15 | 2016-03-02 | 帕洛阿尔托研究中心公司 | System and method for performing key resolution over a content centric network |
-
2016
- 2016-07-29 CN CN201610609682.5A patent/CN106209645A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095724A (en) * | 2013-02-05 | 2013-05-08 | 西安电子科技大学 | Content-centric networking multi-interest package compression sending and processing method |
| CN103428093A (en) * | 2013-07-03 | 2013-12-04 | 北京邮电大学 | Route prefix storing, matching and updating method and device based on names |
| WO2015068929A1 (en) * | 2013-11-06 | 2015-05-14 | 삼성전자주식회사 | Operation method of node considering packet characteristic in content-centered network and node |
| CN105376212A (en) * | 2014-08-15 | 2016-03-02 | 帕洛阿尔托研究中心公司 | System and method for performing key resolution over a content centric network |
Non-Patent Citations (1)
| Title |
|---|
| TIAN PAN ET AL.: "《Fast Content Store Lookup Using Locality-Aware Skip List in Content-Centric Networks》", 《2016 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109428822A (en) * | 2017-09-01 | 2019-03-05 | 华为技术有限公司 | A kind of Name Lookup method and the network equipment |
| CN109428822B (en) * | 2017-09-01 | 2020-10-09 | 华为技术有限公司 | Name searching method and network equipment |
| CN107679212A (en) * | 2017-10-17 | 2018-02-09 | 安徽慧视金瞳科技有限公司 | A kind of data query optimization method for being applied to jump list data structure |
| WO2020007288A1 (en) * | 2018-07-06 | 2020-01-09 | 第四范式（北京）技术有限公司 | Method and system for managing memory data and maintaining data in memory |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103873371B (en) | A kind of name route Rapid matching lookup method and device | |
| CN103581052B (en) | A kind of data processing method, router and NDN system | |
| CN107105061B (en) | Service registration method and device | |
| CN104901997B (en) | System and method for the direct storage access in content center network | |
| JP6373021B2 (en) | Apparatus and method for processing differently configured longest prefix match tables | |
| JP6997297B2 (en) | Establishing a packet classification decision tree | |
| US8750144B1 (en) | System and method for reducing required memory updates | |
| CN105701156B (en) | A kind of distributed file system management method and device | |
| WO2009135417A1 (en) | The longest prefix match mehtod and device based on tree data structure | |
| US10459729B2 (en) | Map tables for hardware tables | |
| CN106209645A (en) | The initial lookup node of a kind of packet determines method and device | |
| CN105141525B (en) | IPv6 method for searching route and device | |
| CN107404530A (en) | Social networks cooperation caching method and device based on user interest similarity | |
| CN108388642A (en) | A kind of subgraph query method, device and computer readable storage medium | |
| CN109639758A (en) | The guard method of user behavior privacy and device in content center network | |
| CN105429879A (en) | Flow table item querying method, flow table item querying equipment and flow table item querying system | |
| CN108134739A (en) | A kind of method for searching route and device based on index trie | |
| Lee et al. | Dual-load Bloom filter: Application for name lookup | |
| US9628368B2 (en) | Method and apparatus for compressing content name | |
| CN105227468B (en) | A kind of lookup device, lookup method and configuration method | |
| CN103457855B (en) | Classless inter-domain routing table is established and the method and apparatus of message forwarding | |
| CN109691067A (en) | System and method for transmitting and receiving interest message | |
| CN109831384A (en) | Name Lookup method and router | |
| CN109729514A (en) | A kind of method for quickly querying of the dynamic location information of mobile network's entity | |
| KR101674294B1 (en) | Apparatus for operating data structure capable of random access and state access and operating method thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20161207 |
|
| RJ01 | Rejection of invention patent application after publication |