Establishing a virtual tunnel between two computers

Information

  • Patent Grant
  • 10069939
  • Patent Number
    10,069,939
  • Date Filed
    Friday, April 3, 2015
    9 years ago
  • Date Issued
    Tuesday, September 4, 2018
    6 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Nguyen; Minh Chau
    Agents
    • Choate, Hall & Stewart LLP
Abstract
A system transfers data via a communication session between a client application and a server application, where the client application runs on a first network and the server application runs on a second network. The system includes a proxy having a socket to the client application. The proxy converts data between a local protocol run on the first network to a non-local protocol. An agent creates a socket to the server application. The agent converts data between a local protocol run on the second network and the non-local protocol. A server is in communication with the proxy and the agent. The server contains a message queue dedicated to the communication session. The message queue stores data transmitted during the communication session.
Description
BACKGROUND

Many products, both hardware and software, have diagnostic tools or applications for communicating with them. When such products are located at customer sites, there is no way to use these tools except to send a service technician on-site to diagnose and repair any problems.


Tunneling solutions exist that provide a diagnostic program with access to a remote application. However, such tunneling solutions require a server at each site to provide access to applications behind its firewall. Since the additional server requires additional administration and maintenance at each site, it is an additional burden to end-users or customers.


Furthermore, and perhaps more significantly, installing a server at each site that provides tunnel access to a local network also has security risks. For example, such a server is addressable via the Internet, and thus is a target to break into an otherwise secure network.


SUMMARY

In general, in one aspect, the invention is directed to a method of transferring data via a communication session between a client application and a server application. The method includes assigning an identifier to the communication session, creating at least one queue associated with the communication session, and using the identifier to store data passed between the client application and the server application in the at least one queue. The client application and the server application run local protocols, and the data is passed between the client application and the server application via an intermediary protocol. The intermediary protocol may be different from the local protocols or it may be the same protocol as the local protocols. This aspect may include one or more of the following.


A socket interface may be created to at least one of the client application and the server application. The data may be transmitted through the socket interface. The client application and the server application may be on networks that run the local protocols, and the method may include converting between the local protocols and the intermediary protocol when passing the data.


The local protocol may be TCP/IP or a serial protocol, such as RS232 and RS485. The intermediary protocol may be HTTP. The method may be performed by a server, and may also include performing load balancing to select the server from among plural servers. The identifier may be associated with the at least one queue, and may be invalidated when the communication session terminates.


The communication session may be a telnet session or may be effected via a Web site. A session record may be maintained, which includes an identity of a user initiating the session along with other information.


The method may be implemented via machine-executable instructions stored on a readable medium/media. The method may be implemented via one or more processors on one or more machines executing such instructions.


In general, in another aspect, the invention is directed to a system for transferring data via a communication session between a client application and a server application, where the client application runs on a first network and the server application runs on a second network. The system includes a proxy having a socket to the client application. The proxy converts data between a local protocol run on the first network to a non-local protocol. An agent creates a socket to the server application. The agent converts data between a local protocol run on the second network and the non-local protocol. A server is in communication with the proxy and the agent. The server contains a message queue dedicated to the communication session. The message queue stores data transmitted during the communication session. This aspect may include one or more of the following features.


The proxy may poll the server for data for the client application. When data is present for the client application, the proxy may retrieve the data from the message queue and pass the data to the client application. The agent may poll the server for data for the server application. When data is present for the client application, the agent may retrieve the data from the message queue and pass the data to the server application.


Other features and advantages of the invention will become apparent from the following description, including the claims and drawings.





DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram illustrating the concept of a virtual tunnel between two computer programs.



FIG. 2 is a block diagram of a network containing computer programs (client application and server application) that communicate via a virtual tunnel.



FIG. 3 is a flowchart showing a process for creating a virtual tunnel.





DESCRIPTION

The system described herein creates a virtual communication link (called a “virtual tunnel”) between two computer programs (e.g., client and server applications) that are not able to address each other directly. This situation may occur when a client application needs to connect to a server application at a remote site. The server application may be on a computer on a customer or partner's non-addressable local network (e.g., behind a firewall). As such, the client application will not be able to address the server application directly.


A virtual tunnel may be used to provide the client application access to the server application. FIG. 1 illustrates the concept of a virtual tunnel 8 between client application 10 and server application 11. Virtual tunnel 8 enables client application 10 and server application 11 to communicate as if there were no firewalls between them (which, typically, there are).



FIG. 2 shows a client local network 14. Client local network 14 includes a device 15, such as a computer, that contains a processor 16, a memory 17, and a storage medium 19 for storing, among other things, an operating system (OS) 20, a Web browser 21, software 22 for effecting network communications, and one or more executable applications (e.g., computer programs). Among these applications is client application 24. Client application 24 is a computer program for communicating with and diagnosing local or remote hardware and/or software.


A router (or modem) 25 couples client local network 14 to an external network 26, such as the Internet/World Wide Web (Web). External network 26 may run Internet Protocol (IP), HyperText Transfer Protocol (HTTP) and other suitable protocols. Network connections may be via Ethernet, telephone line, wireless, or other transmission media.


A firewall 27 is maintained between client local network 14 and external network 26. Firewall 27 may be implemented via software run on the closest “intelligent” device to external network 26, e.g., router 25 or device 15. The firewall prevents others from directly addressing devices on client local network 14 via external network 26. As a result of the firewall, only users on client local network 14 (or some defined subset thereof) are permitted to address device 15 directly.


Client local network 14 may run a local protocol, such as Transmission Control Protocol/Internet Protocol (TCP/IP), which may be the same as, or different than, the protocols that run on external network 26. Examples of other protocols that may be run on client local network 14 include, but are not limited to, serial protocols, such as RS232 and RS485, and proprietary protocols.


Client local network 14 also includes proxy 29, which is used to effect communication between client application 24 and a remote server application. Proxy 29 may be a computer program executing on device 15 or another processing device, such as a router 25, in client local network 14. In addition to the functions described below, proxy 29 performs any conversions necessary between the protocols running on external network 26 and those running on client local network 14.



FIG. 2 also shows a server local network 30. Server local network 30 is depicted as being similar to client local network 14 for the sake of illustration. In reality, however, the two local networks may be very different.


Server local network 30 includes a device 31, such as a server, that contains a processor 32, a memory 34, and a storage medium 35 for storing, among other things, an operating system (OS) 36, software 37 for effecting network communications, and one or more executable applications (e.g., computer programs). Among these applications is server application 39. Server application 39 is a computer program that may, among other things, provide information to users via external network 26 or via local network 30. Examples of such information include, but are not limited to, Web pages and diagnostics or operational control information pertaining to the device.


A router (or modem) 40 couples server local network 30 to external network 26. As above, network connections may be via Ethernet, telephone line, wireless, or other transmission media. A firewall 41 is also maintained between server local network 30 and external network 26. Firewall 41 may be implemented via software run on the closest “intelligent” device to external network 26, e.g., router 40 or device 31. The firewall prevents others from directly addressing device 31 via external network 26. As above, only users on server local network 30 (or some subset thereof) are permitted to address device 31 directly.


Server local network 30 may run a local protocol that may be the same as, or different than, protocols that run on external network 26 and/or client local network 14. Examples of such protocols include, but are not limited to, TCP/IP, serial protocols, such as RS232 and RS485, and proprietary protocols.


Server local network 30 also includes agent 42, which is used to effect communication between client application 24 and server application 39. Agent 42 may be a computer program executing on device 31 or another processing device, such as a router 40, in server local network 30. In addition to the functions described below, agent 42 performs any conversions necessary between the protocols running on external network 26 and those running on server local network 30.


Agent 42 has a local configuration of interfaces. Each interface has a name, IP (Internet Protocol) address, or other information relevant to the local protocol, such as baud rate. Local configuration of the interfaces allows a local operator to control access to applications on server local network.


Proxy 29 and agent 42 perform essentially the same functions (described below) which allow client application 24 and server application 39 to communicate via a virtual tunnel. Proxy 29 and agent 42 may be pre-programmed into devices on respective local networks 14 and 30. Alternatively, one or both of proxy 29 and agent 42 may be downloaded, e.g., from external network 26. For example, in one embodiment, proxy 29 is an applet that is downloaded from a server 44 on external network 26 and that is installed on device 15. The applet may be included in a Web page that is provided by server 44, and that is accessed by a user when establishing a virtual tunnel between client application 24 and server application 39. This process is described in more detail below.


External network 26 contains server 44, which is a computer or any other processing device. Other devices (not shown) are also located on external network 26. For example, external network 26 may contain routers, switches, and the like (not shown), which receive data packets and which forward the data packets along paths to their intended destinations. Other servers, personal computers, mainframes, and processing devices (not shown) may also be on, and/or have access to, external network 26.


Server 44 acts as an intermediary for communications between client application 24 and server application 39 in the manner described below. Server 44 runs HTTP (Hypertext Transfer Protocol) and is “visible” to other devices, such as device 15, via external network 26.


In more detail, server 44 is used in passing data between client application 24 and server application 39 because these applications cannot address each other directly. That is, since both applications are on local networks, they do not have universally-recognized network addresses. As such, the client and server applications cannot address one another without the aid of server 44.


Server 44 includes a controller, such as a microprocessor, for executing software (machine-executable instructions) stored in a memory to perform the functions described below. To avoid confusion in terminology, the following reads as though those functions are performed by server 44, even though software in server 44, namely virtual tunneling application 45, performs the functions.


In this embodiment, server 44 contains a processor 46, a memory 47, and a storage medium 49 for storing, among other things, an operating system (OS) 50, software 51 for effecting network communication, and one or more applications. Processor 46 may execute software, including the applications, out of memory 47. Among these applications is tunneling application 45.


Tunneling application 45 creates a virtual tunnel between client application 24 on client local network 14 and server application 39 on server local network 30. Tunneling application 45 includes process 54 (FIG. 3) to establish the virtual tunnel, as described below. The virtual tunnel allows client application 24 and server application 39 to communicate even though they are both behind firewalls and cannot directly address each other.


The virtual tunnel is also advantageous because it preserves the protocols running on local networks 14 and 30. That is, data is transferred through the virtual tunnel via an intermediary protocol, such as HTTP, that is run on external network 26. The protocols running on local networks 14 and 30 are essentially transmitted via the protocol of external network. When data reaches its destination, e.g., at local network 14 or 30, the local protocol is thus recovered by either proxy 29 or agent 42, thereby enabling the same protocol to be used at both the source and destination local networks. Proxy 29 and agent 42 are both capable of converting between a local protocol and the intermediary protocol. In this regard, it is noted that the intermediary protocol may be the same as, or different from, the local protocols.



FIG. 3 shows process 54 that is performed by proxy 29, server 44, and agent 42 to set-up a virtual tunnel for a communication session between client application 24 and server application 39. The section of FIG. 3 labeled “Agent” corresponds to functions performed by agent 42; the section of FIG. 3 labeled “Proxy” corresponds to functions performed by proxy 29; and the section of FIG. 3 labeled “Server” corresponds to functions performed by tunneling application 45 (on server 44).


Referring to FIG. 3, agent 42 sends (60), to server 44, interface information, including, but not limited to, interface names and port numbers of agent 42 associated with server application 39. The interface information may be sent, e.g., in response to installing agent 42 on local network 30. Server 44 receives (61) the interface information and stores the interface information in a database (not shown). The database is associated with agent 42.


Information in the database may be made accessible to a user, e.g., at device 15 via a Web browser. The information may be made accessible via a Web page (not shown) provided by server 44. The Web page may contain a list of devices on local network 30 that may be accessed via virtual tunneling. The identities of the devices, which may be provided to server 44 along with the interface information, are associated with software interfaces to such devices. When a user selects a device to connect to, the user is, in effect, selecting an interface of agent 42.


A user who wants to connect to a device on local network from client application 24 logs into server 44 via a Web page (not shown). The user then selects a device (and, thus, an interface) to begin a communication session with that device. Server 44 receives (62) the input from the Web page. As noted above, the Web page may contain an applet that comprises proxy 29. In this case, when the user selects a device and enters the selection, the applet may be installed on device 15 as proxy 29.


Server 44 may control access to agents and interfaces through a predefined security (access) policy. For example, server 44 may allow some users, but not others, access to devices on local network 30. Likewise, users may be restricted as to which devices they may access. Server 44 may control access based on user IDs (identifiers) and/or passwords assigned to system users. For example, server 44 may maintain a database of user IDs and/or passwords corresponding to devices that are accessible via those user IDs and/or passwords. If a user attempts to establish a communication session with a device for which he has not been permitted access, server 44 may provide that user with an error message or the like.


Assuming that the user has access to the requested device, in process 54, server 44 creates (63) a session object for the current communication session. The session object contains message queues. The message queues are used to store data that is passed between client application 24 and server application 39.


In this embodiment, the session object contains two message queues (other embodiments may contain more, or less, message queues). One message queue is for data going from client application 24 to server application 39 and the other message queue is for data going from server application 39 to client application 24.


The session object also has an associated session identifier, referred to as a “sessionID” string. The sessionID string may be a unique alphanumeric identifier that identifies communications associated with a particular communication session. As described below, all data transfers associated with a communication session between client application 24 and server application 39 pass through server 44. The sessionID string is used by server 44 (in particular, by tunneling application 45) to store the data in the appropriate message queues(s).


In process 54, server 44 sends (64) the sessionID string and selected interface name to agent 42. Agent 42 receives (65) this message and creates (66) a socket using the port and IP address that correspond to the selected interface name. Agent 42 connects (67) the socket to server application 39. If connection fails, agent 42 reports an error to server 44. It is noted that sockets are used in this embodiment because they are a well-known way of communicating. Other means of communication may be used, including proxies, pipes, serial communications, etc.


In process 54, server 44 also sends (64) the sessionID string and port or other protocol parameters to proxy 29. Proxy 29 receives (68) this message and creates (69) a socket using the port that corresponds to client application 24. Proxy 29 then provides (70) an “accept” instruction on that socket. The accept instruction enables proxy 29 to accept data from client application 24.


Both proxy 29 and agent 42 execute a software thread to poll (71, 72) for data on their respective sockets, and also to poll for data from server 44. When data from client application 24 is received on a socket of proxy 29, proxy 29 appends the appropriate sessionID string to the data and passes the data to server 44. The sessionID string enables server 44 to identify the data as belonging to a particular communication session, and to store the data in the appropriate message queue. Agent 42 polls for data from server 44, meaning that it searches for data from server 44 that is stored in message queues for agent 42. If there is data present, agent 42 retrieves the data, identifies the communication session using the sessionID string associated with the data, and passes the data to server application 39 via the established socket.


The converse occurs for data passed from server application 39 to client application 24. More specifically, data from server application 24 is received on a socket of agent 42. Agent 42 appends the sessionID string for the current communication session to the data and passes the data to server 44. Proxy 29 polls for data from server 44. If there is data present in an appropriate message queue, proxy 29 retrieves the data, identifies the communication session using the sessionID string, and passes the data to client application 24.


On each socket, a select or “recv” (receive) instruction (command) determines if there is data to read. When data is read from a socket, the data may be sent to server 44 (by proxy 29 or agent 42) as the body of an HTTP POST command. Data in server 44 may be polled (by proxy 29 or agent 42) using an HTTP GET command. If there is data in server 44, the data is passed in a reply to the GET command. This data is then written to the appropriate socket. When an HTTP command is sent, its URL parameters include a “session=SSS” parameter, where “SSS” is the sessionID for a communication session.


As noted above, server 44 has a session object that contains two message queues. Data sent from proxy 29 is stored in one message queue and delivered when agent 42 issues a GET command. The other message queue contains data being passed from agent 42 to proxy 29.


Proxy 29 and agent 42 may encrypt communications sent to server 44. Examples of encryption that may be used include Secure Sockets Layer (SSL) and Hyper Text Transfer Protocol Secure sockets (HTTPS). The recipient (e.g., proxy 29 or agent 42) should have sufficient capabilities to perform any necessary decryption.


In this embodiment, there are two ways to end a communication session (i.e., terminate a virtual tunnel). The session may end when either client application 24 or server application 39 closes its socket. However, some applications open and close sockets during the normal course of communications. For applications such as these, the user may terminate the session manually when the applications are finished running. The user may choose a termination scenario when creating the session.


Server 44 may maintain an audit log (i.e., record) of communication sessions. The audit log may identify the user, time, duration, agent, interface, and number of bytes transferred in a communication session. The actual data may be stored as human-readable text or in another format. Audit logs are particularly advantageous in diagnostic and repair scenarios, where it is often necessary to identify device modifications and repairs after the fact.


Server 44 may be associated with multiple servers, one or more of which may act as a load balancing server to distribute communications amongst other servers. In this case, when a session object is created, the session object may be created on a server that has the most (or greater than a predetermined amount of) resources available and/or a server that is located closest to (or within a predetermined location of) agent 42. In this case, the Uniform Resource Locator (URL) of the server that is being used to effect communication is sent to agent 42 and proxy 29, along with the sessionID. In all subsequent communications, proxy 29 and agent 42 include the URL of the server. This ensures that a single server handles a single communication session.


The virtual tunnel system described herein is not limited to use with the hardware/software configuration of FIGS. 2 and 3; it may find applicability in any computing or processing environment. The functionality of the virtual tunnel system, including, but not limited to, the functions performed by proxy 29, server 44, and agent 42, may be implemented in hardware (e.g., an ASIC {Application-Specific Integrated Circuit} and/or an FPGA {Field Programmable Gate Array}), software, or a combination of hardware and software.


The virtual tunnel system may find applicability in any computing or processing environment and with any type of machine that is capable of running machine-readable instructions, such as one or more computer programs.


The virtual tunnel system can be implemented in digital electronic circuitry, or in computer hardware, firmware, software, or in combinations of them. The virtual tunnel system can be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, e.g., in a machine-readable medium or in a propagated signal, for execution by, or to control the operation of, data processing apparatus, e.g., a programmable processor, a computer, or multiple computers. A computer program can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.


Method steps implemented to effect virtual tunneling can be performed by one or more programmable processors executing one or more computer programs to perform functions described herein by operating on input data and generating output. Method steps can also be performed by, and the virtual tunnel system can be implemented as, special purpose logic circuitry.


Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. Elements of a computer include a processor for executing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from, or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto-optical disks, or optical disks. Information carriers suitable for embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks. The processor and the memory can be supplemented by, or incorporated in special purpose logic circuitry.


The virtual tunnel system can be implemented in a computing system that includes a back-end component, e.g., as a data server, or that includes a middleware component, e.g., an application server, or that includes a front-end component, e.g., a client computer having a graphical user interface or a Web browser through which a user can interact with the virtual tunneling system, or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication, e.g., a communication network. Examples of communication networks include a local area network (“LAN”) and a wide area network (WAN″), e.g., the Internet.


The computing system can include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.


The process described above is not limited to the implementations set forth herein. For example, the process is not limited to use with the virtual tunnel system described herein, but rather may be implemented in any type of network-based communication system.


It is noted that client application 24 and server application 39 may communicate directly when a direct connection can be achieved (e.g., if they are on the same network). To effect direct communication, if client application 24 and server application 39 use TCP/IP, server application 39 creates a socket on a specific port. Client application 24 also creates a socket and connects to this port. If server application 39 runs on another computer, client application 24 also specifies the network address of that computer. At this point, the client and server are connected and begin communicating.


The local protocols run on local networks 14, 30 may be TCP/IP or a serial protocol, such as RS232 or RS485. The protocol run on external network 26 may be HTTP. The virtual tunnel may comprise a telnet session (e.g., the tunnel is implemented during the telnet session).


It is noted that more than one agent may be present on local network 30 and more than one proxy may be present on local network 14. There may be a one-to-one correspondence between devices and agents and between devices and proxies. Alternatively, a single proxy may service different devices and, likewise, a single agent may service different devices. Similarly, multiple proxies may service the same device and multiple agents may service the same device.


The sessionID string may expire after a predetermined period of time, necessitating a new communication session. For example, the sessionID may expire after a period during which no communications are exchanged. This period may be programmed into server 44. Similarly, the sessionID string expires when a communication session terminates.


Other embodiments not described herein are also within the scope of the following claims.

