JPS5933958A - Data transmitting and receiving system of computer network - Google Patents

Data transmitting and receiving system of computer network

Info

Publication number
JPS5933958A
JPS5933958A JP57144014A JP14401482A JPS5933958A JP S5933958 A JPS5933958 A JP S5933958A JP 57144014 A JP57144014 A JP 57144014A JP 14401482 A JP14401482 A JP 14401482A JP S5933958 A JPS5933958 A JP S5933958A
Authority
JP
Japan
Prior art keywords
computer
data
logical communication
communication path
information
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
JP57144014A
Other languages
Japanese (ja)
Other versions
JPH0125464B2 (en
Inventor
Shinji Inosaka
猪阪 伸二
Yukio Atsumi
幸雄 渥美
Yukio Saito
斎藤 幸雄
Sumio Isomae
磯前 澄雄
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.)
Fujitsu Ltd
Hitachi Ltd
NEC Corp
Nippon Telegraph and Telephone Corp
Original Assignee
Fujitsu Ltd
Hitachi Ltd
NEC Corp
Nippon Telegraph and Telephone Corp
Nippon Electric Co Ltd
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 Fujitsu Ltd, Hitachi Ltd, NEC Corp, Nippon Telegraph and Telephone Corp, Nippon Electric Co Ltd filed Critical Fujitsu Ltd
Priority to JP57144014A priority Critical patent/JPS5933958A/en
Publication of JPS5933958A publication Critical patent/JPS5933958A/en
Publication of JPH0125464B2 publication Critical patent/JPH0125464B2/ja
Granted legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F15/00Digital computers in general; Data processing equipment in general
    • G06F15/16Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
    • G06F15/161Computing infrastructure, e.g. computer clusters, blade chassis or hardware partitioning

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Multi Processors (AREA)
  • Computer And Data Communications (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

PURPOSE:To decrease the memory resources needed for preservation of control data, etc., by carrying out the transmission and reception of data among computers of a computer network through a small number of logical communication lines. CONSTITUTION:Communication circuits connect computers A and B, B and C, C and D, B and E, and E and F respectively. Thus a logical communication line can be set to an optional computer of the remote side. The logical communication line for transmission and reception of data is not set for all computers. That is, the logical communication lines are set just between computers A and B, B and C, and C and D in case the data is transmitted or received between host computers A and D. The number of logical communication lines is set less than that of physical communication lines even in case an optional logical communication line is set among all host computers.

Description

【発明の詳細な説明】 fat発明の技術分野 本発明は、B1算機(コンピュータ)ネットワーク、即
ち複数の81i機システム間でバー1:゛ウェア、ソフ
トウェア、データ等の資源を互いに共用できるように、
複数の#In機が通信回線を介して結合されたシステム
に関する。
DETAILED DESCRIPTION OF THE INVENTION Technical Field of the Invention The present invention is directed to a B1 computer network, that is, a system that enables a plurality of 81i machine systems to share resources such as software, software, and data with each other. ,
This relates to a system in which a plurality of #In machines are connected via a communication line.

(bl従来技術とその問題点 複数の剖1/f、機システム間で、資源の共用による軽
石化、資源の分散による信頼性の向上、分散処理による
コス(・性能比の向上、共同処理による処理機能の充実
などの目的で、複数の計算機システムを通信回線で接続
して、情報を授受する81W機ネットワークが知られて
いる。
(bl) Conventional technology and its problems Anatomy of multiple 1/F, machine systems, pumice formation by sharing resources, improvement of reliability by dispersion of resources, cost improvement by distributed processing (Improvement of performance ratio, improvement of cost by joint processing) An 81W machine network is known in which a plurality of computer systems are connected via communication lines to exchange information for the purpose of enhancing processing functions.

81算機ネットワークの形式には星形、網形、ループ形
およびトリー形などがあるが、例えば第1図のようにδ
(W機A−D間に8j算機B、Cが介在し、また計算機
B−F間に計算機Eが介在している計算機ネントワーク
について、従来のデータ授受方式を説明する。なお各計
算機A・・・Fそれぞれの間は、通信路P・・・で物理
的に接続され、計算機へと計算iD、Fなどの間は、中
継計算機B、C1Eを介して接続される。このように多
数のδ1WX機A−Fがある場合、それぞれ任意の相手
計算機間でデータ授受が行なわれるものとすると、例え
ば計算機Aを中心に見た場合、鎖線で示される如く、計
算機A−B間、A−C間、A−0間、A、 −F、間、
A−F間というように、計算機Aから他の総てのδ1′
M、機B・・・Fとの間で論理的な通信路を設定する必
要がある。また別の計算機Bから見た場合も、計算tJ
llBと他の総ての計算機A、C・・・Fとの間で論理
的な通信路が設定される。このように、各計算tJIA
・・・Fはそれぞれ総ての相手計算機に対して対の状態
で、論理的な通信路を設定する必要があり、相手計算機
ごとに異なる独立した論理的通信路が設定される。
81 The format of computer networks includes star, net, loop, and tree shapes. For example, as shown in Figure 1, δ
(The conventional data exchange method will be explained for a computer network in which 8J computers B and C are interposed between W machines A and D, and computer E is interposed between computers B and F. ... F are physically connected by communication path P..., and calculation ID, F, etc. are connected to the computer via relay computers B and C1E. If there are δ1WX machines A-F, and data is exchanged between arbitrary partner computers, for example, when looking at computer A as the center, as shown by the dashed line, data is exchanged between computers A-B, A- Between C, between A and 0, between A and -F,
From computer A to all other δ1', such as between A and F.
It is necessary to set up a logical communication path between M and machines B...F. Also, when viewed from another computer B, the calculation tJ
Logical communication paths are set up between llB and all other computers A, C...F. In this way, each calculation tJIA
. . . It is necessary for F to set logical communication paths in pairs for all partner computers, and a different independent logical communication path is set for each partner computer.

そのため、計算機ネットワーク内のボス1−計算機が増
えるほど論理的通信路の数も増え、各交信主体間で頻繁
に一論理的通信路の設定が行なわれるよフな場合は、論
理的通信路の設定および開放によるオーバヘソ1が発生
する恐れがある。またこのように多数の論理的通信路を
設定した状態で、各通信路」二の属性や1ffJ信規約
などの情報もメモリに記憶してお(必要があるため、メ
モリ資源も増大させなりればならない。
Therefore, as the number of boss 1-computers in a computer network increases, the number of logical communication paths also increases. There is a risk that overflow 1 may occur due to setting and opening. In addition, with such a large number of logical communication paths set, information such as the attributes of each communication path and the 1ffJ communication rules must also be stored in memory (as this is necessary, memory resources will also increase. Must be.

(C1発明の目的 本発明は、従来の計算機ネソ1−ワーク内のデータ授受
方式におけるこのような問題を解消し、論理的通信路の
数が少なく、その結果論理的通信路の設定・開放の動作
が減少し且つ管理データなどの保存のためのメモリ資源
も少なくできるようにすることを目的とする。
(C1 Purpose of the Invention The present invention solves such problems in the conventional data transfer method in a computer network, reduces the number of logical communication paths, and as a result, makes it easier to set up and open logical communication paths. It is an object of the present invention to reduce operations and also to reduce memory resources for storing management data and the like.

(d)発明の構成 この目的を達成するために本発明は、計算機ネノlワー
クにおいて各剖W機間のデータ授受を行なう場合、複数
の論理的通信路を介して交信する方式であって、 計算機ネットワーク内の交信主体は、送信データと共に
、相手計算機を識別する情報を設定して送信を行ない、 送信データを中継する計算機では、相手d1算機を識別
する情報に基づき適切な論理的通信路を選択して送信す
ると共に、受信した通信路上で送信データに付与された
識別詞と、送信する通信1?3上の送信データに付与さ
れる識別詞と、通信路の対応関係を示す情報とをメモリ
に保存しておき、一方送信データに対する応答を中継す
る計算機では、前記の保存情報により、応答を返送すべ
き論理的通信路と識別詞を知り、論理的通信路を経由し
て返送し前記の保存情報を開放する方式を採っている。
(d) Structure of the Invention In order to achieve this object, the present invention provides a method of communicating via a plurality of logical communication channels when exchanging data between each autopsy W machine in a computer work, The communication entity in the computer network sets and transmits information that identifies the other party's computer along with the data to be sent, and the computer that relays the transmitted data establishes an appropriate logical communication channel based on the information that identifies the other party's d1 computer. At the same time, the information indicating the correspondence between the identifier given to the transmitted data on the received communication path, the identifier given to the transmitted data on communications 1 to 3 to be transmitted, and the communication path is selected and transmitted. On the other hand, the computer that relays the response to the transmitted data uses the stored information to know the logical communication path and identifier to which the response should be sent back, and sends the response back via the logical communication path. A method is adopted in which the above-mentioned stored information is released.

(e1発明の実施例 次に本発明による計算機ネットワークにおけるデータ授
受方式の実施例を説明する。第2図は計算機ネットワー
クを示す図、第3図はこの計算機ネットワークにおける
データ授受の動作を示す図である。本発明の場合も第2
図のように、計算機/IB間、B−C間、C−0間、B
−E間、E−F間がそれぞれ通信回線で接続されていて
、任、意の相手計算機に論理的通信路を設定できるよう
になっている。
(e1 Embodiment of the Invention Next, an embodiment of the data transfer method in a computer network according to the present invention will be described. FIG. 2 is a diagram showing a computer network, and FIG. 3 is a diagram showing the operation of data transfer in this computer network. In the case of the present invention, the second
As shown in the diagram, between the computer and IB, between B and C, between C and 0, and between B and B.
-E and E-F are connected by communication lines, respectively, so that a logical communication path can be set up with any other computer.

データ1受受のために、論理的通信路を設定する場合は
1.従来のように総てのホスト計W機間に設定するので
なく、ボスト計算機へと0間でデータ授受する場合であ
れば、論理的通信路は、Aと8間、BとC間、Cと0間
に設定されるだけである。
When setting a logical communication path for receiving and receiving data 1, 1. If data is to be exchanged between 0 and 0 to the boss computer, instead of setting between all the host machines W as in the past, the logical communication paths are between A and 8, between B and C, and between C and B. and 0.

従って複数の論理的通信路が介在することになるが、総
てのボス]・計W機間で任意の論理的通信路を設定する
場合でも、論理的通信路の数が物理的通信路の数より増
えることはない。
Therefore, there will be multiple logical communication paths, but even when setting arbitrary logical communication paths between two machines, the number of logical communication paths will exceed the number of physical communication paths. It never increases beyond the number.

いまポスト計算機へとボスi・計算機り、F間でデータ
を授受する場合について、第3図に基づいて説明する。
Now, the case where data is exchanged between boss I, computer F, and the post computer will be explained based on FIG. 3.

この図のΔ、B、C,D、E、Fはそれぞれ第2図のボ
ッ薯・81′W、捜A、B、C,Dに対応するものとす
る。まずボスI・R1算機A内の交信主体からボスト計
N: tJIt D内の交信主体へデータ送信する場合
は、相手計算機であるDを示ず情報dを設定すると共に
、ボスト計$ 119. Dへのルート中の第1番「J
の中継に1°算機B4:選択指定するために、論理的通
信路Pab上の識別詞5Nabか設定され、送信データ
にイ」加して該1番目の中継酎W機Bに送信される。
It is assumed that Δ, B, C, D, E, and F in this figure correspond to the box 81'W, and the numbers A, B, C, and D in FIG. 2, respectively. First, when transmitting data from the communication entity in Boss I/R1 computer A to the communication entity in Boss total N: tJIt D, information d is set without indicating D, which is the other party's computer, and the total amount is $119. No. 1 on the route to D “J
1 degree computer B4: In order to select and specify the relay, the identifier 5Nab on the logical communication path Pab is set, and the data is added to the transmission data and sent to the first relay machine B. .

このような情報を受信した中継計算機Bでは、送信先計
算機りを識別するための情報(Iに基づいて、次の論理
的通信路を適すノに選択すると共に選択した論理的通信
路Pbc上の識別詞5Nbcか設定され、目的のポスト
計算機りへのルート中の次の中継計算機Cに送信される
。このとき、先の通信路Pab上で送信データにイ」与
された識別詞5Nab、次の中継計算機Cへの通信路P
bclの送信データに何坪される識別詞5Nbc、並び
に受信した論理的通信路Pabと送信する論理的通信路
Pbcとの対応を示す情報が、中継計算機Bでメモリに
記1意保存される。なお論理的通信路上の送信データに
付!ゴされる識別詞5Nab、 5Nbcなどに、論理
的通信路のりI応を示す情報も含ま・ヒることができる
Relay computer B, which has received such information, selects the next logical communication path as appropriate based on the information (I) for identifying the destination computer, and also selects the next logical communication path on the selected logical communication path Pbc. The identifier 5Nbc is set and sent to the next relay computer C on the route to the target post computer.At this time, the identifier 5Nab, which was given to the transmission data on the previous communication path Pab, is communication path P to relay computer C of
The identifier 5Nbc included in the transmission data of bcl and information indicating the correspondence between the received logical communication path Pab and the transmitted logical communication path Pbc are stored in the memory by the relay computer B. In addition, it is attached to the transmitted data on the logical communication path! The identifiers 5Nab, 5Nbc, etc. to be searched can also include information indicating the logical communication path.

2番目の中継計算機Cでも、中れtalW−機Bからの
送信データを受信すると、前記の場合と同様に、送信先
δ1算機りを識別するための情報dに基づき、目的のホ
スト旧算機りへの論理的通信路Pcdを選択して、論理
的通信路Pcd上の識別詞5Ncdと共に送信される。
When the second relay computer C also receives the transmission data from the failed talW-machine B, it uses the information d for identifying the destination δ1 computer to identify the target host's old computer, as in the case above. The logical communication path Pcd to the machine is selected and transmitted together with the identifier 5Ncd on the logical communication path Pcd.

このときも、先の通信路上で送信データに何坪された識
別詞5Nbcと、目的のホスト計W機りへの通信路上の
送信データに付与される識別詞5Ncdと、論理的通信
路PbcとPcdとの対応を示す情報が、中継耐智機C
で記憶保存される。
At this time as well, the identifier 5Nbc added to the transmission data on the previous communication path, the identifier 5Ncd added to the transmission data on the communication path to the target host W machine, and the logical communication path Pbc. Information indicating correspondence with PCD is relay anti-detection device C.
is stored in memory.

目的のホス目1算槻りに受信されると、受信情報に対応
する応答情報が、発信側のホスl−計W機八に返送され
るが、その際は先の送信時とは逆に、ポス1−41算機
D−論理的通信路Pcd−中継計算機C−論理的通信路
Pbc−中継計算RB−論理的通信路Pab−ポスト計
算機へのルートで返送される。
When the target host number 1 is received, response information corresponding to the received information is sent back to the sending host host, but in this case, the response information is , post 1-41 computer D-logical communication path Pcd-relay computer C-logical communication path Pbc-relay calculation RB-logical communication path Pab-return to the post computer.

即ち終端のポス]・計算tJ、11 Dでは、受信時と
同じ論理的通信路Padを選択して応答情報を発信し、
応答情報を中継する各計算機では、先の送信時の保存情
報に基づいて、応答を返送すべき論理的通信路と識別詞
を知り、それに従って返送用の論理的通信路を順次選択
すると共に識別詞を付与して返送するという動作を行な
うことにより、目的のホスト計算機へに返送される。そ
の結果、発信側のポスト旧算機へでは、送信時の識別詞
と同し識別詞の応答を受信することにより、送信データ
が相手ポスト計算機りに受信されたこと力<U([認さ
れる。
In other words, the terminal post] - Calculation tJ, 11 In D, the response information is transmitted by selecting the same logical communication path Pad as at the time of reception,
Each computer that relays the response information knows the logical communication path and identifier to which the response should be sent based on the information saved at the time of the previous transmission, and sequentially selects and identifies the logical communication path for returning the response. By adding a word and sending it back, the message is sent back to the target host computer. As a result, by receiving a response with the same identifier as the identifier at the time of transmission, the sender's old postal computer receives a response indicating that the transmitted data has been received by the other party's postal computer. Ru.

また各中継ll算機では、送信時の保存情報と同じ識別
詞の応答が受信される。
Furthermore, each relay computer receives a response with the same identifier as the stored information at the time of transmission.

このような動作を各交信主体毎に繰り返すことにより、
ポスト計算機へと目的のポスl−計算機りとの間で情報
の授受が行なわれる。またホスト計算tJ3t Aと別
のホスト計算機Fとの間でデータを授受する際は、ボス
ト計算機A−論理的通信路Pab−中継計算機B−論理
的通信路Pbe−中継計算機E−・論理的通信路Pef
−ポスト計算機Fのルートで論理的通信路が選択され、
送信される。目的のボスト計算taFに送信データが受
信されると、各中継計算機における送信時の保存情報に
基づいて、送信ルートと逆のルートで、発・信ホス1〜
δlWtMtΔへ応答データが返送される。
By repeating this operation for each communication entity,
Information is exchanged between the post computer and the target post computer. Also, when sending and receiving data between host computer tJ3t A and another host computer F, the following information is used: Boss computer A - Logical communication path Pab - Relay computer B - Logical communication path Pbe - Relay computer E - Logical communication路Pef
- A logical communication path is selected in the route of post computer F,
Sent. When the transmission data is received by the target boss calculation taF, it is sent to the originating/originating host 1 to
Response data is returned to δlWtMtΔ.

他のボスト計算機例えばDとF間でデータの授受を行な
う場合も同様な動作で、論理的通信路Pcd、  P 
bc、 P be、 P efが選択される。
The same operation is used when data is exchanged between other boss computers, for example, D and F, using logical communication paths Pcd and P.
bc, Pbe, Pef are selected.

このように、次のdl算機に送信した後は、識別詞や回
線の対応情報を記憶保存しておき、データ送信後は回線
は開放されるので、いずれのホスト計算機間でデータ授
受する場合でも、論理的通信路は常に5本以内で足りる
ことになる。
In this way, after data is sent to the next DL computer, the identifier and line correspondence information are memorized and saved, and the line is released after the data is sent, so when data is exchanged between any host computer. However, no more than five logical communication paths are always sufficient.

なお必ずしもデータの送信/受信のたびに論理的通信路
を設定/開放することなく、ネットワークの立ち上げ時
に一括して設定し、ネットワークの終了時に一括して開
放するのが効率的である。
Note that it is more efficient to set the logical communication paths all at once when starting up the network and to release them all at once when the network is terminated, without necessarily setting up/opening the logical communication paths every time data is sent/received.

(f1発明のり]果 以上のように本発明によれば、計算機ネ・ノドワークに
おりる各計算機間のデータ授受を、複数の論理的通信路
を介して行なう方式であって、送信データを中継する割
算機では、相手計算機を識別する情報によって適すJな
論理的通信路を選択して送信すると共に、受信した通信
路上で送信データに付与された識別詞と、送信する通信
路上の送信データにイ]与される識別詞と、通信路の対
応関係を示す情報とがメモリに保存される。一方送信デ
ータに対する応答を中継する計算機では、前記の保存情
報Gこより、応答を返送すべき論理的通信路と識別詞を
知り、論理的通信路を選択して返送が行なわれる。
(f1 invention) As described above, according to the present invention, data is exchanged between computers in a computer network via a plurality of logical communication paths, and the transmitted data is relayed. The dividing machine selects and transmits a suitable logical communication path based on the information that identifies the other computer, and also uses the identifier given to the transmission data on the received communication path and the transmission data on the communication path to be transmitted. The given identifier and information indicating the correspondence relationship between the communication channels are stored in memory.On the other hand, in the computer that relays the response to the transmitted data, the computer that relays the response to the transmitted data uses the stored information G to determine the logic for returning the response. The logical communication path and identifier are known, a logical communication path is selected, and the return is performed.

このように、次の計算機に送信した後は、識別詞や回線
の対応情報を記憶保存しておくので、いずれのポスト計
算機間でデータ授受する場合でも、論理的通信路は、物
理的通信路の数より増えることはなく、第1図に示す従
来の方式では物理的通信路の3倍の15本の論理的通信
路を必要とするのに比べると、非常に少ない論理的通信
路で足りることになる。そのため、従来のように多数の
論理的通信路を設定したり開放したりするためにオーバ
ヘット°が発生したりすることはなく、且つ論理的通信
路数の減少に伴って、通信路を管理するためのメモリ容
量も物理的通信路の数に対応する量で足りると共に、論
理的通信路の設定・開放に伴って必要なメモリ資源も軽
減されり、メモリ資源を他の用途に有効に利用すること
ができる。従って本発明は、δ1算機ネットワーク内の
ボス1−割算機の数が多くなるほど有効である。また本
発明の効果が顕著に現れるのは、送信されるデータ舟が
少ない場合である。即ぢ各中継針′W機などで保存され
る情報量が多くなり、論理的通信路の数を軽減したこと
によるメモリ資源の減少量を越えると、メモリ資源の節
減とはならない。そのため、1つのhj算機ネットワー
クにおいて、第1図に示す従来の方式と本発明の方式を
混在させ、ユーザ間で大量のデータを授受するような場
合は、従来の方式で論理的通信路を設定し、システム側
で管理情報を授受する場合のように少ないデータを扱う
場合に、本発明の方式を利用するのが有効である。
In this way, after sending data to the next computer, the identifier and line correspondence information are memorized and saved, so no matter which post computer sends or receives data, the logical communication path is the same as the physical communication path. The number of logical communication channels does not increase more than the number of physical communication channels, and compared to the conventional method shown in Figure 1, which requires 15 logical communication channels, which is three times the number of physical communication channels. It turns out. Therefore, there is no overhead associated with setting up and opening a large number of logical communication paths as in the past, and as the number of logical communication paths decreases, communication path management becomes easier. The amount of memory required for this purpose is sufficient to correspond to the number of physical communication paths, and the memory resources required for setting and opening logical communication paths are also reduced, allowing effective use of memory resources for other purposes. be able to. Therefore, the present invention is more effective as the number of boss 1-dividers in the δ1 computer network increases. Furthermore, the effects of the present invention are most noticeable when the number of data streams to be transmitted is small. In other words, the amount of information stored in each relay device increases, and if it exceeds the reduction in memory resources due to the reduction in the number of logical communication paths, the reduction in memory resources will not result. Therefore, when the conventional method shown in Fig. 1 and the method of the present invention are mixed in one hj computer network and a large amount of data is exchanged between users, the logical communication path cannot be established using the conventional method. It is effective to use the method of the present invention when handling a small amount of data, such as when setting and sending and receiving management information on the system side.

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

第1図は従来の計W Mltネットワークにおけるデー
タ授受方式を示す図、第2図は本発明にょるδ1算機ネ
ノ1−ワークにお番ノるデータ授受方式を示す図、第3
図は本発明によるデータ授受の動作を示す図である。 図において、Δ〜Fはポスト計W、機、P abs P
Pb!11.、P cd、 P be、 P efは論
理的通信路をそれぞれ示す。 特許出願人      冨士通株式会社同      
  日本電信電話公社 間        日本電気株式会社 同        株式会社日立製作所代理人 弁理士
    青 柳   稔第1頁の続き ■出 願 人 日本電信電話公社 ■出 願 人 日本電気株式会社 東京都港区芝五丁目33番1号 @出 願 人 株式会社日立製作所 東京都千代田区丸の内−丁目5 番1号
FIG. 1 is a diagram showing the data transfer method in the conventional total W Mlt network, FIG. 2 is a diagram showing the data transfer method according to the present invention, and FIG.
The figure is a diagram showing the operation of data exchange according to the present invention. In the figure, Δ~F is post meter W, machine, P abs P
Pb! 11. , P cd, P be, and P ef indicate logical communication paths, respectively. Patent applicant Fujitsu Co., Ltd.
Between Nippon Telegraph and Telephone Public Corporations NEC Corporation Hitachi, Ltd. Representative Patent Attorney Minoru AoyagiContinued from page 1 Applicant Nippon Telegraph and Telephone Public CorporationApplicant NEC Corporation 5-33 Shiba, Minato-ku, Tokyo No. 1 @ Applicant Hitachi, Ltd. No. 1, Marunouchi-5-chome, Chiyoda-ku, Tokyo

Claims (1)

【特許請求の範囲】 計算機ネットワークにおいて各計W、機間のデータ授受
を行なう場合、複数の論理的通信路を介して交信する方
式であって、 計算機ネットワーク内の交信主体は、送信データと共に
、相手計算機を識別する情報を設定して送信を行ない、 送信データを中継する計算機では、相手81算機を識別
する情報に基づき適切な論理的通信路を選択して送信す
ると共に、受信した通信路上で送信データにイ」与され
た識別詞と、送信する通信路上の送信データに付与され
る識別詞と、通信路の対応関係を示す情報とをメモリに
保存しておき、一方送信データに対する応答を中継する
計W−機では、前記の保存情報により、応答を返送すべ
き論理的通信路と識別詞を知り、論理的通信路を経由し
て返送し前記の保存情報を開放することを特徴とする計
算機不)1−ワークにおけるデータ授受方式。
[Scope of Claims] When transmitting and receiving data between W machines in a computer network, the system communicates via a plurality of logical communication paths. A computer that transmits data by setting information that identifies the other party's computer selects an appropriate logical communication channel based on the information that identifies the other party's computer, and also transmits the data on the received communication path. The identifiers assigned to the transmitted data, the identifiers assigned to the transmitted data on the communication route to be transmitted, and information indicating the correspondence between the communication channels are stored in memory, while the response to the transmitted data is stored in memory. The W-machine that relays the response knows the logical communication path and identifier to which the response should be sent back from the stored information, sends the response back via the logical communication path, and releases the stored information. 1- Data transfer method in the work.
JP57144014A 1982-08-20 1982-08-20 Data transmitting and receiving system of computer network Granted JPS5933958A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP57144014A JPS5933958A (en) 1982-08-20 1982-08-20 Data transmitting and receiving system of computer network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP57144014A JPS5933958A (en) 1982-08-20 1982-08-20 Data transmitting and receiving system of computer network

Publications (2)

Publication Number Publication Date
JPS5933958A true JPS5933958A (en) 1984-02-24
JPH0125464B2 JPH0125464B2 (en) 1989-05-17

Family

ID=15352312

Family Applications (1)

Application Number Title Priority Date Filing Date
JP57144014A Granted JPS5933958A (en) 1982-08-20 1982-08-20 Data transmitting and receiving system of computer network

Country Status (1)

Country Link
JP (1) JPS5933958A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6073777A (en) * 1983-09-29 1985-04-25 Omron Tateisi Electronics Co Multiprocessor transfer control system
JPS62286147A (en) * 1986-06-04 1987-12-12 Fujitsu Ltd Multiplex conversation control system for application program in on-line processing system
JPH02156358A (en) * 1988-12-09 1990-06-15 Nitsuko Corp Data distributing method
JPH04213140A (en) * 1990-12-05 1992-08-04 Nec Corp Control system for communication between host computers

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JPS6073777A (en) * 1983-09-29 1985-04-25 Omron Tateisi Electronics Co Multiprocessor transfer control system
JPS62286147A (en) * 1986-06-04 1987-12-12 Fujitsu Ltd Multiplex conversation control system for application program in on-line processing system
JPH0521258B2 (en) * 1986-06-04 1993-03-23 Fujitsu Ltd
JPH02156358A (en) * 1988-12-09 1990-06-15 Nitsuko Corp Data distributing method
JPH04213140A (en) * 1990-12-05 1992-08-04 Nec Corp Control system for communication between host computers

Also Published As

Publication number Publication date
JPH0125464B2 (en) 1989-05-17

Similar Documents

Publication Publication Date Title
JPH10301871A (en) System and method for controlling transmission of relatively large data object in communication system
JPS62502303A (en) Interconnection method of packet communication networks
EP0186320A1 (en) Local area communication network
US5349583A (en) Multi-channel token ring
CA1217263A (en) Method and system for an open communication network
JPS5992654A (en) Electronic document distributing system
JPS5933958A (en) Data transmitting and receiving system of computer network
JPH0239144B2 (en)
JPH0458215B2 (en)
JP2001119436A (en) Communication control system and communication control method
JPS60149239A (en) Communication network system
Cohn A lightweight transfer protocol for the US Navy SAFENET local area network standard
Hertweck et al. X25 based process—process communication
Pach et al. Slot pre-using in IEEE 802.6 metropolitan area networks
KR102161951B1 (en) Method for Control message delivery for automatic route configuration in ring topology network
JPH1155256A (en) Re-connection processing method for multi-point connection
JPS62216449A (en) Routing system
JP3771519B2 (en) Packet transfer method and apparatus, packet transfer program, and recording medium recording packet transfer program
JPS589978B2 (en) Computer network configuration method
JPH0621925A (en) Communication control system for multiplex transmission line
JP3182029B2 (en) Multipoint video transfer device
JPH0362255A (en) Data transmission system
JPS61163766A (en) Service receiving system
JPH03121641A (en) Multiple address communication system for electronic exchange system
Cole et al. Simple Message-based Techniques