CN1694426A - Method for increasing using effect of data storage in full-T cross - Google Patents
Method for increasing using effect of data storage in full-T cross Download PDFInfo
- Publication number
- CN1694426A CN1694426A CNA2004100389092A CN200410038909A CN1694426A CN 1694426 A CN1694426 A CN 1694426A CN A2004100389092 A CNA2004100389092 A CN A2004100389092A CN 200410038909 A CN200410038909 A CN 200410038909A CN 1694426 A CN1694426 A CN 1694426A
- Authority
- CN
- China
- Prior art keywords
- data
- data storage
- road
- full
- group
- 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
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
This invention discloses a method for increasing the efficiency of data storages in total interleave including: designing the service to be interleaved N channels, the sum of the least particle service participating the interleave in each channel is M, designing L channels in N for being interleaved to be one set to design N/L sets data storages and delay storages, controlling the data and delay storages in each set to finish the total interleave of N channel input and l channel output, synchronously controlling said N/L set delay storage to finish the total T interleave of N channel output.
Description
Technical field
The present invention relates to communication technical field, be specifically related to a kind of method that improves the data storage service efficiency.
Background technology
Along with development of Communication Technique, the loaded information amount is increasing in SDH (SDH (Synchronous Digital Hierarchy))/SONET (Synchronous Optical Network) network, like this, just need that most important network element digital cross connect equipment (DXC) has bigger exchange capacity in the SDH/SONET network.The core of DXC is a cross-connect matrix, realizes the interconnection to VC (virtual container).Usually the function of cross-connect matrix is finished by cross chips.For the realization of big capacity cross chips, no matter the complexity that realizes from chip is still from the price of chip, using the size of RAM in the sheet all is a very important factor, and along with the increase day by day of cross chips cross-capacity, this factor also becomes increasingly conspicuous.In the realization of extensive cross chips, the size of DM (data storage) has conclusive effect, and it will take most of RAM resource of cross chips.
Traditional full T intersects implementation as shown in Figure 1, so-called full T intersection is meant that the data of all time slots of output can be from all time slots of input, usually adopt following implementation method: if the total N road of incoming traffic, every road has the data of M time slot to intersect, so, every Lu Eryan for the output of N road, need be among the DM of N * M * 8bits to capacity with the storage of M time slot on the N road of input, and, for the output of every road, DM will be set as identical two DM0 and DM1, two table tennis work.N road business data flow is imported in proper order, and the storage of the 1st group of 0～M-1 time slot of input traffic is in DM0, and the storage of the 2nd group of 0～M-1 time slot is in DM1, and the storage of the 3rd group of 0～M-1 time slot is in DM0, and the rest may be inferred.After DM0 writes completely, begin to write DM1, the while outbound course begins to read DM0 under the control of CM (control storage) content (promptly having realized intersection); After DM1 write completely, the data that need among the DM0 to read were also all read, and like this, the data of input begin to write DM0 again, read the data output among the DM1 simultaneously under the control of CM.So move in circles, can realize that full T intersects.
By this figure as can be seen, in traditional full T intersected implementation, for the output of N road, the output of every road needed two DM that capacity is N * M * 8bits, is respectively DM0 and DM1, and size and the structure of all DM are in full accord; And the data of N piece DM0 storage are identical, and the data of N piece DM1 storage are also identical.A large amount of uses of DM can bring two problems: the one, and the monolithic cross-capacity that makes existing technology to realize is limited; The 2nd, the cost of the cross-capacity of realizing a certain specification is increased.
Summary of the invention
The purpose of this invention is to provide a kind of method that improves data storage service efficiency in the full T intersection, to reduce to finish the required RAM resource of intersection of a constant volume, thereby improve the cross-capacity of monolithic cross chips, and under the intersection situation that realizes same capability, reduce the cost of monolithic cross chips.
The objective of the invention is to be achieved through the following technical solutions:
A kind of method that improves data storage service efficiency in the full T intersection comprises:
A, setting business to be intersected are the N road, and the smallest particles business that intersection is participated on every road adds up to M;
B, the L road of setting in the business to be intersected of N road are one group;
C, N/L group data storage and delay memory are set;
D, control data storage and the delay memory full T that finishes the input of N road, the output of L road in every group intersects;
The full T that E, the described N/L group data storage of Synchronization Control and delay memory are finished the output of N road intersects.
Be provided with and comprise L+1 data memory and (L-1) * L delay memory in every group of data storage and the delay memory at least.
The minimum capacity of described data storage is N * M * 8bits.
The minimum capacity of described delay memory is M * 8bits.
Described step D comprises:
D1, N * M time slot services data of input are write in the described data storage behind the delay scheduled time successively;
D2, control the data that read in the described data storage successively and write successively in the described delay memory by the every road corresponding control storage of output after postponing the described scheduled time successively;
D3, when the corresponding control storage of output of last road in this group reads data in the described data storage, directly export the data that read, and the synchronous data of exporting in the notebook data memory that other road control storages read in this group that is stored in the described delay memory, the full T that finishes L road * M time slot output intersects.
Described data storage and described delay memory all recycle.
By above technical scheme provided by the invention as can be seen, the present invention makes the timesharing water operation by making the DM in the cross chips, make in the traditional approach capacity of the complete required DM of intersection of business realizing that is input as N * M is reduced to N/L * (L+1) * N * M * 8bits+N/L * (L-1) * L * M * 8bits by 2N * N * M * 8bits, the value of L is between 1～N, choose suitable L value, it is a lot of that DM is reduced.Therefore, utilize the present invention having now under the technological level, appropriateness improves the cross-capacity of monolithic cross chips; And under the situation of the intersection that realizes same capability, compare, can reduce the size of the DM of use, thereby reduce the cost of monolithic chip effectively with traditional interleaved scheme.
Description of drawings
Fig. 1 is a full T intersection implementation schematic diagram in the prior art;
Fig. 2 is the flow chart of the inventive method;
Fig. 3 is the data storage of needs when setting 2 road incoming traffics are a group in the inventive method and the structural representation of delay memory;
Fig. 4 is the full flow chart that intersects of one group of business realizing shown in Figure 3;
Fig. 5 is that one group of business realizing shown in Figure 3 is intersected the sequential chart of process entirely.
Embodiment
Core of the present invention is the size according to incoming traffic to be intersected, be divided into suitable some groups, for every group of data storage and delay memory of setting some and capacity, by data storage in each group being made the data after the timesharing water operation obtains every road intersection successively, and the data after the intersection that will obtain are temporarily stored in the delay memory, to be temporarily stored in the data sync output after the intersection that the former roads in the delay memory obtain from this data storage during data when intersection is read in last road from data storage after, thereby the full T that realizes the business in this group intersects, control these some groups according to the synchronous output of identical working method full cross business data separately, thereby the full T that finishes the cross business data that remain intersects.
In order to make those skilled in the art person understand the present invention program better, the present invention is described in further detail below in conjunction with drawings and embodiments.
Flow process with reference to the inventive method shown in Figure 2 may further comprise the steps:
Step 201: setting business to be intersected is the N road, and the minimum grain business that intersection is participated on every road adds up to M.
Step 202: the L road of setting in the business to be intersected of N road is one group, and the value that makes L is between 1～N.
Step 203: be provided with L+1 data memory of N/L group with (L-1) * a L delay memory, the minimum capacity of described data storage is N * M * 8bits, the minimum capacity of described delay memory is M * 8bits.
Step 204: timesharing is controlled in every group L+1 data memory and (L-1) * L delay memory and is finished the full T intersection of the input of N road, the output of L road.Read and write each data storage and delay memory as follows:
(1) behind the delay scheduled time N * M time slot services data of input is write in the entry data memory successively;
(2) control the data in the reading of data memory successively and write in the delay memory successively by the corresponding control storage of every road output behind the delay scheduled time successively;
(3) when the data in the corresponding control storage reading of data memory of last road output in this group, directly export the data that read, and the synchronous data of exporting in the notebook data memory that other road control storages read in this group that is stored in the delay memory, the full T that finishes L road * M time slot output intersects.
In above read-write process to the data memory, L+1 data memory and (L-1) * L delay memory can recycle.Because business to be intersected has the L road, therefore, when just writing last data storage, last road corresponding control storage of output reads the 1st data in the data memory, at this moment, directly export the data that read, and the synchronous data of exporting in the 1st the data memory that other road control storages read in this group that is stored in the delay memory, after this process is finished, no longer need the 1st data in the data memory, therefore, can use this data storage again at next cycle; Simultaneously, the data that are stored in the 1st the data memory that other road control storages read in this group in the delay memory also no longer need, and can use these delay memories again at next cycle.
Step 205: Synchronization Control N/L group L+1 and (L-1) * L delay memory is finished the full T intersection of N road output.
In order to make present technique field personnel understand the present invention better, be example with L=2 below, the invention will be further described.
If L=2, the full T that promptly will finish the input of N road, 2 tunnel outputs in this group intersects.
Needing 3 block sizes altogether is the data storage of N * M * 8bits, is made as DM0, DM1 and DM2, and 2 block sizes are the delay memory of M * 8bits, is made as 00_DM and 01_DM, and its structure as shown in Figure 3.
Fig. 4 shows 3 data memories and 2 delay memories is carried out the processes that 2 road full intersections are finished in cycling, wherein, input traffic is represented on the left side among the figure, each fritter is represented the business datum of M time slot of single channel input, DM0, DM1 and DM2, and the structure of 00_DM and 01_DM is referring to Fig. 3.Wherein, DM0, DM1 and DM2 are respectively applied for the business datum of one group of N * M time slot of storage, and 00_DM and 01_DM are respectively applied for the data of M time slot after the intersection of storing single channel output.
Fig. 4 (1) expression: the 0th group of N * M time slot services data will importing write among the DM0;
Fig. 4 (2) expression: the 1st group of N * M time slot services data will importing write among the DM1; Controlling the data that read DM0 by the corresponding CM of the 0 tunnel output simultaneously is written among the delay memory 00_DM;
Fig. 4 (3) expression: the 2nd group of N * M time slot services data will importing write among the DM2; Controlling the data that read DM1 by the corresponding CM of the 0 tunnel output simultaneously is written among the delay memory 01_DM; Control the data that read DM0 by the corresponding CM of the 1 tunnel output simultaneously, that stores among directly output, and the synchronizing sequence output 00_DM controls the data that read DM0 by the corresponding CM of the 0 tunnel output, after this process is finished, has promptly finished the intersection of the 0 tunnel output.At this moment, the data among the DM0 are invalid, and next cycle incoming traffic data can write again among the DM0, and same, the data among the 00_DM are also invalid, and the data after the next cycle single channel is intersected can recycle again.
Fig. 4 (4) expression: the 3rd group of N * M time slot services data will importing write among the DM0; Controlling the data that read DM2 by the corresponding CM of the 0 tunnel output simultaneously is written among the 00_DM; Control the data that read DM1 by the corresponding CM of the 1 tunnel output simultaneously, that stores among directly output, and the synchronizing sequence output 01_DM controls the data that read DM1 by the corresponding CM of the 0 tunnel output, after this process is finished, has promptly finished the intersection of the 1 tunnel output.At this moment, the data among the DM1 are invalid, and next cycle incoming traffic data can write again among the DM1, and same, the data among the 01_DM are also invalid, and the data after the next cycle single channel is intersected can recycle again.
Fig. 4 (5) expression: the 4th group of N * M time slot services data will importing write among the DM1; Controlling the data that read DM0 by the corresponding CM of the 0 tunnel output simultaneously is written among the 01_DM; Simultaneously, the CM corresponding by the 1 tunnel output controls the data that read DM2, and that stores among directly output, and the synchronizing sequence output 00_DM controls the data that read DM2 by the corresponding CM of the 0 tunnel output, after this process is finished, has promptly finished the intersection of the 0 tunnel output.At this moment, the data among the DM2 are invalid, and next cycle incoming traffic data can write again among the DM2, and same, the data among the 00_DM are also invalid, and the data after the next cycle single channel is intersected can recycle again.
Recycle DM0, DM1 and DM2 according to said process, simultaneously, utilize the data of M time slot of the temporary single channel output of 00_DM and 01_DM, just can realize the full intersection of 2 tunnel outputs.
Sequential relationship in the above-mentioned intersection process can be expressed as Fig. 5.
Have a look again below under the situation of two kinds of limit, promptly when L=1 or L=N, realize the complete required resource of intersecting:
According to noted earlier, finishing incoming traffic is the N road, when there is the full intersection of M time slot on every road, if when being one group with the L road, then every group needs L+1 size to be the data storage of N * M * 8bits, needs (L-1) * L size to be the delay memory of M * 8bits simultaneously, the resource that the N/L group needs is as follows: N/L * (L+1) * N * M * 8bits+N/L * (L-1) * L * M * 8bits, therefore, when L=1, the total resources that need are 2N * N * M * 8bits; When L=N, the total resources that need still are 2N * N * M * 8bits, and the conventional method resource requirement is identical with adopting.Therefore, can between 1 to N, select suitable L value, will make the intersection a resource shrinkage a lot.
Supporting the high-order of SDH and SONET to intersect with 320G is example, and input and output are 2.5G, N=128 so, M=48.
The required DM resource of conventional method: 2 * 128 * 128 * 48 * 8=12M bits.
The required DM resource of the inventive method:
L gets 4:128/4 * 5 * 128 * 48 * 8+128/4 * 3 * 4 * 48 * 8=7.64M bits.
L gets 8:128/8 * 9 * 128 * 48 * 8+128/8 * 7 * 8 * 48 * 8=7.08M bits.
As seen, under the intersection situation that realizes same capability, compare, can reduce the size of the DM of use, thereby reduce the cost of monolithic chip with traditional interleaved scheme.
In actual applications, can select suitable L value,, improve the service efficiency of data storage in the cross chips so that under existing technological level according to actual conditions.
Though described the present invention by embodiment, those of ordinary skills know, the present invention has many distortion and variation and do not break away from spirit of the present invention, wish that appended claim comprises these distortion and variation and do not break away from spirit of the present invention.
Claims (6)
1, a kind of method that improves data storage service efficiency in the full T intersection is characterized in that, comprising:
A, setting business to be intersected are the N road, and the smallest particles business that intersection is participated on every road adds up to M;
B, the L road of setting in the business to be intersected of N road are one group;
C, N/L group data storage and delay memory are set;
D, control data storage and the delay memory full T that finishes the input of N road, the output of L road in every group intersects;
The full T that E, the described N/L group data storage of Synchronization Control and delay memory are finished the output of N road intersects.
2, the method for data storage service efficiency during the full T of raising as claimed in claim 1 intersects, it is characterized in that described step C comprises: be provided with and comprise L+1 data memory and (L-1) * L delay memory in every group of data storage and the delay memory at least.
3, the method for data storage service efficiency is characterized in that the minimum capacity of described data storage is N * M * 8bits during the full T of raising as claimed in claim 2 intersected.
4, as the method for data storage service efficiency in claim 2 or the full T intersection of 3 described raisings, it is characterized in that the minimum capacity of described delay memory is M * 8bits.
5, the method for data storage service efficiency during the full T of raising as claimed in claim 4 intersects is characterized in that described step D comprises:
D1, N * M time slot services data of input are write in the described data storage behind the delay scheduled time successively;
D2, control the data that read in the described data storage successively and write successively in the described delay memory by the every road corresponding control storage of output after postponing the described scheduled time successively;
D3, when the corresponding control storage of output of last road in this group reads data in the described data storage, directly export the data that read, and the synchronous data of exporting in the notebook data memory that other road control storages read in this group that is stored in the described delay memory, the full T that finishes L road * M time slot output intersects.
6, the method for data storage service efficiency is characterized in that described data storage and described delay memory all recycle during the full T of raising as claimed in claim 5 intersected.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100389092A CN100403723C (en) | 2004-05-09 | 2004-05-09 | Method for increasing using effect of data storage in full-T cross |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2004100389092A CN100403723C (en) | 2004-05-09 | 2004-05-09 | Method for increasing using effect of data storage in full-T cross |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1694426A true CN1694426A (en) | 2005-11-09 |
| CN100403723C CN100403723C (en) | 2008-07-16 |
Family
ID=35353234
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2004100389092A Expired - Fee Related CN100403723C (en) | 2004-05-09 | 2004-05-09 | Method for increasing using effect of data storage in full-T cross |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100403723C (en) |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1377158A (en) * | 2001-03-22 | 2002-10-30 | 深圳市中兴通讯股份有限公司上海第二研究所 | Automatic service configuration method for synchronous digital transmission system |
| US9048965B2 (en) * | 2001-08-24 | 2015-06-02 | Mark Henrik Sandstrom | Input-controllable dynamic cross-connect |
| CN100455034C (en) * | 2002-02-09 | 2009-01-21 | 中兴通讯股份有限公司 | Cross cascade system based on add and drop multiplexer in optical synchronous digital transmission system |
| JP4037730B2 (en) * | 2002-10-07 | 2008-01-23 | 富士通株式会社 | Cross-connect control method |
-
2004
- 2004-05-09 CN CNB2004100389092A patent/CN100403723C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN100403723C (en) | 2008-07-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1035927A (en) | The method and apparatus of hybrid packet switching | |
| CN1758438A (en) | Semiconductor memory device and package thereof, and memory card using the same | |
| CN1194526C (en) | Storing device and facsimile apparatus using the same | |
| CN1471670A (en) | Storing device, storing control method and program | |
| CN1102317C (en) | Aspect ratio converter and method thereof | |
| CN1851676A (en) | Embedded system buffer internal memory distribution method | |
| CN1694426A (en) | Method for increasing using effect of data storage in full-T cross | |
| CN101188429A (en) | A bit interleaver and method for bit interleaving | |
| CN1567807A (en) | A frequency domain filter and method for implementing frequency domain filter | |
| CN1274224A (en) | Stream line-type R/W method for shared memory | |
| CN1691568A (en) | Method and apparatus for data cross in synchronous data transmission network | |
| CN100493000C (en) | Method and device for realizing multiple logic path counting | |
| CN1489334A (en) | Method for storage area management with static and dynamic joint | |
| CN1242659A (en) | Single chip and large capacity digital time division switching network | |
| CN103123610B (en) | Solid state storage device | |
| CN1181595A (en) | Semiconductor memory | |
| CN1094011C (en) | Circuit for converting frame data | |
| CN1691561A (en) | Method for implementing low order cross connect with convergence | |
| CN1139297C (en) | Cross-connect switch for time division multiplexing | |
| CN1189826C (en) | Data receiving and transmitting processing method based on multibusiness and multichannel | |
| CN1114174C (en) | Apparatus and method for producing mosaic image | |
| CN1428964A (en) | Method of multiplex multispeed digital exchange and its equipment | |
| CN1462118A (en) | Treatment method of sequence number ordering in virtual cascade connection | |
| CN1540927A (en) | Quick method for recovering mass configuration of exchanger | |
| CN1905425A (en) | Method of light plate-to-light plate time slot time division optimizing configaration of SDH system |
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: 20080716 Termination date: 20110509 |