Claims
  • 1. A method performed by at least one computing device for transferring data in a communication session between a first application on a first network and a second application on a second network, the method comprising: providing a computer program to the first network, the computer program for translating between a protocol associated with the first application and an intermediary protocol, the computer program for servicing multiple devices on the first network, the multiple devices including a first device running the first application;determining that the first device and a second device running the second application are to participate in the communication session, the second device being on the second network;assigning an identifier to the communication session;creating, in computer memory, at least one queue associated with the communication session;storing data passed between the first application and the second application in the at least one queue, the data being stored in association with the identifier;receiving a command from the computer program, the command including the identifier; andoutputting the data from the at least one queue, to the computer program, in response to the command;wherein the first network and the second network are each behind firewalls, and the data is passed between the first network and the second network over an intermediary network that contains the at least one queue, that is not behind the firewalls, and that supports the intermediary protocol for communication.
  • 2. The method of claim 1, further comprising: the computer program creating a socket interface to the first application, the data being transmitted through the socket interface.
  • 3. The method of claim 1, wherein the first and second applications use local protocols that are different from the intermediary protocol; and wherein at least one of the local protocols comprises at least one of TCP/IP or a serial protocol, the serial protocol comprising one of RS232 or RS485.
  • 4. The method of claim 1, wherein the first and second applications use local protocols that are different from the intermediary protocol; and wherein the intermediary protocol comprises HTTP.
  • 5. The method of claim 1, wherein the first and second applications use local protocols; and wherein one local protocol and the intermediary protocol are the same protocol.
  • 6. The method of claim 1, wherein the identifier is invalidated following termination of the communication session.
  • 7. The method of claim 1, wherein the communication session comprises a telnet session.
  • 8. The method of claim 1, further comprising: maintaining a session record, the session record including an identity of a user initiating the communication session.
  • 9. The method of claim 1, wherein the command is an HTTP GET command.
  • 10. The method of claim 1, further comprising: establishing a user-selected termination scenario for terminating the communication session.
  • 11. The method of claim 1, further comprising: assigning a second identifier to a second communication session;creating, in the computer memory, a second queue associated with the second communication session;storing, in the second queue, second data passed between the first application and the second application, the second data being associated with the second identifier;receiving a second command; andoutputting the second data from the second queue in response to the second command.
  • 12. The method of claim 1, wherein providing the computer program to the first network comprises providing a Web page to the first device, the Web page containing the computer program, the computer program being configured for installation on the first device in response to user input.
  • 13. A system comprising: a first computing system that runs a first application and a first computer program, the first computer program to enable communication between the first application and one or more computing devices by performing operations that comprise translating between a protocol associated with the first application and an intermediary protocol, the first computing system being on a first network and being behind a first firewall;a second computing system that runs a second application and a second computer program, the second computer program to enable communication between the second application and the one or more computing devices by performing operations that comprise translating between a protocol associated with the second application and the intermediary protocol, the second computing system being on a second network and being behind a second firewall; andthe one or more computing devices on an intermediary network between the first firewall and the second firewall, the intermediary network supporting the intermediary protocol for communication, the one or more computing devices perform operations comprising:providing the first computer program to the first computing system or the second computer program to the second computing system, at least one of the first computing system or the second computing system comprising multiple devices that are served, respectively, by the first computer program or the second computer program;determining that the first application and the second application are to participate in the communication session;assigning an identifier to the communication session; creating, in computer memory, at least one queue associated with the communication session;storing data passed between the first application and the second application in the at least one queue, the data being stored in association with the identifier;receiving a command from the first computer program or the second computer program, the command including the identifier; andoutputting the data from the at least one queue, to the first computer program or the second computer program, in response to the command.
  • 14. The system of claim 13, wherein providing the first computer program to the first computing system or to the second computing system comprises providing a Web page to the first computing system, the Web page containing the computer program, the computer program being installable on the first computing system in response to user input.
  • 15. One or more non-transitory machine-readable storage devices storing instructions that are executable by at least one computing device for transferring data in a communication session between a first application on a first network and a second application on a second network, the instructions being executable to perform operations comprising: providing a computer program to the first network, the computer program for translating between a protocol associated with the first application and an intermediary protocol, the computer program for servicing multiple devices on the first network, the multiple devices including a first device running the first application;determining that the first device and a second device running the second application are to participate in the communication session, the second device being on the second network;assigning an identifier to the communication session;creating, in computer memory, at least one queue associated with the communication session;storing data passed between the first application and the second application in the at least one queue, the data being stored in association with the identifier;receiving a command from the computer program, the command including the identifier; andoutputting the data from the at least one queue, to the computer program, in response to the command;wherein the first network and the second network are each behind firewalls, and the data is passed between the first network and the second network over an intermediary network that contains the at least one queue, that is not behind the firewalls, and that supports the intermediary protocol for communication.
  • 16. The one or more non-transitory machine-readable storage devices of claim 15, wherein the command is received as part of a polling process that polls the one or more computing devices.
  • 17. The one or more non-transitory machine-readable storage devices of claim 15, wherein the first and second applications use local protocols that are different from the intermediary protocol; and wherein at least one of the local protocols comprises at least one of TCP/IP or a serial protocol, the serial protocol comprising one of RS232 or RS485.
  • 18. The one or more non-transitory machine-readable storage devices of claim 15, wherein the first and second applications use local protocols that are different from the intermediary protocol; and wherein the intermediary protocol comprises HTTP.
  • 19. The one or more non-transitory machine-readable storage devices of claim 15, wherein the first and second applications use local protocols and the intermediary network uses the intermediary protocol; and wherein one local protocol and the intermediary protocol are the same protocol.
  • 20. The one or more non-transitory machine-readable storage devices of claim 15, wherein the identifier is invalidated following termination of the communication session.
  • 21. The one or more non-transitory machine-readable storage devices of claim 15, wherein the communication session comprises a telnet session.
  • 22. The one or more non-transitory machine-readable storage devices of claim 15, wherein the operations comprise: maintaining a session record, the session record including an identity of a user initiating the communication session.
  • 23. The one or more non-transitory machine-readable storage devices of claim 15, wherein the command is an HTTP GET command.
  • 24. The one or more non-transitory machine-readable storage devices of claim 15, wherein the operations comprise: establishing a user-selected termination scenario for terminating the communication session.
  • 25. The one or more non-transitory machine-readable storage devices of claim 15, wherein the operations comprise: assigning a second identifier to a second communication session;creating, in the computer memory, a second queue associated with the second communication session;storing, in the second queue, second data passed between the first application and the second application, the second data being associated with the second identifier;receiving a second command; andoutputting the second data from the second queue in response to the second command.
  • 26. The one or more non-transitory machine-readable storage devices of claim 15, wherein providing the computer program to the first network comprises providing a Web page to the first device, the Web page containing the computer program, the computer program being configured for installation on the first device in response to user input.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of (and claims the benefit of priority under 35 USC 120) U.S. application Ser. No. 13/614,311, filed Sep. 13, 2012 (to be issued as U.S. Pat. No. 9,002,980 on Apr. 7, 2015), which is a continuation of U.S. application Ser. No. 13/105,385, filed May 11, 2011 (issued as U.S. Pat. No. 8,291,039 on Oct. 16, 2012), which is a continuation of U.S. application Ser. No. 10/784,138, filed Feb. 20, 2004 (issued as U.S. Pat No. 7,966,418 on Jun. 21, 2011), which claims the benefit of Provisional Application Ser. No. 60/449,213, filed Feb. 21, 2003. The disclosures of U.S. application Ser. Nos. 13/614,311, 13/105,385, 10/784,138, and Provisional Application Ser. No. 60/449,213 are considered part of (and are incorporated by reference into) the disclosure of this application.

