CN103825823B - Data forwarding method based on different priorities in software-defined network - Google Patents
Data forwarding method based on different priorities in software-defined network Download PDFInfo
- Publication number
- CN103825823B CN103825823B CN201410074396.4A CN201410074396A CN103825823B CN 103825823 B CN103825823 B CN 103825823B CN 201410074396 A CN201410074396 A CN 201410074396A CN 103825823 B CN103825823 B CN 103825823B
- Authority
- CN
- China
- Prior art keywords
- routing
- route
- static
- path
- controller
- 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.)
- Expired - Fee Related
Links
- 238000000034 method Methods 0.000 title claims abstract description 50
- 230000003068 static effect Effects 0.000 claims abstract description 67
- 230000008878 coupling Effects 0.000 claims description 3
- 238000010168 coupling process Methods 0.000 claims description 3
- 238000005859 coupling reaction Methods 0.000 claims description 3
- 238000012913 prioritisation Methods 0.000 claims description 3
- 210000004247 hand Anatomy 0.000 claims 1
- 230000005540 biological transmission Effects 0.000 abstract 1
- 230000008859 change Effects 0.000 description 3
- 235000014510 cooky Nutrition 0.000 description 3
- 238000012217 deletion Methods 0.000 description 3
- 230000037430 deletion Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 241000196324 Embryophyta Species 0.000 description 1
- 244000287680 Garcinia dulcis Species 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000001514 detection method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 230000013011 mating Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
Abstract
The invention discloses a data forwarding method based on different priorities in a software-defined network. Through the method, a routing flow table is divided into a static route, a dynamic route and a default route which respectively represent forwarding routes with different priorities. When a route is decided, an exchanger is used for detecting the route according to the priorities from the highest to the lowest and selecting the route with the highest priority to forward data. According to the route policy, the forwarding route can be selected by the data forwarding method according to real-time flow condition and user demand of the network, so that the data transmission efficiency is increased and the network jam is effectively relieved; therefore, the data forwarding method disclosed by the invention has wide application prospect.
Description
Technical field
The invention belongs to network routing techniques field is and in particular to one kind is in software defined network (software
Defined network, sdn) in Routing Framework based on priority.
Background technology
Due to a variety of limitation of existing network framework, expedite the emergence of the generation of sdn.If network all of in network is set
The standby resource being considered as being managed, then the principle of reference operation system, can take out a network operating system (network
Os the on the one hand abstract detail of underlay network device of this network operating system of concept), is also upper strata is answered simultaneously
With providing unified administration view and DLL, so, based on this platform of network operating system, user can develop respectively
Plant application program, define network topology in logic by software, to meet the different demands to Internet resources, and need not close
The physical topological structure of heart bottom-layer network, here it is sdn.
Sdn has a lot of advantages with respect to traditional network.Controller can grasp the topologys such as the state of whole network, data
Information, according to these information, it is possible to achieve a lot of functions, for example: (1) is by ospf (open shortest
Path first, ospf) path cost in network is placed in controller and calculates, more a lot of soon than existing calculation.(2) count
The speed calculating route can be more a lot of soon than original calculation.(3) solution can be provided previously by for some problems, when problem goes out
Can solve faster now.
What in existing network, the generation of routing table was leaned on is self-learning algorithm, and every router can only understand route from neighbours
Information is it is easy to produce loop.Learn and safeguard that the packet of routing table can take certain link bandwidth and router resource.With
Development and the popularization of sdn, the service providing the user in sdn can get more and more.Openflow achieves data Layer and control
The separation of preparative layer, wherein openflow switch carry out the forwarding of data Layer, and controller achieves the function of key-course.
Controller is controlled to the flow table in openflow switch by this standard interface of openflow agreement, thus real
Now centralized Control is carried out to whole network.Flow table is made up of much individual flow table items, and each flow table item is exactly one and forwards rule.Enter
The packet entering switch obtains the destination interface of forwarding by inquiring about flow table.Flow table item is by header field, enumerator and operational group
Become；Wherein header field is ten tuple, is the mark of flow table item；Enumerator is used for counting the statistical data of flow table item；Operation is indicated
The operation that the packet mating with this flow table item should execute.The Routing Protocol of existing network is generally not suitable for software definition
Network, the present invention is therefore.
Content of the invention
The invention provides a kind of sdn Routing Framework based on different priorities, this framework provides a kind of excellent according to difference
First level selects the method forwarding next-hop, provides different forwarded services according to different user's requests.
In order to realize above-mentioned service, present invention provide the technical scheme that
A kind of based on data forwarding method in the software defined network of different priorities it is characterised in that methods described according to
Following steps are carried out:
(1) when source needs to send packet to remittance, controller judges whether enable to the static routing converging from source；If
Static routing enables, then switch selects next-hop forward node according to static routing；Otherwise, execution step (2)；
(2) controller judges whether enable to the dynamic routing converging from source；If enabled, controller is according to Route Selection
The real-time status of rule and network calculates from source to the forward-path converging, under switch is selected by the forward-path calculating
One jump forward node；If not enabled, execution step (3)；
(3) switch selects next-hop forward node according to default route.
Preferably, enabling or do not enable static routing in methods described and enabling or do not start dynamic routing is that software is fixed
In adopted network, manager is configured according to demand in the controller.
Preferably, in methods described, static routing is the forward-path that manager is arranged manually；When enabling static routing,
Switch selects next-hop forward node according to the static routing of setting.
Preferably, in methods described, default route is that controller calculates from source to the forwarding converging according to shortest-path method
Path.
Preferably, in methods described, software defined network is the software defined network using openflow agreement,
Openflow switch selects to forward route according to the matching result of datagram header (packet header).
Preferably, in methods described, datagram header is provided with matching field match fields, priority field
Priority, count area counters, instruction field instructions, timeout field timeouts, cookie；Work as presence
During a plurality of coupling route table items, the route table items of highest priority are selected to forward；Wherein priority field is route table items
Priority, prioritization is static routing > dynamic routing > default route.
Preferably, in methods described, manager increases in openflow controller, deletes, repaiies according to openflow agreement
Change route table items.
Preferably, after in methods described, the static routing of Administrator enables, openflow controller is by this static road
By write openflow switch, check flow table, if there are static routing and the just source of the static routing of write and phase of converging simultaneously
Same, then delete.
Preferably, static routing not enabled in methods described, and after manager enables dynamic routing, controller is according to route
Rule and the real-time status of network is selected to calculate from source to the forward-path converging, and the route results write by calculating
Openflow switch.
Preferably, in methods described, default route is that openflow controller can calculate from source according to shortest-path method
To the forward-path converging, and default route is write openflow switch；In static routing or dynamic routing all not enableds,
Openflow exchange opportunity selects next-hop forward node according to default route.
The principle of the present invention is for route to be divided into three major types type: static routing, dynamic routing or default route.Will be by excellent
First level repeating process is embodied by Route Selection, wherein the highest priority of static routing, the priority of dynamic routing its
Secondary, the priority of default route is minimum.Static routing is the forward-path that manager is arranged manually, its highest priority；When opening
When using static routing, switch selects next-hop forward node according to the static routing of setting.Dynamic routing is controller foundation
Routing rules, according to the real-time status of network calculate from source to the forward-path converging, its priority ratio is static
Route is low, higher than default route；When enabling dynamic routing, switch is according to dynamics route selection next-hop forward node.Silent
Recognizing route is the Shortest path routing that controller calculates according to assignment algorithm, and its priority is minimum；Do not enabling dynamic road
By or during static routing, exchange opportunity selects next-hop forward node according to default route.
Software defined network is used mostly openflow agreement, and exchange opportunity matched data header (packetheader) is come
Select to forward route.When there are a plurality of coupling route table items, the route table items of highest priority can be selected to forward.Datagram header
In priority field be route table items priority, prioritization is: static routing > dynamic routing > default route.With
When, openflow agreement provides increase, deletion, the function of modification route table items, connects for realizing Route Selection and providing operation
Mouthful.
Datagram header is as follows:
| matchfields | priority | counters | instructions | timeouts | cookie |
Wherein, match fields is matching field, to data packet matched, including ingress port data packet head etc.；
Priority is priority, represents the matching order of flow table item, static routing, dynamic routing and default route in this retransmission method
By this field；Counters is enumerator, for updating the counting of matched data bag；Instructions is instruction, is used for repairing
Change one's profession dynamic collection or pipeline processes；Timeouts is a time out field, represents that maximum time counts or stream effective time；Cookie is
The opaque data value being selected by controller, controller is used for filtering stream statistics data, stream change and stream deletion, but processing data
Can not use during bag.
The following is some elementary tactics of framework of the present invention: (1) static routing strategy: the static routing of Administrator is opened
With rear, this static routing is write switch by controller, checks flow table simultaneously, if there are the static road of static routing and firm write
By Yuan Hehui identical, then delete.(2) dynamic routing strategy: after manager enables dynamic routing, i.e. static routing not enabled,
Controller foundation routing rules (maximum load minimum in such as delay minimum, path etc.), according to the real-time shape of network
State calculate from source to converge a forward-path, network topology will be considered as weighted graph, each edge is calculated according to rule
Weight, using dijkstra shortest path first calculate from source to converge shortest path, and by calculate route results write
Switch, as dynamic routing.Here Route Selection is not unique, can be according to the different road of different application settings
Regular by selecting.(3) default routing policy: default route is that controller can calculate from source to remittance according to shortest-path method
Forward-path, network topology will be considered as no weight graph, calculated from source to the shortest path converging using dijkstra shortest path first
Footpath, and the route results calculating are write switch, as default route.In static routing or dynamic routing all not enableds,
Exchange opportunity selects next-hop forward node according to default route.
According to above elementary tactics, software defined network Routing Framework of the present invention can state following steps as:
(1) manager enables according to demand or does not enable static routing, dynamic routing.
(2) when source needs to send packet to remittance, if enabled to the static routing converging from source, according to static road
By selection next-hop forward node.Otherwise, execution step (3).
(3) whether detection enables to the dynamic routing converging from source, if enabled, controller is according to routing rules
(for example postpone maximum load minimum etc.) on minimum, path, according to the real-time status of network calculate from source to converging
Bar forward-path.If not enabled, execution step (4).
(4) source node selects next-hop forward node according to default route, and wherein default route is controller according to
Short-circuit routing method calculates from source to the forward-path converging.
Sdn provides a kind of new network, and providing different routes based on priority is a kind of critically important service.
Openflow agreement is the procotol of sdn, there is provided for the increase of flow table, deletion, modification function, be the present invention program's
Realization provides technical possibility.The demand of user, the real-time status of network are all the factors of impact routing priority, so
Under different conditions, network provides the user different route service, has very wide application prospect.
With respect to scheme of the prior art, the invention has the advantage that
(1) this method is based on software defined network, by network equipment chain of command and data surface are separated, thus real
Show the flexible control that switch is forwarded.
(2) the different priority of different route acquisition pattern correspondences, highlights the authority of manager.Static routing is pipe
Reason person's setting, highest priority；Dynamic routing is to be calculated according to network real-time status, and priority is second highest；Default route
It is to be calculated according to shortest-path method, priority is minimum.
The invention discloses the Routing Framework based on priority in a kind of software defined network.This framework will route flow table item
It is divided into static routing, dynamic routing and default route, represent the forward-path of different priorities respectively.Carrying out routing decision
When, according to priority, order from high to low detects route to switch, selects limit priority route to be forwarded.According to this
Routing policy, the present invention can select forward-path according to the real-time traffic situation of network and user's request, improves data transfer
Efficiency, effectively alleviates network congestion, has very wide application prospect.
Brief description
Below in conjunction with the accompanying drawings and embodiment the invention will be further described:
Fig. 1 is the flow chart that in framework of the present invention, switch judges forward-path；
Fig. 2 is the network topological diagram that routing policy is described for framework of the present invention.
Specific embodiment
Below in conjunction with specific embodiment, such scheme is described further.It should be understood that these embodiments are for illustrating
The present invention and be not limited to limit the scope of the present invention.The implementation condition adopting in embodiment can be done according to the condition of concrete producer
Adjust further, not marked implementation condition is usually the condition in normal experiment.
Embodiment
The present embodiment is that in software defined network, switch is based on priority selection forward-path, it is possible to achieve dynamic turn
Send out.Route is divided into static routing, default route, dynamic routing, wherein static routing is the forwarding road that manager is arranged manually
Footpath, its highest priority；Dynamic routing is controller according to routing rules, according to the real-time status of network calculate from
To the forward-path converging, its priority ratio static routing is low in source, higher than default route；In the present embodiment, set time delay
Minimum forward-path is dynamic routing, and this rule is not unique, can be changed according to real needs.Default route be controller according to
The Shortest path routing that assignment algorithm calculates, its priority is minimum.The routing policy of the present embodiment is as follows:
(1) static routing strategy: after the static routing of Administrator enables, this static routing is write and exchanges by controller
Machine, checks flow table simultaneously, identical with the Yuan Hehui of the static routing of firm write if there are static routing, then delete.
(2) dynamic routing strategy: after manager enables dynamic routing, i.e. static routing not enabled, controller is according to route
Select that the real-time status of rule (the selection rule of the present embodiment be time delay minimum) and network calculates from source to of remittance
Forward-path, network topology will be considered as weighted graph, and the real-time Forwarding Delay pro rata of each switch is counted as from exchange
Machine produces the weights on side, using dijkstra shortest path first calculate from source to converge shortest path, as dynamic routing, and
By the route results calculating write switch.
(3) default routing policy: default route be controller can according to shortest-path method calculate from source to converge
Forward-path, network topology will be considered as no weight graph, calculated from source to the shortest path converging using dijkstra algorithm, as silent
Recognize route, by the route results calculating write switch.In static routing or dynamic routing all not enableds, exchange opportunity according to
Default route selects next-hop forward node.
In order to framework of the present invention is described, the present embodiment employs network as shown in Figure 2, dynamics route selection forward-path
Rule be time delay minimum it is assumed that all link circuit conditions are all identical, implementation steps are as follows:
(1) in the whole process of embodiment, from h2 to h3 with constant rate sending data bag so that from s6 forward institute
Taking time is to forward 10 times of required time from idle switch, all by s6- > all routing delays of s5 become big；
(2) send packet from h1 to h4, observe forward-path, observe and stop after finishing sending packet from h1 to h4；
(3) static routing h1- > s1- > s2- > s3- > s4- > s5- > h4 from h1 to h4 for the setting, sends data from h1 to h4
Bag, observes forward-path, observes and stops after finishing sending packet from h1 to h4；
(4) enable the dynamic routing from h1 to h4, send packet from h1 to h4, observe forward-path, observe after finishing
Stop sending packet from h1 to h4；
(5) close static routing from h1 to h4 and dynamic routing, reactivate the dynamic routing from h1 to h4, from h1 to
H4 sends packet, observes forward-path, observes and stops after finishing sending packet from h1 to h4；
(6) close the dynamic routing from h1 to h4, observe forward-path, observe and stop after finishing sending data from h1 to h4
Bag.
The effect of described step (1) is to allow this link Overload of s6- > s5, and the forwarding load of switch s6 becomes big, makes
Must all by s6- > routing delays of s5 become big.
In step (2), network topological diagram is considered as no weight graph, controller, according to dijkstra shortest path first, is asked
Obtaining shortest path is h1- > s1- > s6- > s5- > h4, as default route.So observing that forward-path is h1- > s1- > s6- >
s5->h4.
Observe that forward-path is h1- in step (3) > s1- > s2- > s3- > s4- > s5- > h4, this path is manager
The static routing of setting.
Observe that forward-path is still h1- > s1- > s2- > s3- > s4- > s5- > h4, because static routing in step (4)
Priority ratio dynamic routing high, so forward-path is still the static routing arranging in step (3).
Observe that forward-path is h1- in step (5) > s1- > s3- > s4- > s5- > h4, after execution step (5), control
Device processed calculates dynamic routing according to the minimum principle of time delay, because opening again after closing static routing and dynamic routing
Dynamic routing, the highest priority of the dynamic routing now opened, controller calculates dynamic routing, and network topological diagram is considered as
Weighted graph, is known that by step (1) forwarding required time from s6 is forward required time from idle switch 10 times, controller is given
It is 10 that weights are assigned on s6- > s5 side, and it is 1 that weights are assigned on other sides of in figure, is tried to achieve from h1 to h4 according to dijkstra shortest path first
Shortest path, trying to achieve shortest path is h1- > s1- > s3- > s4- > s5- > h4, so the forward-path observed is h1- > s1- >
s3->s4->s5->h4；
It was observed that forward-path is h1- > s1- > s6- > s5- > h4, because manager does not enable static state in step (6)
Route or dynamic routing, so exchange opportunity is forwarded according to default route.
Examples detailed above only technology design to illustrate the invention and feature, its object is to allow the person skilled in the art be
Will appreciate that present disclosure and implement according to this, can not be limited the scope of the invention with this.All smart according to the present invention
Equivalent transformation or modification that god's essence is done, all should be included within the scope of the present invention.
Claims (9)
1. a kind of based on data forwarding method in the software defined network of different priorities it is characterised in that methods described is according to such as
Lower step is carried out:
(1) when source needs to send packet to remittance, controller judges whether enable to the static routing converging from source；If static
Route enables, then switch selects next-hop forward node according to static routing；Otherwise, execution step (2)；
(2) controller judges whether enable to the dynamic routing converging from source；If enabled, controller is according to routing rules
Calculate from source to the forward-path converging with the real-time status of network, switch selects next-hop by the forward-path calculating
Forward node；If not enabled, execution step (3)；
(3) switch selects next-hop forward node according to default route；
Switch selects to forward route according to the matching result of datagram header；Datagram header is provided with matching field, priority word
Section, count area, instruction field, timeout field；When there are a plurality of coupling route table items, select the routing table of highest priority
Item forwards；Wherein priority field is the priority of route table items, and prioritization is static routing > dynamic routing > acquiescence road
By.
2. data forwarding method according to claim 1 is it is characterised in that enabling in methods described or not enabling static road
By and to enable or do not start dynamic routing be that in software defined network, manager is configured according to demand in the controller.
3. data forwarding method according to claim 2 it is characterised in that in methods described static routing be manager's handss
The forward-path of dynamic setting；When enabling static routing, switch selects next-hop forward node according to the static routing of setting.
4. data forwarding method according to claim 2 it is characterised in that in methods described default route be controller root
Calculate from source to the forward-path converging according to shortest-path method.
5. data forwarding method according to claim 1 it is characterised in that in methods described software defined network be employing
The software defined network of openflow agreement, switch is openflow switch.
6. data forwarding method according to claim 5 is it is characterised in that manager is according to openflow in methods described
Agreement increases in openflow controller, deletes, changes route table items.
7. data forwarding method according to claim 5 it is characterised in that in methods described Administrator static road
After enabling, this static routing is write openflow switch by openflow controller, checks flow table, if there are static state simultaneously
Route is identical with the Yuan Hehui of the static routing of firm write, then delete.
8. data forwarding method according to claim 5 is it is characterised in that static routing not enabled in methods described, and manages
After reason person enables dynamic routing, controller calculates from source to the forwarding converging according to the real-time status of routing rules and network
Path, and the route results calculating are write openflow switch.
9. data forwarding method according to claim 5 it is characterised in that in methods described default route be openflow
Controller can calculate from source to the forward-path converging according to shortest-path method, and default route write openflow is exchanged
Machine；In static routing or dynamic routing all not enableds, openflow exchange opportunity selects next-hop to forward according to default route
Node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410074396.4A CN103825823B (en) | 2014-02-21 | 2014-02-21 | Data forwarding method based on different priorities in software-defined network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410074396.4A CN103825823B (en) | 2014-02-21 | 2014-02-21 | Data forwarding method based on different priorities in software-defined network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103825823A CN103825823A (en) | 2014-05-28 |
| CN103825823B true CN103825823B (en) | 2017-02-01 |
Family
ID=50760662
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410074396.4A Expired - Fee Related CN103825823B (en) | 2014-02-21 | 2014-02-21 | Data forwarding method based on different priorities in software-defined network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103825823B (en) |
Families Citing this family (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105207951B (en) * | 2014-06-05 | 2020-06-09 | 北京邮电大学 | Wide area network flow optimization control method and device |
| CN104079651B (en) * | 2014-06-27 | 2017-09-15 | 东南大学 | Broadcasting and TV multi-outlet intelligent scheduling system and method based on SDN frameworks |
| CN104104718B (en) * | 2014-07-02 | 2017-05-17 | 北京邮电大学 | User autonomous routing customization system based on software-defined network |
| CN104113482B (en) * | 2014-07-23 | 2017-11-24 | 华为技术有限公司 | The methods, devices and systems of flow table renewal |
| CN105634986B (en) * | 2014-11-30 | 2019-04-23 | 中国科学院沈阳自动化研究所 | A kind of interchanger implementation method and system |
| CN104767695B (en) * | 2015-04-20 | 2017-11-14 | 清华大学 | A kind of stream scheduling method of task rank in data center |
| TWI585593B (en) | 2015-06-03 | 2017-06-01 | 鴻海精密工業股份有限公司 | Method and system for optimizing transfer path |
| US9866483B2 (en) * | 2015-07-20 | 2018-01-09 | Schweitzer Engineering Laboratories, Inc. | Routing of traffic in network through automatically generated and physically distinct communication paths |
| EP3345341A1 (en) | 2015-10-20 | 2018-07-11 | Huawei Technologies Co., Ltd. | Direct replying actions in sdn switches |
| CN108234314B (en) * | 2016-12-15 | 2020-11-06 | 新华三技术有限公司 | Service scheduling method and device |
| CN106888163A (en) * | 2017-03-31 | 2017-06-23 | 中国科学技术大学苏州研究院 | The method for routing divided based on network domains in software defined network |
| CN106789660B (en) * | 2017-03-31 | 2020-08-28 | 中国科学技术大学苏州研究院 | QoS sensible flow management method in software defined network |
| CN107333312B (en) * | 2017-08-01 | 2019-03-05 | 陕西师范大学 | Route selection method in opportunistic network |
| CN107809381B (en) * | 2017-10-19 | 2021-08-10 | 北京邮电大学 | Method for realizing active audit based on routing loop in SDN |
| CN108199970B (en) * | 2017-12-15 | 2020-08-04 | 浙江大学 | Method for reconstructing data packet path in software defined network |
| CN109451552B (en) * | 2018-11-21 | 2022-03-15 | 上海事凡物联网科技有限公司 | Data transmission method, equipment, terminal and storage medium based on hybrid routing networking |
| CN109413709B (en) * | 2018-11-21 | 2022-03-29 | 上海事凡物联网科技有限公司 | Ad hoc network static routing method, device, communication node and storage medium |
| CN113315698B (en) * | 2021-05-25 | 2022-07-05 | 中国电子科技集团公司第二十九研究所 | Task-based sensor networking message routing method |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7664119B2 (en) * | 2001-03-30 | 2010-02-16 | Intel Corporation | Method and apparatus to perform network routing |
| CN101695047B (en) * | 2009-10-26 | 2015-01-28 | 中兴通讯股份有限公司 | Method and switch for realizing forwarding of dynamic tunnel message |
| CN101902391B (en) * | 2010-03-15 | 2013-01-16 | 杭州华三通信技术有限公司 | Intelligent static route based method and equipment for forwarding messages |
| CN102170394B (en) * | 2011-04-19 | 2014-02-12 | 杭州华三通信技术有限公司 | Method and apparatus for message forwarding |
| CN103457854B (en) * | 2013-09-16 | 2017-03-08 | 杭州华三通信技术有限公司 | A kind of message forwarding method and equipment |
-
2014
- 2014-02-21 CN CN201410074396.4A patent/CN103825823B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN103825823A (en) | 2014-05-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103825823B (en) | Data forwarding method based on different priorities in software-defined network | |
| US11159432B2 (en) | Data transmission method, and switch and network control system using the method | |
| JP5975083B2 (en) | COMMUNICATION SYSTEM, CONTROL DEVICE, PACKET TRANSFER ROUTE CONTROL METHOD, AND PROGRAM | |
| CN104104718B (en) | User autonomous routing customization system based on software-defined network | |
| CN104158753B (en) | Dynamic stream scheduling method and system based on software defined network | |
| CN105337857B (en) | A kind of multi-path transmission method based on software defined network | |
| CN103716208B (en) | Support network management, system, interchanger and the network of elephant stream | |
| CN103618677B (en) | Network flow regulation method and system | |
| CN103348635B (en) | Network system, control unit and optimum route control method | |
| CN104994033A (en) | Method for guaranteeing QoS (quality of service) of SDN (software defined network) by means of dynamic resource management | |
| CN107566274A (en) | RSVP LSP and non-resource reservation protocol LSP Bandwidth Management | |
| CN103346922A (en) | Controller for determining network state based on SDN (Software Defined Networking) and determination method thereof | |
| CN106817299B (en) | The list item generation method and device and message forwarding method of software defined network | |
| CN106209623A (en) | Determine method and the control equipment of forward-path | |
| CN106559330A (en) | A kind of dynamic path planning method based on SDN | |
| WO2013059683A1 (en) | Comprehensive multipath routing for congestion and quality-of-service in communication networks | |
| CN101841487A (en) | Configuration method for aggregating link service flow and packet switching device | |
| CN104158739B (en) | A kind of IP traffic engineerings management method and device | |
| Michael et al. | Optimal link-state hop-by-hop routing | |
| CN108337179A (en) | Link flow control method and device | |
| CN105847146B (en) | A method of it improving level distribution SDN and controls plane router efficiency | |
| CN107659505A (en) | The route selecting method and SDN controllers of a kind of SDN | |
| CN107046504A (en) | Method and controller for the traffic engineering in communication network | |
| CN105024934B (en) | A kind of real-time traffic dispatching method and system | |
| CN107872385A (en) | A kind of SDN router-level topology and control method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170201 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |