Roy F. Brabson - Raleigh NC, US Patrick G. Brown - Hillsborough NC, US Ralph B. Case - Raleigh NC, US Wesley McMillan Devine - Apex NC, US Johnathan Louis Harter - Raleigh NC, US Samuel E. Reynolds - Apex NC, US
Assignee:
International Business Machines Corporation - Armonk NY
International Classification:
G06F 15/16
US Classification:
709249, 709230, 709220
Abstract:
An improved technique is disclosed for routing data across multiple topology subnets, and for improving the connectivity between nodes in multiple topology subnets, by using a common connection network. A new type of virtual node, referred to herein as a “global” virtual routing node or “GVRN”, is defined to represent connectivity to an underlying network that may extend beyond the boundaries of the topology subnets in the end-to-end path. This underlying network is also referred to as a “common connection network” or a “global connection network”. The present invention also defines novel techniques with which border nodes pass routing information between networks to convey connectivity to the GVRN. In many cases, use of GVRNs will result in shorter end-to-end data transmission paths.
Method Of Combining Architecturally Dissimilar Computing Networks Into A Single Logical Network
Joel E. Dinkin - Raleigh NC Johnathan L. Harter - Raleigh NC Julie M. Henderson - Durham NC Dirk K. Kramer - Raleigh NC Michael A. Lerner - Raleigh NC Haldon J. Sandick - Durham NC
Assignee:
International Business Machines Corp. - Armonk NY
International Classification:
H04L 1246 H04L 1266
US Classification:
395200
Abstract:
A method and arrangement is disclosed for extending a resource search across a gateway node connecting a peer-to-peer network with a subarea network. An interface node is divided into a first section associated with the peer network and a second section associated with the subarea network. In response to a resource search request arriving at one of the sections from the network with which the section is associated, a directory of resources known by the respective section 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 other section of the interface node. 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 peer 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 peer network are next searched.
System For Locating A Node Containing A Requested Resource And For Selectively Verifying The Presence Of The Resource At The Node
Owen H. Choi - Raleigh NC John E. Drake - Pittsboro NC James C. Fletcher - Cary NC Johnathan L. Harter - Raleigh NC Jeffrey G. Knauth - Raleigh NC Dirk K. Kramer - Raleigh NC Michael A. Lerner - Raleigh NC Joseph L. McKinnon - Raleigh NC Lee M. Rafalow - Chapel Hill NC Melinda P. Stump - Cary NC
Assignee:
International Business Machines Corp. - Armonk NY
International Classification:
G06F 1314 G06F 1300
US Classification:
395800
Abstract:
The present invention is an improvement in a known LOCATE process used to locate resources in a computer network. The known LOCATE process always requires that information about a target resource be verified by forwarding a LOCATE request to the node owning the target resource. The present invention improves upon this process by use of selective verification. If predetermined conditions are met, a node in the network may reply to a received LOCATE request by using information about the target resource found in its cache directory. The LOCATE request need not be propagated to the node owning the target resource except for predetermined types of sessions or where past attempts to use selective verification have not been successful.