CN104301305B - Interest bag is forwarded under information centre's network method and forwarding terminal - Google Patents
Interest bag is forwarded under information centre's network method and forwarding terminal Download PDFInfo
- Publication number
- CN104301305B CN104301305B CN201410476456.5A CN201410476456A CN104301305B CN 104301305 B CN104301305 B CN 104301305B CN 201410476456 A CN201410476456 A CN 201410476456A CN 104301305 B CN104301305 B CN 104301305B
- Authority
- CN
- China
- Prior art keywords
- forwarding
- interface
- decision attribute
- decision
- mrow
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
-
- 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/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to the method and forwarding terminal that interest bag under information centre's network is forwarded.Method includes：For interest bag to be forwarded, all optional forwarding interfaces and the corresponding all decision attributes of each forwarding interface and value are obtained from forwarding information storehouse；Decision attribute values corresponding to each forwarding interface are normalized, and the weighted value of each decision attribute is calculated using the method based on comentropy；The dynamic utilization rate of each forwarding interface is calculated, the forwarding performance of each forwarding interface is obtained according to the static nature of network, the forwarding probability of each forwarding interface is calculated；Probability selection goes out forwarding of the forwarding interface to carry out interest bag from all optional forwarding interfaces.The present invention is by introducing decision attribute, the behavioral characteristics of static nature and interface to network are calculated, so that the forwarding interface determined has very strong adaptivity to network transmission, and enhance the robustness of bag transmission so that Internet resources are able to efficiently utilize.
Description
Technical field
The present invention relates to network communication technology field, and in particular to interest bag is forwarded under information centre's network method and turn
Send out terminal.
Background technology
Network (ICN, Information-Center Network, abbreviation information centre network) centered on information is
In recent years what is proposed a kind of attempts to substitute the traditional Future Internet framework based on ICP/IP protocol.In ICN, all data are all
Name based on stratification is identified, and communication process is not concerned with the position of communication node and only focuses on requested data in itself.
The representative of this respect is name data network (NDN, Named Data Networking), wherein, the data of name become net
First order entity (first-class entity) in network.Include two class packets in NDN networks, a class is Interest
(interest) is wrapped, also known as request bag, is issued a request to for request of data side and data are obtained in network, another kind of is Data (data)
Bag, is the data content of request of data side's true request.Network service process is driven by request of data side completely, by drawing
(pull) mode obtains data, and the caching function and flexible forwarding strategy layer built in data cause NDN networks have good
Content distribution function.
As shown in figure 1, NDN routing node needs to safeguard three table structures, i.e. CS (deposit by Content Store, content
Storage), PIT (Pending Interest Table, interest table undetermined) and FIB (Forwarding Information Base,
Forwarding information storehouse).As shown in Figure 2 a and 2 b, data consumer sends an Interest bag (bag to whole communication process first
Title containing required data) data needed for oneself are asked, routing node is received after this Interest bag, first according to name
Claim to carry out the content that longest prefix match searches whether to match with current name in local CS, if then will directly match
Data bags return；If not provided, routing node will search corresponding record in PIT tables.If matched in PIT tables
Record is closed, then illustrates the Interest bags of the name prefix just request data in a network, therefore, routing node only need to be at oneself
Corresponding entry increases the interface number that current Interest bags enter in PIT tables；If not finding relevant entry, road in PIT tables
Which it will search the record matched with current name in fib table to determine to forward this Interest bag from interface by node
Go out.If all not finding corresponding entry in above three table, routing node will abandon the Interest bags received without doing
Any processing.
Fib table under NDN frameworks have recorded the forwarding rule between node, and major function is to be used to forward Interest bags
To the node for potentially possessing Data bags, it is the Main Basiss of data routing forwarding.Its structure is main by name prefix
(Prefix) and interface list (Face List), it can be expressed simply as<Prefix,face1,face2,…,facem>, work
Make principle and structure closely similar with FIB in the router under traditional IP agreement.But it is different from the FIB in traditional IP agreement
It is that the routing forwarding in NDN uses name prefix matching, and an Interest bag can be forwarded from multiple interfaces.This
Parallel query can be supported well by planting design, and data are obtained from multiple data sources under NDN so as to realize.
Forwarding strategy is the new concept proposed in NDN.Unlike repeating process just looks at router in IP network
Directly transmitted after fib table, due to observing result both as dual input, NDN forwarding based on routing table and Data panel
Process is adapted to its forwarding decision.This forwarding based on bag granularity and it can be realized adaptively with stateful Data panel
Property forwarding, fundamentally change the performance of Internet.Good forwarding strategy can strengthen the robustness of bag transmission, make network
Utilize resource high-efficiency, have more preferable adaptability to dynamic network condition.
NDN project team proposes a kind of Best Route forwarding strategies, by ability point of the interface according to " obtaining Data bags "
For three classes：Green, yellow and red, carry out the forwarding of Interest bags using interface ranking, i.e., preferentially use top ranked
Green interface, such as fruit green interface is not present, then the preferential yellow interface using top ranked, from without using red interface
(representing interface invalid).Because the type of interface directly reflects the ability that the interface forwards Interest bags, Best Route
There is preferable adaptive ability to network condition.But, the switching of the green state of reddish yellow is not unusual fast and flexible, is lacked pair
The sharp perception of network state change.With the change of network state, the high interface of ranking may not be optimal forwarding
Interface, but network state change is insufficient to greatly.Worse situation is that the interface of top ranked has not been optimum interface, and
The corresponding circuit of the interface again it is poor to make the interface change color, then the interface will be forwarded always as optimum interface.
Therefore the ability that Best Route are perceived to environmental change is weaker, it is impossible to effectively utilizes multiple interfaces and realizes load balancing.
The content of the invention
The present invention provides a kind of method and corresponding forwarding terminal forwarded under information centre's network to interest bag.
According to the first aspect of the invention, a kind of information centre's network of present invention offer is for example named is based under data network
The probability forwarding method of comentropy, including：Network node is received after an Interest bag, is primarily based on the extraction of its fib table
Go out the corresponding all optional forwarding interfaces of the Interest bags；To all optional forwarding interfaces extracted, each row are determined
The value of plan attribute is normalized, and eliminates dimension impact；The power of each decision attribute is calculated using the method for comentropy
Weight values, the availability of each optional forwarding interface is calculated according to the decision attribute values after normalized and weighted value；It is based on
The static nature of the networks such as forwarding hop count calculates the forwarding performance of each optional forwarding interface；The interface obtained according to calculating can
The forwarding probability of each optional forwarding interface is calculated with rate and interface forwarding performance；Based on forwarding probability, from all optional turns
The Interest bags that the forwarding of some interface of probability selection is received in hair interface.
Described decision attribute includes the attribute that Interface status, round trip delay time etc. have different dimensions and implication, these category
Property can carry out laterally expand according to demand without influenceing the use of the probability forwarding method based on comentropy, and these are determined
The value of plan attribute can update as network condition and the actual use situation of interface carry out dynamic in real time.
In one embodiment, when being normalized, introduce " efficiency factor " to control some decision attribute values
Scope and the subjective decision-making degree for setting some decision attribute.
In one embodiment, when the method based on comentropy calculates the weighted value of each decision attribute, calculate first
The information entropy of each decision attribute, the comentropy obtained further according to the calculating is worth to each decision attribute
Weighted value.
In one embodiment, when calculating the availability of each optional forwarding interface, by the optional forwarding interface correspondence
The result of the normalized value weight that is multiplied by the decision attribute of each row decision attribute summed, this optional turn can be obtained
Send out the availability of interface.
In one embodiment, when calculating the forwarding performance of each optional forwarding interface, the forwarding performance reflects net
The static nature of network, it uses the features such as forwarding hop count, communication link capacity to be weighed.
In one embodiment, when calculating the forwarding probability of each optional forwarding interface, for any one optional turn
Interface is sent out, its described forwarding probable value is bigger, and the probability being selected during line interface selection forwarding is entered is bigger, described turn
Hair probability can play a part of balance network load.
In one embodiment, when calculating the forwarding probability of each forwarding interface, " coefficient of power amplifier " can be introduced to set
Determine network static feature and influence power of the interface behavioral characteristics to forwarding decision.
According to the second aspect of the invention, the present invention provides a kind of terminal, names emerging under data network for aiding in realizing
The retransmission method of interest bag, the fib table that the terminal possesses also is wrapped in addition to the structure under data network system is named with standard
An index list of pointers is included, for pointing to the corresponding decision attribute table of the corresponding all optional forwarding interfaces of the Interest
DAT。
The first row of the decision attribute table DAT represents the numbering of optional interface, and other row include Interface status, RTT
Multiple decision attributes such as delay, the corresponding attributive character value for representing the optional interface of correspondence, the value of the decision attribute can be with
Network condition and the actual use situation of interface etc. and carry out dynamic renewal in real time.
In one embodiment, the decision attribute table DAT can carry out laterally expand, by adding DAT table structures
Attribute column can flexibly increase the decision attribute that the probability forwarding method based on comentropy is considered.
The beneficial effects of the invention are as follows：By introducing decision attribute, and based on static nature of the decision attribute values to network
The calculating of forwarding probability is carried out with the behavioral characteristics of forwarding interface, thus considers to determine forwarding interface so that it is determined that
The forwarding interface gone out has very strong adaptivity to network transmission, and enhances the robustness of bag transmission so that Internet resources
It is able to efficiently utilize.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the accompanying drawing used required in technology description to be briefly described, wherein：
Fig. 1 is the schematic diagram of three class important data structures and its relation in NDN；
Fig. 2 a and Fig. 2 b are respectively the handling process schematic diagram of Interest bags in NDN and Data bags；
Fig. 3 is the schematic flow sheet of interest package transmitting method under NDN in an embodiment of the present invention；
Fig. 4 is γ parameter values 1, and δ parameters take the experimental result flowed in deadline and packet loss index during different value
Schematic diagram；
Fig. 5 is the false code figure of interface probability selection in an embodiment of the present invention；
Fig. 6 is the relation schematic diagram of the fib table and DAT tables of forwarding terminal in an embodiment of the present invention；
Fig. 7 is to be compared using the retransmission method of the present invention with the experiment of conventional method, which show client using change
The method of speed asks the handling capacity situation of a 4M file；
Fig. 8 is to be compared using the retransmission method of the present invention with the experiment of conventional method, which show client using change
The method of speed asks the flow distribution situation on the different links of a 4M file；
Fig. 9 is to be compared using the retransmission method of the present invention with the experiment of conventional method, which show client using change
The method of speed asks the stream deadline situation of different size file.
Figure 10 is to be compared using the retransmission method of the present invention with the experiment of conventional method, which show client using normal
Average data traffic conditions during the method demand file of speed；
Figure 11 is to be compared using the retransmission method of the present invention with the experiment of conventional method, which show client using normal
Network average packet loss ratio situation during the method demand file of speed at different rates.
Embodiment
Interest package transmitting method proposed by the present invention is applied to network (such as NDN) routing nodes centered on information
Receive all usage scenarios when needing to be forwarded according to its fib table after Interest bags.Below by specific embodiment party
Formula combination accompanying drawing is described in further detail to the present invention.
One embodiment of the present invention provides the method that interest bag is forwarded under NDN, and this method herein can be described as
Probability forwarding method based on comentropy, it comprises the following steps S1~S7, as shown in Figure 3.
Step S1：Network node is received after an Interest bag, if desired forwards the bag, then is primarily based on FIB and obtains
To the corresponding all optional forwarding interfaces of the Interest bags；
Step S2：Using each optional forwarding interface as process object, each row decision attribute possessed each interface
Value is normalized, and eliminates dimension impact；
Step S3：Method based on comentropy calculates the weighted value of each decision attribute；
Step S4：The dynamic of each optional forwarding interface is worth to according to the decision attribute values and weight after normalized
Utilization rate；
Step S5：The forwarding performance of each optional forwarding interface is calculated based on network topology characteristics such as forwarding hop counts；
Step S6：The forwarding that the interface utilization rate and forwarding performance obtained according to calculating obtains each optional forwarding interface is general
Rate；
Step S7：Based on forwarding probability, some optional forwarding interface of probability selection forwards the Interest bags.
Above-mentioned steps S1~S7 is described in detail below by way of a specific embodiment.
For step S1, network node is after an Interest bag is received, first according to the NDN workflows of standard
Handled, when the Interest bags need to be forwarded based on fib table, then the Interest bags are obtained from the fib table
The corresponding individual optional forwarding interface face of m (m >=2)1、face2、…、facem.In the present embodiment, " Interface status is had
N (n >=2) the individual decision attribute (Attribute) such as (Face Status) ", " RTT (Round Trip Time, round-trip delay) ",
The decision attribute table ultimately formed is as shown in table 1 below.In other embodiments, decision attribute can also include interface rate limit
Other attributes such as system, network service expense.
The decision attribute table of table 1
Wherein, " Face Status " continue to use the Color scheme in Best Route strategies, and green interface is represented with 1, yellow
Interface represents that red interface is represented with 3 with 2.
In the present embodiment, for step S2, the decision-making of each optional forwarding interface is belonged to using deviation standardized method
Property value is normalized, because in the present embodiment, decision attribute such as Face Status, RTT etc. is " negative sense index "
(i.e. property value is more big more is difficult to be selected in decision-making), during normalized, uses max { X*j}-XijHandled.It is as follows
Shown in formula (1).
Wherein, XijRepresent the optional forwarding interface face obtained based on step S1iCorresponding decision attribute Attributej
Value, min { X*jRepresent decision attribute AttributejThe minimum value of all decision attribute values of respective column, max { X*jRepresent
Decision attribute AttributejThe maximum of all decision attribute values of respective column, Xij' represent optional forwarding interface faceiCorrespondence
Decision attribute values XijPass through the result after normalized.
In another embodiment, in order to which the span and human subjective that set decision attribute set some decision attribute
Decision-making degree, when step S2 is normalized, also introduces " efficiency factor " and handled, equation below (2) institute
Show.
Wherein, αjFor described " efficiency factor ", 0≤αj≤ 1, the different α by settingjValue can change correspondence decision-making
The weight of attribute.
It is easily understood that the method for normalizing that step S2 is used is not limited to the deviation mark used in above-described embodiment
Quasi-ization method, can also use such as Z-score standardized methods, logarithm Logistic patterns, the other normalization sides of norm method
Method.
For step S3, there is step S3 in two kinds of implementations, a kind of implementation and specifically include：Normalization is calculated to determine
The sub-step S31 of the normalization result of plan property value, the sub-step S32 for calculating decision attribute entropy, calculate many of decision attribute
The sub-step S33 of sample dimension values, the sub-step S34 for calculating decision attribute weighted value.
For the sub-step S31 for the normalization result for calculating normalization decision attribute values, using equation below (3) to optional
Forwarding interface faceiCorresponding decision attribute values Xij' calculating is normalized again.
Wherein, Xij' it is optional forwarding interface face in step S2iCorresponding decision attribute values XijAfter being normalized
Decision attribute values, PijFor Xij' normalization result.In fact, sub-step S31 can also be put into step S2, i.e. step
The normalized value of S2 outputs can be using the value after such as deviation standardized method normalization or normalized
On the basis of introduce obtained value after efficiency factor, can also be and normalizing again is carried out after sub-step S31 is being put into step S2
The value of change.
Sub-step S32 for calculating decision attribute entropy, using equation below (4) to optional forwarding interface faceiIt is right
The decision attribute Attribute answeredjEntropy ejCalculated.
Wherein, variable k is entropy constant, and value is (lnm)-1, PijThe normalization result obtained for sub-step S31, works as Pij=
When 0, P is definedij*lnPij=0.
For the sub-step S33 for the diversified dimension value for calculating decision attribute, optional forwarding is connect using equation below (5)
Mouth faceiCorresponding decision attribute AttributejDiversified dimension value djCalculated.
dj=1-ej, j=1,2 ..., n (5)
Wherein ejObtained decision attribute Attribute is calculated for sub-step S32jEntropy.
Sub-step S34 for calculating decision attribute weighted value, using equation below (6) to optional forwarding interface facei
Corresponding decision attribute AttributejWeighted value ωjCalculated.
Wherein, djObtained decision attribute Attribute is calculated for sub-step S33jDiversified dimension value.
For step S4, in the present embodiment, decision attribute values and weight after based on normalized are worth to often
The face of individual optional forwarding interfacejDynamic utilization rate (availability) aiWhen, calculated using equation below (7).
Wherein, ωjObtained decision attribute Attribute is calculated for sub-step S34jWeighted value, Xij' in step S2
Optional forwarding interface faceiCorresponding decision attribute values XijResult after being normalized.
In another scheme, step S3 can not include sub-step S31, and only include step S32~S34, now, step
P in S32ijReplace with Xij′。
For step S5, it is necessary to calculate each optional forwarding interface face according to the static nature of networkjForwarding performance
Pi, in the present embodiment, use forwarding hop count μiTo weigh faceiForwarding performance, forwarding hop count it is bigger illustrate the interface obtain
The performance of data is poorer, therefore, the forwarding performance P of interfaceiCalculated using equation below (8).In other embodiments, also
Message capacity of link etc. can be used to be used as the index for weighing interface forwarding performance.
Wherein, PiRepresent optional forwarding interface faceiForwarding performance, μiRepresent optional forwarding interface faceiForwarding jump
Number.
For step S6, it is necessary to be obtained often according to the static nature (such as forwarding performance) of the dynamic utilization rate of interface and network
Individual optional forwarding interface faceiForwarding Probability pi, in the present embodiment, using equation below (9) to optional forwarding interface
faceiForwarding Probability piCalculated.
Wherein, aiRepresent that step S4 calculates obtained optional forwarding interface faceiDynamic utilization rate, PiRepresent step S5
Obtained optional forwarding interface faceiForwarding performance.
In another embodiment, each optional forwarding interface face is being calculatediForwarding Probability piWhen, introduce " power amplifier system
Number " γ and δ come setting network static nature and influence power of the interface behavioral characteristics to forwarding decision.The embodiment uses following public
Formula (10) is to each optional forwarding interface faceiForwarding Probability piCalculated.
" coefficient of power amplifier " γ and δ determine that the dynamic utilization rate of interface and the two indexs of interface forwarding performance are entirely being forwarded
Relative importance in interface selection.This causes retransmission method that more preferable interface can not only be selected to carry out turning for Interest bags
Hair, moreover it is possible to realize good load balancing effect.The different parameter value by setting, it is possible to achieve different forwarding effects and reality
Trample purpose.For example, a suitable γ value enables retransmission method preferably to detect multiple optional forwarding interfaces, so as to realize more
Good load balancing；The ratio that static routing information is occupied in forwarding interface can be increased when increasing δ values, so as to realize more
High handling capacity.Fig. 4 shows that γ=0.95, δ parameters take the different stream deadlines being worth to and packet loss (Drop Rate)
Experimental result in index.Fig. 7 to Figure 11 shows the experimental result of γ=0.95, δ=0.05, and hereafter Fig. 7-Figure 11 will be given
Go out to be described in detail.
For step S7, obtained calculating after the forwarding Probability p of each optional forwarding interface, it is necessary to be obtained based on calculating
Interface forwarding probability selects some interface to forward the Interest bags received with carrying out probability.In the present embodiment, adopt
With interface probability selection is realized similar to the wheel disc bet method in genetic algorithm, its false code is as shown in Figure 5.
Based on above-described embodiment, an embodiment of the present invention can also provide a kind of suitable for above-mentioned based on the general of comentropy
The forwarding terminal of rate retransmission method, its fib table possessed is in addition to the structure under with the standard NDN network systems, in addition to one
Individual index list of pointers (i.e. DAT indexes), for pointing to the corresponding decision-making of the corresponding all optional forwarding interfaces of the Interest bags
Attribute list DAT (Decision Attribute Table).The terminal is when performing above-mentioned retransmission method, based on note in fib table
Record obtains the corresponding DAT tables of the Interest bags, and table 6 illustrates the relation of fib table and DAT tables that the terminal possesses.DAT tables
One row represent the numbering (Face Number, abbreviation interface number) of optional forwarding interface, and its value derives from the Interest received
The record in fib table is wrapped, other row include multiple decision attributes such as " Interface status ", " RTT ", for representing optional turn of correspondence
The corresponding decision attribute values of interface are sent out, these decision attribute values can be carried out with network condition and the actual use situation of interface etc.
Dynamic updates in real time.In addition, DAT tables can carry out laterally expand, can flexibly it be increased by the attribute column for adding DAT table structures
The decision attribute that retransmission method is considered is without influenceing the execution flow of retransmission method.The specifically used of the forwarding terminal can join
The related content of retransmission method is stated before examination, is not repeated herein.
The retransmission method and conventional method of the present invention are made and compared below with reference to Fig. 7 to Figure 11, there it can be seen that adopting
The retransmission method EPF provided with the present embodiment, its flow the deadline (Finishing Time), handling capacity (Throughput),
Performance on packet loss (Drop Rate) and load balancing index is better than tradition Best Route strategies.
Fig. 7 is handling up for method one big small documents of 4M of request that client uses variable Rate according to network actual conditions
Amount, imaginary curve " EPF " be using handling capacity during probability forwarding method provided in an embodiment of the present invention based on comentropy, it is real bent
" Best Route " are the handling capacity obtained using tradition Best Route strategies to line.
Fig. 8 is that client asks what is obtained during the big small documents of a 4M according to network actual conditions using the method for variable Rate
" Best Route " are partly to be obtained using tradition BestRoute strategies for the left side in flow distribution situation on different links, figure
3 links on flow distribution, the right " EPF " is partly using provided in an embodiment of the present invention based on the general of comentropy in figure
The flow distribution on 3 links obtained during rate retransmission method.
When Fig. 9 is that client asks the stream completion of different size file according to network actual conditions using the method for variable Rate
Between, wherein, file size changes to 256M from 1M, and the curve " EPF " that triangle solid dot is linked to be is to be carried using the embodiment of the present invention
The different size of file corresponding stream deadline is asked during the probability forwarding method based on comentropy supplied, black circle is linked to be
Curve " during the stream completion that Best Route " are obtained when being using the different size of file of tradition Best Route strategy requests
Between.
Figure 10 is the average data flow that client asks to obtain during the file of 4M size using the method for constant speed rate,
Wherein, the file content of client request meets Zipf-Mandelbrot distributions, and the curve " EPF " that triangle solid dot is linked to be is
Client uses the corresponding average data flow obtained during different rates demand file, the curve " Best that black circle is linked to be
Route " is the average data flow that Best Route strategies are obtained.
Figure 11 is the average packet loss of network that client asks to obtain during the file of 4M size using the method for constant speed rate
Rate, wherein, the file content of client request meets Zipf-Mandelbrot distributions, the curve " EPF " that triangle solid dot is linked to be
The corresponding packet loss obtained when using different rates demand file for client, curve " the Best Route " that black circle is linked to be
The packet loss obtained for Best Route strategies.
To sum up, the present invention provides the interest package transmitting method and forwarding terminal under a kind of data network based on name, is entering
Row forwarding interface select when, the mode based on comentropy and probability selection that employs considered multiple dynamic network features with
Multiple static network features, being capable of the change of more sensitively adaptive network state, there is provided more preferable forward efficiency and handle up
Amount, and realize Network Load Balance.In addition, the present invention is also with good expansibility and " configurability ", such as shown in Fig. 6
In can to DAT tables carry out laterally expand.
It will be understood by those skilled in the art that all or part of step of various methods can pass through in above-mentioned embodiment
Program instructs related hardware to complete, and the program can be stored in a computer-readable recording medium, storage medium can be wrapped
Include：Read-only storage, random access memory, disk or CD etc..
Above content is to combine specific embodiment further description made for the present invention, it is impossible to assert this hair
Bright specific implementation is confined to these explanations.For general technical staff of the technical field of the invention, do not taking off
On the premise of from present inventive concept, some simple deduction or replace can also be made.
Claims (5)
1. a kind of method that interest bag is forwarded under information centre's network, data of interest of the interest bag correspondence with request and bag
Content name containing the data of interest, it is characterised in that methods described includes：
For interest bag to be forwarded, according to the content name of the interest bag, the interest bag is obtained from forwarding information storehouse
Corresponding all optional forwarding interfaces and each corresponding all decision attributes of forwarding interface and its respective decision-making
Property value, the decision attribute corresponds to the forwarding strategy when selecting forwarding interface and with the actual use of network condition and interface
Situation dynamically updates in real time, and the decision attribute includes Interface status and round-trip delay, and the decision attribute values describe correspondence
Forwarding interface obtain information ability；
Decision attribute values corresponding to each forwarding interface are normalized, and obtain normalized decision attribute values,
According to the normalized decision attribute values, each forwarding interface is calculated using the method based on comentropy corresponding each
The weighted value of decision attribute；
The dynamic utilization rate of each forwarding interface is calculated based on the weighted value, obtains each according to the static nature of network
The forwarding performance of the forwarding interface, each forwarding interface is calculated according to the dynamic utilization rate and the forwarding performance
Forward probability；
Based on the forwarding probability, probability selection goes out a forwarding interface to carry out from all optional forwarding interfaces
The forwarding of interest bag；
Wherein, the weight that the corresponding each decision attribute of each forwarding interface is calculated using the method based on comentropy
The step for value, includes：
The information entropy of each decision attribute is calculated, calculation formula is：Wherein, k entropy constants, take
It is worth for (lnm)-1, m represents the number of all optional forwarding interfaces, and n represents the number of all decision attributes, 1≤j≤n,
PijFor the decision attribute values of normalized final output, and work as PijWhen=0, P is definedij*lnPij=0；
The diversified dimension value d of each decision attribute is calculated according to described information entropyj, calculation formula is：dj=1-ej；
The weighted value ω of each decision attribute is calculated according to the diversified dimension valuej, calculation formula is：
Wherein, it is described each forwarding interface is calculated based on the weighted value dynamic utilization rate the step for include：For
Each forwarding interface, the corresponding normalized decision attribute values of the forwarding interface is multiplied by the weight of corresponding decision attribute
The result of value is summed, and obtains the dynamic utilization rate of the forwarding interface；
Wherein, the static nature of the network includes forwarding hop count, communication link capacity, when the static nature of the network is to turn
When sending out hop count, the forwarding performance P of each forwarding interfaceiForWherein 1≤i≤m, μiRepresent i-th of forwarding interface
Forwarding hop count；
Wherein, the forwarding Probability p of each forwarding interfaceiCalculation formula be：OrWherein aiThe dynamic utilization rate of each forwarding interface is represented, γ+δ=1, δ increase causes
The ratio increase that static routing information is occupied in the selection of forwarding interface.
2. the method as described in claim 1, it is characterised in that described to the corresponding decision attribute values of each forwarding interface
The step for being normalized includes：Decision attribute values are normalized using deviation standardized method.
3. method as claimed in claim 1 or 2, it is characterised in that described that the corresponding decision-making of each forwarding interface is belonged to
The step for property value is normalized includes：Decision attribute values X after normalizationij' obtained using equation below
<mrow>
<msubsup>
<mi>X</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
<mo>&prime;</mo>
</msubsup>
<mo>=</mo>
<mfrac>
<mrow>
<mi>max</mi>
<mo>{</mo>
<msub>
<mi>X</mi>
<mrow>
<mo>*</mo>
<mi>j</mi>
</mrow>
</msub>
<mo>}</mo>
<mo>-</mo>
<msub>
<mi>X</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
<mrow>
<mi>max</mi>
<mo>{</mo>
<msub>
<mi>X</mi>
<mrow>
<mo>*</mo>
<mi>j</mi>
</mrow>
</msub>
<mo>}</mo>
<mo>-</mo>
<mi>min</mi>
<mo>{</mo>
<msub>
<mi>X</mi>
<mrow>
<mo>*</mo>
<mi>j</mi>
</mrow>
</msub>
<mo>}</mo>
</mrow>
</mfrac>
<mo>*</mo>
<msub>
<mi>&alpha;</mi>
<mi>j</mi>
</msub>
<mo>+</mo>
<mrow>
<mo>(</mo>
<mn>1</mn>
<mo>-</mo>
<msub>
<mi>&alpha;</mi>
<mi>j</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>,</mo>
<mi>i</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mn>...</mn>
<mo>,</mo>
<mi>m</mi>
<mo>;</mo>
<mi>j</mi>
<mo>=</mo>
<mn>1</mn>
<mo>,</mo>
<mn>2</mn>
<mo>,</mo>
<mn>...</mn>
<mo>,</mo>
<mi>n</mi>
</mrow>
Wherein 0≤αj≤ 1, XijRepresent to be based on the corresponding decision attribute values of the forwarding interface, min { X*jRepresent the decision-making category
The minimum value of all decision attribute values of property value respective column, max { X*jRepresent decision attribute values respective column all decision attributes
The maximum of value.
4. a kind of be used for the forwarding terminal that interest bag is forwarded under information centre's network, the forwarding terminal includes forwarding information storehouse,
The forwarding information storehouse dynamically recording has content name corresponding with interest bag and forwarding interface, it is characterised in that the forwarding
Terminal is used for the method as described in claim any one of 1-3, and the forwarding terminal also includes decision attribute table, the decision-making category
Property correspondence select forwarding interface when forwarding strategy and dynamically updated in real time with network condition and the actual use situation of interface,
The forwarding information storehouse also dynamically recording has an Index pointer table, the Index pointer table be used to pointing to interest bag it is corresponding it is all can
The corresponding decision attribute table of forwarding interface of choosing.
5. forwarding terminal as claimed in claim 4, it is characterised in that when the decision attribute includes Interface status and be round
Prolong, the decision attribute values describe the ability that corresponding forwarding interface obtains information；The decision attribute table has extendible
Property.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410476456.5A CN104301305B (en) | 2014-09-17 | 2014-09-17 | Interest bag is forwarded under information centre's network method and forwarding terminal |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410476456.5A CN104301305B (en) | 2014-09-17 | 2014-09-17 | Interest bag is forwarded under information centre's network method and forwarding terminal |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104301305A CN104301305A (en) | 2015-01-21 |
| CN104301305B true CN104301305B (en) | 2017-10-24 |
Family
ID=52320873
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410476456.5A Active CN104301305B (en) | 2014-09-17 | 2014-09-17 | Interest bag is forwarded under information centre's network method and forwarding terminal |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104301305B (en) |
Families Citing this family (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105245448B (en) * | 2015-10-08 | 2018-05-08 | 中南民族大学 | Name multi-service Multi-path route optimization method in data network |
| US10355986B2 (en) | 2016-08-18 | 2019-07-16 | Peking University Shenzhen Graduate School | Method and apparatus for forwarding an interest packet based on a probability tree in an information network |
| CN106534360A (en) * | 2016-12-13 | 2017-03-22 | 重庆大学 | Content centric network routing method based on software definition |
| CN109150708B (en) * | 2018-08-28 | 2021-04-27 | 中国科学院计算机网络信息中心 | Method and device for selecting data forwarding interface |
| CN111200627A (en) * | 2018-11-20 | 2020-05-26 | 中兴通讯股份有限公司 | Method and device for determining transfer starting port of information center network |
| CN109450807B (en) * | 2018-11-28 | 2022-02-22 | 迈普通信技术股份有限公司 | Interface selection method and communication equipment |
| CN111770024B (en) * | 2020-07-03 | 2022-09-23 | 重庆邮电大学 | Interest packet forwarding interface selection method in named data network |
| CN113162863B (en) * | 2021-04-12 | 2022-08-02 | 河南科技大学 | Fair multipath routing method based on wheel disc algorithm |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102638405A (en) * | 2012-04-12 | 2012-08-15 | 清华大学 | Routing method of content-centric network strategy layer |
| CN103841018A (en) * | 2012-11-26 | 2014-06-04 | 华为技术有限公司 | Content centric network multiport forwarding method and router |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8762570B2 (en) * | 2012-02-21 | 2014-06-24 | Futurewei Technologies, Inc. | Method and apparatus for adaptive forwarding strategies in content-centric networking |
-
2014
- 2014-09-17 CN CN201410476456.5A patent/CN104301305B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102638405A (en) * | 2012-04-12 | 2012-08-15 | 清华大学 | Routing method of content-centric network strategy layer |
| CN103841018A (en) * | 2012-11-26 | 2014-06-04 | 华为技术有限公司 | Content centric network multiport forwarding method and router |
Non-Patent Citations (1)
| Title |
|---|
| Adaptive Forwarding in Named Data Networking;Cheng Yi,et al.;《ACM SIGCOMM Computer Communication Review》;20120731;第2-3、5节 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104301305A (en) | 2015-01-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104301305B (en) | Interest bag is forwarded under information centre's network method and forwarding terminal | |
| CN109150627A (en) | The construction method mapped based on dynamic resource demand and the virtual network of topology ambiguity | |
| CN106101223A (en) | A kind of caching method mated with node rank based on content popularit | |
| Yao et al. | Machine learning aided load balance routing scheme considering queue utilization | |
| CN104753797B (en) | A kind of content center network dynamic routing method based on selectivity caching | |
| CN105245448B (en) | Name multi-service Multi-path route optimization method in data network | |
| CN107317879A (en) | The distribution method and system of a kind of user's request | |
| CN104937901B (en) | For providing the method for the traffic engineering of routing and storage in the network of content oriented | |
| CN107094115A (en) | A kind of ant group optimization Load Balance Routing Algorithms based on SDN | |
| CN104038418B (en) | Method for routing, path detection mechanism and Message processing mechanism for mixed type topology data center | |
| Muralidharan et al. | PPT: A push pull traffic algorithm to improve QoS provisioning in IoT-NDN environment | |
| CN105262833A (en) | Cross-layer catching method and node of content centric network | |
| CN109067920A (en) | A kind of load balancing and method for routing for server content update | |
| CN103824127B (en) | Service self-adaptive combinatorial optimization method under cloud computing environment | |
| CN104022951B (en) | A kind of method for building up and system in network service path | |
| CN105262534B (en) | A kind of method for routing and device suitable for satellite communication network | |
| Sarasvathi et al. | QoS guaranteed intelligent routing using hybrid PSO-GA in wireless mesh networks | |
| CN104270312B (en) | Support relay route distribution system and method that flow optimization and application are perceived | |
| CN107454630A (en) | Load-balancing method and load balancing router | |
| Zhang et al. | Graph theory-based QoE-driven cooperation stimulation for content dissemination in device-to-device communication | |
| CN103729461B (en) | Releasing and subscribing method based on history recorded data mining | |
| Khan et al. | QPRD: QoS‐Aware Peering Routing Protocol for Delay‐Sensitive Data in Hospital Body Area Network | |
| Zhou et al. | A network selection scheme based on the analytic hierarchy process for marine internet | |
| Pu | Adaptive forwarding strategy based on MCDM model in named data networking | |
| CN107302571B (en) | The routing of information centre's network and buffer memory management method based on drosophila algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |