JPH0816890B2 - Communication device program data loading method - Google Patents
Communication device program data loading methodInfo
- Publication number
- JPH0816890B2 JPH0816890B2 JP61278636A JP27863686A JPH0816890B2 JP H0816890 B2 JPH0816890 B2 JP H0816890B2 JP 61278636 A JP61278636 A JP 61278636A JP 27863686 A JP27863686 A JP 27863686A JP H0816890 B2 JPH0816890 B2 JP H0816890B2
- Authority
- JP
- Japan
- Prior art keywords
- retransmitted
- program data
- node
- broadcast
- area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Landscapes
- Information Transfer Between Computers (AREA)
- Computer And Data Communications (AREA)
Description
【発明の詳細な説明】 〔産業上の利用分野〕 本発明は通信ネツトワークを構成するノード装置に係
り、特に大容量のプログラム・データを各ノード装置に
送信して格納させる場合に好適なプログラム・データの
ロード方式に関する。BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a node device that constitutes a communication network, and particularly to a program suitable for transmitting a large amount of program data to each node device for storage. -Regarding the data loading method.
通信ネツトワークにおいて、その構成要素であるノー
ド装置が内蔵する通信制御ソフトウエアはメモリ量で数
十キロバイトから数メガバイトに及ぶ。これらのソフト
ウエアは、機能追加等により頻繁にバージヨンが変わる
為、その都度全ノード装置のソフトウエアを変更する必
要がある。In the communication network, the communication control software built in the node device, which is a component of the communication network, has a memory capacity ranging from several tens of kilobytes to several megabytes. Since the versions of these software frequently change due to addition of functions, the software of all node devices must be changed each time.
又、一般に不揮発性メモリに比してICメモリ(ダイナ
ミツクRAM)の方が安価で実装面積も小さくなるので、
このメモリをプログラム格納に用いているノード装置で
は、プログラムのロードが不可欠である。In addition, IC memory (dynamic RAM) is generally cheaper and has a smaller mounting area than non-volatile memory.
In a node device that uses this memory for storing a program, it is essential to load the program.
各ノード間に共通なプログラム、データ等の情報を特
定のノードから、同報通信機能により各ノードにロード
する方式については、情報処理学会全国大会予稿集(第
26回1G−8及び第29回3D−3)において鶴田らが述べて
いる。For the method of loading information such as programs and data common to each node from a specific node to each node by the broadcast communication function, refer to
Tsuruta et al. Described in 26th 1G-8 and 29th 3D-3).
しかしながら、この従来のものでは、誤りが大量に発
生した場合の効率的な再送方式については実現されてい
ない。However, this conventional method has not realized an efficient retransmission method when a large number of errors occur.
本発明の目的は、各ノードにおいて大量の誤りが発生
した場合に、効率良く誤りの発生した部分のデータを送
信する方法を提供することにある。An object of the present invention is to provide a method for efficiently transmitting data in a portion where an error has occurred when a large number of errors have occurred in each node.
送信プログラムにおいて、大量の範囲の一つのデータ
を送信する場合と、小量の細分化されたデータを数多く
送信する場合とでは、たとえ総送信データ量が、後者の
方が少なくとも、オーバーヘツドを考慮すると実効転送
速度は前者の方が大きいケースがある。In the sending program, when sending one piece of data in a large range and when sending a large number of small pieces of subdivided data, even if the total sending data quantity is at least, the latter case considers the overhead. In that case, the effective transfer rate may be higher in the former case.
従つて、本発明では、あらかじめすべての受信ノード
に問い合わせることによつて、再送が必要な領域を把握
し、細分化して再送した方が効率が良いか、途中の再送
不要な部分を含む全体を一括して再送した方が効率が良
いかを送信側ノードが判断していずれかの方式を選択す
ることにより、誤り程度が種々であつても、最も効率の
良い方式で再送できる。Therefore, in the present invention, by inquiring all the receiving nodes in advance, it is more efficient to grasp the area that needs to be retransmitted, and to retransmit it by subdividing it. Even if the degree of error is various, it is possible to retransmit with the most efficient method, by the transmitting node determining whether it is more efficient to retransmit all at once and selecting one of them.
本発明では、再送が必要になつた場合、送信ノードが
全ての受信ノードに対して問い合わせた再送要求範囲の
和を同報通信により再送しているので、効率良く再送を
行なうことができる。In the present invention, when retransmission is necessary, the sum of the retransmission request ranges inquired by the transmitting node to all the receiving nodes is retransmitted by broadcast communication, so that the retransmission can be efficiently performed.
以下、本発明の一実施例を図により説明する。 An embodiment of the present invention will be described below with reference to the drawings.
第1図は通信ネツトワークの同報転送によるロード時
の概念図を示す。FIG. 1 shows a conceptual diagram at the time of loading by the broadcast transfer of the communication network.
送信ノード100は同報通信機能により受信ノード110,1
11,…120に対し情報をロードする。The sending node 100 has the receiving node 110, 1 by the broadcast communication function.
Load information for 11,… 120.
全ての情報を送信後、送信ノード100は各受信ノード
に対してロードが誤りなく行なわれたか否かを報告さ
せ、誤りがあつた場合は再送が必要な部分を問い合わせ
る。After transmitting all the information, the transmitting node 100 causes each receiving node to report whether or not the load was performed without error, and if there is an error, inquires about the portion that needs to be retransmitted.
問い合わせの結果、送信ノードの内部には第2図の21
0に示す表が作成される。すなわち、送信すべき全情報2
20の中で、再送すべき部分221を示す値を格納する表で
ある。第2図では再送すべき部分の数、表210のエント
リの数各2で示しているが、これらは誤りの程度により
異なるのは言うまでもない。As a result of the inquiry, 21 in FIG.
The table shown in 0 is created. That is, all information that should be sent 2
10 is a table that stores a value indicating a portion 221 to be retransmitted in 20. In FIG. 2, the number of parts to be retransmitted and the number of entries in the table 210 are shown as two, but it goes without saying that these differ depending on the degree of error.
ノード数が2つの場合の、再送すべき部分を第3図に
示す。FIG. 3 shows the portion to be retransmitted when the number of nodes is two.
第1のノードに対して再送すべき部分は表211に、第
2のノードに対して再送すべき部分は表212に示されて
いる。The part to be retransmitted for the first node is shown in Table 211, and the part to be retransmitted for the second node is shown in Table 212.
領域221はノード1,2共に再送が必要な領域であり、ノ
ード1に再送すべき領域223とノード2に再送すべき領
域224は重なつている部分がある。The area 221 is an area in which both the nodes 1 and 2 need to be retransmitted, and the area 223 to be retransmitted to the node 1 and the area 224 to be retransmitted to the node 2 have overlapping portions.
送信ノード100のプログラムで表211,212を処理するこ
とにより、同報にて再送すべき領域を定める。領域は、
第3図の場合たとえば (1) 221及び223と224の重なり領域を同報で行な
い、残りの領域は個別に再送する。By processing the tables 211 and 212 by the program of the transmitting node 100, the area to be retransmitted by the broadcast is determined. The area is
In the case of FIG. 3, for example, (1) the overlapping areas of 221 and 223 and 224 are broadcast, and the remaining areas are individually retransmitted.
(2) 221及び223と224を合わせた領域を同報で送信
し、222のみ個別に再送する。(2) The area in which 221 and 223 and 224 are combined is transmitted by broadcast, and only 222 is retransmitted individually.
(3) すべての領域を同報再送する。(3) Broadcast all the areas again.
(4) 221の先頭から224の最後までを大きな領域と
し、これを同報再送する。(4) The area from the beginning of 221 to the end of 224 is set as a large area, and this area is retransmitted by broadcast.
等種々の方法が考えられるが、領域及び確認(ACK)
を細分化することによるオーバーヘツドと、再送不要な
部分を送信することによる転送時間のオーバーヘツドか
ら、最適な方法を選択すれば良い。Various methods are possible, but the area and confirmation (ACK)
The optimum method may be selected from the overhead due to subdivision and the overhead of the transfer time due to transmission of the portion that does not need retransmission.
本実施例によれば、第3図において4回の個別再送を
行なう場合に、1回〜3回の同報送信で実現でき、個別
に行なう場合のオーバーヘツドを少なくできる。According to the present embodiment, when the individual retransmission is performed four times in FIG. 3, it can be realized by one to three broadcast transmissions, and the overhead when individually performed can be reduced.
本発明によれば、送信ノードで、再送すべき領域の一
括化が実現できるので、各ノードで誤りが多発した場合
の再送に要する時間を短かくする効率がある。According to the present invention, since it is possible to realize a batch of areas to be retransmitted at the transmitting node, there is an efficiency of shortening the time required for retransmission when many errors occur at each node.
第1図は同報通信による情報ロード法の概念図、第2図
は受信ノードが1つの場合の再送要求テーブルの概念
図、第3図は受信ノードが2つの場合の再送要求テーブ
ルの概念図。 100……送信ノード、210……再送要求テーブル。FIG. 1 is a conceptual diagram of an information loading method by broadcast communication, FIG. 2 is a conceptual diagram of a retransmission request table when there is one receiving node, and FIG. 3 is a conceptual diagram of a retransmission request table when there are two receiving nodes. . 100 ... sending node, 210 ... resend request table.
───────────────────────────────────────────────────── フロントページの続き (72)発明者 宇賀神 敦 神奈川県秦野市堀山下1番地 株式会社日 立製作所神奈川工場内 (56)参考文献 特開 昭57−197640(JP,A) 特開 昭55−120249(JP,A) 特開 昭59−95736(JP,A) ─────────────────────────────────────────────────── ─── Continuation of the front page (72) Inventor Atsushi Ugagami 1 Horiyamashita, Hadano City, Kanagawa Pref., Kanagawa Factory, Hiritsu Seisakusho Co., Ltd. (56) Reference JP 57-197640 (JP, A) JP 55 -120249 (JP, A) JP-A-59-95736 (JP, A)
Claims (1)
し、少なくとも一つのノードが同報データ送信機能を有
する通信装置のプログラムデータのロード方式におい
て、同報データ送信機能を有するノードが複数ノードに
対し一連のプログラム・データを同報送信し、伝送誤り
等により再送が必要になった場合には、送信ノードは上
記複数ノードのそれぞれに上記一連のプログラム・デー
タのうち再送が必要な領域を問い合わせ、上記複数ノー
ドの各々から応答された再送要求領域の重なりから複数
ノードに同報にて再送すべき領域を定め、該再送すべき
領域については同報データ送信にてプログラム・データ
の再送を行うことを特徴とする通信装置のプログラムデ
ータのロード方式。1. A method for loading program data of a communication device, wherein all nodes have a broadcast data receiving function, and at least one node has a broadcast data transmitting function. When a series of program data is broadcast to multiple nodes and needs to be retransmitted due to a transmission error or the like, the sending node needs to retransmit the series of program data to each of the plurality of nodes. An area is inquired, an area to be retransmitted by broadcast is determined for a plurality of nodes from the overlap of the retransmission request areas replied from each of the plurality of nodes, and the area to be retransmitted is transmitted as a broadcast data by the program data. A method for loading program data of a communication device, which is characterized by performing retransmission.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP61278636A JPH0816890B2 (en) | 1986-11-25 | 1986-11-25 | Communication device program data loading method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP61278636A JPH0816890B2 (en) | 1986-11-25 | 1986-11-25 | Communication device program data loading method |
Publications (2)
Publication Number | Publication Date |
---|---|
JPS63132361A JPS63132361A (en) | 1988-06-04 |
JPH0816890B2 true JPH0816890B2 (en) | 1996-02-21 |
Family
ID=17600035
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
JP61278636A Expired - Fee Related JPH0816890B2 (en) | 1986-11-25 | 1986-11-25 | Communication device program data loading method |
Country Status (1)
Country | Link |
---|---|
JP (1) | JPH0816890B2 (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH02281353A (en) * | 1989-04-24 | 1990-11-19 | Fujitsu Ltd | Remote information transmission system |
JP3114870B2 (en) * | 1989-09-12 | 2000-12-04 | 株式会社日立製作所 | Microprogram loading method, loading control device, information processing device, and information processing system |
US5180944A (en) * | 1991-01-25 | 1993-01-19 | Varian Associates, Inc. | Gyrotron with a mode convertor which reduces em wave leakage |
JP4926544B2 (en) * | 2006-05-29 | 2012-05-09 | 中国電力株式会社 | Site flow with wiper device |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPS55120249A (en) * | 1979-03-12 | 1980-09-16 | Nippon Telegr & Teleph Corp <Ntt> | Multiple address communication system |
JPS57197640A (en) * | 1981-05-29 | 1982-12-03 | Hitachi Ltd | Loading method of terminal program |
JPS5995736A (en) * | 1982-11-25 | 1984-06-01 | Mitsubishi Electric Corp | Method of multiple address communication |
-
1986
- 1986-11-25 JP JP61278636A patent/JPH0816890B2/en not_active Expired - Fee Related
Also Published As
Publication number | Publication date |
---|---|
JPS63132361A (en) | 1988-06-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0777948B1 (en) | Duplicate message detection method and apparatus | |
US5664091A (en) | Method and system for a voiding unnecessary retransmissions using a selective rejection data link protocol | |
US6757843B1 (en) | Method and apparatus for using ranking to select repair nodes in formation of a dynamic tree for multicast repair | |
CN104484295B (en) | Receiver sliding window-based data transmission method in parallel computer system | |
DE112018005077T5 (en) | SHARED TRANSMITTER | |
JPH0816890B2 (en) | Communication device program data loading method | |
US6996820B1 (en) | Efficient multiple priority list memory system | |
US5623602A (en) | Data transmission confirmation by sending frame with command to change transmitter's resend counter when receiver's buffer is full | |
EP0408315A2 (en) | System for detecting loss of message | |
JPS5933953A (en) | Communication control system in communication network system | |
US5253343A (en) | Method for the management of a memory of messages in a station of a data transmission network, and station designed for the implementation of the method | |
JPH09204339A (en) | Matching system between plural data bases | |
JP3317191B2 (en) | Data transmission method | |
JP3133728B2 (en) | Broadcast data communication system | |
JPH03178244A (en) | Broadcast transmitter | |
JPS6244808A (en) | Control method for nc working machine group | |
JP2870276B2 (en) | Transaction retransmission method in online real-time processing system | |
JPS59167155A (en) | Retransmission system of simultaneous communication | |
JPH0239141B2 (en) | ||
JP3267348B2 (en) | Simultaneous download method for data communication system | |
JPS63234647A (en) | Multiple address communication system | |
JPS62299139A (en) | Multiple address communication system | |
JPH0226159A (en) | Terminal address control system | |
JPH04358444A (en) | Data transfer system | |
JPS637495B2 (en) |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
LAPS | Cancellation because of no payment of annual fees |