CN107124361A - Router and its system, the synchronous method and its device of database - Google Patents
Router and its system, the synchronous method and its device of database Download PDFInfo
- Publication number
- CN107124361A CN107124361A CN201610105544.3A CN201610105544A CN107124361A CN 107124361 A CN107124361 A CN 107124361A CN 201610105544 A CN201610105544 A CN 201610105544A CN 107124361 A CN107124361 A CN 107124361A
- Authority
- CN
- China
- Prior art keywords
- link state
- queue
- message
- packet
- request
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/302—Route determination based on requested QoS
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/6215—Individual queue per QOS, rate or priority
Abstract
A kind of method for routers rs database synchronization that the present invention is provided, link-state routing protocol is in database synchronization process, distinguish topological Link State Packet and leaf Link State Packet, carry out database synchronization with distinguishing importance, the high topological Link State Packet of priority synchronization importance, the relatively low leaf Link State Packet of importance is resynchronized in the case where topological Link State Packet is synchronously completed.A kind of routers rs database sychronisation and router and its system that the present invention is also provided.The present invention carries out database synchronization with distinguishing importance, can accelerate the convergence rate of route by distinguishing topological Link State Packet and leaf Link State Packet in the synchronizing process of link state routing protocol data storehouse.
Description
Technical field
The present invention relates to the communications field, relate more specifically to a kind of database of router differentiation priority same
The method and its device and router and its system of step.
Background technology
In data communication field, dynamic routing protocol is broadly divided into two kinds：One kind is distance vector route
Algorithm, another is link-state routing algorithm.
In link-state routing algorithm, the Link State Packet produced by link-state routing algorithm is main
There are two types：A kind of is Link State Packet (the referred to as topological Link State of bearer network topological structure
Message, every router can all produce the Link State Packet of description correspondence topological structure)；It is another to be
Link State Packet (the abbreviation leaf Link State Packet, relative to topological structure chain of bearer network route
Road message, router can produce the Link State Packet of more bearer network routes, mainly before network
Sew routing iinformation).The Link State Packet of bearer network route is associated with the link shape of correspondence topological structure
State message, i.e., only first calculate the topology up to particular router, subsequently can just calculate specific
The prefix router information of router advertisement.
As shown in Figure 1.Fig. 1 illustrates the example of with not differentiating between priority transmission link state message.Road
Reassignment order is performed by device 1 and introduces substantial amounts of BGP routes, and router 2 carries out database synchronization
During need all Link State Packets in database being sent to router 2.Before the Tn moment,
Leaf Link State Packet (bgp routing information that carry introducing) is sent to router by router 1
2, but at the Tn moment, the topological Link State Packet that the ability of router 1 produces oneself (carries route
Device 1 points to the network topology information of router 2) it is sent to router 2.Due to the Tn moment it
Topological Link State Packet of the preceding router 2 without router 1, so router 2 can not be calculated
Up to the topology of router 1, also the bgp routing information of the notice of router 1 just can not be calculated (i.e.
Now router 2 is set to have been received by all bgp routing informations of the notice of router 1), only
Have when Tn moment router 2 receives the topological Link State Packet of router 1, router 2 is
The topology up to router 1 can be calculated, the BGP route letters of the notice of router 1 can be just calculated
Breath.
Link-state routing protocol can be seen that in database synchronization process by above-mentioned example, if
Topological Link State Packet and leaf Link State Packet are not differentiated between, that is, carry out data with not differentiating between importance
Storehouse is synchronous, it may appear that the route letter for being not received by important topological Link State Packet and causing it to notice
Situation about can not be calculated in time is ceased, the convergence rate of route is eventually largely effected on.
The content of the invention
The embodiment of the present invention provides the method and its dress for the database synchronization that a kind of router distinguishes priority
Put and router and its system, to solve not having in the synchronizing process of link state routing protocol data storehouse
There are the topological Link State Packet of differentiation and non-topological Link State Packet to occur being not received by topological link shape
State message and routing iinformation situation about can not be calculated in time for causing it to notice, eventually influence route
The problem of convergence rate.
A kind of synchronous method for routers rs database that the embodiment of the present invention is proposed, including：
Link State Packet is divided into topological Link State Packet and leaf Link State Packet；
In neighboring router sync database, the topological Link State Packet is first synchronously completed, then together
Step completes the leaf Link State Packet.
Preferably, it is described in neighboring router sync database, first synchronously complete the topological link shape
State message, resynchronisation completes the leaf Link State Packet, and synchronizing process includes：
Set up the description of the summary between neighboring router database and the summary description is sent to adjacent road
By device, the summary description includes all Link State Packet summaries；
Described according to summary to neighboring router transmission link Status Enquiry Packet.
Preferably, the summary set up between neighboring router describes and is sent to the summary description
Neighboring router includes：Set up and describe queue for handling the summary of summary description, the summary describes team
Row include：Summary description Priority Queues, summary description common queue, override requests queue, common request
Queue.
Preferably, the summary set up between neighboring router describes and is sent to the summary description
Neighboring router includes：Addition summary description queue, corresponding summary description team is added to by summary description
In row.
Preferably, the adding procedure of the addition summary description queue is：The summary is described as topological chain
During line state message digest, the summary description is added to the summary description Priority Queues；It is described to pluck
When being described as leaf Link State Packet summary, the summary description is added to the summary description general
Logical queue.
Preferably, the summary set up between neighboring router describes and is sent to the summary description
Neighboring router includes：Forward abstract describes queue, and by summary description queue, according to priority treatment principle is sent out
Neighbor router is given, the priority processing principle is：Preferential forward abstract describes the summary in queue
Priority Queues is described to neighbor router, summary description Priority Queues retransmits summary after being all sent completely
Common queue is described.
Preferably, the summary set up between neighboring router describes and is sent to the summary description
Neighboring router includes：Summary description queue is received, the summary description in summary description queue, root is checked
Determined according to summary description to neighbor router transmission link Status Enquiry Packet.
Preferably, when determining to send the Link State request message to neighbor router, by the chain
Line state request message is added in request queue：If the summary description is topological Link State Packet
The Link State request message, then be added in override requests queue by summary；If the summary is retouched
It is leaf Link State Packet summary to state, then the Link State request message is added into common request team
In row.
Preferably, the summary set up between neighboring router describes and is sent to the summary description
Neighboring router includes：Request queue is sent, by the Link State request message of request queue according to priority
Treatment principle is sent to neighbor router, and the priority processing principle is：It is preferential to send in request queue
Override requests queue, common request queue is retransmited after the completion of override requests queue；Commonly please sending
Ask during queue, if occur new Link State request in override requests queue, interrupt current general
Logical request queue handles and turns to the request transmission processing of the Link State Packet in override requests queue.
Preferably, it is described to be included according to summary description to neighboring router transmission link Status Enquiry Packet：
Message transmit queue is set up, the message transmit queue is to set up to be used in combination according to the link request message being connected to
Sent in processing link packet, the message transmit queue includes：Prior message transmit queue and common report
Literary transmit queue.
Preferably, it is described to be included according to summary description to neighboring router transmission link Status Enquiry Packet：
Message transmit queue is added, Link State Packet is added in message transmit queue.
Preferably, the adding procedure of the addition message transmit queue is：
When receiving the Link State request message that neighbor router is sent, the Link State request is checked
Message, is added to the message by corresponding Link State Packet according to the Link State request message and sends out
Send in queue, including：, will if the Link State request message is topological Link State request message
The topological Link State Packet is added to prior message transmit queue；If the Link State request report
Text is leaf Link State request message, and the leaf Link State Packet is added into common message sends
Queue；Or,
New Link State Packet or oneself new Link State Packet of generation is obtained from other routers
When, new Link State Packet is added in message transmit queue：If Link State Packet is topology
Link State Packet, prior message transmit queue is added to by topological Link State Packet；If link shape
State message is leaf Link State Packet, and leaf Link State Packet is added into common message transmit queue.
Preferably, it is described to be included according to summary description to neighboring router transmission link Status Enquiry Packet：
Message transmit queue is sent, according to priority treatment principle is sent by the Link State Packet of message transmit queue
To neighbor router, the priority processing principle is：The preferential preferential report sent in message transmit queue
Common message transmit queue is sent after the completion of literary transmit queue, prior message transmit queue；It is common sending
During message transmit queue, sent if occurring new Link State Packet in prior message transmit queue
During request, interrupt currently common message transmit queue and handle and turn to the link in prior message transmit queue
State message transmission is handled.
The embodiment of the present invention also proposes a kind of sychronisation of routers rs database, it is characterised in that：Including：
Discrimination unit and synchronization unit；Wherein：
The discrimination unit, for Link State Packet to be divided into topological Link State Packet and leaf chain
Line state message；
The synchronization unit, in neighboring router sync database, first synchronously completing the topology
Link State Packet, resynchronisation completes the leaf Link State Packet.
Preferably, the synchronization unit includes summary description generation module and Link State Packet sending module；
Wherein：
The summary description generation module, for setting up the description of the summary between neighboring router database simultaneously
The summary description is sent to neighboring router；The summary description includes all Link State Packets and plucked
Will；
The Link State Packet sending module, for being described according to summary to neighboring router transmission link
Status Enquiry Packet.
Preferably, the summary description generation module, specifically for：
Set up and describe queue for handling the summary of summary description, the summary, which describes queue, to be included：Summary
Priority Queues, summary description common queue, override requests queue, common request queue are described；
Addition summary description queue, summary description is respectively added in corresponding summary description queue；
Forward abstract describes queue, and by summary description queue, according to priority treatment principle is sent to neighbours' route
Device；
Summary description queue is received, the summary description in summary description queue is checked, is determined according to summary description
Orient neighbor router transmission link Status Enquiry Packet；
Request queue is sent, according to priority treatment principle is sent by the Link State request message of request queue
To neighbor router.
Preferably, the adding procedure of the addition summary description queue is：The summary is described as topological chain
During line state message digest, the summary description is added to the summary description Priority Queues；It is described to pluck
When being described as leaf Link State Packet summary, the summary description is added to the summary description general
Logical queue.
Preferably, the priority processing principle that the forward abstract describes queue is：Preferential forward abstract is retouched
State the summary in queue and describe Priority Queues, summary description Priority Queues retransmits summary after all having sent
Common queue is described.
Preferably, when determining to send the Link State request message to neighbor router, by the chain
Line state request message is added in request queue：If the summary description is topological Link State Packet
The Link State request message, then be added in override requests queue by summary；If the summary is retouched
It is leaf Link State Packet summary to state, then Link State Packet request is added into common request team
In row.
Preferably, the priority processing principle of the transmission request queue is：It is preferential to send in request queue
Override requests queue, common request queue is retransmited after the completion of override requests queue；Commonly please sending
Ask during queue, if occur new Link State request in override requests queue, interrupt current general
Logical request queue handles and turns to the request transmission processing of the Link State Packet in override requests queue.
Preferably, the Link State Packet sending module, specifically for：
Message transmit queue is set up, the message transmit queue is set up according to the link request message being connected to
And for handling link packet transmission, the message transmit queue includes：Prior message transmit queue and general
The literary transmit queue of circular；
Message transmit queue is added, Link State Packet is added in message transmit queue；
Message transmit queue is sent, by the Link State Packet of message transmit queue according to priority treatment principle
Sent to neighbor router.
Preferably, the addition message transmit queue adding procedure is：
When receiving the Link State request message that neighbor router is sent, the Link State request is checked
Message, is added to the message by corresponding Link State Packet according to the Link State request message and sends out
Send in queue, including：, will if the Link State request message is topological Link State request message
The topological Link State Packet is added to prior message transmit queue；If the Link State request report
Text is leaf Link State request message, and leaf Link State Packet is added into common message transmit queue；
Or,
New Link State Packet or oneself new Link State Packet of generation is obtained from other routers
When, new Link State Packet is added in message transmit queue：If Link State Packet is topology
Link State Packet, prior message transmit queue is added to by topological Link State Packet；If link shape
State message is leaf Link State Packet, and leaf Link State Packet is added into common message transmit queue.
Preferably, the priority processing principle of the transmission message transmit queue is：It is preferential to send message hair
Send and common message is sent after the completion of the prior message transmit queue in queue, prior message transmit queue send
Queue；During common message transmit queue is sent, if occurred newly in prior message transmit queue
When Link State Packet sends request, interrupt currently common message transmit queue and handle and turn to prior message
Link State Packet transmission processing in transmit queue.
The embodiment of the present invention also proposes a kind of router, and the router includes synchronous dress as described above
Put.
The embodiment of the present invention also proposes a kind of route system, and the route system includes at least two such as
Above-described router.
Compared with prior art, a kind of router that the present invention is provided distinguishes the database of priority to the present invention
Synchronous method and its device and router and its system, link-state routing protocol is same in database
During step, topological Link State Packet and leaf Link State Packet are distinguished, that is, is entered with distinguishing importance
Row database synchronization, priority synchronization influences the high topological Link State Packet of the importance of network topology structure,
Carry out the relatively low other Link States of importance again in the case where topological Link State Packet is synchronously completed
The synchronization of message (leaf Link State Packet), so as to accelerate the convergence rate of route.
Brief description of the drawings
Fig. 1 is the schematic diagram for not differentiating between priority data storehouse example synchronization in the prior art；
A kind of flow chart for routers rs database synchronous method that Fig. 2 provides for the present invention；
Addition summary description queue in a kind of routers rs database synchronous method that Fig. 3 provides for the present invention
Flow chart；
Forward abstract describes queue in a kind of routers rs database synchronous method that Fig. 4 provides for the present invention
Flow chart；
The flow of summary description is received in a kind of routers rs database synchronous method that Fig. 5 provides for the present invention
Figure；
The flow of request queue is sent in a kind of routers rs database synchronous method that Fig. 6 provides for the present invention
Figure；
The flow of request message is received in a kind of routers rs database synchronous method that Fig. 7 provides for the present invention
Figure；
Addition message transmit queue in a kind of routers rs database synchronous method that Fig. 8 provides for the present invention
Flow chart；
Message transmit queue is sent in a kind of routers rs database synchronous method that Fig. 9 provides for the present invention
Flow chart；
A kind of structural representation for routers rs database sychronisation that Figure 10 provides for the present invention.
In order that technical scheme is clearer, clear, make further detailed below in conjunction with accompanying drawing
State.
Embodiment
It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, limit is not used to
The fixed present invention.
As shown in Fig. 2 the present invention provides a kind of routers rs database synchronous method, applied to link shape
The database synchronization of state routing algorithm agreement, including：
The Link State Packet that link-state routing algorithm is produced divides into topological Link State Packet and leaf
Sublink state message；
The Link State Packet that link-state routing algorithm is produced mainly has two types：One kind is bearer network
(referred to as topological Link State Packet, every router can all be produced the Link State Packet of network topological structure
The Link State Packet of description correspondence topological structure)；Another is the Link State report of bearer network route
(abbreviation leaf Link State Packet, relative to topology links message, router can produce more text
Bearer network route Link State Packet, mainly prefix router information).Bearer network road
By Link State Packet be associated with correspondence topological structure Link State Packet, i.e., only first calculate
Up to the topology of particular router, the prefix router of particular router notice subsequently can be just calculated
Information.As can be seen that the Link State Packet (topological Link State Packet) of bearer network topological structure
It is relative more important than the Link State Packet (leaf Link State Packet) that bearer network is route.
In neighboring router sync database, the topological Link State Packet is first synchronously completed, then together
Step completes the leaf Link State Packet.Specific synchronizing process includes：
Set up the description of the summary between neighboring router database and the summary description is sent to adjacent road
By device；
Described according to summary to neighboring router transmission link Status Enquiry Packet.
It the following specifically describes synchronizing process.
Set up the description of the summary between neighboring router database and be sent to the summary description adjacent
Router
Neighboring router sends HELLO messages and set up after two-way communication, by all links in local data base
State message makes a summary to form summary description (characterizing Link State Packet summary to make a summary description form)
Neighbor router is sent to, is described by the summary, it may be determined that the local data base of local router lacks
The Link State Packet that few Link State Packet and neighbor router database lacks.
On setting up the description of the summary between neighboring router database and the summary description being sent into phase
Details are provided below for adjacent router：
Set up and describe queue for handling the summary of summary description, the processing includes addition, sends, receives
Etc. process, and initialize the summary and describe queue.The summary, which describes queue, to be included：The preferential team of summary description
Row, summary description common queue, override requests queue, common request queue.
Addition summary description queue, corresponding summary description team is respectively added to by summary description by importance
In row, specific adding procedure is：When being described as topological Link State Packet summary such as summary, added
Priority Queues is described to summary；When being described as leaf Link State Packet summary such as summary, it is added to
Summary description common queue.
Forward abstract describes queue, and by summary description queue, according to priority treatment principle is sent to neighbours' route
Device.The priority processing principle is：The summary that preferential forward abstract is described in queue describes Priority Queues,
Summary description Priority Queues retransmits summary description common queue after all having sent；When summary description is preferential
Queue is not space-time, and the summary description in description Priority Queues of making a summary is sent into neighbor router, until
Summary description Priority Queues is sky；When summary description Priority Queues is space-time, the common team of processing summary description
Row, neighbor router is sent to by the summary description in description common queue of making a summary.
Summary description queue is received, the summary for receiving neighbor router transmission describes queue, checks that summary is retouched
Each summary description in queue is stated, decides whether to send to neighbor router according to summary description
Link State request message；, will when determining to need to send request link state message to neighbor router
Link State request message is added in request queue：If description of making a summary is that topological Link State Packet is plucked
Will, then Link State request message is added in override requests queue；If description of making a summary is leaf chain
Link State request message, then be added in common request queue by line state message digest.
Request queue is sent, according to priority treatment principle is sent by the Link State request message of request queue
To neighbor router.The priority processing principle is：The preferential override requests queue sent in request queue,
Common request queue is retransmited after the completion of override requests queue；When override requests queue be space-time, will be excellent
Link State Packet request in first request queue is sent to neighbor router, until override requests queue is
It is empty；When override requests queue is space-time, common request queue is handled, by the link in common request queue
State message request is sent to neighbor router；During common request queue is sent, if preferentially please
Ask when occurring new Link State request in queue, interrupt currently common request queue and handle and turn to preferentially
Link State Packet request transmission processing in request queue.
Described according to summary to neighboring router transmission link Status Enquiry Packet.
Because the summary sent according to neighboring router is described, it may be determined that the local data of local router
The Link State Packet whether Link State Packet and neighbor router database whether storehouse lacks lack,
And result asks to send the Link State Packet that database lacks to neighbor router according to this, improves router
Link State Packet database, reach the synchronous purpose of routers rs database.
There are two kinds of situations to the trigger timing of neighbor router transmission link state message in router：One
Kind it is to receive the Link State Packet request that neighbor router sends (to receive neighbours road in ISIS agreements
After the complete database summary description of device, the Link State Packet that neighbor router lacks can be sent to
Neighbor router)；Another is to obtain new Link State Packet from other routers or oneself is produced
New Link State Packet.When both the above situation either case occurs, router can all be route to neighbours
Device transmission link state message, specific transmission process is as described below：
Message transmit queue is set up, the message transmit queue is set up according to the link request message being connected to
And for handling link packet transmission, the message transmit queue includes：Prior message transmit queue and common
Message transmit queue；And initialize above-mentioned message transmit queue.
Message transmit queue is added, Link State Packet is added in message transmit queue, specific addition
Process is：Specific adding procedure is carried out in two kinds of situation：
The first situation：When receiving the Link State request message that neighbor router is sent, request is checked
The Link State request message of each in message, according to Link State request message by corresponding Link State
Message is added in message transmit queue：If Link State request message is topological Link State request report
Text, then be added to prior message transmit queue by topological Link State Packet；If Link State request report
Text is leaf Link State request message, then leaf Link State Packet is added into common message sends team
Row.
Second of situation：New Link State Packet or oneself new chain of generation is obtained from other routers
During line state message, new Link State Packet is added in message transmit queue：If Link State
Message is topological Link State Packet, then topological Link State Packet is added into prior message transmit queue；
If Link State Packet is leaf Link State Packet, leaf Link State Packet is added to commonly
Message transmit queue.
Message transmit queue is sent, by the Link State Packet of message transmit queue according to priority treatment principle
Sent to neighbor router.The priority processing principle is：It is preferential in preferential transmission message transmit queue
Common message transmit queue is sent after the completion of message transmit queue, prior message transmit queue；When preferential report
Literary transmit queue is not space-time, and the Link State Packet in prior message transmit queue is sent into neighbours road
By device, until prior message transmit queue is sky；When prior message transmit queue is space-time, processing is common
Message transmit queue, neighbor router is sent to by the Link State Packet in common message transmit queue；
When handling common message transmit queue process, if occurring new link shape in prior message transmit queue
When state message sends request, interrupt currently common message transmit queue and handle and turn to prior message transmission team
Link State Packet transmission processing in row.
As shown in figure 3, addition summary is retouched in a kind of routers rs database synchronous method provided for the present invention
State the flow chart of queue.
Router finds that all Link State Packets in local data base can be made a summary to be formed after neighbor router
Summary description is sent to neighbor router, and neighbor router determines whether needs after receiving summary description
To other side's request link state message, if it is local without or local Link State Packet there is no other side
Link State Packet is new, then needs to other side's request link state message.
Local data base link state message is made a summary to be formed summary description be sent to before neighbor router,
Need all Link State Packets in local data base being added in summary description queue, if link shape
State message is topological Link State Packet, then is added to summary description Priority Queues；If Link State report
Text is leaf Link State Packet, then is added to summary description common queue.
As shown in figure 4, forward abstract is retouched in a kind of routers rs database synchronous method provided for the present invention
State the flow chart of queue.
When forward abstract describes queue, the summary description first in processing summary description Priority Queues will be plucked
Describe the description of each summary in Priority Queues to send, only when institute in summary description Priority Queues
Have after the completion of summary description processing, just processing summary describes the summary description in common queue.So can be with
Ensure that the topological Link State summary info in summary description Priority Queues is sent with high priority.
Because the addition of summary description queue is disposable completion, makes a summary and describe in the absence of all Link States
The Link State newly added in the Link State summary description added again after the completion of addition, follow-up data storehouse
Message will be transmitted directly to neighbor router, and without being again added in summary description queue table.
Retouched as shown in figure 5, receiving summary in a kind of routers rs database synchronous method provided for the present invention
The flow chart stated.
Receive the summary that neighbor router sends and describe queue, check each in summary description queue
Summary description, is decided whether to neighbor router transmission link Status Enquiry Packet according to summary description.
Link State if local data base is not made a summary in the Link State Packet or local data base of description
Message do not make a summary description Link State Packet it is new, it is necessary to neighbor router transmission link status request
Message.
When determining to need to neighbor router transmission link Status Enquiry Packet, Link State is asked to report
Text is added in request queue：If summary description is topological Link State Packet summary, it is added to excellent
In first request queue；If summary description is leaf Link State Packet summary, it is added to common request
In queue.
Receive after the complete summary description that neighbor router sends (when router is by institute in local data base
There is the summary description of Link State all when being sent, can be by the specific fields in description of making a summary to neighbour
Occupy the local signal for having sent the summary description of all Link States of router transmission), if this
In being described in ground database containing complete summary during unexistent Link State Packet, then illustrate other side neighbours
Router lacks corresponding Link State Packet.If the Link State Packet lacked is topological Link State
Message, then be added to prior message transmit queue；If the Link State Packet lacked is leaf link shape
State message, then be added to common message transmit queue (this is only applicable ISIS agreements).
As shown in fig. 6, sending request team in a kind of routers rs database synchronous method provided for the present invention
The flow chart of row.
When sending request queue, the request message in override requests queue is sent first, is only asked when preferential
Ask in queue after the completion of all request message processing, the request message in ability start to process common request queue.
It can so ensure that the topological Link State request message in override requests queue is sent out with high priority
Go.
During processing common request queue, if new message request is added to override requests queue
In, then the transmission request processing of common request queue is interrupted, turns to go to handle the transmission in override requests queue
Request, continues the transmission request processing in the last common request queue being interrupted after being disposed.This
Planting the processing mode of preemptive type can ensure that topological Link State Packet request is sent out with high priority all the time
Go.
As shown in fig. 7, receiving request report in a kind of routers rs database synchronous method provided for the present invention
The flow chart of text.
When receiving the request message that neighbor router is sent, each link in request message can be handled
State message is asked, and is decided whether to send corresponding link shape to neighbor router according to message request
State message, if local data base has corresponding Link State Packet, the Link State Packet is sent to
Neighbor router.
During if necessary to neighbor router transmission link state message, the Link State Packet of request is judged
Whether it is topological Link State Packet, if the Link State Packet of request is topological Link State Packet,
Then it is added in prior message transmit queue；If the Link State Packet of request is leaf Link State report
Text, then be added in common message transmit queue.
As shown in figure 8, addition message hair in a kind of routers rs database synchronous method provided for the present invention
Send the flow chart of queue.
New Link State Packet or oneself new Link State Packet of generation is obtained from other routers
When, it is necessary to which these new Link State Packets are sent into neighbor router.Judge new Link State report
Whether text is topological Link State Packet, if new Link State Packet is topological Link State Packet,
Then it is added in prior message transmit queue；If new Link State Packet is leaf Link State Packet,
Then it is added in common message transmit queue.
As shown in figure 9, sending message hair in a kind of routers rs database synchronous method provided for the present invention
Send the flow chart of queue.
When sending message transmit queue, the Link State Packet hair in prior message transmit queue is handled first
Request is sent, the Link State Packet in prior message transmit queue is sent, only works as prior message
After the completion of all Link State Packets send request processing in transmit queue, the common message of ability start to process is sent out
The Link State Packet in queue is sent to send request.The topological chain in preferential transmit queue can so be ensured
Line state message is sent with high disposal priority.
During common message transmit queue is handled, if new transmission request is added to prior message
In transmit queue, then the transmission request processing of common message transmit queue is interrupted, turn to go to handle prior message
Transmission request in transmit queue, continues the last common message transmit queue being interrupted after being disposed
In transmission request processing.The processing mode of this preemptive type can ensure topological Link State Packet all the time
Sent with high priority.
As shown in Figure 10, a kind of structural representation of the routers rs database sychronisation provided for the present invention.
The present invention provides a kind of sychronisation of routers rs database, applied to link-state routing algorithm association
The database synchronization of view, including：Discrimination unit and synchronization unit.
Discrimination unit, the Link State Packet for link-state routing algorithm to be produced divides into topological chain
Line state message and leaf Link State Packet；
Synchronization unit, in neighboring router sync database, first synchronously completing the topological link
State message, then resynchronisation completes the leaf Link State Packet；The synchronization unit includes summary
Generation module and sending module are described.Wherein：
The summary describes generation module, describes and incites somebody to action for setting up the summary between neighboring router database
The summary description is sent to neighboring router；The summary description includes all Link State Packet summaries；
Specifically for：
Summary description queue is set up, and initializes the summary and describes queue.The summary, which describes queue, to be included：
Summary description Priority Queues, summary description common queue, override requests queue, common request queue.
Addition summary description queue, corresponding summary description team is respectively added to by summary description by importance
In row, adding procedure is：When being described as topological Link State Packet summary such as summary, it is added to and plucks
Priority Queues is described；When being described as leaf Link State Packet summary such as summary, summary is added to
Common queue is described.
Forward abstract describes queue, and by summary description queue, according to priority treatment principle is sent to neighbours' route
Device.The priority processing principle is：The summary that preferential forward abstract is described in queue describes Priority Queues,
Summary description Priority Queues retransmits summary description common queue after all having sent；When summary description is preferential
Queue is not space-time, and the summary description in description Priority Queues of making a summary is sent into neighbor router, until
Summary description Priority Queues is sky；When summary description Priority Queues is space-time, the common team of processing summary description
Row, neighbor router is sent to by the summary description in description common queue of making a summary.
Summary description queue is received, the summary for receiving neighbor router transmission describes queue, checks that summary is retouched
Each summary description in queue is stated, decides whether to send to neighbor router according to summary description
Link State request message；, will when determining to need to neighbor router transmission link Status Enquiry Packet
Link State request message is added in request queue：If description of making a summary is that topological Link State Packet is plucked
Will, then Link State request message is added in override requests queue；If description of making a summary is leaf link
State message is made a summary, then Link State request message is added in common request queue.
Request queue is sent, according to priority treatment principle is sent by the Link State request message of request queue
To neighbor router.The priority processing principle is：The preferential override requests queue sent in request queue,
Common request queue is retransmited after the completion of override requests queue；When override requests queue be space-time, will be excellent
Link State Packet request in first request queue is sent to neighbor router, until override requests queue is
It is empty；When override requests queue is space-time, common request queue is handled, by the link in common request queue
State message request is sent to neighbor router；During common request queue is sent, if preferentially please
Ask when occurring new Link State request in queue, interrupt currently logical request queue and handle and turn to and preferentially ask
The Link State Packet in queue is asked to ask transmission processing.
The Link State Packet sending module, for being described according to summary to neighboring router transmission link shape
State request message；Specifically for：
Message transmit queue is set up, the message transmit queue is set up according to the link request message being connected to
And for handling link packet transmission, the message transmit queue includes：Prior message transmit queue and common
Message transmit queue；And initialize above-mentioned message transmit queue.
Message transmit queue is added, Link State Packet is added in message transmit queue, specific addition
Process is：Specific adding procedure is carried out in two kinds of situation：
The first situation：When receiving the Link State request message that neighbor router is sent, request is checked
The Link State request message of each in message, according to Link State request message by corresponding Link State
Message is added in message transmit queue：If Link State request message is topological Link State request report
Text, then be added to prior message transmit queue by topological Link State Packet；If Link State request report
Text is leaf Link State request message, then leaf Link State Packet is added into common message sends team
Row.
Second of situation：New Link State Packet or oneself new chain of generation is obtained from other routers
During line state message, new Link State Packet is added in message transmit queue：If Link State
Message is topological Link State Packet, then topological Link State Packet is added into prior message transmit queue；
If Link State Packet is leaf Link State Packet, leaf Link State Packet is added to commonly
Message transmit queue.
Message transmit queue is sent, by the Link State Packet of message transmit queue according to priority treatment principle
Sent to neighbor router.The priority processing principle is：It is preferential in priority treatment message transmit queue
Message transmit queue, after the completion of reprocess common message transmit queue；When prior message transmit queue is not
Space-time, neighbor router is sent to by the Link State Packet in prior message transmit queue, until preferential
Message transmit queue is sky；When prior message transmit queue is space-time, common message transmit queue is handled,
Link State Packet in common message transmit queue is sent to neighbor router；Handling common message
During transmit queue process, if occurring new Link State Packet in prior message transmit queue sends request
When, interrupt currently common message transmit queue and handle and turn to the Link State in prior message transmit queue
Message transmission is handled.
The present invention also provides a kind of router, and it includes sychronisation as described above, the sychronisation,
For the database of the link-state routing algorithm agreement of synchronous above-mentioned router, it includes：Discrimination unit
And synchronization unit.Wherein：
Discrimination unit, the Link State Packet for link-state routing algorithm to be produced divides into topological chain
Line state message and leaf Link State Packet；
Synchronization unit, in neighboring router sync database, first synchronously completing the topological link
State message, then resynchronisation completes the leaf Link State Packet；The synchronization unit includes summary
Generation module and Link State Packet sending module are described.Wherein：
Summary description generation module, for setting up the description of the summary between neighboring router database and by institute
State summary description and be sent to neighboring router；The summary description includes all Link State Packet summaries；
Link State Packet sending module, for being described according to summary to neighboring router transmission link state
Request message.
The present invention also provides a kind of route system, including at least two routers, and the router includes
Sychronisation as described above, the sychronisation, the Link State route for synchronous above-mentioned router
The database of algorithm protocol, it includes：Discrimination unit and synchronization unit.Wherein：
Discrimination unit, the Link State Packet for link-state routing algorithm to be produced divides into topological chain
Line state message and leaf Link State Packet；
Synchronization unit, in neighboring router sync database, first synchronously completing the topological link
State message, then resynchronisation completes the leaf Link State Packet；The synchronization unit includes summary
Generation module and Link State Packet sending module are described.Wherein：
Summary description generation module, for setting up the description of the summary between neighboring router database and by institute
State summary description and be sent to neighboring router；The summary description includes all Link State Packet summaries；
Link State Packet sending module, for being described according to summary to neighboring router transmission link state
Request message.
Compared with prior art, the present invention at least has following advantages：
A kind of router that the present invention is provided distinguish the database synchronization of priority method and its device, with
And router and its system, link-state routing protocol is in database synchronization process, the topological link of differentiation
State message and leaf Link State Packet, that is, carry out database synchronization, priority synchronization with distinguishing importance
The topological Link State Packet for influenceing the importance of network topology structure high, it is same in topological Link State Packet
Step carries out importance relatively low other Link State Packets (leaf Link State report again in the case of completing
Text) synchronization, so as to accelerate route convergence rate.
It should also be noted that, herein, term " comprising ", "comprising" or its any other
Variant is intended to including for nonexcludability, so that process, method, thing including a series of key elements
Product or device not only include those key elements, but also other key elements including being not expressly set out, or
It is also to include for this process, method, article or the intrinsic key element of device.In not more limitations
In the case of, the key element limited by sentence "including a ...", it is not excluded that including the key element
Also there is other identical element in process, method, article or device.
The embodiments of the present invention are for illustration only, and the quality of embodiment is not represented.
Through the above description of the embodiments, those skilled in the art can be understood that above-mentioned
Embodiment method can add the mode of required general hardware platform to realize by software, naturally it is also possible to logical
Cross hardware, but the former is more preferably embodiment in many cases.Understood based on such, it is of the invention
The part that technical scheme substantially contributes to prior art in other words can in the form of software product body
Reveal and, the computer software product is stored in storage medium (such as ROM/RAM, magnetic disc, a light
Disk) in, including some instructions are to cause a station terminal equipment (can be mobile phone, computer, service
Device, or the network equipment etc.) perform method described in each embodiment of the invention.
The preferred embodiments of the present invention are the foregoing is only, are not intended to limit the scope of the invention,
The conversion of equivalent structure or flow that every utilization description of the invention and accompanying drawing content are made, or directly or
Connect and be used in other related technical fields, be included within the scope of the present invention.
Claims (25)
1. a kind of synchronous method of routers rs database, including：
Link State Packet is divided into topological Link State Packet and leaf Link State Packet；
In neighboring router sync database, the topological Link State Packet is first synchronously completed, then together
Step completes the leaf Link State Packet.
2. synchronous method as claimed in claim 1, it is characterised in that：It is described synchronous in neighboring router
During database, the topological Link State Packet is first synchronously completed, resynchronisation completes the leaf link shape
State message, synchronizing process includes：
Set up the description of the summary between neighboring router database and the summary description is sent to adjacent road
By device, the summary description includes all Link State Packet summaries；
Described according to the summary to neighboring router transmission link Status Enquiry Packet.
3. synchronous method as claimed in claim 2, it is characterised in that：It is described set up neighboring router it
Between summary description and the summary description is sent to neighboring router and included：Set up described for handling
The summary of summary description describes queue, and the summary, which describes queue, to be included：Summary describes Priority Queues, plucked
Common queue, override requests queue, common request queue are described.
4. synchronous method as claimed in claim 3, it is characterised in that：It is described set up neighboring router it
Between summary description and the summary description is sent to neighboring router and included：Addition summary description queue,
The summary description is added in corresponding summary description queue.
5. synchronous method as claimed in claim 4, it is characterised in that：The addition summary description queue
Adding procedure be：When the summary is described as topological Link State Packet summary, the summary is described
It is added to the summary description Priority Queues；When the summary is described as leaf Link State Packet summary,
The summary description is added to the summary description common queue.
6. synchronous method as claimed in claim 5, it is characterised in that：It is described set up neighboring router it
Between summary description and the summary description is sent to neighboring router and included：Forward abstract describes queue,
The summary is described into queue, and according to priority treatment principle is sent to neighbor router, the priority processing
Principle is：The summary preferentially sent in the summary description queue describes Priority Queues to neighbor router,
The summary description Priority Queues retransmits summary description common queue after being all sent completely.
7. synchronous method as claimed in claim 5, it is characterised in that：It is described set up neighboring router it
Between summary description and the summary description is sent to neighboring router and included：Summary description queue is received,
The summary description in the summary description queue is checked, is determined according to the summary description to neighbours road
By device transmission link Status Enquiry Packet.
8. synchronous method as claimed in claim 7, it is characterised in that：Methods described also includes：When certainly
When orienting the neighbor router transmission Link State request message, the Link State request message is added
It is added in request queue：If the summary description is topological Link State Packet summary, by the chain
Line state request message is added in override requests queue；If the summary description is leaf Link State
Message digest, then the Link State request message be added in common request queue.
9. synchronous method as claimed in claim 8, it is characterised in that：It is described set up neighboring router it
Between summary description and the summary description is sent to neighboring router and further comprised：Send request team
Row, by the Link State request message of request queue, according to priority treatment principle is sent to neighbor router,
The priority processing principle is：The preferential override requests queue sent in request queue, override requests team
Common request queue is retransmited after the completion of row；During common request queue is sent, if override requests
When occurring new Link State request in queue, interrupt currently common request queue and handle and turn to preferential ask
The Link State Packet in queue is asked to ask transmission processing.
10. synchronous method as claimed in claim 9, it is characterised in that：It is described according to summary description to
Neighboring router transmission link Status Enquiry Packet includes：Message transmit queue is set up, the message is sent
Queue is to be set up according to the link request message being connected to and be used to handle Link State Packet transmission, the report
Literary transmit queue includes：Prior message transmit queue and common message transmit queue.
11. synchronous method as claimed in claim 10, it is characterised in that：It is described according to summary description to
Neighboring router transmission link Status Enquiry Packet includes：Message transmit queue is added, by Link State report
Text is added in message transmit queue.
12. synchronous method as claimed in claim 11, it is characterised in that：The addition message sends team
The adding procedure of row is：
When receiving the Link State request message that neighbor router is sent, the Link State request is checked
Message, is added to the message by corresponding Link State Packet according to the Link State request message and sends out
Send in queue, including：, will if the Link State request message is topological Link State request message
The topological Link State Packet is added to prior message transmit queue；If the Link State request report
Text is leaf Link State request message, and the leaf Link State Packet is added into common message sends
Queue；Or,
New Link State Packet or oneself new Link State Packet of generation is obtained from other routers
When, new Link State Packet is added in message transmit queue：If Link State Packet is topology
Link State Packet, prior message transmit queue is added to by topological Link State Packet；If link shape
State message is leaf Link State Packet, and leaf Link State Packet is added into common message transmit queue.
13. synchronous method as claimed in claim 12, it is characterised in that：It is described according to summary description to
Neighboring router transmission link Status Enquiry Packet includes：Message transmit queue is sent, message is sent into team
According to priority treatment principle is sent the Link State Packet of row to neighbor router, and the priority processing is former
It is then：The preferential prior message transmit queue sent in message transmit queue, prior message transmit queue is complete
Common message transmit queue is sent into rear；During common message transmit queue is sent, if preferential report
When occurring new Link State Packet transmission request in literary transmit queue, interrupt currently common message and send team
Column processing simultaneously turns to the processing of the Link State Packet transmission in prior message transmit queue.
14. a kind of sychronisation of routers rs database, it is characterised in that：Including：Discrimination unit and same
Walk unit；Wherein：
The discrimination unit, for Link State Packet to be divided into topological Link State Packet and leaf chain
Line state message；
The synchronization unit, in neighboring router sync database, first synchronously completing the topology
Link State Packet, resynchronisation completes the leaf Link State Packet.
15. sychronisation as claimed in claim 14, it is characterised in that：The synchronization unit includes plucking
Generation module and Link State Packet sending module are described；Wherein：
The summary description generation module, for setting up the description of the summary between neighboring router database simultaneously
The summary description is sent to neighboring router；The summary description includes all Link State Packets and plucked
Will；
The Link State Packet sending module, for being described according to summary to neighboring router transmission link
Status Enquiry Packet.
16. sychronisation as claimed in claim 14, it is characterised in that：The summary description generation mould
Block, specifically for：
Set up and describe queue for handling the summary of summary description, the summary, which describes queue, to be included：Summary
Priority Queues, summary description common queue, override requests queue, common request queue are described；
Addition summary description queue, summary description is respectively added in corresponding summary description queue；
Forward abstract describes queue, and by summary description queue, according to priority treatment principle is sent to neighbours' route
Device；
Summary description queue is received, the summary description in summary description queue is checked, is determined according to summary description
Orient neighbor router transmission link Status Enquiry Packet；
Request queue is sent, according to priority treatment principle is sent by the Link State request message of request queue
To neighbor router.
17. sychronisation as claimed in claim 16, it is characterised in that：The addition summary description team
The adding procedure of row is：When the summary is described as topological Link State Packet summary, the summary is retouched
State and be added to the summary description Priority Queues；When the summary is described as leaf Link State Packet summary,
The summary description is added to the summary description common queue.
18. sychronisation as claimed in claim 17, it is characterised in that：The forward abstract describes team
The priority processing principle of row is：The summary that preferential forward abstract is described in queue describes Priority Queues, plucks
Describe to retransmit summary description common queue after Priority Queues has all been sent.
19. sychronisation as claimed in claim 16, it is characterised in that：Described device also includes：When
When determining to the neighbor router transmission Link State request message, by the Link State request message
It is added in request queue：If the summary description is topological Link State Packet summary, will be described
Link State request message is added in override requests queue；If the summary description is leaf link shape
The Link State request message, then be added in common request queue by state message digest.
20. sychronisation as claimed in claim 19, it is characterised in that：The transmission request queue
Priority processing principle is：The preferential override requests queue sent in request queue, override requests queue is complete
Common request queue is retransmited after；During common request queue is sent, if override requests queue
When the new Link State of middle appearance is asked, interrupt currently common request queue processing and handle and turn to preferential ask
The Link State Packet in queue is asked to ask transmission processing.
21. sychronisation as claimed in claim 20, it is characterised in that：The Link State Packet hair
Module is sent, specifically for：
Message transmit queue is set up, the message transmit queue is set up according to the link request message being connected to
And for handling link packet transmission, the message transmit queue includes：Prior message transmit queue and general
The literary transmit queue of circular；
Message transmit queue is added, Link State Packet is added in message transmit queue；
Message transmit queue is sent, by the Link State Packet of message transmit queue according to priority treatment principle
Sent to neighbor router.
22. sychronisation as claimed in claim 21, it is characterised in that：The addition message sends team
Row adding procedure is：
When receiving the Link State request message that neighbor router is sent, the Link State request is checked
Message, is added to the message by corresponding Link State Packet according to the Link State request message and sends out
Send in queue, including：, will if the Link State request message is topological Link State request message
The topological Link State Packet is added to prior message transmit queue；If the Link State request report
Text is leaf Link State request message, and leaf Link State Packet is added into common message transmit queue；
Or,
New Link State Packet or oneself new Link State Packet of generation is obtained from other routers
When, new Link State Packet is added in message transmit queue：If Link State Packet is topology
Link State Packet, prior message transmit queue is added to by topological Link State Packet；If link shape
State message is leaf Link State Packet, and leaf Link State Packet is added into common message transmit queue.
23. sychronisation as claimed in claim 22, it is characterised in that：The transmission message sends team
The priority processing principle of row is：The preferential prior message transmit queue sent in message transmit queue, it is excellent
Common message transmit queue is sent after the completion of first message transmit queue；Sending common message transmit queue mistake
Cheng Zhong, if occur new Link State Packet transmission request in prior message transmit queue, interrupts and works as
Preceding common message transmit queue is handled and turned at the Link State Packet transmission in prior message transmit queue
Reason.
24. a kind of router, it is characterised in that：The router includes such as claim 14 to 23 times
Sychronisation described in one.
25. a kind of route system, it is characterised in that：The route system includes at least two as weighed
Profit requires the router described in 24.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610105544.3A CN107124361A (en) | 2016-02-25 | 2016-02-25 | Router and its system, the synchronous method and its device of database |
| PCT/CN2016/094387 WO2017143733A1 (en) | 2016-02-25 | 2016-08-10 | Router and system thereof, and database synchronization method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610105544.3A CN107124361A (en) | 2016-02-25 | 2016-02-25 | Router and its system, the synchronous method and its device of database |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107124361A true CN107124361A (en) | 2017-09-01 |
Family
ID=59685807
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610105544.3A Pending CN107124361A (en) | 2016-02-25 | 2016-02-25 | Router and its system, the synchronous method and its device of database |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN107124361A (en) |
| WO (1) | WO2017143733A1 (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108111423A (en) * | 2017-12-28 | 2018-06-01 | 迈普通信技术股份有限公司 | Flow transfer management method, apparatus and network derived channel equipment |
| CN109542982A (en) * | 2018-11-28 | 2019-03-29 | 福建南威软件有限公司 | The method of data exchange priority scheduling between database |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR100449488B1 (en) * | 2002-05-21 | 2004-09-22 | 한국전자통신연구원 | Network for transferring active packet and method for employing the same |
| CN100466623C (en) * | 2006-07-25 | 2009-03-04 | 华为技术有限公司 | Route information update method and network equipment based on OSPF |
| CN100405787C (en) * | 2006-09-15 | 2008-07-23 | 清华大学 | Low-load and reliable chain circuit state route protocol flooding method |
| CN101316229B (en) * | 2007-06-01 | 2011-09-14 | 华为技术有限公司 | Method and router for synchronizing link state advertisement |
| CN103236990B (en) * | 2013-05-13 | 2016-10-05 | 杭州华三通信技术有限公司 | The method and apparatus that a kind of routing iinformation synchronizes |
-
2016
- 2016-02-25 CN CN201610105544.3A patent/CN107124361A/en active Pending
- 2016-08-10 WO PCT/CN2016/094387 patent/WO2017143733A1/en active Application Filing
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108111423A (en) * | 2017-12-28 | 2018-06-01 | 迈普通信技术股份有限公司 | Flow transfer management method, apparatus and network derived channel equipment |
| CN109542982A (en) * | 2018-11-28 | 2019-03-29 | 福建南威软件有限公司 | The method of data exchange priority scheduling between database |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2017143733A1 (en) | 2017-08-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101616408B (en) | Key derivation method, key derivation device and system | |
| CN105591974B (en) | Message processing method, apparatus and system | |
| CN103825760B (en) | A kind of method and apparatus that neighborhood is set up based on ospf protocol | |
| CN108521662A (en) | A kind of safety satellite crosses the method and system of top switching | |
| CN104618236A (en) | Parallel data transmission system and method of acceleration network | |
| CN104580371B (en) | File is fixed and variable-size fragment, transmission, copy control methods in opportunistic network | |
| CN110351030A (en) | Message transmitting method, device and system | |
| CN105743614B (en) | The transmission method and device of data | |
| CN109728967A (en) | Communication quality detection method, communication equipment and system | |
| TW202002701A (en) | Method for sequentially delivering data, network device and terminal device thereof | |
| US7529943B1 (en) | Systems and methods for end-to-end resource reservation authentication | |
| EP3821679A1 (en) | Enabling functionality at a user plane function, upf, by a session management function, smf, in a telecommunication network | |
| CN105376158A (en) | SDN circulation method and device based on EXP value in MPLS message | |
| CN110072257A (en) | A kind of method of user's intercommunication under MEC | |
| CN107124361A (en) | Router and its system, the synchronous method and its device of database | |
| CN108600106B (en) | A kind of DEU data exchange unit and method of low time delay | |
| CN106533503B (en) | A kind of method and device of powerline network communication | |
| CN103139752B (en) | Transmission channel table amending method and device | |
| CN109743758A (en) | Multi link communications method, communication device and communication system | |
| US20170310561A1 (en) | Network Control Method and Apparatus | |
| CN105721312B (en) | It is realized in a kind of network stack equipment and routes isolated chip implementing method and device | |
| CN117082054A (en) | Data transmission method, device, system and medium | |
| CN103118083A (en) | Method and device of transmitting service messages | |
| CN106792971A (en) | Network node system of selection based on ant group algorithm | |
| CN107086958B (en) | Data transmission method, wap gateway and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20170901 |