CN104683239A - Internet-oriented energy-saving type QoS routing method - Google Patents

Abstract

The invention provides an internet-oriented energy-saving type QoS (Quality of Service) routing method. The method comprises the following steps: firstly acquiring status information of the network; according to a source router of a user service request, querying whether the target router is located in a route information table of the source router, if yes, routing according to the route information in the route information table, or routing according to a distributed routing algorithm, updating the routing list, finishing data communication, sending a dormancy request message to an adjacent router by the router in the idle state, and then enabling the router to be under the dormant state after receiving a dormancy response message sent by the adjacent router. The internet-oriented energy-saving type QoS routing method can regulate the perception cycle for perceiving the messages and determine the update time of the route information, so that the network energy consumption can be reduced, and the resource occupancy rate can be effectively decreased.

Description

A kind of energy-saving QoS method for routing of Internet

Technical field:

The present invention relates to networking technology area, particularly relate to a kind of energy-saving QoS method for routing of Internet.

Background technology:

The present stage explosive increase of Internet bandwidth result in the energy consumption of internet device and cooling cost sharply rises violently, and more unfortunately rely on the improvement of silicon technology to hardware energy consumption more and more less, be tending towards saturated just gradually and the limit of the gas cooled mode that the positive convergence of radiating requirements is traditional.Therefore in recent years, " GreenNet " becomes one of several large study hotspot of global ICT industry.

In order to realize energy-conservation in the Internet and generate more massive network, need to modify to Routing Protocol, the ospf protocol of some expansions is when broadcasting renewal LSA message, need to recalculate all routed paths, the wasting of resources can be caused like this, be not suitable for green the Internet, need to redesign Routing Protocol to adapt to different park modes.Prior art for close in IP network or open link cause change in topology time, link-state routing protocol is restrained again, and routing table may be inconsistent during restraining, and even produces the problem of loop, proposes routing table update algorithm; Network connectivty can be reduced for removing link in network, even may cause the problem of Routing Protocol instant failure, traffic demand of giving chapter and verse dynamically carries out Route Selection to optimize the shutdown strategy of link, but does not provide the method for designing of traffic probe and flow measurement.

Summary of the invention:

For the defect of prior art, the invention provides a kind of energy-saving QoS method for routing of Internet, thus decrease network energy consumption, effectively reduce the wasting of resources.

On the one hand, the invention provides a kind of energy-saving QoS method for routing of Internet, comprising:

Obtain the state information of network, the state information of described network comprises qos parameter, power consumption parameter, CPU usage and storage utilization rate, and described qos parameter comprises bandwidth, delay, delay jitter and error rate;

According to the source router of customer service request, whether inquiry object router is in the routing information table of described source router, if then carry out route according to the routing information in described routing information table, otherwise carry out route according to distributed routing algorithm, upgrade routing table;

Complete data communication and the router being in idle condition sends sleep request message to neighboring router, after receiving the dormancy response message that neighboring router sends, enter resting state;

Regulate the perception cycle of perception message, determine the update time of routing information.

Alternatively, the state information of described acquisition network, comprising:

Router periodically sends perception message to neighboring router, and described perception message carries network state information;

Described neighboring router receives network state information described in perception message accounting, is stored in neighbor information table.

Alternatively, the described source router according to customer service request, whether inquiry object router, in the routing information table of described source router, comprising:

Source router sends probe messages to each router in described routing information table;

The each query router receiving described probe messages meets the minimum routing information of QoS demand, energy consumption, and sends described probe messages to the router on described routing information;

Inquire about described object router whether in the routing information table of described source router.

Alternatively, when the router being in described resting state be required rework time, neighboring router sends to the router being in described resting state and wakes message up, or the router being in described resting state arranges dormancy time and automatically wakes up.

Alternatively, in the perception cycle of described adjustment perception message, determine the update time of routing information, be specially,

The perception cycle of perception message is regulated according to the rate of change of QoS satisfaction of network state information and the rate of change of power consumption parameter;

By arranging timer or dynamically change update time of routing information according to network state information rate of change in routing information table.

Alternatively, the rate of change rate of the QoS satisfaction of described network state information _{satis (QoS)}, calculated by following formula,

${\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{QoS}\right)}=\left\{\begin{array}{c}0,\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}=\mathrm{Satis}\left(\mathrm{QoS}\right)=0\\ \mathrm{Satis}\left(\mathrm{QoS}\right),\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}=0,\mathrm{Satis}\left(\mathrm{QoS}\right)\≠0\\ \mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}},\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}\≠0,\mathrm{Satis}\left(\mathrm{QoS}\right)=0\\ \left|\frac{\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}-\mathrm{Satis}\left(\mathrm{QoS}\right)}{\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}}\right|,\mathrm{Satis}\left(\mathrm{QoS}\right)\≠0,\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}\≠0\end{array}\right.$

Wherein, Satis (QoS) ^lastfor the QoS satisfaction that the last time obtains, the QoS satisfaction that Satis (QoS) is current acquisition;

Described QoS satisfaction Satis (QoS), is calculated by following formula,

Satis(QoS)＝a _bw×Satis(bw)+a _dl×Satis(dl)+a _jt×Satis(jt)+a _er×Satis(er)

Wherein, a _bw, a _dl, a _jt, a _erbe respectively bandwidth, delay, delay jitter, error rate to the significance level of user, for different types of service and the grade of service, they get different values, and meet 0 < a _bw< 1,0 < a _dl< 1,0 < a _jt< 1,0 < a _er< 1, a _bw+ a _dl+ a _jt+ a _er=1;

Satis (bw), for user is to the bandwidth satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{dw}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{bw}<{\mathrm{bw}}_l\\ \mathrm{\&epsiv;}& \mathrm{bw}={\mathrm{bw}}_l\\ {\left(\frac{\mathrm{bw}-{\mathrm{bw}}_l}{{\mathrm{bw}}_h-{\mathrm{bw}}_l}\right)}^{\mathrm{\&alpha;}}& {\mathrm{bw}}_l<\mathrm{bw}<\frac{1}{2}({\mathrm{bw}}_l+{\mathrm{bw}}_h)\\ {\left(\frac{\mathrm{bw}-{\mathrm{bw}}_l}{{\mathrm{bw}}_h-{\mathrm{bw}}_l}\right)}^{\mathrm{\&beta;}}& \frac{1}{2}({\mathrm{bw}}_l+{\mathrm{bw}}_h)\&le;\mathrm{bw}<{\mathrm{bw}}_h\\ \mathrm{\&xi;}& \mathrm{bw}={\mathrm{bw}}_h\\ 1& \mathrm{bw}>{\mathrm{bw}}_h\end{array}\right.$

