CN101212289B - Time slot assignment method and network communication device - Google Patents
Time slot assignment method and network communication device Download PDFInfo
- Publication number
- CN101212289B CN101212289B CN200610064662A CN200610064662A CN101212289B CN 101212289 B CN101212289 B CN 101212289B CN 200610064662 A CN200610064662 A CN 200610064662A CN 200610064662 A CN200610064662 A CN 200610064662A CN 101212289 B CN101212289 B CN 101212289B
- Authority
- CN
- China
- Prior art keywords
- time slot
- unit packet
- module
- slot unit
- fragment
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The embodiment of the invention relates to a technical field of network communication and in particular discloses a method for distributing time slots. The invention includes the following processes:when a node receives a request message of time slot distribution of a service and searches for the usable time slots according to the request message; a 4n time slot unit grouping is taken as the searching object and every time slot is browsed in the 4n time slot unit grouping; if a usable time slot is found out, the usable time slot is distributed to the corresponding service of the request message; if the n is a integer greater than zero, capacity of the 4n time slot unit grouping is not less than the time slot capacity needed by the service. The embodiment of the invention also discloses anetwork communication device used for realizing the time slot distribution. By using the proposal of the invention, the reasonable distribution to the time slot can be realized; the generation of fragment time slots can be effectively reduces; the arrangement work for the time slot in the late stage can be avoided, thus reducing usage rate of additional spending of the system due to the arrangement of the fragment time slots.
Description
Technical field
The present invention relates to network communications technology field, relating to a kind of slot allocation method especially; The invention still further relates to the network communication equipment that is used to realize time slot allocation.
Background technology
Along with network interconnection technology and communication requirement fast development, ASON (Automatically Switched Optical Network has appearred, ASON) technology, ASON is an ASON of finishing a new generation of automatic function of exchange under routing and signaling control, also can be regarded as a kind of optical transfer network that possesses standardization intelligence.ASON is the optical fiber communication technology that occur last century, just begun extensive use by operator this century.With respect to traditional SDH network, ASON more can make full use of the resource of existing network, network management more efficiently and resist technology is provided, thereby cuts operating costs, for operator provides new profit growth point.
ASON uses RSVP (the resourcereservation setup protocol with traffic-engineering extensions at the traffic engineering expansion, RSVP-TE) finish label switched path (Label Switched Path, foundation LSP) or deletion.The process that RSVP-TE sets up LSP adopts Downstream on Demand distribution label mechanism, particularly, Ingress node is initiated Path message, carry request for current LSP binding tab, Ingress node sends Path message by intermediate node to the Egress node hop-by-hop, label is distributed one by one by downstream node, and Egress node sends Resv message by intermediate node to the Ingress node hop-by-hop then, and this Resv message is distributed one by one by downstream node.
When the intersection manager of node (Switch Controller, SC) receive the label distribution request of RSVP-TE after, need carry out the distribution of time interval resource, and then ask this node to set up interconnection.Because there are different cascade attributes in business, in order to reduce the situation that simultaneous hold takes place when distributing time slot for the business of different directions, the allocation strategy of different directions has been adopted in the distribution of time slot.So, after repeatedly distribution such as professional foundation, deletion, heavy-route, reclaiming time slot, can be used for the new business distributed time slot on the link and be easy to become discontinuous.When setting up standard cascade business, it is enough to be easy to occur the link idle bandwidth, but can not distribute the problem of corresponding cascade business time-slot.Here, so-called standard cascade refers to the timeslot number of standard code cascade, and promptly 1,4,16,64,256...... is the standard cascade, the initial time slot of standard cascade is 4
x(value of x is to be not less than zero natural number).For the standard cascade is professional, must distribute continuous time slot; For example, when x=0, promptly standard is cascaded as 1, may also be referred to as no cascade; When x=1, promptly standard is cascaded as 4, may also be referred to as 4 cascades, by that analogy.In addition, also have continuous cascade or cry any cascade, refer to and only require the use continuous slot, the number of cascade and initial time slot are all without limits.Therefore, for the standard cascade business that requires bigger numerical, for example, 64 standard cascade business, must correspondingly distribute 64 continuous slots, if link bandwidth is enough, but this moment " enough " be usually expressed as and have much situations scrappy, 64 continuous slots of less than, thereby influenced the time interval resource normal allocation of cascade business.
In order to address the above problem, existing technical scheme adopts the method for later stage fragment time slot arrangement, promptly when a large amount of discontinuous time slot occurring, user or webmaster are initiated the arrangement of fragment time slot, optimize order in manual mode or by using,, the fragment time slot that has occurred is adjusted according to the situation of the shared time slot of business, rearrange out continuous time slot, distribute for the cascade business.
Obviously, this technical scheme is a kind of method of afterwards remedying, its essence still can not be avoided the generation of fragment time slot, its shortcoming is that webmaster needs the frequent arrangement of carrying out the fragment time slot, but also to be optimized adjustment to original business again, not only taken a large amount of system resource, and whole implementation and operation is very complicated, inconvenient. in addition, this technical scheme also can face some limiting factors, such as link or node failure occur between fragment time slot Cleansing Period, this all might influence business.
Summary of the invention
In view of the existing problem of technique scheme, the purpose of the embodiment of the invention is to provide a kind of slot allocation method, another purpose of the embodiment of the invention is to provide a kind of network communication equipment that is used to realize time slot allocation, thereby realize reasonable distribution, and effective utilization of available time slot to time slot.
In order to achieve the above object, the technical scheme of the embodiment of the invention is achieved in that
The embodiment of the invention provides a kind of slot allocation method, and this method comprises:
When node receives professional time slot assignment request message, initiate searching of available time slot according to described request message, with 4
nThe time slot unit packet travels through described 4 as searching object
nEach time slot in the time slot unit packet if find available time slot, is then distributed to described available time slot described request message corresponding service; Described n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business.
The embodiment of the invention also provides a kind of network communication equipment, comprises that message sink module, time slot search module and time slot allocation module:
Described message sink module is used to receive professional time slot assignment request message, determines the business of required distribution time slot, and triggers described time slot and search searching of module initiation available time slot;
Described time slot is searched module, is used for the described time slot assignment request message that receives according to described message sink module, with 4
nThe time slot unit packet travels through described 4 as searching object
nEach time slot in the time slot unit packet finds out available time slot; Described n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business;
Described time slot allocation module is used for the described available time slot that finds is distributed to the time slot assignment request message corresponding service that described message sink module receives.
This shows, the embodiment of the invention is just to search available time slot to offer business and distribute when node receives time slot assignment request message, and the prior art scheme is when a large amount of discontinuous time slot occurring, the fragment time slot is adjusted, rearranged out continuous slot and offer business and distribute; And the embodiment of the invention is according to time slot assignment request, flexibly with 4
n(n is the integer greater than zero) time slot unit packet makes 4 as searching object
nThe capacity of time slot unit packet satisfies the required time slot capacity of described business all the time; Therefore, utilize the present invention program can realize reasonable distribution to time slot, and effective utilization of available time slot, the generation of fragment time slot reduced, avoided the fragment time slot housekeeping in later stage as far as possible, thereby reduced the utilization rate of being brought because of the defrag time slot system overhead.
Description of drawings
Accompanying drawing described herein is used to provide further understanding of the present invention, constitutes the application's a part, does not constitute limitation of the invention.In the accompanying drawings:
The slot allocation method flow chart of Fig. 1 embodiment of the invention one;
Fig. 2 is the structure time slot unit packet schematic diagram of the embodiment of the invention one;
Fig. 3 is the slot allocation method flow chart based on new business or optimization business of the embodiment of the invention two;
Fig. 4 is the slot allocation method flow chart based on professional heavy-route of the embodiment of the invention three;
Fig. 5 is the network communication equipment structure chart of the realization time slot allocation of the embodiment of the invention four;
Fig. 6 searches the structure chart of module for time slot in the embodiment of the invention four.
Embodiment
For the purpose, technical scheme and the advantage that make the embodiment of the invention is clearer,, the embodiment of the invention is described in further details below in conjunction with embodiment and accompanying drawing.At this, illustrative examples of the present invention and explanation thereof are used to explain the present invention, but not as a limitation of the invention.
The technical scheme of the embodiment of the invention is: by setting up the time slot unit packet, the time slot allocation algorithm is for the request for allocation of current business time slot, can consider from fragment time slot unit packet or complete idle time slot unit packet, to find available time slot, then described available time slot be distributed to the current request corresponding service.The method can realize the reasonable distribution to time slot, effectively utilized the time slot fragment, also suppressed the generation of new time slot fragment, avoided the fragment time slot housekeeping in later stage as far as possible, thereby reduced the utilization rate of being brought because of the defrag time slot system overhead.
For SDH equipment, because the different multiplex section protection of link possible configuration so time slot can be divided into the time slot segmentation of various attributes, comprises the working time slot segmentation, the segmentation of protection time slot, the segmentation of unprotect time slot.Professional shared time slot can only be in a kind of therein time slot segmentation.All use identical time slot allocation strategy when in a certain time slot segmentation, distributing time slot.The time slot allocation that is used to specify, it is not subjected to the constraint of time slot allocation mechanism.So-called time slot allocation algorithm, promptly by dividing the time slot unit packet, when time slot allocation, distribute the unit packet of having used as far as possible, reserve untapped, complete unit packet and use for the bigger business of cascade number, cascade is professional sets up and resource utilization and success rate during heavy-route thereby can improve.
Embodiment one:
As shown in Figure 1, Fig. 1 is the slot allocation method flow chart of the embodiment of the invention one, and concrete steps are as follows:
S101, generate time slot bit figure by the SC module.
When node receives the label distribution request message that signalling module issues, then this message needs SC module assignment time slot, and the SC module is at first searched the distribution state of specifying each time slot in the segmentation, and generates time slot bit figure.If the time slot that finds is in idle condition, can carry out time slot allocation, time slot bit figure respective value is 1, if the time slot that finds distributes, then time slot bit figure respective value is 0.
S102, present node are initiated time slot assignment request to the SC module, are the current business request and distribute available time slot.
After S103, SC module receive time slot assignment request, according to the business of time slot bit figure that calculates generation among the step S101 and the distribution of the request among step S102 time slot, structure time slot unit packet.The time slot unit packet is the time slot of time slot bit diagram cascade, and wherein, the timeslot number in the time slot unit packet is 4
n, n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business.
Define 4 in the embodiment of the invention
nBe the time slot group capacity. as shown in Figure 2, Fig. 2 is the structure time slot unit packet schematic diagram of the embodiment of the invention one. the time slot of bandwidth capacity adds up to 64 among the time slot bit figure, number of time slot in the time slot unit packet can be 4 so, if also can be that number of time slot in 16, the 32 or 64. current time slots unit packet is 4 o'clock, then based on whole number of timeslots, the number of time slot unit packet is 16, time slot unit packet capacity is 4 time slots, each time slot unit packet will be by label successively: 1,2,3,4, ... 14,15,16; If the number of time slot in the current time slots unit packet is 16 o'clock, then based on whole number of timeslots, the number of time slot unit packet is 4, and time slot unit packet capacity is 16 time slots, and each time slot unit packet will be by label successively: 1,2,3,4; If the number of time slot in the current time slots unit packet is 64, and the time slot sum of bandwidth capacity is exactly 64, then the number of time slot unit packet is 1, time slot unit packet capacity is 64 time slots, this time slot unit packet will be that the 1. time slot sums for bandwidth capacity are situations of 256,1024 etc. by label, then can obtain the number of corresponding time slot unit packet capacity and time slot unit packet by that analogy.
The time slot unit packet is divided into fragment time slot unit packet again according to the occupancy of time slot in the current group, complete idle time slot unit packet, three types of no available time slot unit packet.If all the time slot bit values in the current group are complete 1, promptly all time slots all are in idle condition, and then current group is complete idle time slot unit packet; If all time slots in the current group are complete 0, promptly all time slots are all taken by business, and then current time slots is grouped into no available time slot unit packet; If the bit value of the part time slot in the current group is 0, the bit value of part time slot is 1, and promptly the part time slot is taken by business, and the part time slot is in idle condition, and then current time slots is grouped into fragment time slot unit packet.Obviously, only in fragment time slot unit packet and complete idle time slot unit packet, just can find bit value and be 1 time slot, can get access to and distribute to professional available time slot.
S104, with step S103 generate 4
nThe time slot unit packet travels through 4 one by one as searching object
nEach time slot in the time slot unit packet judges whether to find available time slot.If the process in traversal time slot unit packet finds available time slot, in other words find the unit packet at available time slot place, then preserve the label of current available time slot place time slot unit packet, next to step S105; This time slot unit packet if traversal finishes does not find available time slot, next to step S106.
The probability of time slot simultaneous hold takes place when setting up for the business that reduces different directions, and in time slot allocation, the SC module will compare according to the NodeID of the NodeID of this node and downstream node and decide which time slot unit packet as initially searching object.If the NodeID of this node is bigger than the NodeID of downstream node,, adopt numeric order from small to large to choose the time slot unit packet as initially searching object, the reallocation time slot then for the time slot allocation order of this node; If the NodeID of this node is littler than the NodeID of downstream node, then, on the contrary, adopt numeric order from big to small to choose the time slot unit packet as initially searching object, the reallocation time slot for the time slot allocation order of this node.For example, the time slot unit packet capacity of node A and Node B is got 4 time slots of minimum value, simultaneously, each time slot unit packet of this node is put on sequence number, and promptly 1,2,3 ... 14,15,16.If the NodeID of node A is greater than the NodeID of Node B, then node A takes from 1 to 16 numeric order mode, is that 1 time slot unit packet is as initially searching object with sequence number; And Node B is taked from 16 to 1 numeric order mode, is that 16 time slot unit packet is as initially searching object with sequence number.
S105, SC module are returned the available time slot lookup result to node, and this node is distributed to described request message corresponding service with described available time slot, time slot allocation success so far.
S106, according to the business that the time slot bit figure that generates and request distribute time slot, judge whether to construct new time slot unit packet.If can construct, then be back to step S103, set the new time slot unit packet of another number of time slot structure, and will this new time slot unit packet as the new object of searching, search available time slot again.Here, according to actual conditions, can be 4 with number of time slot
N+1The time slot unit packet search object as the next one, until 4
N+mFind available time slot in the time slot unit packet, described m is the integer greater than zero, and described n+1 is not more than described n+m, described 4
N+1The capacity of time slot unit packet and described 4
N+mThe capacity of time slot unit packet is all greater than the required time slot capacity of described business; Can be 4 perhaps with number of time slot
N-1The time slot unit packet search object as the next one, until 4
N-mFind available time slot in the time slot unit packet, described m is the integer greater than zero, and described n-1 and described n-m are the integer greater than zero, and described n-1 is not less than described n-m, described 4
N-1The capacity of time slot unit packet and described 4
N-mThe capacity of time slot unit packet all is not less than the required time slot capacity of described business.If can not construct new time slot unit packet, promptly in the entire belt tolerance, do not find to be fit to professional available time slot, then next to step S107.
S107, the required available time slot of the business of not finding, then time slot allocation failure.
The embodiment of the invention one can preferentially use available time slot in the fragment time slot unit packet as the resource of time slot allocation, thereby avoids producing new time slot fragment, and has improved efficiency of resource; This method generally is applied to newly-built or optimizes when professional.Also can preferentially use available time slot in the complete idle time slot unit packet as the resource of time slot allocation, when this method generally is applied to professional heavy-route, can makes business obtain heavy-route rapidly, and reduce the generation of new time slot fragment.For the mode of searching of these two kinds of available time slot, following will being described in detail from embodiment two, three.
Embodiment two:
Earlier with the time slot unit packet of less number of time slot as searching object, again with the time slot unit packet of big number of time slot as searching object, search the fragment time slot of the business can distributed to.As shown in Figure 3, Fig. 3 is the slot allocation method flow chart based on new business or optimization business of the embodiment of the invention two.
S201 and aforesaid step S101 content are similar, repeat no more herein.
S202, present node are initiated new business or are optimized professional time slot assignment request to the SC module.
After S203, SC module receive new business or optimize professional time slot assignment request, the business of distributing time slot according to the time slot bit figure that calculate to generate among the step S201 and the request among the step S202 begins to construct the time slot unit packet from the time slot unit packet of less number of time slot.In the present embodiment, be 4 with number of time slot
nStructure time slot unit packet, n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business.
S204, with step S203 generate 4
nThe time slot unit packet travels through each time slot in this time slot unit packet one by one as searching object, judges whether to find the fragment time slot.If in the process of traversal time slot unit packet, find the fragment time slot, in other words find the unit packet at fragment time slot place, then preserve the label of this time slot unit packet, next to step S205; If traversal finishes 4
nThe time slot unit packet does not find the fragment time slot, next to step S206.
S205, SC module are returned the time slot lookup result to node, and this node is given the request message corresponding service with the fragment time slot allocation, and so far whole time slot allocation process finishes.
S206, according to the business that the time slot bit figure that generates and request distribute time slot, judge whether to construct new time slot unit packet.If can construct, then be back to step S203, with number of time slot 4
N+1(n+1 is the integer greater than zero) time slot unit packet that structure is new, and with this 4
N+1The time slot unit packet is searched the fragment time slot again as the new object of searching; If still search less than the fragment time slot, then increase progressively 1 mode with n, determine that the next one searches object, until 4
N+mFind the fragment time slot in the time slot unit packet.Be not fit to professional available time slot if in the entire belt tolerance, find, then next to step S207.
S207, search then time slot allocation failure less than the required available time slot of business.
According to the content of step S201 to step S207, illustrate: the time slot of bandwidth capacity adds up to 64 time slots (being that the time slot bit diagram is expressed as 64 bits), because request distributes the business of the business of time slot for no cascade, be 4 structure time slot unit packet then by minimum number of time slot, soon per 4 bits are divided into a time slot unit packet in the bit diagram, and 16 time slot unit packet are so just arranged.As searching object, travel through each time slot in this time slot unit packet with 4 bit groupings one by one, judge whether to find the fragment time slot.If find the fragment time slot, then in 4 bit groupings at this fragment time slot place, distribute 1 time slot in order, the time slot allocation success.If each 4 bit groupings of searching are complete idle time slot unit packet or are no available time slot unit packet, then search failure with 4 bit groupings as searching object; Then with 4
2Bit groupings (i.e. 16 bit groupings) is searched object as the next one, with aforementioned similar, if find the fragment time slot, then in current 16 bit groupings, distribute 1 time slot in order, the time slot allocation success. if each 16 bit groupings of searching are complete idle time slot unit packet or are no available time slot unit packet, then 16 bit groupings are searched failure as searching object. because in this example, the time slot of bandwidth capacity adds up to 64 time slots, so 64 bit groupings are the time slot unit packet of the maximum of structure, its search procedure and aforesaid similar repeats no more herein.
At this, need to prove, if business is 4 cascades of standard cascade business, then at first construct 4 time slot unit packet or 4
2Time slot unit packet (i.e. 16 bit groupings) if business is standard cascade 16 cascades, then at first constructs 4 as searching object
2Time slot unit packet or 4
3Time slot unit packet (i.e. 64 bit groupings) is as searching object, and 64 cascades, 256 cascades or 1024 cascades etc. are professional, and the rest may be inferred.Necessary combined belt tolerance size of capacity and the professional required bandwidth of determining the time slot unit packet are definite.For example, the time slot of bandwidth capacity adds up to 64 (i.e. 64 bits), and business is 64 standard cascade business, at this moment, construct 64 time slot unit packet, judge whether this unit packet is complete idle time slot unit packet as searching object, if, then directly distribute time slot, otherwise the time slot allocation failure.
Embodiment three:
Earlier with the time slot unit packet of big number of time slot as searching object, again with the time slot unit packet of less number of time slot as searching object, search the available time slot that business is distributed in time slot conduct in the complete idle time slot unit packet.As shown in Figure 4, Fig. 4 is the slot allocation method flow chart based on professional heavy-route of the embodiment of the invention three.
S301 and aforesaid step S101 content are similar, repeat no more herein.
S302, present node are initiated the time slot assignment request of professional heavy-route to the SC module.
After S303, SC module receive the time slot assignment request of professional heavy-route, business according to time slot bit figure that calculates generation among the step S301 and the distribution of the request among step S302 time slot begins to construct the time slot unit packet from the time slot unit packet than big number of time slot.In the present embodiment, with number of time slot 4
nStructure time slot unit packet, n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business.
S304, with 4 of step S303 structure
nThe time slot unit packet judges whether this unit packet is complete idle time slot unit packet earlier, if then the time slot in this complete idle time slot unit packet is as time slot to be allocated, next to step S305 as the initial object of searching; If not, next to step S306.
S305, SC module are returned the time slot lookup result to node, and this node is distributed to the request message corresponding service with the available time slot in the complete idle time slot unit packet, and so far whole time slot allocation process finishes.
S306, judgement 4
nWhether unit packet is no available time slot unit packet entirely, if, then next to step S307; Otherwise this unit packet is a fragment time slot unit packet, goes to step S303, with number of time slot 4
N-1Construct new time slot unit packet, and with this 4
N-1The time slot unit packet is searched available time slot again as the new object of searching; If these are 4 years old
N-1The time slot unit packet still belongs to fragment time slot unit packet, then determines that in n 1 the mode of successively decreasing the next one searches object, until determining 4
N-mThe time slot unit packet is complete idle time slot unit packet, perhaps 4
N-mThe time slot unit packet is the last object of searching, and finds assignable fragment time slot in this unit packet.If in the process of each time slot unit packet of traversal, do not find to be fit to professional available time slot, then next to step S307, the time slot allocation failure.
S307, search then time slot allocation failure less than the required available time slot of business.
According to the content of step S301 to step S307, illustrate: the time slot of supposing bandwidth capacity adds up to 64 time slots (being that the time slot bit diagram is expressed as 64 bits), it is no cascade business that request distributes the business of time slot, owing to be professional heavy-route, is 4 with number of time slot then
3The structure time slot unit packet (64 bit). with 64 time slot unit packet as searching object, directly judge whether this unit packet is complete idle time slot unit packet, if, then get the 1st time slot or the 64th time slot as time slot to be allocated according to the order of selecting, give the traffic assignments time slot. if not, judge whether to be no available time slot unit packet again, if, then time slot allocation failure. otherwise, search object with 16 bit groupings as the next one, 4 16 bit groupings are arranged this moment, travel through each unit packet and search available time slot. because the business in this example is no cascade business, so 4 bit groupings are the time slot unit packet of the minimum of structure, structure 16,4 time slot unit packet are as the concrete search procedure of searching object and aforesaid similar, if repeat no more herein. in 16 4 bit groupings still neither one belong to complete idle time slot unit packet, then give 1 time slot of traffic assignments in order.
Embodiment four:
Except the embodiment of foregoing description method, the embodiment of the invention also provides a kind of network communication equipment, and this equipment comprises that message sink module, time slot search module and time slot allocation module.As shown in Figure 5, Fig. 5 is the network communication equipment structure chart of the realization time slot allocation of the embodiment of the invention four.
Described message sink module is used to receive professional time slot assignment request message, determines the business of required distribution time slot, and triggers described time slot and search searching of module initiation available time slot.
Described time slot is searched module, is used for the described time slot assignment request message that receives according to described message sink module, with 4
nThe time slot unit packet travels through described 4 as searching object
nEach time slot in the time slot unit packet finds out available time slot; Described n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business;
Described time slot allocation module is used for the described available time slot that finds is distributed to the time slot assignment request message corresponding service that described message sink module receives.
As shown in Figure 6, Fig. 6 searches the structure chart of module for time slot in the embodiment of the invention four.Time slot is searched module and is comprised time slot state module, time slot bit figure generation module, time slot unit packet constructing module and available time slot determination module again:
Described time slot state module is used to put down in writing described 4
nThe current user mode of each time slot in the time slot unit packet;
Described time slot bit figure generation module, be used for according to described time slot state module put down in writing described 4
nThe time slot user mode of time slot unit packet generates corresponding time slot bit figure;
Described time slot unit packet constructing module is used for the business of the required distribution time slot that the bit diagram that generates according to described time slot bit figure generation module and described message sink module determine, constructs described 4
nThe time slot unit packet;
Described available time slot determination module is used for according to described 4 of described time slot unit packet constructing module structure
nThe time slot unit packet is searched and is determined available time slot.
Because time slot assignment request message comprises new business, optimizes types such as business, professional heavy-route; So network communication equipment in conjunction with professional required amount of bandwidth and bandwidth total capacity, is done corresponding time slot allocation according to different time slot assignment request message.Its concrete distribution implementation method has been done detailed description in the foregoing embodiments, repeats no more herein.
In sum, the embodiment of the invention is applicable to standard cascade business, also is applicable to any cascade business; According to time slot assignment request, flexibly with 4
n(n is the integer greater than zero) time slot unit packet makes 4 as searching object
nThe capacity of time slot unit packet satisfies the required time slot capacity of described business all the time; Therefore, utilize the present invention program can realize reasonable distribution to time slot, and effective utilization of available time slot, the generation of fragment time slot reduced, avoided the fragment time slot housekeeping in later stage as far as possible, thereby reduced the utilization rate of being brought because of the defrag time slot system overhead.
Above-described specific embodiment; purpose of the present invention, technical scheme and beneficial effect are further described; institute is understood that; the above only is specific embodiments of the invention; and be not intended to limit the scope of the invention; within the spirit and principles in the present invention all, any modification of being made, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (9)
1. a slot allocation method is characterized in that, this method comprises:
When node receives professional time slot assignment request message, initiate searching of available time slot according to described request message, with 4
nThe time slot unit packet travels through described 4 as searching object
nEach time slot in the time slot unit packet if find available time slot, is then distributed to described available time slot described request message corresponding service; Described n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business.
2. slot allocation method according to claim 1 is characterized in that, described request message comprises the time slot assignment request message that is used for new business, the time slot assignment request message that is used to optimize professional time slot assignment request message and is used for heavy-route.
3. slot allocation method according to claim 2 is characterized in that, when node receives describedly when being used for new business or optimizing professional time slot assignment request message, searches described available time slot and specifically comprises:
With described 4
nThe time slot unit packet travels through described 4 as the current object of searching
nEach time slot in the time slot unit packet judges described 4
nWhether the time slot unit packet exists the fragment time slot, if find the fragment time slot, then with described 4
nFragment time slot in the time slot unit packet distributes; If do not find described fragment time slot, then with 4
N+1The time slot unit packet travels through described 4 as the Next object of searching
N+1If each time slot in the time slot unit packet is described 4
N+1Search in the time slot unit packet less than the fragment time slot, then increase progressively 1 mode and determine that the next one searches object, until 4 with n
N+mFind the fragment time slot in the time slot unit packet, then with described 4
N+mFragment time slot in the time slot unit packet distributes; Described m is the integer greater than zero, and described n+1 is not more than described n+m, described 4
N+1The capacity of time slot unit packet and described 4
N+mThe capacity of time slot unit packet is all greater than the required time slot capacity of described business.
4. slot allocation method according to claim 2 is characterized in that, when node receives the described time slot assignment request message that is used for heavy-route, searches described available time slot and specifically comprises:
With described 4
nThe time slot unit packet travels through described 4 as the current object of searching
nEach time slot in the time slot unit packet, and judge the current state of this time slot, if described 4
nEach time slot in the time slot unit packet is unoccupied, then with described 4
nUnappropriated time slot distributes in the time slot unit packet; If described 4
nThere is the fragment time slot in the time slot unit packet, then with 4
N-1The time slot unit packet travels through described 4 as the Next object of searching
N-1If each time slot in the time slot unit packet is described 4
N-1There is the fragment time slot in the time slot unit packet, then determines that in n 1 the mode of successively decreasing the next one searches object, until 4
N-mIt is unoccupied to find each time slot in the time slot unit packet, then with described 4
N-mUnappropriated time slot distributes in the time slot unit packet; Described m is the integer greater than zero, and described n-1 and described n-m are the integer greater than zero, and described n-1 is not less than described n-m, described 4
N-1The capacity of time slot unit packet and described 4
N-mThe capacity of time slot unit packet all is not less than the required time slot capacity of described business.
5. according to claim 3 or 4 described slot allocation methods, it is characterized in that judge whether exist the fragment time slot to be specially in the time slot unit packet:
In traversal time slot unit packet, judge the current state of this time slot in each time slot,, determine that then remaining unappropriated time slot is the fragment time slot in this time slot unit packet if a part of time slot in the time slot unit packet is occupied; If each time slot in the time slot unit packet is occupied or unoccupied, determine that then there is not the fragment time slot in this time slot unit packet.
6. slot allocation method according to claim 5 is characterized in that, this method specifically comprises: the current state according to each time slot in the time slot unit packet generates time slot bit figure, if 1 expression time slot current state determines that then this time slot is unoccupied; If 0 expression time slot current state determines that then this time slot is occupied.
7. slot allocation method according to claim 1 is characterized in that, when finding available time slot in the time slot unit packet, distributes described available time slot specifically to comprise:
The ID of present node and the ID of downstream node are compared, if the ID of present node during greater than the ID of downstream node, then distributes to the current request corresponding service by the time slot sequence number with ascending selective sequential available time slot; If the ID of present node during less than the ID of downstream node, then distributes to the current request corresponding service by the time slot sequence number with descending selective sequential available time slot.
8. a network communication equipment is characterized in that, comprises that message sink module, time slot search module and time slot allocation module:
Described message sink module is used to receive professional time slot assignment request message, determines the business of required distribution time slot, and triggers described time slot and search searching of module initiation available time slot;
Described time slot is searched module, is used for the described time slot assignment request message that receives according to described message sink module, with 4
nThe time slot unit packet travels through described 4 as searching object
nEach time slot in the time slot unit packet finds out available time slot; Described n is the integer greater than zero, described 4
nThe capacity of time slot unit packet is not less than the required time slot capacity of described business;
Described time slot allocation module is used for the described available time slot that finds is distributed to the time slot assignment request message corresponding service that described message sink module receives.
9. network communication equipment according to claim 8 is characterized in that, described time slot is searched module and comprised time slot state module, time slot bit figure generation module, time slot unit packet constructing module and available time slot determination module:
Described time slot state module is used to put down in writing described 4
nThe current user mode of each time slot in the time slot unit packet;
Described time slot bit figure generation module, be used for according to described time slot state module put down in writing described 4
nThe time slot user mode of time slot unit packet generates corresponding time slot bit figure;
Described time slot unit packet constructing module is used for the business of the required distribution time slot that the bit diagram that generates according to described time slot bit figure generation module and described message sink module determine, constructs described 4
nThe time slot unit packet;
Described available time slot determination module is used for according to described 4 of described time slot unit packet constructing module structure
nThe time slot unit packet is searched and is determined available time slot.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610064662A CN101212289B (en) | 2006-12-30 | 2006-12-30 | Time slot assignment method and network communication device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200610064662A CN101212289B (en) | 2006-12-30 | 2006-12-30 | Time slot assignment method and network communication device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101212289A CN101212289A (en) | 2008-07-02 |
| CN101212289B true CN101212289B (en) | 2010-05-12 |
Family
ID=39611999
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200610064662A Expired - Fee Related CN101212289B (en) | 2006-12-30 | 2006-12-30 | Time slot assignment method and network communication device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101212289B (en) |
Families Citing this family (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101924597B (en) * | 2009-06-15 | 2014-02-05 | 中兴通讯股份有限公司 | Time slot allocating method and device for solving label fragments |
| CN102025419B (en) * | 2009-09-16 | 2014-11-05 | 中兴通讯股份有限公司 | Method and single board for adjusting time slot of full service |
| CN102223684B (en) * | 2010-04-19 | 2014-03-05 | 中国移动通信集团设计院有限公司 | Time slot resource distribution method and device |
| CN102487304B (en) * | 2010-12-02 | 2014-11-05 | 中兴通讯股份有限公司 | Method and device for detecting residual time slot |
| CN102487303B (en) * | 2010-12-06 | 2015-08-26 | 中兴通讯股份有限公司 | Time slot distribution management method and device |
| CN103327501B (en) * | 2013-05-17 | 2016-01-20 | 北京邮电大学 | Based on the resource allocation methods of distributed fragment concentration degree |
| CN110661589B (en) * | 2019-09-27 | 2021-04-23 | 中国航空无线电电子研究所 | Time slot allocation scheduling method based on switched time-triggered network |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5953344A (en) * | 1996-04-30 | 1999-09-14 | Lucent Technologies Inc. | Method and apparatus enabling enhanced throughput efficiency by use of dynamically adjustable mini-slots in access protocols for shared transmission media |
| CN1790961A (en) * | 2005-12-29 | 2006-06-21 | 中兴通讯股份有限公司 | Wireless communication system channel adjusting method based on orthogonal variable spread-spectrum factor code |
| CN1852609A (en) * | 2006-01-09 | 2006-10-25 | 华为技术有限公司 | Physical random access-in channel access-in resource distribution strategy |
-
2006
- 2006-12-30 CN CN200610064662A patent/CN101212289B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5953344A (en) * | 1996-04-30 | 1999-09-14 | Lucent Technologies Inc. | Method and apparatus enabling enhanced throughput efficiency by use of dynamically adjustable mini-slots in access protocols for shared transmission media |
| CN1790961A (en) * | 2005-12-29 | 2006-06-21 | 中兴通讯股份有限公司 | Wireless communication system channel adjusting method based on orthogonal variable spread-spectrum factor code |
| CN1852609A (en) * | 2006-01-09 | 2006-10-25 | 华为技术有限公司 | Physical random access-in channel access-in resource distribution strategy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101212289A (en) | 2008-07-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101212289B (en) | Time slot assignment method and network communication device | |
| Abkenar et al. | Study and analysis of routing and spectrum allocation (RSA) and routing, modulation and spectrum allocation (RMSA) algorithms in elastic optical networks (EONs) | |
| Xiao et al. | Algorithms for allocating wavelength converters in all-optical networks | |
| Chu et al. | A dynamic RWA algorithm in a wavelength-routed all-optical network with wavelength converters | |
| CA2191057C (en) | Bandwith correlation means for paths in connection-oriented packet switching networks | |
| JP3793189B2 (en) | Dynamic bandwidth allocation method using tree algorithm and Ethernet (registered trademark) passive optical subscriber network using the same | |
| CN106953710B (en) | The method for routing of the distribution of minimum cost frequency spectrum and fragment perception in elastic optical network | |
| CN103051547A (en) | Routing and spectrum resource allocation method and system for resource awareness in elastic optical path network | |
| Liu et al. | Temporal and spectral 2D fragmentation-aware RMSA algorithm for advance reservation requests in EONs | |
| CN101686177A (en) | Dynamic bandwidth allocation method, equipment and system of multi-service transport network | |
| CN101459589B (en) | Method and device for distributing network resource | |
| Bohm et al. | Fast circuit switching for the next generation of high performance networks | |
| Kiaei et al. | Efficient scheduling and grant sizing methods for WDM PONs | |
| US6301267B1 (en) | Smart switch | |
| CA2028142C (en) | Time division multiplexer/demultiplexer with deterministic time slot assignment | |
| CN113489617B (en) | Minimum network energy consumption optimization method and system based on traffic grooming | |
| CN112995805B (en) | Routing and spectrum allocation method based on path idleness in EON | |
| CN108616782A (en) | A kind of frequency spectrum distributing method based on the optimization of non-intersecting connection group in elastic optical network | |
| Khandaker et al. | Statistical sharing of primary and back-up capacity in survivable elastic optical networks | |
| Liu et al. | Joint jobs scheduling and routing for metro-scaled micro datacenters over elastic optical networks | |
| CN102348138B (en) | Collision avoidance wavelength assignment method based on PCE (Personal Computer Equipment) | |
| CN101753450A (en) | Method for joint optimization of resources in three-layered network | |
| CN101218846B (en) | A method for coordinating automatic switched optical network link resource | |
| CN111586880A (en) | Dynamic hybrid access method and system suitable for TDMA | |
| CN100459770C (en) | Method for improving interface bandwidth utilization rate between wireless network controller and base-station |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20100512 Termination date: 20171230 |