CN100440793C - Method for accomplishing resource regulation in phototiming digital transmission network - Google Patents

Method for accomplishing resource regulation in phototiming digital transmission network Download PDF

Info

Publication number
CN100440793C
CN100440793C CNB031236006A CN03123600A CN100440793C CN 100440793 C CN100440793 C CN 100440793C CN B031236006 A CNB031236006 A CN B031236006A CN 03123600 A CN03123600 A CN 03123600A CN 100440793 C CN100440793 C CN 100440793C
Authority
CN
China
Prior art keywords
chest
chests
business
new
resource
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
Application number
CNB031236006A
Other languages
Chinese (zh)
Other versions
CN1549506A (en
Inventor
敖奇
刘亮
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CNB031236006A priority Critical patent/CN100440793C/en
Publication of CN1549506A publication Critical patent/CN1549506A/en
Application granted granted Critical
Publication of CN100440793C publication Critical patent/CN100440793C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The present invention discloses a method for accomplishing resource regulation in a phototiming digital transmission network. The method comprises the following procedures: a) a group of service mapped blocks having a binding relationship is respectively arranged in a VC4 box; b) after all services are arranged in the VC4 boxes, all VC4 boxes are detected, and every two VC4 boxes are compared one by one to judge whether the current two compared VC4 boxes meet a combined condition or not; in case the two compared VC4 boxes meet the combined condition, a new VC4 box is generated, and all services in the current two compared VC4 boxes are arranged in the new VC4 box; otherwise, procedure c is carried out; c) whether the combination of all VC4 boxes is checked or not is judged; in case the combination is checked, the process ends; otherwise, the procedure b is carried out. Multiple service optimization is realized by using the method, so that the service having the binding relationship is orderly ranged as much as possible, and accordingly, the occupation of VC4 resource is reduced.

Description

A kind of method that realizes that resource is adjusted in the Optical synchronization digital transmission network
Technical field
The present invention relates to the network multi-service optimisation technique, relate in particular to a kind of the transmission and realize the method that resource is adjusted in the net in the net at Optical synchronization digital (SDH).
Background technology
For the transmission network of an operation, how fully, effectively utilize Internet resources, just how to carry out multiple services optimization to admit more business, be one of key issue that improves network efficiency and capacity.Transmit in the net specific to Optical synchronization digital (SDH), can be with the service optimization problem qualitative description in the SDH net: under the situation of known physical network and traffic matrix, reasonable distribution resource how takies to reach that the Internet resources total amount is minimum, NLB, makes the surplus resources in the network can satisfy in the future more traffic growth and use four minimum optimization aim of low order interlace algorithm resource.
SDH transmits the service optimization process of net, generally is divided into two stages of route assignment and resource allocation.Therefore, the inventor had once proposed a kind of method by route assignment realization SDH transmission net multi-business optimization respectively in two other patent application, and a kind of method that with the route assignment is the basis by resource allocation realization SDH transmission net multi-business optimization.Wherein, the realization thought of multi-business optimization method is in the last patent application: transmit the characteristics that net is made of ring according to SDH, be divided into different subnets with transmitting net by ring, and the load balance adjustment of the whole network is decomposed into adjusts in each the annular subnet that carries out according to professional route and the whole adjustment of the whole network, thereby make the adjustment of the whole network simpler, efficiently, factor by further analyzing influence load balance again, can't carry out being in network edge and separating of balance, guarantee to take the balance of the minimum and offered load of offered load with the subnet that network has only a link to link to each other.The realization thought of multi-business optimization method is in one patent application of back: the characteristics that transmit net according to SDH, network is divided into annular subnet, on the basis that route assignment realizes, carry out relatively independent resource allocation in each subnet, the computational efficiency of carrying out resource allocation with raising; In each subnet, business demand is mapped to different solids then, mate again, merge, promptly pressing high-order or low order refinement distributes, not only solved the problem of low order interlace algorithm resource limit preferably, and reflected to have under the time slot continuity constraint condition well, how to measure the good and bad situation of resource allocation result, thereby finish optimization aim.
The implementation of above-mentioned service optimization mainly is that the optimization with whole network is converted into the resource allocation of carrying out in each subnet inside.For the time interval resource of SDH, mainly be divided into high-order and low order two classes according to its mapping structure, general high-order refers to VC4, low order refers to VC12.Because in resource allocation process, solve the low order interlace algorithm restriction and just must carry out transaction according to rules, just require in same VC4, to be distributed the low order resource and carry out transaction according to rules, like this, just increased a kind of binding constraints relation between this part business by regular business.If directly carry out follow-up low order resource allocation,, may take too much VC4 resource, even cause the VC4 resource to be overflowed because the adjustment of this part binding business is relatively more difficult.
Summary of the invention
In view of this, main purpose of the present invention is to provide a kind of method that realizes that resource is adjusted in the Optical synchronization digital transmission network, makes the business marshalling as far as possible with binding relationship, and then reduces taking of VC4 resource.
For achieving the above object, technical scheme of the present invention is achieved in that
A kind of method that realizes that resource is adjusted in the Optical synchronization digital transmission network, this method may further comprise the steps:
A. will have the packaged of one group of binding relationship professional mapping respectively goes in the VC4 chest;
B. after the professional piece that shines upon is placed into different VC4 chests with all according to binding relationship, travel through all VC4 chests, one by one per two VC4 chests are compared, whether two VC4 chests judging current comparison satisfy the merging condition, if, then generate a new VC4 chest, and with the packaged new VC4 chest of going into described generation of the business in two VC4 chests of current comparison mapping; Otherwise, enter step c;
C. judge whether to check out all VC4 chest combinations, if, process ends then; Otherwise, return step b.
Wherein, all VC4 chests of the traversal described in the step b are to travel through all to comprise the VC4 chest of one group of business module.
It is whether two VC4 chests judging current comparison satisfy following three conditions simultaneously that judging whether described in the step b satisfied the merging condition:
1) one group of business module in each VC4 chest all has side alignment in the longitudinal direction, and the business module in two VC4 chests to be combined must be the first from left Right Aligns;
2) two VC4 chests common factor non-NULL in the horizontal direction, and be both proper subclass simultaneously;
3) two VC4 chests can be finished the low order time slot allocation in the union space in the horizontal direction.
The new VC4 chest of generation described in the step b is the new VC4 chest of width generation by two VC4 chest horizontal direction unions of current comparison.
The packaged new VC4 chest of going into described generation with business mapping described in the step b is to move the mode that all business modules go to fill space in another VC4 chest in the VC4 chest, all business modules that comprise in two VC4 chests with current comparison new VC4 chest of all packing into, and be that each business module distributes the low order time interval resource.
For each VC4 chest, directly the VC4 chest with first the satisfied merging condition that is found merges among the step b; Or for each VC4 chest, with the satisfied merging condition that is found and take the minimum VC4 chest of VC4 resource after merging and merge.
In such scheme, the VC4 chest that is traveled through can be through merging the new VC4 chest that generates.
Therefore, the method that resource is adjusted in the realization Optical synchronization digital transmission network provided by the present invention, by traveling through all the VC4 chests in the subnet, find two VC4 chests that can merge, all professional pieces that shine upon are wherein merged, can make business marshalling as far as possible, thereby improve optimization efficiency, reduce taking of VC4 resource with binding relationship.
Description of drawings
Fig. 1 is positioned over an embodiment schematic diagram of different VC4 chests for a plurality of business;
Fig. 2 is the schematic diagram after the VC4 chest among Fig. 1 is merged;
The flow chart that Fig. 3 realizes for the inventive method.
Embodiment
The invention will be further described below in conjunction with the drawings and specific embodiments.
Transmit in the net at SDH, any two internodal whole business are called a business unit, and usually, business unit is unit with VC12, and so, the number of the shared VC12 of each business unit just is called the size of business unit.
Usually can regard a subnet as a container, then this container can be described as the subnet container, the subnet container is layering, every layer has a VC4 numbering, a VC4 resource of corresponding physical subnets, the number of plies of subnet container is defined as the height of subnet container, is in course of adjustment, and the height of subnet container is arbitrarily.Referring to shown in Figure 1, it is 3 subnet container 10 that Fig. 1 represents a height, and this subnet container 10 is that unit is divided into three layers with VC4, and every layer numbering is respectively VC4-1~VC4-3, three VC4 resources of corresponding physical subnets.In each VC4 layer, different business is deposited with the citation form of Block piece, that is to say, the Block piece is a rectangular vessel that is used to put or a part of business unit.Such as: three rectangles of filling with positive oblique line among the VC4-1 are three Block pieces, are placed with three business respectively, that is: business 1, professional 2 and professional 3; Equally, three rectangles of filling with backslash among the VC4-2 also are three Block pieces, also are placed with three business respectively, that is: business 4, professional 5 and professional 6.Block piece with same characteristic features can be combined to a Block piece group, a Block piece group also can be described as a VC4 chest, each VC4 chest is a jumping or the long VC4 pipeline of a few jumping, is to be used for placing professional permanent high rectangular vessel, and it is to customize according to the size of business unit and length.Such as: label is that two parts of 101 and 102 are two VC4 chests among Fig. 1, is placed with three business in each VC4 chest.One jumping and only to be meant through two nodes here, several jumpings be meant through two above nodes, such as: the NE1~NE6 among Fig. 1 represents six nodes in this subnet, is a jumping between NE1 and the NE2, is double bounce between NE1 and the NE3, so analogizes.Free space between each VC4 chest is commonly referred to as space (Gap), also can be seen as not contain professional empty VC4 chest, and unfilled space is the space among Fig. 1.
Based on the definition of above-mentioned subnet container, VC4 chest and Block piece, the process of business configuration can the image be described as a VC4 chest or the Block piece is stacked in the subnet container.In stacking process, each business unit is assembled according to the VC4 rank, 63 VC12 of less than handle according to 63 VC12, put in the VC4 chest.In the relatively more idle network of business, can be that unit adjusts business directly with the VC4 chest, so can not only join logical business, also can be many similar professional leeway of reserving dilatations.In adjustment process, can split from height or length the Block piece to the Block piece.
Therefore, core concept of the present invention is exactly: with the distributing slot resources problem in the subnet, be converted into the problem of placing solid in a rectangular vessel, this solid is a level altitude, the rectangle that is uneven in length.The target of piling up is to make the remaining space in the container more continuous, fragment still less, thereby can admit more new solid.
Modal subnet is bidirectional linear switched ring (BLSR) in the net because SDH transmits, present embodiment is that example illustrates the process that resource is adjusted with BLSR annular subnet promptly, because in the BLSR subnet, the successional constraint of time slot is arranged, so Block piece by business mapping generation, in banking process, can not on length, cut apart, only in height cut apart, to adapt to the space of differing heights.Referring to shown in Figure 3, the specific implementation process of resource adjustment may further comprise the steps:
Step 301: one group of Block that will have binding relationship puts into a VC4 chest, and the width of this VC4 chest is the width of elder among one group of Block.Binding relationship described here is meant that all business of placing among one group of Block have identical attribute or identical characteristics, such as: all types of service of placing among one group of Block; Or the link of all professional processes of placing among one group of Block has identical end node; Or the metric of the link of all professional processes of placing among one group of Block is identical; Or the minimum cross grain of the link of all professional processes of placing among one group of Block is identical or the like.As shown in Figure 1, owing to business 1, business 2 and professional 3 have binding relationship, therefore three Block of the business of will placing 1, business 2 and business 3 put into VC4 chest 101 as one group of Block, and the width of this VC4 chest is the length of the Block of the business of placing 3; Equally, because business 4, business 5 and business 6 have binding relationship, three Block that place professional 4,5,6 are put into VC4 chest 102 as one group of Block, the width of this VC4 chest is the length of the Block of placement business 6.
Step 302~303: after all business all are placed into the VC4 chest, travel through the VC4 chest that all comprise one group of Block, per two VC4 chests are compared one by one, judge whether two current VC4 chests satisfy the merging condition, if then enter step 304; Otherwise, enter step 305.Wherein, described merging condition is meant and will satisfies following three conditions simultaneously:
A) one group of Block in each VC4 chest all has a side to align from length direction, and to require the business module in two VC4 chests to be combined must be the first from left Right Aligns;
B) two VC4 chests common factor non-NULL in the horizontal direction, and be both proper subclass simultaneously;
C) can finish the low order time slot allocation in the union space in the horizontal direction.
Step 304: merge the business in two VC4 chests of current comparison, that is: regenerate a new chest by the width of horizontal direction union earlier, the new chest of then original two Block that chest comprised all being packed into, and be its distribution low order time slot.Such as: when VC4 chest 101 and 102 is compared, find that VC4 chest 101 and 102 satisfies the described merging condition of step 303, so, as shown in Figure 4, just press VC4 chest 101 and 102 union width in the horizontal direction and generate new VC4 chest 201, the relevant position in the VC4 chest 201 of then business 1 in original VC4 chest 101 and 102 to business 6 all being packed into.
Above-mentioned merging process, saying of image is exactly: the business 1 after regular is bundled in respectively together to professional 6 to professional 3, professional 4, map to respectively on the irregular zigzag solid that is superimposed to form by not isometric rectangle, that is: the solid of being filled by oblique line in the VC4 chest 101 and 102 merges the zigzag solid that is equivalent in the mobile VC4 chest 102 and goes to fill gap in the VC4 chest 101.
Step 305: after the service combining in two VC4 chests of current comparison finishes, judge whether to check out all VC4 chest combinations, if, process ends then; Otherwise, return step 302.
In the implementation procedure of present embodiment, for satisfying the requirement of efficient, the judgement that whether can merge for traversal and per two VC4 chests of all VC4 chests, can adopt the at first method of coupling preferential (First-fit), that is to say, at each VC4 chest, directly the VC4 chest with first the satisfied merging condition that finds in other all VC4 chests merges.In fact, take the least possible target of VC4 resource in order to reach, the judgement that whether can merge for traversal and per two VC4 chests of all VC4 chests, also can adopt:, take the minimum VC4 chest of resource after in other all VC4 chests, finding one to satisfy condition and mate and merge at a VC4 chest.
In implementation procedure of the present invention, can also merge again being re-used as comparison other through merging the new VC4 chest that generates, that is to say that the process circulation that the VC4 chest can be merged is carried out, till not having the VC4 chest to merge.
The above is preferred embodiment of the present invention only, is not to be used to limit protection scope of the present invention.

