CN103825823A - 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
- CN103825823A CN103825823A CN201410074396.4A CN201410074396A CN103825823A CN 103825823 A CN103825823 A CN 103825823A CN 201410074396 A CN201410074396 A CN 201410074396A CN 103825823 A CN103825823 A CN 103825823A
- Authority
- CN
- China
- Prior art keywords
- routing
- route
- static routing
- path
- data forwarding
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 230000003068 static effect Effects 0.000 claims abstract description 67
- 235000014510 cooky Nutrition 0.000 claims description 4
- 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
- 230000005540 biological transmission Effects 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 244000287680 Garcinia dulcis Species 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000008859 change Effects 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
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
Images
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 route technology field, be specifically related to one Routing Framework based on priority in software defined network (Software Defined Network, SDN).
Background technology
Due to all limitation of existing network framework, expedite the emergence of the generation of SDN.If the resource that the network equipments all in network is considered as being managed, so with reference to the principle of operating system, can take out the concept of a network operating system (Network OS)-this network operating system abstract on the one hand the detail of underlay network device, simultaneously also for upper layer application provides unified administration view and DLL (dynamic link library), like this, this platform of operating system Network Based, user can develop various application programs, define network topology in logic by software, to meet the different demands to Internet resources, and without the physical topological structure of being concerned about bottom-layer network, Here it is SDN.
SDN has a lot of advantages with respect to traditional network.Controller can be grasped the topology information such as state, data of whole network, according to these information, can realize 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 account form.(2) speed of calculating route can be more a lot of soon than original account form.(3) can be some problems solution is provided in advance, in the time that problem occurs, can solve faster.
What in existing network, the generation of routing table was leaned on is self-learning algorithm, and every router can only be understood routing iinformation from neighbours, is easy to produce loop.The packet of study and maintaining routing list can take certain link bandwidth and router resource.Along with the development of SDN and universal, the service providing for user in SDN can get more and more.Openflow has realized separating of data Layer and key-course, and wherein openflow switch carries out the forwarding of data Layer, and Controller has realized the function of key-course.Controller controls the stream table in openflow switch by this standard interface of openflow agreement, thereby realize, whole network is carried out to centralized control.Stream table is made up of a lot of stream list items, and each stream list item is exactly one and forwards rule.The packet that enters switch shows to obtain the destination interface of forwarding by inquiry stream.Stream list item is made up of header field, counter and operation; Wherein header field is ten tuple, is the mark of stream list item; Counter is used for counting the statistics of stream list item; The operation that the packet that mates with this stream list item should be carried out has been indicated in operation.The Routing Protocol of existing network is not suitable for software defined network conventionally, and the present invention therefore.
Summary of the invention
The invention provides a kind of SDN Routing Framework based on different priorities, this framework provides a kind of method of selecting to forward down hop according to different priorities, provides different forwarded services according to different user's requests.
In order to realize above-mentioned service, technical scheme provided by the invention is:
A data forwarding method in software defined network based on different priorities, is characterized in that described method carries out in accordance with the following steps:
(1) in the time that source need to send packet to remittance, controller judges from source to the static routing converging whether enable; If static routing is enabled, switch is selected down hop forward node according to static routing; Otherwise, execution step (2);
(2) controller judges from source to the dynamic routing converging whether enable; If enabled, controller calculates from source to the forward-path converging according to the real-time status of routing rules and network, and switch is selected down hop forward node by the forward-path calculating; If not enabled, execution step (3);
(3) switch is selected down hop forward node according to default route.
Preferably, in described method, enabling or do not enable static routing and enable or do not start dynamic routing is that in software defined network, keeper arranges according to demand in controller.
Preferably, in described method, static routing is the forward-path that administrator hand arranges; In the time enabling static routing, switch is selected down hop forward node according to the static routing arranging.
Preferably, in described method, default route is that controller calculates from source to the forward-path converging according to shortest-path method.
Preferably, in described method, software defined network is the software defined network that adopts openflow agreement, and openflow switch selects to forward route according to the matching result of datagram header (packet header).
Preferably, in described method, datagram header is provided with matching field Match Fields, priority field Priority, count area Counters, instruction field Instructions, overtime field Timeouts, Cookie; In the time there is many coupling route table items, select the route table items that priority is the highest to forward; The priority that wherein Priority field is route table items, prioritization is static routing > dynamic routing > default route.
Preferably, in described method, keeper increases, deletes, revises route table items according to openflow agreement in openflow controller.
Preferably, after in described method, the static routing of Administrator is enabled, this static routing is write openflow switch by openflow controller, checks stream table simultaneously, if there is static routing identical with the Yuan Hehui of the static routing just writing, deletes.
Preferably, static routing not enabled in described method, and keeper enables after dynamic routing, controller calculates from source to the forward-path converging according to the real-time status of routing rules and network, and the route results of calculating is write to openflow switch.
Preferably, in described method, default route is that openflow controller can calculate from source to the forward-path converging according to shortest-path method, and default route is write to openflow switch; In static routing or dynamic routing, all when not enabled, openflow exchange opportunity is selected down hop forward node according to default route.
Principle of the present invention is route to be divided into three major types type: static routing, dynamic routing or default route.According to priority repeating process embodies by Route Selection, and wherein the priority of static routing is the highest, and secondly, the priority of default route is minimum for the priority of dynamic routing.Static routing is the forward-path that administrator hand arranges, and its priority is the highest; In the time enabling static routing, switch is selected down hop forward node according to the static routing arranging.Dynamic routing be controller according to routing rules, calculate according to the real-time status of network from source to converge a forward-path, its priority ratio static routing is low, higher than default route; In the time enabling dynamic routing, switch is selected down hop forward node according to dynamic routing.Default route is the shortest path route that controller calculates according to assignment algorithm, and its priority is minimum; In the time not enabling dynamic routing or static routing, exchange opportunity is selected down hop forward node according to default route.
Software defined network uses openflow agreement mostly, and exchange opportunity matched data header (packetheader) selects to forward route.In the time there is many coupling route table items, can select the route table items that priority is the highest to forward.The priority that Priority field in datagram header is route table items, prioritization is: static routing > dynamic routing > default route.Meanwhile, openflow agreement provides the function of increase, deletion, modification route table items, provides operation-interface for realizing Route Selection.
Datagram header is as follows:
| MatchFields | Priority | Counters | Instructions | Timeouts | Cookie |
Wherein, Match Fields is matching field, to data packet matched, comprises ingress port and packet header etc.; Priority is priority, represents the matching order of stream list item, and static routing in this retransmission method, dynamic routing and default route are by this field; Counters is counter, for upgrading the counting of matched data bag; Instructions is instruction, for revising action collection or pipeline processes; Timeouts is overtime field, and expression maximum time counts or flows effective time; Cookie is the opaque data value of being selected by controller, and controller is used for filtering stream statistics, stream changes and stream is deleted, but can not use when handle packet.
It is below some elementary tactics of framework of the present invention: (1) static routing strategy: after the static routing of Administrator is enabled, this static routing is write switch by controller, check stream table simultaneously, if there is static routing identical with the Yuan Hehui of the static routing just writing, delete.(2) dynamic routing strategy: keeper enables after dynamic routing, it is static routing not enabled, controller for example, according to routing rules (the maximum load minimum on delay minimum, path etc.), calculate according to the real-time status of network from source to converge a forward-path, be considered as weighted graph by network topology, calculate the weight on every limit according to rule, utilize Dijkstra shortest path first to calculate from source to the shortest path converging, and the route results of calculating is write to switch, be dynamic routing.The Route Selection is here not unique, can different routing rules be set according to different application.(3) default route strategy: default route is that controller can calculate from source to the forward-path converging according to shortest-path method, be considered as without weight graph by network topology, utilize Dijkstra shortest path first to calculate from source to the shortest path converging, and the route results of calculating is write to switch, be default route.In static routing or dynamic routing, all when not enabled, exchange opportunity is selected down hop forward node according to default route.
According to above elementary tactics, software defined network Routing Framework of the present invention can be stated following steps as:
(1) keeper enables or does not enable static routing, dynamic routing according to demand.
(2) in the time that source need to send packet to remittance, if enabled from source to the static routing converging, select down hop forward node according to static routing.Otherwise, execution step (3).
(3) detect from source to the dynamic routing converging and whether enable, if enabled, controller is for example, according to routing rules (postpone maximum load minimum etc.) on minimum, path, calculate according to the real-time status of network from source to the forward-path converging.If not enabled, execution step (4).
(4) source node is selected down hop forward node according to default route, and wherein default route is that controller calculates from source to the forward-path converging according to shortest-path method.
SDN provides a kind of new network, and providing different routes based on priority is very important one service.Openflow agreement is the procotol of SDN, and increase, deletion, modify feature for stream table are provided, for the present invention program's realization provides technical possibility.User's demand, the real-time status of network are all the factors that affects route priority, so under different conditions, network, for user provides different route service, has very wide application prospect.
With respect to scheme of the prior art, advantage of the present invention is:
(1) this method, based on software defined network, by network equipment chain of command and data surface are separated, thereby has realized the flexible control that switch is forwarded.
(2) priority corresponding to different route acquisition patterns, the authority of having given prominence to keeper.Static routing is Administrator, and priority is the highest; Dynamic routing is that state computation draws during according to network implementation, and priority is time high; Default route is to calculate according to shortest-path method, and priority is minimum.
The invention discloses the Routing Framework based on priority in a kind of software defined network.Route flow list item is divided into static routing, dynamic routing and default route by this framework, represents respectively the forward-path of different priorities.In the time carrying out routing decision, switch detects route according to priority order from high to low, selects limit priority route to forward.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, has improved data transmission efficiency, has effectively alleviated network congestion, has very wide application prospect.
Accompanying drawing explanation
Below in conjunction with drawings and Examples, 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 that framework of the present invention is the network topological diagram of explanation routing policy.
Embodiment
Below in conjunction with specific embodiment, such scheme is described further.Should be understood that these embodiment are not limited to limit the scope of the invention for the present invention is described.The implementation condition adopting in embodiment can be done further adjustment according to the condition of concrete producer, and not marked implementation condition is generally the condition in normal experiment.
Embodiment
The present embodiment is that in software defined network, switch is selected forward-path based on priority, can realize dynamic forwarding.Route is divided into static routing, default route, dynamic routing, and wherein static routing is the forward-path that administrator hand arranges, and its priority is the highest; Dynamic routing be controller according to routing rules, calculate according to the real-time status of network from source to converge a forward-path, its priority ratio static routing is low, higher than default route; In the present embodiment, the forward-path of setting time delay minimum is dynamic routing, and this rule is not unique, can change according to real needs.Default route is the shortest path route that controller calculates according to assignment algorithm, and its priority is minimum.The routing policy of the present embodiment is as follows:
(1) static routing strategy: after the static routing of Administrator is enabled, this static routing is write switch by controller checks stream table simultaneously, if there is static routing identical with the Yuan Hehui of the static routing just writing, deletes.
(2) dynamic routing strategy: keeper enables after dynamic routing, it is static routing not enabled, controller calculate according to the real-time status of routing rules (selective rule of the present embodiment is time delay minimum) and network from source to converge a forward-path, be considered as weighted graph by network topology, the real-time Forwarding Delay pro rata of each switch is counted as to the weights that produce limit from switch, utilize Dijkstra shortest path first to calculate from source to the shortest path converging, be dynamic routing, and the route results of calculating is write to switch.
(3) default route strategy: default route be controller can calculate according to shortest-path method from source to converge forward-path, be considered as without weight graph by network topology, utilize dijkstra's algorithm to calculate from source to the shortest path converging, be default route, the route results of calculating is write to switch.In static routing or dynamic routing, all when not enabled, exchange opportunity is selected down hop forward node according to default route.
For framework of the present invention is described, the present embodiment has used network as shown in Figure 2, and it is time delay minimum that the rule of forward-path is selected in dynamic routing, supposes that all link circuit conditions are all identical, and implementation step is as follows:
(1) in the whole process of embodiment, from h2 to h3, with constant rate sending data bag, making to forward required time from S6 is to forward 10 times of required time from idle switch, and all route time delays by S6->S5 become large;
(2) send packet from h1 to h4, observe forward-path, after observation, stop sending packet from h1 to h4;
(3) the static routing h1->S1->S2->S3->S4->S5->h4 from h1 to h4 is set, send packet from h1 to h4, observe forward-path, after observation, stop sending packet from h1 to h4;
(4) enable the dynamic routing from h1 to h4, send packet from h1 to h4, observe forward-path, after observation, stop sending packet from h1 to h4;
(5) close static routing and the dynamic routing from h1 to h4, reactivate the dynamic routing from h1 to h4, send packet from h1 to h4, observe forward-path, after observation, stop sending packet from h1 to h4;
(6) close the dynamic routing from h1 to h4, observe forward-path, after observation, stop sending packet from h1 to h4.
The effect of described step (1) is that the forwarding load of switch S6 becomes large, makes all route time delays by S6->S5 become large in order to allow this link overload of S6->S5.
In step (2), network topological diagram is considered as without weight graph, controller is according to Dijkstra shortest path first, and trying to achieve shortest path is h1->S1->S6->S5->h4, is default route.Be h1->S1->S6->S5->h4 so observe forward-path.
In step (3), observing forward-path is h1->S1->S2->S3->S4->S5->h4, the static routing that this path is Administrator.
In step (4), observing forward-path is still h1->S1->S2->S3->S4->S5->h4, because the priority ratio dynamic routing of static routing is high, so forward-path is still the static routing arranging in step (3).
In step (5), observing forward-path is h1->S1->S3->S4->S5->h4, after execution step (5), controller calculates dynamic routing according to the principle of time delay minimum, because opened again dynamic routing after having closed static routing and dynamic routing, the priority of the dynamic routing of now opening is the highest, controller calculates dynamic routing, network topological diagram is considered as to weighted graph, know that by step (1) forwarding required time from S6 is 10 times from idle switch forwarding required time, it is 10 that controller is composed weights to S6->S5 limit, in figure, other limits tax weights are 1, try to achieve the shortest path from h1 to h4 according to Dijkstra shortest path first, trying to achieve shortest path is h1->S1->S3->S4->S5->h4, so the forward-path of observing is h1->S1->S3->S4->S5->h4,
In step (6), observing forward-path is h1->S1->S6->S5->h4, because keeper does not enable static routing or dynamic routing, exchange opportunity forwards according to default route.
Above-mentioned example is only explanation technical conceive of the present invention and feature, and its object is to allow person skilled in the art can understand content of the present invention and implement according to this, can not limit the scope of the invention with this.All equivalent transformations that Spirit Essence does according to the present invention or modification, within all should being encompassed in protection scope of the present invention.
Claims (10)
1. a data forwarding method in the software defined network based on different priorities, is characterized in that described method carries out in accordance with the following steps:
(1) in the time that source need to send packet to remittance, controller judges from source to the static routing converging whether enable; If static routing is enabled, switch is selected down hop forward node according to static routing; Otherwise, execution step (2);
(2) controller judges from source to the dynamic routing converging whether enable; If enabled, controller calculates from source to the forward-path converging according to the real-time status of routing rules and network, and switch is selected down hop forward node by the forward-path calculating; If not enabled, execution step (3);
(3) switch is selected down hop forward node according to default route.
2. data forwarding method according to claim 1, it is characterized in that enabling or not enabling in described method static routing and enabling or do not start dynamic routing is that in software defined network, keeper arranges according to demand in controller.
3. data forwarding method according to claim 2, is characterized in that in described method, static routing is the forward-path that administrator hand arranges; In the time enabling static routing, switch is selected down hop forward node according to the static routing arranging.
4. data forwarding method according to claim 2, is characterized in that in described method, default route is that controller calculates from source to the forward-path converging according to shortest-path method.
5. data forwarding method according to claim 1, it is characterized in that in described method, software defined network is the software defined network that adopts openflow agreement, openflow switch selects to forward route according to the matching result of datagram header (packet header).
6. data forwarding method according to claim 5, is characterized in that in described method, datagram header is provided with matching field Match Fields, priority field Priority, count area Counters, instruction field Instructions, overtime field Timeouts, Cookie; In the time there is many coupling route table items, select the route table items that priority is the highest to forward; The priority that wherein Priority field is route table items, prioritization is static routing > dynamic routing > default route.
7. data forwarding method according to claim 6, is characterized in that in described method, keeper increases, deletes, revises route table items according to openflow agreement in openflow controller.
8. data forwarding method according to claim 6, after the static routing that it is characterized in that Administrator in described method is enabled, this static routing is write openflow switch by openflow controller, check stream table simultaneously, if there is static routing identical with the Yuan Hehui of the static routing just writing, delete.
9. data forwarding method according to claim 6, it is characterized in that static routing not enabled in described method, and keeper enables after dynamic routing, controller calculates from source to the forward-path converging according to the real-time status of routing rules and network, and the route results of calculating is write to openflow switch.
10. data forwarding method according to claim 6, is characterized in that in described method, default route is that openflow controller can calculate from source to the forward-path converging according to shortest-path method, and default route is write to openflow switch; In static routing or dynamic routing, all when not enabled, openflow exchange opportunity is selected down hop forward node according to default route.
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 true CN103825823A (en) | 2014-05-28 |
| CN103825823B 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) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079651A (en) * | 2014-06-27 | 2014-10-01 | 东南大学 | Broadcasting and television multi-export intelligent scheduling system and method based on SDN frame |
| CN104104718A (en) * | 2014-07-02 | 2014-10-15 | 北京邮电大学 | User autonomous routing customization system based on software-defined network |
| CN104113482A (en) * | 2014-07-23 | 2014-10-22 | 华为技术有限公司 | Flow table updating method, device and system |
| CN104767695A (en) * | 2015-04-20 | 2015-07-08 | 清华大学 | Stream scheduling method for task classes in data center |
| CN105207951A (en) * | 2014-06-05 | 2015-12-30 | 北京邮电大学 | Wide area network flow optimization control method and apparatus |
| CN105634986A (en) * | 2014-11-30 | 2016-06-01 | 中国科学院沈阳自动化研究所 | Switch implementation method and system |
| US9645748B2 (en) | 2015-06-03 | 2017-05-09 | Hon Hai Precision Industry Co., Ltd. | Method and system for transmission path optimization in a storage area network |
| CN106789660A (en) * | 2017-03-31 | 2017-05-31 | 中国科学技术大学苏州研究院 | The appreciable flow managing methods of QoS in software defined network |
| CN106888163A (en) * | 2017-03-31 | 2017-06-23 | 中国科学技术大学苏州研究院 | The method for routing divided based on network domains in software defined network |
| CN107333312A (en) * | 2017-08-01 | 2017-11-07 | 陕西师范大学 | Route selection method in opportunistic network |
| CN107615710A (en) * | 2015-10-20 | 2018-01-19 | 华为技术有限公司 | Direct reply action in SDN switch |
| CN107710685A (en) * | 2015-07-20 | 2018-02-16 | 施瓦哲工程实验有限公司 | Flow route is carried out in a network by communication paths automatically generate and physically different |
| CN107809381A (en) * | 2017-10-19 | 2018-03-16 | 北京邮电大学 | One kind, which is realized, is based on route loop active auditing algorithm and implementation method in SDN |
| CN108199970A (en) * | 2017-12-15 | 2018-06-22 | 浙江大学 | Packet path reconstructing method in a kind of software defined network |
| CN108234314A (en) * | 2016-12-15 | 2018-06-29 | 新华三技术有限公司 | Business scheduling method and device |
| CN109413709A (en) * | 2018-11-21 | 2019-03-01 | 上海事凡物联网科技有限公司 | Ad hoc network static routing method, apparatus, communication node and storage medium |
| CN109451552A (en) * | 2018-11-21 | 2019-03-08 | 上海事凡物联网科技有限公司 | Data transmission method, equipment, terminal and storage medium based on mixed logic dynamic networking |
| CN113315698A (en) * | 2021-05-25 | 2021-08-27 | 中国电子科技集团公司第二十九研究所 | Task-based sensor networking message routing method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1511399A (en) * | 2001-03-30 | 2004-07-07 | ض� | Method and apparatus to perform network routing |
| CN101902391A (en) * | 2010-03-15 | 2010-12-01 | 杭州华三通信技术有限公司 | Intelligent static route based method and equipment for forwarding messages |
| CN102170394A (en) * | 2011-04-19 | 2011-08-31 | 杭州华三通信技术有限公司 | Method and apparatus for message forwarding |
| EP2482500A1 (en) * | 2009-10-26 | 2012-08-01 | ZTE Corporation | Method for performing dynamic tunnel message forwarding and switch thereof |
| CN103457854A (en) * | 2013-09-16 | 2013-12-18 | 杭州华三通信技术有限公司 | Method and equipment for forwarding message |
-
2014
- 2014-02-21 CN CN201410074396.4A patent/CN103825823B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1511399A (en) * | 2001-03-30 | 2004-07-07 | ض� | Method and apparatus to perform network routing |
| EP2482500A1 (en) * | 2009-10-26 | 2012-08-01 | ZTE Corporation | Method for performing dynamic tunnel message forwarding and switch thereof |
| CN101902391A (en) * | 2010-03-15 | 2010-12-01 | 杭州华三通信技术有限公司 | Intelligent static route based method and equipment for forwarding messages |
| CN102170394A (en) * | 2011-04-19 | 2011-08-31 | 杭州华三通信技术有限公司 | Method and apparatus for message forwarding |
| CN103457854A (en) * | 2013-09-16 | 2013-12-18 | 杭州华三通信技术有限公司 | Method and equipment for forwarding message |
Cited By (32)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105207951A (en) * | 2014-06-05 | 2015-12-30 | 北京邮电大学 | Wide area network flow optimization control method and apparatus |
| CN105207951B (en) * | 2014-06-05 | 2020-06-09 | 北京邮电大学 | Wide area network flow optimization control method and device |
| CN104079651A (en) * | 2014-06-27 | 2014-10-01 | 东南大学 | Broadcasting and television multi-export intelligent scheduling system and method based on SDN frame |
| 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 |
| CN104104718A (en) * | 2014-07-02 | 2014-10-15 | 北京邮电大学 | User autonomous routing customization system based on software-defined network |
| CN104113482A (en) * | 2014-07-23 | 2014-10-22 | 华为技术有限公司 | Flow table updating method, device and system |
| CN105634986A (en) * | 2014-11-30 | 2016-06-01 | 中国科学院沈阳自动化研究所 | Switch implementation method and system |
| WO2016082282A1 (en) * | 2014-11-30 | 2016-06-02 | 中国科学院沈阳自动化研究所 | Method and system for implementing 802.1p-supporting openvswitch switch |
| US10110517B2 (en) | 2014-11-30 | 2018-10-23 | Shenyang Institute Of Automation, Chinese Academy Of Sciences | System and method for open vSwitch virtual switch that supports IEEE 802.1p |
| CN104767695A (en) * | 2015-04-20 | 2015-07-08 | 清华大学 | Stream scheduling method for task classes in data center |
| CN104767695B (en) * | 2015-04-20 | 2017-11-14 | 清华大学 | A kind of stream scheduling method of task rank in data center |
| US9645748B2 (en) | 2015-06-03 | 2017-05-09 | Hon Hai Precision Industry Co., Ltd. | Method and system for transmission path optimization in a storage area network |
| CN107710685A (en) * | 2015-07-20 | 2018-02-16 | 施瓦哲工程实验有限公司 | Flow route is carried out in a network by communication paths automatically generate and physically different |
| US10819659B2 (en) | 2015-10-20 | 2020-10-27 | Huawei Technologies Co., Ltd. | Direct replying actions in SDN switches |
| CN107615710A (en) * | 2015-10-20 | 2018-01-19 | 华为技术有限公司 | Direct reply action in SDN switch |
| CN107615710B (en) * | 2015-10-20 | 2020-11-17 | 华为技术有限公司 | Direct reply actions in SDN switches |
| CN108234314B (en) * | 2016-12-15 | 2020-11-06 | 新华三技术有限公司 | Service scheduling method and device |
| CN108234314A (en) * | 2016-12-15 | 2018-06-29 | 新华三技术有限公司 | Business scheduling method and device |
| CN106789660B (en) * | 2017-03-31 | 2020-08-28 | 中国科学技术大学苏州研究院 | QoS sensible flow management method in software defined network |
| CN106888163A (en) * | 2017-03-31 | 2017-06-23 | 中国科学技术大学苏州研究院 | The method for routing divided based on network domains in software defined network |
| CN106789660A (en) * | 2017-03-31 | 2017-05-31 | 中国科学技术大学苏州研究院 | The appreciable flow managing methods of QoS in software defined network |
| CN107333312A (en) * | 2017-08-01 | 2017-11-07 | 陕西师范大学 | Route selection method in opportunistic network |
| CN107809381A (en) * | 2017-10-19 | 2018-03-16 | 北京邮电大学 | One kind, which is realized, is based on route loop active auditing algorithm and implementation method in SDN |
| CN108199970A (en) * | 2017-12-15 | 2018-06-22 | 浙江大学 | Packet path reconstructing method in a kind of software defined network |
| CN108199970B (en) * | 2017-12-15 | 2020-08-04 | 浙江大学 | Method for reconstructing data packet path in software defined network |
| CN109413709A (en) * | 2018-11-21 | 2019-03-01 | 上海事凡物联网科技有限公司 | Ad hoc network static routing method, apparatus, communication node and storage medium |
| CN109451552A (en) * | 2018-11-21 | 2019-03-08 | 上海事凡物联网科技有限公司 | Data transmission method, equipment, terminal and storage medium based on mixed logic dynamic networking |
| 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 |
| CN113315698A (en) * | 2021-05-25 | 2021-08-27 | 中国电子科技集团公司第二十九研究所 | Task-based sensor networking message routing method |
| CN113315698B (en) * | 2021-05-25 | 2022-07-05 | 中国电子科技集团公司第二十九研究所 | Task-based sensor networking message routing method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103825823B (en) | 2017-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103825823A (en) | Data forwarding method based on different priorities in software-defined network | |
| CN104158753B (en) | Dynamic stream scheduling method and system based on software defined network | |
| CN108400934B (en) | Software defined network controller, service function chain system and path tracking method | |
| CN108809857B (en) | SDN-based traffic monitoring and service quality assurance strategy method | |
| CN104104718B (en) | User autonomous routing customization system based on software-defined network | |
| JP5975083B2 (en) | COMMUNICATION SYSTEM, CONTROL DEVICE, PACKET TRANSFER ROUTE CONTROL METHOD, AND PROGRAM | |
| CN103516602B (en) | For transmitting method, the network equipment and the network system of data | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| CN103348635B (en) | Network system, control unit and optimum route control method | |
| Wang et al. | Adaptive path isolation for elephant and mice flows by exploiting path diversity in datacenters | |
| US9432312B2 (en) | Proactive and selective time-stamping of packet headers based on quality of service experience and node location | |
| Bhamare et al. | Intopt: In-band network telemetry optimization for nfv service chain monitoring | |
| CN103780425B (en) | The method and controller equiment of network are defined for configuration software | |
| CN108092888A (en) | A kind of transmission method based on Overlay networks, gateway and Transmission system | |
| CN105516025B (en) | Path clustering and data transmission method, OpenFlow controller and interchanger end to end | |
| CN106559330A (en) | A kind of dynamic path planning method based on SDN | |
| KR20140052847A (en) | Method and apparatus for providing quality of service in software defiend neworking network | |
| CN106161053A (en) | A kind of SDN controller QoS manages system and method | |
| CN107809381B (en) | Method for realizing active audit based on routing loop in SDN | |
| JP6524911B2 (en) | Network controller, network control method and program | |
| CN107046504A (en) | Method and controller for the traffic engineering in communication network | |
| CN104917677A (en) | Data stream forwarding control method and system | |
| Khoobbakht et al. | Hybrid flow-rule placement method of proactive and reactive in SDNs | |
| Wang et al. | Pursuing differentiated services in a sdn-based iot-oriented pub/sub system | |
| CN101286929B (en) | Compartment congestion controlling means for router with changing load |
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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170201 |