CN101039273A - Communication equipment, transmission control method and transmission control program - Google Patents
Communication equipment, transmission control method and transmission control program Download PDFInfo
- Publication number
- CN101039273A CN101039273A CNA2007100885541A CN200710088554A CN101039273A CN 101039273 A CN101039273 A CN 101039273A CN A2007100885541 A CNA2007100885541 A CN A2007100885541A CN 200710088554 A CN200710088554 A CN 200710088554A CN 101039273 A CN101039273 A CN 101039273A
- Authority
- CN
- China
- Prior art keywords
- destination
- candidate
- transmission
- grouping
- destination candidate
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 159
- 238000004891 communication Methods 0.000 title claims abstract description 58
- 238000000034 method Methods 0.000 title claims description 59
- 238000012546 transfer Methods 0.000 claims description 12
- 241001269238 Data Species 0.000 abstract 1
- 238000012545 processing Methods 0.000 description 43
- 230000008569 process Effects 0.000 description 30
- 230000015572 biosynthetic process Effects 0.000 description 12
- 238000005516 engineering process Methods 0.000 description 6
- 238000012958 reprocessing Methods 0.000 description 2
- 230000002776 aggregation Effects 0.000 description 1
- 238000004220 aggregation Methods 0.000 description 1
- 230000000052 comparative effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000005764 inhibitory process Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000001629 suppression Effects 0.000 description 1
- 230000001052 transient effect Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/56—Queue scheduling implementing delay-aware scheduling
- H04L47/562—Attaching a time tag to queues
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/52—Queue scheduling by attributing bandwidth to queues
- H04L47/522—Dynamic queue service slot or variable bandwidth allocation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/58—Changing or combining different scheduling modes, e.g. multimode scheduling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/621—Individual queue per connection or flow, e.g. per VC
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/622—Queue service order
- H04L47/6225—Fixed service order, e.g. Round Robin
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/50—Queue scheduling
- H04L47/62—Queue scheduling characterised by scheduling criteria
- H04L47/625—Queue scheduling characterised by scheduling criteria for service slots or service orders
- H04L47/6255—Queue scheduling characterised by scheduling criteria for service slots or service orders queue load conditions, e.g. longest queue first
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
Abstract
A communication device, comprises: location unit, which includes plenty of storage areas corresponding to plenty of goals of transmission datas; detecting unit, which detects the data quantity of data in each storage area; goal choosing unit, which chooses a goal from the plenty of goals based on the data quantity from the detecting unit; and transmission signals generation unit, which reads preconcerted data quantity to the goal from the corresponding storage area, and generates transmission signals.
Description
The cross reference of related application
The present invention includes the relevant theme of submitting to Japan Patent office with on March 16th, 2006 of Japanese patent application JP2006-073186, merge its full content at this by reference.
Technical field
The present invention relates to from the transmission destination candidate, select communication equipment, transfer control method and the transmission control procedure of the transmission destination of transmission signals.
Background technology
In comprising the communication system of a plurality of terminals, use for example round-robin algorithm (round-robin algorithm) of the transmission destination (destination) that allows terminal to select data and the algorithm of maximum queue algorithm (max-queuealgorithm).As shown in Figure 8, in such round-robin algorithm, each destination candidate (terminal A is to D) is chosen as the data destination successively.In the maximum queue algorithm, as shown in Figure 9, based on being the transmission packets buffer stored packet number of destination, and select your destination being used for storing with each destination candidate.As shown in Figure 9, in the maximum queue algorithm, the destination candidate that will be used for the grouping of the maximum number that transmission buffer stores is chosen as the destination.When starting communication, each terminal is selected the destination of dividing into groups based on such algorithm, and carries out the processing that is used to generate the transmission frame that will be transferred to selected destination.
For the processing of such generation transmission frame, use such technology, be purpose to the ratio of expense wherein, and link a plurality of groupings, as shown in figure 10 to create single frame with the payload that increases in the frame.Yet, in this technology, or the grouping number that will link little when the size of each grouping hour, the size of payload portions can be by this block chaining to the ratio of the size of the overhead part that comprises lead code and PHY (physical layer) header and is fully increased, as shown in figure 11.Thus, utilize this technology,, also almost can not increase data transmission efficiency even linked a plurality of groupings.
As mentioned above, for example the destination selection algorithm of maximum queue algorithm depends on stored packet number in the transmission buffer of each destination candidate.Thus, in such algorithm, less than the destination candidate that is other destination candidate stored packet numbers, may not give its transmission opportunity for stored packet number in the transmission buffer, unless the grouping number of described other destination candidates reduces.Particularly, when each terminal (destination candidate) connected communication by TCP (transmission control protocol), the grouping number that generates for the terminal with high-transmission frequency was greater than the grouping number that generates for the terminal with low transmission frequency.Thus, the grouping number with terminal of low transmission frequency reduces gradually, and the result disconnects and the communicating by letter of this terminal.
When in communication system with transfer of data when being in the terminal of poor communications status, make a mistake probably, and do not send ACK (really receiving) thus from terminal.Thus, in order to increase substantial communication speed, the terminal terminal of the possibility that makes a mistake (rather than have) that communication system will be in communications status is chosen as the destination.Yet, in the algorithm of for example round-robin algorithm that transmission opportunity is provided coequally for each terminal in the communication system, have nothing for it but and carry out the processing of transfer of data to the terminal that is in poor communications status and assign the communication resource of communication equipment.This causes the reduction of the substantial communication speed of whole system.
In order to address this problem, Japanese Unexamined Patent Application discloses 2002-261866 number and discloses a kind of block transmission dispatching device.In this device, switching and selecting method, thus do not assign the resource of the communicator in the communication system to the destination that is in poor communications status.This allows effective Resources allocation, and increases the communication speed of whole communication system thus.
For the application of some type, to a certain destination candidate transmission data the time, have to transmission delay or jitter suppression to low level.Yet, when for example using the algorithm of the maximum queue algorithm that selects your destination based on information and round-robin algorithm, may not give such destination candidate transmission opportunity from transmission buffer.This feasible transmission delay or shake that is difficult in the inhibition transfer of data.
Summary of the invention
Consider above situation and made the present invention.Therefore, need be used to realize communication equipment, transfer control method and the transmission control procedure of high-transmission efficient.
Thus, comprise according to the communication equipment of one aspect of the invention: memory cell has the corresponding a plurality of storage areas of a plurality of candidates with the destination of the data that will transmit; Detecting unit is used for detecting in each storage area data quantity stored; The destination selected cell is used at least based on the data volume that this detecting unit detected, and selects your destination from the candidate of described destination; With the transmission signals generation unit, be used for reading the scheduled traffic data that will be transferred to the destination of selecting by this destination selected cell, and generate transmission signals from the storage area of correspondence.
Transfer control method according to one aspect of the invention comprises step: detect data quantity stored in each storage area from the memory cell with a plurality of storage areas corresponding with a plurality of candidates of the destination of the data that will transmit; At least based on the data volume that in detecting step, detects, and from this destination candidate, select your destination; With from the storage area of correspondence, read the scheduled traffic data that is used for selected destination, and generate the transmission signals be used for selected destination.
Carried out by the computer that provides in communication equipment according to the transmission control procedure of one aspect of the invention, this communication equipment is used to carry out and the communicating by letter of a plurality of destinations candidate.This program comprises step: detect data quantity stored in each storage area from the memory cell with a plurality of storage areas corresponding with a plurality of candidates of the destination of the data that will transmit; At least based on the data volume that in detecting step, detects, and from this destination candidate, select your destination; With from the storage area of correspondence, read the scheduled traffic data that is used for selected destination, and generate the transmission signals be used for selected destination.
According to embodiments of the invention, by from the candidate of a plurality of destinations, selecting a destination candidate as the destination based on data quantity stored in the memory cell at least, and determine suitable destination.Utilize this configuration, can realize having the communication system of high-transmission efficient.
Description of drawings
Fig. 1 is the block diagram that illustrates the configuration of transmission control unit;
Fig. 2 is the flow chart that illustrates according to the processing procedure of being carried out by the destination selected cell of the embodiment of the invention;
Fig. 3 is the flow chart that illustrates according to the processing procedure of being carried out by the destination selected cell of the embodiment of the invention;
Fig. 4 is the flow chart that illustrates according to the processing procedure of being carried out by the destination selected cell of the embodiment of the invention;
Fig. 5 is the flow chart that illustrates according to the processing procedure of being carried out by the destination selected cell of the embodiment of the invention;
Fig. 6 is the flow chart that illustrates according to the processing procedure of being carried out by the destination selected cell of the embodiment of the invention;
Fig. 7 is the flow chart that illustrates according to the processing procedure of being carried out by the destination selected cell of the embodiment of the invention;
Fig. 8 indicative icon use the destination selection scheme of round-robin algorithm;
Fig. 9 indicative icon use the destination selection scheme of maximum queue algorithm;
Figure 10 indicative icon link grouping so that generate the processing procedure of transmission frame; With
Figure 11 indicative icon link grouping so that generate the processing procedure of transmission frame.
Embodiment
Hereinafter, the preferred embodiments of the present invention will be described with reference to the accompanying drawings.
With reference to figure 1, use description to carry out the configuration of the transmission control unit 1 that comprises in the communication equipment with the data communication of a plurality of terminals according to the embodiment of the invention.This transmission control unit 1 serves as and is used to control the processing unit that carries out the processing of transfer of data to a plurality of terminals.As shown in Figure 1, this transmission control unit 1 comprises transmission buffer 11, destination selected cell 12 and transmission signals generation unit 13.
This transmission buffer 11 has and is used for the formation of each transmission destination candidate (terminal) that temporary transient storage will be transferred to the grouping of destination candidate.These transmission buffer 11 stored informations, this information comprise grouping number in each formation that will be transferred to corresponding destination candidate, grouping dimension, the time (memory time) and the transmission transmission packets speed of stores packets in formation.
This destination selected cell 12 is based on from the memory time of the grouping that comprises grouping number, grouping dimension, each destination candidate of transmission buffer 11 and the information of transmission packets speed, and selects suitable destination from the candidate of a plurality of destinations.In case selected the destination from the candidate of destination, then destination selected cell 12 sends transmission triggering and transmission node information to transmission signals generation unit 13.
When receiving this transmission triggering and transmission node information from destination selected cell 12, it is the transmission data of destination that this transmission signals generation unit 13 is read from transmission buffer 11 with the destination candidate corresponding with destination information.Then, this transmission signals generation unit 13 is created transmission frame and is generated transmission signals.
Based on the type of the data that read from transmission buffer 11 or the communication speed of data, this transmission signals generation unit 13 utilizes the 12 pairs of groupings that will transmit of this destination selected cell of block chaining cue mark order to link or do not link.Specifically, if the link grouping is to form transmission frame, then this transmission signals generation unit 13 enables this block chaining cue mark, and if do not link grouping to form transmission frame, then this transmission signals generation unit 13 is forbidden this block chaining cue mark.
Hereinafter, will at be used for from a plurality of destinations candidate select best destination destination selected cell 12 operation and six embodiment of the present invention are described.
First embodiment
At first, the concise and to the point description feature that will realize in this embodiment.In transfer of data, can be with a plurality of packet aggregations for being transferred to the frame (this technology is referred to as frame assembles, and wherein utilizes single frame to transmit a plurality of groupings) of destination from communication equipment.When utilizing this technology to come transmission frame, be lower than predetermined threshold if be transferred to the data volume of destination, then may not guarantee the desired data efficiency of transmission.Consider this situation, in the communication equipment according to present embodiment, setting will be transferred to the grouping number of data of each destination candidate or the optimal threshold of the data volume in the formation.Then, when the data volume that will be transferred to the destination candidate surpasses this threshold value, this destination candidate is chosen as the destination.
With reference now to Fig. 2,, in detail the processing procedure of carrying out by destination selected cell 12 will be described.As hypothesis, these transmission signals generation unit 13 executeds be used to assemble grouping generating the processing of transmission frame, and handle with this, enabled this block chaining cue mark.In addition, suppose that this destination selected cell 12 read the stored packet number and the grouping dimension of each destination candidate from this transmission buffer 11 in the earlier stage of this process.
At step S1, this destination selected cell 12 determines whether the stored packet number of the destination candidate read from this transmission buffer 11 exceeds threshold value A.It should be noted that in this case if linked a plurality of groupings that exceed threshold value A, the overhead size in the transmission frame of then determining to be generated by this transmission signals generation unit 13 becomes fully big to the ratio of payload size.
If determine that in step S1 the stored packet number does not exceed threshold value A, then this process advances to step S2.On the other hand, if determine that the stored packet number exceeds threshold value A, then these destination selected cell 12 these destination candidates are set to suitable destination candidate, and this process advances to step S3 then.
At step S2, this destination selected cell 12 is based on the number and the grouping dimension of the stored packet that has read from transmission buffer 11, and calculate the buffer size of storing in the formation of the transmission buffer 11 corresponding, and determine whether this buffer size exceeds threshold value B with this destination candidate.It should be noted that in this case,, determine that then the overhead size in the transmission frame that this transmission signals generation unit 13 generated becomes fully big to the ratio of payload size if linked the grouping that its data size is equal to or greater than threshold value B.
If this destination selected cell 12 determines that this buffer size does not exceed threshold value B, then this process advances to step S6.On the other hand, if determine that this buffer size exceeds threshold value B, then these destination selected cell 12 these destination candidates are set to suitable destination candidate, and this process advances to step S3 then.
At step S3, suitable destination candidate that this destination selected cell 12 will be provided with in the processing of step S1 or step S2 and only destination candidate are comparing aspect the number of stored packet and the buffer size, and this process advances to step S4.It should be noted that only destination candidate refers to the transmission candidate that is given limit priority in other destination candidates.This priority is based on memory time of the number of the stored packet that will be transferred to each destination candidate and grouping dimension and grouping and transmission rate and definite.
At step S4, this destination selected cell 12 is based on the comparative result of the processing of step S3, and determines whether that the suitable destination candidate that will be provided with in the processing of step S1 or step S2 is chosen as the destination.If this destination selected cell 12 is chosen as the destination with this suitable destination candidate, then this process advances to step S5.If this destination selected cell 12 does not have this suitable destination candidate is chosen as the destination, then this process advances to step S6.
At step S5, the suitable destination candidate that this destination selected cell 12 is provided with in the processing of step S1 or step S2 is set to only destination candidate, and this processing advances to step S6 then.
At step S6, this destination selected cell 12 reads the number and the grouping dimension of the stored packet of another destination candidate, and this processing turns back to step S1.
As mentioned above, this destination selected cell 12 determines based on threshold value A and threshold value B be whether can obtain abundant efficiency of transmission under the situation of transmission frame of destination in the link grouping to form with the destination candidate.Then, destination selected cell 12 will be confirmed as not causing that the destination candidate eliminating of abundant efficiency of transmission is outside the selection of destination candidate.Utilize this configuration, this transmission signals generation unit 13 can generate transmission frame to the ratio of overhead size with the payload size of abundant increase, and this has increased communication speed in fact.
Second embodiment
To the feature that realize in the present embodiment be described briefly.Similar with first embodiment, when the data volume that will be transferred to the destination exceeds predetermined threshold, carry out the frame transmission.Yet the difference of this embodiment and first embodiment is, when determining the destination, has both considered data volume, considers to wait in formation the time period (queuing time) of the data that will be transferred to the destination candidate again.
Specifically, similar with first embodiment, this destination selected cell 12 is provided with suitable destination candidate based on threshold value A and threshold value B.At this moment, from the transmission buffer 11 of each destination candidate, read the time (memory time) of stores packets, and carry out the selection on actual purpose ground based on the memory time of reading.It should be noted that and refer to the time point of stores packets in transmission buffer 11 this memory time here.
With reference to figure 3, will the processing procedure of being carried out by destination selected cell 12 be described.In Fig. 3, step S11 to the processing of S14 corresponding to the processing of the step S1 that describes with reference to figure 2 to S4, and thus the general the descriptions thereof are omitted.When destination selected cell 12 determined that buffer size does not exceed threshold value B in step S12, this processing advanced to step S15.In addition, if suitable destination candidate is chosen as this destination, then this process advances to step S16 from step S14, and if suitable destination candidate is not chosen as this destination, then this process advances to step S15 from step S14.
At step S15, destination selected cell 12 is based on the memory time and the current time of the grouping of reading from transmission buffer 11, and calculates the queuing time of the grouping of suitable destination candidate.As mentioned above, this queuing time starts from the time point of stores packets in transmission buffer 11, and ends to read the time point of grouping by this transmission signals generation unit 13.Then, destination selected cell 12 determines whether the queuing time that is calculated exceeds threshold value C.This threshold value C is by allowing the value that corresponding value obtains from allowing to deduct the corresponding value of transmission delay with minimum with maximum.At step S15, if determine that this queuing time exceeds threshold value C, then this process advances to step S16.On the other hand, if determine that this queuing time does not exceed threshold value C, then this process advances to step S17.
At step S16, the suitable destination candidate of arbitrary condition that destination selected cell 12 satisfies definite operation of step S11, step S12 and step S13 is set to only destination candidate, and this process advances to step S17 then.
At step S17, destination selected cell 12 is read the number and the grouping dimension of the stored packet that will be transferred to another destination candidate from transmission buffer 11, and this process is returned step S11.
As mentioned above, exceed threshold value C if in step S15, determine the queuing time of this grouping, then be defined as in the process of the grouping of transmissions links, not causing that the transmission candidate of abundant efficient is set to only destination candidate by definite processing of step S11 and step S12 according to the destination selected cell 12 of present embodiment.
In the processing procedure of first embodiment, the transmission data (grouping) that be transferred to the destination candidate keep being stored in the formation of transmission buffer 11, till data satisfy arbitrary condition in definite processing of step S1 and step S2.Thus, the propagation delay time can exceed the maximum allowable delay time.On the other hand, in this embodiment, destination selected cell 12 can be chosen as the destination with each destination candidate, and does not allow the propagation delay time of the data of destination candidate to exceed the maximum allowable delay time.This also causes the increase of the efficiency of transmission that is caused by block chaining.
The 3rd embodiment
To the feature that will realize in the present embodiment be described briefly.For the application of some types that in the destination, adopt, can have such situation, wherein ask transfer of data to the destination, and do not occur with the process that generates transmission signals in gathering handle related delay.Thus, in the communication equipment according to present embodiment, whether the gathering that is identified for generating transmission frame according to application type is handled is effective.Then, based on this result who determine to handle selection algorithm that selects your destination.Utilize this configuration, can realize the increase of efficiency of transmission.
Hereinafter, the processing procedure of carrying out by according to the destination selected cell 12 of present embodiment will be described with reference to Figure 4.
At step S21, destination selected cell 12 determines whether to enable the block chaining cue mark that provided by transmission signals generation unit 13.In this step, if determine to have enabled this block chaining cue mark, then this process advances to step S22.On the other hand, if determine to have forbidden this block chaining cue mark, then this processing advances to step S23.In this step, these transmission signals generation unit 13 bases are used for the application of the data that will transmit of each transmission candidate, and determine whether to enable this block chaining cue mark.
At step S22, destination selected cell 12 selects your destination from the candidate of destination based on the maximum queue algorithm, and this process advances to step S24 then.According to the maximum queue algorithm, the destination candidate of the grouping of the maximum number that will store in the formation of transmission buffer 11 is chosen as this destination.
At step S23, destination selected cell 12 selects your destination from the candidate of destination based on round-robin algorithm, and this process advances to step S24 then.According to round-robin algorithm, give each destination candidate successively with transmission opportunity.
At step S24, destination selected cell 12 is handled by the selection of step S22 or step S23 and is determined the destination.
At step S25, destination selected cell 12 makes transmission signals generation unit 13 generate the transmission signals that will be transferred to determined destination.
As mentioned above, destination selected cell 12 uses maximum queue algorithm and round-robin algorithm, and selects one from these algorithms, thereby determines the destination.
Relevant with the processing of step S21, transmission signals generation unit 13 determines whether to enable the block chaining cue mark based on data type.For example, during the VoIP (based on the voice of Internet protocol) that sends and receive voice data therein by the TCP/IP network communicate by letter, the maintenance of having to of the maximum delay time of data was short as far as possible.When transmitting such data, transmission signals generation unit 13 is forbidden this block chaining cue mark.On the other hand, have such situation, even wherein increase maximum delay time in case of necessity, the communication speed of whole communication system is also had to high as far as possible.In this case, compare with the maximum queue algorithm, be utilized as the round-robin algorithm that each destination candidate equality gives transmission opportunity, the block chaining function can not effectively be worked.When transmitting and receive data under these circumstances, transmission signals generation unit 13 enables this block chaining cue mark.
Thus, according to the processing of destination selected cell 12, select suitable destination selection algorithm according to the application type of the data that will transmit.Utilize this configuration, can realize the efficiency of transmission of the increase in the transfer of data.
The 4th embodiment
To the feature that will realize in the present embodiment be described briefly.Can have such situation, wherein connect by TCP respectively transmit candidate in, utilize the maximum queue algorithm to carry out selection for the destination.In this case, finally may become unavailable to its transmission opportunity of only making the destination candidate of minority transmission attempt several times.In order to prevent that such transmission from disconnecting, in this embodiment, the queuing time that will be transferred to the data of each destination candidate is used as the factor that selects your destination.
With reference to figure 5, will the processing procedure of being carried out by destination selected cell 12 be described.To after the processing of the step S22 that describes with reference to figure 4, carry out this process.Thus, hypothesis goal ground selected cell 12 has been determined to have enabled the block chaining cue mark in the earlier stage of this process here, and has utilized the maximum queue algorithm to select the destination, and following then execution is with reprocessing.
At step S31, destination selected cell 12 candidate that from transmission buffer 11, selects your destination, and from the corresponding formation of transmission buffer 11, read memory time of the grouping that will be transferred to the destination candidate.
At step S32, destination selected cell 12 is according to the queuing time that calculates grouping memory time that reads.Then, destination selected cell 12 determines whether the queuing time that is calculated exceeds preset limit value.If determine that queuing time exceeds limit value, then process advances to step S33.On the other hand, if determine that queuing time does not exceed limit value, then termination.It should be noted that by deducting the value corresponding the value of allowing the propagation delay time correspondence from the maximum of the application type that depends on the data that will be transferred to the destination candidate, and obtain this limit value with predetermined tolerance limit.
At step S33, the destination candidate that destination selected cell 12 exceeds its queuing time the grouping of this limit value is chosen as actual purpose ground.Specifically, destination selected cell 12 is changed into the destination candidate that its queuing time exceeds the grouping of this limit value with this destination from the destination candidate that utilizes the maximum queue algorithm to select.
As previously mentioned, there is such situation, wherein when respectively transmitting candidate, utilizes the maximum queue algorithm to carry out the selection of destination by the TCP connection.In this case, can there be such situation, wherein may becomes unavailable to its transmission opportunity of only making the destination candidate of minority transmission attempt several times.In order to address this problem, in this embodiment, give each destination candidate coequally with transmission opportunity, do not allow the propagation delay time and do not allow propagation delay time of the data of each destination candidate to exceed maximum.So, can prevent related with the maximum queue algorithm, with the disconnection of communicating by letter of each destination candidate.
The 5th embodiment
In this embodiment, consider re-transmission number of attempt that each destination candidate is made.Then, reduced the transmission opportunity of it being made the destination candidate that is in poor communications status of a large amount of re-transmissions trials.On the other hand, preferentially increased the transmission opportunity of the destination candidate that has been in communications status.This configuration has increased the communication efficiency of whole communication system.
Specifically, transmission control unit 1 is counted the number for transmission attempts of each destination.When returning the ACK of the normal reception that is used for the notification transmission data from the destination, transmission control unit 1 is reset to 0 with the re-transmission number of attempt of this destination.
With reference now to Fig. 6,, will the processing procedure performed according to the destination selected cell 12 of this embodiment be described.This process will be carried out after the processing of the step S22 that describes with reference to figure 4.Thus, suppose that here this destination selected cell 12 determined to have enabled the block chaining cue mark in the earlier stage of this process, and utilize the maximum queue algorithm to select the destination, and following then execution is with reprocessing.
At step S41, destination selected cell 12 is read the number of the stored packet that will be transferred to the destination candidate from transmission buffer 11.
At step S42, the number of destination selected cell 12 by the stored packet that will be read be divided by the re-transmission number of attempt of the destination candidate having been made, and calculate assessed value.Then, destination selected cell 12 this assessed value and CurrentMax (current maximum) value relatively.If determine that this assessed value exceeds this CurrentMax value, then this process advances to step S43.On the other hand, if determine that this assessed value does not exceed this CurrentMax value, then stop this process.The initial value of this CurrentMax value is zero, and upgrades this CurrentMax value in the processing of following step S43.
At step S43, the assessed value that destination selected cell 12 will calculate in the processing of step S42 replaces with this CurrentMax value.
At step S44, destination selected cell 12 is chosen as interim destination with the destination candidate, and this process turns back to step S41.
As mentioned above, carry out this processing procedure, make each destination candidate is carried out assessment successively, and finally determine the destination thus.Thus, owing to the increase of assessed value along with the re-transmission number of attempt that the destination candidate is made reduces, so the possibility that this destination candidate is chosen as this destination will reduce.Therefore, can reduce re-transmission number of attempt, thereby can reduce the communication resource that branch is tasked this destination candidate the destination candidate that is in poor communications status.As a result, reduced communication speed with the destination candidate that is in poor communications status.Yet, can increase the communication speed in the whole communication system in fact.
The 6th embodiment
In this embodiment, the destination candidate that will be used for the data of following application preferentially is chosen as actual purpose ground, thereby increases the communication efficiency of whole communication system, in this is used, has to reduce the fluctuation of transmission delay and communication speed before transmission.
Transmission control unit 1 according to present embodiment provides priority destination form, is used to store the priority of having to higher than other destination candidates and comes to transmit to it priority destination candidate of data.This destination selected cell 12 utilizes this priority destination form to carry out processing procedure, and this will be described with reference to figure 7 below.
At step S51, this destination selected cell 12 is read priority destination candidate from the form of priority destination.
At step S52, this destination selected cell 12 determines whether grouping is stored in the formation of the transmission buffer 11 that is used for storing the data that will be transferred to the priority destination candidate that is read.Be stored in the formation if determine grouping, then process advances to step S53.On the other hand, if determine that grouping is not stored in the formation, then process advances to step S54.
At step S53, this destination selected cell 12 is chosen as the destination with this priority destination candidate.Then, this transmission signals generation unit 13 is that selected destination generates transmission signals.
At step S54, this destination selected cell 12 determines whether to read all priority destination candidates from this priority destination form.If determine to have read all priority destination candidates, then this process advances to step S55.If determine also not read all priority destination candidates, then this processing turns back to step S51.
At step S55, the step S21 of 12 pairs of destination candidate execution graphs 4 except this priority destination candidate of this destination selected cell is to the processing of step S25, so that select your destination.Then, this transmission signals generation unit 13 is that selected destination generates transmission signals.
As mentioned above, this destination selected cell 12 at first preferentially selects priority destination candidate as this destination, and then other destination candidates is started destination selection processing.Thus, when will asking when the destination candidate that its fluctuation with the transmission delay that reduces and transmission speed sends data is stored in the form of priority destination, this destination selected cell 12 can be selected this destination, thereby satisfies this request.
Should be appreciated that those of ordinary skills can carry out various modifications, combination, sub-portfolio and replacement according to design requirement and other factors, as long as they fall in claims or its equivalent scope.
Claims (9)
1. communication equipment comprises:
Memory cell has the corresponding a plurality of storage areas of a plurality of candidates with the destination of the data that will transmit;
Detecting unit is used for detecting in each storage area data quantity stored;
The destination selected cell is used at least based on the data volume that this detecting unit detected, and selects your destination from the candidate of described destination; With
The transmission signals generation unit is used for reading the scheduled traffic data that will be transferred to the destination of being selected by this destination selected cell from the storage area of correspondence, and generates transmission signals.
2, communication equipment as claimed in claim 1,
Wherein:
This detecting unit detects the stores packets number and the grouping dimension of each destination candidate from each storage area;
This destination selected cell is provided with the predetermined threshold of stores packets number and grouping dimension, the destination candidate that in its number or the size at least one exceeds the grouping of corresponding threshold value is set to suitable destination candidate, and selects your destination from a plurality of suitable destination candidates; With
This transmission signals generation unit link is used for a plurality of groupings of this destination, thereby generates this transmission signals.
3, communication equipment as claimed in claim 2,
Wherein:
Except the grouping number and grouping dimension that are used for each destination candidate, this detecting unit detects the transmission packets stand-by period from each storage area, this transmission latency starts from the time point of stores packets in this memory cell, and ends to read the time point of grouping by this transmission signals generation unit; With
This destination selected cell is provided with the threshold value of this transmission latency, and has precedence over described suitable destination candidate and select its transmission latency to exceed the destination candidate of grouping of this threshold value as this destination.
4, communication equipment as claimed in claim 1,
Wherein:
Whether this transmission signals generation unit is effective and determine to link a plurality of groupings with the generation transmission signals based on the performed testing result of this detecting unit; And
This destination selected cell is used for:
If determine that a plurality of groupings of link are effective to generate transmission signals, then select your destination candidate as the algorithm of destination and select your destination based on being used for from the destination candidate from the candidate of destination, selected destination candidate is used for the grouping of the maximum number that memory cell stores; With
If determining a plurality of groupings of link is not effectively to generate transmission signals, then based on being used for selecting successively each destination candidate to select your destination from the destination candidate as the algorithm of destination.
5, communication equipment as claimed in claim 1,
Wherein:
This detecting unit detects grouping number, grouping dimension and the transmission packets time of each transmission candidate from each storage area; With
This destination selected cell is provided with the predetermined threshold of the stores packets number, grouping dimension and transmission packets each in the time that are detected, and from the candidate of destination, selecting your destination candidate as the destination, selected destination candidate is used for the grouping that its number, size or transmission time at least exceed corresponding threshold value.
6, communication equipment as claimed in claim 1,
Wherein:
This detecting unit detects the number of the stores packets of each destination candidate from each storage area; With
This destination selected cell calculates the assessed value that the number by the stores packets that will be detected obtains divided by the re-transmission number of attempt of each destination candidate, and the destination candidate that will have a maximum assessed value is chosen as the destination.
7, communication equipment as claimed in claim 1 also comprises priority destination form, is used for storing at least one priority destination candidate of selecting from the destination candidate,
Wherein:
This detecting unit detects the number of the stores packets that is used for this priority destination candidate from the corresponding stored zone; With
The priority destination candidate of the grouping that its number that this destination selected cell determines whether to exist this detecting unit to detect is non-vanishing, if thereby definite priority destination candidate that has the non-vanishing grouping of its number, have precedence over other destination candidates and this priority destination candidate is chosen as the destination, if and definite priority destination candidate that does not have the non-vanishing grouping of its number, then from described other destination candidates, select your destination.
8, a kind of transfer control method that is used for communication equipment, the method comprising the steps of:
From memory cell, detect data quantity stored in each storage area with a plurality of storage areas corresponding with a plurality of candidates of the destination of the data that will transmit;
At least based on the data volume that in detecting step, detects, and from this destination candidate, select your destination; With
From the storage area of correspondence, read the scheduled traffic data that is used for selected destination, and generate transmission signals.
9, a kind of transmission control procedure of being carried out by the computer that provides in the communication equipment, this communication equipment are used to carry out and the communicating by letter of a plurality of destinations candidate, and this program comprises step:
From memory cell, detect data quantity stored in each storage area with a plurality of storage areas corresponding with a plurality of candidates of the destination of the data that will transmit;
At least based on the data volume that in detecting step, detects, and from the candidate of described destination, select your destination; With
From the storage area of correspondence, read the scheduled traffic data that is used for selected destination, and generate transmission signals.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP2006073186A JP4396657B2 (en) | 2006-03-16 | 2006-03-16 | Communication apparatus, transmission control method, and transmission control program |
| JP073186/06 | 2006-03-16 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101039273A true CN101039273A (en) | 2007-09-19 |
| CN101039273B CN101039273B (en) | 2012-01-04 |
Family
ID=38595478
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2007100885541A Expired - Fee Related CN101039273B (en) | 2006-03-16 | 2007-03-16 | Communication equipment, transmission control method and transmission control program |
Country Status (4)
| Country | Link |
|---|---|
| US (1) | US7924721B2 (en) |
| JP (1) | JP4396657B2 (en) |
| KR (1) | KR20070094497A (en) |
| CN (1) | CN101039273B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101408544B1 (en) * | 2007-05-07 | 2014-06-17 | 삼성전자주식회사 | Method for transmitting / receiving data in short distance wireless communication |
| US20090185487A1 (en) * | 2008-01-22 | 2009-07-23 | International Business Machines Corporation | Automated advance link activation |
| JP5552929B2 (en) * | 2010-07-09 | 2014-07-16 | 富士通株式会社 | Telegram transmission control program, communication apparatus, and telegram transmission control method |
| JP5618745B2 (en) * | 2010-10-06 | 2014-11-05 | キヤノン株式会社 | COMMUNICATION DEVICE, COMMUNICATION METHOD, AND PROGRAM |
| JP5707576B2 (en) * | 2011-09-30 | 2015-04-30 | サイレックス・テクノロジー株式会社 | Network transmitter and program thereof |
| JP6341201B2 (en) * | 2013-06-06 | 2018-06-13 | 日本電気株式会社 | Content relay device, content flow relay method and program |
| JP6082330B2 (en) * | 2013-08-19 | 2017-02-15 | 株式会社Ｋｄｄｉ総合研究所 | Communication apparatus, program, and method for increasing accommodation efficiency of aggregated packets for each path in consideration of allowable waiting time |
| JP6082331B2 (en) * | 2013-08-21 | 2017-02-15 | 株式会社Ｋｄｄｉ総合研究所 | COMMUNICATION DEVICE, PROGRAM, AND METHOD FOR IMPROVING AGGREGATED PACKET CONTAINING EFFICIENCY CONSIDERING ALLOWING WAIT |
| WO2015118870A1 (en) * | 2014-02-06 | 2015-08-13 | 日本電気株式会社 | Packet transmission system, packet transmission apparatus, and packet transmission method |
| WO2016163043A1 (en) * | 2015-04-10 | 2016-10-13 | 株式会社ソリトンシステムズ | Electronic mail transmission error determination device, electronic mail transmission system, and recording medium |
| JP2017163440A (en) * | 2016-03-11 | 2017-09-14 | 富士通株式会社 | Data transfer program, data transfer method, and data transfer device |
| US10524230B1 (en) * | 2017-06-21 | 2019-12-31 | Sprint Spectrum L.P. | Dynamic paging concatenation methods and systems |
Family Cites Families (33)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH02218241A (en) * | 1989-02-18 | 1990-08-30 | Fujitsu Ltd | Fast packet transfer control system |
| JPH0413390A (en) * | 1990-05-02 | 1992-01-17 | Oki Electric Ind Co Ltd | Picture packet multiplexer |
| JPH082054B2 (en) * | 1990-08-17 | 1996-01-10 | 松下電器産業株式会社 | Multi-stage connection cell transfer circuit |
| JPH06197120A (en) * | 1992-12-24 | 1994-07-15 | Nippon Telegr & Teleph Corp <Ntt> | Cell multiplex circuit |
| JPH0779252A (en) * | 1993-09-08 | 1995-03-20 | Fujitsu Ltd | Packet output control method |
| US5812775A (en) * | 1995-07-12 | 1998-09-22 | 3Com Corporation | Method and apparatus for internetworking buffer management |
| JP3079072B2 (en) * | 1996-09-25 | 2000-08-21 | 日本電信電話株式会社 | Competition control circuit |
| JP3196107B2 (en) * | 1997-03-27 | 2001-08-06 | 日本電気エンジニアリング株式会社 | Data exchange system |
| JPH1117685A (en) * | 1997-06-20 | 1999-01-22 | Oki Electric Ind Co Ltd | Band management circuit, transmitter and transmission system |
| US6480477B1 (en) * | 1997-10-14 | 2002-11-12 | Innowave Eci Wireless Systems Ltd. | Method and apparatus for a data transmission rate of multiples of 100 MBPS in a terminal for a wireless metropolitan area network |
| US6421348B1 (en) * | 1998-07-01 | 2002-07-16 | National Semiconductor Corporation | High-speed network switch bus |
| JP3206579B2 (en) * | 1999-01-13 | 2001-09-10 | 日本電気株式会社 | Address area detection device |
| JP3587352B2 (en) * | 1999-02-04 | 2004-11-10 | 富士通株式会社 | Network communication performance measurement method and apparatus, and computer-readable recording medium storing network communication performance measurement program |
| JP2000307582A (en) * | 1999-04-26 | 2000-11-02 | Nippon Telegr & Teleph Corp <Ntt> | Fixed length packet switch |
| EP1411700B8 (en) * | 1999-08-06 | 2006-08-30 | Matsushita Electric Industrial Co., Ltd. | Data transmission method, data transmission apparatus, and data reception apparatus |
| JP3590751B2 (en) * | 2000-02-17 | 2004-11-17 | 日本電信電話株式会社 | Packet multiplexer |
| US6859824B1 (en) * | 2000-06-30 | 2005-02-22 | Hitachi, Ltd. | Storage system connected to a data network with data integrity |
| JP4691804B2 (en) | 2001-03-02 | 2011-06-01 | ソニー株式会社 | Wireless transmission apparatus and wireless transmission method |
| US7103350B2 (en) | 2001-11-16 | 2006-09-05 | Nortel Networks Limited | Scheduler with fairness control and quality of service support |
| US20030095447A1 (en) | 2001-11-20 | 2003-05-22 | Koninklijke Philips Electronics N.V. | Shared memory controller for display processor |
| JP3904922B2 (en) * | 2001-12-28 | 2007-04-11 | 株式会社日立製作所 | Traffic shaper and concentrator |
| JP3828431B2 (en) * | 2002-01-31 | 2006-10-04 | 株式会社エヌ・ティ・ティ・ドコモ | Base station, control apparatus, communication system, and communication method |
| JP3828444B2 (en) * | 2002-03-26 | 2006-10-04 | 株式会社日立製作所 | Data communication relay device and system |
| US7260645B2 (en) * | 2002-04-26 | 2007-08-21 | Proficient Networks, Inc. | Methods, apparatuses and systems facilitating determination of network path metrics |
| JP3981819B2 (en) * | 2002-08-08 | 2007-09-26 | 日本電気株式会社 | Dynamic queuing buffer control method and system |
| WO2005010766A1 (en) * | 2003-07-24 | 2005-02-03 | Fujitsu Limited | Data storage system |
| JP4100346B2 (en) | 2004-01-13 | 2008-06-11 | トヨタ自動車株式会社 | Engine fuel injection control device |
| JP4317788B2 (en) * | 2004-05-21 | 2009-08-19 | 株式会社日立コミュニケーションテクノロジー | Shaping device, flow control method, and communication node device |
| JP4324054B2 (en) * | 2004-08-25 | 2009-09-02 | 日本電信電話株式会社 | Service quality assurance method, service quality assurance device, service quality assurance program, and recording medium recording the program |
| US7395396B2 (en) * | 2004-08-30 | 2008-07-01 | Hitachi, Ltd. | Storage system and data relocation control device |
| JP4933861B2 (en) * | 2005-09-22 | 2012-05-16 | 株式会社日立製作所 | Storage control device, data management system, and data management method |
| JP4694350B2 (en) * | 2005-11-08 | 2011-06-08 | 株式会社日立製作所 | Managing the number of disk groups that can be started in the storage device |
| JP4749140B2 (en) * | 2005-12-05 | 2011-08-17 | 株式会社日立製作所 | Data migration method and system |
-
2006
- 2006-03-16 JP JP2006073186A patent/JP4396657B2/en not_active Expired - Fee Related
-
2007
- 2007-03-09 US US11/715,930 patent/US7924721B2/en not_active Expired - Fee Related
- 2007-03-15 KR KR20070025369A patent/KR20070094497A/en not_active Withdrawn
- 2007-03-16 CN CN2007100885541A patent/CN101039273B/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| US20070268897A1 (en) | 2007-11-22 |
| US7924721B2 (en) | 2011-04-12 |
| JP2007251653A (en) | 2007-09-27 |
| KR20070094497A (en) | 2007-09-20 |
| CN101039273B (en) | 2012-01-04 |
| JP4396657B2 (en) | 2010-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101039273A (en) | Communication equipment, transmission control method and transmission control program | |
| CN1175702C (en) | Method of controlling bearer properties and system for controlling bearer properties | |
| CN1188991C (en) | Communication device and method for reliable and low-delay packet transmission | |
| CN1297118C (en) | Bandwidth monitor and control equipment | |
| CN1282346C (en) | Reliable broadcasting data grouping system and method under specific network environment | |
| CN1175701C (en) | Base station device and wireless communication method | |
| JP2002112321A (en) | Communication device and communication line allocation method | |
| CN1822555A (en) | Method and apparatus for iteratively determining mobile device-to-access point associations to achieve load balancing | |
| CN1695331A (en) | Method and apparatus for managing data link resource usage | |
| CN1423869A (en) | Link Layer acknowledgement and retransmission for cellular telecommunications | |
| CN1878049A (en) | Method of controlling transmission rate by using error correction packets and communication apparatus using the same | |
| CN1496157A (en) | Data retransmission control method for mobile communication system | |
| CN1235729A (en) | Multi-protocol telecommunications routing optimization | |
| CN1642172A (en) | Method and system for transmit scheduling for multi-layer network interface controller (NIC) operation | |
| CN1816016A (en) | Routing method and apparatus for reducing loss of ip packets | |
| CN1270731A (en) | Communication method and system | |
| CN1198410C (en) | Retry control method and device | |
| CN1889527A (en) | Load sharing apparatus and method for realizing multi-chain circuit transmission | |
| CN101873269A (en) | Data retransmission device and method for distributing buffer to ports | |
| CN1270560C (en) | Radio base station apparatus | |
| CN1836411A (en) | Session relay device and relay method | |
| CN1610339A (en) | Method and apparatus for transmitting and recovering data packets | |
| CN1848806A (en) | Method and related device for resetting the receiving window size of a communication system | |
| CN1290434A (en) | Rlp communication device and method for mobile communication system | |
| CN1571418A (en) | A method and system for implementing data transmission in flow control transmission protocol |
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: 20120104 Termination date: 20120316 |