JP2962903B2 - New station invitation system in LAN - Google Patents

New station invitation system in LAN

Info

Publication number
JP2962903B2
JP2962903B2 JP30024691A JP30024691A JP2962903B2 JP 2962903 B2 JP2962903 B2 JP 2962903B2 JP 30024691 A JP30024691 A JP 30024691A JP 30024691 A JP30024691 A JP 30024691A JP 2962903 B2 JP2962903 B2 JP 2962903B2
Authority
JP
Japan
Prior art keywords
station
token
invitation
solicitation
new
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 - Lifetime
Application number
JP30024691A
Other languages
Japanese (ja)
Other versions
JPH05136799A (en
Inventor
貢 田中
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.)
Efu Efu Shii Kk
Original Assignee
Efu Efu Shii Kk
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 Efu Efu Shii Kk filed Critical Efu Efu Shii Kk
Priority to JP30024691A priority Critical patent/JP2962903B2/en
Publication of JPH05136799A publication Critical patent/JPH05136799A/en
Application granted granted Critical
Publication of JP2962903B2 publication Critical patent/JP2962903B2/en
Anticipated expiration legal-status Critical
Expired - Lifetime legal-status Critical Current

Links

Description

【発明の詳細な説明】DETAILED DESCRIPTION OF THE INVENTION

【0001】[0001]

【産業上の利用分野】本発明は、LANにおける新局勧
誘方式に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a new station invitation system in a LAN.

【0002】[0002]

【従来の技術】LANにおけるアクセス制御方式として
CSMA方式、トークンパッシング方式などが知られて
いる。トークンパッシング方式は、トークンと呼ばれる
送信権情報が各局に巡回的に受渡され、トークンを受け
取った局だけがデータの送信権を得ることのできるアク
セス制御方式である。なお、トークンの受渡しは、伝送
方向の下位の局に順に受渡す方式、予め受渡しの順序を
優先順序などを考慮して決めておく方式などがある。
2. Description of the Related Art As an access control method in a LAN, a CSMA method, a token passing method and the like are known. The token passing method is an access control method in which transmission right information called a token is cyclically delivered to each station, and only the station that has received the token can obtain the right to transmit data. Note that there are a method of delivering tokens to a lower station in the transmission direction in order, a method of determining the order of delivery in advance in consideration of a priority order, and the like.

【0003】図5は、トークンパッシング方式のLAN
における従来の新局勧誘方式の説明図である。ここで、
局0、局2、局4、局6は論理リングに既に加入してい
るリンク局であり、局1、局3、局5、局7は論理リン
グに未加入の新局である。図5の実線の矢印は、トーク
ンの受渡し方向を示しており、この例では伝送方向の下
位の局、例えば局0から局2、局2から局4へ順にトー
クンが渡される。
FIG. 5 shows a token-passing LAN.
FIG. 4 is an explanatory diagram of a conventional new station invitation system in FIG. here,
Stations 0, 2, 4, and 6 are link stations that have already joined the logical ring, and stations 1, 3, 5, and 7 are new stations that have not joined the logical ring. The solid arrows in FIG. 5 indicate the token transfer direction. In this example, the tokens are sequentially transferred from the lower stations in the transmission direction, for example, from station 0 to station 2 and from station 2 to station 4.

【0004】図5において、トークン保持局は、新局の
局番が、トークン保持局の局番<新局の局番<後続局の
局番、又はトークン保持局の局番>新局の局番>後続局
の局番の関係にある場合に、自局と後続局との間に新局
が存在するものと判断して新局の勧誘を行う。
In FIG. 5, in the token holding station, the station number of the new station is such that the station number of the token holding station <the station number of the new station <the station number of the following station or the station number of the token holding station> the station number of the new station> the station number of the following station In such a case, it is determined that a new station exists between the own station and the succeeding station, and a new station is invited.

【0005】各リンク局が勧誘動作を開始するタイミン
グは、各リンク局が有する勧誘用カウンタ(図示せず)
により制御されている。この勧誘用カウンタには、イニ
シャル時にランダムな初期値がセットされ、リンク局が
トークンを受け取る毎にその勧誘用カウンタの値がディ
クリメントされる。そして、勧誘用カウンタの値が
「0」となったとき、該当するリンク局において新局の
勧誘動作が行われる。また、各リンク局は、カウンタの
値が「0」となって勧誘動作を行った後、勧誘用カウン
タに再度ランダムな初期値をセットする。
The timing at which each link station starts the solicitation operation is determined by a solicitation counter (not shown) of each link station.
Is controlled by A random initial value is set in the invitation counter at the time of initializing, and the value of the invitation counter is decremented every time the link station receives a token. Then, when the value of the invitation counter becomes “0”, an invitation operation for a new station is performed in the corresponding link station. Further, each link station performs a solicitation operation when the value of the counter becomes “0”, and then sets a random initial value again in the solicitation counter.

