公开(公告)号：EP0603100A2

公开(公告)日：1994-06-22

申请号：EP93480185.3

申请日：1993-11-19

申请人： International Business Machines Corporation

发明人： Derby, Jeffrey Haskell ,  Doeringer, Willibald August ,  Dykeman, Harold Douglas ,  Li, Liang ,  Sandick, Haldon Jules ,  Vu, Ken Van

IPC分类号： H04L12/66 ,  H04L29/06

CPC分类号： H04L12/66 ,  H04L12/4604 ,  H04L45/742

摘要： A system for interconnecting widely separated local area networks (LANs) (11,12) by means of a wide area network (WAN) (10) utilizes network level facilities to establish a connection through the wide area network and to create connection table entries at the WAN access point (13,14) which allow subsequent data frames to be transmitted through the wide area network without such network level operations. More particularly, the various LANs are combined into search groups, represented by address prefixes, to which LAN-initiated connection requests can be broadcast and which can respond so as to establish the data path connections. This system has the connection flexibility of a prior art router and, at the same time, the low overhead of a prior art bridge.

摘要翻译： 通过广域网（WAN）互连广泛分离的局域网（LAN）的系统利用网络级设施通过广域网建立连接，并在WAN接入点创建连接表条目，允许后续数据 在没有这种网络级操作的情况下通过广域网传输的帧。 更具体地，各种LAN被组合成由地址前缀表示的搜索组，LAN发起的连接请求可以被广播并且哪些可以响应以便建立数据路径连接。 该系统具有现有技术的路由器的连接灵活性，同时具有现有技术的桥接器的低开销。

公开(公告)号：EP0603100B1

公开(公告)日：2004-01-21

申请号：EP93480185.3

申请日：1993-11-19

申请人： International Business Machines Corporation

发明人： Derby, Jeffrey Haskell ,  Doeringer, Willibald August ,  Dykeman, Harold Douglas ,  Li, Liang ,  Sandick, Haldon Jules ,  Vu, Ken Van

IPC分类号： H04L12/66 ,  H04L29/06

CPC分类号： H04L12/66 ,  H04L12/4604 ,  H04L45/742

公开(公告)号：EP0458120A3

公开(公告)日：1996-09-04

申请号：EP91107355.9

申请日：1991-05-07

申请人： International Business Machines Corporation

发明人： Dinkin, Joel Evan ,  Harter, Jonathan Louis ,  Henderson, Julie Maybry ,  Kramer, Dirk Klaus ,  Sandick, Haldon Jules ,  Lerner, Michael Arthur

IPC分类号： G06F15/16

CPC分类号： H04L29/00

摘要： A method and arrangement for searching for a resource across two architecturally dissimilar computing networks which are connected by one or more interface nodes. An interface node is divided into a first section associated with a first network and a second section associated with a second network. In response to a resource search request arriving at one of the sections of the interface node from either the first or second network with which the section is associated, a directory of resources known by the respective section of the interface node is first searched. If the resource is not found in the directory of the section, the search request is translated into a format compatible with the other network, and the translated search request is transmitted to the section of the interface node associated with the other network. If the resource is not found among the resources known to the interface node, the resources known by the end nodes served by the interface node in the first network are next searched. If the resource is not found within these end nodes, the resources known by each of the remaining network and end nodes in the first network are next searched. If the resource is still not found, a search of the nodes of the second network is initiated.

公开(公告)号：EP0458120A2

公开(公告)日：1991-11-27

申请号：EP91107355.9

申请日：1991-05-07

申请人： International Business Machines Corporation

发明人： Dinkin, Joel Evan ,  Harter, Jonathan Louis ,  Henderson, Julie Maybry ,  Kramer, Dirk Klaus ,  Sandick, Haldon Jules ,  Lerner, Michael Arthur

IPC分类号： G06F15/16

CPC分类号： H04L29/00

摘要： A method and arrangement for searching for a resource across two architecturally dissimilar computing networks which are connected by one or more interface nodes. An interface node is divided into a first section associated with a first network and a second section associated with a second network. In response to a resource search request arriving at one of the sections of the interface node from either the first or second network with which the section is associated, a directory of resources known by the respective section of the interface node is first searched. If the resource is not found in the directory of the section, the search request is translated into a format compatible with the other network, and the translated search request is transmitted to the section of the interface node associated with the other network. If the resource is not found among the resources known to the interface node, the resources known by the end nodes served by the interface node in the first network are next searched. If the resource is not found within these end nodes, the resources known by each of the remaining network and end nodes in the first network are next searched. If the resource is still not found, a search of the nodes of the second network is initiated.

摘要翻译： 一种用于跨其通过一个或多个接口节点连接的两个不同的体系结构计算网络搜索的资源的方法和装置。 接口节点被划分为与第一网络和与第二网络相关联的第二部分相关联的第一部分。 响应于到达从第一或第二网络与该部分相关联的接口节点的区段中的一个的资源搜索请求，通过所述接口节点的respectivement部分已知资源的目录首先搜索。 如果在该部分的目录中找不到的资源，搜索请求翻译成与其它网络兼容的格式，和翻译的搜索请求是反式mitted与其他网络相关的接口节点的部分。 如果已知接口节点的资源中找不到的资源，通过该接口节点的第一网络中的服务端节点知道资源是未来搜索。 如果没有论文端节点中找到的资源，每个剩余的网络和终端节点的第一网络已知的资源是未来搜索。 如果是安静没有找到资源，搜索第二网络的节点开始。