Claims (8)

1, a kind of method that realizes that resource is adjusted in the Optical synchronization digital transmission network is characterized in that this method may further comprise the steps:
A. will have the packaged of one group of binding relationship professional mapping respectively goes in the VC4 chest;
B. after the professional piece that shines upon is placed into different VC4 chests with all according to binding relationship, travel through all VC4 chests, one by one per two VC4 chests are compared, whether two VC4 chests judging current comparison satisfy the merging condition, if, then generate a new VC4 chest, and with the packaged new VC4 chest of going into described generation of the business in two VC4 chests of current comparison mapping; Otherwise, enter step c;
C. judge whether to check out all VC4 chest combinations, if, process ends then; Otherwise, return step b.
2, method according to claim 1 is characterized in that: all VC4 chests of the traversal described in the step b are to travel through all to comprise the VC4 chest of one group of business module.
3, method according to claim 2 is characterized in that: it is whether two VC4 chests judging current comparison satisfy following three conditions simultaneously that judging whether described in the step b satisfied the merging condition:
1) one group of business module in each VC4 chest all has side alignment in the longitudinal direction, and the business module in two VC4 chests to be combined must be the first from left Right Aligns;
2) two VC4 chests common factor non-NULL in the horizontal direction, and be both proper subclass simultaneously;
3) two VC4 chests can be finished the low order time slot allocation in the union space in the horizontal direction.
4, method according to claim 1 is characterized in that: the new VC4 chest of the generation described in the step b is the new VC4 chest of width generation by two VC4 chest horizontal direction unions of current comparison.
5, method according to claim 1, it is characterized in that: the packaged new VC4 chest of going into described generation with business mapping described in the step b is to move the mode that all business modules go to fill space in another VC4 chest in the VC4 chest, all business modules that comprise in two VC4 chests with current comparison new VC4 chest of all packing into, and be that each business module distributes the low order time interval resource.
6, method according to claim 1 is characterized in that: for each VC4 chest, directly the VC4 chest with first the satisfied merging condition that is found merges among the step b.
7, method according to claim 1 is characterized in that: among the step b for each VC4 chest, with the satisfied merging condition that is found and take the minimum VC4 chest of VC4 resource after merging and merge.
8, method according to claim 1 and 2 is characterized in that: the new VC4 chest of the VC4 chest that is traveled through for having generated through merging.
CNB031236006A 2003-05-19 2003-05-19 Method for accomplishing resource regulation in phototiming digital transmission network Expired - Fee Related CN100440793C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB031236006A CN100440793C (en) 2003-05-19 2003-05-19 Method for accomplishing resource regulation in phototiming digital transmission network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB031236006A CN100440793C (en) 2003-05-19 2003-05-19 Method for accomplishing resource regulation in phototiming digital transmission network

Publications (2)

Publication Number Publication Date
CN1549506A CN1549506A (en) 2004-11-24
CN100440793C true CN100440793C (en) 2008-12-03

Family

ID=34321390

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB031236006A Expired - Fee Related CN100440793C (en) 2003-05-19 2003-05-19 Method for accomplishing resource regulation in phototiming digital transmission network

Country Status (1)

Country Link
CN (1) CN100440793C (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020176389A1 (en) * 2001-04-05 2002-11-28 Alcatel Method and apparatus for mapping Fast Ethernet data interfaces into a single VC-4 Virtual Container of a STM-1/OC-3 payload transmitted in a radio-link system

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020176389A1 (en) * 2001-04-05 2002-11-28 Alcatel Method and apparatus for mapping Fast Ethernet data interfaces into a single VC-4 Virtual Container of a STM-1/OC-3 payload transmitted in a radio-link system

Also Published As

Publication number Publication date
CN1549506A (en) 2004-11-24

Similar Documents

Publication Publication Date Title
CN1300965C (en) Notifying type dynamic path protection for optical network
CN104836736B (en) Efficiency resource allocation and path method for reconfiguration in elastic optical network based on frequency spectrum perception
CN104518961B (en) It is grouped the leading method and device of optical transport network
CN104683488B (en) Streaming computing system and its dispatching method and device
CN1217118A (en) Allocating communication traffic
CN106953710B (en) The method for routing of the distribution of minimum cost frequency spectrum and fragment perception in elastic optical network
CN101052235A (en) Business combing method and device for ASON special protection
CN109478941A (en) A kind of transmission of multi-channel service, method of reseptance and device
CN109995435A (en) A kind of mapping method of virtual network and system based on multi-fiber core optical-fiber network
CN104956630A (en) An enhanced path selection scheme for equal cost paths in communication networks
CN100440793C (en) Method for accomplishing resource regulation in phototiming digital transmission network
CN1151625C (en) Routing and wavelength distributing method for optical wavelength division multiplexing network
CN106961641A (en) A kind of frequency spectrum distributing method perceived in elastic optical network based on service priority
CN109905172A (en) A kind of frequency spectrum distributing method of minimum adjacent degree reduction amount in elastic optical network
CN100499534C (en) Implementing method for optimizing multiple services in optical synchronization data transmission network
CN108616782A (en) A kind of frequency spectrum distributing method based on the optimization of non-intersecting connection group in elastic optical network
CN104809539A (en) Dynamic planning method of data center server resource
CN103780514B (en) Method and device for selecting bandwidth
CN1905516B (en) Method of allocating bidirection forwarding detecting conversational authentication code
CN110139173A (en) A kind of network dividing area method reducing optical transfer network end-to-end time delay
CN100477596C (en) Method for realizing low order resource regulation in phototiming digital transmission network
CN100486171C (en) Method for realizing transactions according to rules between sub networks in resource allocation of optical synchronizaton data transportation network
CN1295895C (en) Higher-order resource regulating method in optical synchronous digital transmission network
CN100486203C (en) Method for realizing transactions according to rules within sub network in resource allocation of optical synchronization data transportation network
CN100413255C (en) Network layered model and interlaminar mapping method for optical transmission communication network

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
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20081203

Termination date: 20110519