【0006】[0006]

【発明が解決しようとする課題】上述した方式では、各
リンク局がランダムなトークン周期、すなわち自局の勧
誘用カウンタの値が「0」となる毎に勧誘動作を行うの
で、トークンが一巡する間に複数のリンク局が勧誘動作
を行う可能性がある。
In the above-mentioned method, each link station performs a solicitation operation at a random token period, that is, each time the value of the solicitation counter of its own station becomes "0", so that the token makes one cycle. There is a possibility that a plurality of link stations perform the solicitation operation in the meantime.

【0007】リンク局の新局への勧誘及びその勧誘に対
する新局の応答などには一定の処理時間がかかるので、
トークンが一巡する間に複数のリンク局で勧誘動作が行
われると、トークン巡回時間が長くなる。その為、正確
なデータのリフレシュ周期を確保する必要のあるシステ
ムでは、トークン巡回時間の遅れが問題となる。
Since it takes a certain processing time to invite a link station to a new station and to respond to the invitation by the new station, a certain processing time is required.
If a solicitation operation is performed at a plurality of link stations during one cycle of the token, the token circulation time becomes longer. Therefore, in a system in which it is necessary to secure an accurate data refresh cycle, a delay in the token circulation time becomes a problem.

【0008】本発明の課題は、トークン巡回時間の遅れ
を少なくすると共に、各リンク局が均等に新局の勧誘動
作を行えるようにすることである。
SUMMARY OF THE INVENTION It is an object of the present invention to reduce the delay of the token circulation time and to enable each link station to uniformly invite a new station.

【0009】[0009]

【課題を解決するための手段】図1は、第1の発明の原
理説明図である。同図において、判定手段1は、自局が
論理リングに加入しようとする新局に対して勧誘動作を
行った後、トークンが論理リングを一巡以上したか否か
を判定する。
FIG. 1 is a diagram illustrating the principle of the first invention. In the figure, the determination means 1 determines whether or not the token has made one or more rounds of the logical ring after performing a solicitation operation for a new station to which the local station intends to join the logical ring.

【0010】勧誘局指定手段2は、上記判定手段1でト
ークンが一巡以上したと判定されたとき、トークンフレ
ームに次勧誘権保持局として後続局を指定する勧誘権保
持局情報を付加して送出する。なお、トークンフレーム
は、例えばトークンを渡す宛先局番を示すトークンパス
先局番と、送信元局番と、次の勧誘権保持局の局番を示
す勧誘権保持局情報などで構成される。
When the determining means 1 determines that the token has completed one or more rounds, the soliciting station designating means 2 adds solicitation right holding station information for designating a subsequent station as the next solicitation right holding station to the token frame and sends it out. I do. The token frame includes, for example, a token pass destination station number indicating a destination station number to which a token is to be transferred, a source station number, and invitation right holding station information indicating the next invitation right holding station number.

【0011】また、第2の発明では、勧誘動作後、トー
クンフレームに次勧誘権保持局としてトークンの送信元
である先行局を指定する勧誘権保持局情報を付加して勧
誘権を先行局に渡す。
In the second invention, after the solicitation operation, the solicitation right holding station information for designating the preceding station from which the token is transmitted as the next solicitation right holding station is added to the token frame, and the solicitation right is given to the preceding station. hand over.

【0012】[0012]

【作用】第1の発明では、トークンフレームの勧誘権保
持局情報で指定される局が勧誘権を得、その勧誘権を得
た局のみが新局の勧誘動作を行う。そして、勧誘権を得
た局は、勧誘動作を行った後、トークンが論理リングを
一巡以上した時点で次局に勧誘権を渡す。
According to the first aspect, the station designated by the invitation right holding station information of the token frame obtains the invitation right, and only the station which has obtained the invitation right performs the operation of soliciting a new station. Then, after performing the solicitation operation, the station that has obtained the solicitation right passes the solicitation right to the next station when the token makes one or more rounds of the logical ring.

