EP1076964A1 - Method for controlling the message flow in a communication network - Google Patents
Method for controlling the message flow in a communication networkInfo
- Publication number
- EP1076964A1 EP1076964A1 EP99923522A EP99923522A EP1076964A1 EP 1076964 A1 EP1076964 A1 EP 1076964A1 EP 99923522 A EP99923522 A EP 99923522A EP 99923522 A EP99923522 A EP 99923522A EP 1076964 A1 EP1076964 A1 EP 1076964A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- message
- station
- receiving station
- transmitting
- transmission window
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims description 9
- 230000005540 biological transmission Effects 0.000 claims abstract description 30
- 239000000872 buffer Substances 0.000 claims description 13
- 230000000903 blocking effect Effects 0.000 claims description 2
- 238000012790 confirmation Methods 0.000 claims 4
- 230000001105 regulatory effect Effects 0.000 abstract 1
- 230000008859 change Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 108010032250 DNA polymerase beta2 Proteins 0.000 description 3
- 102100029765 DNA polymerase lambda Human genes 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 2
- 230000002269 spontaneous effect Effects 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 230000007423 decrease Effects 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000032258 transport Effects 0.000 description 1
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/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/27—Evaluation or update of window size, e.g. using information derived from acknowledged [ACK] packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/54—Store-and-forward switching systems
- H04L12/56—Packet switching systems
- H04L12/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5629—Admission control
- H04L2012/563—Signalling, e.g. protocols, reference model
Definitions
- the recipient can determine the size of the window dynamically, one also speaks of lending by the recipient, i.e. the credit sets the upper limit of the transmission window.
- the recipient uses the lending to adjust the transmission power according to the resources available to him, including also control the available receive buffer.
- At least one already defined protocol uses the same messages for lending, which are also used for positive or negative acknowledgment. If, in such a method, the time and frequency of the receipts are essentially checked by the sender (such as in Q.2110, where an acknowledgment is only based on a previous request by the sender (exception: if message loss is detected, Q.2110 spontaneously by the receiver, ie sent a negative acknowledgment without request)), the time and frequency of the modifications to the transmission window are also determined by the transmitter. However, this is an essential contradiction to the fact that the control of the transmission window by the receiver is carried out in dependence on the resources available to him.
- the invention has for its object to avoid the disadvantages mentioned.
- the transmitter is informed of the currently desirable transmission window even without the presence of message losses and without an explicit request (request) from the transmitter (such as, for example, through a POLL-PDU in Q.2110).
- This measure is used to counteract blockages in the message flow and overloading the receiving station.
- this measure can be achieved, for example, in Q.2110 by the receiver notifying the transmitter of any changes to the reception window by spontaneously sending a so-called STAT-PDU.
- Another reason for an advantageous spontaneous transmission of a STAT-PDU can also consist, for example, of the transmitter 3 spontaneously acknowledge (confirm) messages without waiting for a request.
- a particular advantage of the invention can be seen in the fact that, although not provided in Q.2110, a STAT-PDU can also be transmitted spontaneously by the receiver, without resulting in a protocol violation of Q.2110 at the transmitter.
- the invention By applying the invention to Q.2110, the disadvantages described above are avoided without the protocol of Q.2110 having to be violated.
- the receiver spontaneously sends a STAT-PDU with the modified transmission window.
- Cases of a desirable change are e.g. if the current capacity of the recipient's receive buffer falls below a certain threshold and / or the number of useful messages that a sender is still allowed to send to a connection falls below a certain value.
- N (R) is assigned the current value of VR (R).
- the POLL sequence number N (PS) is set to the value of the last received POLL PDU
- FIG. 1 shows the principle of the credit update
- Mechanism according to Q.2110 in the form of an arrow diagram, the arrows representing the transmitted or received PDUs.
- the transmitter When the transmission begins with the SD-PDU 21, the transmitter has a previously received credit (e.g. via a previously received STAT-PDU) for the transmission of SD-PDUs up to and including the SD-PDU 26, i.e. the state variable VT (MS) of the transmitter has the value 27.
- a previously received credit e.g. via a previously received STAT-PDU
- MS state variable VT
- the receiver After receiving the SD-PDU 23, the receiver determines that it can now extend the credit up to and including the SD-PDU 29, i.e. he sets his state variable VR (MR) to the value 30. According to Q.2110, however, he cannot inform the sender of the now expanded credit at this time.
- MR state variable
- the sender who sent the SD-PDU 26 must suspend the transmission of further SD-PDUs until he receives another credit.
- FIG. 2 shows an example of the principle of the credit update mechanism according to the invention, again in the form of an arrow diagram in which the arrows represent the transmitted or received PDUs.
- the sender has a credit previously received (e.g. via a previous STAT-PDU) for sending SD-PDUs up to sequence number 26 inclusive, i.e. the transmitter status variable VT (MS) has the value 27.
- MS transmitter status variable
- the receiver After receiving the SD-PDU 23, the receiver determines that it can now extend the credit up to and including the SD-PDU 29, i.e. he sets his receiver status variable VR (MR) to the value 30. He also informs the sender of the extended credit using a STAT-PDU with the number 52, i.e. the number of the previously received POLL-PDU, without waiting for another POLL-PDU that could serve as a trigger for sending a STAT-PDU.
- MR receiver status variable
- the sender is thus informed about the extended credit so early that he does not have to suspend the transmission.
- FIG. 3 shows an example of the credit update mechanism according to the invention after a gap in the reception buffer has been closed, again in the form of an arrow diagram in which the arrows represent the transmitted or received PDUs.
- the receiver makes the receive buffer available for six SD-PDUs and extends the credit according to this available receive capacity. Whenever three SD-PDUs have been received in sequence and have been delivered to the SSCOP user, the receiver grants the transmitter (transmitter) an additional three credit, which in turn is the total credit 6 out of six manufactures. However, if an SD-PDU is lost and has to be sent again, receive buffers remain occupied for a long time, thereby delaying the possibility of granting a new loan.
- the transmitter has a previously received credit (e.g. via a previously received STAT-PDU) for sending SD-PDUs up to sequence number 26, i.e. the state variable VT (MS) of the transmitter has the value 27.
- a previously received credit e.g. via a previously received STAT-PDU
- MS state variable VT
- the receiver determines that it has lost the SD-PDU 22. According to Q.2110, he notifies the sender of this fact with the help of a USTAT-PDU and at the same time extends the credit by an SD-PDU, i.e. up to sequence number 28, since he has already delivered the SD-PDU 21 to the user at this time.
- the SD-PDUs 22 to 25 can be delivered to the SSCOP user and the reception buffer is thus again available for six SD-PDUs, ie the credit can therefore be used except for the sequence number 32 can be expanded.
- the recipient immediately informs the sender of the extended credit with the aid of a STAT-PDU of sequence number 53, that is, the number of the POLL-PDU received and returned earlier, without waiting for another POLL-PDU for which it is waiting usually would have to wait as a trigger to send a STAT-PDU.
- FIG. 4A shows modifications in the SSCOP which serve to call the algorithm in FIG. 4B (the modifications mentioned are shaded dark).
- FIG. 4B shows the algorithm called up by the modifications mentioned in SDL form. According to this algorithm, credit may be reduced to the number of available buffers if the number of available buffers decreases too much, or credit is increased if the number of available buffers allows it and the still available credit has dropped below a certain threshold.
- FIG. 4C shows an illustration of the algorithm according to FIG. 4B.
- VR (MR) V (R) +23. It is now assumed that the SD-PDU with the sequence number
- VR (R) has been received, closing the gap and causing 4 SD-PDUs to be delivered to the SSCOP user.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Communication Control (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Beschreibungdescription
Verfahren zur Steuerung des Nachrichtenflusses in einem KommunikationsnetzMethod for controlling the flow of messages in a communication network
Viele Kommunikationsprotokolle benötigen einen Regelkreislauf zwischen Sender und Empfänger derart, daß der Empfänger die Senderate des Senders zu steuern vermag. Vielfach wird dies durch explizite oder implizite Festlegung eines Sendefensters bewerkstelligt, wobei der Sender nur eine bestimmte Anzahl von nicht-quittierten Nachrichten ausstehen haben darf.Many communication protocols require a control loop between the transmitter and the receiver in such a way that the receiver can control the transmission rate of the transmitter. In many cases, this is accomplished by explicitly or implicitly specifying a transmission window, the sender being only allowed to have a certain number of unacknowledged messages.
Speziell wenn der Empfänger die Größe des Fensters dynamisch festlegen kann, spricht man dabei auch von Kreditvergabe durch den Empfänger, d.h. der Kredit legt die obere Grenze des Sendefensters fest. Der Empfänger benützt die Kreditvergabe dazu, den Sendestrom gemäß der ihm zur Verfügung stehenden Resourcen, u.a. auch der zur Verfügung stehenden Empfangspuffer, zu steuern.Especially if the recipient can determine the size of the window dynamically, one also speaks of lending by the recipient, i.e. the credit sets the upper limit of the transmission window. The recipient uses the lending to adjust the transmission power according to the resources available to him, including also control the available receive buffer.
Zumindest ein bereits definiertes Protokoll (Q.2110) benützt zur Kreditvergabe dieselben Nachrichten, welche auch zur positiven bzw. negativen Quittierung benützt werden. Wenn bei einem solchen Verfahren ferner Zeitpunkt und Frequenz der Quittungen im wesentlichen durch den Sender kontrolliert werden (wie z.B. in Q.2110, wo eine Quittung nur aufgrund einer vorherigen Anforderung durch den Sender erfolgt (Ausnahme: bei Erkennen von Nachrichtenverlusten wird in Q.2110 vom Empfänger spontan, d.h. auch ohne Anforderung eine negative Quittung gesandt) ) , so werden auch Zeitpunkt und Frequenz der Modifikationen des Sendefensters durch den Sender bestimmt. Dies steht jedoch im essentiellen Widerspruch zu der Tatsache, daß die Kontrolle des Sendefensters durch den Empfänger in-Abhängigkeit von den ihm zur Verfügung stehenden Resourcen erfolgt. 2 Aufgrund der genannten Kontrolle durch den Sender kommt es zu Situationen, in denen der Empfänger erst nach Eintreffen einer entsprechenden (Kredit-) Anforderung dem Sender eine Änderung des Empfangsfensters mitteilen kann und nicht unmittelbar nach Eintreten der Änderung. Die entstehenden Nachteile sind zweifach. Einereits kann es durch verzögerte Kreditvergabe zu prinzipiell vermeidbaren Blockierungen des Nachrichtenflusses kommen. Andererseits kann es durch verzögerte Kreditreduktion zu einer vermeidbaren Belastung des Empfängers kommen, wodurch es z.B. zu Nachrichtenverlust auf anderen Übertragungsstrecken (Links) und/oder anderen Verbindungen, welche durch dieselbe Empfangs-Vorrichtung (Empfangsstation) kontrolliert werden, kommen kann.At least one already defined protocol (Q.2110) uses the same messages for lending, which are also used for positive or negative acknowledgment. If, in such a method, the time and frequency of the receipts are essentially checked by the sender (such as in Q.2110, where an acknowledgment is only based on a previous request by the sender (exception: if message loss is detected, Q.2110 spontaneously by the receiver, ie sent a negative acknowledgment without request)), the time and frequency of the modifications to the transmission window are also determined by the transmitter. However, this is an essential contradiction to the fact that the control of the transmission window by the receiver is carried out in dependence on the resources available to him. 2 Due to the aforementioned control by the sender, there are situations in which the recipient can only notify the sender of a change in the reception window after a corresponding (credit) request has been received, and not immediately after the change has occurred. The disadvantages that arise are twofold. On the one hand, delayed lending can in principle prevent the message flow from being blocked. On the other hand, delayed credit reduction can lead to an avoidable burden on the recipient, which can result, for example, in message loss on other transmission links and / or other connections which are controlled by the same receiving device (receiving station).
Der Erfindung liegt die Aufgabe zugrunde, die genannten Nachteile zu vermeiden.The invention has for its object to avoid the disadvantages mentioned.
Diese Aufgabe wird durch ein Verfahren nach Anspruch 1 erfüllt.This object is achieved by a method according to claim 1.
Im folgenden wird die Erfindung näher erläutert,The invention is explained in more detail below.
Erfindungsgemäß wird dem Sender das aktuell wünschenswerte Sendefenster auch ohne Vorliegen von Nachrichtenverlusten und ohne einer expliziten Aufforderung (Anforderung) durch den Sender (wie z.B. durch eine POLL-PDU in Q.2110) mitgeteilt. Diese Maßnahme wird angewandt, um einerseits Blockierungen des Nachrichtenflusses und andereseits Überbelastungen der Empfangsstation entgegenzuwirken.According to the invention, the transmitter is informed of the currently desirable transmission window even without the presence of message losses and without an explicit request (request) from the transmitter (such as, for example, through a POLL-PDU in Q.2110). This measure is used to counteract blockages in the message flow and overloading the receiving station.
Im speziellen kann diese Maßnahme z.B. in Q.2110 dadurch erreicht werden, daß der Empfänger bei notwendigen Veränderungen des Empfangsfensters dies dem Sender durch ein spontanes Aussenden einer sogenannten STAT-PDU mitteilt. Ein weiterer Grund zu einem vorteilhaften spontanen Aussenden einer STAT-PDU kann z.B. auch darin bestehen, dem Sender 3 spontan Nachrichten zu quittieren (bestätigen) , ohne auf eine Aufforderung zu warten.In particular, this measure can be achieved, for example, in Q.2110 by the receiver notifying the transmitter of any changes to the reception window by spontaneously sending a so-called STAT-PDU. Another reason for an advantageous spontaneous transmission of a STAT-PDU can also consist, for example, of the transmitter 3 spontaneously acknowledge (confirm) messages without waiting for a request.
Ein besonderer Vorteil der Erfindung ist darin zu sehen, daß, obwohl in Q.2110 nicht vorgesehen, eine STAT-PDU auch spontan durch den Empfänger ausgesendet werden kann, ohne daß es dadurch zu einer Protokollverletzung von Q.2110 beim Sender kommt. Durch die Anwendung der Erfindung bei Q.2110 werden also die oben beschriebenen Nachteile vermieden, ohne daß das Protokoll von Q.2110 verletzt werden muß.A particular advantage of the invention can be seen in the fact that, although not provided in Q.2110, a STAT-PDU can also be transmitted spontaneously by the receiver, without resulting in a protocol violation of Q.2110 at the transmitter. By applying the invention to Q.2110, the disadvantages described above are avoided without the protocol of Q.2110 having to be violated.
Im folgenden wird die Anwendung der Erfindung bei Q.2110 kurz erläutert.The application of the invention to Q.2110 is briefly explained below.
Tritt der Fall einer wünschenswerten Änderung desIf the case of a desirable change in the
Sendefensters ein, sendet der Empfänger spontan eine STAT-PDU mit dem geänderten Sendefenster . Fälle einer wünschenswerten Änderung liegen z.B. vor, wenn die aktuelle Kapazität des Empfangsbuffers des Empfängers eine bestimmte Schwelle unterschreitet, und/oder die Anzahl der Nutz-Nachrichten, die ein Sender zu einer Verbindung noch unbestätigt senden darf, einen bestimmten Wert unterschreitet.Transmission window, the receiver spontaneously sends a STAT-PDU with the modified transmission window. Cases of a desirable change are e.g. if the current capacity of the recipient's receive buffer falls below a certain threshold and / or the number of useful messages that a sender is still allowed to send to a connection falls below a certain value.
Ferner wird eine spontane STAT-PDU gesendet, wenn durch Empfang einer SD-PDU eine Lücke im Empfangspuffer geschlossen wird. Dadurch wird ebenfalls einer möglichen Blockierung des Nachrichtenflusses entgegengewirkt. Empfangslücken werden dabei nicht mitgeteilt. N(R) wird wie üblich mit dem aktuellen Wert con VR(R) belegt. Die POLL-Sequenznummer N(PS) wird auf den Wert der zuletzt empfangen POLL-PDU gesetztFurthermore, a spontaneous STAT-PDU is sent if a gap in the receive buffer is closed by receiving an SD-PDU. This also counteracts a possible blocking of the message flow. Gaps in reception will not be communicated. As usual, N (R) is assigned the current value of VR (R). The POLL sequence number N (PS) is set to the value of the last received POLL PDU
(bzw. 0, falls noch keine POLL-PDU empfangen worden war) . Zur leichteren Verwaltung kann eine zusätliche Empfängerzustandsvaribale VR(PS) eingeführt werden, welche mit 0 initialisiert wird und in der N(PS) einer erhaltenen POLL-PDU abgespeichert wird. 4 Im folgenden wird der Kredit-Aufdatierungs-Mechanismus gemäß Q.2110 sowie gemäß der Erfindung anhand der Figuren 1 bis 4 nochmals beispielhaft erläutert.(or 0 if no POLL-PDU had been received yet). For easier administration, an additional receiver status variable VR (PS) can be introduced, which is initialized with 0 and stored in the N (PS) of a received POLL-PDU. 4 In the following, the credit update mechanism according to Q.2110 and according to the invention is explained again by way of example with reference to FIGS. 1 to 4.
Figur 1 zeigt das Prinzip des Kredit-Aufdatierungs-FIG. 1 shows the principle of the credit update
Mechanismusses gemäß Q.2110 in Form eines Pfeildiagramms, wobei die Pfeile die übertragenen bzw. empfangenen PDUs darstellen.Mechanism according to Q.2110 in the form of an arrow diagram, the arrows representing the transmitted or received PDUs.
Wenn das Senden (Transmission) mit der SD-PDU 21 beginnt, hat der Sender (Transmitter) einen vorher empfangenen Kredit (z.B. über eine vorher empfangene STAT-PDU) zur Übertragung von SD-PDUs bis zur SD-PDU 26 einschließlich, d.h. die Zustandsvariable VT (MS) des Senders hat den Wert 27.When the transmission begins with the SD-PDU 21, the transmitter has a previously received credit (e.g. via a previously received STAT-PDU) for the transmission of SD-PDUs up to and including the SD-PDU 26, i.e. the state variable VT (MS) of the transmitter has the value 27.
Nachdem der Empfänger die SD-PDU 23 empfangen hat, stellt er fest, daß er den Kredit nunmehr bis einschließlich SD-PDU 29 erweitern kann, d.h. er setzt seine Zustandsvariable VR(MR) auf den Wert 30. Gemäß Q.2110 kann er jedoch zu diesem Zeitpunkt den Sender nicht von dem nunmehr erweiterten Kredit informieren.After receiving the SD-PDU 23, the receiver determines that it can now extend the credit up to and including the SD-PDU 29, i.e. he sets his state variable VR (MR) to the value 30. According to Q.2110, however, he cannot inform the sender of the now expanded credit at this time.
Erst sobald die POLL-PDU#53, die nach der SD-PDU 25 gesendet wird, den Empfänger erreicht, kann der Empfänger darauf mit einer STAT-PDU mit der Nummer 53 antworten, wobei diese STAT- PDU den neuen Kreditwert 30 in dem PDU-Parameter (MR) enthält.Only as soon as the POLL-PDU # 53, which is sent after the SD-PDU 25, reaches the receiver, can the receiver respond to this with a STAT-PDU with the number 53, this STAT-PDU having the new credit value 30 in the PDU Contains parameters (MR).
In der Zwischenzeit muß der Sender, der die SD-PDU 26 gesendet hat, die Übertragung von weiteren SD-PDUs suspendieren, bis er einen weiteren Kredit empfängt.In the meantime, the sender who sent the SD-PDU 26 must suspend the transmission of further SD-PDUs until he receives another credit.
Erst nachdem der Sender die STAT-PDU#53, die einen weiteren Kredit enthält, empfangen hat, kann er mit dem Senden von SD- PDUs fortfahren. 5 Figur 2 zeigt beispielhaft das Prinzip des erfindungsgemäßen Kredit-Aufdatierungs-Mechanismusses, wiederum in Form eines Pfeildiagramms, in dem die Pfeile die übertragenen bzw. empfangenen PDUs repräsentieren.Only after the sender has received the STAT-PDU # 53, which contains another credit, can it continue to send SD-PDUs. 5 FIG. 2 shows an example of the principle of the credit update mechanism according to the invention, again in the form of an arrow diagram in which the arrows represent the transmitted or received PDUs.
Wenn das Senden mit der SD-PDU 21 beginnt, hat der Sender einen vorher (z.B. via eine fühere STAT-PDU) empfangenen Kredit zum Senden von SD-PDUs bis zur Sequenznummer 26 einschließlich, d.h. die Sender-Zustandsvariable VT (MS) hat den Wert 27.If the transmission starts with the SD-PDU 21, the sender has a credit previously received (e.g. via a previous STAT-PDU) for sending SD-PDUs up to sequence number 26 inclusive, i.e. the transmitter status variable VT (MS) has the value 27.
Nachdem der Empfänger die SD-PDU 23 empfangen hat, stellt er fest, daß er den Kredit nun bis zur SD-PDU 29 einschließlich ausdehnen kann, d.h. er setzt seine Empfänger- Zustandsvariable VR(MR) auf den Wert 30. Außerdem informiert er den Sender von dem erweiterten Kredit mit Hilfe einer STAT-PDU mit der Nummer 52, d.h. der Nummer der vorher empfangenen POLL-PDU, und zwar ohne auf eine andere POLL-PDU zu warten, die als Trigger zum Senden einer STAT-PDU dienen könnte.After receiving the SD-PDU 23, the receiver determines that it can now extend the credit up to and including the SD-PDU 29, i.e. he sets his receiver status variable VR (MR) to the value 30. He also informs the sender of the extended credit using a STAT-PDU with the number 52, i.e. the number of the previously received POLL-PDU, without waiting for another POLL-PDU that could serve as a trigger for sending a STAT-PDU.
Der Sender wird somit über den erweiterten Kredit noch so rechtzeitig informiert, daß er die Übertragung nicht suspendieren muß.The sender is thus informed about the extended credit so early that he does not have to suspend the transmission.
Figur 3 zeigt ein Beispiel für den erfindungsgemäßen Kredit- Aufdatierungs-Mechanismuss nach dem Schließen einer Lücke im Empfangspuffer, und zwar wiederum in Form eines Pfeildiagramms, in dem die Pfeile die gesendeten bzw. empfangenen PDUs repräsentieren.FIG. 3 shows an example of the credit update mechanism according to the invention after a gap in the reception buffer has been closed, again in the form of an arrow diagram in which the arrows represent the transmitted or received PDUs.
Der Empfänger stellt den Empfangspuffer für sechs SD-PDUs zur Verfügung und erweitert den Kredit gemäß dieser vorhandenen Empfangskapazität. Immer wenn drei SD-PDUs in Reihenfolge empfangen wurden und an den SSCOP-User geliefert wurden, gewährt der Empfänger dem Sender (Transmitter) zusätzlich einen Kredit von drei, der insgesamt wieder den Gesamtkredit 6 von sechs herstellt. Wenn jedoch eine SD-PDU verloren gegangen ist und erneut gesendet werden muß, bleiben Empfangspuffer für eine längere Zeit belegt und verzögern dadurch die Möglichkeit für das Gewähren eines neuen Kredits .The receiver makes the receive buffer available for six SD-PDUs and extends the credit according to this available receive capacity. Whenever three SD-PDUs have been received in sequence and have been delivered to the SSCOP user, the receiver grants the transmitter (transmitter) an additional three credit, which in turn is the total credit 6 out of six manufactures. However, if an SD-PDU is lost and has to be sent again, receive buffers remain occupied for a long time, thereby delaying the possibility of granting a new loan.
Wenn die Übertragung mit der SD-PDU 21 beginnt, hat der Sender einen vorher empfangenen Kredit (z.B. über eine vorherige empfangene STAT-PDU) zum Senden von SD-PDUs bis zur Sequenz Nummer 26, d.h. die Zustandsvariable VT (MS) des Senders hat den Wert 27.If the transmission begins with the SD-PDU 21, the transmitter has a previously received credit (e.g. via a previously received STAT-PDU) for sending SD-PDUs up to sequence number 26, i.e. the state variable VT (MS) of the transmitter has the value 27.
Nachdem die SD-PDU 23 empfangen wurde, stellt der Empfänger fest, daß er die SD-PDU 22 verloren hat. Gemäß Q.2110 teilt er diesen Umstand dem Sender mit Hilfe einer USTAT-PDU mit und erweitert gleichzeitig den Kredit um eine SD-PDU, d.h. bis zur Sequenznummer 28, da er die SD-PDU 21 zu diesem Zeitpunkt bereits an den User geliefert hat.After the SD-PDU 23 is received, the receiver determines that it has lost the SD-PDU 22. According to Q.2110, he notifies the sender of this fact with the help of a USTAT-PDU and at the same time extends the credit by an SD-PDU, i.e. up to sequence number 28, since he has already delivered the SD-PDU 21 to the user at this time.
Sobald die POLL#53 empfangen worden ist, kann in der daraufhin zurückgesendeten STAT-PDU kein zusätzlicher Kredit gewährt werden, da die SD-PDU 22 noch immer nicht eingetroffen ist. Die STAT#53 teilt dem Sender jedoch die Lücke (22,23) mit.As soon as POLL # 53 has been received, no additional credit can be granted in the STAT-PDU which is then returned, since the SD-PDU 22 has still not arrived. However, STAT # 53 notifies the transmitter of the gap (22, 23).
Sobald die erneut gesendete SD-PDU 22 korrekt empfangen worden ist, können die SD-PDUs 22 bis 25 an den SSCOP-User geliefert werden und der Emfpangspuffer ist dadurch wieder für sechs SD-PDUs verfügbar, d.h. der Kredit kann somit bis auf die Sequenznummer 32 erweitert werden. Der Empfänger informiert zu diesem Zweck unverzüglich den Sender über den erweiterten Kredit mit Hilfe einer STAT-PDU der Sequenznummer 53, also der Nummer der bereits früher empfangenen und erwiderten POLL-PDU, ohne daß er auf eine weitere POLL-PDU wartet, auf die er üblicherweise als 'Trigger zum Senden einer STAT-PDU warten müßte. 7 Figur 4A zeigt Modifikationen im SSCOP, die dazu dienen, den Algorithmus in Figur 4B aufzurufen (die genannten Modifikationen sind dunkel schattiert) .As soon as the retransmitted SD-PDU 22 has been received correctly, the SD-PDUs 22 to 25 can be delivered to the SSCOP user and the reception buffer is thus again available for six SD-PDUs, ie the credit can therefore be used except for the sequence number 32 can be expanded. For this purpose, the recipient immediately informs the sender of the extended credit with the aid of a STAT-PDU of sequence number 53, that is, the number of the POLL-PDU received and returned earlier, without waiting for another POLL-PDU for which it is waiting usually would have to wait as a trigger to send a STAT-PDU. FIG. 4A shows modifications in the SSCOP which serve to call the algorithm in FIG. 4B (the modifications mentioned are shaded dark).
Die Figur 4B zeigt den durch die genannten Modifikationen aufgerufenen Algorithmus in SDL-Form. Kredit wird nach diesem Algorithmus gegebenenfalls auf die Zahl der verfügbaren Puffer zurückgenommen, wenn die Zahl der verfügbaren Puffer zu sehr abnimmt, bzw. Kredit wird erhöht, wenn die Zahl der verfügbaren Puffer dies zuläßt und der noch verfügbare Kredit unter eine bestimmte Schwelle gesunken ist.FIG. 4B shows the algorithm called up by the modifications mentioned in SDL form. According to this algorithm, credit may be reduced to the number of available buffers if the number of available buffers decreases too much, or credit is increased if the number of available buffers allows it and the still available credit has dropped below a certain threshold.
Figur 4C zeigt eine Veranschaulichung des Algorithmus nach Figur 4B. In dem Beispiel gemäß Figur 4C ist VR (MR) =V (R) +23. Es sei nun angenommen, daß die SD-PDU mit der SequenznummerFIG. 4C shows an illustration of the algorithm according to FIG. 4B. In the example according to FIG. 4C, VR (MR) = V (R) +23. It is now assumed that the SD-PDU with the sequence number
VR(R) empfangen wurde, wodurch die Lücke geschlossen wird und veranlaßt wird, daß 4 SD-PDUs an den SSCOP-User geliefert werden. F erhält dann den Wert 14 und NC = VR(H)+14 = VR(R)+13+14 > VR(R) + 23. Da VR(MR) - VR(H) = VR(R) + 23 - VR(R) - 13 = 10 < VR(U) ist, muß ein zusätzlicher Kredit gewährt werden.VR (R) has been received, closing the gap and causing 4 SD-PDUs to be delivered to the SSCOP user. F then receives the value 14 and NC = VR (H) +14 = VR (R) + 13 + 14> VR (R) + 23. Since VR (MR) - VR (H) = VR (R) + 23 - VR (R) - 13 = 10 <VR (U), an additional credit must be granted.
Verwendete Abkürzungen:Used abbreviations:
N(MR) PDU-ParameterN (MR) PDU parameters
PDU Protocol Data UnitPDU Protocol Data Unit
POLL-PDU PDU polling the receiver for a Status report SD-PDU Sequenced Data PDU, transports data for teh SSCOP user STAT-PDU PDU sending a Status report, including a credit value, to the transmitter VR(MR) Maximum Receive State Variable VT (MS) Maximum Send State Variable POLL-PDU PDU polling the receiver for a Status report SD-PDU Sequenced Data PDU, transports data for teh SSCOP user STAT-PDU PDU sending a Status report, including a credit value, to the transmitter VR (MR) Maximum Receive State Variable VT (MS) Maximum Send State Variable
Claims
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19820738 | 1998-05-08 | ||
DE19820738 | 1998-05-08 | ||
PCT/EP1999/003049 WO1999059299A1 (en) | 1998-05-08 | 1999-05-04 | Method for controlling the message flow in a communication network |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1076964A1 true EP1076964A1 (en) | 2001-02-21 |
Family
ID=7867176
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP99923522A Withdrawn EP1076964A1 (en) | 1998-05-08 | 1999-05-04 | Method for controlling the message flow in a communication network |
Country Status (5)
Country | Link |
---|---|
US (1) | US6745361B1 (en) |
EP (1) | EP1076964A1 (en) |
CN (1) | CN1114303C (en) |
CA (1) | CA2331310A1 (en) |
WO (1) | WO1999059299A1 (en) |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2373132B (en) * | 1999-03-18 | 2004-01-14 | Nokia Networks Oy | Overload control method for a packet-switched network |
US7304948B1 (en) * | 2000-12-29 | 2007-12-04 | Nortel Networks Limited | Congestion control for signalling transport protocols |
US7502860B1 (en) * | 2001-07-09 | 2009-03-10 | Cisco Technology, Inc. | Method and apparatus for client-side flow control in a transport protocol |
US7000024B1 (en) | 2001-07-09 | 2006-02-14 | Cisco Technology, Inc. | Systems and methods for providing transmission control protocol communications |
US6941500B2 (en) * | 2001-08-10 | 2005-09-06 | Motorola, Inc. | Method for implementing a modified radio link protocol |
EP1324544A1 (en) * | 2001-12-26 | 2003-07-02 | Telefonaktiebolaget L M Ericsson (Publ) | Method and system for controlling traffic load between media gateway controllers and proxies |
EP1376945B1 (en) | 2002-06-18 | 2006-06-07 | Matsushita Electric Industrial Co., Ltd. | Receiver-based RTT measurement in TCP |
US20050041586A1 (en) * | 2003-08-24 | 2005-02-24 | Sam Shiaw-Shiang Jiang | Method of controlling a receiver and a transmitter in a wireless communication system to handle a transmission window size change procedure |
EP1548972A3 (en) * | 2003-12-26 | 2006-12-27 | NTT DoCoMo, Inc. | Transmitter device and relay device for performing data transmission control |
US8024417B2 (en) * | 2008-06-04 | 2011-09-20 | Microsoft Corporation | Simple flow control protocol over RDMA |
US10949520B2 (en) * | 2018-10-02 | 2021-03-16 | Capital One Services, Llc | Systems and methods for cross coupling risk analytics and one-time-passcodes |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4841526A (en) * | 1984-05-25 | 1989-06-20 | Wilson Jon C | Data communications system |
US4677616A (en) * | 1985-09-11 | 1987-06-30 | At&T Company | Flow control scheme for a switching network |
US4736369A (en) * | 1986-06-13 | 1988-04-05 | International Business Machines Corp. | Adaptive session-level pacing |
US5163046A (en) * | 1989-11-30 | 1992-11-10 | At&T Bell Laboratories | Dynamic window sizing in a data network |
US5063562A (en) * | 1990-05-23 | 1991-11-05 | International Business Machines Corporation | Flow control for high speed networks |
US5317568A (en) * | 1991-04-11 | 1994-05-31 | Galileo International Partnership | Method and apparatus for managing and facilitating communications in a distributed hetergeneous network |
FI98023C (en) * | 1995-05-09 | 1997-03-25 | Nokia Telecommunications Oy | Sliding window-based data flow control using an adjustable window size |
JPH1032584A (en) * | 1996-07-17 | 1998-02-03 | Matsushita Electric Ind Co Ltd | Data transfer equipment having re-transmission control function |
-
1999
- 1999-05-04 CN CN99808335.6A patent/CN1114303C/en not_active Expired - Fee Related
- 1999-05-04 WO PCT/EP1999/003049 patent/WO1999059299A1/en not_active Application Discontinuation
- 1999-05-04 EP EP99923522A patent/EP1076964A1/en not_active Withdrawn
- 1999-05-04 US US09/674,944 patent/US6745361B1/en not_active Expired - Fee Related
- 1999-05-04 CA CA002331310A patent/CA2331310A1/en not_active Abandoned
Non-Patent Citations (1)
Title |
---|
See references of WO9959299A1 * |
Also Published As
Publication number | Publication date |
---|---|
US6745361B1 (en) | 2004-06-01 |
CN1114303C (en) | 2003-07-09 |
CA2331310A1 (en) | 1999-11-18 |
CN1308805A (en) | 2001-08-15 |
WO1999059299A1 (en) | 1999-11-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
DE69632240T2 (en) | Method and system for controlling transmission speeds of sources in ATM networks | |
DE69433919T2 (en) | DEVICE AND METHOD FOR REGULATING THE CELL FLOW AT THE END OF AN ATM SYSTEM | |
DE69434841T2 (en) | Dynamic access control for an ATM network | |
DE60211322T2 (en) | Receiver initiated increment of the transmission rate | |
DE602004002086T2 (en) | Method and apparatus for the shared dynamic management of window lengths of multiple ARQ data connections | |
DE60022994T2 (en) | A FLEXIBLE CONTROL PROTOCOL FOR WIRELESS CONNECTIONS | |
DE10066463B4 (en) | Method of communication with delayed acknowledgment and alarm management | |
DE20307251U1 (en) | User device that performs intelligent flow control based on the channel quality conditions | |
WO2019211024A1 (en) | Transfer of data with different priorities via bluetooth low energy | |
WO1999059299A1 (en) | Method for controlling the message flow in a communication network | |
DE102008030939A1 (en) | Method and device for managing data transmission in a network | |
EP0993712B1 (en) | Method and system for coding digital data | |
DE102012207929A1 (en) | A method of transmitting data in a packet-oriented communication network and appropriately configured user equipment on the communication network | |
DE112011105003T5 (en) | Transmitting device, receiving device, communication device, communication system and transmission method | |
WO2005004432A1 (en) | Method for controlling data circuits | |
DE69837952T2 (en) | Method for managing telecommunication lines | |
WO2004073265A1 (en) | Method for allocating transmission bandwidth in a packet-oriented communications facility | |
WO2008023007A1 (en) | Method for controlling load matching in a radio communication system | |
DE69917463T2 (en) | METHOD AND DEVICE FOR TRANSMITTING DATA PACKAGES IN A COMMUNICATION SYSTEM | |
DE60113766T2 (en) | System and method for data transmission in two modes and corresponding transmitter and receiver | |
EP1336282B1 (en) | Device and method for controlling data traffic in a tcp/ip data transmission network | |
DE69835829T2 (en) | RESOURCE OPTIMIZATION FUNCTION IN A DATA AND TELECOMMUNICATIONS SYSTEM | |
DE102012210816A1 (en) | Data packet for a bidirectional transmission of data packets in a data transmission between a first and a second communication device and method for transmitting such a data packet | |
EP1244256A2 (en) | Method and apparatus to dynamically control the repartition of resources in a communication network | |
EP0475180A1 (en) | Method for transmission of communication blocks between transmission lines of existing connections in a switching exchange |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20001102 |
|
AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): DE FI FR GB IT SE |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20060217 |