JPH01128639A - System for confirming simultaneous transmission and response - Google Patents
System for confirming simultaneous transmission and responseInfo
- Publication number
- JPH01128639A JPH01128639A JP28537987A JP28537987A JPH01128639A JP H01128639 A JPH01128639 A JP H01128639A JP 28537987 A JP28537987 A JP 28537987A JP 28537987 A JP28537987 A JP 28537987A JP H01128639 A JPH01128639 A JP H01128639A
- Authority
- JP
- Japan
- Prior art keywords
- message
- transmittable
- successive
- limit value
- response
- 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.)
- Pending
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 21
- 238000012790 confirmation Methods 0.000 claims abstract description 7
- 238000000034 method Methods 0.000 claims description 30
- 230000007547 defect Effects 0.000 abstract 1
- 230000000903 blocking effect Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 4
- 230000000694 effects Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000005856 abnormality Effects 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Landscapes
- Small-Scale Networks (AREA)
Abstract
Description
【発明の詳細な説明】
〔産業上の利用分野〕
本発明は、通信における一斉送信方式に係り、特にＣ８
ＭＡ／ＣＤ方式のローカルエリア・ネットワーク（ＬＡ
Ｎ）において好適な一斉送信応答確認方式に関する。[Detailed Description of the Invention] [Industrial Application Field] The present invention relates to a simultaneous transmission method in communication, and in particular to a C8
MA/CD local area network (LA)
N) relates to a suitable simultaneous transmission response confirmation method.
従来、通（目ネットワークにおける応答確認方式につい
ては、情報処理学会論文誌第２７巻第４号第４６２頁か
ら第４７０頁「大量データの高効率送信用簡易高信頼ブ
ロードキャストプロトコルの提案と評価」において、各
種の方式が論じられている。そしてここでは非ブロツク
方式（１メツセージごとに、応答を待つ）どブ、ロック
方式（複数メツセージをブロック化し、１ブロツクごと
に、応答を待つ）と、２つに分けて論じられている。Conventionally, the response confirmation method in the communication network has been described in "Proposal and Evaluation of a Simple and Reliable Broadcast Protocol for Highly Efficient Transmission of Large Volumes of Data", Journal of the Information Processing Society of Japan, Vol. 27, No. 4, pages 462 to 470. , various methods are discussed. Here, the non-blocking method (waiting for a response for each message), the locking method (blocking multiple messages and waiting for a response for each block), and 2. It is discussed separately.
しかし、上記従来技術の内、非ブロツク方式は１メツセ
ージ送信後、応答を待つ間、次のメツセージを送信出来
ず、スループットが低下するという問題があった。一方
ブロック方式は、公知例にも記載しである様に、メツセ
ージの送信間隔の制御や受信不良メツセージの回復がブ
ロック単位でしか行えないので、バッファビジーなどに
よるメツセージ受信不良が多くなり、その上、回復に時
間がかかるという問題があった。However, among the above-mentioned conventional techniques, the non-blocking method has a problem in that after transmitting one message, the next message cannot be transmitted while waiting for a response, resulting in a decrease in throughput. On the other hand, in the block method, as described in the prior art, message transmission intervals and recovery from poorly received messages can only be performed on a block-by-block basis. , there was a problem that it took a long time to recover.
従って、本発明の目的は、性能を低下させず、また、バ
ッファビジーなどによるメツセージ受信不良を起こさせ
ない一斉送信応答確認方式を打ち立てることにある。Therefore, an object of the present invention is to establish a simultaneous transmission response confirmation system that does not degrade performance and prevent message reception failures due to buffer busy and the like.
１対１での通信においては、スループットを高めるため
、受信側の応答確認をもらう前に送信側が、複数個のメ
ツセージを送ることが可能な、ウィンドウ方式やクレジ
ット方式が、公知の技術として確立している。In one-to-one communication, in order to increase throughput, the window method and credit method, which allow the sender to send multiple messages before receiving acknowledgment from the receiver, have been established as well-known techniques. ing.
この方式では、送信メツセージにサイクリックで更新さ
れる通番を付加し、応答にはどの通番までを正しく受取
ったかを示す情報を付加する。そして連続送信可能なメ
ツセージの数を「送信ウィンドウ幅」と呼び、そのメツ
セージの通番の内。In this method, a cyclically updated serial number is added to the transmitted message, and information indicating which serial number was correctly received is added to the response. The number of messages that can be sent consecutively is called the ``sending window width,'' and is the number of messages that can be sent consecutively.
最も小さいものを送信可能通番下限値、最も大きなもの
を上限値と呼ぶ。The smallest value is called the lower limit value of the transmittable serial number, and the largest value is called the upper limit value.
そしてウィンドウ方式は、この「送信ウィンドウ幅」が
固定値であり、クレジット方式はこの幅が受信側の意向
で動的に変化する可変値である。In the window method, this "transmission window width" is a fixed value, and in the credit method, this width is a variable value that dynamically changes according to the intention of the receiving side.
また、これらの方式では、非ブロツク方式、ブロック方
式と異なり、１メツセージ、１ブロック単位に１つの応
答を返す必要は無く、複数個（可変）のメツセージに対
して１つの応答を返せば良い。Further, in these methods, unlike the non-blocking method and the blocking method, it is not necessary to return one response for each message or block, but it is sufficient to return one response for a plurality of (variable) messages.
先程述べた本発明の目的は、１対１のクレジット方式を
、１対ｎの一斉送信に適用することによって達成される
。具体的には、受信側の各機器から伝えられる送信可能
通番下限値の内の最小値から、各機器から伝えられる送
信可能通番上限値の内の最小値までの通番を持つメツセ
ージを一斉送信することによって達成される。The above-mentioned object of the present invention is achieved by applying a 1:1 credit scheme to 1:n broadcast transmission. Specifically, messages with serial numbers ranging from the minimum value of the lower limit of serial numbers that can be sent from each device on the receiving side to the minimum value of the upper limit of serial numbers that can be sent from each device are sent all at once. This is achieved by
本発明によれば、送信可能通番下限値の最小値から、送
信可能通番上限値の最大値まで、応答を待つこと無く連
続送信可能で、スループットが向上する。また、受信側
が受信バッファの空き具合いにより送信可能通番上限値
を送るため、バッファビジーによるメツセージ受信不良
も発生しない。According to the present invention, continuous transmission is possible from the minimum transmittable sequence number lower limit value to the maximum transmittable sequence number upper limit value without waiting for a response, and throughput is improved. Furthermore, since the receiving side sends the upper limit of transmittable serial numbers depending on the availability of the receiving buffer, message reception failures due to buffer busy do not occur.
以下、本発明の一実施例を第１図、第２図、第３図によ
り説明する。第１図は、本発明による一斉送信応答確認
方式がどの様に為されるかを説明する図である。ここで
は、ネットワーク装置３が３台の機器２に対して、通番
Ｏ〜３のメツセージ６ （Ｉ （０〜３）で示す）を一
斉送信した後の図として書いである。なお通番はＯ〜１
５でサイクリックに更新する０機器Ａ２は、受信バッフ
ァ４に６個のメツセージ６を貯えることが出来、現在、
通ｔｏ〜３のメツセージ６が処理待ち状態である。An embodiment of the present invention will be described below with reference to FIGS. 1, 2, and 3. FIG. 1 is a diagram illustrating how the simultaneous transmission response confirmation method according to the present invention is performed. Here, the diagram is drawn after the network device 3 simultaneously transmits messages 6 with serial numbers O to 3 (indicated by I (0 to 3)) to three devices 2. The serial number is O~1
Device A2, which is cyclically updated with 5, can store six messages 6 in the reception buffer 4, and currently,
Message 6 from communication to-3 is waiting to be processed.
従って６−４〜２個の受信エリアが空いて居り、後２個
のメツセージ６が受けられる。ゆえに、送信可能通番の
下限値４．上限値５の応答（ＲＲ（４，５）として示す
）をネットワーク装置３へ送り返している。機器Ｂｚは
、受信バッファ４に８個のメツセージ６を貯えることが
出来、通′ａ。Therefore, two reception areas 6-4 are available, and the next two messages 6 can be received. Therefore, the lower limit of transmittable serial numbers is 4. A response with an upper limit value of 5 (indicated as RR (4, 5)) is sent back to the network device 3. Device Bz can store eight messages 6 in the reception buffer 4, and sends them a message.
〜３のメツセージ６を受け、既に通番０〜１のメツセー
ジ６は処理済であり、受信バッファ４には６個の受信エ
リアが空いている。ゆえに、ＲＲ（４，９）の応答をネ
ットワーク装置３へ送り返している。機ＶｌＩＣｚは、
受信バッファ４に８個のメツセージ６を貯えることが出
来るが、通番２のメツセージ６を何らかの異常で受は損
なったため、通番Ｏ〜１のメツセージ６しか受信バッフ
ァ４に無い。通番３のメツセージ６は正しく受けられて
も通番が１から３へととぶため、受は捨てられる。Messages 6 with serial numbers 0 to 1 have been received, and the messages 6 with serial numbers 0 to 1 have already been processed, and six receiving areas are available in the receiving buffer 4. Therefore, the response of RR (4, 9) is sent back to the network device 3. The machine VlICz is
Eight messages 6 can be stored in the reception buffer 4, but since the message 6 with the serial number 2 was not received due to some abnormality, only the messages 6 with the serial numbers O to 1 are stored in the reception buffer 4. Even if message 6 with serial number 3 is received correctly, the serial number jumps from 1 to 3, so the reception is discarded.
従って機器２からは、ＲＲ（２，７）の応答をネットワ
ーク装置３へ送り返し、通番２〜３のメツセージ６の再
送を要求する。これらの応答を受は取ったネットワーク
装置３は、各機器２の送信可能通番下限値の内の最小値
から、送信可能通番上限値の内の最小値までの通番を持
つ送信メツセージ６を一斉送信する。この場合は、第１
図の下で示す様に、通番２〜５のメツセージ６を送信す
ることになる。また、通番Ｏ〜１のメツセージ６は、各
機器２の応答確認が済んだので、送信バッファ５から捨
てられる。なお機器Ａ２．機器Ｂ２では再送により通番
２〜３のメツセージ６を２回受けることになるが、送信
可能通番の下限値（機器Ａｚ、機器Ｂｚとも４）以下の
通番メツセージ６であるので捨てられる。ここで各機器
２から、ネットワーク装置３へ応答を返すタイミングで
あるが、■一定時間間隔ごとに返す方法、■受信バッフ
ァ４の空きエリアがある個数以上になったら返す方法、
等色々考えられるが、どの様な方法でも本発明は適用出
来る。また、ネットワーク装置３がポーリングにより、
各機器２の送信可能通番の下限値、上限値を調べに行く
方法や、トークンパッシング方式の要領で、各機器２が
送信可能通番の下限値、上限値の内の最小値を送り廻す
方法にも本発明は適用出来る。Therefore, device 2 sends a response of RR (2, 7) back to network device 3, requesting retransmission of messages 6 with serial numbers 2-3. Upon receiving these responses, the network device 3 simultaneously sends outgoing messages 6 having serial numbers ranging from the minimum value of the lower limit of transmittable serial numbers of each device 2 to the minimum value of the upper limit of transmittable serial numbers of each device 2. do. In this case, the first
As shown at the bottom of the figure, messages 6 with serial numbers 2 to 5 will be transmitted. Furthermore, the messages 6 with serial numbers O to 1 are discarded from the transmission buffer 5 since the responses of each device 2 have been confirmed. Note that equipment A2. Device B2 receives messages 6 with serial numbers 2 and 3 twice due to retransmission, but since the message 6 is below the lower limit of transmittable serial numbers (4 for both devices Az and Bz), it is discarded. Here, each device 2 returns a response to the network device 3. There are two methods: ■ A method for returning responses at fixed time intervals, and ■ A method for returning a response when the free area of the receiving buffer 4 reaches a certain number.
Various methods can be considered, but the present invention can be applied to any method. In addition, the network device 3 uses polling to
A method in which each device 2 checks the lower limit and upper limit of the transmittable serial number, or a method in which each device 2 sends around the minimum value of the lower limit and upper limit of the transmittable serial number using the token passing method. The present invention is also applicable.
第２図は１本発明を実現するネットワーク装置３の内部
処理フローの一実施例である。各機器２からの応答受信
時に、各機器２ごとの送信可能通番の下限値、上限値を
更新する。そして送信時にその下限値、上限値の最小値
を求め、送信通番がその範囲に入っているならば送信し
、そうでなければ待つ。FIG. 2 shows an example of the internal processing flow of the network device 3 that implements the present invention. When receiving a response from each device 2, the lower limit and upper limit of the transmittable serial number for each device 2 are updated. Then, at the time of transmission, the minimum value of the lower limit value and upper limit value is determined, and if the transmission sequence number is within the range, it is transmitted, and if not, it waits.
第３図は、本発明で使用する一斉送信メッセージ６と応
答のフォーマットの一実施例である。一斉送信のやり方
は、ＬＡＮでは良く知られている方法を用する。この方
法では、宛先アドレスを一斉回報アドレスとすることに
より、ネットワーク１−に接続される各機器２にメツセ
ージ６を伝える。FIG. 3 shows an example of the format of the broadcast message 6 and response used in the present invention. A well-known method for LAN is used for simultaneous transmission. In this method, the message 6 is transmitted to each device 2 connected to the network 1- by setting the destination address as a broadcast address.
また、ここでは応答で送信可能通番の下限値と上限値と
を送り返しているが、必ずしもこの限りではなく、送信
可能通番の下限値と送信可能メツセージ数を送り返して
も良い。要は、ネットワーク装＠３が、各機器２の送信
可能通番の下限値、上限値の最小値が分かれば良い。Further, here, the lower limit and upper limit of the transmittable serial number are sent back as a response, but this is not necessarily the case, and the lower limit of the transmittable serial number and the number of transmittable messages may be sent back. In short, the network device @3 only needs to know the minimum value of the lower limit and upper limit of the transmittable serial number of each device 2.
以上述べた本発明によればメツセージを連続送信可能で
あるのでスループットが向上し、また、送信可能通番上
限値を各機器２からネットワーク装置ｉ１３へ送り返す
ため、バッファビジーによるメツセージ受信不良は発生
しない効果がある。According to the present invention described above, messages can be transmitted continuously, improving throughput, and since the upper limit of transmittable serial numbers is sent back from each device 2 to the network device i13, message reception failures due to buffer busy do not occur. There is.
第１図は本発明による一斉送信応答確認方式の動作説明
図、第２図は本発明を実現するネットワーク装置の内部
処理フロー図、第３図は本発明で使用する一斉送信メッ
セージと応答のフォーマットの一実施例を示す図である
。
１・・・ネットワーク、２・・・機器、３・・・ネット
ワーク県′；Ｌ口Fig. 1 is an explanatory diagram of the operation of the simultaneous transmission response confirmation method according to the present invention, Fig. 2 is an internal processing flow diagram of the network device that implements the present invention, and Fig. 3 is the format of the simultaneous transmission message and response used in the present invention. It is a figure showing one example of this. 1...Network, 2...Equipment, 3...Network prefecture'; L mouth
Claims (1)
ネットワーク装置において、各機器の送信可能通番下限
値の内の最小値から、各機器の送信可能通番上限値の内
の最小値までの通番を持つメッセージを一斉送信するこ
とを特徴とした一斉送信応答確認方式。1. Each device connected to the network has a serial number that ranges from the minimum value of the lower limit of the serial number that can be sent to each device to the lowest value of the upper limit of the serial number that can be transmitted by each device in a network device that can send simultaneous transmissions. A simultaneous transmission response confirmation method characterized by sending messages all at once.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP28537987A JPH01128639A (en) | 1987-11-13 | 1987-11-13 | System for confirming simultaneous transmission and response |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| JP28537987A JPH01128639A (en) | 1987-11-13 | 1987-11-13 | System for confirming simultaneous transmission and response |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| JPH01128639A true JPH01128639A (en) | 1989-05-22 |
Family
ID=17690784
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| JP28537987A Pending JPH01128639A (en) | 1987-11-13 | 1987-11-13 | System for confirming simultaneous transmission and response |
Country Status (1)
| Country | Link |
|---|---|
| JP (1) | JPH01128639A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04119044A (en) * | 1990-09-07 | 1992-04-20 | Nec Corp | Network control system |
| JPH0787104A (en) * | 1993-08-04 | 1995-03-31 | Sharp Corp | Packet transmitting device |
| US6290292B1 (en) | 1999-01-11 | 2001-09-18 | Tachi-S Co., Ltd. | Seat back structure of hinged vehicle seat |
| JP2008129927A (en) * | 2006-11-22 | 2008-06-05 | Tokyo Stock Exchange Inc | Purchase and sales system, telegram transmission control method, transmission permitted telegram serial number notification program, and business telegram transmission control program |
-
1987
- 1987-11-13 JP JP28537987A patent/JPH01128639A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JPH04119044A (en) * | 1990-09-07 | 1992-04-20 | Nec Corp | Network control system |
| JPH0787104A (en) * | 1993-08-04 | 1995-03-31 | Sharp Corp | Packet transmitting device |
| US6290292B1 (en) | 1999-01-11 | 2001-09-18 | Tachi-S Co., Ltd. | Seat back structure of hinged vehicle seat |
| JP2008129927A (en) * | 2006-11-22 | 2008-06-05 | Tokyo Stock Exchange Inc | Purchase and sales system, telegram transmission control method, transmission permitted telegram serial number notification program, and business telegram transmission control program |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2027230C (en) | Station-to-station full duplex communication in a communications network | |
| Carlson | Bit-oriented data link control procedures | |
| US4551834A (en) | Method and system for communicating over an open communication network | |
| JPH09160858A (en) | Data resending method and server | |
| JPH01128639A (en) | System for confirming simultaneous transmission and response | |
| JPH0567092B2 (en) | ||
| EP1427127A2 (en) | Communication control method, communication system and communication apparatus that can improve throughput | |
| JPH09233124A (en) | Packet communication system | |
| Gopal et al. | Dynamic address assignment in broadcast networks | |
| JPH01147926A (en) | Multiple address radio communication system | |
| JP3386035B2 (en) | Flow control method and method by token passing | |
| JPH10215294A (en) | Frame re-transmission method | |
| Bux | Chapter 5 Performance issues | |
| JPH0341845A (en) | Packet transmission system | |
| Chao | Design and implementation of interprocess communication procedures on Ethernets | |
| JPH04264853A (en) | Data communication system | |
| JP3422810B2 (en) | Data communication system | |
| JPH10262067A (en) | Packet communication system | |
| KR20040021030A (en) | method for transferring a broad casting data of the ring type network system | |
| JPH0685875A (en) | Data communication system | |
| JPS6397040A (en) | Communication method for packet switching communication network | |
| JPH01269339A (en) | Packet retransmission control system | |
| Hoang et al. | Computer Communication Networks—Lecture Notes | |
| JPH047937A (en) | Multiple address communication system | |
| JPH0484531A (en) | Communication system for local network system |