【0013】また、第2の発明では、勧誘動作が行われ
た後、トークン送信元の先行局に勧誘権が渡されるの
で、トークンがほぼ一巡して先行局に渡るまでの間は勧
誘動作は行われ無い。
Further, in the second invention, after the solicitation operation is performed, the solicitation right is passed to the preceding station of the token transmission source. Not done.

【0014】従って、第1の発明では、トークンが一巡
する間に勧誘動作を行う局は、1局に制限され、第2の
発明では、トークンが一巡する間に勧誘動作を行う局は
最大で2局に制限されるので、トークン巡回時間が予想
される一定時間より長くなることが無く、正確なデータ
のリフレシュ周期を保証する必要のある場合でも問題が
生じない。また、後続局又は先行局に順に勧誘権を渡す
ようにしているので、各局に均等に勧誘権を与えること
ができる。
Therefore, in the first invention, the number of stations performing the solicitation operation during the cycle of the token is limited to one station, and in the second invention, the number of stations performing the solicitation operation during the cycle of the token is maximum. Since the number of stations is limited to two, the token circulation time does not become longer than an expected fixed time, and no problem occurs even when it is necessary to guarantee an accurate data refresh cycle. Also, since the solicitation right is sequentially passed to the succeeding station or the preceding station, the solicitation right can be equally given to each station.

【0015】[0015]

【実施例】以下、本発明の実施例を図面を参照しながら
説明する。以下の実施例は、本発明の新局勧誘方式をト
ークンパッシング方式のLANに適用した場合を示して
いる。
Embodiments of the present invention will be described below with reference to the drawings. The following embodiment shows a case where the new station invitation system of the present invention is applied to a token passing LAN.

【0016】図2は、本発明の新局勧誘方式に基づくト
ークンフレームのフレームフォーマット図である。図2
に示すように、トークンフレームは、次トークン保持局
を示すトークンパス先局番と、送信元局番と、次勧誘権
保持局を指定する勧誘権保持局情報とからなっている。
FIG. 2 is a frame format diagram of a token frame based on the new station invitation system of the present invention. FIG.
As shown in (1), the token frame includes a token pass destination station number indicating the next token holding station, a source station number, and invitation right holding station information designating the next invitation right holding station.

【0017】次に、先行局がトークンと共に勧誘権を後
続局に渡す本発明の第1実施例の新局勧誘方式を、図3
を参照して説明する。今、局1、局2、局4、局5が論
理リングに加入しているときに、勧誘権の与えられた局
2が、自局と後続局の局4との間に存在するであろう局
3に対して論理リング(リンク)への加入を勧誘する場
合の動作を説明する。
Next, the new station invitation system according to the first embodiment of the present invention, in which the preceding station passes the invitation right together with the token to the succeeding station, is shown in FIG.
This will be described with reference to FIG. Now, when the stations 1, 2, 4, and 5 have joined the logical ring, the station 2 to which the invitation has been granted exists between the own station and the subsequent station 4. An operation for inviting the deaf station 3 to join a logical ring (link) will be described.

【0018】局2は、局1から送信された(図3の矢印
)トークンフレーム1のトークンパス先局番、勧誘権
保持局情報を解析して、自局がトークン保持局及び勧誘
権保持局として指定されていることを認識したなら、送
信が必要なデータがあればそのデータをネットワーク上
に送出し、さらに自局と後続局4との間に存在する可能
性のある新局3に対して勧誘動作を行う(図3の矢印
)。また、局2は、勧誘動作を1度行ったことを記憶
しておく。
The station 2 analyzes the token pass destination station number and the invitation right holding station information of the token frame 1 transmitted from the station 1 (arrow in FIG. 3) and determines that the own station serves as the token holding station and the invitation right holding station. If it recognizes that it is designated, if there is data that needs to be transmitted, the data is sent out to the network, and the new station 3 that may exist between the own station and the succeeding station 4 is sent to the new station 3. A solicitation operation is performed (arrow in FIG. 3). Further, the station 2 stores that the invitation operation has been performed once.

