JPH02114737A - Multiple address communication method - Google Patents

Multiple address communication method

Info

Publication number
JPH02114737A
JPH02114737A JP63269733A JP26973388A JPH02114737A JP H02114737 A JPH02114737 A JP H02114737A JP 63269733 A JP63269733 A JP 63269733A JP 26973388 A JP26973388 A JP 26973388A JP H02114737 A JPH02114737 A JP H02114737A
Authority
JP
Japan
Prior art keywords
data
sequence number
broadcast
sent
master station
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
Application number
JP63269733A
Other languages
Japanese (ja)
Other versions
JPH0720110B2 (en
Inventor
Kazutomo Kobayashi
小林 和朝
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Corp
Original Assignee
NEC Corp
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by NEC Corp filed Critical NEC Corp
Priority to JP63269733A priority Critical patent/JPH0720110B2/en
Publication of JPH02114737A publication Critical patent/JPH02114737A/en
Publication of JPH0720110B2 publication Critical patent/JPH0720110B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Landscapes

  • Detection And Prevention Of Errors In Transmission (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Small-Scale Networks (AREA)

Abstract

PURPOSE:To prevent the loss of timing sending reply information for retransmission request by sending a confirm data from a master station when a data to be sent next does not exist after the end of transmission of the data and inquiring whether or not the data is received correctly up to the sequence number. CONSTITUTION:A master station uses a sequence number adder 100 to add a sequence number to a data to be subjected to multiple address communication from a host layer control section, a multiple address adder 101 adds a multiple address and the result is sent to a broadcast channel through a medium access control section. A timer 107 is reset every time a data is sent to medium access control to count a time, a CF generator 108 generates a confirm data when the timer expires, a sequence number adder 100 inputs a sequence number added finally to the data to set the number and the result is sent through the multiple address adder 101. Upon the receipt of the data, all slave stations compare it with the sequence number of the final correctly received data and in the case of discordance, reply information for the retransmission request is sent.

Description

【発明の詳細な説明】 (産業上の利用分野) 本発明は、親局と複数の子局が同一の通信媒体を介して
接続され、親局がら全ての子局への通信が可能な放送型
チャネルと全ての子局から親局への通信が可能な多重ア
クセス型チャネルとを用いて行なわれるデータの同報通
信方法に関する。
Detailed Description of the Invention (Field of Industrial Application) The present invention is a broadcasting system in which a master station and a plurality of slave stations are connected via the same communication medium, and the master station can communicate with all the slave stations. The present invention relates to a data broadcast communication method that is performed using a multi-access channel and a multiple access channel that allows communication from all slave stations to a master station.

(従来の技術) ここで言う同報通信は、親局がら放送型チャネルへ送信
されたデータを複数の子局がそれを同時に受信すること
によって、同じデータを複数の子局に分配する方法をい
う。ところで、データは、音声や画像と異なり、高品質
な伝送を要求される。プログラムを転送する場合などで
は、1ビツトでも誤ってしまうと、受信した方ではバグ
の存在するプログラムとなるためである。又銀行の各支
店のデータベースなどを書換える場合などで、誤って書
き換えられると、大きな問題となる。
(Prior Art) The broadcast communication referred to here is a method of distributing the same data to multiple slave stations by simultaneously receiving data transmitted from a master station to a broadcast channel. say. By the way, unlike audio and images, data requires high-quality transmission. This is because, when transferring a program, if even one bit is incorrect, the receiving side will end up with a program with a bug. Also, if the database of each branch of a bank is rewritten by mistake, it will cause a big problem.

したがって、通常のデータ通信では、高品質を保障する
為に、次に示す伝送手順を行なっている。受信側でデー
タを正しく受信したならば、正しく受信したことを示す
応答情報を送り返し、送信側では受信側からの応答に従
いデータを送信する。もし受信側でデータの誤りやロス
が起こった場合は、再送要求のための応答情報を返し、
送信側が再送要求の応答情報を受信した場合、再送要求
されたデータを再送する。
Therefore, in normal data communication, the following transmission procedure is performed to ensure high quality. If the receiving side receives the data correctly, it sends back response information indicating that the data was received correctly, and the transmitting side transmits the data according to the response from the receiving side. If a data error or loss occurs on the receiving side, it returns response information for a retransmission request,
When the sending side receives response information for the retransmission request, it retransmits the data requested for retransmission.

従来の同報通信方法も、基本的には同様な方法を取って
いた。つまり親局からデータを送信すると、複数の子局
はそのデータが正しく受信されたならば、それぞれの子
局は、正しく受信されたことを示す応答情報を親局に返
す。正しく受信されなかったことを示す応答情報が戻っ
て来たならば、もう−度、同じ情報を送信する。第3図
にそのシーケンスを示す。第3図は、子局の数が2の場
合を示している。第3図において、D(k)はシーケン
ス番号にの同報データを示しり、(k)は子局i宛ての
シーケンス番号にの再送データである。RR,(k)は
、子局iがシーケンス番号に−1まで正しく受信し、シ
ーケンス番号にのデータを持っているこを示す応答情報
である。通常、データが誤るとハード的に廃棄されるの
で、手順を実行する部分では、シーケンス番号飛びによ
り、データが失われていることを知り、REJ、(k)
を送信する。REJ、(k)は、子局iはに−1までは
正しく受信されており、k以後のデータをもう一度送信
することを要求する応答情報である。その後、子局iが
シーケンス番号にのデータを正しく受信するまで、以後
のデータを廃棄する。
Conventional broadcast communication methods basically followed the same method. That is, when data is transmitted from the master station, if the data is correctly received by the plurality of slave stations, each slave station returns response information indicating that the data has been correctly received to the master station. If response information indicating that it was not received correctly is returned, the same information is transmitted again. Figure 3 shows the sequence. FIG. 3 shows a case where the number of slave stations is two. In FIG. 3, D(k) indicates broadcast data to a sequence number, and (k) indicates retransmission data to a sequence number addressed to slave station i. RR, (k) is response information indicating that the slave station i has correctly received the sequence number up to -1 and has data for the sequence number. Normally, if data is incorrect, it is discarded by hardware, so in the part that executes the procedure, we know that data is lost due to a sequence number jump, and REJ, (k)
Send. REJ, (k) is response information that has been correctly received up to -1 by the slave station i and requests that the data after k be transmitted again. Thereafter, subsequent data is discarded until the slave station i correctly receives the data at the sequence number.

ところで、従来の方法では、子局の数が少ない場合は、
問題はないが、子局の数が増えてくると、上り回線の容
量が非常に大きく必要となり、問題となる。上り回線と
は、子局から親局へ応答情報を送る為の回線で、固定的
に割当てるならば1回線当たり数Kbpsが必要となる
。子局の数が10局のときは全体で数十Kbpsとなり
、それほど問題とならないが、1000局となると、数
Mbpsとなり、データを送る下り回線よりはるかに大
きい容量が必要となる場合が起こり、問題となる。
By the way, in the conventional method, when the number of slave stations is small,
This is not a problem, but as the number of slave stations increases, the uplink capacity becomes extremely large, which becomes a problem. The uplink is a line for sending response information from the slave station to the master station, and if fixedly allocated, several Kbps per line is required. When the number of slave stations is 10, the total speed is several tens of Kbps, which is not a big problem, but when there are 1000 stations, the speed becomes several Mbps, which may require a much larger capacity than the downlink for sending data. It becomes a problem.

一方、多くの局を収容する方法に、ランダムアクセス方
式が有るが、その方式は、送信すべきデータが有ると即
送信し、もし衝突を起こした場合は、再送する方法であ
る。しかし全体のトラフィックが少ないこと、送信する
タイミングがランダムで有ることが前提となっている。
On the other hand, a random access method is a method for accommodating a large number of stations, and in this method, when there is data to be transmitted, it is immediately transmitted, and if a collision occurs, it is retransmitted. However, it is assumed that the overall traffic is small and that the timing of transmission is random.

同報通信の場合、親局からの各々のデータに対して、応
答情報を返すので、全体のトラフィックも多く、しかも
同期が取れて送り出されているので、衝突を起こす頻度
は非常に太きい。したがってランダムアクセス方式を適
用することもできない。
In the case of broadcast communication, since response information is returned for each piece of data from the master station, the overall traffic is large, and since the transmission is synchronized, the frequency of collisions is very high. Therefore, a random access method cannot be applied.

そこでデータが誤った時のみ再送要求の応答情報を、ラ
ンダムアクセス方式を用いて返す方法が考えられる。第
4図にそのシーケンスを示す。第3図と較べて、異なる
ところは固定応答情報RRi(k)がなくなっている。
Therefore, a method can be considered that uses a random access method to return response information for a retransmission request only when the data is incorrect. Figure 4 shows the sequence. Compared to FIG. 3, the difference is that the fixed response information RRi(k) is no longer present.

したがって、上り回線のトラフィックが少なくなり、応
答情報の送信タイミンクもランダムであるため、ランダ
ムアクセス方式が用いることができる。
Therefore, the uplink traffic is reduced and the transmission timing of response information is random, so a random access method can be used.

(発明が解決しようとする問題点) ところで、受信データに誤りがあればハード的に廃棄さ
れるので、手順を実行する部分では、受信データのシー
ケンス番号飛びによって前のデータが廃棄されているこ
とを知り、再送の要求を行なう。したがって、データが
誤って廃棄されていても、次のデータが送られて来ない
限り受信側にデータを失ったことが分からず、再送要求
の為の応答情報を送るタイミングも失ってしまう。
(Problem to be solved by the invention) By the way, if there is an error in the received data, it will be discarded by the hardware, so in the part that executes the procedure, the previous data will be discarded due to the jump in the sequence number of the received data. and requests retransmission. Therefore, even if data is erroneously discarded, the receiving side will not know that the data has been lost until the next data is sent, and the timing for sending response information for a retransmission request will also be lost.

(問題を解決するための手段) 親局と複数の子局が同一の通信媒体を介して接続され、
前記親局から前記複数の全ての子局への通信が可能な放
送型チャネルと前記複数の全ての子局から前記親局への
通信が可能な多重アクセス型チャネルからなる通信シス
テムにおける同報通信方法であり、前記親局から送るべ
き同報データに対してシーケンス番号を付加して前記放
送型チャネルへ送信し、前記複数の子局は受信した前記
同報データのシーケンス番号を調べ、番号飛びが有った
ときのみ再送要求のための応答情報を前記多重アクセス
型チャネルへ送信する回報通信方法において、前記親局
は同報データを前記放送型チャネル送信した後、ある定
められた時間経っても送るべき同報データが無い場合は
最後に送信した同報データのシーケンス番号を付加した
疑似同報データを送信し、前記全ての子局は、前記疑似
同報データを受信すると正しく受信した最後のデータの
シーケンス番号と比較し、一致しなければ再送要求のた
めの応答情報を送信することを特徴とする。
(Means for solving the problem) A master station and multiple slave stations are connected via the same communication medium,
Broadcast communication in a communication system comprising a broadcast type channel that allows communication from the master station to all of the plurality of slave stations and a multiple access type channel that allows communication from all of the plurality of slave stations to the master station. In this method, a sequence number is added to the broadcast data to be sent from the master station and transmitted to the broadcast channel, and the plurality of slave stations check the sequence numbers of the received broadcast data and check the number jump. In the broadcast communication method in which response information for a retransmission request is sent to the multiple access channel only when there is a retransmission request, the master station transmits the broadcast data to the broadcast channel and then If there is no broadcast data to be sent, pseudo-broadcast data is sent with the sequence number of the last transmitted broadcast data added, and when all the slave stations receive the pseudo-broadcast data, the last correctly received broadcast data is sent. , and if they do not match, response information for a retransmission request is transmitted.

(作用) 第5図に示すように、本発明はデータの送信を終わって
、次に送信すべきデータが無い場合が続くと、コンファ
ームデータCF(k)を送信し、シーケンス番号kまで
、正しく受信されているかどうかを、問い合せる。正し
く受信されていれば、何も応答しないが、正しく受信さ
れていなければ、再送要求の応答情報REJ、(k)を
送信する。CF(k)を送信した後、次に送信すべきデ
ータが無い時が続くと、再びCF(k)を送信する。こ
れによって、受信側で正しく受信できなくて廃棄された
が、次のデータが送られて来ない為に、再送要求の為の
応答情報を送るタイミングがなくなるのを防ぎ、データ
が廃棄されたならば、受信側は必ず再送要求を行なうよ
うになる。
(Function) As shown in FIG. 5, when the present invention finishes transmitting data and there continues to be no data to be transmitted next, it transmits confirm data CF(k) and continues up to sequence number k. Inquire whether it is being received correctly. If it is correctly received, no response is made, but if it is not correctly received, response information REJ, (k) of the retransmission request is transmitted. After transmitting CF(k), if there is no data to transmit next, CF(k) is transmitted again. This prevents data from being discarded because it could not be received correctly on the receiving side, but because the next data is not sent, there is no time to send response information for a retransmission request. For example, the receiving side always makes a retransmission request.

(実施例) 本発明の実施例について、図面を用いて説明する。第1
図に本発明の親局側の実施例を示す。上位レイヤ制御部
より同報通信すべきデータが到着すると、まずシーケン
ス番号付加器100において、シーケンス番号を付加し
、同報アドレス付加器101と再送バッファ102に送
られる。同報アドレス付加器では、シーケンス番号を付
加されたデータに更に同報アドレスを付加し、メディア
アクセス制御部を通して放送型チャネルに送り出される
(Example) An example of the present invention will be described using the drawings. 1st
The figure shows an embodiment of the present invention on the master station side. When data to be broadcasted arrives from the upper layer control unit, a sequence number is added to the data in a sequence number adder 100, and the data is sent to a broadcast address adder 101 and a retransmission buffer 102. The broadcast address adder adds a broadcast address to the data to which the sequence number has been added, and sends the data to a broadcast channel through the media access control section.

バッファ管理器103は再送バッファが一杯になったら
、古いデータから廃棄する制御を行なう。ここで、再送
バッファは十分な容量を持ち、シーケンス番号も十分な
ビット数で表すものとする。メディアアクセス制御部を
通して受信されたREJ、(k)は再送制御器104に
送られる。再送制御部104では、再送を要求してきた
子局アドレスを個別アドレス付加器105に送り、また
取り出し器106を制御して再送バッファ102の中か
ら、シーケンス番号に以上のデータを取り出し、個別ア
ドレス付加器105へ送る。個別アドレス器105では
取り出し器106から送られたデータに個別アドレスを
付加し、メディアアクセス制御部へおくる。タイマ10
7はデータがメディアアクセス制御に送られる度にリセ
ットされてタイムをカウントし、メディアアクセス制御
に送られるデータがなくて、タイムアウトになった場合
は、CF発生器108にタイムアウト信号が人力される
。CF発生器108では、タイムアウト信号が人力され
ると、コンファームデータを生成し、シーケンス番号付
加器100からデータに付加された最も古いシーケンス
番号を入力して、その番号をセットし、同報アドレス付
加器101へ送る。
When the retransmission buffer becomes full, the buffer manager 103 performs control to discard the oldest data first. Here, it is assumed that the retransmission buffer has sufficient capacity and the sequence number is also represented by a sufficient number of bits. The REJ,(k) received through the media access controller is sent to the retransmission controller 104. The retransmission control unit 104 sends the slave station address that requested retransmission to the individual address adder 105, and also controls the extractor 106 to extract the data with the sequence number or more from the retransmission buffer 102, and adds the individual address. and send it to the container 105. The individual address unit 105 adds an individual address to the data sent from the extractor 106 and sends the data to the media access control unit. timer 10
7 is reset and counts the time every time data is sent to the media access control, and if there is no data to be sent to the media access control and a timeout occurs, a timeout signal is manually input to the CF generator 108. When the timeout signal is input manually, the CF generator 108 generates confirm data, inputs the oldest sequence number added to the data from the sequence number adder 100, sets that number, and sets the broadcast address. It is sent to the adder 101.

第2図に本発明の子局の実施例を示す。メディアアクセ
ス制御部を通して受信したデータD(k)、D、(k)
及びCF(k)は受信データの識別器200へ送られ、
通常のデータD(10、Di(k)とコンファームデー
タCF(k)と区別され、通常データはシーケンス番号
チエツク器201に送られ、コンファームデータは比較
器202へ送られる。シーケンス番号チエツク器201
では受信データ識別器から送られたデータのシーケンス
番号が前に受信したデータのシーケンス番号+1である
かどうかを調べ、番号飛びがなければ、上位レイヤ制御
部へ送り、もし番号飛びがあれば、REJ発生器203
に飛んだシーケンス番号の最も若い番号を知らせる。比
較器202ではCFのシーケンス番号とシーケンス番号
チエツク器201から送られてくる現在まで番号飛びが
なく受信された最後のデータのシーケンス番号とを比較
し、一致しなければ、その最後のデータのシーケンス番
号をREJ発生器203に送る。REJ発生器203で
は送られてきた番号kをセットした応答情報REJ(k
)を生成し、メディアアクセス制御部へおくる。メディ
アアクセス制御部では自局アドレスを付加して多重アク
セス型チャネルへ送信される。もし衝突などによる応答
情報のロスがあった場合は、メディアアクセス制御部で
再送されるものとする。
FIG. 2 shows an embodiment of the slave station of the present invention. Data D(k), D,(k) received through the media access control unit
and CF(k) are sent to the received data identifier 200,
Normal data D(10, Di(k) and confirmed data CF(k) are distinguished, and the normal data is sent to the sequence number checker 201, and the confirmed data is sent to the comparator 202.Sequence number checker 201
Then, check whether the sequence number of the data sent from the received data discriminator is the sequence number of the previously received data + 1. If there is no number jump, send it to the upper layer control unit, and if there is a number jump, REJ generator 203
Indicates the lowest sequence number that was flown to. The comparator 202 compares the sequence number of the CF with the sequence number of the last data that has been received without any jumps up to the present, sent from the sequence number checker 201. If they do not match, the sequence number of the last data is Send the number to REJ generator 203. The REJ generator 203 generates response information REJ(k
) and sends it to the media access control unit. The media access control unit adds its own station address and transmits it to the multiple access channel. If response information is lost due to a collision or the like, the media access control unit will retransmit it.

(発明の効果) 本発明は、受信側で正しく受信できなくて廃棄されたが
、次のデータが送られて送られて来ない為に、再送要求
の為の応答情報を送るタイミングがなくなるのを防ぎ、
データが廃棄されたならば、受信側は必ず再送要求を行
なうようになっている。
(Effect of the invention) In the present invention, the receiving side cannot receive the data correctly and is discarded, but since the next data is sent and not received, there is no time to send the response information for the retransmission request. prevent,
If data is discarded, the receiving side always makes a retransmission request.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は本発明の親局側の実施例を示すブロック図、第
2図は本発明の子局側の実施例を示すブロック図、第3
,4図は従来の方法のシーケンス図、第5図は本発明を
示すシーケンス図である。 図において、100はシーケンス番号付加器、101は
同報アドレス付加器、102は再送バッファ、103は
バッファ管理器、104は再送制御器、105は個別ア
ドレス付加器、106は取り出し器、107はタイマ、
108はCF発生器である。
FIG. 1 is a block diagram showing an embodiment of the present invention on the master station side, FIG. 2 is a block diagram showing an embodiment of the slave station side of the present invention, and FIG.
, 4 are sequence diagrams of the conventional method, and FIG. 5 is a sequence diagram showing the present invention. In the figure, 100 is a sequence number adder, 101 is a broadcast address adder, 102 is a retransmission buffer, 103 is a buffer manager, 104 is a retransmission controller, 105 is an individual address adder, 106 is an extractor, and 107 is a timer. ,
108 is a CF generator.

Claims (1)

【特許請求の範囲】[Claims]  親局と複数の子局が同一の通信媒体を介して接続され
、前記親局から前記複数の全ての子局への通信が可能な
放送型チャネルと前記複数の全ての子局から前記親局へ
の通信が可能な多重アクセス型チャネルからなる通信シ
ステムにおける同報通信方法であり、前記親局から送る
べき同報データに対してシーケンス番号を付加して前記
放送型チャネルへ送信し、前記複数の子局は受信した前
記同報データのシーケンス番号を調べ、番号飛びが有っ
たときのみ再送要求のための応答情報を前記多重アクセ
ス型チャネルへ送信する同報通信方法において、前記親
局は同報データを前記放送型チャネル送信した後、ある
定められた時間経っても送るべき同報データが無い場合
は最後に送信した同報データのシーケンス番号を付加し
た疑似同報データを送信し、前記全ての子局は、前記疑
似同報データを受信すると正しく受信した最後のデータ
のシーケンス番号と比較し、一致しなければ再送要求の
ための応答情報を送信することを特徴とする同報通信方
法。
A broadcast type channel in which a master station and a plurality of slave stations are connected via the same communication medium, and communication is possible from the master station to all of the plurality of slave stations, and from all of the plurality of slave stations to the master station. This is a broadcast communication method in a communication system consisting of multiple access channels capable of communicating with multiple access channels, in which a sequence number is added to the broadcast data to be sent from the master station and transmitted to the broadcast channel. In the broadcast communication method, the slave station checks the sequence number of the received broadcast data and transmits response information for a retransmission request to the multiple access channel only when there is a number jump, the master station After transmitting the broadcast data to the broadcast type channel, if there is no broadcast data to be sent even after a certain predetermined time has elapsed, pseudo broadcast data to which the sequence number of the last transmitted broadcast data is added is transmitted; Broadcast communication characterized in that when all the slave stations receive the pseudo broadcast data, they compare it with the sequence number of the last correctly received data, and if they do not match, they transmit response information for a retransmission request. Method.
JP63269733A 1988-10-25 1988-10-25 Broadcast communication method Expired - Lifetime JPH0720110B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP63269733A JPH0720110B2 (en) 1988-10-25 1988-10-25 Broadcast communication method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP63269733A JPH0720110B2 (en) 1988-10-25 1988-10-25 Broadcast communication method

Publications (2)

Publication Number Publication Date
JPH02114737A true JPH02114737A (en) 1990-04-26
JPH0720110B2 JPH0720110B2 (en) 1995-03-06

Family

ID=17476408

Family Applications (1)

Application Number Title Priority Date Filing Date
JP63269733A Expired - Lifetime JPH0720110B2 (en) 1988-10-25 1988-10-25 Broadcast communication method

Country Status (1)

Country Link
JP (1) JPH0720110B2 (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06141028A (en) * 1992-09-11 1994-05-20 Nec Corp Broadcast communication managing system
JPH0787136A (en) * 1993-06-23 1995-03-31 Nec Corp Multi-address communication system
JP2000261469A (en) * 1999-03-10 2000-09-22 Toshiba Corp Multiple address transmission system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPH06141028A (en) * 1992-09-11 1994-05-20 Nec Corp Broadcast communication managing system
JPH0787136A (en) * 1993-06-23 1995-03-31 Nec Corp Multi-address communication system
JP2000261469A (en) * 1999-03-10 2000-09-22 Toshiba Corp Multiple address transmission system

Also Published As

Publication number Publication date
JPH0720110B2 (en) 1995-03-06

Similar Documents

Publication Publication Date Title
US4423414A (en) System and method for name-lookup in a local area network data communication system
EP0422914B1 (en) Station-to-station full duplex communication in a communications network
US5555266A (en) Method for reducing transmission delays in a packet transmission system
JP2551304B2 (en) Broadcast link control method
EP0577747A1 (en) Method for multi-purpose utilization of resources in a communication system
JP2001160813A (en) Wireless network
JPH07193585A (en) Communication access control method and communication control equipment
US5684802A (en) System and method for hybrid contention/polling protocol collison resolution used backoff timers with polling
JP2000209232A (en) Radio resource assignment method in radio communication system
JPH03104335A (en) Signal transmission system
JPH02114737A (en) Multiple address communication method
JPH0591009A (en) Re-transmission control system
JPH11239088A (en) Transmission method and transmission reserving method in satellite mobile communicaion system and base station device of satellite mobile communication system
JPH02101841A (en) Multiple address communication method
JP2752742B2 (en) Packet transmission device
JPH11298477A (en) Transmission control method and transmission controller
JP2609417B2 (en) Satellite broadcast method
JP2638482B2 (en) Broadcast link control method
JPH0366859B2 (en)
US6986065B2 (en) Distribution result verification method for information distribution system
Gopal et al. Dynamic address assignment in broadcast networks
JPH04354221A (en) Satellite packet communication system
CA1208736A (en) System and method for name-lookup in a local area network data communication system
JPH0653877A (en) Satellite communication system
JPH04178032A (en) Satellite communication method and satellite communication system

Legal Events

Date Code Title Description
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20080306

Year of fee payment: 13

FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090306

Year of fee payment: 14

EXPY Cancellation because of completion of term
FPAY Renewal fee payment (event date is renewal date of database)

Free format text: PAYMENT UNTIL: 20090306

Year of fee payment: 14