Wherein, bw _lfor bandwidth interval limit, bw _hfor the interval upper limit of bandwidth, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (dl), for user is to the delay satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{dl}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{dl}>{\mathrm{dl}}_h\\ \mathrm{\&epsiv;}& \mathrm{dl}={\mathrm{dl}}_h\\ {\left(\frac{d{l}_h-\mathrm{dl}}{{\mathrm{dl}}_h-{\mathrm{dl}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{dl}}_l+{\mathrm{dl}}_h)\&le;\mathrm{dl}<{\mathrm{dl}}_h\\ {\left(\frac{d{l}_h-\mathrm{dl}}{{\mathrm{dl}}_h-{\mathrm{dl}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{dl}}_l<\mathrm{dl}<\frac{1}{2}({\mathrm{dl}}_l+{\mathrm{dl}}_h)\\ \mathrm{\&xi;}& \mathrm{dl}={\mathrm{dl}}_l\\ 1& \mathrm{dl}<{\mathrm{dl}}_l\end{array}\right.$

Wherein, dl _lfor postponing interval limit, dl _hfor the upper limit between delay zone, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (jt), for user is to the delay jitter satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{jt}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{jt}>{\mathrm{jt}}_h\\ \mathrm{\&epsiv;}& \mathrm{jt}={\mathrm{jt}}_h\\ {\left(\frac{{\mathrm{jt}}_h-\mathrm{jt}}{{\mathrm{jt}}_h-{\mathrm{jt}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{jt}}_l+{\mathrm{jt}}_h)\&le;\mathrm{jt}<{\mathrm{jt}}_h\\ {\left(\frac{{\mathrm{jt}}_h-\mathrm{jt}}{{\mathrm{jt}}_h-{\mathrm{jt}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{jt}}_l<\mathrm{jt}<\frac{1}{2}({\mathrm{jt}}_l+{\mathrm{jt}}_h)\\ \mathrm{\&xi;}& \mathrm{jt}={\mathrm{jt}}_l\\ 1& \mathrm{jt}<{\mathrm{jt}}_l\end{array}\right.$

Wherein, jt _lfor delay jitter interval limit, jt _hfor the interval upper limit of delay jitter, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (er), for user is to the error rate satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{er}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{er}>{\mathrm{er}}_h\\ \mathrm{\&epsiv;}& \mathrm{er}={\mathrm{er}}_h\\ {\left(\frac{{\mathrm{er}}_h-\mathrm{er}}{{\mathrm{er}}_h-{\mathrm{er}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{er}}_l+{\mathrm{er}}_h)\&le;\mathrm{er}<{\mathrm{er}}_h\\ {\left(\frac{{\mathrm{er}}_h-\mathrm{er}}{{\mathrm{er}}_h-{\mathrm{er}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{er}}_l<\mathrm{er}<\frac{1}{2}({\mathrm{er}}_l+{\mathrm{er}}_h)\\ \mathrm{\&xi;}& \mathrm{er}={\mathrm{er}}_l\\ 1& \mathrm{er}<{\mathrm{er}}_l\end{array}\right.$

Wherein, er _lfor error rate interval limit, er _hfor the interval upper limit of error rate, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1.

Alternatively, the rate of change rate of described power consumption parameter _power, calculated by following formula,

${\mathrm{rate}}_{\mathrm{power}}=\left|\frac{{\mathrm{power}-\mathrm{power}}^{\mathrm{last}}}{{\mathrm{power}}^{\mathrm{last}}}\right|$

Wherein, power ^lastfor the power consumption parameter value that the last time obtains, power is the power consumption parameter value of current acquisition;

Described power consumption parameter value power, is calculated by following formula,

$\mathrm{power}=\underset{i=1}{\overset{\left|V\right|}{\mathrm{\&Sigma;}}}{P}_{\mathrm{node}}^i\&times;\mathrm{NodeS}{t}_i+\underset{j=1}{\overset{\left|E\right|}{\mathrm{\&Sigma;}}}{P}_{\mathrm{link}}^j\&times;{\mathrm{LinkSt}}_j$

Wherein, NodeSt _ifor the status identifier of node i, LinkSt _jfor the status identifier of link j, wherein, described status identifier is 0 expression idle condition, is 1 expression operating state, for the power consumption of node i, for the power consumption of link j, | V| is the node total number in path, | E| is the link sum in path, calculated by following formula,

$P_{\mathrm{node}}^i=P_{\mathrm{ctrl}}^i+P_{\mathrm{repl}}^i+\underset{k=1}{\overset{N_{\mathrm{chass}}^i}{\mathrm{\&Sigma;}}}(P_{\mathrm{chass}}^i\&times;{\mathrm{ChaSt}}_i^k+\underset{\mathrm{lc}=1}{\overset{N_{\mathrm{lcrd}}^k}{\mathrm{\&Sigma;}}}(P_{\mathrm{ford}}^i+P_{\mathrm{repl}}^i)\&times;{\mathrm{LkdSt}}_k^{\mathrm{lc}}+\underset{p=l}{\overset{N_{\mathrm{port}}^{\mathrm{lc}}}{\mathrm{\&Sigma;}}}{p}_{\mathrm{port}}^i(1+\mathrm{\&alpha;}\&times;{\mathrm{trf}}_p^{\mathrm{\&beta;}})\&times;{\mathrm{PortSt}}_{\mathrm{lc}}^p)$

Wherein, for the master engine power consumption of node i, for the forwarding engine power consumption of node i, for the replication engine power consumption of node i, for the power consumption of a node i underframe, for the power consumption of a node i port, for the quantity of underframe in node i, for the quantity of the line card of underframe k in node i, for the quantity of the line card lc upper port of underframe k in node i, for the status identifier of underframe k in node i, for the status identifier of line card lc in node i, the status identifier of line card lc upper port p in node i, described status identifier is 0 expression resting state, is 1 expression operating state, trf _pfor the flow by line card lc upper port p in node i, α and β is constant, is used for representing the relation of flow and power consumption;

the power consumption of link, is calculated by following formula,

$P_{\mathrm{link}}^j=(1+{\mathrm{\&alpha;}}^{\&prime;}\&times;\mathrm{tr}{f}_j^{{\mathrm{\&beta;}}^{\&prime;}})\&times;(P_{\mathrm{fort}}+\underset{a=1}{\overset{N_{\mathrm{reptr}}^j}{\mathrm{\&Sigma;}}}(P_{\mathrm{reptr}}\&times;\mathrm{RptrS}{t}_j^a)+P_{\mathrm{rear}}+\underset{b=1}{\overset{N_{\mathrm{regenr}}^j}{\mathrm{\&Sigma;}}}(P_{\mathrm{regen}}\&times;{\mathrm{RgentrSt}}_j^b))$

Wherein, P _fortfor Optical Preamplifier power consumption, P _reptrfor Repeater optical amplifiers power consumption, P _regenfor reproduced light device power consumption, P _rearfor reproduced light amplifier power consumption, for the number of relay amplifier on link j, for the number of optical regenerator on link j, for the state of relay amplifier a on link j, for the status identifier of relay amplifier b on link j, described status identifier is 0 expression idle condition, is 1 expression operating state, trf _jfor the flow on link j, α ' and β ' are constant, are used for representing the relation of flow and power consumption.

Alternatively, described perception cycle T _per, calculated by following formula,

$T_{\mathrm{per}}=\left\{\begin{array}{c}\frac{T}{{\mathrm{rate}}_{\mathrm{power}}},{\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{GoS}\right)}=0\\ \frac{T}{{\mathrm{rate}}_{\mathrm{power}}\&times;{\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{GoS}\right)}},\mathrm{rat}{e}_{\mathrm{Satis}\left(\mathrm{GoS}\right)\&NotEqual;0}\end{array}\right.$

Wherein, T is a set time value when network state information does not change.

Alternatively, described passing through arranges timer in routing information table, is specially: when the value of timer is 0, delete old routing information, starts routing information update mechanism;

The described update time dynamically changing routing information according to network state information rate of change, be specially: when network state information rate of change is 0, routing information does not upgrade, when network state information rate of change is not 0, by the relation of perception cycle and network state information rate of change, record update time.

As shown from the above technical solution, the energy-saving QoS method for routing of a kind of Internet of the present invention, first the state information of network is obtained, according to the source router of customer service request, whether inquiry object router is in the routing information table of described source router, if then carry out route according to the routing information in described routing information table, otherwise carry out route according to distributed routing algorithm, upgrade routing table, complete data communication and the router being in idle condition sends sleep request message to neighboring router, resting state is entered after receiving the dormancy response message of neighboring router transmission, regulate the perception cycle of perception message, determine the update time of routing information, thereby reduce network energy consumption, effectively reduce the wasting of resources.

Accompanying drawing illustrates:

The network model schematic diagram of the simplification that Fig. 1 provides for one embodiment of the invention;

The router-modelle structural representation that Fig. 2 provides for one embodiment of the invention;

The link model structural representation that Fig. 3 provides for one embodiment of the invention;

The energy-saving QoS method for routing schematic flow sheet of a kind of Internet that Fig. 4 provides for one embodiment of the invention;

The perception message format that Fig. 5 provides for one embodiment of the invention;

The perception response message form that Fig. 6 provides for one embodiment of the invention;

The probe messages form that Fig. 7 provides for one embodiment of the invention;

The unavailable message format of routing information that Fig. 8 provides for one embodiment of the invention;

The routing information that Fig. 9 provides for one embodiment of the invention can use message format;

The Route Selection message format that Figure 10 provides for one embodiment of the invention;

The routing information message format that Figure 11 provides for one embodiment of the invention;

The sleep request message format that Figure 12 provides for one embodiment of the invention;

The dormancy response message form that Figure 13 provides for one embodiment of the invention;

The hibernation awaking message form that Figure 14 provides for one embodiment of the invention;

The notice message format of reviving that Figure 15 provides for one embodiment of the invention.

Embodiment:

Below in conjunction with drawings and Examples, the specific embodiment of the present invention is described in further detail.Following examples for illustration of the present invention, but are not used for limiting the scope of the invention.

A given group network model, can be reduced to connected graph G (V, E), as shown in Figure 1, and V=(v ₁, v ₂..., v _n) represent the set on summit, each vertex representation network node, the router namely in network, E=(e ₁, e ₂..., e _l) representing the set on limit, every bar limit represents the link in network.

Router is the main tool in network service, and Fig. 2 shows router-modelle structural representation, and as shown in Figure 2, router is primarily of compositions such as underframe, line card, route master engine, switching matrix, forwarding engine and replication engines.Wherein, master engine is the control centre of router, controls route, constantly updates routing table; Switching matrix is used for connecting input and output port in router interior.Forwarding engine has been used for comprising the functions such as data input and storage, header analysis, routing table lookup; Replication engine is used for multicast replication, and all engines all have certain buffer memory.

Fig. 3 shows link model structural representation, and as shown in Figure 3, link is primarily of device compositions such as Optical Preamplifier, Repeater optical amplifiers, optical regenerator and rearmounted image intensifers.Wherein, Optical Preamplifier is used for the transmitting power of raising business; Repeater optical amplifiers is used for extending transmission distance; Optical regenerator is used for repairing signal; Rearmounted image intensifer is used for the power of switching signal.

Fig. 4 shows the energy-saving QoS method for routing schematic flow sheet of a kind of Internet that one embodiment of the invention provides, and as shown in Figure 4, the method for the present embodiment is as described below.

401, obtain the state information of network, the state information of described network comprises qos parameter, power consumption parameter, CPU usage and storage utilization rate, and described qos parameter comprises bandwidth, delay, delay jitter and error rate.

In this step, when change in topology, an agreement local updating, for preventing all-router from broadcasting LSA message, and regains qos parameter by the information Perception module of Routing Protocol, flow and power consumption.

For example, the first router periodically sends perception message to its all neighboring router, the neighboring router record receiving perception message receives the time of perception message, and send perception response message to described the first router, described perception response message carries network state information, comprise the network state information parameters such as qos parameter, power consumption parameter, CPU usage, storage utilization rate, receive the router of perception response message, calculate corresponding network state information, and be stored in corresponding neighbor information table.

It should be noted that OSPFv3 defines 5 kinds of type of messages, said sensed type of message is defined as 6 by the present invention, and as shown in Figure 5, message field (MFLD) is described as follows described perception message format:

Message delivery time: 4 bytes, records the delivery time of this perception message, and for computing relay, unit is millisecond.

As shown in Figure 6, type of message is defined as 7 to perception response message form, and each explanation of field of message is as follows:

Message delivery time: 4 bytes, the sending node of corresponding perception message sends the moment of perception message, and unit is millisecond, for computing relay.

Message time of reception: 4 bytes, the receiving router of corresponding perception response message receives the moment of perception response message, for computing relay.

Available bandwidth: 2 bytes, this perception response message sends the available bandwidth of router corresponding ports, unit is Kbps, coded system is: the field of 16 is divided into exponential part and mantissa part, exponential part is made to account for a position, then mantissa part accounts for (16-a) position, and make radix be b, then the maximum available bandwidth value that can represent is (2 ^16-a-1) × b ^akbps.

Error rate: 2 bytes, this perception response message sends the error rate of router corresponding ports, and be the decimal between [0,1], coded system is: actual error rate is multiplied by 10000, rounds; During reading, by the numerical value of reading divided by 10000, as error rate.

CPU usage: 2 bytes, this perception response message sends the CPU usage of router, and decoding method is identical with error rate.

Store utilization rate: 2 bytes, this perception response message sends the storage utilization rate of router, and decoding method is identical with error rate.

Power consumption: 2 bytes, this perception response message sends the node power consumption of router.

402, according to the source router of customer service request, whether inquiry object router is in the routing information table of described source router, if then carry out route according to the routing information in described routing information table, otherwise carry out route according to distributed routing algorithm, upgrade routing table.

In this step, while selection route, each router records is to the routing information of object router.Introduce empirical path information and can improve the efficiency finding path, simultaneously when change in topology, do not need all routes to recalculate shortest path, only need the router changed in empirical path information to recalculate path, other routing informations do not need to recalculate path.

It should be noted that the dynamic change along with the network information, as topologies change, qos parameter change and the change of power consumption parameter, the posterior infromation in routing information table may not available.At this moment router needs to send probe messages to determine the availability of empirical path information to each router in routing information before carrying out Route Selection.Described probe messages type definition is 8 by the present invention, and as shown in Figure 7, message field (MFLD) is described as follows described probe messages form:

Destination node router id: 4 bytes, the router id of destination node.

Destination node Autonomous Domain ID:4 byte, the Autonomous Domain ID of destination node.

The each node identification of empirical path information: elongated, each node identification in record empirical path information, by < router id, the two tuple compositions that Autonomous Domain ID> represents.

Receive the router of probe messages, will search in its routing information table and meet QoS demand, and the routing information that energy consumption is minimum, then send probe messages along the router in routing information to object router.If probe messages can arrive object router, then to source router transmit path Information Availability message.Otherwise, delete this routing information, to the unavailable message of source router transmit path information.If source router receives routing information can use message, carry out Route Selection according to routing information.If source router receives the unavailable message of routing information, then re-start Route Selection.Unavailable for described routing information type of message is defined as 9 by the present invention, and described routing information as shown in Figure 8, can be defined as 10 with type of message by the unavailable message format of described routing information, described routing information can with message format as shown in Figure 9.

Particularly, receiving the source router of customer service request, whether the object router of inquiry business request is in the routing information table of source router.If object router is in routing information table, carry out Route Selection according to the routing information in routing information table.Otherwise, use Route Selection message to carry out Route Selection.Router, according to service request desired parameters, calculates qos parameter information and total power consumption, by searching neighbor information table, selects neighboring router according to distributed routing algorithm, and sends Route Selection message to neighboring router.When Route Selection message arrives neighboring router, record neighboring router mark, is used as the reference of empirical path information.The neighboring router receiving Route Selection message continues to send Route Selection message to its neighboring router according to distributed routing algorithm again.If Route Selection message can arrive object router, then the network information in object router records Route Selection message, node identification as each in path, qos parameter and power consumption parameter etc.If Route Selection message can not arrive object router, or when " jumping figure restricted T TL " field value is 0, then abandon this message.

Described Route Selection type of message is defined as 11, and as shown in Figure 10, message field (MFLD) is described as follows described Route Selection message format,

Ask ID:2 byte, the ID of network service request.

Type of service: 1 byte, the COS that business is concrete, is used for determining that qos parameter is interval.

The grade of service: 1 byte, the grade that service divides, is used for determining that qos parameter is interval.

TTL:1 byte, jumping figure limits.

Clean culture/multicast: 1 byte, represents clean culture when being 0, represents one-to-many multicast when being 1, represents multi-to-multi multicast when being 2.When being 0, this message " each node identification in path " field store be a queue be made up of Router Distinguisher each network from source router to object router; When being 1, this message " each node identification in path " field store be one be root with source router, multicast member is the multicast source tree of leaf node; When being 2, this message " each node identification in path " field store be one be root node with aggregation node, multicast member is the shared multicast tree of leaf node.

Node total number: 1 byte, the quantity of router in record path.

Total power consumption: 1 byte, the total power consumption of record router.

Available bandwidth, delay, delay jitter and error rate: the qos parameter of corresponding router.

The each node identification in path: elongated, the mark of each router in the feasible path of detection, by < router id, two element group representations that Autonomous Domain ID> forms.

After object router receives Route Selection message, the path parameter information recorded is recorded in routing information table, empirically routing information in Route Selection message.Simultaneously along this path to source router transmit path infomational message, this path is each router on the way, after receiving routing information message, according to the path parameter information in routing information message, and typing routing information table.When routing information empirically routing information typing routing information table time, the timer counting starts in routing information table, when the value of timer is 0, deletes this routing information.

Described routing information type of message is defined as 12, and described routing information message format as shown in figure 11.

403, complete data communication and the router being in idle condition sends sleep request message to neighboring router, after receiving the dormancy response message that neighboring router sends, enter resting state.

In this step, the main router dormancy problem considered in OSPFv3 agreement, router can enter resting state at one's leisure with energy-conservation.During router dormancy, need to send sleep request message to its neighboring router, and the dormancy response message that wait-receiving mode neighboring router sends, just can enter resting state after receiving dormancy response message.Wake dormancy node up and have two kinds of modes, one arranges router doze output, and when timer is 0, router is initiatively waken up, and another kind is when other routers need this dormancy router communication, sends hibernation awaking message and wake dormancy router up.

Particularly, before router enters dormancy, after waiting for a period of time, after complete for all communication process, determine that data need then to enter resting state during process never again, and inform this router dormancy to other neighboring routers transmission sleep request.Neighboring router receives this router mark position 0 in neighbor information table after sleep request message, and by the empirical path information deletion containing dormancy router, calculate the dormancy router time do not re-used, dormancy response message is sent to dormancy router, explanation needs the dormancy router stand-by period, receive the router of dormancy response message, according to the maximum wait dormancy time recorded in dormancy response message, carry out dormancy.

Above-mentioned sleep request type of message is defined as 13 by the present invention, and described sleep request message format as shown in figure 12.

Above-mentioned dormancy response message type definition is 14 by the present invention, and as shown in figure 13, message field (MFLD) is described as follows described dormancy response message form:

Wait for dormancy time: 4 bytes, wait for the time entering resting state.

Router wakes up: router wakes up and is divided into two kinds of modes, and one is that dormancy router arranges dormancy time, determines according to the size of dormancy time the time that dormancy router is initiatively waken up; Another kind be neighboring router when selecting paths, if not by dormancy router, will the QoS demand meeting service request be can not find or the power dissipation overhead paid is too large, at this moment need the work of dormancy router.When neighboring router needs dormancy router to rework, need to send hibernation awaking message to dormancy router.

Described hibernation awaking message type definition is 15, and described hibernation awaking message form as shown in figure 14.

Dormancy router need send to its all neighboring router notice message of reviving, notify that this dormancy router can normally work after initiatively reviving or being waken up.After neighboring router receives notice message of reviving, by the mark position 1 of dormancy router in neighbor information table, represent that dormancy router can normally work.

Described revive notice type of message be defined as 16, described in revive notice message format as shown in figure 15.

404, regulate the perception cycle of perception message, determine the update time of routing information.

In this step, regulate the perception cycle of perception message according to the rate of change of QoS satisfaction of network state information and the rate of change of power consumption parameter.

Particularly, along with the dynamic change of the network information, as the change of qos parameter information, the information recorded in neighbor information table may be out-of-date, needs to resend perception message and obtain network state information.The cycle sending perception message is determined by the rate of change of the QoS satisfaction of network state information and the rate of change of power consumption parameter.

The rate of change rate of the QoS satisfaction of described network state information _satis( _qoS), calculated by following formula,

${\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{QoS}\right)}=\left\{\begin{array}{c}0,\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}=\mathrm{Satis}\left(\mathrm{QoS}\right)=0\\ \mathrm{Satis}\left(\mathrm{QoS}\right),\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}=0,\mathrm{Satis}\left(\mathrm{QoS}\right)\&NotEqual;0\\ \mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}},\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}\&NotEqual;0,\mathrm{Satis}\left(\mathrm{QoS}\right)=0\\ \left|\frac{\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}-\mathrm{Satis}\left(\mathrm{QoS}\right)}{\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}}\right|,\mathrm{Satis}\left(\mathrm{QoS}\right)\&NotEqual;0,\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}\&NotEqual;0\end{array}\right.$

Wherein, Satis (QoS) ^lastfor the QoS satisfaction that the last time obtains, the QoS satisfaction that Satis (QoS) is current acquisition;

The rate of change rate of described power consumption parameter _power, calculated by following formula,

${\mathrm{rate}}_{\mathrm{power}}=\left|\frac{{\mathrm{power}-\mathrm{power}}^{\mathrm{last}}}{{\mathrm{power}}^{\mathrm{last}}}\right|$

Wherein, power ^lastfor the power consumption parameter value that the last time obtains, power is the power consumption parameter value of current acquisition.

Described QoS satisfaction Satis (QoS), is calculated by following formula,

Satis(QoS)＝a _bw×Satis(bw)+a _dl×Satis(dl)+a _jt×Satis(jt)+a _er×Satis(er)

Wherein, a _bw, a _dl, a _jt, a _erbe respectively bandwidth, delay, delay jitter, error rate to the significance level of user, for different types of service and the grade of service, they get different values, and meet 0 < a _bw< 1,0 < a _dl< 1,0 < a _jt< 1,0 < a _er< 1, a _bw+ a _dl+ a _jt+ a _er=1; Satis (bw), for user is to the bandwidth satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{dw}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{bw}<{\mathrm{bw}}_l\\ \mathrm{\&epsiv;}& \mathrm{bw}={\mathrm{bw}}_l\\ {\left(\frac{\mathrm{bw}-{\mathrm{bw}}_l}{{\mathrm{bw}}_h-{\mathrm{bw}}_l}\right)}^{\mathrm{\&alpha;}}& {\mathrm{bw}}_l<\mathrm{bw}<\frac{1}{2}({\mathrm{bw}}_l+{\mathrm{bw}}_h)\\ {\left(\frac{\mathrm{bw}-{\mathrm{bw}}_l}{{\mathrm{bw}}_h-{\mathrm{bw}}_l}\right)}^{\mathrm{\&beta;}}& \frac{1}{2}({\mathrm{bw}}_l+{\mathrm{bw}}_h)\&le;\mathrm{bw}<{\mathrm{bw}}_h\\ \mathrm{\&xi;}& \mathrm{bw}={\mathrm{bw}}_h\\ 1& \mathrm{bw}>{\mathrm{bw}}_h\end{array}\right.$

Wherein, bw _lfor bandwidth interval limit, bw _hfor the interval upper limit of bandwidth, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (dl), for user is to the delay satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{dl}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{dl}>{\mathrm{dl}}_h\\ \mathrm{\&epsiv;}& \mathrm{dl}={\mathrm{dl}}_h\\ {\left(\frac{d{l}_h-\mathrm{dl}}{{\mathrm{dl}}_h-{\mathrm{dl}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{dl}}_l+{\mathrm{dl}}_h)\&le;\mathrm{dl}<{\mathrm{dl}}_h\\ {\left(\frac{d{l}_h-\mathrm{dl}}{{\mathrm{dl}}_h-{\mathrm{dl}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{dl}}_l<\mathrm{dl}<\frac{1}{2}({\mathrm{dl}}_l+{\mathrm{dl}}_h)\\ \mathrm{\&xi;}& \mathrm{dl}={\mathrm{dl}}_l\\ 1& \mathrm{dl}<{\mathrm{dl}}_l\end{array}\right.$

Wherein, dl _lfor postponing interval limit, dl _hfor the upper limit between delay zone, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (jt), for user is to the delay jitter satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{jt}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{jt}>{\mathrm{jt}}_h\\ \mathrm{\&epsiv;}& \mathrm{jt}={\mathrm{jt}}_h\\ {\left(\frac{{\mathrm{jt}}_h-\mathrm{jt}}{{\mathrm{jt}}_h-{\mathrm{jt}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{jt}}_l+{\mathrm{jt}}_h)\&le;\mathrm{jt}<{\mathrm{jt}}_h\\ {\left(\frac{{\mathrm{jt}}_h-\mathrm{jt}}{{\mathrm{jt}}_h-{\mathrm{jt}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{jt}}_l<\mathrm{jt}<\frac{1}{2}({\mathrm{jt}}_l+{\mathrm{jt}}_h)\\ \mathrm{\&xi;}& \mathrm{jt}={\mathrm{jt}}_l\\ 1& \mathrm{jt}<{\mathrm{jt}}_l\end{array}\right.$

Wherein, jt _lfor delay jitter interval limit, jt _hfor the interval upper limit of delay jitter, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (er), for user is to the error rate satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{er}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{er}>{\mathrm{er}}_h\\ \mathrm{\&epsiv;}& \mathrm{er}={\mathrm{er}}_h\\ {\left(\frac{{\mathrm{er}}_h-\mathrm{er}}{{\mathrm{er}}_h-{\mathrm{er}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{er}}_l+{\mathrm{er}}_h)\&le;\mathrm{er}<{\mathrm{er}}_h\\ {\left(\frac{{\mathrm{er}}_h-\mathrm{er}}{{\mathrm{er}}_h-{\mathrm{er}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{er}}_l<\mathrm{er}<\frac{1}{2}({\mathrm{er}}_l+{\mathrm{er}}_h)\\ \mathrm{\&xi;}& \mathrm{er}={\mathrm{er}}_l\\ 1& \mathrm{er}<{\mathrm{er}}_l\end{array}\right.$

Wherein, er _lfor error rate interval limit, er _hfor the interval upper limit of error rate, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1.

The rate of change rate of described power consumption parameter _power, calculated by following formula,

${\mathrm{rate}}_{\mathrm{power}}=\left|\frac{{\mathrm{power}-\mathrm{power}}^{\mathrm{last}}}{{\mathrm{power}}^{\mathrm{last}}}\right|$

Wherein, power ^lastfor the power consumption parameter value that the last time obtains, power is the power consumption parameter value of current acquisition;

Described power consumption parameter value power, is calculated by following formula,

$\mathrm{power}=\underset{i=1}{\overset{\left|V\right|}{\mathrm{\&Sigma;}}}{P}_{\mathrm{node}}^i\&times;\mathrm{NodeS}{t}_i+\underset{j=1}{\overset{\left|E\right|}{\mathrm{\&Sigma;}}}{P}_{\mathrm{link}}^j\&times;{\mathrm{LinkSt}}_j$

Wherein, NodeSt _ifor the status identifier of node i, LinkSt _jfor the status identifier of link j, wherein, described status identifier is 0 expression idle condition, is 1 expression operating state, for the power consumption of node i, this power consumption is made up of with port cost (relevant to actual flow) master engine power consumption, underframe power consumption, line card power consumption, for the power consumption of link j, | V| is the node total number in path, | E| is the link sum in path, calculated by following formula,

$P_{\mathrm{node}}^i=P_{\mathrm{ctrl}}^i+P_{\mathrm{repl}}^i+\underset{k=1}{\overset{N_{\mathrm{chass}}^i}{\mathrm{\&Sigma;}}}(P_{\mathrm{chass}}^i\&times;{\mathrm{ChaSt}}_i^k+\underset{\mathrm{lc}=1}{\overset{N_{\mathrm{lcrd}}^k}{\mathrm{\&Sigma;}}}(P_{\mathrm{ford}}^i+P_{\mathrm{repl}}^i)\&times;{\mathrm{LkdSt}}_k^{\mathrm{lc}}+\underset{p=l}{\overset{N_{\mathrm{port}}^{\mathrm{lc}}}{\mathrm{\&Sigma;}}}{p}_{\mathrm{port}}^i(1+\mathrm{\&alpha;}\&times;{\mathrm{trf}}_p^{\mathrm{\&beta;}})\&times;{\mathrm{PortSt}}_{\mathrm{lc}}^p)$

Wherein, for the master engine power consumption of node i, for the forwarding engine power consumption of node i, for the replication engine power consumption of node i, for the power consumption of a node i underframe, for the power consumption of a node i port, for the quantity of underframe in node i, for the quantity of the line card of underframe k in node i, for the quantity of the line card lc upper port of underframe k in node i, for the status identifier of underframe k in node i, for the status identifier of line card lc in node i, the status identifier of line card lc upper port p in node i, described status identifier is 0 expression resting state, is 1 expression operating state, trf _pfor the flow by line card lc upper port p in node i, α and β is constant, is used for representing the relation of flow and power consumption;

the power consumption of link, this power consumption is made up of Optical Preamplifier power consumption, Repeater optical amplifiers power consumption, optical regenerator power consumption and rearmounted power consumption of light amplifier, described Optical Preamplifier is used for the transmitting power of raising business, described Repeater optical amplifiers is used for extending transmission distance, described optical regenerator is used for repairing signal, described post amplifier is used for the power of switching signal calculated by following formula,

$P_{\mathrm{link}}^j=(1+{\mathrm{\&alpha;}}^{\&prime;}\&times;\mathrm{tr}{f}_j^{{\mathrm{\&beta;}}^{\&prime;}})\&times;(P_{\mathrm{fort}}+\underset{a=1}{\overset{N_{\mathrm{reptr}}^j}{\mathrm{\&Sigma;}}}(P_{\mathrm{reptr}}\&times;\mathrm{RptrS}{t}_j^a)+P_{\mathrm{rear}}+\underset{b=1}{\overset{N_{\mathrm{regenr}}^j}{\mathrm{\&Sigma;}}}(P_{\mathrm{regen}}\&times;{\mathrm{RgentrSt}}_j^b))$

Wherein, P _fortfor Optical Preamplifier power consumption, P _reptrfor Repeater optical amplifiers power consumption, P _regenfor reproduced light device power consumption, P _rearfor reproduced light amplifier power consumption, for the number of relay amplifier on link j, for the number of optical regenerator on link j, for the state of relay amplifier a on link j, for the status identifier of relay amplifier b on link j, described status identifier is 0 expression idle condition, is 1 expression operating state, trf _jfor the flow on link j, α ' and β ' are constant, are used for representing the relation of flow and power consumption.

Described perception cycle T _per, calculated by following formula,

$T_{\mathrm{per}}=\left\{\begin{array}{c}\frac{T}{{\mathrm{rate}}_{\mathrm{power}}},{\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{GoS}\right)}=0\\ \frac{T}{{\mathrm{rate}}_{\mathrm{power}}\&times;{\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{GoS}\right)}},\mathrm{rat}{e}_{\mathrm{Satis}\left(\mathrm{GoS}\right)\&NotEqual;0}\end{array}\right.$

Wherein, T is a set time value when network state information does not change.

Therefore, the rate of change of the QoS satisfaction of network state information rate of change that is larger, power consumption parameter is larger, and the perception cycle of needs is less; Otherwise the perception cycle of needs is larger, therefore, the rate of change of the QoS satisfaction of perception cycle and network state information, the rate of change of power consumption parameter are inversely.

By arranging timer or dynamically change update time of routing information according to network state information rate of change in routing information table.

Particularly, along with the change of the network information, some routing informations may no longer can be used, and at this moment need to be upgraded.The availability of empirical path information is relevant with the intensity of variation of time and network state information.Therefore, update mode mainly contains two kinds, and first kind of way is, in routing information table, arrange timer, when the value of timer is 0, deletes old routing information, and starts routing information update mechanism.The second way is for dynamically to change update time according to network state information rate of change, and as when network state information rate of change is 0, routing information does not need to upgrade; When network state information rate of change is not 0, by the relation of perception cycle and network state information rate of change, record update time.

The energy-saving QoS method for routing of the Internet of the present embodiment has following beneficial effect: the deficiency that 1, can make up traditional routing method, provides support, extend the range of application of Routing Protocol to more existing network energy-saving method for routing; 2, QoS satisfaction and the network energy consumption two aspect factor of user is considered, network energy-saving is taken into full account under the prerequisite ensureing user's QoS demand, network energy consumption is reduced to greatest extent in the acceptable scope of network performance, effectively reduce the waste of resource, decrease the discharge of carbon dioxide, facilitate environmental protection; 3, adopt cooperation sleep management pattern, completed by the neighboring router joint consultation in dormancy router and its neighbor information table, avoid topological frequent variations and cause network element constantly to be changed between dormancy and work and waste energy and the forwarding time increasing message.

Last it is noted that above each embodiment is only in order to illustrate technical scheme of the present invention, be not intended to limit; Although with reference to foregoing embodiments to invention has been detailed description, those of ordinary skill in the art is to be understood that: it still can be modified to the technical scheme described in foregoing embodiments, or carries out equivalent replacement to wherein some or all of technical characteristic; And these amendments or replacement, do not make the essence of appropriate technical solution depart from the scope of the claims in the present invention.

Claims (9)

1. an energy-saving QoS method for routing for Internet, is characterized in that, comprising:

Obtain the state information of network, the state information of described network comprises qos parameter, power consumption parameter, CPU usage and storage utilization rate, and described qos parameter comprises bandwidth, delay, delay jitter and error rate;

According to the source router of customer service request, whether inquiry object router is in the routing information table of described source router, if then carry out route according to the routing information in described routing information table, otherwise carry out route according to distributed routing algorithm, upgrade routing table;

Complete data communication and the router being in idle condition sends sleep request message to neighboring router, after receiving the dormancy response message that neighboring router sends, enter resting state;

Regulate the perception cycle of perception message, determine the update time of routing information.

2. the energy-saving QoS method for routing of Internet according to claim 1, is characterized in that, the state information of described acquisition network, comprising:

Router periodically sends perception message to neighboring router, and described perception message carries network state information;

Described neighboring router receives network state information described in perception message accounting, is stored in neighbor information table.

3. the energy-saving QoS method for routing of Internet according to claim 1, is characterized in that, the described source router according to customer service request, and whether inquiry object router, in the routing information table of described source router, comprising:

Source router sends probe messages to each router in described routing information table;

The each query router receiving described probe messages meets the minimum routing information of QoS demand, energy consumption, and sends described probe messages to the router on described routing information;

Inquire about described object router whether in the routing information table of described source router.

4. the energy-saving QoS method for routing of Internet according to claim 1, it is characterized in that, when the router being in described resting state be required rework time, neighboring router sends to the router being in described resting state and wakes message up, or the router being in described resting state arranges dormancy time and automatically wakes up.

5. the energy-saving QoS method for routing of Internet according to claim 1, is characterized in that, in the perception cycle of described adjustment perception message, determines the update time of routing information, is specially,

The perception cycle of perception message is regulated according to the rate of change of QoS satisfaction of network state information and the rate of change of power consumption parameter;

By arranging timer or dynamically change update time of routing information according to network state information rate of change in routing information table.

6. the energy-saving QoS method for routing of Internet according to claim 5, the rate of change rate of the QoS satisfaction of described network state information _{satis (QoS)}, calculated by following formula,

${\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{QoS}\right)}=\left\{\begin{array}{c}0,\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}=\mathrm{Satis}\left(\mathrm{QoS}\right)=0\\ \mathrm{Satis}\left(\mathrm{QoS}\right),\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}=0,\mathrm{Satis}\left(\mathrm{QoS}\right)\&NotEqual;0\\ \mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}},\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}\&NotEqual;0,\mathrm{Satis}\left(\mathrm{QoS}\right)=0\\ \left|\frac{\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}-\mathrm{Satis}\left(\mathrm{QoS}\right)}{\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}}\right|,\mathrm{Satis}\left(\mathrm{Qos}\right)\&NotEqual;0,\mathrm{Satis}{\left(\mathrm{QoS}\right)}^{\mathrm{last}}\&NotEqual;0\end{array}\right.$

Wherein, Satis (QoS) ^lastfor the QoS satisfaction that the last time obtains, the QoS satisfaction that Satis (QoS) is current acquisition;

Described QoS satisfaction Satis (QoS), is calculated by following formula,

Satis(QoS)＝a _bw×Satis(bw)+a _dl×Satis(dl)+a _jt×Satis(jt)+a _er×Satis(er)

Wherein, a _bw, a _dl, a _jt, a _erbe respectively bandwidth, delay, delay jitter, error rate to the significance level of user, for different types of service and the grade of service, they get different values, and meet 0 < a _bw< 1,0 < a _dl< 1,0 < a _jt< 1,0 < a _er< 1, a _bw+ a _dl+ a _jt+ a _er=1;

Satis (bw), for user is to the bandwidth satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{bw}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{bw}<{\mathrm{bw}}_l\\ \mathrm{\&epsiv;}& \mathrm{bw}={\mathrm{bw}}_l\\ {\left(\frac{\mathrm{bw}-{\mathrm{bw}}_l}{{\mathrm{bw}}_h-{\mathrm{bw}}_l}\right)}^{\mathrm{\&alpha;}}& {\mathrm{bw}}_l<\mathrm{bw}<\frac{1}{2}({\mathrm{bw}}_l+{\mathrm{bw}}_h)\\ {\left(\frac{\mathrm{bw}-{\mathrm{bw}}_l}{{\mathrm{bw}}_h-{\mathrm{bw}}_l}\right)}^{\mathrm{\&beta;}}& \frac{1}{2}({\mathrm{bw}}_l+{\mathrm{bw}}_h)\&le;\mathrm{bw}<{\mathrm{bw}}_h\\ \mathrm{\&xi;}& \mathrm{bw}={\mathrm{bw}}_h\\ 1& \mathrm{bw}>{\mathrm{bw}}_h\end{array}\right.$

Wherein, bw _lfor bandwidth interval limit, bw _hfor the interval upper limit of bandwidth, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (dl), for user is to the delay satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{dl}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{dl}>{\mathrm{dl}}_h\\ \mathrm{\&epsiv;}& \mathrm{dl}={\mathrm{dl}}_h\\ {\left(\frac{{\mathrm{dl}}_h-\mathrm{dl}}{{\mathrm{dl}}_h-{\mathrm{dl}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{dl}}_l+{\mathrm{dl}}_h)\&le;\mathrm{dl}<{\mathrm{dl}}_h\\ {\left(\frac{{\mathrm{dl}}_h-\mathrm{dl}}{{\mathrm{dl}}_h-{\mathrm{dl}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{dl}}_l<\mathrm{dl}<\frac{1}{2}({\mathrm{dl}}_l+{\mathrm{dl}}_h)\\ \mathrm{\&xi;}& \mathrm{dl}={\mathrm{dl}}_l\\ 1& \mathrm{dl}<{\mathrm{dl}}_l\end{array}\right.$

Wherein, dl _lfor postponing interval limit, dl _hfor the upper limit between delay zone, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (jt), for user is to the delay jitter satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{jt}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{jt}>{\mathrm{jt}}_h\\ \mathrm{\&epsiv;}& \mathrm{jt}={\mathrm{jt}}_h\\ {\left(\frac{{\mathrm{jt}}_h-\mathrm{jt}}{{\mathrm{jt}}_h-{\mathrm{jt}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{jt}}_l+{\mathrm{jt}}_h)\&le;\mathrm{jt}<{\mathrm{jt}}_h\\ {\left(\frac{{\mathrm{jt}}_h-\mathrm{jt}}{{\mathrm{jt}}_h-{\mathrm{jt}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{jt}}_l<\mathrm{jt}<\frac{1}{2}({\mathrm{jt}}_l+{\mathrm{jt}}_h)\\ \mathrm{\&xi;}& \mathrm{jt}={\mathrm{jt}}_l\\ 1& \mathrm{jt}>{\mathrm{jt}}_l\end{array}\right.$

Wherein, jt _lfor delay jitter interval limit, jt _hfor the interval upper limit of delay jitter, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1;

Satis (er), for user is to the error rate satisfaction in path, is calculated by following formula,

$\mathrm{Satis}\left(\mathrm{er}\right)=\left\{\begin{array}{cc}-\mathrm{\&Omega;}& \mathrm{er}>{\mathrm{er}}_h\\ \mathrm{\&epsiv;}& \mathrm{er}={\mathrm{er}}_h\\ {\left(\frac{{\mathrm{er}}_h-\mathrm{er}}{{\mathrm{er}}_h-{\mathrm{er}}_l}\right)}^{\mathrm{\&alpha;}}& \frac{1}{2}({\mathrm{er}}_l+{\mathrm{er}}_h)\&le;\mathrm{er}<{\mathrm{er}}_h\\ {\left(\frac{{\mathrm{er}}_h-\mathrm{er}}{{\mathrm{er}}_h-{\mathrm{er}}_l}\right)}^{\mathrm{\&beta;}}& {\mathrm{er}}_l<\mathrm{er}<\frac{1}{2}({\mathrm{er}}_l+{\mathrm{er}}_h)\\ \mathrm{\&xi;}& \mathrm{er}={\mathrm{er}}_l\\ 1& \mathrm{er}<{\mathrm{er}}_l\end{array}\right.$

Wherein, er _lfor error rate interval limit, er _hfor the interval upper limit of error rate, Ω is positive number, ε be level off to 0 positive number, ξ be level off to 1 positive number, α > 1,0 < β < 1.

7. the energy-saving QoS method for routing of Internet according to claim 5, is characterized in that, the rate of change rate of described power consumption parameter _power, calculated by following formula,

${\mathrm{rate}}_{\mathrm{power}}=\left|\frac{\mathrm{power}-{\mathrm{power}}^{\mathrm{last}}}{{\mathrm{power}}^{\mathrm{last}}}\right|$

Wherein, power ^lastfor the power consumption parameter value that the last time obtains, power is the power consumption parameter value of current acquisition;

Described power consumption parameter value power, is calculated by following formula,

$\mathrm{power}=\underset{i=1}{\overset{\left|V\right|}{\mathrm{\&Sigma;}}}{P}_{\mathrm{node}}^i\&times;{\mathrm{NodeSt}}_i+\underset{j=1}{\overset{\left|E\right|}{\mathrm{\&Sigma;}}}{P}_{\mathrm{link}}^j\&times;{\mathrm{LinkSt}}_j$

Wherein, NodeSt _ifor the status identifier of node i, LinkSt _jfor the status identifier of link j, wherein, described status identifier is 0 expression idle condition, is 1 expression operating state, for the power consumption of node i, for the power consumption of link j, | V| is the node total number in path, | E| is the link sum in path, calculated by following formula,

$P_{\mathrm{node}}^i=P_{\mathrm{ctrl}}^i+P_{\mathrm{repl}}^i+\underset{k=1}{\overset{N_{\mathrm{chass}}^i}{\mathrm{\&Sigma;}}}(P_{\mathrm{chass}}^i\&times;{\mathrm{ChaSt}}_i^k+\underset{\mathrm{lc}=1}{\overset{N_{\mathrm{lcrd}}^k}{\mathrm{\&Sigma;}}}(P_{\mathrm{ford}}^i+P_{\mathrm{repl}}^i)\&times;{\mathrm{LkdSt}}_k^{\mathrm{lc}}+\underset{p=1}{\overset{N_{\mathrm{port}}^{\mathrm{lc}}}{\mathrm{\&Sigma;}}}{p}_{\mathrm{port}}^i(1+\mathrm{\&alpha;}\&times;{\mathrm{trf}}_p^{\mathrm{\&beta;}})\&times;{\mathrm{PprtSt}}_{\mathrm{lc}}^p)$

Wherein, for the master engine power consumption of node i, for the forwarding engine power consumption of node i, for the replication engine power consumption of node i, for the power consumption of a node i underframe, for the power consumption of a node i port, for the quantity of underframe in node i, for the quantity of the line card of underframe k in node i, for the quantity of the line card lc upper port of underframe k in node i, for the status identifier of underframe k in node i, for the status identifier of line card lc in node i, the status identifier of line card lc upper port p in node i, described status identifier is 0 expression resting state, is 1 expression operating state, trf _pfor the flow by line card lc upper port p in node i, α and β is constant, is used for representing the relation of flow and power consumption;

the power consumption of link, is calculated by following formula,

$P_{\mathrm{link}}^j=(1+{\mathrm{\&alpha;}}^{\&prime;}\&times;{\mathrm{trf}}_j^{{\mathrm{\&beta;}}^{\&prime;}})\&times;(P_{\mathrm{fort}}+\underset{a=1}{\overset{N_{\mathrm{reptr}}^j}{\mathrm{\&Sigma;}}}(P_{\mathrm{reptr}}\&times;{\mathrm{RptrSt}}_j^a)+P_{\mathrm{rear}}+\underset{b=1}{\overset{N_{\mathrm{regenr}}^j}{\mathrm{\&Sigma;}}}(P_{\mathrm{regen}}\&times;{\mathrm{RgentrSt}}_j^b))$

Wherein, P _fortfor Optical Preamplifier power consumption, P _reptrfor Repeater optical amplifiers power consumption, P _regenfor reproduced light device power consumption, P _rearfor reproduced light amplifier power consumption, for the number of relay amplifier on link j, for the number of optical regenerator on link j, for the state of relay amplifier a on link j, for the status identifier of relay amplifier b on link j, described status identifier is 0 expression idle condition, is 1 expression operating state, trf _jfor the flow on link j, α ' and β ' are constant, are used for representing the relation of flow and power consumption.

8. the energy-saving QoS method for routing of Internet according to claim 5, is characterized in that, described perception cycle T _per, calculated by following formula,

$T_{\mathrm{per}}=\left\{\begin{array}{c}\frac{T}{{\mathrm{rate}}_{\mathrm{power}}},{\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{QoS}\right)}=0\\ \frac{T}{{\mathrm{rate}}_{\mathrm{power}}\&times;{\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{QoS}\right)}},{\mathrm{rate}}_{\mathrm{Satis}\left(\mathrm{QoS}\right)\&NotEqual;0}\end{array}\right.$

Wherein, T is a set time value when network state information does not change.

9. the energy-saving QoS method for routing of Internet according to claim 5, it is characterized in that, described by arranging timer in routing information table, be specially: when the value of timer is 0, delete old routing information, start routing information update mechanism;

The described update time dynamically changing routing information according to network state information rate of change, be specially: when network state information rate of change is 0, routing information does not upgrade, when network state information rate of change is not 0, by the relation of perception cycle and network state information rate of change, record update time.