GB2251358A - Data processing network - Google Patents
Data processing network Download PDFInfo
- Publication number
- GB2251358A GB2251358A GB9123691A GB9123691A GB2251358A GB 2251358 A GB2251358 A GB 2251358A GB 9123691 A GB9123691 A GB 9123691A GB 9123691 A GB9123691 A GB 9123691A GB 2251358 A GB2251358 A GB 2251358A
- Authority
- GB
- United Kingdom
- Prior art keywords
- connection
- network
- node
- data processing
- route
- 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
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/06—Protocols specially adapted for file transfer, e.g. file transfer protocol [FTP]
Abstract
A data processing network consists of a number of data processing nodes 20, i.e. computers, with an interconnection network consisting of dedicated connections and switched connections eg dial-up lines. Each node includes a connection manager 24 which, when requested, selects and sets up connections over the network, performing the necessary dial-up operations in respect of switched connections. The provision of a connection manager removes the need for programs that require to transfer messages to other nodes to know whether the connections to those nodes are dedicated or switched. The connection manager also terminates the connection when requested. <IMAGE>
Description
DATA PROCESSING NETWORK
Background to the Invention
This invention relates to data processing networks. A data processing network generally comprises a number of data processors (referred to herein as processing nodes), connected together by a communication network which allows the nodes to send messages to each other. The network may consist of dedicated connections (eg leased lines) or switched connections (eg dial-up lines), or a combination of these.
In known systems of this kind, before a program in one node can send a message to a program in a remote node, it must know whether the connection to the remote node is a dedicated or switched connection, so that it can take the necessary action eg to perform a dial-up operation. The need to build this knowledge into each program presents a problem, in that it reduces the portability of programs between different computer types.
The object of the invention is to overcome this problem.
Summary of the invention
According to the invention there is provided a data processing network comprising a plurality of processing nodes and an interconnection network interconnecting the nodes, wherein each node includes a connection manager which, in response to a connection request specifying a particular destination node, selects and sets up a connection over the network to that destination node, and then returns a confirmation message, and which, in response to a completion message specifying a particular node, terminates the connection to that node.
It will be seen that the provision of the connection manager removes the need for programs that require to transfer messages to other nodes to know whether the connections to those nodes are dedicated or switched.
Brief description of the drawings
Figure 1 is a block diagram of a data
processing network embodying the invention.
Figure 2 is a block diagram of one of the nodes
within the network.
Figures 3 and 4 flow charts showing the
operation of a connection manager within one of
the nodes.
Description of an embodiment of the invention
One data processing network in accordance with the invention will now be described by way of example with reference to the accompanying drawings.
Referring to Figure 1, the data processing network comprises a plurality of processing nodes 10 interconnected by a connection network 12. In this example, the connection network 12 comprises a mixture of dedicated connections and switched connections. The dedicated connections comprise, in this example, a local area network (LAN) using the standard X.25 protocol. The switched connections are dial-up lines.
Referring to Figure 2, this shows one of the processing nodes 10 in more detail.
The node comprises a computer 20 which, in this example, is DRS 6000, manufactured by International
Computers Limited, running under the DRS/NX operating system.
The computer 20 contains a number of software modules, including: a file transfer manager 21, file transfer service programs 22, protocol programs 23, and a connection manager 24. The connection manager 24 has access to a connection management database 25. The connection management database is initially set up by the system user, by way of an operator interface 26, and holds information about other nodes in the system, and routes to those nodes, as will be described.
Each node also includes a number of link devices 27, for physically connecting the computer 20 to the network 12. The link devices comprise one or more
LAN interface circuits, for connection to the LAN lines, and one or more modems, for connection to the dial-up lines.
When the file transfer manager 21 requires to transfer a file to a remote node, it first passes a "connection request" message to the connection manager 24. This message specifies the identity of the desired destination node. Figure 3 shows the operation of the connection manager in response to this message.
First, the connection manager searches the database 25 to find a route to the desired destination node. The route may be one of the LAN lines or one of the dial-up lines, Where there is more than one possible route, one of these routes is selected. For example, the cheapest route may be selected, taking into account variations in charges according to the time of day. The connection manager also checks the availability of the selected route. A route may not be available, for example, because it is out of service or because it is currently fully loaded. If the connection manager cannot find an available route, it returns a report message to the file transfer manager 21.
Assuming that an available route has been selected, the connection manager now selects one of the file transfer service programs 22 to support the connection. The connection manager also consults the database 25 to check whether the same service program is also available at the remote destination node. In other words, the connection manager ensures that the same service program is available at both ends of the connection. If a suitable service program is not available, the connection manager returns a report message to the file transfer manager 21.
The connection manager then selects one of the link devices27, and a corresponding protocol 23, to support this file transfer service. If a suitable link device is not available, the connection manager returns a report message to the file transfer manager 21.
If the selected route is a switched line, the connection manager now performs the necessary dial-up operation to establish the connection to the remote node.
Finally, the connection manager returns G "connection ready" message to the file transfer manager 21. The file transfer manager can then go ahead with performing the desired file transfer, using the selected service 22, protocol 23 and link 27.
When the file transfer is complete, the file transfer manager 21 passes a "disconnect" message to the connection manager 24. Figure 4 shows the operation of the connection manager in response to this message.
First, the connection manager waits for a predetermined time-out period.
Then, when the time-out period expires, the connection manager check whether any other connections have been set up using the same route. If not, then the connection is terminated, and a confirmation message is returned to the file transfer manager.
It should be noted that the file transfer manager 21 does not need to know whether any particular connection is by way of a dedicated line or a switched line; as far as the file transfer manager is concerned, all connections look like dedicated lines.
Claims (5)
1. A data processing network comprising a plurality of processing nodes and an interconnection network interconnecting the nodes, wherein each node includes a connection manager which, in response to a connection request specifying a particular destination node, selects and sets up a connection over the network to that destination node, and then returns a confirmation message specifying a particular node, terminates the connection to that node.
2. A network according to claim 1, wherein in response to the connection request, the connection manager selects a route to the destination node and, if that route is a switched connection, performs a dial-up operation to establish the connection over that route.
3. A network according to claim 1 or 2 wherein each node includes a plurality of file transfer services and wherein, in response to the connection requests, the connection manager checks whether the same file transfer service is available at both ends of the connection.
4. A data processing network substantially as hereinbefore described with reference to the accompanying drawings.
5. A data processing node for use in a network in accordance with any preceding claim.
5. A data processing node for use in a network in accordance with any preceding claim.
Amendments to the claims have been filed as follows 1. A data processing network comprising a plurality of processing nodes and an interconnection network interconnecting the nodes, wherein each node includes a connection manager which, in response to a connection request specifying a particular destination node, selects and sets up a connection over the network to that destination node, and then returns a confirmation message, and which, in response to a completion message specifying a particular node, terminates the connection to that node.
2. A network according to claim 1, wherein in response to the connection request, the connection manager selects a route to the destination node and, if that route is a switched connection, performs a dial-up operation to establish the connection over that route.
3. A network according to claim 1 or 2 wherein each node includes a plurality of file transfer services and wherein, in response to the connection requests, the connection manager checks whether the same file transfer service is available at both ends of the connection.
4. A data processing network substantially as hereinbefore described with reference to the accompanying drawings.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
GB909027186A GB9027186D0 (en) | 1990-12-14 | 1990-12-14 | Data processing network |
Publications (3)
Publication Number | Publication Date |
---|---|
GB9123691D0 GB9123691D0 (en) | 1992-01-02 |
GB2251358A true GB2251358A (en) | 1992-07-01 |
GB2251358B GB2251358B (en) | 1994-11-23 |
Family
ID=10687027
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB909027186A Pending GB9027186D0 (en) | 1990-12-14 | 1990-12-14 | Data processing network |
GB9123691A Expired - Fee Related GB2251358B (en) | 1990-12-14 | 1991-11-07 | Data processing network |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
GB909027186A Pending GB9027186D0 (en) | 1990-12-14 | 1990-12-14 | Data processing network |
Country Status (3)
Country | Link |
---|---|
AU (1) | AU642563B2 (en) |
GB (2) | GB9027186D0 (en) |
ZA (1) | ZA918848B (en) |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2284962A (en) * | 1993-12-15 | 1995-06-21 | Fujitsu Ltd | Network system |
FR2718264A1 (en) * | 1994-04-01 | 1995-10-06 | Fujitsu Ltd | Network service delivery system, game machine usable in this system and communication unit for this machine. |
GB2289186A (en) * | 1994-04-05 | 1995-11-08 | Ibm | Collaborative working method and system |
WO1998000951A2 (en) * | 1996-07-02 | 1998-01-08 | More Magic Software Mms Oy | Method and arrangement for distributing service programs in a network environment |
GB2329091A (en) * | 1997-09-08 | 1999-03-10 | Ericsson Telefon Ab L M | Telecommunications networks |
GB2348567A (en) * | 1999-03-31 | 2000-10-04 | Geoffrey Hugh Roper | Data transfer management |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0224229A2 (en) * | 1985-11-27 | 1987-06-03 | AT&T Corp. | Alternate routing arrangement |
Family Cites Families (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4742511A (en) * | 1985-06-13 | 1988-05-03 | Texas Instruments Incorporated | Method and apparatus for routing packets in a multinode computer interconnect network |
US4811214A (en) * | 1986-11-14 | 1989-03-07 | Princeton University | Multinode reconfigurable pipeline computer |
-
1990
- 1990-12-14 GB GB909027186A patent/GB9027186D0/en active Pending
-
1991
- 1991-11-07 ZA ZA918848A patent/ZA918848B/en unknown
- 1991-11-07 GB GB9123691A patent/GB2251358B/en not_active Expired - Fee Related
- 1991-12-13 AU AU89764/91A patent/AU642563B2/en not_active Ceased
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP0224229A2 (en) * | 1985-11-27 | 1987-06-03 | AT&T Corp. | Alternate routing arrangement |
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
GB2284962A (en) * | 1993-12-15 | 1995-06-21 | Fujitsu Ltd | Network system |
GB2284962B (en) * | 1993-12-15 | 1998-05-20 | Fujitsu Ltd | Network system |
US5764914A (en) * | 1993-12-15 | 1998-06-09 | Fujitsu Limited | Network system for connecting to a network node from terminal |
FR2718264A1 (en) * | 1994-04-01 | 1995-10-06 | Fujitsu Ltd | Network service delivery system, game machine usable in this system and communication unit for this machine. |
GB2289186A (en) * | 1994-04-05 | 1995-11-08 | Ibm | Collaborative working method and system |
WO1998000951A2 (en) * | 1996-07-02 | 1998-01-08 | More Magic Software Mms Oy | Method and arrangement for distributing service programs in a network environment |
WO1998000951A3 (en) * | 1996-07-02 | 1998-03-19 | More Magic Software Mms Oy | Method and arrangement for distributing service programs in a network environment |
US6578075B1 (en) | 1996-07-02 | 2003-06-10 | More Magic Holdings, Inc. | Methods and arrangements for distributing services and/or programs in a network environment |
GB2329091A (en) * | 1997-09-08 | 1999-03-10 | Ericsson Telefon Ab L M | Telecommunications networks |
GB2348567A (en) * | 1999-03-31 | 2000-10-04 | Geoffrey Hugh Roper | Data transfer management |
GB2348567B (en) * | 1999-03-31 | 2002-08-21 | Geoffrey Hugh Roper | A data transfer management system and method for a telecommunications network |
Also Published As
Publication number | Publication date |
---|---|
GB2251358B (en) | 1994-11-23 |
AU8976491A (en) | 1992-06-18 |
GB9123691D0 (en) | 1992-01-02 |
AU642563B2 (en) | 1993-10-21 |
ZA918848B (en) | 1992-08-26 |
GB9027186D0 (en) | 1991-02-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US5991828A (en) | System for automatically connecting portable device to network using network environment information including domain name of naming device and community name of network management protocol | |
US5802042A (en) | Autosensing LMI protocols in frame relay networks | |
Wecker | DNA: the digital network architecture | |
SK385291A3 (en) | Cross point switch with divided control | |
CA1319442C (en) | Applications processor for a craft access system | |
CZ250296A3 (en) | System for controlling applications of a network computer | |
RU96118130A (en) | PROTECTION SYSTEM FOR RELATED COMPUTER NETWORKS | |
JPH04326226A (en) | System for connecting isdn and lan | |
US6434120B1 (en) | Autosensing LMI protocols in frame relay networks | |
CN100512168C (en) | Apparatus for connecting wireless network with at least one other network | |
AU642563B2 (en) | Data processing network | |
Cisco | Protocol Translation | |
Cisco | Protocol Translation | |
JP4303791B2 (en) | Telecommunications switching system with easily configurable supervisory control | |
Sundstrom et al. | SNA: Current requirements and direction | |
JP2503142B2 (en) | Method and apparatus for automatic determination of software module capability | |
US6760427B2 (en) | Computer telephony (CT) network serving multiple telephone switches | |
JPS6282762A (en) | Multiple address communication system | |
KR100236946B1 (en) | Call and service processing method of members of isdn junction subsystem | |
JPS63138834A (en) | Call setting system | |
KR930006358B1 (en) | Method for controlling a particular route using a rerouting function | |
KR100238449B1 (en) | Nms implementation method using ilmi in atm-lan system | |
Pozefsky et al. | SNA's Design for Networking | |
Schwartz | TYMNET-A tutorial survey of a computer communications network | |
Valev | On the representation of training tables in a k-valued code and the construction of empirical regularities |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PCNP | Patent ceased through non-payment of renewal fee |
Effective date: 20061107 |