【0019】この勧誘動作の結果、論理リングに新規に
加入しようとする新局が存在しなければ、局2は、トー
クン保持局として後続局の局4を指定し、さらに勧誘権
保持局として自局を指定する勧誘権保持局情報をトーク
ンフレーム2に付加し、そのトークンフレーム2を後続
局の局4に送信する(図3の矢印)。
As a result of the invitation operation, if there is no new station that wants to newly join the logical ring, the station 2 designates the succeeding station 4 as the token holding station, and further sets itself as the invitation right holding station. The invitation right holding station information designating the station is added to the token frame 2, and the token frame 2 is transmitted to the subsequent station 4 (arrow in FIG. 3).

【0020】局4は、局2から受信したトークンフレー
ム2のトークンパス先局番、勧誘権保持局情報を解析し
て、自局がトークン保持局として指定され、勧誘権保持
局として他局が指定されていることを認識したなら、送
信すべきデータが有ればそのデータをネットワーク上に
送出した後、勧誘動作を行わず受信した勧誘権保持局情
報と同一の情報をトークンフレームにセットする。さら
に、後続局の局5の局番をトークンフレームのトークン
パス先局番にセットして局5に送信する(図3の矢印
′)。
The station 4 analyzes the token pass destination station number and the invitation right holding station information of the token frame 2 received from the station 2, and designates itself as a token holding station and another station as an invitation right holding station. If it is recognized that there is data to be transmitted, the data is transmitted to the network, and the same information as the received invitation right holding station information is set in the token frame without performing the invitation operation. Further, the station number of the succeeding station 5 is set to the token pass destination station number of the token frame and transmitted to the station 5 (arrow 'in FIG. 3).

【0021】以下同様に、局5及び局1は、先行局(こ
の場合、局4又は局5)から受信するトークンフレーム
を解析して、トークン局として自局が指定され、かつ勧
誘権保持局として他局が指定されていることを認識した
なら、勧誘動作を行わず受信した勧誘権保持局情報と同
一の情報をトークンフレームにセットして後続局にトー
クンを渡す。
Similarly, the stations 5 and 1 analyze the token frame received from the preceding station (in this case, the station 4 or the station 5), specify their own station as the token station, and hold the invitation right holding station. , The same information as the received invitation right holding station information is set in the token frame without performing the invitation operation, and the token is passed to the subsequent station.

【0022】このようにして、局1から自局、すなわち
局2を勧誘権保持局として指定する勧誘権保持局情報を
受信したなら、局2は、自局が既に勧誘動作を行ってい
るので、論理リングに加入している各リンク局の間をト
ークンが一巡したものと判断する。この場合、局2は勧
誘動作を行わず、トークンフレーム3の勧誘権保持局情
報に後続局の局4の局番をセットして、勧誘権とトーク
ンを後続局の局4に渡す(図3の矢印)。
In this way, if the station 1 receives the invitation right holding station information designating the own station, that is, the station 2 as the invitation right holding station, the station 2 has already performed the invitation operation. It is determined that the token has made one round between the link stations subscribing to the logical ring. In this case, the station 2 does not perform the invitation operation, sets the station number of the succeeding station 4 in the invitation right holding station information of the token frame 3, and passes the invitation right and the token to the succeeding station 4 (see FIG. 3). Arrow).

【0023】この実施例では、先行局から勧誘権を受け
取った局が勧誘動作を行い、勧誘動作を一度行ったこと
を記憶しておき、勧誘権保持局情報として自局の局番を
セットしたトークンフレームを後続局に送信する。そし
て、再び自局を勧誘権保持局として指定するトークンフ
レームを受信したなら、後続局に勧誘権を渡すようにし
ている。
In this embodiment, the station which has received the solicitation right from the preceding station performs the solicitation operation, stores that the solicitation operation has been performed once, and stores the token number in which its own station number is set as the solicitation right holding station information. Send the frame to the subsequent station. Then, when receiving the token frame designating the own station as the invitation right holding station again, the invitation station passes the invitation right to the succeeding station.

【0024】従って、本方式では、トークンが一巡する
間に勧誘動作をする局は1局に制限されるので、従来の
ように複数の局でランダムに勧誘動作が行われトークン
巡回時間が長くなることが無い。よって、一定時間毎に
データのリフレシュを行う必要があるシステムにおいて
も、本実施例の新局勧誘方式により支障なく新局の勧誘
を行うことができる。
Therefore, in the present system, the number of stations that invite a token during one round is limited to one station, so that a plurality of stations randomly perform an invite operation as in the prior art, and the token circulation time becomes longer. There is nothing. Therefore, even in a system that needs to refresh data at regular time intervals, a new station can be invited without any trouble by the new station invitation method of the present embodiment.

【0025】なお、図3は、リング状の構成のLANを
示しているが、バス状、スター状のLANであっても良
い。次に、先行局に勧誘権を渡す本発明の第2実施例
を、図4を参照して説明する。なお、この第2実施例の
トークンフレームのフォーマットは、図2に示したフォ
ーマットと同じである。
Although FIG. 3 shows a LAN having a ring configuration, it may be a bus or star LAN. Next, a second embodiment of the present invention for transferring an invitation right to a preceding station will be described with reference to FIG. The format of the token frame of the second embodiment is the same as the format shown in FIG.

【0026】先行局の局1から送信されたトークンフレ
ーム1(図4のトークンフレーム1)の勧誘権保持局情
報が自局(局2)の局番と一致する場合には、局2は自
局と後続局の局4との間に存在するであろう新局の局3
の勧誘動作を行う(図4の矢印)。
If the invitation right holding station information of the token frame 1 (token frame 1 in FIG. 4) transmitted from the preceding station 1 matches the station number of the own station (station 2), the station 2 becomes the own station. New station 3 that will exist between the new station and the subsequent station 4
(The arrow in FIG. 4).

【0027】自局と後続局の局4との間に新局が存在し
ない場合には、トークンパス先局番として後続局の局4
の局番をセットし、次勧誘権保持局として先行局の局1
の局番をトークンフレーム2の勧誘権保持局情報にセッ
トして、後続局の局4に送信する(図4の矢印)。
If there is no new station between the own station and the succeeding station 4, the subsequent station 4 is set as the token pass destination station number.
Of the preceding station as the next invitation right holding station.
Is set in the invitation right holding station information of the token frame 2 and transmitted to the succeeding station 4 (arrow in FIG. 4).

【0028】局4は、局2からのトークンフレーム2を
受信したなら、そのトークンフレーム2の中のトークン
パス先局番、勧誘権保持局情報を解析し、トークン局が
自局で、勧誘権保持局が自局でないことを認識したな
ら、送信すべきデータが存在すればそのデータをネット
ワーク上に送出した後、新局の勧誘動作を行わず、受信
した勧誘権保持局情報と同一の情報をトークンフレーム
にセットする。さらに、後続局の局5の局番をトークン
パス先局番としてセットして局5に送信する。
When the station 4 receives the token frame 2 from the station 2, the station 4 analyzes the token pass destination station number and the invitation right holding station information in the token frame 2, and the token station is the station itself and holds the invitation right. If the station recognizes that it is not its own station, it sends the data to the network if there is data to be transmitted, and does not perform the invitation operation of the new station, but transmits the same information as the received invitation right holding station information. Set in the token frame. Further, the station number of the succeeding station 5 is set as the token pass destination station number and transmitted to the station 5.

【0029】以下同様にして局5で、受信した勧誘権保
持局情報と同一の情報がトークンフレームにセットされ
局1に送信される。局1は、局5からのトークンフレー
ムを受信したなら、トークンフレームの勧誘権保持局情
報を解析し、勧誘権保持局情報が自局の局番と一致した
なら新局の勧誘動作を行う。このとき、自局と局2との
間に新局が存在しなければ、トークンフレーム3のトー
クンパス先局番として後続局の局2の局番をセットし、
勧誘権保持局情報として局1の先行局の局5の局番をセ
ットして後続局の局2に送信する(図4の矢印)。
In the same manner, in the station 5, the same information as the received invitation right holding station information is set in the token frame and transmitted to the station 1. When receiving the token frame from the station 5, the station 1 analyzes the invitation right holding station information of the token frame, and if the invitation right holding station information matches the station number of the own station, performs an operation of soliciting a new station. At this time, if there is no new station between the own station and the station 2, the station number of the succeeding station 2 is set as the token pass destination station number of the token frame 3, and
The station number of the station 5 which is the preceding station of the station 1 is set as the invitation right holding station information and transmitted to the station 2 which is the succeeding station (arrow in FIG. 4).

【0030】以下、各リンク局で上述した動作が繰り返
されるが、この場合勧誘権保持局として局5が指定され
ているので、局2、局4では勧誘動作は行われず、局5
にトークンが渡された時点で始めて勧誘動作が行われ
る。
Thereafter, the above operation is repeated at each link station. In this case, since the station 5 is designated as the invitation right holding station, the stations 2 and 4 do not perform the invitation operation, and the station 5 does not perform the invitation operation.
The solicitation operation is performed only when the token is passed to.

【0031】この第2実施例では、トークンを有する局
が後続局にトークンを渡し、勧誘権を有する局が先行局
を次勧誘権保持局として指定するようにしたので、トー
クンが論理リングを一巡する間に勧誘動作を行う局を2
局以下に制限することができる。
In the second embodiment, the station having the token passes the token to the succeeding station, and the station having the invitation right designates the preceding station as the next invitation right holding station. 2 stations that perform solicitation during
It can be restricted to stations below.

【0032】従って、従来のようにトークンが一巡する
間に多数の局が勧誘動作を行うことが無く、トークン巡
回時間が一定時間以上長くなるのを防止できる。また、
先行局に順に勧誘権が与えられるので、各局が均等に勧
誘動作を行うことができる。
Therefore, unlike the related art, many stations do not perform an invitation operation while the token makes one round, and it is possible to prevent the token rounding time from becoming longer than a certain time. Also,
Since the solicitation right is sequentially given to the preceding stations, each station can perform the solicitation operation equally.

【0033】なお、本発明の新局勧誘方式は、トークン
パッシング方式のLANに限らず、少なくとも勧誘権を
巡回的に各リンク局に渡すシステムであれば他のアクセ
ス方式のLANにも適用できる。
The new station invitation system of the present invention is not limited to the token passing LAN, but may be applied to other access LANs as long as at least the invitation right is cyclically transferred to each link station.

【0034】[0034]

【発明の効果】本発明によれば、トークンが一巡する間
に勧誘動作を行う局を1局又は2局に制限できるので、
トークン巡回時間を一定時間以内に抑えることができ
る。また、各局に均等に勧誘動作を行う機会を与えるこ
とができる。
According to the present invention, it is possible to limit the number of soliciting stations to one or two while the token makes one round.
The token patrol time can be kept within a certain time. In addition, each station can be given an opportunity to perform a solicitation operation equally.

【図面の簡単な説明】[Brief description of the drawings]

【図1】本発明の原理説明図である。FIG. 1 is a diagram illustrating the principle of the present invention.

【図2】実施例のトークンフレームのフォーマット図で
ある。
FIG. 2 is a format diagram of a token frame according to the embodiment.

【図3】第1実施例の新局勧誘方式の説明図である。FIG. 3 is an explanatory diagram of a new station invitation method according to the first embodiment.

【図4】第2実施例の新局勧誘方式の説明図である。FIG. 4 is an explanatory diagram of a new station invitation system according to a second embodiment.

【図5】従来の新局勧誘方式の説明図である。FIG. 5 is an explanatory diagram of a conventional new station invitation system.

【符号の説明】[Explanation of symbols]

1 判定手段 2 勧誘局指定手段 1 Judgment means 2 Solicitation station designation means

Claims (2)

(57)【特許請求の範囲】(57) [Claims] 【請求項1】LANの論理リングに既に加入している局
が新規に加入しようとする局に対して勧誘動作を行うL
ANにおいて、 自局が論理リングに加入しようとする新局に対して勧誘
動作を行った後、トークンが論理リングを一巡以上した
か否かを判定する判定手段(1)と、 この判定手段(1)でトークンが一巡以上したと判定さ
れたとき、トークンフレームに次勧誘権保持局として後
続局を指定する勧誘権保持局情報を付加して送出する勧
誘局指定手段(2)とを備えることを特徴とするLAN
における新局勧誘方式。
1. A station which has already subscribed to a LAN logical ring performs a solicitation operation for a station to be newly subscribed.
In the AN, a determination unit (1) that determines whether or not the token has made one or more rounds of the logical ring after performing a solicitation operation for a new station that the local station intends to join the logical ring; When it is determined in 1) that the token has completed one or more rounds, there is provided a solicitation station designating means (2) for adding solicitation right holding station information for designating a succeeding station as the next invitation right holding station to the token frame and sending it out. LAN characterized by
New station recruitment method in.
【請求項2】LANの論理リングに既に加入している局
が新規に加入しようとする局に対して勧誘動作を行うL
ANにおいて、 勧誘権を与えられた局が論理リングに加入しようとする
新局に対して勧誘動作を行った後、トークンフレームに
次勧誘権保持局としてトークン送信元である先行局を指
定する勧誘権保持局情報を付加し勧誘権を先行局に渡す
ことを特徴とするLANにおける新局勧誘方式。
2. A station which has already subscribed to a LAN logical ring performs an invitation operation to a station to be newly subscribed.
In the AN, after the station granted the solicitation right performs an invitation operation to a new station that intends to join the logical ring, the solicitation that designates the preceding station that is the token transmission source as the next invitation right holding station in the token frame. A new station solicitation method in a LAN, characterized by adding rights holding station information and passing an invitation right to a preceding station.
JP30024691A 1991-11-15 1991-11-15 New station invitation system in LAN Expired - Lifetime JP2962903B2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP30024691A JP2962903B2 (en) 1991-11-15 1991-11-15 New station invitation system in LAN

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP30024691A JP2962903B2 (en) 1991-11-15 1991-11-15 New station invitation system in LAN

