CN102377670A - Dynamic route adjustment method of user QoS (Quality of Service) oriented to cognitive network - Google Patents
Dynamic route adjustment method of user QoS (Quality of Service) oriented to cognitive network Download PDFInfo
- Publication number
- CN102377670A CN102377670A CN2011103220743A CN201110322074A CN102377670A CN 102377670 A CN102377670 A CN 102377670A CN 2011103220743 A CN2011103220743 A CN 2011103220743A CN 201110322074 A CN201110322074 A CN 201110322074A CN 102377670 A CN102377670 A CN 102377670A
- Authority
- CN
- China
- Prior art keywords
- cognitive
- load factor
- cognitive nodes
- nodes
- cognition
- 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 invention discloses a dynamic route adjustment method of a user QoS (Quality of Service) oriented to a cognitive network. The dynamic route adjustment method provided by the invention comprises the following steps of: calculating a user QoS priority by using a utility function; processing a particular program in a cognitive packet by a cognitive node through an interrupt mechanism, and calculating a load rate of the cognitive node; and determining whether to select other routes to transmit the data packet. Therefore, the purposes of reducing the network congestion, decreasing the packet loss rate and improving the network QoS are achieved.
Description
Technical field
The present invention relates to flow analysis, association areas such as Route Selection belong to a kind of method that improves cognition network QoS.
Background technology
The prominent question of legacy network is to make a policy according to the change dynamics of internal and external environment, thereby can not effectively improve user's QoS, and when the network node load factor surpassed certain value, user's QoS can significantly descend.Problems such as Route Selection can not dynamically be changed in legacy network, and the QoS that this has had a strong impact on the user causes congested control difficulty, and packet loss is big, and time-delay is long.
Cognition network is the network with cognitive cycle characteristics, and this network can be observed current network environment, and plans, makes a strategic decision and carry out according to observed result.These knowledge can learnt and utilize to cognition network from adaptive process be that target is made a strategic decision in advance with the end to end performance.At present, academia has proposed method and the mechanism of the many network user of improvement QoS.
Have the scholar to propose to come calculated data and make a strategic decision through node, this has utilized the active cognitive features of cognition network to a certain extent, and network congestion control is had certain effect, but does not consider the load factor of cognitive nodes.Along with the increase of cognitive nodes load factor, the packet time-delay also can prolong, thereby the QoS of network is caused negative effect, causes network congestion, packet loss increase etc.Also have the scholar to propose to have the interrupt mechanism of dynamic adjustment bandwidth capability, simple permission high-priority data preferentially passes through, but this scheme has reduced the percent of pass of lower-priority data, can cause the reduction of user QoS equally.
Summary of the invention
Technical problem to be solved by this invention is to the problem in the background technology, proposes a kind of user QoS dynamic routing method of adjustment towards cognition network, dynamically adjusts route, reduces network congestion and packet loss, and then improves user QoS.
The present invention adopts following technical scheme for solving the problems of the technologies described above:
A kind of user QoS dynamic routing method of adjustment towards cognition network steps of the method are:
Step 1) adopts the QoS utility function to calculate the priority of grouped data, and the priority of calculating is encapsulated in the grouped data, makes it to become cognitive the grouping;
Step 2), set cognitive nodes and select cognitive transmission packets route method, whether this method surpasses threshold value through the load factor of judging cognitive nodes is selected cognitive transmission packets path; This method is encapsulated in the cognitive packets headers becomes executable program, sends then and should cognition divide into groups to receiving terminal;
Step 3) when cognition is divided into groups through cognitive nodes, makes cognitive nodes get into interrupt mode; Cognitive nodes is carried out and is encapsulated in the executable program in the cognitive packets headers, makes according to priority pass through node from height to low order cognitive the grouping;
Step 4) after cognitive transmitted in packets finishes, changes cognitive nodes into general mode by interrupt mode;
Step 5), receiving terminal feeds back to transmitting terminal with packet drop and time delay situation;
Step 6), transmitting terminal is adjusted transmission rate according to feedback information, prepares to send next time.
Further, in the user QoS dynamic routing method of adjustment of cognition network of the present invention, step 2) said setting cognitive nodes selects the concrete steps of cognitive transmission packets route method following:
Step a); Calculate the load factor
of each cognitive nodes, the threshold value
of each cognitive nodes load factor is set then;
Step b); On the basis of threshold value
; Define one section load factor interval
, wherein
;
Step c); Cognitive stream of packets is through cognitive nodes; When the load factor of this cognitive nodes during greater than threshold value
, another walks around the new route of this cognitive nodes with the Dijsktra algorithm computation; If found new route, then make it the cognition grouping process new route that the back arrives, divide into groups otherwise abandon this cognition, recover normal up to this cognitive nodes load factor;
Step d); When cognition is divided into groups through new route; Constantly detect the cognitive nodes load factor of original route; When former cognitive nodes load factor was lower than respective bins value
, the cognition that then makes it back arrival was divided into groups through the cognitive nodes of original route;
Step e); If the cognitive nodes load factor of new route has surpassed threshold value; And former cognitive nodes load factor still is higher than respective bins value
; The grouping that arrives after then abandoning returns to below the interval value
up to the load factor of the cognitive nodes of original route or new route.
The present invention adopts above technical scheme compared with prior art, has following technique effect:
1. through using utility function to calculate grouped data priority, improved the accuracy that network system is judged user QoS priority;
2. cognitive nodes adopts interrupt mechanism initiatively to carry out specific program, accomplishes the network calculations task;
3. utilize cognitive nodes load factor threshold value, effectively Control Network is congested, reduces packet loss and time-delay, and then has improved network QoS.
Description of drawings
Fig. 1 is the user QoS dynamic routing method of adjustment frame diagram towards cognition network.
Fig. 2 is the cognitive grouping flow chart of Network Transmission.
Fig. 3 is the decision node load factor, selects the new route flow chart.
Embodiment
Below in conjunction with accompanying drawing technical scheme of the present invention is done further detailed description:
Combine shown in Figure 2ly like Fig. 1, dynamic routing method of adjustment of the present invention comprises the steps:
Step 1) adopts the QoS utility function to calculate the priority of grouped data, and the priority of calculating is encapsulated in the grouped data, makes it to become cognitive the grouping;
Step 2), in cognitive packets headers, encapsulate specific program (is the program of flow process with Fig. 3), transmission should be divided into groups to receiving terminal in cognition;
Step 3) when cognition is divided into groups through cognitive nodes, makes cognitive nodes get into interrupt mode; Cognitive nodes is carried out and is encapsulated in the specific program in the cognitive packets headers, makes according to priority pass through node from height to low order cognitive the grouping;
Step 4), whether the load factor of detection cognitive nodes surpasses threshold value through the load factor of judging cognitive nodes and selects cognitive transmission packets path;
Step 5) after cognitive transmitted in packets finishes, changes cognitive nodes into general mode by interrupt mode;
Step 6), receiving terminal feeds back to transmitting terminal with packet drop and time delay situation;
Step 7), transmitting terminal is adjusted transmission rate according to feedback information, prepares to send next time.
As shown in Figure 3, the method for the monitoring node load factor that step 4) is mentioned, step is following:
Step a); Calculate the load factor
of each cognitive nodes, the threshold value
of each cognitive nodes load factor is set then;
Step b); On the basis of threshold value
; Define one section load factor interval
, wherein
;
Step c); Cognitive stream of packets is through cognitive nodes; When the load factor of this cognitive nodes during greater than threshold value
, another walks around the new route of this cognitive nodes with the Dijsktra algorithm computation; If found new route, then make it the cognition grouping process new route that the back arrives, divide into groups otherwise abandon this cognition, recover normal up to this cognitive nodes load factor;
Step d); When cognition is divided into groups through new route; Constantly detect the cognitive nodes load factor of original route; When former cognitive nodes load factor was lower than respective bins value
, the cognition that then makes it back arrival was divided into groups through the cognitive nodes of original route;
Step e); If the cognitive nodes load factor of new route has surpassed threshold value; And former cognitive nodes load factor still is higher than respective bins value
; The grouping that arrives after then abandoning returns to below the interval value
up to the load factor of the cognitive nodes of original route or new route.
It is that load factor with cognitive nodes is a cost that above-mentioned employing dijkstra's algorithm calculates shortest path, if find many feasible paths, then can give these several paths with traffic distribution, makes to reach the load relative equilibrium between multipath.The alleviating network congestion that takes action to too continually can make system produce unsettled vibration.But too slow take action and do not have any practical value.So
choosing of value will be compromised; The difference of
can not be too little, can not be too big.
Claims (2)
1. the user QoS dynamic routing method of adjustment towards cognition network is characterized in that, may further comprise the steps:
Step 1) adopts the QoS utility function to calculate the priority of grouped data, and the priority of calculating is encapsulated in the grouped data, makes it to become cognitive the grouping;
Step 2), set cognitive nodes and select cognitive transmission packets route method, whether this method surpasses threshold value through the load factor of judging cognitive nodes is selected cognitive transmission packets path; This method is encapsulated in the cognitive packets headers becomes executable program, sends then and should cognition divide into groups to receiving terminal;
Step 3) when cognition is divided into groups through cognitive nodes, makes cognitive nodes get into interrupt mode; Cognitive nodes is carried out and is encapsulated in the executable program in the cognitive packets headers, makes according to priority pass through node from height to low order cognitive the grouping;
Step 4) after cognitive transmitted in packets finishes, changes cognitive nodes into general mode by interrupt mode;
Step 5), receiving terminal feeds back to transmitting terminal with packet drop and time delay situation;
Step 6), transmitting terminal is adjusted transmission rate according to feedback information, prepares to send next time.
2. according to the user QoS dynamic routing method of adjustment of the said cognition network of claim 1, it is characterized in that step 2) said setting cognitive nodes selects the concrete steps of cognitive transmission packets route method following:
Step a); Calculate the load factor
of each cognitive nodes, the threshold value
of each cognitive nodes load factor is set then;
Step b); On the basis of threshold value
; Define one section load factor interval
, wherein
;
Step c); Cognitive stream of packets is through cognitive nodes; When the load factor of this cognitive nodes during greater than threshold value
, another walks around the new route of this cognitive nodes with the Dijsktra algorithm computation; If found new route, then make it the cognition grouping process new route that the back arrives, divide into groups otherwise abandon this cognition, recover normal up to this cognitive nodes load factor;
Step d); When cognition is divided into groups through new route; Constantly detect the cognitive nodes load factor of original route; When former cognitive nodes load factor was lower than respective bins value
, the cognition that then makes it back arrival was divided into groups through the cognitive nodes of original route;
Step e); If the cognitive nodes load factor of new route has surpassed threshold value; And former cognitive nodes load factor still is higher than respective bins value
; The grouping that arrives after then abandoning returns to below the interval value
up to the load factor of the cognitive nodes of original route or new route.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110322074.3A CN102377670B (en) | 2011-10-21 | 2011-10-21 | Dynamic route adjustment method of user QoS (Quality of Service) oriented to cognitive network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110322074.3A CN102377670B (en) | 2011-10-21 | 2011-10-21 | Dynamic route adjustment method of user QoS (Quality of Service) oriented to cognitive network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102377670A true CN102377670A (en) | 2012-03-14 |
| CN102377670B CN102377670B (en) | 2014-05-07 |
Family
ID=45795664
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110322074.3A Active CN102377670B (en) | 2011-10-21 | 2011-10-21 | Dynamic route adjustment method of user QoS (Quality of Service) oriented to cognitive network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102377670B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095575B (en) * | 2012-12-28 | 2018-04-06 | 国家计算机网络与信息安全管理中心 | The adjustable mechanism method and system of anonymous communication system |
| GB2557440A (en) * | 2016-11-03 | 2018-06-20 | Ibm | Dynamic scriptable routing |
| CN113114582A (en) * | 2021-05-25 | 2021-07-13 | 电子科技大学 | Link congestion fault prediction and network autonomous control method based on machine learning |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101778423A (en) * | 2010-01-19 | 2010-07-14 | 南京邮电大学 | Mobile agent-based method for guaranteeing quality of service of wireless multimedia sensor network |
| US20110149844A1 (en) * | 2009-12-21 | 2011-06-23 | Manipal Institute Of Technology | Multi-service adaptable routing protocol for wireless sensor networks |
-
2011
- 2011-10-21 CN CN201110322074.3A patent/CN102377670B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20110149844A1 (en) * | 2009-12-21 | 2011-06-23 | Manipal Institute Of Technology | Multi-service adaptable routing protocol for wireless sensor networks |
| CN101778423A (en) * | 2010-01-19 | 2010-07-14 | 南京邮电大学 | Mobile agent-based method for guaranteeing quality of service of wireless multimedia sensor network |
Non-Patent Citations (1)
| Title |
|---|
| 李红艳等: "认知网络路由技术", 《中兴通讯技术》, no. 01, 31 August 2011 (2011-08-31), pages 1858 - 1863 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095575B (en) * | 2012-12-28 | 2018-04-06 | 国家计算机网络与信息安全管理中心 | The adjustable mechanism method and system of anonymous communication system |
| GB2557440A (en) * | 2016-11-03 | 2018-06-20 | Ibm | Dynamic scriptable routing |
| US10659353B2 (en) | 2016-11-03 | 2020-05-19 | International Business Machines Corporation | Dynamic scriptable routing |
| CN113114582A (en) * | 2021-05-25 | 2021-07-13 | 电子科技大学 | Link congestion fault prediction and network autonomous control method based on machine learning |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102377670B (en) | 2014-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109547340B (en) | SDN data center network congestion control method based on rerouting | |
| CN106533960B (en) | A kind of data center network method for routing based on Fat-Tree structure | |
| CN111316605B (en) | Layer 3 fair rate congestion control notification | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| CN102595503B (en) | Congestion control method based on wireless multimedia sensor network | |
| US7746784B2 (en) | Method and apparatus for improving traffic distribution in load-balancing networks | |
| CN108833279B (en) | Method for multi-constraint QoS routing based on service classification in software defined network | |
| KR101493632B1 (en) | System and method for implementing periodic early discard in on-chip buffer memories of network elements | |
| CN102014075B (en) | Traffic policing method and device | |
| CN104272680A (en) | Signalling congestion | |
| US20180183720A1 (en) | Adaptive routing based on flow-control credits | |
| Aamir et al. | A buffer management scheme for packet queues in MANET | |
| CN107070802B (en) | Wireless sensor network congestion control method based on PID controller | |
| CN104618256A (en) | Open shortest path first (OSPF) link load dynamic adjusting method | |
| US20150117220A1 (en) | Communication Node, A Receiving Node and Methods Therein | |
| Sharma et al. | Congestion control techniques in MANET: a survey | |
| Sanchez-Iborra et al. | On the similarities between urban traffic management and communication networks: Application of the random early detection algorithm for self-regulating intersections | |
| CN102377670B (en) | Dynamic route adjustment method of user QoS (Quality of Service) oriented to cognitive network | |
| Zhao et al. | An improved algorithm of nonlinear RED Based on membership cloud theory | |
| Sridevi et al. | Priority based congestion control for heterogeneous traffic in multipath wireless sensor networks | |
| CN108712336A (en) | A kind of local message dynamic routing algorithm improving scales-free network transmission capacity | |
| Uthra et al. | A probabilistic approach for predictive congestion control in wireless sensor networks | |
| CN104092566B (en) | Queue management method for service differentiation | |
| KR20090062878A (en) | System and method for packet scheduling | |
| Budhwar et al. | Congestion Detection and Avoidance based Transport Layer Protocols for Wireless Sensor Networks |
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 |