CN101119307A - Routing method - Google Patents
Routing method Download PDFInfo
- Publication number
- CN101119307A CN101119307A CNA2007101202566A CN200710120256A CN101119307A CN 101119307 A CN101119307 A CN 101119307A CN A2007101202566 A CNA2007101202566 A CN A2007101202566A CN 200710120256 A CN200710120256 A CN 200710120256A CN 101119307 A CN101119307 A CN 101119307A
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- value
- routing
- node
- occupancy rate
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention relates to a routing method which comprises the steps as follows: receiving route request and a bandwidth desired value; calculating occupancy rate of preserved bandwidth according to the self bandwidth impropriating ratio; judging whether the preserving bandwidth impropriating ratio belongs to the linear domain, if yes, the present invention sets the practical bandwidth value equal with the desired value. The present invention can assign the preserving bandwidth and judge whether the present invention self is a target node, if yes, the present invention will produce and send the successful routing answering information, if no, the present invention will send the requirement of the routing; the present invention will receive the answering information of the route and judge whether the route information is successful, if yes, the present invention will send the successful route answering information, otherwise the present invention will delete the preserving information and then send the failure route answering information. The route method of the present invention can balance the load of the network business and avoid the bottle neck problem of the network resources of the agreement. The present invention distributes the transmission tasks of the route to the whole network arrange to reduce the expanse of lining in a queue in partly heavy load area. Moreover the present invention has the advantage of enhancing the operating efficiency of the network resources.
Description
Technical Field
The present invention relates to a routing method, and in particular, to a load balancing routing method with dynamic bandwidth allocation for a wireless network, which is suitable for systems such as a mobile ad hoc network and a wireless local area network.
Background
Communication nodes of a wireless network have the characteristics of limited resources, limited energy and limited receiving capacity, and the characteristics require the nodes to adopt a proper routing method to efficiently realize end-to-end communication between a source node and a destination node. The design goal of the wireless network routing method is to consider the characteristics of scarce network resources, time-varying network states and the like as much as possible, adapt to the dynamic and rapid change of network topology, and improve the scalability of the network and the robustness of multi-hop routing. Existing routing methods in wireless networks can be divided into two broad categories, primary routing and on-demand routing.
Most active routing protocols of wireless networks follow the routing table-driven routing method of wired networks, and have the inevitable defects when applied to the wireless networks: whether the routing in the routing table is applied to the wireless network or not, a large number of control packets are generated to maintain the routing table, and the periodic broadcast of the control information and the maintenance of the complex routing table consume a large amount of limited network resources and node energy; the rapid change in topology makes much routing information obsolete quickly, resulting in wasted resources.
In most on-demand routing protocols, a node sends a routing request packet for searching only when a new path is needed to transmit a data packet, each node receiving the routing request packet blindly forwards the routing request packet to a destination node without considering the current traffic load intensity of the node, and the destination node returns a response packet in reverse according to the shortest path after receiving the routing request packet. When the requirements of routing request grouping and routing maintenance grouping are not frequent, the on-demand routing protocol can lower routing overhead, higher grouping success delivery rate and operation efficiency than an active routing protocol, and can be more suitable for frequent change of wireless network topology and effectively utilize limited bandwidth resources and battery energy. On-demand routing schemes are an effective method when there are fewer connected nodes communicating, but are relatively inefficient when routing request packets and routing maintenance packets are frequently required or when there are more connected nodes communicating. In most on-demand routing schemes, as the load intensity of the traffic flow increases, the routing information caused by congestion is lost quickly, which triggers generation of more control packets such as routing requests and routing maintenance, and further aggravates network congestion. Since control packets are typically of higher priority than data packets, the transmission of more control packets will further exacerbate the congestion state in the network.
The main reason for the routing problem of the wireless network is that most routing protocols in the wireless network fail to consider the balanced distribution of routing tasks among mobile nodes in the network, so that most of the generated routes are converged into a small number of nodes and links in the network as a result of the operation of the protocols, which results in unbalanced transmission load of the whole network. Unbalanced data service stream transmission can quickly exhaust the electric energy of heavy load nodes, and the connectivity of the network is weakened along with the increase of the electric energy exhaust nodes, so that the heavy load nodes generate larger queuing waiting time delay and higher packet loss rate, network congestion and bottlenecks occur, the average end-to-end time delay and the packet loss rate of routing connection taking the heavy load nodes as intermediate nodes are increased, and the transmission reliability of data in the network is poor.
The better method for solving the problem of limited power and bandwidth in the wireless network is to consider the network congestion condition of each node in the network in the design of the routing method, and adopt a reasonable load balancing strategy for the network according to the load and the congestion condition of each node in the network in the routing selection process, so that the network keeps continuous, efficient and stable operation, and the comprehensive performances of the packet success delivery rate of the network, the average end-to-end delay of packet transmission, the overhead of additional routing control and the like are optimized, thereby improving the transmission quality of network service flow.
However, in the existing load balancing routing method, the selected load level metric is single and static, the bandwidth utilization rate and the transmission efficiency are improved less, and certain limitations exist in practical application. The existing load balancing routing protocol mainly infers the current path or node load size according to a certain characteristic parameter in network information transmission, for example: the length of a buffer queue of the routing node, the end-to-end service flow delay or the number of service flows being transmitted by the routing node, and the like. Most of routing protocols selected by the existing load balancing routing protocol collect the certain characteristic parameter of the node in the network, and then calculate and select a transmission path, and the technical scheme has the following problems: 1. the characteristic parameters reflect the Load characteristics, and have limited utility, such as a DLAR (Dynamic Load-Aware Routing) Routing protocol, wherein the length of a cache queue of each intermediate node is accumulated and the minimum total value is selected as a Routing path, but the length of the cache queue has strong time-varying property in the transmission process and is greatly influenced by various factors, so that the reliability of the Routing is relatively low; 2. the existing routing protocol, such as the 'LBAR' routing protocol, selects an optimal path calculated according to characteristic parameters, but actually, a suboptimal but feasible routing path also has a considerable value, and in addition, the existing routing protocol often only adopts (0, 1) binary logic expression for node blockage or node smoothness, and cannot fully utilize network resources.
Disclosure of Invention
The invention aims to provide a routing method through some embodiments, to overcome the problems existing in the prior art, and to solve the problems that the existing routing method cannot fully consider the load state of network nodes, and is difficult to realize load balancing, so that the utilization efficiency of network resources is poor, thereby more effectively utilizing the network resources, reducing the local load level, and improving the network performance.
To achieve the object of the present invention, there is provided, in some embodiments, a route update method including the steps of:
step 7, deleting the allocated reserved bandwidth;
and 8, sending the routing response information to the upper-level node.
The embodiment of the invention calculates the load capacity of the node according to the bandwidth occupancy rate of the node and the bandwidth expected value in the service flow routing request, and dynamically distributes and recovers the occupied bandwidth of the service flow, so that the service load of the network can be timely and accurately balanced, the problem of network resource bottleneck in a common routing protocol is avoided, all feasible paths are explored by repeatedly implementing the method, and the task of routing transmission is dispersed in the whole network range, thereby reducing the control overhead of queuing and the like of part of heavy load node service transmission, and improving the utilization rate of network resources.
Further, the step 3 may specifically be:
step 30, judging whether the reserved bandwidth occupancy rate belongs to a linear domain, if so, setting the actual allocated bandwidth value to be equal to the expected bandwidth value, executing step 4, and if not, executing step 31;
step 31, judging whether the reserved bandwidth occupancy rate belongs to an exponential domain, if so, calculating an actual bandwidth allocation value, and executing step 32, otherwise, generating failed route response information, and executing step 8;
and 32, acquiring a minimum bandwidth value, judging whether the actual bandwidth allocation value is greater than or equal to the minimum bandwidth value, if so, executing the step 4, otherwise, generating failed route response information, and executing the step 8.
By adopting the technical scheme, all paths at least meeting the minimum bandwidth value can be found instead of the optimal transmission path, so that the network resources can be utilized to the maximum extent, and the utilization rate of the network resources is improved.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
Fig. 1 is a flowchart of a routing method according to a first embodiment of the present invention.
Fig. 2 is a schematic diagram of a successful route request process in a routing method according to an embodiment of the present invention.
Fig. 3 is a graph of an actual bandwidth allocation function according to a first embodiment of the routing method of the present invention.
FIG. 4 is a graph of a transfer cost function according to an embodiment of the routing method of the present invention.
Fig. 5 is a schematic diagram of a failed routing request process in an embodiment of the routing method of the present invention.
Detailed Description
Example one
As shown in fig. 1, a flowchart of a first embodiment of the routing method of the present invention is shown, where the first embodiment includes the following steps:
a1, a lower node receives a routing request sent by an upper node, and acquires a bandwidth expected value contained in the routing request;
step A2, the lower node detects the bandwidth occupancy rate of the lower node, and calculates the reserved bandwidth occupancy rate according to the bandwidth occupancy rate and the bandwidth expectation value according to the following formula (1), namely a reserved bandwidth occupancy rate calculation formula:
wherein, U ij ' reserved bandwidth occupancy, U, after the expected bandwidth value is assigned to the routing request by the subordinate node ij The bandwidth occupation rate of the subordinate node before the expected bandwidth value is not distributed to the routing request, K is the expected bandwidth value of the routing request, B W Is the total bandwidth value of the node;
step A3, judging whether the reserved bandwidth occupancy rate belongs to a linear domain, if so, setting an actual distribution bandwidth value to be equal to a bandwidth expected value, executing step A4, otherwise, generating failed route response information, and executing step A8;
step A4, distributing reserved bandwidth according to the actual distributed bandwidth value, judging whether the self is a destination node, if so, generating successful routing response information, and executing step A8, otherwise, executing step A5;
step A5, forwarding the routing request to the lower node of the routing request, wherein the routing request at least comprises a bandwidth expected value;
step A6, receiving route response information sent back by a subordinate node of the node, judging whether the route response information is successful route response information, if so, executing step A8, otherwise, executing step A7;
step A7, the lower node deletes the reserved bandwidth allocated for the routing request;
and step A8, the lower node sends the routing response information to the upper node thereof.
In step A3 of this embodiment, it is determined whether the node belongs to the linear domain according to the reserved bandwidth occupancy rate, and then the actual allocated bandwidth value is calculated, and the admission control is performed on the service flow of the routing request, if so, the node can transmit the service flow. Further, the actual allocated bandwidth value can be calculated according to the minimum value of the traffic flow bandwidth included in the routing request, and the admission control is performed by the following steps:
step A30, judging whether the reserved bandwidth occupancy rate belongs to a linear domain, namely judging the reserved bandwidth occupancy rate U ij ' whether or not it is less than the first limit value of the bandwidth occupancy Δ 1 If yes, setting the actual distribution bandwidth value to be equal to the expected bandwidth value, namely calculating the actual bandwidth distribution value according to a formula (2), and executing the step A4, otherwise, executing the step A31;
B(U ij )＝K 0≤U ij ′＜Δ 1 (2)
wherein, B (U) ij ) The actual allocated bandwidth value is the bandwidth occupancy U ij Function of, Δ 1 A first limit value for the bandwidth occupancy, which is a predetermined constant, the value of which is determined in relation to the capacity of the node;
step A31, judging whether the occupancy rate of the reserved bandwidth belongs to an exponential domain, namely judging the occupancy rate U of the reserved bandwidth ij ', whether it is less than the second limit value Delta of the bandwidth occupancy 2 If yes, calculating an actual bandwidth allocation value according to the reserved bandwidth occupancy rate, namely calculating the actual allocated bandwidth value according to a formula (3), and executing a step A32, if not, setting the actual allocated bandwidth value to be equal to '0', namely, the bandwidth cannot be allocated, generating failed routing response information, and executing a step A8:
wherein, delta 2 The second limit value of the bandwidth occupancy rate is a preset constant, and the value is determined according to the capacity of the node;
step A32, judging whether the actual bandwidth allocation value is greater than or equal to the minimum bandwidth value, wherein the minimum bandwidth value is acquired from the routing request, if so, executing step A4, otherwise, setting the actual allocation bandwidth value to be equal to '0', namely, the bandwidth cannot be allocated, generating failed routing response information, and executing step A8.
When further judging whether the actual bandwidth allocation value meets the requirement of the minimum bandwidth value or not, when the routing request is sent or forwarded, the minimum bandwidth value is further included in the routing request, and the minimum bandwidth value is considered, so that the searched feasible path not only can keep the optimal transmission path with smooth transmission, but also can search other feasible transmission paths, and the utilization rate of network resources can be improved.
An example of the above technical solution is: setting delta according to the concrete condition of network transmission capacity 1 ＝0.3，Δ 2 If =0.66, the expected bandwidth value of a certain route request is 3Mbps, the minimum bandwidth value is 2Mbps, the total bandwidth value of the node is 10Mbps, and the current bandwidth occupancy rate is 10%, then the reserved bandwidth occupancy rate can be calculated according to the formula (1)
Because 0.3 is less than 0.43 and less than 0.66, the reserved bandwidth occupancy rate belongs to an exponential domain, and the actual allocated bandwidth value is calculated according to the formula (3)
And 2.44 is more than 2, the requirement of the minimum bandwidth value is met, and the reserved bandwidth can be allocated for the bandwidth.
In the above technical solution for calculating the actual allocated bandwidth value, the bandwidth occupancy of the node has passed through the preset first and second limit values Δ of the bandwidth occupancy 1 、Δ 2 Is divided into three regions corresponding to three regions in the transmission cost function curve respectively, reflecting the link congestion state of the node, the first and second limit values delta of the bandwidth occupancy rate 1 、Δ 2 Is preset according to the specific situation of the node, and the value is determined according to the capacity of the node so as to meet the requirement of not meeting the requirementThe same network transmission requirements. Fig. 4 is a graph of a transmission cost function, and the formula of the transmission cost function is shown in the following equation (4):
wherein, C (U) ij ) For transmission cost, C (Delta) 1 ) To set a constant value according to the specific transmission conditions of the network, N/A can be set to 0 because U ij The "other" value ranges of (a) may be disregarded.
As can be seen from fig. 4, when the intermediate node receives the routing request, it is a lower node, and its link transfer cost function curve is divided into three regions: linear domain, exponential domain, and non-available domain. Specifically, in the linear domain, i.e., 0 ≦ U ij ≤Δ 1 In the linear domain of (2), the transmission cost C (U) ij ) Bandwidth occupancy rate U with traffic flow ij Linear growth; at a 1 ≤U ij ≤Δ 2 Within the exponential field of (2), the transmission cost C (U) ij ) Bandwidth occupancy U with traffic flow ij Increase in exponential form; at a 2 ≤U ij In the range of the non-available domain less than or equal to 1, because the part of the bandwidth is mainly allocated to the rerouted service flow, the service flow of the source node, i.e. the upper node, can not directly apply for the part of the bandwidth, so that the transmission cost C (U) of the domain does not need to be considered ij )。
In this embodiment, the reserved bandwidth occupancy may not be less than zero, so the value range of the reserved bandwidth occupancy is correspondingly divided into three regions, and the formula for calculating the actual allocated bandwidth value in the three value ranges can be summarized as formula (5):
as shown in fig. 2, which is a schematic diagram of a route request process of a specific embodiment of the routing method of the present invention, in a specific implementation process of the above embodiment, a source node S sends a route request to an intermediate node a, and the intermediate node a sends the route request to intermediate nodes B and C in sequence, and finally sends the route request to a destination node D.
In the specific implementation process of this embodiment, when a service is initiated, the source node S first calculates a bandwidth expected value and a bandwidth minimum value according to its own service stream transmission information, where the bandwidth expected value corresponds to a bandwidth requirement for smoothly transmitting a network video stream or a data stream, and the bandwidth minimum value refers to a minimum bandwidth requirement that can meet the service hard service quality, and then sends a routing request, including the bandwidth expected value and the bandwidth minimum value, to the intermediate node a, that is, a lower node. In step A1, the lower node receives the routing request of the upper node, and simultaneously receives the bandwidth expectation value and the bandwidth minimum value.
In the technical solution of the present embodiment, a graph of the function of calculating the actual allocated bandwidth is shown in fig. 3, where the horizontal axis represents the bandwidth occupancy of the node, and is represented by Δ 1 、Δ 2 The method comprises the steps that the method is divided into three sections, the vertical axis is an actual distribution bandwidth value, the corresponding bandwidth occupancy rate is also divided into three sections of areas, the shadow area 1 is the difference between the bandwidth occupancy rate reserved by the node for the routing request and the existing bandwidth occupancy rate, namely the routing requirement of the routing request, the section is projected to a curve of the actual distribution bandwidth value to form a shadow area 2, and the admittance bandwidth is distributed to the routing request by the node. Delta 1 、Δ 2 The value divides the bandwidth utilization into three value ranges, where Δ 1 、Δ 2 The value of (2) can be further set according to the change of the specific situation of the node so as to meet different network transmission requirements.
At a 2 ≤U ij The advantage of not allocating bandwidth in the area of ≦ 1 and other non-available domains is that link down often occurs due to the particularities of the wireless network environment, the movement of nodes, etc., resulting in re-routed traffic. The rerouted traffic may cause significant interference to the ongoing normally transmitted traffic, and it is therefore necessary to allocate a relatively fixed bandwidth to the rerouted traffic, and hence at Δ 2 ≤U ij And in the range of the unavailable domain with the bandwidth less than or equal to 1, reserving the bandwidth for the rerouted service flow.
After admission control is completed, in step A4, bandwidth is reserved according to an actual allocated bandwidth value, the subordinate node determines whether the subordinate node is a destination node of the current routing request, if yes, and sufficient bandwidth can be allocated, a successful routing response message is replied to the superior node, and if the subordinate node is not the destination node, the routing request including the bandwidth expected value and the bandwidth minimum value is continuously forwarded to the subordinate node of the subordinate node. After the routing request is forwarded, the node waits for the routing response information replied by the lower node, if the routing response information succeeds, the routing response success information is forwarded to the upper node of the node, and the service flow is waited to be received, otherwise, if the routing response information failed is received, the bandwidth reserved for the service flow is deleted, and the routing response information failed is forwarded to the upper node of the node.
In the schematic diagram of the route request process shown in fig. 2, each intermediate node and the destination node both serve as a lower node to execute the first process of the route method embodiment of the present invention when receiving the route request, and fig. 2 is a schematic diagram of a success of one route request. The source node S wants to transmit a data stream of a specified traffic volume to the destination node D. Wherein, A, B and C are intermediate nodes and are responsible for routing transmission service flow. The source node first solves the expected value and the minimum value of the bandwidth request according to the size of the traffic, and writes the two values into a packet header field of the routing request 3. After receiving the routing request 3, the node a, as a lower node, executes the process of this embodiment, calculates an actual allocated bandwidth value according to an actual bandwidth allocation function shown in fig. 3, and allocates bandwidth when at least the requirement of the minimum value of the traffic bandwidth is met. Then, the intermediate nodes B and C sequentially receive the routing request 3, and execute the technical solution of the above-described embodiment of the routing method of the present invention. When receiving the routing request 3, the intermediate nodes A, B and C can at least meet the requirement of the minimum bandwidth, so that the routing request 3 is sent to the destination node D step by step, the destination node D returns the routing response success information 4, the routing response success information returns to the source node S step by step through the intermediate nodes C, B and A, and the path S-A-B-C-D is se:Sup>A feasible transmission path and can be used for transmitting service streams. And after receiving the successful request response message 4, the source node S starts to transmit the service information flow according to the allocated bandwidth value.
Fig. 5 is a schematic diagram of another route request process according to a first embodiment of the routing method of the present invention, which is a schematic diagram of a route request failure. When receiving the forwarded routing request 5, the intermediate node C cannot meet the requirement of the minimum bandwidth, so that the routing response failure information 6 is returned, the intermediate node returns the routing response failure information 6 to the source node S step by step, correspondingly deletes the bandwidth reservation information which is reserved for the service flow by the intermediate node B and the intermediate node se:Sup>A per se and releases the bandwidth, and the path S-se:Sup>A-B-C-D forms se:Sup>A link in which the routing request fails. Another failed link may have a condition that bandwidth cannot be allocated at the destination node, and a failed link path is formed.
The technical scheme of the embodiment has the advantages that: by dynamically distributing and recycling the occupied bandwidth of the service flow, the bandwidth can be distributed to the service flow in real time according to the bandwidth occupancy rate of the node, the service load of the network is balanced, the problem of network resource bottleneck in a common routing protocol is avoided, and the task of routing transmission is dispersed in the whole network range, so that the control overhead of queuing and the like of part of heavy load node service transmission is reduced, and the advantage of improving the utilization rate of the network resource is achieved. In addition, the intermediate node simultaneously plays the functions of routing transmission and network management, the intermediate node actively updates the information of the intermediate node after accessing or transmitting the service flow, and the load information has higher effectiveness and reliability. When the intermediate node is used as a lower node to distribute the bandwidth for the service flow, the intermediate node does not adopt a simple binary logic expression, but calculates according to the bandwidth occupancy rate and an actual bandwidth distribution function, and reasonably distributes the bandwidth for the service flow. And sequentially calculating whether the requirement of the minimum bandwidth value can be met by the source node and the intermediate node in the route request path, and iteratively searching the next hop node until all effective paths capable of reaching the destination node are searched. The service flow of the source node can not only find an optimal transmission path, but also obtain all feasible transmission paths capable of meeting the minimum requirement of service transmission, when the service flow is transmitted, one of the feasible transmission paths meeting the conditions is arbitrarily selected, and other paths of the feasible transmission path set are used as standby paths, so that the network resources can be fully utilized.
Example two
The difference between the second embodiment of the routing method of the present invention and the first embodiment is that after the lower node sends the routing request, that is, after step A5 is executed, the following steps are added:
b1, accumulating the recording time;
b2, judging whether the routing response information is received, if so, resetting the accumulated time, otherwise, executing the step B3;
b3, judging whether the accumulated time is larger than a threshold value, if so, executing a step B4;
and step B4, if the node defaults that the next hop node is not reachable, executing the step A7.
The specific implementation process of this embodiment is: in the information transmission process of the network, a clock is set in the route request process, and in a specified time range, namely, if the accumulated time reaches a certain threshold value and the route response information cannot be obtained, the method of the step A7 is adopted to reversely delete the corresponding bandwidth information on the transmission path and release the link. Furthermore, a threshold value may be set in the service flow transmission process, when the accumulated time reaches the threshold value after the service flow is transmitted and the transmission response information related to the information transmission is still not received, that is, the service flow transmission is overtime, and the like, the intermediate node does not adopt an active inquiry mode, but regards the service flow which is not normally successfully transmitted as the transmission failure at the time when the specified time limit reaches. By adopting the bandwidth management method in the non-active intervention form, the dynamic release of the bandwidth is carried out on the abnormal service flow transmission and the failed and broken link nodes, so that the bandwidth can be redistributed to other routing requests, the additional network control information can be reduced, and the further increase of the network load can be prevented.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the above method embodiments may be implemented by hardware associated with program instructions, where the program may be stored in a computer readable storage medium, and when executed, performs the steps including the above method embodiments; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, and not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the present invention in its corresponding technical solutions.
Claims (10)
1. A routing method, comprising the steps of:
step 1, receiving a routing request sent by a superior node, and acquiring a bandwidth expected value contained in the routing request;
step 2, detecting the bandwidth occupancy rate of the mobile terminal, and calculating the occupancy rate of the reserved bandwidth according to the bandwidth occupancy rate and the bandwidth expected value;
step 3, judging whether the reserved bandwidth occupancy rate belongs to a linear domain, if so, setting an actual distribution bandwidth value to be equal to a bandwidth expected value, executing step 4, otherwise, generating failed route response information, and executing step 8;
step 4, distributing reserved bandwidth according to the actual distributed bandwidth value, judging whether the self is a destination node, if so, generating successful routing response information, and executing step 8, otherwise, executing step 5;
step 5, forwarding the routing request to the subordinate node of the routing request;
step 6, receiving the route response information, and judging whether the route response information is successful route response information, if so, executing step 8, otherwise, executing step 7;
step 7, deleting the allocated reserved bandwidth;
and 8, sending the routing response information to the upper-level node.
2. The routing method according to claim 1, wherein: the step 2 is specifically to calculate the reserved bandwidth occupancy rate according to the following formula:
wherein, U ij ' is the reserved bandwidth occupancy, U, after the expected bandwidth value is assigned to the route request ij Bandwidth occupancy before a routing request is allocated with a bandwidth expectation value, K is the expected bandwidth value of the routing request, B W Is the total bandwidth value of the node.
3. The routing method according to claim 1, wherein the step 3 specifically is:
step 30, judging whether the reserved bandwidth occupancy rate belongs to a linear domain, if so, setting the actual distribution bandwidth value to be equal to the expected bandwidth value, executing step 4, and if not, executing step 31;
step 31, judging whether the reserved bandwidth occupancy rate belongs to an exponential domain, if so, calculating an actual bandwidth allocation value according to the reserved bandwidth occupancy rate, and executing step 32, otherwise, generating failed route response information, and executing step 8;
and step 32, judging whether the actual bandwidth allocation value is greater than or equal to the minimum bandwidth value contained in the routing request, if so, executing step 4, otherwise, generating failed routing response information, and executing step 8.
4. The routing method according to claim 1, wherein the step of determining whether the reserved bandwidth utilization belongs to the linear domain specifically comprises: and judging whether the occupancy rate of the reserved bandwidth is smaller than a first limit value of the occupancy rate of the bandwidth, if so, judging that the occupancy rate of the reserved bandwidth belongs to a linear domain.
5. The routing method according to claim 3, wherein the step of determining whether the reserved bandwidth utilization belongs to the exponent field specifically comprises: and judging whether the occupancy rate of the reserved bandwidth is smaller than a second limit value of the occupancy rate of the bandwidth, if so, the occupancy rate of the reserved bandwidth belongs to an index field.
6. The routing method according to claim 3, wherein the step of calculating the actual allocated bandwidth value in step 31 is specifically: calculating an actual allocated bandwidth value according to the following formula:
wherein, B (U) ij ) The actual allocated bandwidth value, K is the expected bandwidth value of the route request, U ij ' is the reserved bandwidth occupancy, Δ, after the expected bandwidth value is assigned to the route request 1 The first limit value for the bandwidth occupancy rate is a preset constant, the value of which is determined and the nodeIs relevant.
7. The routing method according to any one of claims 1 to 6, further comprising: and the source node calculates a bandwidth expected value and a bandwidth minimum value according to the service stream transmission information, sets the bandwidth expected value and the bandwidth minimum value as a bandwidth demand value in a packet header domain of the routing request, and sends the routing request to a lower node.
8. The routing method according to any one of claims 1 to 6, further comprising: and setting a first limit value and a second limit value of the bandwidth occupancy rate.
9. The routing method according to any one of claims 1 to 6, further comprising: after sending a routing request, accumulating the recording time, judging whether routing response information is received or not, if so, resetting the accumulated time, otherwise, judging whether the accumulated time reaches a threshold value or not, if so, deleting the reserved bandwidth, and sending failed routing response information to an upper node.
10. The routing method according to any one of claims 1 to 6, further comprising: and sending the service flow, accumulating the recording time, judging whether the transmission response information is received, if so, resetting the accumulated time, otherwise, judging whether the accumulated time reaches a threshold value, if so, deleting the occupied bandwidth and the service flow, and sending the failed service flow transmission information to the upper node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101202566A CN100512231C (en) | 2007-08-14 | 2007-08-14 | Routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101202566A CN100512231C (en) | 2007-08-14 | 2007-08-14 | Routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101119307A true CN101119307A (en) | 2008-02-06 |
| CN100512231C CN100512231C (en) | 2009-07-08 |
Family
ID=39055247
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007101202566A Expired - Fee Related CN100512231C (en) | 2007-08-14 | 2007-08-14 | Routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100512231C (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105517050A (en) * | 2015-12-31 | 2016-04-20 | 江南大学 | Wireless routing algorithm based on congestion control |
| CN108777667A (en) * | 2018-05-31 | 2018-11-09 | 华为技术有限公司 | The bandwidth method and device of transmission channel are adjusted in flexible Ethernet |
| CN110769059A (en) * | 2019-10-28 | 2020-02-07 | 中国矿业大学 | Collaborative service deployment and business distribution method for regional edge computing Internet of things |
| CN113067659A (en) * | 2020-01-02 | 2021-07-02 | 中国移动通信有限公司研究院 | Information processing method, device, equipment and computer readable storage medium |
| CN114141080A (en) * | 2021-11-16 | 2022-03-04 | 中广核(深圳)运营技术与辐射监测有限公司 | Fire-fighting simulation drilling method and system |
| CN115277847A (en) * | 2022-07-27 | 2022-11-01 | 阿里巴巴（中国）有限公司 | Service processing method, device, equipment, platform, medium and program product |
| CN115883457A (en) * | 2021-09-28 | 2023-03-31 | 华为技术有限公司 | Communication method and routing equipment |
-
2007
- 2007-08-14 CN CNB2007101202566A patent/CN100512231C/en not_active Expired - Fee Related
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105517050B (en) * | 2015-12-31 | 2018-11-30 | 江南大学 | Wireless route method based on congestion control |
| CN105517050A (en) * | 2015-12-31 | 2016-04-20 | 江南大学 | Wireless routing algorithm based on congestion control |
| CN108777667B (en) * | 2018-05-31 | 2021-12-21 | 华为技术有限公司 | Method and device for adjusting bandwidth of transmission channel in flexible Ethernet |
| CN108777667A (en) * | 2018-05-31 | 2018-11-09 | 华为技术有限公司 | The bandwidth method and device of transmission channel are adjusted in flexible Ethernet |
| US11349719B2 (en) | 2018-05-31 | 2022-05-31 | Huawei Technologies Co., Ltd. | Method and apparatus for adjusting bandwidth of transmission channel in flexible ethernet |
| CN110769059A (en) * | 2019-10-28 | 2020-02-07 | 中国矿业大学 | Collaborative service deployment and business distribution method for regional edge computing Internet of things |
| CN110769059B (en) * | 2019-10-28 | 2021-08-17 | 中国矿业大学 | Collaborative service deployment and business distribution method for regional edge computing Internet of things |
| CN113067659A (en) * | 2020-01-02 | 2021-07-02 | 中国移动通信有限公司研究院 | Information processing method, device, equipment and computer readable storage medium |
| CN113067659B (en) * | 2020-01-02 | 2022-08-23 | 中国移动通信有限公司研究院 | Information processing method, device, equipment and computer readable storage medium |
| CN115883457A (en) * | 2021-09-28 | 2023-03-31 | 华为技术有限公司 | Communication method and routing equipment |
| CN115883457B (en) * | 2021-09-28 | 2024-09-17 | 华为技术有限公司 | Communication method and routing equipment |
| CN114141080A (en) * | 2021-11-16 | 2022-03-04 | 中广核(深圳)运营技术与辐射监测有限公司 | Fire-fighting simulation drilling method and system |
| CN115277847A (en) * | 2022-07-27 | 2022-11-01 | 阿里巴巴（中国）有限公司 | Service processing method, device, equipment, platform, medium and program product |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100512231C (en) | 2009-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sathyasri et al. | Comparative Study Between Static Dynamic and Hybrid Channel Assignment Techniques In Multi Channel and Multi Radio In Wireless Mesh Network | |
| Nelson et al. | GSTAR: generalized storage-aware routing for mobilityfirst in the future mobile internet | |
| KR100900307B1 (en) | Radio Communication Device, Communication Route Control Device, Communication Route Control Method, and Communication System | |
| CN100512231C (en) | Routing method | |
| Wu | An extended dynamic source routing scheme in ad hoc wireless networks | |
| CA2484501A1 (en) | Traffic policing in a mobile ad hoc network | |
| EP1502459A1 (en) | Allocating channels in a mobile ad hoc network | |
| EP1500229A2 (en) | DETERMINING QUALITY OF SERVICE (QoS) ROUTING FOR MOBILE AD HOC NETWORKS | |
| CN111935246A (en) | User generated content uploading method and system based on cloud edge collaboration | |
| CN108449270A (en) | Buffer memory management method priority-based in opportunistic network | |
| CN104010343A (en) | Wireless network optimization method for intelligent meter reading system | |
| CN110351200B (en) | Opportunistic network congestion control method based on forwarding task migration | |
| Ghaffari et al. | QoS-based routing protocol with load balancing for wireless multimedia sensor networks using genetic algorithm | |
| CN101646218B (en) | GOP-based multi-path source routing protocol implementation method | |
| Lindgren et al. | Multi-path admission control for mobile ad hoc networks | |
| Devi et al. | Content based routing using information centric network for IoT | |
| Hu | P2P Data dissemination for real-time streaming using load-balanced clustering infrastructure in MANETs with large-scale stable hosts | |
| Le et al. | A joint relay selection and buffer management scheme for delivery rate optimization in dtns | |
| Wang et al. | Resource optimization protocol based on multicommunity model for intermittently connected mobile networks | |
| Joo et al. | Urgency-based packet scheduling and routing algorithms for video transmission over MANETs | |
| Yeh et al. | VIP: Joint traffic engineering and caching in Named Data Networks | |
| Ali et al. | A dynamic resource-aware routing protocol in resource-constrained opportunistic networks | |
| CN112910779A (en) | Ad Hoc network-based cross-layer routing optimization protocol | |
| Wu et al. | Cross-layer routing optimization for video transmission over wireless ad hoc networks | |
| Rekik et al. | An energy efficiency and delay guarantee service selection protocol in MANET |
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: 20090708 Termination date: 20150814 |
|
| EXPY | Termination of patent right or utility model |