Publications (2)

Publication Number Publication Date
JPH05136799A JPH05136799A (en) 1993-06-01
JP2962903B2 true JP2962903B2 (en) 1999-10-12

Family

ID=17882472

Family Applications (1)

Application Number Title Priority Date Filing Date
JP30024691A Expired - Lifetime JP2962903B2 (en) 1991-11-15 1991-11-15 New station invitation system in LAN

Country Status (1)

Country Link
JP (1) JP2962903B2 (en)

Also Published As

Publication number Publication date
JPH05136799A (en) 1993-06-01

Similar Documents

Publication Publication Date Title
US4661902A (en) Local area network with carrier sense collision avoidance
CA1244959A (en) Local area network with self assigned address method
US5422885A (en) Contention free local area network
US5155725A (en) Adaptive token release mechanism for ring networks
JPH02246444A (en) Data transmission mechanism and system therefor
JPH02228854A (en) Data communication system and data communication method
JP2962903B2 (en) New station invitation system in LAN
US4677613A (en) Network system for connecting multiple I/O devices to computers
JPH0457140B2 (en)
JP3725000B2 (en) Transmission data collision reduction method
JPH03270432A (en) Local area network
JPS61222345A (en) Communication system and method with preference
JPH10135996A (en) Invitation control system for token passing bus type lan
JPH0252541A (en) Data transmission system in lan
JPH01176138A (en) Multi-token ring access system
JP2745464B2 (en) Token passing LAN device
JP3043192B2 (en) Token simultaneous acquisition prevention method
JP4033108B2 (en) CSMA data communication method and broadcast transmission node device and slave node device using the same method
JPH04132433A (en) Communication control system
JPH0311840A (en) Token passing communication system
JPS6130834A (en) Data transmission control system
JPH04168829A (en) Communication control system
JPH04177939A (en) Data transmission system in bus type network
JPH0748743B2 (en) Data transmission method and data transmission system
JPH1146204A (en) Network system for system providing plural tokens

Legal Events

Date Code Title Description
A01 Written decision to grant a patent or to grant a registration (utility model)

Free format text: JAPANESE INTERMEDIATE CODE: A01

Effective date: 19990727

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

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

Free format text: PAYMENT UNTIL: 20070806

Year of fee payment: 8

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

Free format text: PAYMENT UNTIL: 20080806

Year of fee payment: 9

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

Free format text: PAYMENT UNTIL: 20080806

Year of fee payment: 9

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

Free format text: PAYMENT UNTIL: 20090806

Year of fee payment: 10

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

Free format text: PAYMENT UNTIL: 20090806

Year of fee payment: 10

S111 Request for change of ownership or part of ownership

Free format text: JAPANESE INTERMEDIATE CODE: R313113

S531 Written request for registration of change of domicile

Free format text: JAPANESE INTERMEDIATE CODE: R313531

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

Free format text: PAYMENT UNTIL: 20090806

Year of fee payment: 10

R350 Written notification of registration of transfer

Free format text: JAPANESE INTERMEDIATE CODE: R350

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

Free format text: PAYMENT UNTIL: 20090806

Year of fee payment: 10

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

Free format text: PAYMENT UNTIL: 20100806

Year of fee payment: 11

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

Free format text: PAYMENT UNTIL: 20110806

Year of fee payment: 12

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

Free format text: PAYMENT UNTIL: 20110806

Year of fee payment: 12

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

Free format text: PAYMENT UNTIL: 20120806

Year of fee payment: 13

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

Free format text: PAYMENT UNTIL: 20120806

Year of fee payment: 13