CN107181694A - The route frequency spectrum distributing method that a kind of utilization multithreading is realized - Google Patents
The route frequency spectrum distributing method that a kind of utilization multithreading is realized Download PDFInfo
- Publication number
- CN107181694A CN107181694A CN201710595745.0A CN201710595745A CN107181694A CN 107181694 A CN107181694 A CN 107181694A CN 201710595745 A CN201710595745 A CN 201710595745A CN 107181694 A CN107181694 A CN 107181694A
- Authority
- CN
- China
- Prior art keywords
- resource
- thread
- service request
- frequency spectrum
- route
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the route frequency spectrum distributing method that a kind of utilization multithreading is realized, belong to route technology field.The inventive method sets up data link for multiple service requests simultaneously using multiple threads, thread is resource collection using the unit of resource, thread uses the constraints consecutive variations of resource, there is the relation of multiple dimensions between the resource that single thread is used, the resource in network can fully be utilized, reduce the setup delay of data link, lift user experience quality.
Description
Technical field
The present invention relates to route technology field, the route frequency spectrum distribution side that a kind of utilization multithreading is realized is particularly related to
Method.
Background technology
In traditional network interconnection, IP packet networks and optical-fiber network are separate operations, and IP layers of cluster route skill
The development of art largely improves the caching capabilities and exchange capacity of P, and elastic optical network is not only realized
The transmission of Large Copacity, ultra long haul, the characteristics of also possessing low time delay, by the flexible utilization to frequency spectrum, improves the money in network
Source utilization rate, but IP packet networks and the separated maintenance and management of optical-fiber network, cause the waste of resource so that networking
Safeguard complexity and cost more and more higher.(YANG H, ZHANG J, ZHAO Y, et al.Performance in the prior art
evaluation of multi-stratum resources integrated resilience for software
defined inter-data center interconnect[J].Optics express,2015,23(10):13384-
13398.) network architecture that IP network and optical-fiber network based on SDN jointly control is proposed, in this framework, control and forwarding
It is separated, SDN controllers are extended to photosphere by OpenFlow agreements, realize the unified management of IP network and optical-fiber network.It is existing
(YANG H, ZHANG J, ZHAO Y, et al.Software defined clustered-optical access in technology
networking for ubiquitous data center optical interconnection[A].IEEE ICNC’16
[C].New York,USA,2016:The layer-span combined optimization that 1-5.) also proposed data center is uniformly controlled framework, center SDN
The topology resource information of whole network is maintained in controller so that the management and control of the whole network have concentrated on center SDN controllers
In, the interaction of IP layers and photosphere resource is realized, so as to eliminate the information occlusion between heterogeneous networks level, IP layers and light is realized
The combined optimization of layer resource.Center SDN controllers are determined in IP layers and photosphere by analyzing business granularity and current network resources
Those resources are more suitable for providing service for new service request, and O＆M and resource utilization are improved with this, reduce network operation
Cost, improve service cross-layer recover and service request capability of fast response, but be due to IP data services have burst, it is not true
The characteristic such as fixed, when IP layer services amount is increased sharply, IP layers of burst service is dredged to photosphere, and this requires optical-fiber network to business
The light path of request can quickly be set up, and in optical-fiber network, when the request of short-term burst a large number of services, although frequency spectrum resource is sufficient,
Because service request is largely assembled, optical-fiber network controller can not set up light path for service request in time, when service request is queued up
Prolonging gradually increases, and this has a strong impact on the delay performance of network.Network delay performance deterioration will cause service connection heavy-route or
Signaling response is abnormal in communication process, the reliability of influence signal transmission, the throughput degradation of network is caused indirectly, and then reduce
Network resource utilization；If network delay performance can not meet requirement, user experience quality (Quality of Experience,
QoE lifting) is will be unable to, now only improving bandwidth can not fundamentally solve the above problems.
Huawei Technologies set Wavelength Assignment table on optical network unit in advance, and the service according to where optical network unit is provided
Business, by Wavelength Assignment table, obtains wavelength information corresponding with the service provider where optical network unit, according to optical-fiber network list
The corresponding wavelength information of service provider where member, sends or receives optical signal, simplify the flow of Wavelength Assignment, reduce
Wavelength Assignment time delay, improves user experience quality；ZTE Corporation carries out Wavelength routing point in current network topology to business
Timing, deletes the node or optical fiber for reaching predetermined threshold, and dynamic adjusts network topology so that in the case where portfolio is larger,
Business below is come because available network topology scale is less and less, therefore the speed of Wavelength routing distribution is carried out to business
Also can be increasingly faster, so as to reduce the time complexity of total algorithm, the time of Wavelength routing is reduced, efficiency of algorithm is improved,
User experience quality is improved, is due to that algorithm sets up light for service request one by one though above-mentioned algorithm obtains good effect
Road, in the scene that portfolio is larger, the setup delay of light path is longer.
The content of the invention
In view of this, the present invention proposes the route frequency spectrum distributing method that a kind of utilization multithreading is realized, it can fill
Divide ground using the resource in network, reduce data link setup time delay, lift user experience quality.
Based on above-mentioned purpose, the technical scheme that the present invention is provided is：
The route frequency spectrum distributing method that a kind of utilization multithreading is realized, this method is using multiple threads simultaneously to be multiple
Service request sets up data link, and thread is resource collection using the unit of resource, and thread is continuous using the constraints of resource
Change, the relation between the resource that single thread is used with multiple dimensions, this method is concretely comprised the following steps：
(1) initialization system G (V, E), global critical zone, global variable and thread function；
(2) judge whether there is service request in R (i, j, nslot), step (16) is not jumped to then；
(3) thread number and G are first determined whether*(V*,E*) midpoint whether mutual exclusion, mutual exclusion then jumps to step (12)；
(4) judge whether the corresponding service request of current thread handles completion, whole business processings complete then to put to work as front
Journey task end mark, jumps to step (12)；
(5) from the inner source nodes of finding out of R (i, j, nslot) for thread number, source node, destination node and G*(V*,E*) not mutual exclusion
Service request, record search position jumps to step (12) if not finding；
(6) thread obtains shortest path on G (V, E), judge whole nodes on shortest path whether and G*(V*,E*)
Mutual exclusion, mutual exclusion then jumps to step (12)；
(7) enter global critical zone, judge whole nodes on shortest path whether and G*(V*,E*) mutual exclusion, if mutual exclusion
Then leave global critical zone, jump procedure (12)；Not mutual exclusion colours whole nodes on shortest path with thread number, simultaneously will
Point after coloring adds G*(V*,E*), reconstruct G ' (V ', E '), leave global critical zone；
(8) judge whether the frequency spectrum resource on shortest path can support the foundation of data link, if can not if block industry
Business, adds up the total time that service request scheme is established, to jump to step (11)；
(9) side on shortest path is coloured with thread number, the side after coloring is added into G*(V*,E*), reconstruct G ' (V ',
E’)；
(10) frequency spectrum resource, the frequency spectrum resource on refresh path side, by the side on shortest path from G are distributed for data link*
(V*,E*) the middle total time deleted, add up the establishment of service request scheme；
(11) point for colouring thread number is from G*(V*,E*) middle deletion, refreshing G ' (V ', E ')；
(12) timeslice function is performed；
(16) method terminates；
Wherein, G (V, E) represents the physical topology of network, and V is node set, and E is line set；G*(V*,E*) represent coloring
Virtual topology, V* is coloring node set, and E* is coloring line set；G ' (V ', E ') available virtual topology is represented, V ' is available section
Point set, E ' is available line set；R (i, j, nslot) is represented from node i to node j service request, needs nslot frequency band.
Optionally, the thread in the above method is referred to using the unit of resource for resource collection, occupancy of the thread to resource
For the set of one or more resources, thread resource in set is all taken or all without；Thread in the above method makes
Referred to the constraints consecutive variations of resource, constraints uses shape during resource use by the resource of multiple threads
Into and continuous dynamic change；The relation with multiple dimensions refers between the resource that single thread in the above method is used, resource
Set is determined by the resource that can meet multiple dimensions of specific tasks.
Optionally, the constraints in the above method during distribution route frequency spectrum is：Labeled point or side is provided in multithreading
Source can not be used when using.
Optionally, also include after step (12) in the above method：
(13) R of refusallWhether R is reachedu, the upper limit is reached, all route frequency spectrum computational threads dormancy, long range thread is
RlRoute spectrum allocation schemes are calculated, step (2) is otherwise jumped to；
(14) it is RlRoute spectrum allocation schemes are calculated, until RlLess than Rd；
(15) service request then jumps to step (2) in R (i, j, nslot)；
Wherein, RlRepresent long range service request number；RuRepresent the long range service request upper limit；RdRepresent long range industry
Business request lower limit.
Optionally, the calculation formula of the Time Delay Model of this method is：
A(Nr)=T × (Nr/Nth+1)/2；
Wherein, NrRepresent service request number, NthThe number of thread is represented, T is expressed as a service request and sets up data
The time delay of link, A (n) represents the average data link establishment time delay of n service request.
From narration above as can be seen that the beneficial effect of technical solution of the present invention is：
The method of the present invention can be applied to related to multithreading while using in the network of route and frequency spectrum resource,
Such as fiber optic communication network (abbreviation optical-fiber network) or wireless network.The essence of the inventive method is frequency spectrum resource mutual exclusion, but if only
With frequency spectrum resource as mutex amount, substantial amounts of read-write operation will reduce the service efficiency of frequency spectrum resource, therefore present invention side
Method by path Shang Ge while frequency spectrum resource semaphore aggregate into each while semaphore, regard side semaphore all on path as one
Individual be integrated into critical zone is judged.In addition, the inventive method using the point used on path as mutex amount, to reduce
The holding time of opposite side mutex amount, because, if only using constraints as resource with line set, easily produce
Similar to the Deadlock of banker's algorithm；The combinational logic of critical zone and side semaphore set can also realize that resource mutual exclusion is used,
But when network size is larger, the misaligned service request of accessed path is inefficient.
In a word, the inventive method makes the distribution routeing of point semaphore, and the distribution of frequency spectrum resource is made of side semaphore, due to
Only in coloring virtual topology, and side resource between color identical node could judge that frequency spectrum resource is by corresponding thread
No abundance, the inventive method has evaded SECM-RSA (Single Edge Constraint Multithread by a mutual exclusion
RSA, Unilateral constraints multithreading route frequency spectrum allocation algorithm) in multiple threads the resource on same side is repeated to judge and invalid accounted for
With.The inventive method can refresh coloring virtual topology, release way in time when not carrying out route frequency spectrum distribution successfully once
The node of upper coloring, reduces the operation of opposite side semaphore and the occupancy of frequency spectrum resource, reduces time delay.
Brief description of the drawings
In order to clearly describe this patent, one or more accompanying drawing is provided below, these accompanying drawings are intended to this patent
Background technology, technical principle and/or some specific embodiments make aid illustration.It should be noted that these accompanying drawings can
It can not also provide some to provide and have been described and belong to known in those of ordinary skill in the art often at this patent word segment
The detail of knowledge；Also, because one of ordinary skill in the art can combine the published word content of this patent completely
And/or accompanying drawing content, more accompanying drawings, therefore these accompanying drawings below are designed in the case where not paying any creative work
Can cover can not also cover all technical schemes that this patent word segment is described.In addition, these accompanying drawings is specific interior
Containing needs the word content with reference to this patent to be determined, when the word content of this patent is substantially tied with some in these accompanying drawings
, it is necessary to which to carry out comprehensive descision be this on earth with reference to the narration of the common knowledge and this patent other parts of this area when structure is not consistent
The word segment of patent, which exists to exist in clerical mistake, or accompanying drawing, draws mistake.Especially, the following drawings is the figure of exemplary in nature
Piece, it is not intended that imply the protection domain of this patent, one of ordinary skill in the art is by reference to the text disclosed in this patent
In word content and/or accompanying drawing
Hold, more accompanying drawings can be designed in the case where not paying any creative work, these new accompanying drawing institute's generations
The technical scheme of table is still within the protection domain of this patent.
Fig. 1 is the network topological diagram of National Science Foundation；
Fig. 2 is the node locking sequential of traditional RSA Algorithm；
Fig. 3 is a kind of node locking sequential of the inventive method；
Fig. 4 is time point t+1 coloring virtual topology；
Fig. 5 is time point t+1 available virtual topology；
Fig. 6 is time point t+5 available virtual topology；
Fig. 7 is a kind of method flow diagram in the embodiment of the present invention.
Embodiment
Understanding for the ease of those skilled in the art to the art of this patent scheme, meanwhile, in order that the technology of this patent
Purpose, technical scheme and beneficial effect are clearer, and the protection domain of claims is fully supported, below with tool
The form of body case the technical scheme of this patent is made further, more detailed description.
The route frequency spectrum distributing method that a kind of utilization multithreading is realized, this method is using multiple threads simultaneously to be multiple
Service request sets up data link, and thread is resource collection using the unit of resource, and thread is continuous using the constraints of resource
Change, the relation between the resource that single thread is used with multiple dimensions, this method is concretely comprised the following steps：
(1) initialization system G (V, E), global critical zone, global variable and thread function；
(2) judge whether there is service request in R (i, j, nslot), step (16) is not jumped to then；
(3) thread number and G are first determined whether*(V*,E*) midpoint whether mutual exclusion, mutual exclusion then jumps to step (12)；
(4) judge whether the corresponding service request of current thread handles completion, whole business processings complete then to put to work as front
Journey task end mark, jumps to step (12)；
(5) from the inner source nodes of finding out of R (i, j, nslot) for thread number, source node, destination node and G*(V*,E*) not mutual exclusion
Service request, record search position jumps to step (12) if not finding；
(6) thread obtains shortest path on G (V, E), judge whole nodes on shortest path whether and G*(V*,E*)
Mutual exclusion, mutual exclusion then jumps to step (12)；
(7) enter global critical zone, judge whole nodes on shortest path whether and G*(V*,E*) mutual exclusion, if mutual exclusion
Then leave global critical zone, jump procedure (12)；Not mutual exclusion colours whole nodes on shortest path with thread number, simultaneously will
Point after coloring adds G*(V*,E*), reconstruct G ' (V ', E '), leave global critical zone；
(8) judge whether the frequency spectrum resource on shortest path can support the foundation of data link, if can not if block industry
Business, adds up the total time that service request scheme is established, to jump to step (11)；
(9) side on shortest path is coloured with thread number, the side after coloring is added into G*(V*,E*), reconstruct G ' (V ',
E’)；
(10) frequency spectrum resource, the frequency spectrum resource on refresh path side, by the side on shortest path from G are distributed for data link*
(V*,E*) the middle total time deleted, add up the establishment of service request scheme；
(11) point for colouring thread number is from G*(V*,E*) middle deletion, refreshing G ' (V ', E ')；
(12) timeslice function is performed；
(16) method terminates；
Wherein, G (V, E) represents the physical topology of network, and V is node set, and E is line set；G*(V*,E*) represent coloring
Virtual topology, V*For coloring node set, E*For coloring line set；G ' (V ', E ') available virtual topology is represented, V ' is available section
Point set, E ' is available line set；R (i, j, nslot) is represented from node i to node j service request, needs nslot frequency band.
Optionally, the thread in the above method is referred to using the unit of resource for resource collection, occupancy of the thread to resource
For the set of one or more resources, thread resource in set is all taken or all without；Thread in the above method makes
Referred to the constraints consecutive variations of resource, constraints uses shape during resource use by the resource of multiple threads
Into and continuous dynamic change；The relation with multiple dimensions refers between the resource that single thread in the above method is used, resource
Set is determined by the resource that can meet multiple dimensions of specific tasks.
Optionally, the constraints in the above method during distribution route frequency spectrum is：Labeled point or side is provided in multithreading
Source can not be used when using.
Optionally, also include after step (12) in the above method：
(13) R of refusallWhether R is reachedu, the upper limit is reached, all route frequency spectrum computational threads dormancy, long range thread is
RlRoute spectrum allocation schemes are calculated, step (2) is otherwise jumped to；
(14) it is RlRoute spectrum allocation schemes are calculated, until RlLess than Rd；
(15) service request then jumps to step (2) in R (i, j, nslot)；
Wherein, RlRepresent long range service request number；RuRepresent the long range service request upper limit；RdRepresent long range industry
Business request lower limit.
Optionally, the calculation formula of the Time Delay Model of this method is：
A(Nr)=T × (Nr/Nth+1)/2；
Wherein, NrRepresent service request number, NthThe number of thread is represented, T is expressed as a service request and sets up data
The time delay of link, A (n) represents the average data link establishment time delay of n service request.
Below by taking National Science Foundation (NSFNET) network topological diagram (see Fig. 1) as an example, to the inventive method
Detailed process be described.In the example, it is assumed that network is optical-fiber network, and this method is applied on multithreading SDN controllers.
The a plurality of light path set up is needed in optical-fiber network, if without public side, referred to as a plurality of optical circuit path is misaligned, such as
Shown in Fig. 1, in NSFNET topologys, 2 → 3 and 4 → 5 be the misaligned service request in two paths, can be in different threads
In simultaneously set up light path.The inventive method sets up light path to reduce the row of business for the misaligned service request in multiple paths simultaneously
The point and line set of current light path foundation, are set up coloring virtual topology, can not use coloring empty during newly-built light path by team's time delay
Intend resource in topology, suitable resource can only be searched in remaining available virtual topology.Newly-built light path is found after suitable resource,
The unit that the point used on path or line set are used as resource, the combinational logic by critical zone and semaphore set is accurate
The set that these resources are taken from global resource.The constraints that resource is used in this method is during the foundation of light path
Formed, first seize point set resource during light path foundation, judge after frequency spectrum resource, seized or do not robbed according to judged result
Account for the resource of line set, this is the resource using mode of two dimension, after newly-built light path is set up, the point of release and side will and available virtual
Topology connection, the occupancy of resource and release are a continuous processes, and which constitute the two-dimentional resource preemptive type based on point and side
Distribution model.
It is as shown in table 1 to symbol definition used in the inventive method in order to describe the thinking of the inventive method：
Symbol definition and its meaning in the network of table 1
Definition during the inventive method road construction and it is constrained to：(1) the multiple threads of the inventive method be R ' (i, j,
When nslot) setting up and removing light path, when resource is used and discharged, corresponding point and side are from G*Middle addition and deletion, G remove G*
For G ', this is the virtual topology reconstruct based on two-dimentional resource preemptive type distribution model.(2)G*Money during being set up as light path
The constraints that source is used, G*In ViAnd Eij, can not be used during newly-built light path.(3) on G ', multiple threads are to be selected from R
R ' is selected, needs operating path lookup algorithm to search the path of service request, if the path found and G*Mutual exclusion, then abandon this industry
Business request, is continued to search for, the R ' (i, j, nslot) until finding the condition of satisfaction.(4) set of node that R ' (i, j, nslot) is used
Close by thread in the critical zone corresponding color dyes of thread, add G*, G ' is reconstructed, judges that each side frequency spectrum resource is sufficient, R ' (i,
J, nslot) line set used, in the corresponding color dyes of critical zone thread, adds G by thread*, G ' is reconstructed, R ' is distributed
The frequency spectrum resource of (i, j, nslot), after the completion of light path is set up, the resource that release R ' (i, j, nslot) takes reconstructs G*And G '.
(5) when multiple threads select R ' from R, it is rejected and hop count is more than RnService request be referred to as long range service request, for length
The thread of route frequency spectrum distribution, abbreviation long range thread are calculated apart from service request.
The inventive method can accurately be realized resource-sharing, can also be put down by the virtual topology coloured with multithreading
Weigh use of each thread to Internet resources, realize that the service to multistage various-service is controllable.G*And G ' reconstruct has quick and connected
The characteristics of continuous, for each thread equivalent in an independent topology according to it is current just road construction, road construction by model mutual exclusion, not
Road construction, the new service request that is distributed as reaching business set up light path, therefore this method can adapt in layer-span combined optimization framework
Burst service request light path set up, light path setup delay reduce while become it is more stable.Due to using parallel computation
The method being combined with shortest path, so this method is while reduction burst service request light path sets up average delay, also
The use of the propagation delay time and bandwidth resources of optical signal can effectively be reduced.
It is as shown in table 2 to symbol definition used in Controlling model in order to describe the performance of different Controlling models：
Table 2 main symbol definition and its meaning
Traditional RSA Algorithm, when burst service is largely assembled, can only set up light path for service request one by one, for
During single service request sets up light path, all resources are all taken by principal function thread, generally have the following steps：1. business please
Ask arrival；2. it is that service request sets up light path that principal function thread, which takes whole resources,；3. service request light path is successfully established or hindered
Plug.The node resource locking sequential of the multiple service requests of algorithm process is as shown in Figure 2.
Fig. 2 is made up of node, time, principal function thread, in 15 time intervals, is had 7 service requests and is obtained one by one
To response.Square is calculating and the time of updating system resource lock node in dotted line, in this time interval, institute in network
There is node all by principal function thread locked, but not all node can all be used during locked, and this causes to provide in network
Source is wasted, and adds the average optical paths setup delay of service request, the service request average optical paths setup delay of algorithm is by formula
(1) calculate：
A(Nr)=T × (Nr+1)/2 (1)。
A (the N of traditional RSA Algorithm are understood by formula (1)r) and service request number NrIt is linear, the inventive method
Main target is exactly to reduce A (Nr) with NrIncreased speed, to adapt to the field that burst service is dredged in layer-span combined optimization framework
Scape.
The inventive method carried out the foundation of bar light path by two-dimentional resource preemptive type distribution model parallel, and breaking business please
The limitation calculated one by one by single thread is asked, service request light path setup delay can not only be reduced, the unit interval can also be reduced
Interior service request blocking rate, increases throughput fiber.The service request replies step of the inventive method：1. service request is reached；
2. multiple route frequency spectrum computational threads or long range thread are that service request sets up light path；3. service request light path be successfully established or
Obstruction.The node resource locking sequential of the inventive method is as shown in Figure 3.
Fig. 3 is made up of node, time, multiple threads, in 15 time intervals, is had 20 service requests and is rung
Should.At any point in time, on different paths node and the side on path can pass through resource mutual exclusion by different threads
Mode is locked, and is used which increase resource in optical-fiber network, reduces the average optical paths setup delay of service request, the inventive method
Service request average optical paths setup delay by formula (2) calculate：
A(Nr)=T × (Nr/Nth+1)/2 (2)。
A (the N of the inventive method are understood by formula (2)r) with service request number NrIncrease is linearly increasing, with number of threads
NthIncrease is linear to be reduced, and effectively reduces A (Nr) with NrIncreased speed, can adapt to the industry that happened suddenly in layer-span combined optimization framework
The scene that business is dredged.Comparison diagram 2 and Fig. 3 can be seen that in equal time interval, and the inventive method please for more business
Ask and establish light path.
The thread coloring of the inventive method refers to thread passage path lookup algorithm, is R ' (i, j, nslot) accessed path,
The point of path needs is seized, is to light different colors on different R ' (i, j, nslot) paths at same time point.
In Fig. 3, thread 2,5 represents different colors respectively, is used the point in R ' (2,3, nslot), R ' (5,4, nslot) light path
V’2、V’3And V '4、V’5, side E '2,3And E '5,4Coloring, after the light path of service request is set up, the point that is coloured in respective path and
Coloring is cancelled on side, and the coloring virtual topology and available virtual that thread releases several time points in the locking to node and side, Fig. 3 are opened up
Flutter as shown in table 3.
Available resources reconstruct of the table 3 based on coloring virtual topology
From table 3 it is observed that in time point t+1, thread 2,5,10,12,13 sets up 5 light paths at the same time, coloring is empty
Intend topology as shown in figure 4, as shown in Figure 5 based on the available virtual topology that two-dimentional resource preemptive type distribution model is reconstructed.
In time point t+5, the available virtual topology reconstructed based on two-dimentional resource preemptive type distribution model is as shown in Figure 6.
In time point t+10, long range thread is setting up light path for long range service request, because coloring is virtually opened up
Flutter and physical topology is divided into several cut sets, the service request of long range is difficult to be responded.It is fair to consider, count long range industry
The number of business request, when long range service request quantity is more than RuWhen, long range service request road construction semaphore is put, is owned
Route frequency spectrum thread detects semaphore, into resting state, concedes timeslice, long range thread brings into operation.When not responding
Long range service request be less than RdWhen, long range service request road construction semaphore is discharged, long range thread dormancy is multiple
Thread is waken up, and the flow chart of this method is as shown in Figure 7.
This method needs to input physical topology, the parameter setting of network of network, and service request source node and purpose
Node, this method be output as service request path and frequency spectrum numbering.It is implemented as：
1) initialization system G (V, E), global variable, thread function.
2) judge whether there is service request in R, do not jump to step 16.
3) thread number and G are first determined whether*Midpoint whether mutual exclusion, mutual exclusion then jumps to step 12.
4) judge whether the corresponding service request of current thread handles completion, whole business processings complete then to put current thread
Task end mark, jumps to step 12.
5) source point is found out in R for thread number, source point, destination node and G*The service request of not mutual exclusion, record search position
Put, step 12 is jumped to if do not found.
6) thread obtains shortest path on G, judge whole nodes on shortest path whether and G*Mutual exclusion, mutual exclusion is then jumped
Go to step 12.
7) enter global critical zone, judge whole nodes on shortest path whether and G*Mutual exclusion, leaves if mutual exclusion
Global critical zone, jump procedure 12.Not mutual exclusion colours whole nodes on shortest path with thread number, while by after coloring
Point adds G*, G ' is reconstructed, global critical zone is left.
8) judge whether the frequency spectrum resource on shortest path can support the foundation of light path, if can not if block traffic, tire out
The total time that service request scheme is established is counted, step 11 is jumped to.
9) side on shortest path is coloured with thread number, the side after coloring is added into G*, reconstruct G '.
10) frequency spectrum resource, the frequency spectrum resource on refresh path side, by the side on shortest path from G are distributed for light path*In delete
Remove, add up the total time that service request scheme is established.
11) point for colouring thread number is from G*It is middle to delete, refresh G '.
12) timeslice function is performed.
13) R of refusallWhether R is reachedu, the upper limit is reached, all route frequency spectrum computational threads dormancy, long range thread is Rl
Route spectrum allocation schemes are calculated, step 2 is otherwise jumped to.
14) it is RlRoute spectrum allocation schemes are calculated, until RlLess than Rd。
15) service request then jumps to step 2 in R.
16) method terminates.
It is to be appreciated that to be intended merely to facilitate this area common for the above-mentioned narration for this patent embodiment
The exemplary description that technical staff understands this patent scheme and enumerated, does not imply that the protection domain of this patent is limited solely to
In this few example, those of ordinary skill in the art completely can on the premise of making and fully understanding to the art of this patent scheme,
In the form of not paying any creative work, by taking each example cited by this patent combination technique feature, replacement
Some technical characteristics, the more technical characteristics of addition etc. mode, obtain more embodiments, all these specific implementations
Mode is within the covering scope of patent claims book, therefore, and these new embodiments also should be in this patent
Protection domain within.
In addition, for the purpose for simplifying narration, this patent may also not enumerate some ordinary specific embodiments, this
A little schemes are that those of ordinary skill in the art can expect naturally after it understanding of the art of this patent scheme, it is clear that this
A little schemes should be also included within the protection domain of this patent.
For the purpose for simplifying narration, above-mentioned each embodiment may only up to for the extent of disclosure of ins and outs
The degree that can voluntarily make a decision to those skilled in the art, i.e. for above-mentioned embodiment without disclosed ins and outs,
Those of ordinary skill in the art completely can be in the case where not paying any creative work, in filling for the art of this patent scheme
Divide under prompting, completed by means of the disclosed document of textbook, reference book, paper, patent, audio-visual product etc., or, this
A little details are the contents that can be voluntarily maked decision according to actual conditions under being generally understood that of those of ordinary skill in the art.
It can be seen that, even if these underground ins and outs, the open adequacy of the art of this patent scheme will not also be impacted.
In a word, it is any on the basis of explanation effect of the patent specification to claims protection domain is combined
The specific embodiment of patent claims book covering scope is fallen into, within the protection domain of this patent.
Claims (5)
1. the route frequency spectrum distributing method that a kind of utilization multithreading is realized, it is characterised in that be simultaneously using multiple threads
Multiple service requests set up data link, and thread is resource collection using the unit of resource, and thread uses the constraints of resource
There is the relation of multiple dimensions between consecutive variations, the resource that single thread is used, concretely comprise the following steps：
(1) initialization system G (V, E), global critical zone, global variable and thread function；
(2) judge whether there is service request in R (i, j, nslot), step (16) is not jumped to then；
(3) first determine whether thread number and G* (V*, E*) midpoint whether mutual exclusion, mutual exclusion then jumps to step (12)；
(4) judge whether the corresponding service request of current thread handles completion, whole business processings complete then to put current thread times
Business end mark, jumps to step (12)；
(5) from the inner source nodes of finding out of R (i, j, nslot) for thread number, source node, destination node and G* (V*, E*) not mutual exclusion
Service request, record search position jumps to step (12) if not finding；
(6) thread obtains shortest path on G (V, E), judges whether whole nodes on shortest path are mutual with G* (V*, E*)
Reprimand, mutual exclusion then jumps to step (12)；
(7) enter global critical zone, judge whole nodes on shortest path whether with G* (V*, E*) mutual exclusion, if mutual exclusion
Leave global critical zone, jump procedure (12)；Not mutual exclusion colours whole nodes on shortest path with thread number, while incite somebody to action
Point addition G* (V*, E*) after color, reconstruct G ' (V ', E '), leave global critical zone；
(8) judge whether the frequency spectrum resource on shortest path can support the foundation of data link, if can not if block traffic, tire out
The total time that service request scheme is established is counted, step (11) is jumped to；
(9) side on shortest path is coloured with thread number, the side after coloring is added into G* (V*, E*), reconstruct G ' (V ', E ')；
(10) for data link distribute frequency spectrum resource, the frequency spectrum resource on refresh path side, by the side on shortest path from G* (V*,
E* deleted in), add up the total time that service request scheme is established；
(11) point for colouring thread number is deleted from G* (V*, E*), refreshing G ' (V ', E ')；
(12) timeslice function is performed；
(16) method terminates；
Wherein, G (V, E) represents the physical topology of network, and V is node set, and E is line set；G* (V*, E*) represents that coloring is virtual
Topology, V* is coloring node set, and E* is coloring line set；G ' (V ', E ') available virtual topology is represented, V ' is available section point set
Close, E ' is available line set；R (i, j, nslot) is represented from node i to node j service request, needs nslot frequency band.
2. the route frequency spectrum distributing method that utilization multithreading according to claim 1 is realized, it is characterised in that
Described thread refers to that thread is one or more resources to the occupancy of resource using the unit of resource for resource collection
Set, thread in set resource all take or all without；
Described thread refers to that constraints is during resource use by multiple using the constraints consecutive variations of resource
The resource of thread is using forming and continuous dynamic change；
The relation with multiple dimensions refers between the resource that described single thread is used, and resource collection is by that can meet specific appoint
What the resource of multiple dimensions of business was determined.
3. the route frequency spectrum distributing method that utilization multithreading according to claim 1 is realized, it is characterised in that distribution
Route frequency spectrum when constraints be：The point or side being colored can not be made when multithreading is service request newdata link
With.
4. the route frequency spectrum distributing method that utilization multithreading according to claim 1 is realized, it is characterised in that described
Step also includes after (12)：
(13) R of refusallWhether R is reachedu, the upper limit is reached, all route frequency spectrum computational threads dormancy, long range thread is RlMeter
Route spectrum allocation schemes are calculated, step (2) is otherwise jumped to；
(14) it is RlRoute spectrum allocation schemes are calculated, until RlLess than Rd；
(15) service request then jumps to step (2) in R (i, j, nslot)；
Wherein, RlLong range service request number is represented, the long range service request refers to be rejected and hop count is more than threshold value
Service request；RuRepresent the long range service request upper limit；RdRepresent long range service request lower limit.
5. the route frequency spectrum distributing method that utilization multithreading according to claim 1 is realized, it is characterised in that the party
The calculation formula of the Time Delay Model of method is：
A(Nr)=T × (Nr/Nth+1)/2；
Wherein, NrRepresent service request number, NthThe number of thread is represented, T is expressed as a service request and sets up data link
Time delay, A (n) represent n service request average data link establishment time delay.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710595745.0A CN107181694B (en) | 2017-07-20 | 2017-07-20 | A kind of routing frequency spectrum distributing method realized with multithreading |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710595745.0A CN107181694B (en) | 2017-07-20 | 2017-07-20 | A kind of routing frequency spectrum distributing method realized with multithreading |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107181694A true CN107181694A (en) | 2017-09-19 |
| CN107181694B CN107181694B (en) | 2019-10-29 |
Family
ID=59838060
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710595745.0A Active CN107181694B (en) | 2017-07-20 | 2017-07-20 | A kind of routing frequency spectrum distributing method realized with multithreading |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107181694B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115887999A (en) * | 2022-12-26 | 2023-04-04 | 青鸟消防股份有限公司 | Fire control system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103338162A (en) * | 2013-07-09 | 2013-10-02 | 北京邮电大学 | Bidirectional asymmetric distribution method and device of frequency spectrum resources of optical network |
| CN103812790A (en) * | 2014-01-14 | 2014-05-21 | 河北工程大学 | Self-adapting modulation format RSA (Routing and Spectrum Allocation) method in flexible optical network |
| CN104320356A (en) * | 2014-09-25 | 2015-01-28 | 河北工程大学 | Partition-based spectrum allocation method |
| EP3014811A1 (en) * | 2013-06-24 | 2016-05-04 | NEC Laboratories America, Inc. | Network followed by compute load balancing procedure for embedding cloud services in software-defined flexible-grid optical transport networks |
-
2017
- 2017-07-20 CN CN201710595745.0A patent/CN107181694B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP3014811A1 (en) * | 2013-06-24 | 2016-05-04 | NEC Laboratories America, Inc. | Network followed by compute load balancing procedure for embedding cloud services in software-defined flexible-grid optical transport networks |
| CN103338162A (en) * | 2013-07-09 | 2013-10-02 | 北京邮电大学 | Bidirectional asymmetric distribution method and device of frequency spectrum resources of optical network |
| CN103812790A (en) * | 2014-01-14 | 2014-05-21 | 河北工程大学 | Self-adapting modulation format RSA (Routing and Spectrum Allocation) method in flexible optical network |
| CN104320356A (en) * | 2014-09-25 | 2015-01-28 | 河北工程大学 | Partition-based spectrum allocation method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115887999A (en) * | 2022-12-26 | 2023-04-04 | 青鸟消防股份有限公司 | Fire control system |
| CN115887999B (en) * | 2022-12-26 | 2024-02-27 | 青鸟消防股份有限公司 | Fire control system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107181694B (en) | 2019-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11463313B2 (en) | Topology-aware controller associations in software-defined networks | |
| CN103346922B (en) | The controller of determination network state based on SDN and determine method | |
| CN105933174B (en) | A kind of precomputation restoration methods based on apart from adaptive routing and frequency spectrum distribution | |
| US8705363B2 (en) | Packet scheduling method and apparatus | |
| CN107370673B (en) | Method, controller and system for establishing forwarding path in network | |
| CN104486194B (en) | A kind of more reliability step virtual network controls system and method | |
| JP7101274B2 (en) | Physical network element Node virtualization methods, appliances, equipment and storage media | |
| CN108476175B (en) | Transfer SDN traffic engineering method and system using dual variables | |
| US10554500B2 (en) | Modeling access networks as trees in software-defined network controllers | |
| KR101460048B1 (en) | Method and apparatus for control of dynamic service chaining by using tagging | |
| US20180069780A1 (en) | Network routing using dynamic virtual paths in an overlay network | |
| CN103746852A (en) | Service routing configuration method and network management equipment | |
| US11038816B2 (en) | Low level provisioning of network fabrics | |
| CN110351286A (en) | Link flood attack detects response mechanism in a kind of software defined network | |
| CN108337179A (en) | Link flow control method and device | |
| CN110278139A (en) | Method, the network equipment and the storage medium of grouping are forwarded in computer network | |
| CN105357124A (en) | MapReduce bandwidth optimization method | |
| WO2017136186A1 (en) | Mutually compatible path search | |
| CN105262534B (en) | A kind of method for routing and device suitable for satellite communication network | |
| CN106034071B (en) | Data message transmission method and edge route-bridge equipment | |
| US7836201B2 (en) | Methods and systems for providing efficient provisioning of data flows | |
| CN107181694B (en) | A kind of routing frequency spectrum distributing method realized with multithreading | |
| CN104917677A (en) | Data stream forwarding control method and system | |
| CN107689916A (en) | A kind of method and system for seeking complete risk sharing link group disjoint paths pair | |
| US9185042B2 (en) | System and method for automated quality of service configuration through the access network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |