CN101969406A - Multi-constraint QoS (Quality of Service) routing method based on selective detection - Google Patents
Multi-constraint QoS (Quality of Service) routing method based on selective detection Download PDFInfo
- Publication number
- CN101969406A CN101969406A CN2010105277120A CN201010527712A CN101969406A CN 101969406 A CN101969406 A CN 101969406A CN 2010105277120 A CN2010105277120 A CN 2010105277120A CN 201010527712 A CN201010527712 A CN 201010527712A CN 101969406 A CN101969406 A CN 101969406A
- Authority
- CN
- China
- Prior art keywords
- node
- route
- probe messages
- constraint
- forerunner
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a multi-constraint QoS (Quality of Service) routing method based on selective detection, belonging to the field of a network routing technique, which utilizes the state information of each node in a network and searches the route meeting the requirements of business bandwidth and time delay by a selective detection method. The integral routing method is divided into two courses of route detection and route confirmation, wherein in the detection course, the constraint parameters of each node are recalculated, the calculation complexity of the parameters is reduced, and a feasible route meeting the requirements of the constraint parameters is continuously detected according to new parameters; and in the confirmation course, the feasible route is selected and resource reservation is carried out on each node so as to establish a reachable route meeting the constraint requirements. The method of the invention has the advantages of effective enhancement of the efficiency and the success rate for establishing the route, influence reduction on the network load, good adaptability and easy implementation.
Description
Technical field
The present invention relates to a kind of method for routing, relate in particular to a kind of multiple constraint QoS method for routing of surveying based on selection, belong to network route technology field.
Background technology
Continuous development along with network application, novel business such as voice, video, multimedia etc. are had higher requirement to the service quality (Quality of Service QoS) of network, and traditional network service of doing one's best can not have been satisfied the requirement of novel business.IETF(Internet Engineering Task Force, the Internet engineering duty group) for supporting the QoS demand, multiple service model and mechanism have been proposed, comprise the QoS route, differentiated service, MPLS etc.Wherein the QoS route is a key technology that solves the QoS problem.The basic task of QoS routing algorithm is exactly to seek a feasible path that enough resources is arranged, can satisfy qos requirement for once connecting, and the constrained parameters of QoS route comprise bandwidth constraint, delay constraint, delay variation constraint and packet loss rate constraint etc.Computing character according to these parameters can be divided into additivity parameter, the property taken advantage of parameter and concavity parameter.Wherein bandwidth belongs to the concavity parameter, and jumping figure, time delay belong to the additivity parameter, and packet loss rate belongs to the property taken advantage of parameter.The QoS route be connection-oriented, the resource reservation function is arranged and can provide the service of quality assurance.
Present most QoS unicast routing method is based on the QoS unicast routing method that selectivity is surveyed, and this method is often only considered the constraint requirements of single parameter, so adaptability and efficient are undesirable.
Summary of the invention
The objective of the invention is to overcome the deficiency of existing QoS method for routing, provide a kind of algorithm simple, efficient, and the little QoS method for routing of link overhead.
Purpose of the present invention is achieved through the following technical solutions:
A kind of based on the multiple constraint QoS method for routing of selecting to survey, comprise route exploration process and route affirmation process,
It is characterized in that:
In described route exploration process, the source node of route requests carries out route exploration according to the QoS constrained parameters structural exploration message of business need; On the network link that satisfies the requirement of QoS constrained parameters, send probe messages, each node that probe messages arrives generates routing state information and writes down this route, and the QoS constrained parameters in the probe messages are recomputated produce new QoS constrained parameters, the probe messages of utilizing these new QoS constrained parameters structures to make new advances then, continue to survey the route that satisfies constraint requirements, arrive destination node up to probe messages;
In described route affirmation process, from destination node, each node is selected forerunner's node from the routing state information of preserving, send confirmation message to it; After forerunner's node receives the confirmation message, as when satisfying resource request condition in the confirmation message, then carry out resource reservation and a descendant node that sends confirmation is added in the routing state information, proceed next step affirmation; As not, then announce current routing failure and carry out route affirmation process again to the sending node transmission failure message of confirmation message; When confirmation message arrived the source node of route requests and resource reservation success, route was just successfully set up.
QoS constrained parameters in the technique scheme can adopt multiple compound mode as required, and as preferred version wherein, the present invention adopts bandwidth and delay constraint parameter.
Compared to existing technology, the inventive method has the following advantages:
One, the calculation of parameter of the inventive method is distributed in each routing node and carries out the treatment effeciency height; Each routing node only needs the forerunner of minute book node and follow-up, has saved memory space;
Two, adopt the selectivity detection mode, strengthened route searching efficient, avoided network congestion to a certain extent;
Three, the inventive method adopts multiple constraint, can satisfy the QoS demand of different business;
Four, can expand this method for routing, satisfy the constraint requirements of more qos parameters, have good autgmentability.
Description of drawings
The control message format of Fig. 1 for being adopted in the specific embodiment of the invention;
The routing state information form of Fig. 2 for being adopted in the specific embodiment of the invention;
Fig. 3 is the flow chart based on the QoS method for routing of selecting to survey of the present invention.
Embodiment
Below in conjunction with accompanying drawing technical scheme of the present invention is elaborated:
Three types the control message that uses in route exploration process of the inventive method and the route affirmation process is respectively: probe messages, confirmation message and failure message.For reducing to handle the complexity of message, the control message adopts the form as accompanying drawing 1, and type represents type of message, seq represents sequence number, and source represents source node, and destiny represents destination node, sender represents message transmitting party, and QoS represents bandwidth delay constraint parameter.
In the detection process, search takes to select the way surveyed during route, promptly the calculating of bandwidth in the probe messages and delay parameter is distributed on each probe node, generates new constraints.Suppose at node
, to its neighbors arbitrarily
,
Expression node time delay,
The expression chain-circuit time delay, the QoS delay parameter of probe messages
Recomputate then that to produce new constraint as follows with bandwidth:
；
When new constraint is set up, node
Add route, and carry out next step route exploration with new time delay and the new probe messages of bandwidth parameter structure; If constraints is untenable, then select another adjacent node to carry out route exploration.Realized the selection of network link is surveyed according to new bandwidth delay parameter like this, improved the way of all links being carried out the broadcast type route exploration, alleviated influence, improved the efficient of routing algorithm offered load.
In route affirmation process, after node receives the confirmation message and reserved resource success, the confirmation message sending node is saved in the routing state information, from routing state information, select forerunner's node to send confirmation message then and carry out the route affirmation, if reserved resource failure, then discharge routing state information and send failure message, announce current routing failure, carry out new route affirmation so that successor node is reselected new forerunner's node to the confirmation message sending node.Wherein confirmation message has been preserved the resource requirement of route.
Owing to be subjected to the restriction of message size, the inventive method is preserved routing state information (RouteState) in the intermediate node of route exploration, its form as shown in Figure 2, wherein, seq represents sequence number, source represents source node, destiny represents destination node, and QoS represents restriction on the parameters, and isforwarded represents probe mark, predecessors represents forerunner's set of node, and successor represents descendant node.
Whether probe mark isforwarded is used to identify this node and was detected, if isforwarded is true then shows that this node was detected.Receive the essential information (source node of probe messages, destination node, QoS) identical, show that this node surveyed by same route requests, then only need the transmit leg of probe messages is added forerunner's node set predecessors, no longer send new probe messages and survey.If isforwarded is false, show that then this node was not detected, need to preserve the probe messages transmit leg in forerunner's set of node predecessors and carry out next step detection.The situation that has loop in the path that probe mark has been avoided surveying has improved the efficient of route exploration.Preserving a plurality of forerunner's nodes can make route confirm have a plurality of forerunners to select in route is confirmed, has improved the success rate of setting up route.
In route affirmation process, when node is received confirmation message, carry out resource reservation.If the route descendant node is then preserved in the resource reservation success in descendant node successor.In route affirmation process, carry out resource reservation and be intended to reduce route settling time and improve the success rate of setting up route.
In this embodiment, described QoS constrained parameters adopt bandwidth and time delay, whole route implementing process, as shown in Figure 3, according to following each step:
Step 1: the source node transmission route requests of accepting business, source node be according to the bandwidth and the specific probe messages of delay constraint parametric configuration of business, and set a timer and begin regularly, and the route exploration process starts;
Step 2: source node is according to the bandwidth constraint parameter in the probe messages, the network link that satisfies the bandwidth constraint parameter request is sent probe messages, to not satisfying the network link of bandwidth constraint requirement, then continue the detecting link bandwidth, as still not having available link, then return mistake to the user up to timer expiry;
Step 3: after the adjacent node of the node of transmission probe messages is received probe messages, from probe messages, extract earlier delay parameter, deduct the processing delay of required time delay of transmission and node then with this delay parameter, obtain new delay parameter; If this new delay parameter then abandons this message less than 0; Otherwise, change step 4 over to;
Step 4: this node from probe messages, extract the parameter destination address and and this node address comparison, if both are identical, then change step 7 over to, begin to carry out the affirmation process of route; Otherwise, change step 5 over to;
Step 5: this node is set up the routing state information of this route requests according to the bandwidth constraint parameter in the probe messages, and the forerunner's set of node the transmit leg of probe messages adding oneself changes step 6 then over to;
Step 6: according to the delay parameter after former bandwidth constrained parameters and step 3 processing, the probe messages that this node structure is new sends probe messages to the network link that satisfies bandwidth requirement, changes step 3 then over to, continues the route exploration process;
Step 7: probe messages has arrived destination node, the affirmation process of beginning route, and destination node is constructed routing state information according to probe messages, and the probe messages transmit leg is joined this makes forerunner's set of node in the routing state information, changes step 8 over to;
Step 8: destination node is carried out resource reservation according to the routing state information of being constructed, and constructs confirmation message then, and takes out forerunner's node from forerunner's set of node, sends confirmation message to it;
Step 9: after forerunner's node is received confirmation message, carry out resource reservation,,, send failure message then to the confirmation message transmit leg as the resource reservation failure; As the resource reservation success, then change step 10 over to;
Step 10: this forerunner's node adds the transmit leg of confirmation message in the routing state information as descendant node, the destination address of this forerunner's node address and confirmation message relatively, if equate, then changes step 11 over to; Otherwise construct new affirmation message, choose new forerunner's node in the forerunner's set of node from routing state information, send new affirmation message, go to step 9 to it;
Step 11: when confirmation message arrives source node and resource reservation success, and the source node timer do not have overtimely, then announce user's route and sets up successfully, otherwise the foundation of announcement route failed.
Method for routing of the present invention, it can be embedded into Xorp (Xorp be a increase income expand soft route software) the relevant source code of Routing Protocol in.Utilize the main frame of network interface card more than many, be organized into the simple internet network, and on each main frame, move Xorp software, carry out to start this method for routing after the relevant configuration.
The inventive method is utilized the state information of each node in the network, satisfies the route of service bandwidth and delay requirement by selecting the detection method search.Method for routing is divided into route exploration and route is confirmed two processes.In detection process, each node recomputates constrained parameters, reduces the calculation of parameter complexity, continues to survey the feasible route that meets the constrained parameters requirement according to new argument then.Choose feasible route and on each node, carry out resource reservation in the affirmation process, thereby set up reached at the route that meets constraint requirements.This method can effectively improve efficient and the success rate of setting up route, reduces the influence to offered load, has good adaptability, and is easy to implement.
Claims (3)
1. a multiple constraint QoS method for routing of surveying based on selection comprises route exploration process and route affirmation process, it is characterized in that:
In described route exploration process, the source node of route requests carries out route exploration according to the QoS constrained parameters structural exploration message of business need; On the network link that satisfies the requirement of QoS constrained parameters, send probe messages, each node that probe messages arrives generates routing state information and writes down this route, and the QoS constrained parameters in the probe messages are recomputated produce new QoS constrained parameters, the probe messages of utilizing these new QoS constrained parameters structures to make new advances then, continue to survey the route that satisfies constraint requirements, arrive destination node up to probe messages;
In described route affirmation process, from destination node, each node is selected forerunner's node from the routing state information of preserving, send confirmation message to it; After forerunner's node receives the confirmation message, as when satisfying resource request condition in the confirmation message, then carry out resource reservation and a descendant node that sends confirmation is added in the routing state information, proceed next step affirmation; As not, then announce current routing failure and carry out route affirmation process again to the sending node transmission failure message of confirmation message; When confirmation message arrived the source node of route requests and resource reservation success, route was just successfully set up.
2. according to claim 1 based on the multiple constraint QoS method for routing of selecting to survey, it is characterized in that described QoS constrained parameters are bandwidth and delay constraint parameter.
As described in the claim 2 based on the multiple constraint QoS method for routing of selecting to survey, it is characterized in that, specifically may further comprise the steps:
Step 1: the source node transmission route requests of accepting business, source node be according to the bandwidth and the specific probe messages of delay constraint parametric configuration of business, and set a timer and begin regularly, and the route exploration process starts;
Step 2: source node is according to the bandwidth constraint parameter in the probe messages, the network link that satisfies the bandwidth constraint parameter request is sent probe messages, to not satisfying the network link of bandwidth constraint requirement, then continue the detecting link bandwidth, as still not having available link, then return mistake to the user up to timer expiry;
Step 3: after the adjacent node of the node of transmission probe messages is received probe messages, from probe messages, extract earlier delay parameter, deduct the processing delay of required time delay of transmission and node then with this delay parameter, obtain new delay parameter; If this new delay parameter then abandons this message less than 0; Otherwise, change step 4 over to;
Step 4: this node from probe messages, extract the parameter destination address and and this node address comparison, if both are identical, then change step 7 over to, begin to carry out the affirmation process of route; Otherwise, change step 5 over to;
Step 5: this node is set up the routing state information of this route requests according to the bandwidth constraint parameter in the probe messages, and the forerunner's set of node the transmit leg of probe messages adding oneself changes step 6 then over to;
Step 6: according to the delay parameter after former bandwidth constrained parameters and step 3 processing, the probe messages that this node structure is new sends probe messages to the network link that satisfies bandwidth requirement, changes step 3 then over to, continues the route exploration process;
Step 7: probe messages has arrived destination node, the affirmation process of beginning route, and destination node is constructed routing state information according to probe messages, and the probe messages transmit leg is joined this makes forerunner's set of node in the routing state information, changes step 8 over to;
Step 8: destination node is carried out resource reservation according to the routing state information of being constructed, and constructs confirmation message then, and takes out forerunner's node from forerunner's set of node, sends confirmation message to it;
Step 9: after forerunner's node is received confirmation message, carry out resource reservation,,, send failure message then to the confirmation message transmit leg as the resource reservation failure; As the resource reservation success, then change step 10 over to;
Step 10: this forerunner's node adds the transmit leg of confirmation message in the routing state information as descendant node, the destination address of this forerunner's node address and confirmation message relatively, if equate, then changes step 11 over to; Otherwise construct new affirmation message, choose new forerunner's node in the forerunner's set of node from routing state information, send new affirmation message, go to step 9 to it;
Step 11: when confirmation message arrives source node and resource reservation success, and the source node timer do not have overtimely, then announce user's route and sets up successfully, otherwise the foundation of announcement route failed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105277120A CN101969406A (en) | 2010-11-02 | 2010-11-02 | Multi-constraint QoS (Quality of Service) routing method based on selective detection |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010105277120A CN101969406A (en) | 2010-11-02 | 2010-11-02 | Multi-constraint QoS (Quality of Service) routing method based on selective detection |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101969406A true CN101969406A (en) | 2011-02-09 |
Family
ID=43548511
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010105277120A Pending CN101969406A (en) | 2010-11-02 | 2010-11-02 | Multi-constraint QoS (Quality of Service) routing method based on selective detection |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101969406A (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| CN104601473A (en) * | 2014-12-29 | 2015-05-06 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Route generating method and system for multi-target path with restriction |
| CN106656807A (en) * | 2015-11-02 | 2017-05-10 | 华为技术有限公司 | Message forwarding method and SDN switch |
| CN108270674A (en) * | 2016-12-30 | 2018-07-10 | 华为技术有限公司 | A kind of method, apparatus of message forwarding |
| CN108770003A (en) * | 2018-05-07 | 2018-11-06 | 南京邮电大学 | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing |
| CN110166366A (en) * | 2018-02-14 | 2019-08-23 | 华为技术有限公司 | Method for controlling network congestion, device and system |
| WO2020083102A1 (en) * | 2018-10-25 | 2020-04-30 | 电信科学技术研究院有限公司 | Information transmission method and network device |
| CN115550456A (en) * | 2022-09-13 | 2022-12-30 | 中国联合网络通信集团有限公司 | Service scheduling method and device |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2004004248A1 (en) * | 2002-06-26 | 2004-01-08 | Nokia Corporation | Programmable scheduling for ip routers |
| CN1557076A (en) * | 2001-09-27 | 2004-12-22 | ����ɭ�绰�ɷ�����˾ | Method for multihop routing for distributed WLAN networks |
-
2010
- 2010-11-02 CN CN2010105277120A patent/CN101969406A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1557076A (en) * | 2001-09-27 | 2004-12-22 | ����ɭ�绰�ɷ�����˾ | Method for multihop routing for distributed WLAN networks |
| WO2004004248A1 (en) * | 2002-06-26 | 2004-01-08 | Nokia Corporation | Programmable scheduling for ip routers |
Non-Patent Citations (1)
| Title |
|---|
| 《西北师范大学硕士学位论文》 20060501 张香芸 IPv6下的服务质量（QoS）保证技术研究 第37-55页第四章 1-3 , 2 * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104168191A (en) * | 2014-08-31 | 2014-11-26 | 西安电子科技大学 | Routing method for meeting multiple constrained parameter conditions in large-scale software-defined network |
| CN104601473A (en) * | 2014-12-29 | 2015-05-06 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Route generating method and system for multi-target path with restriction |
| CN104601473B (en) * | 2014-12-29 | 2018-01-05 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | A kind of route generating method and system of the multi-goal path of belt restraining |
| CN106656807A (en) * | 2015-11-02 | 2017-05-10 | 华为技术有限公司 | Message forwarding method and SDN switch |
| CN108270674A (en) * | 2016-12-30 | 2018-07-10 | 华为技术有限公司 | A kind of method, apparatus of message forwarding |
| CN110166366A (en) * | 2018-02-14 | 2019-08-23 | 华为技术有限公司 | Method for controlling network congestion, device and system |
| US11659435B2 (en) | 2018-02-14 | 2023-05-23 | Huawei Technologies Co., Ltd. | Network congestion control method, apparatus, and system |
| CN108770003A (en) * | 2018-05-07 | 2018-11-06 | 南京邮电大学 | A kind of self-organizing unmanned plane network routing discovering method based on particle group optimizing |
| WO2020083102A1 (en) * | 2018-10-25 | 2020-04-30 | 电信科学技术研究院有限公司 | Information transmission method and network device |
| US12120548B2 (en) | 2018-10-25 | 2024-10-15 | Datang Mobile Communications Equipment Co., Ltd. | Information transmission method and network device |
| CN115550456A (en) * | 2022-09-13 | 2022-12-30 | 中国联合网络通信集团有限公司 | Service scheduling method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101969406A (en) | Multi-constraint QoS (Quality of Service) routing method based on selective detection | |
| CN101489276B (en) | Multicast routing method for Ad Hoc network | |
| CN103986653A (en) | Network nodes and data transmission method and system | |
| CN101674630A (en) | Implementation method of cross-layer routing capable of perceiving congestion | |
| CN103118413B (en) | A kind of IPv6 industrial wireless sensor network method for routing based on deterministic schedule | |
| Lin et al. | Multi-access edge computing-based vehicle-vehicle-RSU data offloading over the multi-RSU-overlapped environment | |
| CN101827421A (en) | DSR cooperative routing method based on channel state information and router | |
| CN101610559B (en) | Determination method of wireless routing and node device | |
| CN110290069B (en) | Reliable multicast routing method in SDN scene | |
| CN105072586A (en) | Management method for forwarding of broadcast message in embedded wireless ad hoc network | |
| Banka et al. | Angle routing protocol: location aided routing for mobile ad-hoc networks using dynamic angle selection | |
| Ding et al. | Pre-decoding recovery mechanism for network coding opportunistic routing in delay tolerant networks | |
| Tan et al. | Queue management for network coding in ad hoc networks | |
| CN102088751B (en) | Gradient-based wireless sensor network (WSN) topology maintenance method and packet forwarding method | |
| Anandakumar et al. | Enhanced multicast cluster-based routing protocol for delay tolerant mobile networks | |
| CN103079251B (en) | The method and system of data collision are avoided in wireless sense network | |
| KR101381807B1 (en) | Wireless ad hoc network system and method for setting multi-path thereof | |
| Baolinr et al. | Distributed QoS multicast routing protocol in ad hoc networks | |
| Nehra et al. | Routing with load balancing in ad hoc network: A mobile agent approach | |
| Vijayalakshmi et al. | Energy Aware Multicast Clustering (EAMC) with increased Quality of Service (QoS) in MANETs | |
| Chuang et al. | Reliable and congestion-controlling transport in wireless sensor networks | |
| KR100936246B1 (en) | Method of multicast routing using history aware and multicating, and network system | |
| CN104270315B (en) | The computational methods and system of multicast distribution tree in TRILL radio networks | |
| Mhatre et al. | Performance analysis of prediction and priority based routing protocol for MANET's | |
| CN104837172A (en) | DT-MAODV multicast routing 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 | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20110209 |