CN104092606A - Energy-saving routing method based on service duration time scheduling in optical network - Google Patents
Energy-saving routing method based on service duration time scheduling in optical network Download PDFInfo
- Publication number
- CN104092606A CN104092606A CN201410288798.4A CN201410288798A CN104092606A CN 104092606 A CN104092606 A CN 104092606A CN 201410288798 A CN201410288798 A CN 201410288798A CN 104092606 A CN104092606 A CN 104092606A
- Authority
- CN
- China
- Prior art keywords
- business
- transmission
- time slot
- bandwidth
- path
- 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
Abstract
The invention discloses an energy-saving routing method based on service duration time scheduling in an optical network. The method comprises the following steps that a grooming auxiliary chart is established according to the current idle available resources of the network; scheduling time slots are divided; transmission routes and transmission slots are selected for services to be transmitted, and network bandwidth resources are distributed for the services to be transmitted; service transmission bandwidths are adjusted. According to the energy-saving routing method, the time slots are divided, the number of times for the fact that the network routes can be used as service alternative transmission routes is calculated in different time slots to be used as the scheduling weight of the routes, the route with the maximum scheduling weight is chosen to be used as the transmission route for the service to be transmitted, a minimum energy-consuming light bypass is established for the services, and under the premise that the successful service transmission is guaranteed, the service transmission bandwidths are adjusted to reduce the transmission energy consumption and the blocking rate of the network are reduced.
Description
Technical field
The invention belongs to technical field of optical fiber communication, relate to the energy-saving routing method based on the scheduling of business duration in a kind of optical-fiber network.
Background technology
In the face of the pressure of a resource shrinkage and Global climate change, energy-saving and emission-reduction become global focus.ICT (information and communication technology) (ICT) industry is global the fifth-largest power consumption industry, the coming years ICT energy consumption will increase progressively with annual 5% amplitude.Advocate communication services efficient, energy-saving and environmental protection, promote the sustainable development of ICT industry very urgent.
In order to reduce the transmission energy consumption of network, researcher has proposed light bypass and traffic grooming technical method based on IP over WDM network.The thought of light bypass is that the business that is converted into light signal is all transmitted in light territory, the electricity layer router of all intermediate nodes of bypass, thus reduce the use of electricity layer router to reach energy-conservation effect.Traffic grooming is at a network, and multiple low speed business are carried out to multiplexing transmission by setting up a light path, improves the bandwidth availability ratio of light path.
The port that router can be effectively saved in light bypass takies quantity, but can cause the bandwidth availability ratio of wavelength channel to reduce, and causes the increase of network congestion; Traffic grooming has solved the bandwidth fragmentation problem of light bypass, but because traffic grooming need to utilize the electricity layer router of intermediate node, takies number and Internet Transmission energy consumption so will certainly increase the network port.Along with the rise of ecommerce, cloud computing, how by communication network, the server of One's name is legion and storage center to be carried out interconnected, in realizing the storage of magnanimity information data and efficient processing, varigrained user bandwidth demand and time slot allocation are carried out to flexible dispatching, become data center and realize the main challenge of optical interconnection.Compared with distributing immediately (Immediate Reservation) business, the business demand of RSVP type business can be preengage before business starts, be that business time of advent is prior to the business time started, and the duration of business is known, service provider can be the reserved enough resources of business in advance.How rationally to utilize light bypass and traffic grooming technology ensureing that network blocking probability is enough under low prerequisite, the business duration based on RSVP type business is carried out flexible dispatching to service bandwidth and time slot allocation, is very important thereby reduce Internet Transmission energy consumption.
Summary of the invention
For above deficiency of the prior art, the object of the present invention is to provide a kind of blocking rate of network, energy-saving routing method of reduction Internet Transmission energy consumption of reducing, technical scheme of the present invention is as follows: 1, the energy-saving routing method based on the scheduling of business duration in a kind of optical-fiber network, and it comprises the following steps:
101, set up one according to the current idle available resources of optical-fiber network and dredge auxiliary view, the described auxiliary view of dredging comprises independently wavelength hierarchical diagram of bottom-layer network physical topology figure and W layer, in described bottom-layer network physical topology figure, include the path of several business to be transmitted, described dredge auxiliary view and set up after, scheduler in optical-fiber network arranges the fixing time slot T of unit, and according to the transmission t zero hour of business to be transmitted
sand the finish time t
e, according to calculating formula m=(t
e– t
s)/T calculates each business to be transmitted and transmits the required timeslot number m of unit, and time slot is carried out to serial number 1,2,3 ... v, described v is positive integer;
102, adopting shortest path first is the alternate transmission paths that service computation to be transmitted in the figure of bottom-layer network physical topology described in step 101 goes out K bar link disjoint, described every alternate transmission paths has scheduling weights S, and is sequentially arranged as from small to large chained list Q according to the beginning time-gap number v of business to be transmitted;
103, judge whether chained list Q is empty, if so, jumps to step 108, otherwise, go to step 104;
104, the scheduler of optical-fiber network takes out business I to be transmitted successively from chained list Q, and the alternate transmission paths of the scheduler selection scheduling weights S maximum of optical-fiber network is as the transmission path of business I to be transmitted, and time slot t corresponding to scheduling weights S is business transmission time slot;
105, alternate transmission paths and the identical built light path of time slot of dredging W layer in auxiliary view and independently successively search in wavelength hierarchical diagram the scheduling weights S maximum whether existing and selected in step 104 in step 101, set up, if there is no such light path or light path are without available bandwidth, in the enough wavelength hierarchical diagram of bandwidth, the transmission time slot of a newly-built light path this light path of mark is business transmission time slot, if this light path exists and available bandwidth resources is enough, the transmission time slot of this this light path is called the sufficient transmission time slot of bandwidth; If light path exists but available bandwidth resources deficiency, record the available bandwidth resources information of this light path, and this time slot is the not enough time slot of service bandwidth;
Whether the traffic carrying capacity that 106, in calculation procedure 105, the sufficient time slot of bandwidth and the not enough time slot of bandwidth can transmit is not less than traffic carrying capacity to be transmitted, if, the scheduler of optical-fiber network is that business has found enough transmission time slots and transmission path, go to step 107, otherwise jump procedure 104 continues service selection transmission time slot and path for this reason;
107, in step of updating 101, dredge auxiliary view: in the service transmission path respective optical path in each transmission time slot t, deduct the transmission bandwidth that the scheduler of optical-fiber network distributes for business, and from chained list Q, leave out this business to be transmitted;
108, in the time that chained list Q is sky, what the scheduler of optical-fiber network was set up in step 101 dredge searches the light path of only transmitting a business to be transmitted in auxiliary view, and determine and start the transmission time slot numbering v of this light path institute business II to be transmitted time-gap number according to transmission and be sequentially arranged as from small to large chained list L;
109, judge whether chained list L is empty, and if so, algorithm finishes, otherwise, go to step 110;
110, the scheduler of optical-fiber network takes out the business II of storage successively from chained list L, and the sufficient time slot of the bandwidth of definite business II, whether the sufficient time slot light path of computation bandwidth available bandwidth summation is not less than the transmission bandwidth of business II, if, increase the transmission bandwidth of this time slot, remove the light path of a business of this transmission, and the transmission bandwidth increasing above deducting in the sufficient time slot respective optical path of the bandwidth of dredging auxiliary view, in chained list L, delete this business II, go to step 109, otherwise, directly in chained list L, delete this business II, go to step 109.
Further, the step of dredging auxiliary view foundation described in step 101 is: be the auxiliary view of dredging being made up of W wavelength hierarchical diagram and bottom-layer network physical topology figure by network physical Topological Mapping according to number of wavelengths W multiplexing in every optical fiber in optical-fiber network, the whole total W+1 layer of auxiliary view of dredging, bottom is network physical topological diagram, and upper W layer is corresponding to the individual independently wavelength hierarchical diagram of W.
Further, the scheduling weight matrix that the scheduling of several alternate transmission paths described in step 102 weights S forms business to be transmitted is:
S
i, (v+j)represent that i article of alternate transmission paths of business is elected to be the number of times of service transmission path, S by business to be transmitted at time slot (v+j)
i, (v+j)initial value is 0, is alternate transmission paths, so S when there being business to select this path at time slot (v+j)
i, (v+j)value add 1.
Advantage of the present invention and beneficial effect are as follows:
The inventive method is dredged all alternate transmission paths in auxiliary view and may be elected to be by business to be transmitted in different time-gap the number of times of service transmission path by statistics, for the suitable transmission path of service selection, transmission time slot are to set up least energy consumption light path, and the transmission bandwidth of the sufficient time slot of adjustment service bandwidth makes business make full use of the remaining bandwidth of built light path with blocking rate and the transmission energy consumption of reduction network.
Brief description of the drawings
Fig. 1 is the structure that preferred embodiment of the present invention network is dredged auxiliary view;
Fig. 2 flexible time dispatching services sequential schematic diagram;
Fig. 3 business transmission time slot, Path selection flow chart;
Fig. 4 bandwidth is adjusted flow chart;
The general flow chart of the energy-conservation route of Fig. 5 business.
Embodiment
The invention will be further elaborated to provide the embodiment of an indefiniteness below in conjunction with accompanying drawing.
Shown in Fig. 1-5, for existing can not minimized energy consumption and the too high problem of network blocking probability that fixedly causes of transmission bandwidth based on business duration dispatching method, the present invention has designed a kind of energy-saving routing method based on the scheduling of business duration, this method by use shortest path first be service computation multilink separate path as transmission alternative path, and then calculate every alternative path and determined by the number of times of all service selection transmission time slot and the transmission path of business in different time-gap, and reduce Internet Transmission energy consumption and blocking rate by adjusting service transmission bandwidth.
In order to consider the impact of each constraints on business routing simultaneously, dredge auxiliary view at this by structure and carry out route and allocated bandwidth.The advantage of the method is to find shortest path for business and resource is divided timing, has considered various constraints: considered current network wavelength resource service condition, can complete the dredging of new service request, route and Wavelength Assignment simultaneously.Dredging auxiliary view is W+1 layer hierarchical diagram by whole network physical Topological Mapping, wherein multiplexing number of wavelengths in the corresponding optical fiber of W, and the conflict competition that so just can avoid business to cause because wavelength resource distributes, last one deck is network physical topological layer.In network physical topological layer, using shortest path first is that service computation goes out the shortest path that multilink separates, and records node and the physical link of every transmission paths process.
Scheduler is that each business to be transmitted calculates after the alternate transmission paths of K bar link disjoint, and wherein K value removes the limit integer for the average number of degrees of network node, is service selection transmission time slot to be transmitted, transmission path, distribution network bandwidth.
Core of the present invention is that the selection of business transmission time slot, transmission path and the transmission bandwidth of adjusting business according to Internet resources situation are to reduce network energy consumption and blocking rate.
Suppose that service request is R, the wherein transmission time window t zero hour
s, the finish time t
ewith business duration t
hneed meet t
h<t
e– t
s, for ensureing that whole transmitting procedure completes in transmission time window, the business actual transmissions t zero hour meets t
s<=t, and t+t
h<=t
e; By service request transmission bandwidth B, the total amount of data that known business need be transmitted is: D=t
h× B.Network Calculation Method of Energy Consumption based on port, can arrange according to network devices energy consumption, and in our research, each device power consumption value is set to: 1) core router port power P
r=1000w; 2) optical transceiver power P
t=43w; 3) erbium-doped fiber amplifier power P
e=8w.Therefore, known optic path energy consumption is relevant to port number and the duration of its use.If can as much as possible service set be transmitted in some time slot, link under the condition that ensures to meet link bandwidth constraint, so just can minimize by minimizing number, the light path duration for port of business the transmission energy consumption of business.
The selection course of whole business transmission time slot, transmission path is as follows: from current time, the time that the scheduler of network arranges a regular length is a unit time slot, and scheduler is according to the transmission t zero hour of business to be transmitted
s, the finish time t
etimeslot number m=(the t of unit that computing service transmission time window needs
e– t
s)/T, the transmitting continuous timeslot number of business are n=(t
h/ T), start time-gap number v, the scheduling weight matrix of business is:
S
i, (v+j)represent that i article of alternate transmission paths of business is elected to be the number of times of service transmission path, S by business to be transmitted at time slot (v+j)
i, (v+j)initial value is 0, is alternate transmission paths, so S when there being business to select this path at time slot (v+j)
i, (v+j)value add 1.Scheduler starts time-gap number v by all business to be transmitted according to transmission time window and is arranged as from small to large chained list Q, and from chained list Q, takes out successively business to be transmitted and select transmission time slot, transmission path for it.The alternative path of scheduler selection scheduling weights maximum is as the transmission path of business, as scheduling weights S maximum in scheduler selection scheduling weight matrix
i, (v+j)i article of corresponding alternative path, as the transmission path of business, dispatched weights S
i, (v+j)corresponding time slot (v+j) is a transmission time slot of business, business can only be selected a transmission paths in a transmission time slot, thereby other alternate transmission paths in time slot (v+j) all can not be selected as transmission path again, time slot is all set to 0 for the scheduling weights of (v+j), determine transmission path, after time slot, scheduler is dredging in auxiliary view, in each wavelength hierarchical diagram from upper strata to lower floor, successively search and whether exist and the transmission path of selecting, the built light path that time slot is identical, if there is no such light path or light path are without available bandwidth, from the enough wavelength hierarchical diagram of bandwidth, the transmission time slot of a newly-built light path mark light path is selected transmission time slot, if this light path exists and available bandwidth resources is enough, this type of time slot is called the sufficient time slot of bandwidth, if light path exists but available bandwidth resources deficiency, record the available bandwidth resources information of this light path, and this type of time slot is called the not enough time slot of service bandwidth, scheduler can be judged as the transmission time slot of traffic assignments to be transmitted, the transmission requirement whether transmission path meets business afterwards: if the sufficient timeslot number of service bandwidth is designated as symbol a, when meeting, B × (n – is <=∑ B a)
itime, show that scheduler is that transmission time slot, the transmission path of traffic assignments to be transmitted enough allows business in transmission time window, transmit its required transmitted data amount, wherein ∑ B
ifor the light path available bandwidth summation of the not enough time slots of all bandwidth recorded, for ensureing that whole transmitting procedure meets transmission time window constraints, ∑ B
icorresponding time slot sum is that the not enough time slot sum of bandwidth should be not more than m – a, now from chained list Q, delete this business and upgrade and dredge auxiliary view: the service transmission path respective optical path in each transmission time slot deducts the transmission bandwidth that scheduler distributes for business, if do not met, scheduler continues service selection transmission path for this reason.To other business to be transmitted, repeat above-mentioned service transmission path, transmission time slot selection and distribution network bandwidth process, until Q table is for empty.
From above-mentioned selection course, scheduler is determined transmission time slot and the transmission path of business according to business scheduling weights.Determine after the transmission path of business to be traffic assignments transmission bandwidth according to network link available bandwidth dredging in the each wavelength hierarchical diagram of auxiliary view.The preferential available bandwidth of selecting to utilize built light path of business, after built light path is without available bandwidth, select newly-built light path, may occur like this many built light paths that some transmission path is corresponding without available bandwidth but certain newly-built light path is only transmitted the situation of a business.Suppose S
e,h=10, there are 10 service selection S
e,hcorresponding time slot h, path e is as transmission time slot, the path of business.Scheduler is in the time that the wavelength layer of auxiliary view is the 1st traffic assignments transmission bandwidth, dredge in auxiliary view and do not have and e physical transfer path, path, the light path that transmission time slot h is identical, be required to be so the 1st the newly-built transmission paths of the business light path identical with e, the business that is transmission path at time slot h selecting paths e below can be utilized the available bandwidth of this light path, be transmission path and the available bandwidth of built light path is zero until there is business to select selecting paths e at time slot h, scheduler is the newly-built light path identical with above-mentioned optic path path of business in the enough wavelength hierarchical diagram of new bandwidth resources, constantly repeat said process, until scheduler is these 10 business transmission bandwidth that all become the distribution of work.Suppose in the time that scheduler is the 10th traffic assignments transmission bandwidth, newly-built light path is without available bandwidth above, scheduler is will be the 10th the newly-built one article of light path of business, but in this time slot, there is no this path of service selection as transmission path, scheduler is that the 10th light path that business is newly-built just only transmitted a business so again.For avoiding above-mentioned situation, scheduler is to search the light path of only transmitting a business after all traffic assignments transmission bandwidths to be transmitted, and the sufficient time slot of the bandwidth of definite light path institute transport service, can analysis increase the transmission bandwidth of the sufficient time slot of bandwidth of business, if can increase the transmission bandwidth of this type of time slot, remove the light path of a business of this transmission, and in the sufficient time slot respective optical path of the bandwidth of dredging auxiliary view, deduct the transmission bandwidth of increase; Otherwise, search and whether also have the light path of only transmitting a business.The first step of this process is that scheduler is searched the light path of only transmitting a business, determines that the transmission of business that light path passes starts time-gap number, and starts transmission time slot numbering according to business and from small to large these business are arranged in to chained list L.Second step is that scheduler takes out business to be transmitted successively from L, can computational analysis by increasing the transmission bandwidth of the sufficient time slot of service bandwidth, if can, in the light path that the sufficient time slot of bandwidth is corresponding in auxiliary view, deduct the part bandwidth of increase, and from L, leave out this business; If can not, directly from L, leave out this business.Scheduler takes out successively next business and calculates in chained list L, until L is empty.
Below in conjunction with accompanying drawing, the present invention is described in detail.
Accompanying drawing 1 has represented to dredge the structure of auxiliary view, for transmission path, time slot and analysis Internet resources situation that more preferably service selection is suitable, be W wavelength hierarchical diagram according to number of wavelengths W multiplexing in every optical fiber by network physical Topological Mapping, this layered approach can ensure the independence that each wavelength hierarchical diagram resource is distributed.The whole auxiliary view W+1 layer altogether of dredging, bottom is network physical topological layer, represented the connection between node, link, scheduler uses shortest path first to go out the alternate transmission paths of K bar link disjoint for service computation in this layer, and K is that the network average nodal number of degrees remove the limit integer.The corresponding scheduling weight matrix of each business to be transmitted
S
i, (v+j)represent that i article of alternate transmission paths of business is elected to be the number of times of service transmission path, S by business to be transmitted at time slot (v+j)
i, (v+j)initial value is 0, is alternate transmission paths, so S when there being business to select this path at time slot (v+j)
i, (v+j)value add 1.Network is set up and is transmitted after light path for business based on the corresponding wavelength span of light bypass technology utilization, delete wavelength span used and set up the light path of source node to destination node at auxiliary view wavelength layer, the while deducts the transmission bandwidth of distribution and marks the transmission time slot of light path in light path.
Flexible time dispatching services is the one of RSVP type business, and its service attribute and general business have very big difference, and accompanying drawing 2 describes with regard to its unique service attribute: for service request R, and the transmission time window t zero hour
s, the finish time t
ewith business duration t
hneed meet t
h<t
e– t
s.Scheduler need ensure that the whole transmitting procedure of business is at transmission time window (t
s, t
e) in complete, the business actual transmissions t zero hour meets t
s<=t, and t+t
h<=t
e; B is service request transmission bandwidth, and the total amount of data that known business need be transmitted is: D=t
h× B, scheduler is according to the transmission t zero hour of business to be transmitted
s, the finish time t
etimeslot number m=(the t of unit that computing service transmission time window needs
e– t
s)/T, the transmitting continuous timeslot number of business are n=t
h/ T, beginning time-gap number v, the size that wherein T is time slot.By division time slot, continuous business transmitting procedure is divided into multiple parts and independently transmits, the transmitting procedure to business that so just can be meticulousr is controlled.
Select flow process to be described in detail below in conjunction with accompanying drawing 3 to core of the present invention-service transmission path.Idiographic flow can be divided into several steps below:
Step1: be the auxiliary view of dredging of W wavelength hierarchical diagram by network physical Topological Mapping according to number of wavelengths W multiplexing in every optical fiber.The whole total W+1 layer of auxiliary view of dredging, bottom is network physical topological diagram, upper W layer is corresponding to the individual independently wavelength hierarchical diagram of W, be the alternate transmission paths of each service computation K bar link disjoint to be transmitted dredging auxiliary view bottom use shortest path first, K is that the average number of degrees of network node remove the limit integer.Scheduler statistics is dredged all alternate transmission paths in auxiliary view and may be elected to be by business to be transmitted in different time-gap the number of times of service transmission path, and this is worth the scheduling weights in corresponding time slot as alternate transmission paths.From current time, the time that the scheduler of network arranges a regular length is a unit time slot, scheduler is according to unit timeslot number and beginning time-gap number that the transmission zero hour of business to be transmitted, the finish time, computing service transmission needed, and the scheduling weights of adding up according to scheduler are set up the scheduling weight matrix of business:
According to the beginning time-gap number v of business order from small to large, business to be transmitted is arranged in to chained list Q.
Step2: check whether chained list Q is empty, and if so, algorithm finishes; Otherwise, turn Step3.
Step3: scheduler takes out service request to be transmitted from chained list Q.
Step4: the alternate transmission paths of scheduler selection scheduling weights maximum is as the transmission path of business.As: scheduler is selected maximum scheduling weights S
i, (v+j)i article of corresponding alternative path is as transmission path, wherein dispatch the transmission time slot that the time slot that weights are corresponding (v+j) is business, and the every other alternate transmission paths of this time slot can not be elected to be transmission path by this business again, by all assignment 0 of scheduling weights of other alternate transmission paths in this time slot.
Step5: check that can network distribute enough bandwidth for this transmission path dredging in guidance figure.Dredging in auxiliary view, in each wavelength hierarchical diagram from upper strata to lower floor, successively search and whether exist and the transmission path of selecting, built light path that time slot is identical, if there is no such light path or light path are without available bandwidth, in the enough wavelength hierarchical diagram of bandwidth, the transmission time slot of a newly-built light path mark light path is transmission time slots corresponding to scheduling weights, if this light path exists and available bandwidth resources is enough, this type of time slot is called the sufficient time slot of service bandwidth; If light path exists but available bandwidth resources deficiency, record the available bandwidth resources information of this light path, and this time slot is called the not enough time slot of service bandwidth.
Step6: judge whether this service transmission path to be transmitted, Slot selection complete.Whether transmission time slot, transmission path that scheduler is calculated as traffic assignments to be transmitted enough allow business in transmission time window, transmit its required transmitted data amount, if so, turn Step7, otherwise, turn Step4, continue service selection transmission time slot, path for this reason.In Step1, mention scheduler according to the transmission t zero hour of business to be transmitted
s, the finish time t
etimeslot number m=(the t of unit that computing service transmission time window needs
e– t
s)/T, the transmitting continuous timeslot number of business are n=(t
h/ T), start time-gap number.If the sufficient transmission time slot of service bandwidth to be transmitted adds up to a, when meeting B × (n-a) <=∑ B
itime, business transmission time slot, Path selection complete, wherein ∑ B
ifor the available bandwidth summation of the not enough time slot respective optical path of the bandwidth under scheduler records, for ensureing that whole transmitting procedure meets transmission time window constraints, ∑ B
icorresponding bandwidth is not enough, and time slot sum should be not more than m – a.
Step7: upgrade and dredge auxiliary view.If need to be the newly-built light path of business, leave out in newly-built light path wavelength hierarchical diagram corresponding wavelength span and set up the light path of a source node to destination node, and in light path, deducting transmission bandwidth that scheduler is traffic assignments the transmission time slot of mark light path; If can utilize the available bandwidth of built light path, directly in the selected built light path of auxiliary view, deduct the transmission bandwidth that scheduler is traffic assignments, and from chained list Q, delete this business to be transmitted, turn Step2.
Scheduler is that transmission time slot, the transmission path of all traffic assignments to be transmitted all enough allows business in transmission time window, transmit after its required transmitted data amount, and the selection course in whole transmission time slot, path is just through with, and now chained list Q is empty.
Scheduler by the alternate transmission paths of selection scheduling weights maximum impel more service request at identical time slot, utilize identical path transmission data, reduce Internet Transmission energy consumption, and can utilize to a greater extent the available bandwidth of built light path by reducing the bandwidth on demand of the not enough time slot of bandwidth, although increased the transmitting continuous time of business, but this also makes traffic grooming technology be combined better with light bypass technology, not only subtract Internet Transmission energy consumption, also reduced the blocking rate of network.Analyze above-mentioned selection course known, transmission path is corresponding to the light path of multiple different wave lengths, the preferential available bandwidth of selecting to utilize built light path of business, only after built light path is without available bandwidth, select newly-built light path, may occur like this many built light paths that some transmission path is corresponding without available bandwidth but certain newly-built light path is only transmitted the situation of a business.For avoiding above-mentioned situation, scheduler is searched the light path of only transmitting a business behind the transmission time slot enough for all traffic assignments to be transmitted, path, and the sufficient time slot of the bandwidth of definite light path institute transport service, if can increase the transmission bandwidth of this type of time slot, remove the light path of a business of this transmission, and in the sufficient time slot respective optical path of the bandwidth of dredging auxiliary view, deduct the transmission bandwidth of increase; Otherwise, search and whether also have the light path of only transmitting a business.Its main flow process accompanying drawing 4 is described as follows:
Step1: the light path of only transmitting a business is found out, record the information of this light path institute transport service request, the sufficient transmission time slot number of bandwidth of for example traffic assignments, transmission light path remaining bandwidth, the transmission bandwidth of business etc., and sequentially business is arranged in to chained list L from small to large according to business transmission beginning time-gap number.
Step2: whether chained list L is empty, if be not empty, turn Step3, otherwise algorithm finishes.
Step3: taking-up business from chained list L.
Step4: whether the sufficient time slot light path of computing service bandwidth available bandwidth meets bandwidth regularization condition.Whether the sufficient time slot light path of all bandwidth of computing service available bandwidth summation is greater than the transmission bandwidth B of business, if so, turns Step5, otherwise, from chained list L, delete this business, turn Step2.
Step5: dredging the transmission bandwidth that upgrades the sufficient time slot of service bandwidth on auxiliary view.If the sufficient time slot light path of all bandwidth available bandwidth minimum value is not less than the value of service transmission bandwidth B divided by the sufficient timeslot number a of bandwidth: B/a, every the sufficient time slot respective optical path of bandwidth available bandwidth all deducts B/a, and the transmission bandwidth that the sufficient time slot light path of each bandwidth increases is consistent; If be less than,, from the sufficient time slot respective optical path of bandwidth of available bandwidth minimum, deduct successively light path available bandwidth, until equaling business, the bandwidth summation deducting transmits required bandwidth.
This process is by increasing the transmission bandwidth of the sufficient time slot of bandwidth, remove the light path of only transmitting a business, reduce the light path number of transport service in network, impel network to utilize better the available bandwidth of built light path, reduce the use amount of the network port and wavelength, and then improved link utilization in reducing network energy consumption.
This method is by dividing time slot, in different time-gap, the number of times of business alternate transmission paths may be served as the scheduling weights in path in computing network path, the path of service selection scheduling weights maximum to be transmitted is as transmission path, for business is set up the bypass of least energy consumption light, and by adjusting the transmission energy consumption and the blocking rate that reduce network under the prerequisite successfully transmitted in guarantee business of service transmission bandwidth.
These embodiment are interpreted as being only not used in and limiting the scope of the invention for the present invention is described above.After having read the content of record of the present invention, technical staff can make various changes or modifications the present invention, and these equivalences change and modification falls into the inventive method claim limited range equally.
Claims (3)
1. the energy-saving routing method based on the scheduling of business duration in optical-fiber network, is characterized in that comprising the following steps:
101, set up one according to the current idle available resources of optical-fiber network and dredge auxiliary view, the described auxiliary view of dredging comprises independently wavelength hierarchical diagram of bottom-layer network physical topology figure and W layer, in described bottom-layer network physical topology figure, include the path of several business to be transmitted, described dredge auxiliary view and set up after, scheduler in optical-fiber network arranges the fixing time slot T of unit, and according to the transmission t zero hour of business to be transmitted
sand the finish time t
e, according to calculating formula m=(t
e– t
s)/T calculates each business to be transmitted and transmits the required timeslot number m of unit, and time slot is carried out to serial number 1,2,3 ... v, described v is positive integer;
102, adopting shortest path first is the alternate transmission paths that service computation to be transmitted in the figure of bottom-layer network physical topology described in step 101 goes out K bar link disjoint, described every alternate transmission paths has scheduling weights S, and is sequentially arranged as from small to large chained list Q according to the beginning time-gap number v of business to be transmitted;
103, judge whether chained list Q is empty, if so, jumps to step 108, otherwise, go to step 104;
104, the scheduler of optical-fiber network takes out business I to be transmitted successively from chained list Q, and the alternate transmission paths of the scheduler selection scheduling weights S maximum of optical-fiber network is as the transmission path of business I to be transmitted, and time slot t corresponding to scheduling weights S is business transmission time slot;
105, alternate transmission paths and the identical built light path of time slot of dredging W layer in auxiliary view and independently successively search in wavelength hierarchical diagram the scheduling weights S maximum whether existing and selected in step 104 in step 101, set up, if there is no such light path or light path are without available bandwidth, in the enough wavelength hierarchical diagram of bandwidth, the transmission time slot of a newly-built light path this light path of mark is business transmission time slot, if this light path exists and available bandwidth resources is enough, the transmission time slot of this this light path is called the sufficient transmission time slot of bandwidth; If light path exists but available bandwidth resources deficiency, record the available bandwidth resources information of this light path, and this time slot is the not enough time slot of service bandwidth;
Whether the traffic carrying capacity that 106, in calculation procedure 105, the sufficient time slot of bandwidth and the not enough time slot of bandwidth can transmit is not less than traffic carrying capacity to be transmitted, if, the scheduler of optical-fiber network is that business has found enough transmission time slots and transmission path, go to step 107, otherwise jump procedure 104 continues service selection transmission time slot and path for this reason;
107, in step of updating 101, dredge auxiliary view: in the service transmission path respective optical path in each transmission time slot t, deduct the transmission bandwidth that the scheduler of optical-fiber network distributes for business, and from chained list Q, leave out this business to be transmitted;
108, in the time that chained list Q is sky, what the scheduler of optical-fiber network was set up in step 101 dredge searches the light path of only transmitting a business to be transmitted in auxiliary view, and the transmission time slot of definite this light path institute transport service II numbering v, start time-gap number according to transmission and be sequentially arranged as from small to large chained list L;
109, judge whether chained list L is empty, and if so, algorithm finishes, otherwise, go to step 110;
110, the scheduler of optical-fiber network takes out the business II of storage successively from chained list L, and the sufficient time slot of the bandwidth of definite business II, and whether the sufficient time slot light path of computation bandwidth available bandwidth summation
nobe less than the transmission bandwidth of business II, if, increase the transmission bandwidth of this time slot, remove the light path of a business of this transmission, and the transmission bandwidth increasing above deducting in the sufficient time slot respective optical path of the bandwidth of dredging auxiliary view, this business II in chained list L, deleted, go to step 109, otherwise, directly in chained list L, delete this business II, go to step 109.
2. the energy-saving routing method based on the scheduling of business duration in optical-fiber network according to claim 1, it is characterized in that: the step of dredging auxiliary view foundation described in step 101 is: be the auxiliary view of dredging being made up of W wavelength hierarchical diagram and bottom-layer network physical topology figure by network physical Topological Mapping according to number of wavelengths W multiplexing in every optical fiber in optical-fiber network, the whole total W+1 layer of auxiliary view of dredging, bottom is network physical topological diagram, and upper W layer is corresponding to the individual independently wavelength hierarchical diagram of W.
3. the energy-saving routing method based on the scheduling of business duration in optical-fiber network according to claim 1, is characterized in that: the scheduling weight matrix that the S of several alternate transmission paths scheduling weights described in step 102 forms business is:
S
i, (v+j)represent that i article of alternate transmission paths of business is elected to be the number of times of service transmission path, S by business to be transmitted at time slot (v+j)
i, (v+j)initial value is 0, is alternate transmission paths, so S when there being business to select this path at time slot (v+j)
i, (v+j)value add 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410288798.4A CN104092606B (en) | 2014-06-24 | 2014-06-24 | Energy-saving routing method based on service duration time scheduling in optical network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410288798.4A CN104092606B (en) | 2014-06-24 | 2014-06-24 | Energy-saving routing method based on service duration time scheduling in optical network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104092606A true CN104092606A (en) | 2014-10-08 |
| CN104092606B CN104092606B (en) | 2017-02-15 |
Family
ID=51640288
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410288798.4A Active CN104092606B (en) | 2014-06-24 | 2014-06-24 | Energy-saving routing method based on service duration time scheduling in optical network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104092606B (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105337899A (en) * | 2015-09-29 | 2016-02-17 | 重庆邮电大学 | Optical network energy-saving routing method capable of flexibly adjusting reserved-type service transmission bandwidth |
| CN107465618A (en) * | 2017-07-21 | 2017-12-12 | 北京市天元网络技术股份有限公司 | Photoelectricity path dispatching method and device |
| CN107682263A (en) * | 2017-09-22 | 2018-02-09 | 西安空间无线电技术研究所 | A kind of dispatching method based on the business duration in hybrid switching network |
| CN108377220A (en) * | 2018-02-27 | 2018-08-07 | 重庆邮电大学 | A kind of transparent virtual optical-fiber network collaboration mapping method of node importance perception |
| CN108809714A (en) * | 2018-06-11 | 2018-11-13 | 电子科技大学 | A method of the online heavy-route parallel frequency spectrum defragmentation based on hierarchical diagram |
| CN109218190A (en) * | 2017-06-29 | 2019-01-15 | 华为技术有限公司 | A kind of the determination method and node of transmission path |
| CN109547876A (en) * | 2018-12-29 | 2019-03-29 | 重庆邮电大学 | A kind of adaptive guard rank method under elastic optical network twin failure |
| CN110808883A (en) * | 2019-11-07 | 2020-02-18 | 中国电子科技集团公司第三十四研究所 | Searching method of optical fiber communication transmission path |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1791000A (en) * | 2004-12-17 | 2006-06-21 | 电子科技大学 | Integrated service leading method for WDM optical network |
| CN102137313A (en) * | 2011-04-29 | 2011-07-27 | 东北大学 | Subtree-based multicasting traffic grooming method in WDM (Wavelength Division Multiplex) optical network |
-
2014
- 2014-06-24 CN CN201410288798.4A patent/CN104092606B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1791000A (en) * | 2004-12-17 | 2006-06-21 | 电子科技大学 | Integrated service leading method for WDM optical network |
| CN102137313A (en) * | 2011-04-29 | 2011-07-27 | 东北大学 | Subtree-based multicasting traffic grooming method in WDM (Wavelength Division Multiplex) optical network |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105337899A (en) * | 2015-09-29 | 2016-02-17 | 重庆邮电大学 | Optical network energy-saving routing method capable of flexibly adjusting reserved-type service transmission bandwidth |
| CN109218190A (en) * | 2017-06-29 | 2019-01-15 | 华为技术有限公司 | A kind of the determination method and node of transmission path |
| US11146480B2 (en) | 2017-06-29 | 2021-10-12 | Huawei Technologies Co., Ltd. | Apparatus, method of determining transmission path and computer-readable storage medium |
| CN107465618A (en) * | 2017-07-21 | 2017-12-12 | 北京市天元网络技术股份有限公司 | Photoelectricity path dispatching method and device |
| CN107465618B (en) * | 2017-07-21 | 2020-01-14 | 北京天元创新科技有限公司 | Method and device for scheduling optical-electrical paths |
| CN107682263A (en) * | 2017-09-22 | 2018-02-09 | 西安空间无线电技术研究所 | A kind of dispatching method based on the business duration in hybrid switching network |
| CN107682263B (en) * | 2017-09-22 | 2019-10-18 | 西安空间无线电技术研究所 | Dispatching method based on the business duration in a kind of hybrid switching network |
| CN108377220A (en) * | 2018-02-27 | 2018-08-07 | 重庆邮电大学 | A kind of transparent virtual optical-fiber network collaboration mapping method of node importance perception |
| CN108377220B (en) * | 2018-02-27 | 2020-10-02 | 重庆邮电大学 | Transparent virtual optical network collaborative mapping method for sensing node importance |
| CN108809714A (en) * | 2018-06-11 | 2018-11-13 | 电子科技大学 | A method of the online heavy-route parallel frequency spectrum defragmentation based on hierarchical diagram |
| CN109547876A (en) * | 2018-12-29 | 2019-03-29 | 重庆邮电大学 | A kind of adaptive guard rank method under elastic optical network twin failure |
| CN110808883A (en) * | 2019-11-07 | 2020-02-18 | 中国电子科技集团公司第三十四研究所 | Searching method of optical fiber communication transmission path |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104092606B (en) | 2017-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104092606A (en) | Energy-saving routing method based on service duration time scheduling in optical network | |
| CN105827528B (en) | A kind of route selection method suitable for the flexible optical-fiber network of frequency spectrum | |
| CN101052235B (en) | Business combing method and device for ASON special protection | |
| CN105337899A (en) | Optical network energy-saving routing method capable of flexibly adjusting reserved-type service transmission bandwidth | |
| US10069570B2 (en) | Multi-layer modem reclamation systems and methods | |
| CN103379032A (en) | Acquisition method and device for cross-domain end-to-end route and secondary route computation element | |
| CN104836751B (en) | The optical-fiber network frequency spectrum distributing method of single path business separation-merging based on frequency spectrum perception | |
| CN108134967B (en) | Power optical network routing frequency spectrum distribution method and system | |
| CN104836736A (en) | Spectrum sensing-based energy efficiency resource allocation and path reconfiguration method in elastic optical network | |
| CN102271368A (en) | Cross-layer-resource-optimization-based space-sky information network information transmission method and system | |
| CN105245307B (en) | Method and apparatus for determining communication path in a communication network | |
| CN104518961B (en) | It is grouped the leading method and device of optical transport network | |
| CN111586502A (en) | Resource allocation method and system in elastic optical network | |
| CN107302396B (en) | Network route planning method between dynamic star based on mixed strategy | |
| CN102546440B (en) | Routing and wavelength assignment method and system | |
| CN102196325B (en) | Ant-colony-system-based dynamic routing and wavelength assignment method for optical network | |
| CN101478705B (en) | Survivable service flow conducting method based on interlayer message routing | |
| CN104092609A (en) | Method and device for building IP over WDM network | |
| CN106506362B (en) | A kind of elastic optical network multilink fault probability guard method of minimum failure risk loss | |
| CN102025615B (en) | Method and device for planning paths of small-granularity services in optical communication network | |
| CN104427412A (en) | Method and device for updating bandwidth map | |
| CN101360347B (en) | Route selection method for wavelength routing optical network | |
| CN102281201A (en) | route selection and resource distribution method and device | |
| CN103166861B (en) | A kind of layered multicast maximum throughput metering method solving optical-fiber network | |
| Jinno et al. | Minimal virtualized-elastic-regenerator placement and least congestion resources assignment for translucent elastic optical 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 |