US Referenced Citations (785)
Number Name Date Kind
4086434 Bocchi Apr 1978 A
4412292 Sedam et al. Oct 1983 A
4497037 Kato et al. Jan 1985 A
4583834 Seko et al. Apr 1986 A
4853946 Elliott et al. Aug 1989 A
4962368 Dobrzanski et al. Oct 1990 A
4964065 Hicks et al. Oct 1990 A
4965946 Hegedus et al. Oct 1990 A
4996703 Gray Feb 1991 A
5038319 Carter et al. Aug 1991 A
5057866 Hill, Jr. et al. Oct 1991 A
5061837 Gilbert et al. Oct 1991 A
5077582 Kravette et al. Dec 1991 A
5084875 Weinberger et al. Jan 1992 A
5129080 Smith Jul 1992 A
5138377 Smith et al. Aug 1992 A
5163151 Bronikowski et al. Nov 1992 A
5184179 Tarr et al. Feb 1993 A
5204699 Birnbaum et al. Apr 1993 A
5212645 Wildes et al. May 1993 A
5214772 Weinberger et al. May 1993 A
5216461 Maekawa et al. Jun 1993 A
5220380 Hirata et al. Jun 1993 A
5224157 Yamada et al. Jun 1993 A
5243382 Takano et al. Sep 1993 A
5257069 Hirata et al. Oct 1993 A
5261061 Ju Nov 1993 A
5270775 Suzuki Dec 1993 A
5282127 Mii Jan 1994 A
5291244 Kajiwara et al. Mar 1994 A
5293196 Kaneko et al. Mar 1994 A
5297034 Weinstein Mar 1994 A
5297256 Wolstenholme et al. Mar 1994 A
5300980 Maekawa et al. Apr 1994 A
5303005 Takano et al. Apr 1994 A
5305055 Ebner et al. Apr 1994 A
5305199 LoBiondo et al. Apr 1994 A
5307263 Brown Apr 1994 A
5325156 Ulinski Jun 1994 A
5333286 Weinberger et al. Jul 1994 A
5335048 Takano et al. Aug 1994 A
5339168 Evanitsky et al. Aug 1994 A
5342037 Martin Aug 1994 A
5347346 Shimizu et al. Sep 1994 A
5359391 Kuroyanagi et al. Oct 1994 A
5361265 Weinberger et al. Nov 1994 A
5365310 Jenkins et al. Nov 1994 A
5367667 Wahlquist et al. Nov 1994 A
5369469 Leo et al. Nov 1994 A
5369471 Yamada Nov 1994 A
5369472 Raj et al. Nov 1994 A
5373349 Ito Dec 1994 A
5384622 Hirata et al. Jan 1995 A
5386271 Maekawa et al. Jan 1995 A
5392095 Siegel Feb 1995 A
5398257 Groenteman Mar 1995 A
5404199 Hirata et al. Apr 1995 A
5412779 Motoyama May 1995 A
5414494 Aikens et al. May 1995 A
5420667 Kaneko et al. May 1995 A
5424808 Maekawa et al. Jun 1995 A
5424844 Koyanagi et al. Jun 1995 A
5428551 Trainor et al. Jun 1995 A
5430709 Galloway Jul 1995 A
5434650 Nakahara et al. Jul 1995 A
5442541 Hube et al. Aug 1995 A
5444517 Nagashima Aug 1995 A
5444851 Woest Aug 1995 A
5446522 Tahara et al. Aug 1995 A
5452057 Imaizumi et al. Sep 1995 A
5459552 Ohira Oct 1995 A
5463775 DeWitt et al. Oct 1995 A
5469353 Pinsky et al. Nov 1995 A
5485142 Stute et al. Jan 1996 A
5488454 Fukada et al. Jan 1996 A
5491535 Hirata et al. Feb 1996 A
5493364 Kuroyanagi et al. Feb 1996 A
5517491 Nanni et al. May 1996 A
5528691 Rosauer et al. Jun 1996 A
5530899 MacDonald Jun 1996 A
5543892 Hirata et al. Aug 1996 A
5548376 Kikuno Aug 1996 A
5550957 Davidson, Jr. et al. Aug 1996 A
5555191 Hripcsak Sep 1996 A
5561501 Honma Oct 1996 A
5572672 Dewitt et al. Nov 1996 A
5579087 Salgado Nov 1996 A
5586254 Kondo et al. Dec 1996 A
5594529 Yamashita et al. Jan 1997 A
5600301 Robinson Feb 1997 A
5600403 Inoo Feb 1997 A
5603060 Weinberger et al. Feb 1997 A
5603323 Pflugrath et al. Feb 1997 A
5619024 Kolls Apr 1997 A
5619716 Nonaka et al. Apr 1997 A
5631724 Sawada et al. May 1997 A
5636008 LoBiondo et al. Jun 1997 A
5636333 Davidson, Jr. et al. Jun 1997 A
5638427 Flemming et al. Jun 1997 A
5640495 Colbert et al. Jun 1997 A
5642202 Williams et al. Jun 1997 A
5642208 Takahashi et al. Jun 1997 A
5655084 Pinsky et al. Aug 1997 A
5659794 Caldarale et al. Aug 1997 A
5673190 Kahleck et al. Sep 1997 A
5675744 Tsujii Oct 1997 A
5677775 Yamaguchi et al. Oct 1997 A
5694528 Hube Dec 1997 A
5696903 Mahany Dec 1997 A
5699494 Colbert et al. Dec 1997 A
5699523 Li et al. Dec 1997 A
5708908 Hirata et al. Jan 1998 A
5708909 Yamashita et al. Jan 1998 A
5715393 Naugle Feb 1998 A
5715496 Sawada et al. Feb 1998 A
5715823 Wood et al. Feb 1998 A
5720015 Martin et al. Feb 1998 A
5727135 Webb et al. Mar 1998 A
5727248 Ogura Mar 1998 A
5732212 Perholtz et al. Mar 1998 A
5736965 Mosebrook et al. Apr 1998 A
5740801 Branson Apr 1998 A
5745268 Eastvold et al. Apr 1998 A
5748892 Richardson May 1998 A
5748907 Crane May 1998 A
5752125 Yamashita et al. May 1998 A
5752128 Yamashita May 1998 A
5752917 Fuchs May 1998 A
5761529 Raji et al. Jun 1998 A
5764918 Poulter Jun 1998 A
5768516 Sugishima Jun 1998 A
5772585 Lavin et al. Jun 1998 A
5774052 Hamm et al. Jun 1998 A
5786516 Maliverney Jul 1998 A
5786994 Friz et al. Jul 1998 A
5787149 Yousefi et al. Jul 1998 A
5787278 Barton et al. Jul 1998 A
5790793 Higley Aug 1998 A
5790977 Ezekiel Aug 1998 A
5798738 Yamada Aug 1998 A
5801964 McCarthy Sep 1998 A
5809237 Watts et al. Sep 1998 A
5812397 Pech et al. Sep 1998 A
5812874 Yamashita et al. Sep 1998 A
5818603 Motoyama Oct 1998 A
5819015 Martin et al. Oct 1998 A
5819110 Motoyama Oct 1998 A
5822221 Groenteman Oct 1998 A
5826027 Pedersen et al. Oct 1998 A
5828943 Brown Oct 1998 A
5835724 Smith Nov 1998 A
5835816 Sawada et al. Nov 1998 A
5835911 Nakagawa et al. Nov 1998 A
5844550 Trainor et al. Dec 1998 A
5845061 Miyamoto et al. Dec 1998 A
5845230 Lamberson Dec 1998 A
5857207 Lo et al. Jan 1999 A
5857967 Frid et al. Jan 1999 A
5862348 Pedersen Jan 1999 A
5862404 Onaga Jan 1999 A
5865745 Schmitt et al. Feb 1999 A
5872635 Akiyama Feb 1999 A
5872928 Lewis et al. Feb 1999 A
5873009 Yamashita et al. Feb 1999 A
5873659 Edwards et al. Feb 1999 A
5878746 Lemelson et al. Mar 1999 A
5880677 Lestician Mar 1999 A
5884072 Rasmussen Mar 1999 A
5887216 Motoyama Mar 1999 A
5890029 Hirata et al. Mar 1999 A
5894416 Kuroyanagi Apr 1999 A
5897235 Honma Apr 1999 A
5901286 Danknick et al. May 1999 A
5905906 Goffinet et al. May 1999 A
5909493 Motoyama Jun 1999 A
5911095 Atsumi et al. Jun 1999 A
5913060 Discavage Jun 1999 A
5917405 Joao Jun 1999 A
5923842 Pedersen et al. Jul 1999 A
5933675 Sawada et al. Aug 1999 A
5935060 Hifi Aug 1999 A
5941949 Pedersen Aug 1999 A
5956487 Venkatraman et al. Sep 1999 A
5956698 Lacheze et al. Sep 1999 A
5961586 Pedersen Oct 1999 A
5968116 Day, II et al. Oct 1999 A
5970149 Johnson Oct 1999 A
5974234 Levine et al. Oct 1999 A
5975737 Crater et al. Nov 1999 A
5991810 Shapiro et al. Nov 1999 A
6003061 Jones et al. Dec 1999 A
6003070 Frantz Dec 1999 A
6003078 Kodimer et al. Dec 1999 A
6006045 Miyawaki Dec 1999 A
6009274 Fletcher et al. Dec 1999 A
6009284 Weinberger et al. Dec 1999 A
6012088 Li et al. Jan 2000 A
6014631 Teagarden et al. Jan 2000 A
6014691 Brewer et al. Jan 2000 A
6014694 Aharoni et al. Jan 2000 A
6016535 Krantz et al. Jan 2000 A
6021284 Serizawa et al. Feb 2000 A
6022315 Iliff Feb 2000 A
6023223 Baxter, Jr. Feb 2000 A
6023507 Wookey Feb 2000 A
6023721 Cummings Feb 2000 A
6023722 Colyer Feb 2000 A
6023749 Richardson Feb 2000 A
6025925 Davidson, Jr. et al. Feb 2000 A
6031964 Anderson Feb 2000 A
6041041 Ramanathan et al. Mar 2000 A
6042111 Rivers et al. Mar 2000 A
6057857 Bloomfield May 2000 A
6060994 Chen May 2000 A
6061603 Papadopoulos et al. May 2000 A
6064915 Kaneko et al. May 2000 A
6065118 Bull et al. May 2000 A
6081623 Bloomfield et al. Jun 2000 A
6088718 Altschuler et al. Jul 2000 A
6091915 Takagishi Jul 2000 A
6098116 Nixon et al. Aug 2000 A
6101407 Groezinger Aug 2000 A
6108492 Miyachi Aug 2000 A
6112035 Kuroyanagi et al. Aug 2000 A
6112256 Goffinet et al. Aug 2000 A
6115489 Gupta et al. Sep 2000 A
6118899 Bloomfield et al. Sep 2000 A
6119934 Kolls Sep 2000 A
6122463 Nagatani Sep 2000 A
6125363 Buzzeo et al. Sep 2000 A
6130999 Serizawa et al. Oct 2000 A
6139177 Venkatraman et al. Oct 2000 A
6141737 Krantz et al. Oct 2000 A
6152365 Kolls Nov 2000 A
6157944 Pedersen Dec 2000 A
6161145 Bainbridge et al. Dec 2000 A
6167432 Jiang Dec 2000 A
6167448 Hemphill et al. Dec 2000 A
6172683 Bloomfield Jan 2001 B1
6175866 Holloway et al. Jan 2001 B1
6181331 Trainor et al. Jan 2001 B1
6189113 Rabb et al. Feb 2001 B1
6196735 Inamine Mar 2001 B1
6205466 Karp et al. Mar 2001 B1
6209048 Wolff Mar 2001 B1
6221011 Bardy Apr 2001 B1
6226650 Mahajan et al. May 2001 B1
6230199 Revashetti et al. May 2001 B1
6246485 Brown et al. Jun 2001 B1
6256378 Iggulden et al. Jul 2001 B1
6256668 Slivka et al. Jul 2001 B1
6260148 Aggarwal et al. Jul 2001 B1
6260248 Cramer et al. Jul 2001 B1
6282454 Papadopoulos et al. Aug 2001 B1
6282711 Halpern et al. Aug 2001 B1
6286038 Reichmeyer et al. Sep 2001 B1
6286059 Sugiura Sep 2001 B1
6289461 Dixon Sep 2001 B1
6292828 Williams Sep 2001 B1
6295527 McCormack et al. Sep 2001 B1
6298457 Rachlin et al. Oct 2001 B1
6304895 Schneider et al. Oct 2001 B1
6307570 Stergiades Oct 2001 B1
6308099 Fox et al. Oct 2001 B1
6311024 Serizawa et al. Oct 2001 B1
6312378 Bardy Nov 2001 B1
6317570 Uchida et al. Nov 2001 B1
6317783 Freishtat et al. Nov 2001 B1
6317848 Sorens et al. Nov 2001 B1
6324576 Newcombe et al. Nov 2001 B1
6325540 Lounsberry et al. Dec 2001 B1
6327594 Van Huben et al. Dec 2001 B1
6336135 Niblett et al. Jan 2002 B1
6338086 Curtis et al. Jan 2002 B1
6343320 Fairchild et al. Jan 2002 B1
6356933 Mitchell et al. Mar 2002 B2
6356949 Katsandres et al. Mar 2002 B1
6366741 Fukushima Apr 2002 B1
6368284 Bardy Apr 2002 B1
6370436 Howard et al. Apr 2002 B1
6370552 Bloomfield Apr 2002 B1
6370570 Muir et al. Apr 2002 B1
6370582 Lim et al. Apr 2002 B1
6377162 Delestienne et al. Apr 2002 B1
6377971 Madden et al. Apr 2002 B1
6381557 Babula et al. Apr 2002 B1
6381712 Nemitz Apr 2002 B1
6397212 Biffar May 2002 B1
6401116 Okigami Jun 2002 B1
6405310 Simpson Jun 2002 B1
6406426 Reuss et al. Jun 2002 B1
6412026 Graf Jun 2002 B1
6415023 Iggulden Jul 2002 B2
6415392 Suzuki et al. Jul 2002 B1
6421671 Bryan et al. Jul 2002 B1
6426798 Yeung Jul 2002 B1
6430612 Iizuka Aug 2002 B1
6430711 Sekizawa Aug 2002 B1
6434572 Derzay et al. Aug 2002 B2
6437692 Petite et al. Aug 2002 B1
6437803 Panasyuk et al. Aug 2002 B1
6438598 Pedersen Aug 2002 B1
6446192 Narasimhan et al. Sep 2002 B1
6449633 Van et al. Sep 2002 B1
6449663 Carney et al. Sep 2002 B1
6453127 Wood et al. Sep 2002 B2
6453129 Simpson et al. Sep 2002 B1
6457038 Defosse Sep 2002 B1
6462831 Akiyama Oct 2002 B1
6466971 Humpleman et al. Oct 2002 B1
6467084 Howard et al. Oct 2002 B1
6471521 Dornbush et al. Oct 2002 B1
6477117 Narayanaswami et al. Nov 2002 B1
6479792 Beiermann et al. Nov 2002 B1
6487513 Eastvold et al. Nov 2002 B1
6493517 Hanson Dec 2002 B1
6493871 McGuire et al. Dec 2002 B1
6494831 Koritzinsky Dec 2002 B1
6510350 Steen, III et al. Jan 2003 B1
6523013 Shah et al. Feb 2003 B2
6523063 Miller et al. Feb 2003 B1
6523130 Hickman et al. Feb 2003 B1
6529848 Sone Mar 2003 B2
6538667 Duursma et al. Mar 2003 B1
6549612 Gifford et al. Apr 2003 B2
6553336 Johnson et al. Apr 2003 B1
6553490 Kottapurath et al. Apr 2003 B1
6559965 Simpson et al. May 2003 B1
6560611 Nine et al. May 2003 B1
6560641 Powderly et al. May 2003 B1
6560656 O'Sullivan et al. May 2003 B1
6564227 Sakakibara et al. May 2003 B2
6567813 Zhu et al. May 2003 B1
6574729 Fink et al. Jun 2003 B1
6581092 Motoyama et al. Jun 2003 B1
6581094 Gao Jun 2003 B1
6587812 Takayama Jul 2003 B1
6591272 Williams Jul 2003 B1
6594700 Graham et al. Jul 2003 B1
6598011 Howards Koritzinsky et al. Jul 2003 B1
6598083 Remer et al. Jul 2003 B1
6601087 Zhu et al. Jul 2003 B1
6601159 Smith et al. Jul 2003 B1
6604212 Sekizawa Aug 2003 B2
6609108 Pulliam et al. Aug 2003 B1
6611863 Banginwar Aug 2003 B1
6631407 Mukaiyama et al. Oct 2003 B1
6636899 Rabb et al. Oct 2003 B1
6643650 Slaughter et al. Nov 2003 B1
6643690 Duursma et al. Nov 2003 B2
6646655 Brandt et al. Nov 2003 B1
6651110 Caspers et al. Nov 2003 B1
6651190 Worley et al. Nov 2003 B1
6654032 Zhu et al. Nov 2003 B1
6654720 Graham et al. Nov 2003 B1
6654726 Hanzek Nov 2003 B1
6665425 Sampath et al. Dec 2003 B1
6670810 Duncan et al. Dec 2003 B2
6671695 McFadden Dec 2003 B2
6681344 Andrew Jan 2004 B1
6681349 Sekizawa Jan 2004 B2
6684259 Discavage et al. Jan 2004 B1
6686838 Rezvani et al. Feb 2004 B1
6687848 Najmi Feb 2004 B1
6687873 Ballantyne et al. Feb 2004 B1
6691106 Sathyanarayan Feb 2004 B1
6691154 Zhu et al. Feb 2004 B1
6691157 Muir et al. Feb 2004 B2
6704807 Mathur et al. Mar 2004 B1
6710893 Hou et al. Mar 2004 B1
6711593 Gordon et al. Mar 2004 B1
6711618 Danner et al. Mar 2004 B1
6717513 Sandelman et al. Apr 2004 B1
6725281 Zintel et al. Apr 2004 B1
6738798 Ploetz et al. May 2004 B1
6754664 Bush Jun 2004 B1
6757714 Hansen Jun 2004 B1
6757899 Zhdankin et al. Jun 2004 B2
6763274 Gilbert Jul 2004 B1
6763501 Zhu et al. Jul 2004 B1
6766333 Wu et al. Jul 2004 B1
6775238 Suzuki Aug 2004 B1
6779004 Zintel Aug 2004 B1
6782542 Mein et al. Aug 2004 B1
6785015 Smith et al. Aug 2004 B1
6785713 Freeman et al. Aug 2004 B1
6785726 Freeman et al. Aug 2004 B1
6789112 Freeman et al. Sep 2004 B1
6789119 Zhu et al. Sep 2004 B1
6792337 Blackett et al. Sep 2004 B2
6799209 Hayton Sep 2004 B1
6799270 Bull et al. Sep 2004 B1
RE38609 Chen et al. Oct 2004 E
6804712 Kracht Oct 2004 B1
6807580 Freeman et al. Oct 2004 B2
6810488 Teng Oct 2004 B2
6816616 Teng Nov 2004 B2
6823397 Rawson, III Nov 2004 B2
6826606 Freeman et al. Nov 2004 B2
6831555 Miller et al. Dec 2004 B1
6832239 Kraft et al. Dec 2004 B1
6832373 O'Neill Dec 2004 B2
6834298 Singer et al. Dec 2004 B1
6842903 Weschler Jan 2005 B1
6857013 Ramberg et al. Feb 2005 B2
6886046 Stutz et al. Apr 2005 B2
6891830 Curtis May 2005 B2
6901448 Zhu et al. May 2005 B2
6904593 Fong et al. Jun 2005 B1
6920480 Mitchell et al. Jul 2005 B2
6922724 Freeman et al. Jul 2005 B1
6925335 May et al. Aug 2005 B2
6925645 Zhu et al. Aug 2005 B2
6928469 Duursma et al. Aug 2005 B1
6940405 Script et al. Sep 2005 B2
6950991 Bloomfield et al. Sep 2005 B2
6952714 Peart Oct 2005 B2
6963899 Fernandez et al. Nov 2005 B1
6972676 Kimmel et al. Dec 2005 B1
6983020 Christiansen Jan 2006 B2
6985779 Hsiung et al. Jan 2006 B2
6986040 Kramer et al. Jan 2006 B1
6990395 Ransom et al. Jan 2006 B2
7003574 Bahl Feb 2006 B1
7016966 Saulpaugh et al. Mar 2006 B1
7020706 Cates et al. Mar 2006 B2
7020773 Otway et al. Mar 2006 B1
7028025 Collins Apr 2006 B2
7028081 Kawashima Apr 2006 B2
7028312 Merrick et al. Apr 2006 B1
7031342 Teng Apr 2006 B2
7032005 Mathon et al. Apr 2006 B2
7043677 Li May 2006 B1
7046134 Hansen May 2006 B2
7051084 Hayton et al. May 2006 B1
7057724 Mead et al. Jun 2006 B1
7065576 Kamel et al. Jun 2006 B2
7069298 Zhu et al. Jun 2006 B2
7072946 Shafer Jul 2006 B2
7079010 Champlin Jul 2006 B2
7080267 Gary et al. Jul 2006 B2
7082426 Musgrove et al. Jul 2006 B2
7082460 Hansen et al. Jul 2006 B2
7085814 Gandhi et al. Aug 2006 B1
7085824 Forth et al. Aug 2006 B2
7089567 Girardot et al. Aug 2006 B2
7091846 Wu Aug 2006 B2
7092370 Jiang et al. Aug 2006 B2
7099110 Detzler Aug 2006 B2
7100200 Pope et al. Aug 2006 B2
7103357 Kirani et al. Sep 2006 B2
7103799 Dixon Sep 2006 B2
7113988 Chirashnya et al. Sep 2006 B2
7116681 Hovell et al. Oct 2006 B1
7117239 Hansen Oct 2006 B1
7117243 Peart Oct 2006 B2
7127525 Coleman et al. Oct 2006 B2
7130883 Zhu et al. Oct 2006 B2
7142839 Pelaez et al. Nov 2006 B2
7149792 Hansen et al. Dec 2006 B1
7158483 Takabatake et al. Jan 2007 B1
7162315 Gilbert Jan 2007 B2
7162628 Gentil et al. Jan 2007 B2
7178149 Hansen Feb 2007 B2
7185014 Hansen Feb 2007 B1
7194743 Hayton et al. Mar 2007 B2
7200578 Paltenghe et al. Apr 2007 B2
7203755 Zhu et al. Apr 2007 B2
7213051 Zhu et al. May 2007 B2
7216172 Yang et al. May 2007 B2
7234943 Aleali Jun 2007 B1
7254601 Baller et al. Aug 2007 B2
7266526 Drummond et al. Sep 2007 B1
7290061 Lentini et al. Oct 2007 B2
7293176 Otway et al. Nov 2007 B2
7315830 Wirtz et al. Jan 2008 B1
7325037 Lawson Jan 2008 B2
7330872 Peart et al. Feb 2008 B2
7334119 Gentil et al. Feb 2008 B2
7340772 Panasyuk et al. Mar 2008 B2
7346842 Hayton et al. Mar 2008 B1
7353253 Zhao Apr 2008 B1
7359953 Muir et al. Apr 2008 B2
7376695 Duursma et al. May 2008 B2
7421484 Das Sep 2008 B2
7444071 Chen Oct 2008 B2
7453379 Plamondon Nov 2008 B2
7460038 Samuels et al. Dec 2008 B2
7490166 Yang et al. Feb 2009 B2
7496097 Rao et al. Feb 2009 B2
7502726 Panasyuk et al. Mar 2009 B2
7502784 Collins Mar 2009 B2
7506048 Motoyama Mar 2009 B1
7529767 DeAnna et al. May 2009 B2
7532134 Samuels et al. May 2009 B2
7542471 Samuels et al. Jun 2009 B2
7555529 Bloomfield et al. Jun 2009 B2
7562121 Berisford et al. Jul 2009 B2
7562146 Panasyuk et al. Jul 2009 B2
7562226 Aiken et al. Jul 2009 B2
7565526 Shaw et al. Jul 2009 B1
7581005 Montemayor et al. Aug 2009 B2
7584294 Plamondon Sep 2009 B2
7587755 Kramer Sep 2009 B2
7593514 Zhuang et al. Sep 2009 B1
7594018 Pedersen Sep 2009 B2
7596593 Mitchell et al. Sep 2009 B2
7606902 Rao et al. Oct 2009 B2
7609721 Rao et al. Oct 2009 B2
7613131 Decasper et al. Nov 2009 B2
7617531 Chauhan et al. Nov 2009 B1
7619545 Samuels et al. Nov 2009 B2
7656799 Samuels et al. Feb 2010 B2
7657657 Rao et al. Feb 2010 B2
7661129 Panasyuk et al. Feb 2010 B2
7661131 Shaw et al. Feb 2010 B1
7664857 Ovsiannikov et al. Feb 2010 B2
7676813 Bisset et al. Mar 2010 B2
7937370 Hansen May 2011 B2
7966418 Shedrinsky Jun 2011 B2
8055758 Hansen Nov 2011 B2
8060886 Hansen Nov 2011 B2
8108543 Hansen Jan 2012 B2
8291039 Shedrinsky Oct 2012 B2
8762497 Hansen Jun 2014 B2
9002980 Shedrinsky Apr 2015 B2
20010007117 Cooper et al. Jul 2001 A1
20010011250 Paltenghe et al. Aug 2001 A1
20010025377 Hinderks Sep 2001 A1
20010027439 Holtzman et al. Oct 2001 A1
20010049690 McConnell et al. Dec 2001 A1
20010049717 Freeman et al. Dec 2001 A1
20010052999 Hiraoka Dec 2001 A1
20010056547 Dixon Dec 2001 A1
20020006790 Blumenstock et al. Jan 2002 A1
20020019844 Kurowski et al. Feb 2002 A1
20020026514 Ellis et al. Feb 2002 A1
20020032470 Linberg Mar 2002 A1
20020032720 Nelson et al. Mar 2002 A1
20020035533 Mache et al. Mar 2002 A1
20020038320 Brook Mar 2002 A1
20020052932 Curtis et al. May 2002 A1
20020054169 Richardson May 2002 A1
20020059489 Davis et al. May 2002 A1
20020064138 Saito et al. May 2002 A1
20020078135 Venkatsubra Jun 2002 A1
20020078259 Wendorf et al. Jun 2002 A1
20020080391 Sugiura et al. Jun 2002 A1
20020095600 Deen et al. Jul 2002 A1
20020116550 Hansen Aug 2002 A1
20020133753 Mayberry et al. Sep 2002 A1
20020135801 Tessman et al. Sep 2002 A1
20020138567 Ogawa Sep 2002 A1
20020144016 Spicer et al. Oct 2002 A1
20020157090 Anton, Jr. Oct 2002 A1
20020174085 Nelson et al. Nov 2002 A1
20020178241 Eriksson Nov 2002 A1
20020191612 Curtis Dec 2002 A1
20030014733 Ringseth et al. Jan 2003 A1
20030023957 Bau et al. Jan 2003 A1
20030025931 Dorfman et al. Feb 2003 A1
20030037148 Pedersen Feb 2003 A1
20030056140 Taylor et al. Mar 2003 A1
20030061403 Miyata et al. Mar 2003 A1
20030063119 Bloomfield et al. Apr 2003 A1
20030063309 Parry Apr 2003 A1
20030070006 Nadler et al. Apr 2003 A1
20030072027 Haines et al. Apr 2003 A1
20030081617 Deng May 2003 A1
20030088697 Matsuhira May 2003 A1
20030118353 Bailer et al. Jun 2003 A1
20030154284 Bernardin et al. Aug 2003 A1
20030158897 Ben-Natan et al. Aug 2003 A1
20030158919 Fomenko Aug 2003 A1
20030163569 Panasyuk et al. Aug 2003 A1
20030167223 Pledereder et al. Sep 2003 A1
20030177172 Duursma et al. Sep 2003 A1
20030182375 Zhu et al. Sep 2003 A1
20030200285 Hansen et al. Oct 2003 A1
20030200329 Delaney et al. Oct 2003 A1
20030229529 Mui et al. Dec 2003 A1
20030229785 Daseke et al. Dec 2003 A1
20040027376 Calder et al. Feb 2004 A1
20040098515 Rezvani et al. May 2004 A1
20040128370 Kortright Jul 2004 A1
20040133692 Blanchet et al. Jul 2004 A1
20040138786 Blackett et al. Jul 2004 A1
20040139309 Gentil et al. Jul 2004 A1
20040152450 Kouznetsov et al. Aug 2004 A1
20040158630 Chang et al. Aug 2004 A1
20040158631 Chang et al. Aug 2004 A1
20040177124 Hansen Sep 2004 A1
20040186693 Xiang et al. Sep 2004 A1
20040215605 Mester Oct 2004 A1
20040221026 Dorland Nov 2004 A1
20040252628 Detzler Dec 2004 A1
20040260801 Li Dec 2004 A1
20040260947 Brady Dec 2004 A1
20050005152 Singh et al. Jan 2005 A1
20050015501 Kaplan et al. Jan 2005 A1
20050021772 Shedrinsky Jan 2005 A1
20050033588 Ruiz et al. Feb 2005 A1
20050055397 Zhu et al. Mar 2005 A1
20050080897 Braun et al. Apr 2005 A1
20050086172 Stefik Apr 2005 A1
20050102388 Tabbara et al. May 2005 A1
20050141507 Curtis Jun 2005 A1
20050144612 Wang et al. Jun 2005 A1
20050154787 Cochran et al. Jul 2005 A1
20050190769 Smith Sep 2005 A1
20050193099 Reus et al. Sep 2005 A1
20050193386 McCaleb et al. Sep 2005 A1
20050196023 Chen et al. Sep 2005 A1
20050198189 Robinson et al. Sep 2005 A1
20050198245 Burgess et al. Sep 2005 A1
20050198292 Duursma et al. Sep 2005 A1
20050198379 Panasyuk et al. Sep 2005 A1
20050198380 Panasyuk et al. Sep 2005 A1
20050198393 Stutz et al. Sep 2005 A1
20050232168 Schauser et al. Oct 2005 A1
20050235014 Schauser et al. Oct 2005 A1
20050246445 Panasyuk et al. Nov 2005 A1
20050246702 Yeh et al. Nov 2005 A1
20050251551 Mitchell et al. Nov 2005 A1
20050256614 Habermas Nov 2005 A1
20050256923 Adachi Nov 2005 A1
20050262076 Voskuil Nov 2005 A1
20050267974 Panasyuk et al. Dec 2005 A1
20050273513 Panasyuk et al. Dec 2005 A1
20060002315 Theurer et al. Jan 2006 A1
20060015740 Kramer Jan 2006 A1
20060029062 Rao et al. Feb 2006 A1
20060029063 Rao et al. Feb 2006 A1
20060029064 Rao et al. Feb 2006 A1
20060031237 DeAnna et al. Feb 2006 A1
20060031476 Mathes et al. Feb 2006 A1
20060031779 Theurer et al. Feb 2006 A1
20060037022 Byrd et al. Feb 2006 A1
20060037071 Rao et al. Feb 2006 A1
20060037072 Rao et al. Feb 2006 A1
20060039354 Rao et al. Feb 2006 A1
20060039355 Rao et al. Feb 2006 A1
20060039356 Rao et al. Feb 2006 A1
20060039404 Rao et al. Feb 2006 A1
20060047956 Calvin Mar 2006 A1
20060059239 Kouznetsov et al. Mar 2006 A1
20060066448 Berisford et al. Mar 2006 A1
20060069662 Laborczfalvi et al. Mar 2006 A1
20060069668 Braddy et al. Mar 2006 A1
20060069750 Momtchilov et al. Mar 2006 A1
20060069753 Hu et al. Mar 2006 A1
20060070029 Laborczfalvi et al. Mar 2006 A1
20060070090 Gulkis Mar 2006 A1
20060070131 Braddy et al. Mar 2006 A1
20060074837 Braddy et al. Apr 2006 A1
20060075080 Burr et al. Apr 2006 A1
20060075114 Panasyuk et al. Apr 2006 A1
20060075123 Burr et al. Apr 2006 A1
20060075381 Laborczfalvi et al. Apr 2006 A1
20060075463 Braddy et al. Apr 2006 A1
20060077941 Alagappan et al. Apr 2006 A1
20060087408 Korzeniowski Apr 2006 A1
20060087409 Korzeniowski Apr 2006 A1
20060090171 Laborczfalvi et al. Apr 2006 A1
20060095334 Simmons May 2006 A1
20060095370 Seth et al. May 2006 A1
20060100972 Chianese et al. May 2006 A1
20060135192 Surendra et al. Jun 2006 A1
20060150249 Gassen et al. Jul 2006 A1
20060159080 Mazzaferri Jul 2006 A1
20060159432 Mazzaferri Jul 2006 A1
20060161555 Mazzaferri Jul 2006 A1
20060161671 Ryman et al. Jul 2006 A1
20060161783 Aiken et al. Jul 2006 A1
20060161959 Ryman et al. Jul 2006 A1
20060161974 Innes et al. Jul 2006 A1
20060179143 Walker et al. Aug 2006 A1
20060184614 Baratto et al. Aug 2006 A1
20060190719 Rao et al. Aug 2006 A1
20060200307 Riess Sep 2006 A1
20060200494 Sparks Sep 2006 A1
20060203007 Bullard et al. Sep 2006 A1
20060206820 Bullard et al. Sep 2006 A1
20060224742 Shahbazi Oct 2006 A1
20060236325 Rao et al. Oct 2006 A1
20060236385 Innes et al. Oct 2006 A1
20060242415 Gaylor Oct 2006 A1
20060247502 Chen Nov 2006 A1
20060248144 Zhu et al. Nov 2006 A1
20060271875 Green et al. Nov 2006 A1
20060271877 Theurer Nov 2006 A1
20060282521 Anderson et al. Dec 2006 A1
20070005736 Hansen et al. Jan 2007 A1
20070011295 Hansen Jan 2007 A1
20070011356 Schauser et al. Jan 2007 A1
20070022159 Zhu et al. Jan 2007 A1
20070056009 Spilo et al. Mar 2007 A1
20070078976 Taylor et al. Apr 2007 A1
20070088826 Raphel et al. Apr 2007 A1
20070094076 Perkowski et al. Apr 2007 A1
20070094672 Hayton et al. Apr 2007 A1
20070100892 Kephart et al. May 2007 A1
20070106810 Ryman May 2007 A1
20070106811 Ryman May 2007 A1
20070113069 Gentil et al. May 2007 A1
20070130167 Day et al. Jun 2007 A1
20070130337 Arnison Jun 2007 A1
20070143837 Azeez et al. Jun 2007 A1
20070150903 Hansen Jun 2007 A1
20070156810 Kumar Jul 2007 A1
20070156923 Kumar Jul 2007 A1
20070157101 Indiran et al. Jul 2007 A1
20070171921 Wookey et al. Jul 2007 A1
20070174410 Croft et al. Jul 2007 A1
20070174429 Mazzaferri et al. Jul 2007 A1
20070174454 Mitchell et al. Jul 2007 A1
20070179955 Croft et al. Aug 2007 A1
20070180447 Mazzaferri et al. Aug 2007 A1
20070180448 Low et al. Aug 2007 A1
20070180449 Croft et al. Aug 2007 A1
20070180450 Croft et al. Aug 2007 A1
20070180493 Croft et al. Aug 2007 A1
20070186212 Mazzaferri et al. Aug 2007 A1
20070192329 Croft et al. Aug 2007 A1
20070198656 Mazzaferri et al. Aug 2007 A1
20070198661 Hansen Aug 2007 A1
20070203952 Baron et al. Aug 2007 A1
20070239886 Montemayor et al. Oct 2007 A1
20070271599 Rosenstein Nov 2007 A1
20070282623 Dattorro Dec 2007 A1
20070288629 Taylor et al. Dec 2007 A2
20070294237 John et al. Dec 2007 A1
20080005321 Ma et al. Jan 2008 A1
20080031235 Harris et al. Feb 2008 A1
20080034057 Kumar et al. Feb 2008 A1
20080034072 He et al. Feb 2008 A1
20080034110 Suganthi et al. Feb 2008 A1
20080034111 Kamath et al. Feb 2008 A1
20080034119 Verzunov et al. Feb 2008 A1
20080034410 Udupa et al. Feb 2008 A1
20080034413 He et al. Feb 2008 A1
20080034418 Venkatraman et al. Feb 2008 A1
20080034419 Mullick et al. Feb 2008 A1
20080043617 Schekochikhin et al. Feb 2008 A1
20080043622 Kamath et al. Feb 2008 A1
20080043749 Suganthi et al. Feb 2008 A1
20080043760 Venkatraman et al. Feb 2008 A1
20080043761 Kumar et al. Feb 2008 A1
20080046371 He et al. Feb 2008 A1
20080046616 Verzunov et al. Feb 2008 A1
20080046714 Suganthi et al. Feb 2008 A1
20080046717 Kanekar et al. Feb 2008 A1
20080046727 Kanekar et al. Feb 2008 A1
20080046994 Venkatraman et al. Feb 2008 A1
20080049616 Kamath et al. Feb 2008 A1
20080065757 Motoyama et al. Mar 2008 A1
20080068289 Piasecki Mar 2008 A1
20080068290 Muklashy et al. Mar 2008 A1
20080069005 von Eicken et al. Mar 2008 A1
20080069104 von Eicken et al. Mar 2008 A1
20080071905 Sullivan et al. Mar 2008 A1
20080082657 Hart et al. Apr 2008 A1
20080109912 Rivera May 2008 A1
20080126978 Bai et al. May 2008 A1
20080154957 Taylor et al. Jun 2008 A1
20080201405 Duursma et al. Aug 2008 A1
20080208605 Sinha et al. Aug 2008 A1
20080219122 Detzler et al. Sep 2008 A1
20080231414 Canosa Sep 2008 A1
20080250110 Zhao Oct 2008 A1
20090013064 Taylor et al. Jan 2009 A1
20090019226 Edwards et al. Jan 2009 A1
20090055745 Christiansen Feb 2009 A1
20090064134 Cox Mar 2009 A1
20090099836 Jacobsen et al. Apr 2009 A1
20090100349 Hancock Apr 2009 A1
20090106347 Harwood et al. Apr 2009 A1
20090117890 Jacobsen et al. May 2009 A1
20090119408 Teze et al. May 2009 A1
20090187654 Raja et al. Jul 2009 A1
20090234972 Raghu et al. Sep 2009 A1
20090259728 Berisford et al. Oct 2009 A1
20120143970 Hansen Jun 2012 A1
20120158914 Hansen Jun 2012 A1
20130067031 Shedrinsky Mar 2013 A1
Foreign Referenced Citations (64)
Number Date Country
0874306 Oct 1998 EP
1191744 Mar 2002 EP
1305712 May 2003 EP
1319212 Jun 2003 EP
1362282 Nov 2003 EP
1504371 Feb 2005 EP
1695485 Aug 2006 EP
2797728 Feb 2001 FR
2305820 Apr 1997 GB
60-263163 Dec 1985 JP
60263162 Dec 1985 JP
64-061842 Mar 1989 JP
06062130 Mar 1994 JP
07325513 Dec 1995 JP
09163008 Jun 1997 JP
09305407 Nov 1997 JP
09325925 Dec 1997 JP
10190922 Jul 1998 JP
10224372 Aug 1998 JP
11045195 Feb 1999 JP
11167540 Jun 1999 JP
11203079 Jul 1999 JP
11234271 Aug 1999 JP
11238043 Aug 1999 JP
11296453 Oct 1999 JP
2000112863 Apr 2000 JP
2000122952 Apr 2000 JP
2000163283 Jun 2000 JP
2000194583 Jul 2000 JP
2000278773 Oct 2000 JP
2000309145 Nov 2000 JP
2001154953 Jun 2001 JP
2001337817 Dec 2001 JP
2001344129 Dec 2001 JP
2003140991 May 2003 JP
2003223603 Aug 2003 JP
2006277752 Oct 2006 JP
4808911 Nov 2011 JP
2013058231 Mar 2013 JP
5492968 May 2014 JP
WO-9730879 Aug 1997 WO
WO-9820439 May 1998 WO
WO-9833302 Jul 1998 WO
WO-9838910 Sep 1998 WO
WO-9841943 Sep 1998 WO
WO-9921336 Apr 1999 WO
WO-9957649 Nov 1999 WO
WO-9957837 Nov 1999 WO
WO-9957838 Nov 1999 WO
WO-9964958 Dec 1999 WO
WO-2000007099 Feb 2000 WO
WO-0023894 Apr 2000 WO
WO-0210919 Feb 2002 WO
WO-0221239 Mar 2002 WO
WO-0221299 Mar 2002 WO
WO-0221414 Mar 2002 WO
WO-0221415 Mar 2002 WO
WO-0221777 Mar 2002 WO
WO-0225501 Mar 2002 WO
WO-03021464 Mar 2003 WO
WO-03054439 Jul 2003 WO
WO-2004059447 Jul 2004 WO
WO 2006009402 Jan 2006 WO
WO 2008083177 Jul 2008 WO
Non-Patent Literature Citations (151)
Entry
“Frequently Asked Questions about the Extensible Markup Language—The XML FAQ” Version 1.41 (http://www.oasis-open.orq/cover/xmlFAQ141-19981006.html) (Oct. 6, 1998).
“Remote Diagnostics: Strategic weapon in the war for multi-vendor service contracts,” Tech Assessment, vol. 3, No. 12, Dec. 1995.
“Siemens Medical, BJC Health System Extend deal to multivendor service,” Medical Imaging News, vol. 6, No. 26, Jun. 27, 1997.
Dec. 27, 1995, Scan Diagnostic Imaging, vol. 8, No. 24.
24×7, HealthTech Publishing Company, Inc. (Nov. 1996).
Apr. 22, 2005 Literature Search by Keyword: CyberTAC.
Action and Response History in U.S. Appl. No. 09/627,201.
Action and Response History in U.S. Appl. No. 09/667,737.
Action and Response History in U.S. Appl. No. 09/708,384.
Action and Response History in U.S. Appl. No. 09/716,717.
Action and Response History in U.S. Appl. No. 10/028,126.
Action and Response History in U.S. Appl. No. 10/123,960.
Action and Response History in U.S. Appl. No. 10/124,181.
Action and Response History in U.S. Appl. No. 10/784,138.
Action and Response History in U.S. Appl. No. 10/805,012.
Action and Response History in U.S. Appl. No. 11/503,638.
Action and Response History in U.S. Appl. No. 11/537,399.
Action and Response History in U.S. Appl. No. 11/673,943.
Action and Response History in U.S. Appl. No. 11/677,279.
Action and Response History in U.S. Appl. No. 11/774,474.
Action in Application No. JP 2002-515578, dated Jul. 26, 2011.
Adelberg, D., “Building Robust Wrappers for Text Sources”, [online] Retrieved from the Internet:<URL:http://student.bu.ac.bd/-mumiUResearch/NLP-bib/papers/Adelberg99.pdf> [retrieved on Nov. 24, 2008/] (1999).
Allegro Software product release 1-61 overview Greenhills Software Inc., [online] Jun. 10, 2002 (Jun. 10, 2002), pp. 1-1, XP002201939 Retrieved from the Internet: <URL: http://www.ghs.com/partners/allegro/> [retrieved on Jun. 10, 2002] the whole document.
Allegro, RomWebCLient Embedded HTTP client Toolkit: Allegrosoft, Circuit Cellar Online, Sep. 7, 2000, pp. 1-2, XP-002201983, URL:http://web.archive.orgweb/20000709204234/http://www.allegrosoft.com/romwebclient.html.
Annex to EPO Form 2004 with claims for grant in European Application No. 01955993.9.
Bock, G., “Mainstreaming XML-based Enterprise Applications: Using Oracle XML DB to Manage Financial Information within a Global Banking System”, Oracle Corporation, (C) 2003.
Box, et al., Simple Object Acces Protocol (SOAP) 1.1, Document No. XP002250270, May 8, 2000.
Chandler, T. et al., “The Technology Development of Automatic Metering and Monitoring Systems”, Int'l Power Engineering Conf. 2005, IEEE, 4 pgs.
Cheung, D. et al., “Distributed and Scalable XML Document Processing Architecture for E-Commerce Systems”, Adv. Issues of E-commerce and Web-Based Information Systems, WECWIS 2000, 2nd Int'l Workshop, (Jun. 2000), pp. 152-157.
Citrix Online, Citrix Systems, Inc. Whilte Paper, “GoToMyPC Corporate Technology”, [online] Retrieved from the Internet:<URL:http://www.gotomypc.com/downloads/pdf/m/GoToMyPC_Corporate_Technol oqy White Paper.pdf> [retrieved on Mar. 16, 2010] (2004 ).
Citrix Online, Citrix Systems, Inc. Whilte Paper, “GoToMyPC Security”, [online] Retrieved from the Internet:<URL:http://www.citrix.it/REPOSITORY/docRepository/id_979_1124821417888736.pdf> [retrieved on Mar. 161, 2010 (2004 ).
Communication dated Apr. 26, 2005 in European Application No. 01955993.9.
Communication in EP Application No. 01973431.8, dated Mar. 30, 2005.
CyberTAC & RadScape Presentation (May 1997).
CyberTAC Design Presentation (1997).
CyberTAC from Virtual Impact Systems, Inc. Presentation (1997).
CyberTAC Remote Support System Presentation (1997).
Database WIP, Section El, Week 200156, Abstract, Document No. XP002253876 (Korea Electronics & Telecom Res Inst.) Derwent Publications, Ltd., London, GB, (Mar. 2001).
Decision to Refuse in Application No. EP01973431.8, dated Jun. 21, 2011.
Defense Information Systems Agency, Field Services Office, White Paper Report “pcAnvwhere 10.5” (Sep. 2003).
Eastvold, Roger, “Services: the Next Generation,” The Professional Journal, vol. 20, No. 4, 1996 (Previously submitted on Feb. 3, 2014).
Eastvold, Roger, “Services: The Next Generation,” The Professional Journal, vol. 20, No. 4.
Eastvold, Roger, “Tiss and Tell,” Medical Imaging, Sep. 1995.
EBITS:Electronic Business & Information Technology for Society Research Consortium, Proposal for Development of an Educational and Research Infrastructure for Safe Electronic Commerce, [online] Retrieved from the Internet:<URL:http://www.cs.dartmouth.edu/-makedon/cs 188/proposal. html>, [retrieved Feb. 15, 2005].
Emmerich et al., Implementing Incremental Code Migration with XML, IEEE, 4-11, (Jun. 2000).
EmWare Press Release: “emWare Announces Support for Sun Microsystems Jini Technoloqv,” Salt Lake City, UT (Feb. 1999).
EmWare Press Release: “emWare Delivers EMIT 3.0 SOK Pro-A Complete Device Networking Kit for Developing End-to-end, Embedded Device Networking Solutions,” Salt Lake City, UT (May 1999).
EmWare Press Release: “emWare's emlink (TM) Used to Internet-enable Welch Allyn's Vital Signs Monitor,” Chicago, IL (Mar. 1999).
EmWare Press Release: “emWare, IBM Demonstrate Next Phase in Establishing Worldwide Access to Embedded Devices,” Chicago, IL (Mar. 1999).
EmWare Press Release: “Invensys Selects emWare Emit Device—Networking Software to Add Remote Monitoring and Control Capabilities to its Controller Products,” Salt Lake City, UT (Jun. 1999).
EmWare Press Release: “Motorola, Mitsubishi and National Semiconductor Join emWare's Embed The Internet Alliance,” Chicago, IL (Mar. 1999).
English translation of Notification of Reasons for Refusal in Japanese Application No. 2002-529431, dated Nov. 8, 2010.
Ennis, D., “CORSA and XML Integration in Enterprise Systems”, IONA Technologies Inc.[online], Retrieved from the Internet:<URL:http://citeseer.ist.psu.edu/cache/papers/cs/16013/http:zSzzSzwww.iona.com zSzinfozSztechcenterzSzecoop2000apr17. pdf/ennisOOcorba. pdf> [retrieved on Nov. 24, 2008/] (2000).
Examination Report in EP Application No. 01973431.8, dated Jan. 15, 2008/.
Examination Report in EP Application No. 01973431.8, dated Mar. 8, 2005.
Examination Report in EP Application No. 02792391.1, dated Mar. 10, 2010.
Examination Report in EP Application No. 01955993.9, dated Aug. 5, 2004.
Examination Report in EP Application No. 01955993.9, dated Dec. 16, 2004.
Examination Report in EP Application No. 01955993.9, dated Jan. 29, 2004.
Examination Report in EP Application No. 01973431.8, dated Feb. 6, 2009.
Examination Report in EP Application No. 01973431.8, dated Mar. 23, 2010.
Examination Report in EP Application No. 03719774.6, dated Apr. 12, 2006/.
Examination Report in EP Application No. 03719774.6, dated Sep. 12, 2005.
ExpertCity, Inc., Whilte Paper, “GoToMyPC: Making Life Simpler for Teleworkers and Travelers”, [online] Retrieved from the.
Franklin, M. et al., “Data in Your Face: PUSH Technology in Perspective”, Proc. ACM SIGMOD Int'l Conf. on Mqmt of Data, (Jun. 1998), #XP000886180, oas. 516-519.
Hanckmann, J., “Telescript: The Emerging Standard for Intelligent Messaging,” Philips Telecommunications Review, vol. 52(1), pp. 15-19 (Mar. 1994).
International Preliminary Examination Report in Application No. PCT/US01/23651, dated Oct. 10, 2002.
International Preliminary Examination Report in Application No. PCT/US01/29787, dated Aug. 21, 2002.
International Preliminary Examination Report in Application No. PCT/US01/45198, dated Apr. 2, 2008/.
International Preliminary Examination Report in Application No. PCT/US2002/040058, dated Jun. 10, 2004.
International Preliminary Report on Patentability (incl. Written Opinion) in Application No. PCT/US2007/088858, dated Jul. 9, 2009.
International Search Report &. Written Opinion in Application No. PCT/US2007/088858, dated May 21, 2008/.
International Search Report and Written Opinion in Application No. PCT/US03/11701, dated Oct. 13, 2004.
International Search Report in Application No. PCT/US01/23651, dated Jun. 3, 2002.
International Search Report in Application No. PCT/US01/29787, dated Jun. 28, 2002.
International Search Report in Application No. PCT/US01/45198, dated Apr. 29, 2003.
International Search Report in Application No. PCT/US03/11707, dated Sep. 24, 2003.
International Search Report in Application No. PCT/US2002/040058, dated Nov. 3, 2003.
Internet:< URL:http://www.si. umich.edu/Classes/540/Placement/GoOvrvew. pdf> [retrieved on Mar. 16, 2010] (2001).
Japanese Office action with English from Japanese application 2012-245293 issued Oct. 1, 2013 (7 pages).
Jennyc, Kenn S., “Linking Enterprise Business Systems to the Factory Floor,” The Hewlett-Packard Journal, Article 9 (May 1998).
Jiang, et al., “Record-Boundary Discovery in Web Documents”, [online] Retrieved from the Internet:<URL:http://osm7.cs.byu.edu/deg/papers/SJ.Thesis.ps>, [retrieved on Nov. 24, 2008].
Kafeza, E. et al., “Alerts in Mobile Healthcare Applications: Requirements and Pilot Study”, IEEE, vol. 8, No. 2, pp. 173-181 (Jun. 2004).
Kimball, R., “XML Will Make it Easier,” Intelligent Enterprise, [online] Retrieved from the Internet:<URL:http://www.intelligententerprise.com/010416/webhouse1_ 1.jhtml> [retrieved on Nov. 24, 2008] (Apr. 16, 2001).
Koppen, E., et al., “Active Hypertext for Distributed Web Applications”, Enabling Technologies: Infrastructure for Collaborative Enterprises, (WET ICE '99), Proc. IEEE 8th Int'l. Workshop (1999), pp. 297-302.
Kovar, J., “Xerox Unveils Expanded Channel Lineup; Also Plans to Introduce E-Mail, Queue Management Software,” PC Expo,(Jun. 1999).
Lassman, M. et al., “Modern Nuclear Medical Diagnostics with Efficient Gamma Cameras,” Electromedica, 66(2):43-51, (1998).
Layman, et al., “XML-Data,” Position Paper from Microsoft Corp. (Jun. 1997), [online] Retrieved from the Internet:<URL:http://www.oasis-open.org/cover/xml-data9706223.html> [retrieved on Sep. 2, 2004].
Lerner, R., “At the Forge: Introducing SOAP”, Linux Journal, #XP002292162 (Mar. 2001 ).
Letter from Foreign Associate regarding response filed in EP Application No. 01973431.8, dated Oct. 8, 2010.
Lewandowska, J., et al., “System for Grouping Technologically Similar Devices”, v. 48 n 12; (Dec. 1975), pp. 636-638 (English Abstract).
Lindley, D., “Xerox unveils copier that phones for help,” Rochester Democrat and Chronicle, (Mar. 28, 1990).
Incremona, A. “Remote Service Diagnostics for Imaging Equipment: Today and Tomorrow,” Advanced Imaging, 12(9):90(2) (1997).
Luh, James C., “With several specs complete, XML enters widespread development,” Internet World, (Jan. 4, 1999).
Machine Translation of Japanese Patent Publication No. 09-305407 (Pub Date Nov. 1997).
Machine Translation of Japanese Patent Publication No. 11-203079, (Pub Date Jul. 1999).
Machine Translation of Japanese Patent Publication No. 11-296453, (Pub Date Oct. 1999).
Machine Translation of Japanese Patent Publication No. 2000-163283, (Pub Date Jun. 2000).
Machine Translation of Japanese Patent Publication No. 2000-309145, (Pub Date Nov. 2000).
Machine Translation of Japanese Patent Publication No. 2001-337817, (Pub Date Dec. 2001).
Machine Translation of Japanese Patent Publication no. 11-045195, (Pub Date Feb. 1999).
Martin, D., “Professional XML”., WROX Press Ltd., pub., Ch. 11, ‘Server to Server’, pp. 559-562, 819-820 (2000).
Mason, K., “XML Translation for block structured languages”, IBM Corporation: Research Disclosure, Kenneth Mason Publications, 44176 (2001).
Math Markup Language (Chapter 4); [online] Retrieved from the Internet:<URL:http://www.w3.org/TR/REC-MathML/chap4_ 4.html>, [retrieved on Feb. 15, 2005].
McBride, R.A., “Security Considerations for Active Messages,” ACM SIGICE Bulletin, vol. 22 (2), (Oct. 1996).
Memphis Educational Computer Connectivity Alliance (MECCA), [online] Retrieved from the Internet<URL:http://www.mecca.org/-Itague/nsfnocostextension.html>, [retrieved on Feb. 15, 2005].
Mills et al., “A knowledge-based method for inferring semantic concepts from visual models of system behavior,” ACM (Jul. 2000), pp. 306-337.
Notice of Reasons for Rejection in Japanese Application No. 2002-529431, dated Nov. 8, 2010.
Office Action in EP Application No. 01955993.9, dated Jun. 6, 2005.
Office Action in EP Application No. 01996048.3, dated Jun. 22, 2004.
Office Action in EP Application No. 01996048.3, dated Mar. 11, 2005.
Oral Proceeding Minutes in European Application No. 01955993.9, dated Jan. 16, 2006/.
Oral Proceedings Communication in Application No. EP01973431.8, dated May 12, 2011.
Orasis Medical Services, Inc., Business Plan Copy No. 001, (Nov. 1995).
Pfeiffer, R., “XML Tutorials for Programmers: Tutorial 2: Writing XML Documents,” (1999) [online] Retrieved from the Internet:<URL:http://imb.com/xml>, [retrieved on Mar. 2, 1999].
Questra Applications Data Sheet (2002).
Questra Preliminary Invalidity Contentions, dated Apr. 29, 2005.
Reagan, K., “Technology for the Soul,” OC Metro, (Sep. 1, 1995).
Response filed in Application No. JP2002-529431, dated May 2, 2011.
Response to Examination Report in EP Application No. 01973431.8, dated Oct. 4, 2010.
Response to Office Action with English translation filed Dec. 26, 2013 in Japanese application No. 2012-245293 (22 pages).
Result of Consultation of Nov. 24, 2005 and Nov. 25, 2005 from corresponding European Application No. 01955993.
Rytting, T., “Dispensing the Goods, Embedded Style,” Circuit Cellar Online, (Oct. 1999).
Schmidt, The Evolution of Workflow Standards, IEEE (1999).
Search Report in EP Application No. 02792391.1, dated Nov. 19, 2009.
Searls, “The Next Bang: The Explosive Combination of Embedded Linux, XML, and Instant Mess.”, ACM (Sep. 2000) Issue 77 [online] Retrieved from the Internet:<URL:http://www.linuxjournal.com/article.php?sid=4195>, [retrieved on Nov. 20, 2001].
Second Auxiliary Response in EP Application No. 01973431.8, dated Apr. 26, 2011.
SOAP Archives Online, “Multiple Method Calls in Soap Packet”; [online] Retrieved from the Internet:<URL:http://discuss.develop.com/archives/wa.exe?A2=ind9912&L=soap&T=O&F=&S=&P=25113>, [retrieved on Dec. 8, 2000].
Steinfeld, E., “From Standalone to Internet Appliance”, Circuit Cellar Online, [online] (Jul. 9, 2000), #XP002201938, Retrieved from the Internet: <URL:http://web.archive.org/web/20000709204234/http://www.alegrosoft.com/romwebclient.html>retrieved on Jun. 12, 2002 the whole document.
Steinfeld, E., “Internet-appliance technology automates test equipment” EDN Magazine, pp. 157-169, Oct. 2000, www.edbmaq.com.
Submission in German dated Nov. 25, 2005 from corresponding European Application No. 01955993.9.
Summons to attend oral proceedings in corresponding European Application No. 01955993.9 dated Oct. 31, 2005.
Summons to attend Oral Proceedings in counterpart EP Application No. 01973431.8, dated Feb. 2, 2011.
Suresh et al., “XML-based Data System for Earth Science Applications”, IEEE 2000 International, vol. 3, DD 242-28, Jul. 2000.
The Simple Times, vol. 7, No. 1, Mar. 1999; [online] Retrieved from the Internet:<URL: http://www.simple-times.org/pub/simple-times/issues/7-1. html> [retrieved on Aug. 3, 2005].
Trewitt, G., “Using Tel to Process HTML Forms,” Digital Network Systems Laboratory, NSL Technical Note TN-14, Palo Alto, CA (Mar. 1994).
Universal Plug & Play Device Architecture, (C) Microsoft Corporation (Jun. 8, 2000), [online] Retrieved from the Internet: <URL:http://www.upnp.org/specs/arch/upnpda10_20000613.htm>, [retrieved on Nov. 24, 2008/].
Van der Werff, M., et al., “A Mobile-Based Home Automatic System”, IEEE Mobility Conference (2005).
Virtual Reality Transfer Protocol (VRTP); Retrieved from the Internet:<URL:http://www.stl.nps.navv.mil/-brutzman/vrtp> (1998).
Walsh, Norman, “XSL The Extensible Style Language: Styling XML Documents,” New Architect Daily, Jan. 1999.
Webmethods B2B Whitepaper; [online] Retrieved from the Internet:<URL:http://www.cs.wisc.edu/-vganti/papers/b2b wpB2Bintegration.html> (1999).
White Paper, Medical Imaging, East Providence, RI (Sep. 1995).
Wigget, Jeremy, “Intraview: Roger Eastvold of Orasis Inc.,” 24×7, Nov. 1996.
Wikipedia, “GoToMyPC”, [online] Retrieved from the Internet:<URL: http://en.wikipedia.orq/wiki/Gotomvpc> [retrieved on Jan. 21, 2010] (2010).
Wikipedia, Java (software platform), http://en.wikipedia.org/wiki/java_(software_platform), Jul. 11, 2013 (12 pages.
Williams, T., “Java Goes to Work Controlling Networked Embedded Systems” Computer Design, Pennwell Publ. Littleton, MA, 35:9:36-37, Aug. 1996.
Winer, Dave, “XML-RPC Specification,” (http://XML-RPC.com), Jun. 15, 1999.
Winter 1992, Field of View, vol. 2, No. 3, Toshiba America Medical System, Inc.
Written Opinion in Application No. PCT/US01/45198, dated May 31, 2007/.
Wu et al., “A knowledge sharing and collaboration system model based on Internet”, Systems, Man, and Cybernetics, 1999. IEEE SMC'99 Conference Proceedings, vol. 2, pp. 148-152 (1999).
Xerox 190 Copier, Electronic Data Interface Operator Guide, ver. 1.0, (1989).
Related Publications (1)
Number Date Country
20150281403 A1 Oct 2015 US
Provisional Applications (1)
Number Date Country
60449213 Feb 2003 US
Continuations (3)
Number Date Country
Parent 13614311 Sep 2012 US
Child 14678277 US
Parent 13105385 May 2011 US
Child 13614311 US
Parent 10784138 Feb 2004 US
Child 13105385 US