CN106534360A - Content centric network routing method based on software definition - Google Patents
Content centric network routing method based on software definition Download PDFInfo
- Publication number
- CN106534360A CN106534360A CN201611149215.5A CN201611149215A CN106534360A CN 106534360 A CN106534360 A CN 106534360A CN 201611149215 A CN201611149215 A CN 201611149215A CN 106534360 A CN106534360 A CN 106534360A
- Authority
- CN
- China
- Prior art keywords
- port
- forwarding
- probability
- content
- network
- 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
- 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
-
- 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/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
- H04L67/63—Routing a service request depending on the request content or context
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a content centric network routing method based on software definition. The method is as follows: network state information is dynamically collected through a controller; the forwarding probabilities of various matched ports in a content router are dynamically updated by utilization of the collected state information; then, the controller selects a port having the maximum forwarding probability from the matched ports as a forwarding port of an interest packet, and sends an instruction to the content router through a control channel; and, after a subsequent interest packet arrives at the content router and is matched with the forwarding port, the interest packet can be forwarded to the port having the maximum forwarding probability and appointed by the controller. By means of the method, the average delay of content requests can be reduced; the number of interest packets transmitted in a network can be reduced; and the network bandwidth overhead also can be reduced.
Description
Technical field
The present invention relates to content center network route field, particularly a kind of content center network road based on software definition
By method.
Background technology
CCN (Content Centric Network) is by the direct name to content resource, and is based on content name
Route carrying out the distribution and acquisition of content, its network node is except the route that has with legacy network nodes and forwarding
Outside ability, the function of storage content resource and service content request is also equipped with, joint behavior is higher.
CCN has two kinds of basic bag forms, i.e. interest bag (Interest Packet) and packet (Data Packet).
Interest bag is the content requests bag that requestor sends；Packet is that content service node (content publisher or network-caching) will
Content bag of the content transmission to requestor.Each routing node is required for safeguarding 3 category information tables, i.e. forwarding information table
(Forwarding Information Base, FIB), interest table undetermined (Pending Interest Table, PIT) and interior
Hold storage table (Content Store, CS).FIB saves content name prefix and reaches the next of the content of this prefix representative
Jump port；PIT have recorded the input port of interest bag, and the information table provides return path for packet；CS cachings flow through the section
The content resource of point simultaneously provides service for subsequent content request.Content publisher is in the way of flooding to network distributable content resource
Log-on message, arrival port of the routing node according to content name prefix and log-on message in the log-on message that receives
FIB is set up, routing node determines the forwarding port of interest bag by inquiring about FIB.
As initial FIB is set up by the way of flooding, and using link state data of the broadcast containing content name
The mode of bag updates the entry in FIB, therefore for same supplier has mulitpath arrival, in being embodied in FIB is exactly
The corresponding multiple forwarding ports of same content name prefix.In original CCN routing Designs, when routing node is searched in FIB
It is when there is multiple forwarding ports with regard to certain content name prefix, it will forward interest bag to all of forwarding port, this
During full pass-through mode can make network, flow increases and then easily causes the congestion of network, reduces network transmission efficiency.Other are commonly used
Repeater-transmitter be formed with random forwarding mechanism and shortest path forwarding mechanism.The routing node of random forwarding mechanism can be in FIB correspondences
In entry, random selection forwarding port carries out the forwarding of interest bag, although this method can effectively reduce the redundancy stream in network
Amount, reduction network overhead, but cannot ensureing, user can stablize, rapidly resource be obtained from optimum path, service quality is very
It is difficult to ensure card.In order to solve how to be route for the interest bag selection path in CCN, Chinese scholars have carried out numerous studies.
The CCN routing plans of content oriented title：Name state of data link route (Named-data Link State
Routing, NSLR) state LSA (Link State Advertisement) to set up network topology by broadcasting link state
With the accessibility of propagating contents name prefix.When link breaks down or during fault recovery, and local content supplier note
When the content name prefix of volume changes, content router all can broadcast LSA in network.The LSA of NLSR broadcast includes two
Kind, that is, adjoin LSA and prefix LSA.Adjacent LSA is used for stating all links being connected with certain content router that prefix LSA is used for
Some content name prefix that statement is registered on certain content router.Each content router can periodically refresh it
LSA to be broadcasted each content router maintains a LSD (Link State Database), stores receive all
LSA.When multiple next-hop interfaces are embroidered with before a certain content name, for all next-hop interfaces of the content name prefix,
First retain some interface, delete other total interfaces, then calculated using dijkstra's algorithm and certain is reached using this interface
The cost of individual destination node.Process above is all repeated to all next-hop interfaces of the content name prefix, utilization is calculated
Each interface reaches the cost of certain destination node.Afterwards, certain target is reached using each next-hop interface computed above
All next-hop interfaces are ranked up by the cost of node.For each destination node repeats above procedure, until it reaches
Content provider.The routing mechanism can effectively reduce redundant flow in network, but each content router is next to each
Jumper connection mouth is required to calculate corresponding cost one by one, when next-hop port is more or during longer routed path, complexity is larger.
The CCN routing plans of caching towards in net：CATT (Cache Aware Target idenTification) is by one
Individual or multiple CATT nodes CATN (Cache Aware Target Node) are deployed in the edge of Autonomous Domain, the quantity of CATN by
The size of Autonomous Domain is determined.It is all with the position for knowing its local CATN per family in the Autonomous Domain, and by oneself
Hold resource to be published on CATN.Any request is all forwarded on the local CATN in its Autonomous Domain first, receives request
CATN whether there is corresponding contents resource in first looking for its local cache, if it does, responding rapidly to request；If do not deposited
CATN is forwarded requests in adjacent CATN.CATT is employed will be slow in the initial content resource of content provider and net
The all cached copies deposited are integrated in routing procedure, improve the availability of caching in net.The mechanism is also content simultaneously
Caching adaptive looks for mechanism and the routing mechanism for closing on degree and content quality based on content there is provided a kind of.Should
Routing mechanism is obtained in that the routing performance of a near optimal, but routing procedure is more complicated.
The CCN routing plans of service-oriented quality：SoCCeR(Services over Content-Centric
Routing) routing mechanism is realized by a detecting layer is increased in the Internet of CCN.SoCCeR is based on ant group optimization
Algorithm (Ant Conley Optimal, ACO).The process that ACO algorithm simulations mother ant is looked for food, is looked for food using each pathfinding of Formica fusca
When the pheromone that stays the Formica fusca that the different directions towards same place of looking for food are looked for food is converged on paths, SoCCeR is sharp
With this characteristic of ACO, content requests Route Selection in CCN networks is extended.One content name prefix is reflected by the FIB of CCN
Several service available next-hop ports are mapped to, the select permeability of route is selected from these service available ports
One optimal port completes current content requests.The factors such as load, path congestion, bandwidth, shake are considered during selection port.
SoCCeR increased a pheromone table, and this table is associated with content name prefix, it is possible to provide the port of service, and each clothes
The pheromone value of business port.Fib table chooses pheromone value highest port as unique routed port.SoCCeR periodically can be released
Collect the status information of each serve port with putting detection bag.The algorithm can optimize the forwarding port for being routed to light load, make
Service request selectively route, and the state change to network and service has compared with high-adaptability, but cycle release detection
Bag increased the expense of network
Accordingly, it would be desirable to a kind of content center network method for routing based on software definition.
The content of the invention
An object of the present invention is to propose a kind of content center network method for routing based on software definition, is solved existing
The content distribution efficiency that the full pass-through mode of content center network brings is low, and it is a series of that redundant data is more and network overhead is larger etc.
Problem.The method passes through controller collection network state, and in the forwarding probability of each forwarding port of controller end calculating, and will be emerging
Interest forwards a packet to the method for routing of the port of the forwarding probability for forwarding maximum probability.
The purpose of the present invention is achieved through the following technical solutions：
The content center network method for routing based on software definition that the present invention is provided, including controller, requestor and carry
Donor；Comprise the following steps：
First, collection network status information：Controller by control channel dynamically collection network status information, and according to
Network state information dynamicallys update the forwarding probability of the matching port of each content router using forwarding probability updating algorithm；
The network state information includes that packet reaches the propagation delay time of server, current routing node from present node
Server node load in the load of next-hop and the path；
Secondly, update port forwarding probability：The forwarding probability updating algorithm, be input into the network state information and each
The current forwarding probability of port, the forwarding probability of each port after being output as updating；
Finally, the existence according to interest bag in content router enter to be about to interest bag be forwarded to port forwarding probability
Maximum port.
Further, during collection network status information, during if there is following two situations, network element can be led
Trend controller reporting state：
(1) node or link failure：When node or link failure, the forwarding probability towards all of the port of the node will
It is zeroed out, is set to unreachable, when link failure, the forwarding probability of the two ends port connected by the link will be zeroed out, and be set to
It is unreachable；
(2) new content provider adds：When there is new content provider to add, can be in the content for connecting the supplier
Increase a forwarding port in the forwarding information table of router and by current forwarding probability zero setting, wait updates next time.
Further, the step in the forwarding probability updating algorithmic procedure is specific as follows：
The state comprehensive parameters of each port are calculated according to below equation using method of weighting：
Wherein, α, beta, gamma andT (i), H (i), L are represented respectivelyR(i) and LSThe weight of (i)；
T (i) represents the time delay from port i to content provider；
H (i) represents the path from port i to content provider；
LRI () represents the load of port i next-hop content routers；
LSI () represents the load of the content provider corresponding to the i of port；
State comprehensive parameters are normalized according to below equation and obtain increasing probability：
Wherein, ρ is the weight of network state；
Forwarding probability is updated according to below equation：
Pnew(i)=(1- ρ) * Pold(i)+ρ*ΔP(i)；
Wherein, PnewI () represents the forwarding probability before port i renewals；PoldI () represents the forwarding probability after port i renewals.
Further, the renewal port forwarding probability is comprised the following steps that：
Calculate the state comprehensive parameters of each port first according to the network state collected using method of weighting,
Then the parameter is normalized and obtains increasing probability,
Forwarding after being updated using method of weighting finally according to normalized growth probability and current forwarding probability
Probability；
After obtaining the forwarding probability of each port, controller would choose from forward maximum probability port under send instructions,
The routing node of datum plane will perform corresponding forwarding mechanism according to instruction.
Further, the forwarding mechanism of the forwarding interest bag includes two kinds of situations：
One is when interest bag has occurrence in content router, then interest bag to be forwarded to port forwarding probability most
Big port, the port are specified by controller；
If two when being that interest bag does not have occurrence in content router, interest bag will be forwarded to controller,
A shortest path is selected to be forwarded by controller.
The second object of the present invention is achieved through the following technical solutions：
As a result of above-mentioned technical proposal, the present invention has the advantage that：
The content center network method for routing based on software definition that the present invention is provided, using controller dynamic collection network
Status information, and using the forwarding probability of each matching port in the status information dynamic update content router collected.With
Afterwards, controller selects the port of forwarding maximum probability from matching port as the forwarding port of interest bag, and by controlling letter
Road sends instructions under content router.After follow-up interest bag reaches content router and matches forwarding port, can be toward control
The port forwarding interest bag of the forwarding maximum probability that device is specified.This method can reduce the average delay of content requests, can drop
The interest bag number transmitted in low network, can also reduce network bandwidth expense.
Other advantages of the present invention, target and feature will be illustrated to a certain extent in the following description, and
And to a certain extent, based on being will be apparent to investigating hereafter to those skilled in the art, Huo Zheke
To be instructed from the practice of the present invention.The present invention target and other advantages can be realized by description below and
Obtain.
Description of the drawings
The description of the drawings of the present invention is as follows.
Fig. 1 is 14 node network topologies for carrying out being used when network overhead is emulated；
Fig. 2 is the contrast of the average request time delay of four kinds of mechanism when offered load changes；
When Fig. 3 is that average bag arrival rate changes, the contrast of the interest bag number circulated in the network of four kinds of mechanism；
When Fig. 4 is requestor's number change, the contrast of the transmission bandwidth expense of four kinds of mechanism；
Fig. 5 is in SD-STAR embodiments flowchart of the present invention.
Specific embodiment
The invention will be further described with reference to the accompanying drawings and examples.
Embodiment 1
As illustrated, the content center network method for routing based on software definition that the present embodiment is provided, including controller,
Requestor and supplier, requestor are demand for services persons, and it expresses the content requirements of oneself by sending interest bag to network, and
Supplier is ISP, and, by the content requests of returned data bag respond request person, controller is the manager of network for it,
It plans the routed path of interest bag and interest bag by the status information of collection network；Comprise the following steps：
First, collection network status information：Controller by control channel dynamically collection network status information, and according to
Network state information dynamicallys update the forwarding probability of the matching port of each content router using forwarding probability updating algorithm；
The network state information includes that packet reaches the propagation delay time of server, current routing node from present node
Server node load in the load of next-hop and the path；
Secondly, update port forwarding probability：The forwarding probability updating algorithm, be input into the network state information and each
The current forwarding probability of port, the forwarding probability of each port after being output as updating；In the mistake of collection network status information
Cheng Zhong, during if there is following two situations, network element can be actively to controller reporting state：(1) node or link failure：
When node or link failure, the forwarding probability towards all of the port of the node will be zeroed out, be set to it is unreachable, when link therefore
During barrier, the forwarding probability of the two ends port connected by the link will be zeroed out, and be set to unreachable；(2) new content provider adds
Enter：When there is new content provider to add, one can be increased in the forwarding information table of content router of the supplier is connected
Individual forwarding port by current forwarding probability zero setting, wait updates next time.
Finally, the existence according to interest bag in content router enter to be about to interest bag be forwarded to port forwarding probability
Maximum port.The forwarding mechanism of the forwarding interest bag includes two kinds of situations：One is deposited in content router when interest bag
In occurrence, then interest bag is forwarded to into the port that port forwards maximum probability, the port is specified by controller；Two be as
When fruit interest bag does not have occurrence in content router, then interest bag will be forwarded to controller, select one by controller
Bar shortest path is forwarded.
Step in the forwarding probability updating algorithmic procedure is specific as follows：
The state comprehensive parameters of each port are calculated according to below equation using method of weighting：
Wherein, α, beta, gamma andT (i), H (i), L are represented respectivelyR(i) and LSThe weight of (i)；
T (i) represents the time delay from port i to content provider；
H (i) represents the path from port i to content provider；
LRI () represents the load of port i next-hop content routers；
LSI () represents the load of the content provider corresponding to the i of port；
State comprehensive parameters are normalized according to below equation and obtain increasing probability：
Wherein, ρ is the weight of network state；
Forwarding probability is updated according to below equation：
Pnew(i)=(1- ρ) * Pold(i)+ρ*ΔP(i)；
Wherein, PnewI () represents the forwarding probability before port i renewals；PoldI () represents the forwarding probability after port i renewals.
The renewal port forwarding probability is comprised the following steps that：
Calculate the state comprehensive parameters of each port first according to the network state collected using method of weighting,
Then the parameter is normalized and obtains increasing probability,
Forwarding after being updated using method of weighting finally according to normalized growth probability and current forwarding probability
Probability；
After obtaining the forwarding probability of each port, controller would choose from forward maximum probability port under send instructions,
The routing node of datum plane will perform corresponding forwarding mechanism according to instruction.
Embodiment 2
The renewal port forwarding probability that the present embodiment is provided, after the network state information in a cycle is collected to be finished,
Controller will respectively forward the forwarding probability of port according to the updating network state collected.Without loss of generality, it is assumed that need to update
Port i on certain router, lists the implication of the parameter for using in following table：
| Parameter | Implication |
| T(i) | Time delay from port i to content provider |
| H(i) | Path from port i to content provider |
| LR(i) | The load of port i next-hop content routers |
| LS(i) | The load of the content provider corresponding to the i of port |
| Pold(i) | Forwarding probability before port i renewals |
| Pnew(i) | Forwarding probability after port i renewals |
For all matchings forwarding ports corresponding to certain content name prefix in certain content router, they turn
Send out probability and be 1.Assume that P (i) represents the forwarding probability of port i, N is that certain content name prefix institute is right in the content router
The matching forwarding port number answered, then have：
Controller calculates the state comprehensive parameters of each port according to the network state collected using method of weighting first：
Wherein α, β, γ andRepresent T (i) respectively, the weight of H (i), LR (i) and LS (i), α, beta, gamma andValue can be according to
It is adjusted according to different network demands.Here four network state factors are only enumerated, thus the weight of four factors and be 1,
I.e.
Then the parameter is normalized and obtains increasing probability：
Consider the mutability of network, we update the forwarding probability of port using the method for weighting, and ρ is the power of network state
Weight, if ρ is closer to 0, then it represents that the forwarding probability after renewal is affected by network state closer to the forwarding probability before renewal
It is less；If ρ is closer to 1, then it represents that the forwarding probability after renewal is affected larger by network state, and more new formula is as follows：
Pnew(i)=(1- ρ) * Pold(i)+ρ*ΔP(i)
It should be noted that when there are following two situations, method for routing will perform following operation：(1) node or chain
Road failure：When node or link failure, the forwarding probability of all of the port towards the node will be zeroed out by controller, be set to
It is unreachable；When link failure, the forwarding probability of by the controller two ends port connected by the link will be zeroed out, and being set to can not
Reach.
(2) new content provider adds：When there is new content provider to add, controller will connect the offer
Increase a forwarding port in the forwarding information table of the content router of person and by current forwarding probability zero setting, wait next time
Update.
Forwarding after being updated using method of weighting finally according to normalized growth probability and current forwarding probability
Probability.After obtaining the forwarding probability of each port, controller would choose from forward maximum probability port under send instructions, data
The routing node of plane will perform corresponding forwarding mechanism according to instruction.
The forwarding mechanism that the present embodiment is provided includes two kinds of situations：When interest bag has occurrence in content router
When, then interest bag being forwarded to into the port that port forwards maximum probability, the port is specified by controller；If including interest bag
When there is no occurrence in holding router, the interest bag will be forwarded to controller, most short for its selection by controller
Path is forwarded.
Forwarding interest bag：When an interest bag reaches content router, content router can be extracted from the interest bag
Content name has simultaneously searched whether corresponding content in content storage table, if it has, content is returned to into requestor directly then,
And interest bag is abandoned.If it is not, whether record accordingly in continuing to search for interest table undetermined, if it has, then by interest
Bag is abandoned, and the input port of interest bag is added in the relevant entry in interest table undetermined.If it is not, in interest undetermined
Increase bar program recording input port in table, and occurrence has been searched whether in forwarding interest table, if it has, then turning interest bag
The forwarding port that controller is specified is sent to, the forwarding port has maximum forwarding probability.If it is not, interest bag is forwarded
To controller, a most short forward-path is specified for which by controller.
Embodiment 3
The present embodiment illustrates technique effect by experiment simulation, and emulation topology is as shown in figure 1, simulation parameter is arranged：Link
Bandwidth 100Gbps, requestor's number 3000, user bandwidth demand obey Poisson distribution, and average demand is 40Mbps, total request frequency
The weight α of 100-1000 per second, T (i) of rate, H (i), LR (i) and LS (i), beta, gamma andIt is set to 0.4,0.2,0.2 He
0.2, weight ρ of network state is set to 0.5.And by this method and traditional random forwarding mechanism, shortest path under equal ambient
Footpath forwarding mechanism and full forwarding mechanism are contrasted.
The present embodiment can reduce the average delay of content requests.As shown in Fig. 2 with the increase of offered load, four kinds
The content requests average delay of routing mechanism gradually increases.This is as with the increase of offered load, network occurs congestion
Probability increases, and causes the time delay of network to increase.Relative analyses are can be seen that in four kinds of routing mechanisms, average delay minimum
It is the content center network method for routing SD-STAR based on software definition.This is because SD-STAR when routed path is selected is
Prioritizing selection forwarding maximum probability port forwarded, and forward probability size reflection be the path network state
Quality, so its content requests average delay is minimum.
The interest bag number that the present embodiment is transmitted in can also reducing network.As shown in figure 3, with average bag arrival rate
Increase, the quantity of the network circulation interest bag of four kinds of routing mechanisms gradually increases.This is because with average bag arrival rate
Increase, network interest bag number is reached in the unit interval and is increased.Relative analyses are can be seen that in four kinds of routing mechanisms, network flow
Logical interest bag minimum number is shortest path forwarding mechanism SPF, next to that the content center network road based on software definition
By method SD-STAR, and both are closely；The path that SD-STAR selects network state optimum is forwarded, and this path may
It is not that jumping figure is minimum, and SPF is the port forwarding interest bag for selecting jumping figure minimum, therefore circulate in the network of operation SD-STAR
Interest bag number ratio is more than SPF.
This quantity can also reduce network bandwidth expense.As shown in figure 4, with the increase of number of users, four kinds of routers
The network bandwidth overhead of system gradually increases, and works as number of users and reach a timing, and bandwidth cost tends to be steady.This is because
The link bandwidth of network is certain, and when the total bandwidth need of user reaches link bandwidth threshold value, bandwidth cost will tend to most
It is big to be worth.Relative analyses, the bandwidth cost minimum of four kinds of routing policies is shortest path forwarding mechanism SPF, next to that based on soft
The content center network method for routing SD-STAR of part definition, and both are closely.The path that SPF selects jumping figure minimum is carried out
Forwarding, the link circuit resource of occupancy are minimum, and bandwidth cost is also minimum；The path that SD-STAR selects network state optimum is forwarded,
This path may not be that jumping figure is minimum, therefore the link circuit resource shared by which is more than SPF, and bandwidth cost is bigger than SPF, but the two is non-
Very close to.
The transmission of the control information that the present embodiment is provided is selected with outer link, as shown in figure 5, Fig. 5 is based on software definition
Content center network method for routing particular flow sheet, comprise the following steps that：
Step 501：When network is initial, in the content registration stage, content provider 1 issues content Content accessibility letter
Breath, the information broadcasted in a network, each content router A, B, C and D accordingly setting up respective forwarding information table FIB,
Controller is that all forwarding ports of listing of Content in the FIB on same content router give identical forwarding probability.
Step 502：Controller collection network status information (5.1,5.2,5.3,5.4,5.5,5.6), and according to these shapes
State information updates the forwarding probability of each port in controller end, and the end of maximum probability is forwarded in obtaining each content router
Mouthful, by sending instructions under control channel (5.7,5.8,5.9,5.10).
Step 503：After requestor 1 and 2 sends the interest bag of request content Content (5.11,5.12), when interest bag
After reaching content router A, in first retrieving CS, whether there is content Content, the returned data if having, and interest bag is abandoned, if
Whether there is the record of the interest bag in then not retrieving PIT, if having the input port of the interest bag is recorded in the corresponding bars of PIT
In mesh, and interest bag is abandoned, a new entry is created if not, the interest bag input port is recorded.After PIT has been retrieved,
FIB is retrieved just.When there is the entry of content Content in FIB, the forwarding port that the interest bag can be specified from controller
Forward, the port has maximum forwarding probability, in the present embodiment, the forwarding that controller is specified in content switch A
Port is PortA-C, and the forwarding port that controller is specified in content switch C is PortC- suppliers 1, and interest bag will hop-by-hop
Be forwarded to supplier 1 (5.13,5.14).
Step 504：Content provider 1 can be sent comprising content Content after receiving the interest bag of request content Content
Packet.The packet be back at requestor 1 and requestor 2 according to mono- tunnels of PIT of content router C and A (5.15,
5.16,5.17,5.18), complete content requests.
Finally illustrate, above example is only unrestricted to illustrate technical scheme, although with reference to compared with
Good embodiment has been described in detail to the present invention, it will be understood by those within the art that, can be to the skill of the present invention
Art scheme is modified or equivalent, and without deviating from the objective and scope of the technical program, which all should be covered in the present invention
Protection domain in the middle of.
Claims (5)
1. a kind of content center network method for routing based on software definition, including controller, requestor and supplier；Its feature
It is：Comprise the following steps：
First, collection network status information：Controller passes through control channel dynamically collection network status information, and according to network
Status information dynamicallys update the forwarding probability of the matching port of each content router using forwarding probability updating algorithm；
It is next that the network state information includes that packet reaches the propagation delay time of server, current routing node from present node
Server node load in the load of jump and the path；
Secondly, update port forwarding probability：The forwarding probability updating algorithm, is input into the network state information and each port
Current forwarding probability, be output as update after each port forwarding probability；
Finally, the existence according to interest bag in content router enter to be about to interest bag be forwarded to port forwarding maximum probability
Port.
2. the content center network method for routing based on software definition as claimed in claim 1, it is characterised in that：In collecting net
During network status information, during if there is following two situations, network element can be actively to controller reporting state：
(1) node or link failure：When node or link failure, the forwarding probability towards all of the port of the node will be set to
Zero, it is set to unreachable, when link failure, the forwarding probability of the two ends port connected by the link will be zeroed out, and being set to can not
Reach；
(2) new content provider adds：When there is new content provider to add, can be in the contents construction for connecting the supplier
Increase a forwarding port in the forwarding information table of device and by current forwarding probability zero setting, wait updates next time.
3. the content center network method for routing based on software definition as claimed in claim 1, it is characterised in that：The forwarding
Step in probability updating algorithmic procedure is specific as follows：
The state comprehensive parameters of each port are calculated according to below equation using method of weighting：
Wherein, α, beta, gamma andT (i), H (i), L are represented respectivelyR(i) and LSThe weight of (i)；
T (i) represents the time delay from port i to content provider；
H (i) represents the path from port i to content provider；
LRI () represents the load of port i next-hop content routers；
LSI () represents the load of the content provider corresponding to the i of port；
State comprehensive parameters are normalized according to below equation and obtain increasing probability：
Wherein, ρ is the weight of network state；
Forwarding probability is updated according to below equation：
Pnew(i)=(1- ρ) * Pold(i)+ρ*ΔP(i)；
Wherein, PnewI () represents the forwarding probability before port i renewals；PoldI () represents the forwarding probability after port i renewals.
4. the content center network method for routing based on software definition as claimed in claim 1, it is characterised in that：The renewal
Port forwarding probability is comprised the following steps that：
Calculate the state comprehensive parameters of each port first according to the network state collected using method of weighting,
Then the parameter is normalized and obtains increasing probability,
Forwarding probability after being updated using method of weighting finally according to normalized growth probability and current forwarding probability；
After obtaining the forwarding probability of each port, controller would choose from forward maximum probability port under send instructions, data
The routing node of plane will perform corresponding forwarding mechanism according to instruction.
5. the content center network method for routing based on software definition as claimed in claim 1, it is characterised in that：The forwarding
The forwarding mechanism of interest bag includes two kinds of situations：
One is when interest bag has occurrence in content router, then interest bag to be forwarded to port forwarding maximum probability
Port, the port are specified by controller；
If two when being that interest bag does not have occurrence in content router, interest bag will be forwarded to controller, by controlling
Device processed selects a shortest path to be forwarded.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611149215.5A CN106534360A (en) | 2016-12-13 | 2016-12-13 | Content centric network routing method based on software definition |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611149215.5A CN106534360A (en) | 2016-12-13 | 2016-12-13 | Content centric network routing method based on software definition |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106534360A true CN106534360A (en) | 2017-03-22 |
Family
ID=58343271
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611149215.5A Pending CN106534360A (en) | 2016-12-13 | 2016-12-13 | Content centric network routing method based on software definition |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106534360A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107454142A (en) * | 2017-06-29 | 2017-12-08 | 北京邮电大学 | Non- the obstruction content buffering method and device of a kind of content router |
| CN108289062A (en) * | 2017-12-21 | 2018-07-17 | 北京邮电大学 | A kind of information centre's network structure based on software definition |
| CN108833468A (en) * | 2018-04-27 | 2018-11-16 | 广州西麦科技股份有限公司 | Method for processing video frequency, device, equipment and medium based on mobile edge calculations |
| CN109150708A (en) * | 2018-08-28 | 2019-01-04 | 中国科学院计算机网络信息中心 | The selection method and device of data forwarding interface |
| CN109561057A (en) * | 2017-09-27 | 2019-04-02 | 中兴通讯股份有限公司 | A kind of content distributing network entities business processing method, apparatus and system |
| CN110391980A (en) * | 2018-04-16 | 2019-10-29 | 中兴通讯股份有限公司 | A kind of data forwarding method, routing device and computer storage medium |
| CN111314223A (en) * | 2020-02-25 | 2020-06-19 | 北京工业大学 | Routing interface ranking-based forwarding method in NDN (named data networking) |
| CN111786976A (en) * | 2020-06-22 | 2020-10-16 | 上海交通大学 | Interest packet flooding attack detection system based on path aggregation in NDN (named data networking) network |
| CN112003907A (en) * | 2020-08-04 | 2020-11-27 | 北京大学深圳研究生院 | Deterministic forwarding method for network resource demand and computational power demand thereof |
| CN112187642A (en) * | 2019-11-27 | 2021-01-05 | 谷歌有限责任公司 | Weighted bandwidth allocation for adaptive routing |
| CN115529240A (en) * | 2022-08-18 | 2022-12-27 | 北京邮电大学 | Network optimization method combining content caching and transmission routing |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102638405A (en) * | 2012-04-12 | 2012-08-15 | 清华大学 | Routing method of content-centric network strategy layer |
| US20130286846A1 (en) * | 2012-04-25 | 2013-10-31 | Juniper Networks, Inc. | Path weighted equal-cost multipath |
| CN104301305A (en) * | 2014-09-17 | 2015-01-21 | 北京大学深圳研究生院 | Interest packet forwarding method and terminal in information center network |
| CN104604205A (en) * | 2012-02-21 | 2015-05-06 | 华为技术有限公司 | Method and apparatus for adaptive forwarding strategies in content-centric networking |
-
2016
- 2016-12-13 CN CN201611149215.5A patent/CN106534360A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104604205A (en) * | 2012-02-21 | 2015-05-06 | 华为技术有限公司 | Method and apparatus for adaptive forwarding strategies in content-centric networking |
| CN102638405A (en) * | 2012-04-12 | 2012-08-15 | 清华大学 | Routing method of content-centric network strategy layer |
| US20130286846A1 (en) * | 2012-04-25 | 2013-10-31 | Juniper Networks, Inc. | Path weighted equal-cost multipath |
| CN104301305A (en) * | 2014-09-17 | 2015-01-21 | 北京大学深圳研究生院 | Interest packet forwarding method and terminal in information center network |
Non-Patent Citations (1)
| Title |
|---|
| 蔡岳平 等: "内容中心网络状态感知路由涉及", 《通信学报》 * |
Cited By (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107454142A (en) * | 2017-06-29 | 2017-12-08 | 北京邮电大学 | Non- the obstruction content buffering method and device of a kind of content router |
| CN107454142B (en) * | 2017-06-29 | 2019-06-07 | 北京邮电大学 | A kind of non-obstruction content buffering method and device of content router |
| CN109561057A (en) * | 2017-09-27 | 2019-04-02 | 中兴通讯股份有限公司 | A kind of content distributing network entities business processing method, apparatus and system |
| CN108289062B (en) * | 2017-12-21 | 2020-07-28 | 北京邮电大学 | Information center network system based on software definition |
| CN108289062A (en) * | 2017-12-21 | 2018-07-17 | 北京邮电大学 | A kind of information centre's network structure based on software definition |
| CN110391980A (en) * | 2018-04-16 | 2019-10-29 | 中兴通讯股份有限公司 | A kind of data forwarding method, routing device and computer storage medium |
| CN108833468B (en) * | 2018-04-27 | 2021-05-11 | 广州西麦科技股份有限公司 | Video processing method, device, equipment and medium based on mobile edge calculation |
| CN108833468A (en) * | 2018-04-27 | 2018-11-16 | 广州西麦科技股份有限公司 | Method for processing video frequency, device, equipment and medium based on mobile edge calculations |
| CN109150708A (en) * | 2018-08-28 | 2019-01-04 | 中国科学院计算机网络信息中心 | The selection method and device of data forwarding interface |
| CN109150708B (en) * | 2018-08-28 | 2021-04-27 | 中国科学院计算机网络信息中心 | Method and device for selecting data forwarding interface |
| US11765072B2 (en) | 2019-11-27 | 2023-09-19 | Google Llc | Weighted bandwidth allocation for adaptive routing |
| CN112187642B (en) * | 2019-11-27 | 2022-06-14 | 谷歌有限责任公司 | Weighted bandwidth allocation for adaptive routing |
| CN112187642A (en) * | 2019-11-27 | 2021-01-05 | 谷歌有限责任公司 | Weighted bandwidth allocation for adaptive routing |
| CN111314223A (en) * | 2020-02-25 | 2020-06-19 | 北京工业大学 | Routing interface ranking-based forwarding method in NDN (named data networking) |
| CN111786976A (en) * | 2020-06-22 | 2020-10-16 | 上海交通大学 | Interest packet flooding attack detection system based on path aggregation in NDN (named data networking) network |
| CN112003907A (en) * | 2020-08-04 | 2020-11-27 | 北京大学深圳研究生院 | Deterministic forwarding method for network resource demand and computational power demand thereof |
| CN115529240A (en) * | 2022-08-18 | 2022-12-27 | 北京邮电大学 | Network optimization method combining content caching and transmission routing |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106534360A (en) | Content centric network routing method based on software definition | |
| Tang et al. | On removing routing protocol from future wireless networks: A real-time deep learning approach for intelligent traffic control | |
| US10057158B2 (en) | Control device discovery in networks having separate control and forwarding devices | |
| EP2985971B1 (en) | Reputation-based instruction processing over an information centric network | |
| US9503360B2 (en) | Method and apparatus for traffic engineering in shortest path bridged networks | |
| JP5975083B2 (en) | COMMUNICATION SYSTEM, CONTROL DEVICE, PACKET TRANSFER ROUTE CONTROL METHOD, AND PROGRAM | |
| CN106789648B (en) | Software defined network route decision method based on content storage and Network status | |
| EP1499074B1 (en) | Dynamic routing through a content distribution network | |
| EP2552059A1 (en) | Packet transfer system, control apparatus, transfer apparatus, method of creating processing rules, and program | |
| US9401868B2 (en) | Method of traffic engineering for provisioning routing and storage in content-oriented networks | |
| CN106059941B (en) | A kind of backbone network traffic scheduling method for eliminating link congestion | |
| CN101155131A (en) | Method for establishing label switched path of minimized path preemption cost | |
| CN104883304B (en) | For part entangled quantum to the method for routing of bridge communications network | |
| CN106533733A (en) | CCN collaborative cache method and device based on network clustering and Hash routing | |
| CN105471747B (en) | A kind of intelligent router route selecting method and device | |
| CN104734948A (en) | Method and device for achieving intelligent routing | |
| CN103166859B (en) | service routing method and system | |
| JP3591492B2 (en) | Packet distribution device and packet distribution program | |
| FI124398B (en) | Method and apparatus for determining implementation of a search table for a network element of software-defined network | |
| CN107302571B (en) | The routing of information centre's network and buffer memory management method based on drosophila algorithm | |
| JP4673329B2 (en) | Apparatus, method, and program for creating multicast tree | |
| FI124397B (en) | Method and apparatus for determining search system for a network element of software-defined network | |
| US10491545B2 (en) | Virtual channel routing | |
| WO2009151187A1 (en) | Method and apparatus for routing in wireless network | |
| Devikar et al. | A hybrid computing approach to improve convergence time for scalable network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20170322 |
|
| RJ01 | Rejection of invention patent application after publication |