Patent Grant
9219579
The invention generally relates to optimizing peer-to-peer network communications, and in particular, to techniques for application-aware prioritizations of network communications on a client.
Communications over a network between two computers are typically processed in the order generated by the activity of a user and applications of the client and incoming network communications are processed in the order they are received. This is not always desirable, however. For example, in one case, although an application is running in the foreground and currently in active use by the user, a network packet generated or received for an application running in the background may be processed ahead of a network packet generated or received for the application running in the foreground. In another example, the client may be running a VoIP application to provide a telephone call to a remote computing device. One or more other applications on the client may be running that are not related to the real-time data communication of VoIP. The network packets for these applications may be processed ahead of the real-time network packets of the VoIP telephone call thereby increasing the latency and reducing the quality of the voice communication. It is desirable to provide application-aware, client-specific prioritization of packet traffic.
The present invention is generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one embodiment, the remote access architecture of the present invention provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway. Additionally, the present invention provides various techniques for optimizing peer-to-peer communications, including real-time communications such as voice over internet protocol (VoIP) signaling and media, video, and other real-time data applications such as web collaboration, screen or desktop sharing, and instant messaging. The present invention provides the following peer to peer optimization techniques: 1) false acknowledgement of receipt of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 2) payload shifting of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 3) reduction of packet fragmentation by adjusting the maximum transmission unit (MTU) parameter, accounting for overhead due to encryption, 4) application-aware prioritization of client-side network communications, and 5) network disruption shielding for reliable and persistent network connectivity and access, such as for mobile computing.
In one aspect, the present invention relates to a method for establishing a peer-to-peer communication session between a first computing device on a first network and a second computing device on a second network. The first network may be disconnected from and not routable to the second network. The method includes establishing, by the first computing device, a first tunneling session with a third computing device, and establishing, by the second computing device, a second tunneling session with the third computing device. The third computing device may be a gateway, such as an SSL VPN gateway. The first computing device initiates a communication session to the second computing device via the third computing device, such as via a signaling protocol. A server receives a signal to establish the initiated communication session, and the server communicates to the first computing device a first network address comprising a network address of the second computing device associated with the second tunneling session. The first computing device communicates a request to initiate a connection with the second computing device using the first network address. The method further includes intercepting, by the third computing device, the request, and providing the first computing device a second network address for the second computing device. The second network address identifies a public network address associated with the second computing device. The third computing device communicates a request to the second computing device to allow a connection from the first computing device using the second network address, such as via a swimmer session traversing a firewall.
In one embodiment of the present invention, the first tunneling session or the second tunneling session is established using a Secure Socket Layer or a virtual private network The third computing device may be a remote access gateway. In another embodiment, the second computing device is located behind a firewall associated with the second network address.
In another embodiment, the method of the present invention includes providing, by the third computing device, the second network address to the first computing device by communicating an out of band signal to the first computing device via the first tunneling session. In an additional embodiment, the method of includes providing, by the second computing device, a forward hole in a firewall for the first computing device to communicate to the second computing device using the second network address.
In a further embodiment of the present invention, the third computing device communicates a key to the first computing device and the second computing device. The first computing device and the second computing device may exchange keys. Additionally, the first and second computing device may check that the key received from the other computing device matches before transmitting data to the other computing device.
In some embodiments of the present invention, the method associates a first telecommunication device with the first computing device, and associates a second telecommunication device with the second computing device. The first telecommunication device or the second telecommunication device may include a software component or a hardware component, such as a hard or soft VoIP telephone. In one embodiment, the method of the present invention includes establishing a telecommunication session between the first telecommunication device and the second telecommunication device via the connection between the first and second computing devices. The first telecommunication device and the second telecommunication device may communicate over the telecommunication session without traversing the third computing device.
In another embodiment of the present invention, the method communicates a remote display protocol via the connection between the first computing device and the second computing device. The remote desktop protocol may include the Independent Computing Architecture protocol or the Remote Desktop Protocol. In yet a further embodiment, the method may include sharing a screen view or screen data of the first computing device with the second computing device via the connection.
In one aspect, the present invention relates to a method performed in a gateway for establishing a peer-to-peer communication session between a first computing device on a first network and a second computing device on a second network. The first network may be disconnected from and not routable to the second network. The method includes establishing a first tunneling session with the first computing device on a first network, and establishing a second tunneling session with the second computing device on the second network. The gateway receives a request by the first computing device to initiate a communication session with the second computing device. The first computing device provides a first network address for contacting the second computing device. The first network address identifies a network address of the second computing device associated with the second tunneling session. The gateway receives a request by the first computing device to initiate a connection with the second computing device using the first network address, intercepts the request to initiate the connection, and provides the first computing device a second network address for the second computing device. The second network address identifies a public network address associated with the second computing device. The gateway communicates to the second computing device a request to allow the connection from the first computing device to the second computing device using the second network address, such as via a swimmer session traversing a firewall.
In one embodiment, the first tunneling session or the second tunneling session via the gateway includes a Secure Socket Layer or a virtual private network. In another embodiment, the second computing device is located behind a firewall associated with the second network address. In a further embodiment, the method of the present invention provides the second network address to the first computing device by communicating an out of band signal to the first computing device via the first tunneling session. Additionally, the gateway may communicate a key to the first computing device and to the second computing device.
In another aspect, the present invention is related to a system for establishing a peer-to-peer communication session between a first computing device on a first network and a second computing device on a second network via a third computing device. The first network may be disconnected from and not routable to the second network. The system includes a first computing device on the first network, and a second computing device on the second network. A third computing device establishes a first tunneling session with the first computing device and a second tunneling session with the second computing device. The system also includes a server accessible via the third computing device. In operation of the system, the server communicates via the third computing device to the first computing device a first network address identifying a network address of the second computing device associated with the second tunneling session. The first computing device communicates via the third computing device a first request to initiate a connection with the second computing device using the first network address. The third computing device intercepts the first request, and provides the first computing device a second network address for the second computing device. The second network address identifies a public network address associated with the second computing device. The third computing device communicates a second request to the second computing device to allow a connection from the first computing device using the second network address.
In one embodiment of the system, the first tunneling session or the second tunneling session includes a Secure Socket Layer or a virtual private network. Furthermore, the third computing device may be a remote access gateway, such as an SSL VPN gateway. In another embodiment of the system, the second computing device is located behind a firewall associated with the second network address.
In an additional embodiment of the present invention, the third computing device provides the second network address to the first computing device by communicating an out of band signal via the first tunneling session, such as via an out of band TLS session. In one embodiment, the second computing device provides a forward hole in a firewall for the first computing device to communicate to the second computing device using the second network address.
In a further embodiment of the system of the present invention, the third computing device communicates a key to the first computing device and the second computing device. The first computing device and the second computing device may exchange keys. Additionally, the first and second computing device may check that the key received from the other computing device matches before transmitting data.
In some embodiments of the present invention, the system includes a first telecommunication device associated with the first computing device, and a second telecommunication device associated with the second computing device. The first telecommunication device or the second telecommunication device may include a software component or a hardware component, such as a hard or soft VoIP telephone. In one embodiment, the system of the present invention includes establishing a telecommunication session between the first telecommunication device and the second telecommunication device via the connection between the first and second computing devices. The first telecommunication device and the second telecommunication device may communicate over the telecommunication session without traversing the third computing device.
In another embodiment of the present invention, the first computing device and the second computing device communicate a remote display protocol via the connection. The remote desktop protocol may include the Independent Computing Architecture protocol or the Remote Desktop Protocol. In yet a further embodiment, the first computing device may share a screen view or screen data with the second computing device via the connection.
In another aspect, the present invention is related to a method for communicating via a lossless protocol a packet constructed to be transmitted via a lossy protocol. The method may be performed in one or more electronic devices, such as in a system, and by any suitable means and mechanisms. The method includes establishing a connection between a first computing device and a second computing device via a lossless protocol. In some embodiments, the second computing device may be a gateway, such as an SSL VPN gateway. The first computing device detects a lossless protocol packet comprising a payload having one or more packets constructed in accordance with a lossy protocol. The first computing device communicates a false acknowledgement of receipt of the lossless protocol packet to the first computing device and/or the second computing device. The false acknowledgement of receipt of the lossless protocol packet prevents employing the reliability algorithms and mechanisms of the lossless protocol. The first computing device communicates the lossless protocol packet to the second computing device. In some embodiments, the false acknowledgement of receipt of the lossless protocol packet is communicated prior to communicating the lossless protocol packet.
In one embodiment, the method of the present invention includes encrypting, by the first computing device, the one or more packets using a key. In some embodiments, the encryption key may be provided to the first computing device via an out of band transport security layer session between the first computing device and the second computing device. In a further embodiment, the method encrypts the one or more packets on a packet by packet basis.
In another embodiment of the method of the present invention, in response to receiving the false acknowledgement of receipt of the lossless protocol packet by the first computing device and/or the second computing, the first computing device and/or the second computing prevents executing an operation associated with providing a lossless characteristic of the lossless protocol. In one embodiment, the lossless protocol is a transport control protocol. In a further embodiment, the method of the present invention prevents the network stack of the first computing device and/or the second computing device from executing one or more of the following in connection with the lossless protocol: 1) a retransmit, 2) an ordering, 3) a flow control algorithm, 4) a naple's algorithm, and 5) a sliding window algorithm.
In one embodiment, the lossy protocol includes a user datagram protocol. In another embodiment, the method includes communicating, by the first computing device, the lossless protocol packet via a secure socket layer or a transport security layer tunnel to the second computing device.
In another embodiment, the one or more packets of the payload comprises a real-time protocol. In an additional embodiment, the method includes communicating by the first computing device one of real-time voice, audio, or data to the second computing device via the one or more packets.
In one aspect, the present invention relates to a method for transmitting packets from an application using an unreliable transport protocol over a TCP connection. The method includes receiving, at a first device, a first packet to be transmitted using an unreliable transport protocol, and creating a first TCP packet including a first payload of the received first packet and a first TCP header of information associated with a TCP connection established between the first device and a second device. The first device transmits the first TCP packet to the second device. The method further includes receiving, at the first device, a second packet to be transmitted using an unreliable transport protocol, and creating a second TCP packet including a second payload of the received second packet and the first TCP header information. Before receipt of an acknowledgement of the receipt of the first payload from the second device, the first device transmits the second TCP packet to the second device.
In one embodiment, the method of the present invention establishes the TCP connection with a port number associated with the unreliable transport protocol. In another embodiment, the method includes dynamically determining, by the first device, the first TCP packet and second TCP packet comprise an unreliable transport protocol. In some embodiments, the unreliable transport protocol is UDP.
In an additional embodiment, the method includes receiving the first TCP packet and second TCP packet on the first device by intercepting the first TCP packet and second TCP packet using a packet capturing mechanism. In some embodiments, the method establishes by the first device, the TCP connection with a VPN gateway device. In other embodiments, the method includes establishing peer-to-peer communications between the first device and the second device via the TCP connection. In another embodiment of the present invention, the method includes encrypting, by the first device, the first and second TCP packets, and decrypting, by the second device, the encrypted first and second TCP packets.
In another aspect, the present invention relates to a method for transmitting packets from an application using an unreliable transport protocol over a TCP connection. The method includes intercepting, at a second device, a first TCP packet created on a first device and received on the second device. The first TCP packet includes a first payload of a first packet generated by an application using an unreliable protocol and a first TCP header of information associated with a TCP connection established between the first device and the second device. The intercepting of the method occurs before the first TCP packet is provided to a TCP stack on the second device. The method includes identifying, responsive to the TCP header of information, that the first payload is a packet generated by an application using an unreliable transport protocol, stripping the TCP header of information from the first TCP packet, and forwarding the first payload to an application using the unreliable data protocol.
In one embodiment, the unreliable protocol is UDP. In another embodiment, the step of identifying comprises identifying that the TCP header information includes a port number associated with the unreliable transport protocol. In some embodiments, the method includes intercepting, by the second device, the first TCP packet using a packet capture driver.
In some embodiments, the first device is a client device and the second device is a VPN gateway. Additionally, the method of the present invention includes performing Network Address Translation (NAT) on the second device prior to forwarding the first payload to the application.
In a further aspect, the present invention relates to a system for transmitting packets from an application using an unreliable transport protocol over a TCP connection. The system includes a first device and a second device. The first device has an application that generates a first and second packet. The first and second packet are intended to be transmitted using an unreliable transport protocol. The first device also has a filter process and a tunneling process. The filter process intercepts the first and second packets from the application and forwards the intercepted packets to the tunnel process. The tunnel process requests the opening of a TCP connection between the first device and a second device. The request to open the TCP connection indicates to the first and second device that the TCP connection will transport packets intended to be transmitted with an unreliable transport protocol. The tunnel process forwards the first and second packets as payloads in a first and second TCP packet to the second device. The tunnel process sends the second TCP packet after sending the first TCP packet and prior to receiving an acknowledgement for the first TCP packet.
The second device of the system of the present invention is in communication with the first device. The second device has second filter process and tunneling process. The second tunnel process opens the TCP connection requested by the first device, and identifies and forwards the source address of the TCP connection to the second filter process. The second filter process intercepts packets from the application received at the second device with the TCP connection source address in a header. The second filter process strips the TCP header from the received packets and forwards the stripped packets to an intended destination, and circumventing the TCP/IP stack on the second device.
In one embodiment of the system of the present invention, the filter process on the first device and/or the second filter process of the second device is a packet capture driver. In some embodiments, the first device is a client device and the second device is a VPN gateway device. In one embodiment, the unreliable data protocol is UDP.
In another embodiment, the system also includes a third device to which the stripped packets are transmitted. Additionally, the second device may further include a Network Address Translation (NAT) table used to perform network address translation prior to transmitting the stripped packets to the third device.
In a further aspect, the present invention is related to a method for adjusting the maximum transmission unit of a secure network communication to reduce network fragmentation. The method may be performed in one or more electronic devices, such as in a system, and by any suitable means and mechanisms. The method includes establishing a session between a first computing device and a second computing device. The session may established by an agent of the first computing device. The first computing device has a first network stack. The method detects, by the first computing device, a network packet having an encrypted payload, and determines a setting for a maximum transmission unit parameter of the first network stack to reduce the maximum transmission unit size by at least a size associated with the encrypted portion of the payload. The method alters the maximum transmission unit (MTU) parameter of the first network stack to the determined setting. As such, the reported MTU parameter is reduced to account for the encryption.
In one embodiment, the method of the present invention includes communicating the network packet via a secure socket layer or a transport layer security tunnel to the second computing device. The second computing device may be a gateway, such as an SSL VPN gateway. In another embodiment, the payload comprises a real-time protocol.
Additionally, in one embodiment, the method may further comprise altering the maximum transmission unit parameter via a network driver interface specification (NDIS) level mechanism of the first network stack In another embodiment, the method determines the setting of the maximum transmission unit parameter dynamically per session between the first computing device and the second computing device. In one embodiment, the agent of the first computing device communicates via an IOCTL application programming interface to the first network stack to alter the maximum transmission unit parameter to the determined setting.
In some embodiments, the method of the present invention establishes the session between the first computing device and the second computing device via a gateway. In other embodiments, the method communicates by the first computing device real-time voice, audio, or data to the second computing device via the payload of the network packet. In yet another embodiment, the method may include communicating a false acknowledgement of receipt of the network packet to the first computing device and/or the second computing device before communicating the network packet. In one embodiment, the network packet comprises a lossless protocol packet, such as a transport control protocol. In another embodiment, the payload comprises a lossy protocol packet, such as a user datagram protocol.
In an additional aspect, the present invention is related to a method for a client to prioritize network communications of the client associated with an application of the client. The method includes intercepting, by the client, one or more network packets associated with one or more applications of the client, and storing the one or more network packets to a queue. The client determines the queued one or more network packets is associated with a first application of the client. The client indicates a priority for the determined one or more network packets to place the determined one or more network packets ahead of at least one network packet in the queue associated with a second application of the client. The client provides the prioritized one or more network packets for communications via a network stack of the client.
In one embodiment, the method of the present invention includes determining, by the client, the queued one or more networks packets of the first application comprises real-time data. The real-time data may include one of the following: 1) a real-time protocol, 2) a user datagram protocol, and 3) a representation of voice or audio.
In another embodiment, the method includes preventing, by the client, at least one network packet of the second application from being communicated via the network stack ahead of the one or more network packets of the first application. In a further embodiment, the method includes holding, by the client, in the queue a network packet associated with the second application, and releasing the held network packet upon communication of the one or more network packets associated with the first application prioritized ahead of the held network packet.
In yet another embodiment of the present invention, the method includes intercepting, by the client, the one or more network packets transparently to the one or more applications on the client. In some embodiments, the first application is running in the foreground, and the second application is running in the background.
In one embodiment of the present invention, the method includes associating a priority with the first application higher than a priority associated with the second application. In another embodiment, a user may specify the priority of the first application or the second application. In a further embodiment, the client receives the one or more network packets from a computing device. Also, the one or more applications may provide the one or more network packets for communicating from the client to a computing device.
In another aspect, the present invention is related to a client for prioritizing network communications of the client associated with an application of the client. The client includes a mechanism for intercepting one or more network packets of the client associated with one or more applications of the client. The client also includes a network driver for storing the one or more networks packets to a queue and communicating the one or more network packets via a network stack of the client. The client further includes an agent for determining the one or more network packets is associated with a first application of the client, and indicating to the network driver a priority of the one or more network packets to place the determined one or more network packets ahead of at least one network packet in the queue associated with a second application of the client.
In one embodiment, the agent of the present invention determines the one or more networks packets of the first application comprises real-time data. The real-time data comprises one of the following: 1) a real-time protocol, 2) a user datagram protocol, and a 3) representation of voice or audio.
In a further embodiment, the agent or the network driver of the present invention prevents at least one network packet of the second application from being communicated via the network stack ahead of the one or more network packets of the first application. In one embodiment, the network driver holds in the queue a network packet associated with the second application, and releases the held network packet upon communication of the one or more network packets associated with the first application prioritized ahead of the held network packet.
In another embodiment, the present invention, via the mechanism, intercepts the one or more network packets transparently to the one or more applications on the client. In some embodiments, the first application is running in the foreground, and the second application is running in the background. Also, the first application may have a priority higher than the second application of the client. Furthermore, the client may include a configuration mechanism for a user to specify the priority. In some embodiments, the client receives the one or more network packets from a computing device. In other embodiments, the one or more applications provides the one or more network packets for communicating from the client to a computing device.
In an additional embodiment, the network driver includes a Network Driver Interface Specification (NDIS) driver. Also, the network driver may operate in kernel-mode of an operating system of the client. In some cases, the agent operates in user-mode of an operating system of the client. Furthermore, the agent or the network driver includes the mechanism for intercepting one or more network packets of the client.
In yet another aspect, the present invention is related to a method for shielding from a network disruption a session established via a first protocol. The method includes the steps of establishing, via an agent of a client, a session via a first protocol over a network connection between the client and a device. The network connection is associated with a network stack. A first portion of the network stack has one or more layers of the network stack below the layer of the first protocol, and a second portion of the network stack includes a layer for the first protocol and one or more layers of the network stack above the first protocol. The method includes detecting a disruption in the network connection causing the second portion of the network stack to be disestablished, and maintaining, by the agent, the session and the second portion of the network stack during the disruption. The method further includes re-establishing the first portion of the network stack and the network connection while maintaining the session and the second portion of the network stack.
In one embodiment, the method includes continuing the session with the maintained second portion of the network stack and the re-established first portion of the network stack. In some embodiments, the method also includes dropping, by the first and/or second portion of the network stack, any network packets received during the disruption.
In another embodiment, the device comprises a remote access gateway or another computing device. In some cases, the method includes establishing the session via the first protocol of one of the following: 1) secure socket layer (SSL) protocol, 2) a transport layer security (TLS) protocol, and 3) a tunneling protocol. Additionally, the method of the present invention may include communicating, by the agent, real-time data via the session between the client and the device. The real-time data may include a real-time protocol or the real-time data may represent voice or audio.
In some embodiments, the agent operates in user-mode of an operating system of the client. In one embodiment, the first portion of the network comprises one of a transport control protocol or an internet protocol. In another embodiment, the second portion of the network stack comprises one of 1) an internet protocol, 2) a user datagram protocol, or 3) a voice over internet protocol. Additionally, the client may communicate with the device via a remote display protocol. The remote display protocol may be an Independent Computing Architecture (ICA) protocol or a Remote Desktop Protocol (RDP).
In another embodiment, the method of the present invention is performed transparently to an application of the client communicating via the network connection. In one embodiment, the method includes intercepting, by the agent, transparently to an application of the client one or more network packets associated with the application. In one embodiment, the method includes intercepting, by a network driver associated with the first portion of the stack, transparently to the application on the client one or more network packets associated with the application.
In an additional aspect, the present invention is related to a system for shielding from a network disruption a session established via a first protocol. The system has an agent of a client establishing a session between the client and a device over a network connection via a first protocol. The system includes a network stack having a first portion and a second portion, such as the network stack of the client. The second portion of the network stack comprises a layer for the first protocol and one or more layers of the network stack above the first protocol, and a first portion of the network stack comprises one or more layers of the network stack below the layer of the first protocol. The system includes a detector for detecting a disruption in the network connection causing the first portion of the network stack to be disestablished. In operation of the system and upon detection of the disruption by the detector, the agent maintains the session and the second portion of the network stack during the disruption. The client re-establishes the first portion of the network stack and the network connection while the agent maintains the session and the second portion of the network stack.
In one embodiment of the system of the present invention, the agent continues the session with the maintained second portion of the network stack and the re-established first portion of the network stack. In some embodiments, the first and/or second portion of the network stack drops any network packets received during the disruption.
In one embodiment, the device of the system is a remote access gateway or another computing device The first protocol used by the system of the present invention may include one of the following: 1) secure socket layer (SSL) protocol, 2) a transport layer security (TLS) protocol, and 3) a tunneling protocol. In another embodiment, the agent of the present invention communicates real-time data via the session between the client and the device. The real-time data may include a real-time protocol, or a representation of voice or audio.
In some embodiments of the system, the agent operates in user-mode of an operating system of the client. In one system embodiment, the first portion of the network comprises a transport control protocol and/or or an internet protocol. In another embodiment, the second portion of the network stack includes one of 1) an internet protocol, 2) a user datagram protocol, or 3) a voice over internet protocol. Additionally, the client may communicate with the device via a remote display protocol, which may be an Independent Computing Architecture (ICA) protocol or a Remote Desktop Protocol (RDP).
In another embodiment, the system of the present invention maintains the second portion of the network stack and re-establishes the first portion of the network stack transparently to an application of the client communicating via the network connection. In one embodiment, the agent intercepts network packets transparently to an application of the client one or more network packets associated with the application. In one embodiment, the system also includes intercepting, by a network driver associated with the second portion of the stack, transparently to the application on the client one or more network packets associated with the application.
The details of various embodiments of the invention are set forth in the accompanying drawings and the description below.
The foregoing and other objects, aspects, features, and advantages of the invention will become more apparent and may be better understood by referring to the following description taken in conjunction with the accompanying drawings, in which:
Certain illustrative embodiments of the present invention are described below. It is, however, expressly noted that the present invention is not limited to these embodiments, but rather the intention is that additions and modifications to what is expressly described herein also are included within the scope of the invention. Moreover, it is to be understood that the features of the various embodiments described herein are not mutually exclusive and can exist in various combinations and permutations, even if such combinations or permutations are not expressly made herein, without departing from the spirit and scope of the invention.
The illustrative embodiments of the present invention are generally directed towards a remote access architecture for providing peer-to-peer communications and remote access connectivity. In one illustrative embodiment, the remote access architecture of the present provides a method for establishing a direct connection between peer computing devices via a third computing device, such as a gateway. The present invention also provides various techniques for optimizing the peer-to-peer communications established with or without the gateway. The peer-to-peer communications may include real-time communications such as voice over internet protocol (VoIP) signaling and media, video, and other real-time data applications such as web collaboration, screen or desktop sharing, and instant messaging. In addition to establishing a peer-to-peer connection via gateway, the present invention also provides the following techniques to optimize peer-to-peer communications: 1) false acknowledgement of receipt of network packets allowing communications via a lossless protocol packets constructed for transmission via a lossy protocol, 2) payload shifting of network packets allowing communications via a lossless protocol of packets constructed for transmission via a lossy protocol, 3) reduction of packet fragmentation by adjusting the maximum transmission unit (MTU) parameter, accounting for overhead due to encryption, 4) application-aware prioritization of client-side network communications, and 5) network disruption shielding for reliable and persistent network connectivity and access, such as for mobile clients. These techniques may be practiced in peer-to-peer communications between two clients in some embodiments, or in other embodiments, in communications between a client and a gateway or between one computing device via a gateway to another computing device, such as via an SSL VPN gateway of an illustrative embodiment of the present invention.
In the illustrative embodiments of the present invention, the peer-to-peer route optimization technique determines a more optimal route to a resource a client may be trying to access via a gateway. The client and the resource accessed by the client, such as a server or a peer computer, may have a more direct route than via the gateway. For example, the client and the server may be located near each other but distant from the gateway, and thus, are closer to each other than via the gateway. Furthermore, using a gateway causes at least one additional hop in the end-to-end network communications between the client and the server. Instead of the client and server communicating via the gateway using their virtual private network (VPN) assigned internet protocol (IP) network addresses, the gateway and remote access architecture of the present invention facilitates the client and server communicating to each other via a direct route in a peer-to-peer fashion without using the gateway. In some cases, however, the client and server may not have a direct path between each other as either the client and/or server may be behind a firewall, such as a Network Address Translation (NAT) firewall. The peer-to-peer route optimization techniques and remote access architecture of the present invention also provide techniques for the client and server to communicate directly via traversal of the firewall. As such, the peer-to-peer route optimization techniques of the present invention provides a shorter more optimal route between peer computers than via the gateway.
In the illustrative embodiments of the present invention, the false acknowledgement technique of an embodiment of the present invention enables a packet constructed to be transmitted via a lossy protocol to be communicated via lossless protocol. For example, a real time protocol (RTP) may be implemented over a user datagram protocol (UDP) for voice over IP (VoIP) communications. A lossy or unreliable protocol, such as UDP, may be used for voice communications because, in some real-time voice applications, it may be more important to get network packets to a recipient on time rather than getting the network packets in order or guaranteeing the delivery of network packets. However, by way of virtual private network and remote access solutions using a secure communication and/or tunneling protocol, such as Secure Socket Layer (SSL) or Transport Layer Security (TLS), a real-time application data constructed to be transmitted via a lossy protocol, such as UDP, may be communicated via a lossless or reliable protocol such as a transport control protocol (TCP). The techniques of the present invention allow a lossy protocol, such as RTP over UDP, to be communicated via a lossless protocol such as TCP, while avoiding one or more of the lossless characteristics of the lossless protocol from being applied to the communication. In the illustrative embodiment of the present invention, this technique communicates a false acknowledgement of receipt of the lossless protocol network packet to the corresponding network stacks to prevent the lossless protocol from executing algorithms that provide for reliability of the protocol. Using this technique, the lossy protocol can be communicated over a lossless protocol, such as via TCP, SSL or via a tunneling protocol of a gateway, for example, to make the communication secure, and have the lossy protocol network packets get to the recipient on time rather than getting to the recipient reliably. In one embodiment, this technique can be used to securely communicate real-time data communications such as VoIP over SSL or TLS between peers or via a gateway.
The illustrative embodiments of the present invention also provide another technique of payload shifting that enables a packet constructed to be transmitted via a lossy protocol to be communicated via lossless protocol. A first computing device receives a first packet to be transmitted using an unreliable transport protocol, and creates a first TCP packet including a first payload of the received first packet. The first TCP packet is created with a TCP header having information associated with a TCP connection established between the first and a second computing device. The first TCP packet is transmitted to the second computing device. A second packet to be transmitted using an unreliable transport protocol is received by the first computing, which in turn creates a second TCP packet including the payload of the received second packet but with the TCP header information of the first TCP packet. The second TCP packet is transmitted to the second computing device before receiving an acknowledgement of the receipt of the first TCP packet from the second device. As such, the payload shifting technique communicates multiple unreliable transport protocol payloads under a TCP header until an acknowledgement of receipt is received.
In the illustrative embodiments of the present invention, the maximum transmission unit adjustment technique reduces the reported size of the maximum transmission unit (MTU) parameter of a network stack of a client to take into consideration the effect of the network packet size due to encryption of a payload. Encryption of the payload of a network packet increases the size of the network packet communicated to or by the client, and may cause a network packet to be fragmented. For example, a server may communicate to the client a network packet via an SSL gateway to the client. Although the server sends a network packet that should meet the MTU size the network stack of the client can handle, the encryption provided by the gateway increases the size of the network packet before it reaches the client. This may cause the network packet communicated from the server to the client via the gateway to be fragmented as the increased packet size from encryption may be too large for the MTU size of the client. The technique of the present invention adjusts the client's reported MTU size to report a smaller size to take in account for the overhead of the encryption. This technique reduces network fragmentation or otherwise prevents non-optimal fragmentation.
In the illustrative embodiments of the present invention, the prioritization technique provides for client-side and application-aware prioritization of network communications. That is, the remote access client of the present invention manages and controls network communication prioritizations on the client. The prioritizations are based on priorities of the application on the client. The remote access client transparently intercepts network communications associated with applications executing on the client, detects the network communication is associated with an application, and determines priorities for the network communications based on a priority for the application. For example, an application on the client may be communicating real-time data communications, such as VoIP, to a peer client or via a gateway. The remote access client may intercept a network packet, and detect, for example, the network packet contains real-time data or is from a VoIP application. The remote access client may indicate a priority for this network packet such that the network packet may be communicated ahead of non-real-time data communications or ahead of network communications from other applications. As such, the prioritization techniques of the present invention may improve or increase the performance, operational characteristics, and user experience on the client based on the applications running on the client.
In the illustrative embodiments of the present invention, the network disruption shielding technique provides a persistent and reliable connection of a client to a network, such as a peer-to-peer communication session or a connection to a gateway. For example, a mobile client, such as a laptop with a software based IP telephone, may connect to a network for VoIP communications. A temporary disruption in a network connection may occur when the mobile client roams between different access points in the same network, or when the client switches between networks (e.g., from a wired network to a wireless network). This disrupts the network service to the client and may drop the VoIP telephone call. Additionally, as the mobile client moves between access points, the mobile client may obtain a different IP network address, such as from a new Dynamic Host Configuration Protocol (DHCP) lease. This can also cause network connectivity and VoIP telephone communication disruption. The techniques of the present invention detects a disruption in the network and shields a portion of the network stack from the network disruption. The shielded portion of the network stack is maintained while the other portion of the network stack is reestablished and reconnected to the network. Once the network is available, the present invention continues with the client's network communications. In some embodiments, the network communications are queued during the network disruption and transmitted once the network is available. In other embodiments, such as for real-time data communications, network packets are dropped during the disruption to prevent the queuing of network packets that may cause latency in the real-time communication, such as VoIP telephone call.
Although the illustrative embodiments of the present invention may be generally described in connection with an internet protocol (IP) based protocol, such as a transport control protocol (TCP) or user datagram protocol (UDP), the techniques of the present invention may be used in any other types of networking environments with other networking protocols, such as any Internetwork Packet Exchange (IPX) protocol based networks using a Sequenced Packet Exchange (SPX) protocol. Also, although a lossy or unreliable protocol such as UDP and a lossless or reliable protocol such as TCP may be used for illustrating an embodiment of the present invention, any lossless/reliable and lossy/unreliable protocol as known to those ordinarily skilled in the art may be used in practicing the operations of the present invention described herein. Furthermore, although some of the illustrative embodiments of the present invention may be described below in relation to real-time data communications, such as VoIP, the techniques of the present invention may be applied for non-real-time data communications as one ordinarily skilled in the art will also recognize and appreciate.
Additionally, at times, the illustrative embodiments of the present invention may be described in regards to peer-to-peer communications. In one aspect, a peer-to-peer model comprises a type of network in which any computer can act as both a server by providing access to its resources to other computers, and can act as a client by accessing shared resources from other computers. Although in another aspect, a peer-to-peer model may not comprise a notion of a client and a server, a client and a server may provide peer-to-peer communications as well as client to client, server to server, or a client/server to a computing device such as a gateway. In an additional aspect, peer-to-peer communications comprises a process whereby computers can exchange information between each other directly without the assistance of a third party network or a device, such as a gateway. Although peer-to-peer communications may be generally described as direct communication between computers, there may be other network elements between the computing devices to facilitate the transmission and/or communication, such as for example, a network hub.
Furthermore, although the illustrative embodiments of the present invention may be described peer-to-peer, point-to-point, client to server, or otherwise, one ordinarily skilled in the art will recognize and appreciate that the present invention may be practiced between computing devices in any manner via any network topology, and that any reference to peer-to-peer, client/server, or otherwise is not intended to limit the present invention in any way.
In one aspect, the present invention is related to a remote access architecture having a remote access client for communicating to a network via a gateway or peer-to-peer to another remote access client or another computing device. The remote access architecture of the present invention provides systems and methods for securely communicating network traffic transmitted between a private network behind a gateway to a client on an external network, such as public network. The remote access architecture of the present invention enables separation of the client from the private network by providing network address translation (NAT) functionality on the gateway. A VPN gateway that uses Network Address Translation (NAT) provides masquerading of IP addresses of a client to shield the private network from direct layer-2 access by the client.
Referring now to
Each client 105a-105n includes a remote access client 120a-120c, which will be described in more details in connection with
The client 105 can be any type and/or form of computing device 102 that can run one or more applications 338 that access a network, such as network 104. The application 338 can be any type and/or form of application such as any type and/or form of web browser, web-based client, client-server application, a thin-client computing client, an ActiveX control, or a Java applet, or any other type and/or form of executable instructions capable of executing on client 105 or communicating via a network 104. The application 338 can use any type of protocol and it can be, for example, an HTTP client, an FTP client, an Oscar client, or a Telnet client. In some embodiments, the application 338 uses a remote display or presentation level protocol. In one embodiment, the application 338 is an ICA client, developed by Citrix Systems, Inc. of Fort Lauderdale, Fla. In other embodiments, the application 338 includes a Remote Desktop (RDP) client, developed by Microsoft Corporation of Redmond, Wash. In other embodiments, the application 338 comprises any type of software related to VoIP communications, such as a soft IP telephone. In further embodiments, the application 338 comprises any application related to real-time data communications, such as applications for streaming video and/or audio.
The clients 105a-105n may access any of the resources provided via computing devices 102d-102n which may be on the same network 104, or which may be on a separate network, such as a private network. In some embodiments, computing devices 102a-102n may be on a network disconnected and not routable from the network 104 of the clients 105a-105n. In one embodiment, any of the clients 105a-105n may communicate with a peer computing device 102d having a remote access client 102n and application 338d. For example, the application 338d may comprise a portion of a client/server or distributed application corresponding to any of the applications 338a-338c on clients 105a-105n. In some embodiments, any of the remote access clients 120a-120n may communicate with the remote access client 120n via the gateway 340.
In another embodiment, any of the clients 105a may communicate via the gateway 340 to a server 102e running an application 338e, which for example, may be an application server providing email services such as Microsoft Exchange manufactured by the Microsoft Corporation of Redmond, Wash., a web or Internet server, or a desktop sharing server, or a collaboration server. In some embodiments, any of the application 338e may comprise any type of hosted service, such as GoToMeeting.com provided by Citrix Systems, Inc. of Ft. Lauderdale, Fla., WebEx.com provided by WebEx, Inc. of Santa Clara, Calif., or LiveMeeting.com provided by Microsoft Corporation of Redmond, Wash.
In another embodiment, any of the clients 105a may communicate via the gateway 340 to a server farm 102n or server network, which is a logical group of one or more servers that are administered as a single entity. The server farm 102n may be running one or more applications 338N, such as an application 338f providing a thin-client computing or remote display presentation application. In one embodiment, the server 102e or server farm 102n executes as an application 338e-338n, any portion of the Citrix Access Suite™ by Citrix Systems, Inc., such as the MetaFrame or Citrix Presentation Server™, and/or any of the Microsoft Windows Terminal Services manufactured by the Microsoft Corporation.
Still referring to
In some embodiments, the gateway 340 may decrypt encrypted packets received from a client 105a-105c, and may encrypt packets communicated to a client 105a-105n. The gateway 340 may be used to protect a private network, such as network 104. In some embodiments, the gateway 340 associates a client 105a-105c with a private IP address or an IP address of the private network. In one of these embodiments, when the gateway 340 receives a packet from the client 105a-105c, the gateway 340 transforms the IP address of the packet to the IP address associated with the client 105a-105c for the private network. In some embodiments, the gateway 340 may apply access control policies to network traffic to and/or from a client 105a-105c. For example, access controls policies may be applied to a packet received from the client prior to routing the packet to a final destination.
In one embodiment of the gateway 340, once a frame enters the gateway 340 via an SSL tunnel, the packet and its payload are dispatched via callbacks into a handlers executing in user mode, which provide functionality for SSL decryption. In another embodiment, openSSL may be used. In other embodiments, a hardware accelerator is used. In a further embodiment, the gateway 340 comprises one or more blades for providing remote access. Once the packet is decrypted, it is injected into an HTTP network stack where headers are assembled and passed on to the remote access blade. In a remote access blade, a packet is classified by the type of data contained within the packet. In one embodiment, the packet contains an HTTP header requesting login and registration. In another embodiment, the packet seeks TCP/UDP/RAW/OTHER connection establishment. In still another embodiment, the packet contains connection-specific data. In yet another embodiment, the packet contains a special feature request such as collaboration with other users, fetching of user directory and presence or requesting telephony functionality such as conferencing and web cast. The remote access module dispatches the packet appropriately to the corresponding sub handler. For example, the client 105 may request that a connection be set up to a specific machine on the private network behind the gateway 340. The remote access module may consult with the access control module and if a positive response is returned, the remote access module may grant the request. In some embodiments, the remote access module 120 may grant the request by injecting subsequent frames on the private network using a frame forwarding module utilizing NAT/PAT to correlate incoming frames to corresponding SSL tunnels 341a-341n to a client 105a-105c.
The network 104 as illustrated in
In one embodiment of the present invention, the gateway 340 illustrated in
Referring now to
In brief overview of
The client 105 may also have a network stack 310, which may comprise one or more network layers, such as any networks layers of the Open Systems Interconnection (OSI) communications model as those skilled in the art will recognize and appreciate. The network stack 310 may comprise one or more protocols, such as the TCP/IP protocol over Ethernet or a wireless protocol, such as IEEE 802.11, as those skilled in the art will recognize and appreciate. Furthermore, the network stack 310 may include one or more network drivers supporting the one or more layers, such as a TCP driver or a network layer driver. The network drivers may be included as part of the operating system of the computing device 102 or as part of any network interface cards or other network access components of the computing device 102. Additionally, any of the network drivers of the network stack 310 may be customized, modified or adapted to provide a custom or modified portion of the network stack 310 in support of any of the techniques of the present invention described herein. Additionally, some portions of the network stack 310 may operate in kernel-mode 334 while other portions run in user-mode 332, such as an application layer of the network stack 310.
The filter 322 may include a packet capturing mechanism 365, and the filter 322 and/or packet capturing mechanism 365 may comprise a network driver, such as a network driver operating at any layer, or portion thereof, of a network stack 310 of the client 105. The filter 322 and/or the packet capture mechanism 365 may comprise a driver complying with the Network Driver Interface Specification (NDIS), or a NDIS driver. In another embodiment, the filter 322 and/or the packet capture mechanism 365 may comprise a min-filter or a mini-port driver. The packet capture mechanism 365 may also in some embodiments operate in kernel mode 334. Although the packet capture mechanism 365 is illustrated as part of the filter 322, the packet capture mechanism 365 may be separate from the filter 322. Additionally, the filter 322 and the packet capture mechanism 365 may operate at different layers, or portions thereof, of a network stack of the client 105.
The filter 322 may use a filter table for filtering packets. The filtering table is used to determine what action to take against packets, such as packets intercepted by the packet capture mechanism 365. The filter 322 can inspect the contents of the packets, such as routing information, to determine the action to take based on the filtering table. In some embodiments, the filter 322 may drop or accept the network packets depending on their content. In other embodiments, the filter 322 may route the network packets to the agent 326 based on the packets content and/or the filtering table. The filter table may also be used to ensure that unwanted packets are discarded. The filter 322 may be used to deny access to particular protocols or to prevent unauthorized access from remote computers by discarding packets to specified destination addresses.
In some embodiments, the filtering table includes information about a private network. In other embodiments, a filter 322 on a client computing device 102 receives the filtering table. In one of these embodiments, the filter 322 receives the filtering table from an application 338 or an agent 326 on the computing device 102. In another of these embodiments, the filter 322 receives configuration settings from the agent 326 and stores the configuration settings in a filtering table.
The packet capture mechanism 365 may intercept any of the network traffic of the client 105, such as network packets associated with the application 338. In some embodiments, the packet capture mechanism 365 intercepts network traffic transparently to the application 338, the agent 326, the gateway 340, or to any portion of the network stack 310 of the client 105, such as any other driver or layer operating at a layer above or below the layer the packet capture mechanism 365 operates. In this manner, the present invention can be used with and support any of the techniques described herein and for any application and any protocol used by the application. In one embodiment, the packet capture mechanism 365 intercepts outbound packet traffic, such as any network traffic communicated via network 104 and/or gateway 340. The packet capture mechanism 365 may forward the packets to the agent 325 or a frame monitor mechanism 360 of the agent 326. In some embodiments, the filter 322 communicates with the agent 326 via asynchronous I/O control messages. In one of these embodiments, the packet capture mechanism 365 may forward packets addressed to a private network behind a gateway 340 via asynchronous I/O control messages. In other embodiments, the filter 322 communicates with the agent 326 running in the user space 334 via UDP packets. In one embodiment, the filter 322 receives configuration settings from the agent 326 driver via asynchronous I/O control messages. The configuration settings may include information regarding which networks, protocols, or types of packets to filter. In one embodiment, the filter 322 stores the configuration settings in a filtering table. In another embodiment, the filter 322 receives a filtering table including the configuration settings.
In one embodiment, the filter 322 intercepts all outbound packets of the client 105 for inspection. For example, in some embodiments, the filter intercepts a packet generated by an application 338 executing in user-mode 332 for transmission by the client 105. If the packet satisfies a condition listed in the filtering table, the filter 322 may transmit the packet to the agent 326 and not to the original destination of the packet. The filter 322 may use an asynchronous I/O control message to forward the packet to the agent 326. The filter 322 may transmit the packet to the agent 326 in accordance with or responsive to a routing table.
In some embodiments, the agent 326 and the filter 322 communicate via an IOCTL application programming interface (API), such as any IOCTL libraries and function calls provided by the Microsoft Windows family of operating systems. In other embodiments, the IOCTL based interface between the agent 326 and the filter 322 may be provided by any portion of the operating system running on the client 105. Although discussed in terms of I/O control message and the IOCTL interface, the agent 326 and the filter 322 may communicate via any suitable mechanism and/or means.
The kernel 334 of client 105 may include an NDIS interface. In some embodiments, the NDIS interface includes a plurality of intermediate filters. In one embodiment, a packet passes through the NDIS interface and may be inspected by the plurality of intermediate filters. Although the filter 322 may be provided as an NDIS driver, the filter 322 may also be a process or other set or type of executable instructions executing in the kernel 334.
The agent 326 of the present invention may execute in the application space 332 or user-mode on the client 105. In other embodiments, the agent 326 operates in kernel-mode 334. In some embodiments, the agent 326 provides functionality for receiving packets from the filter 322. In other embodiments, the agent 326 provides functionality for applying a policy to a received packet. In still other embodiments, the agent 326 provides functionality for managing an SSL tunnel to the gateway 340. In yet other embodiments, the agent 326 provides functionality for encrypting and transmitting a packet to the gateway 340. The agent 326 may include frame monitor mechanism 360. The frame monitor 360 may include policies and logic for applying a policy to a received packet. The agent 326 may transmit a packet to a gateway 340 responsive to a policy-based determination made by the frame monitor 360.
In some embodiments, the frame monitor 360 may apply a policy to determine a condition of the client 105, or endpoint, at the time of transmission of the packet. In other embodiments, the frame monitor 360 may identify an application 338 that generated the packet. In some of these embodiments, the frame monitor 360 may make a policy-based determination to transmit the packet to the gateway 340 responsive to the identified application 338. In another embodiment, the frame monitor 360 may perform a checksum on the packet to verify that the identified application actually generated the packet.
In other embodiments, the packet capture mechanism 365 may be included in the agent 326 instead of or in addition to the filter 322. As such, the agent 326 may intercept network traffic. The packet capture mechanism 365 may use any hooking application programming interface (API) to intercept, hook, or otherwise obtain inbound and/or outbound packets of the client 105, such as the network traffic associated with application 338.
In one embodiment, a TCP connection is initiated by an application 338 executing on the client 105 for transmission of IP packets to a target computing device, such as computing device 102c of
In one embodiment, upon receipt of the captured IP packets, the gateway 340 may create a third TCP connection between the gateway 340 and the targeted computing device 102d, such as in
In one embodiment, the present invention provides a method for securing a packet transmitted from a private, secured network behind a gateway 340 to a client 105 on an external network 104. The invention enables separation of the client 105 from the private network by providing network address translation (NAT) functionality on the gateway 340. A VPN gateway that uses NAT provides masquerading of IP addresses of a client 105 to shield the private network from direct layer-2 access by the client 105.
In one aspect, any portion of the remote access client 120, such as the agent 326, frame monitor 360, the filter 322, and packet capture mechanism 365, or any portion thereof may comprise software, hardware, such as an ASIC or an FPGA, or any combination of software and/or hardware. In some embodiments, portions of the remote access client 120 may be provided via one or more blades on the client 105.
Although the remote access client 120 is illustrated with multiple components, such as an agent 326 and a filter 322, one ordinarily skilled in the art will recognize and appreciate that the operations and functionality of the remote access client 120 described herein may be practiced in a single mechanism or single component. For example, in some embodiments, the operations and functionality of the remote access client 120 may be included within an application 338. In one embodiment for example, the functionality and operations of the remote access client 120 may be provided just as an agent 326, and in another embodiment, just as a network driver, such as the filter 322.
In some embodiments, the remote access client 120, or any portion thereof, such as the agent 326, frame monitor 360, the filter 322, and packet capture mechanism 365 may comprise an application, module, service, computer program, software component, web service, web component, library, function, process, task, thread, or any other type and/or form of executable instruction which is designed to and capable of executing the functionality of the present invention as described herein, and which may operate in any portion or combination of user-mode 332 and/or kernel-mode 334.
As illustrated in
In the illustrative embodiments of
The central processing unit 102 is any logic circuitry that responds to and processes instructions fetched from the main memory unit 104. In many embodiments, the central processing unit is provided by a microprocessor unit, such as: the 8088, the 80286, the 80386, the 80486, the Pentium, Pentium Pro, the Pentium II, the Celeron, or the Xeon processor, all of which are manufactured by Intel Corporation of Mountain View, Calif.; the 68000, the 68010, the 68020, the 68030, the 68040, the PowerPC 601, the PowerPC604, the PowerPC604e, the MPC603e, the MPC603ei, the MPC603ev, the MPC603r, the MPC603p, the MPC740, the MPC745, the MPC750, the MPC755, the MPC7400, the MPC7410, the MPC7441, the MPC7445, the MPC7447, the MPC7450, the MPC7451, the MPC7455, or the MPC7457 processor, all of which are manufactured by Motorola Corporation of Schaumburg, Ill.; the Crusoe™5800, the Crusoe™5600, the Crusoe™5500, the Crusoe™5400, the Efficeon™8600, the Efficeon™8300, or the Efficeon™8620 processor, manufactured by Transmeta Corporation of Santa Clara, Calif.; the RS/6000 processor, the RS64, the RS 64 II, the P2SC, the POWER3, the RS64 III, the POWER3-II, the RS 64 IV, the POWER4, the POWER4+, the POWER5, or the POWER6 processor, all of which are manufactured by International Business Machines of White Plains, N.Y.; or the AMD Opteron, the AMD Athlon 64 FX, the AMD Athlon, or the AMD Duron processor, manufactured by Advanced Micro Devices of Sunnyvale, Calif. The computing device 102 may be based on any of the above described processors, or any other processor capable of operating as described herein.
Main memory unit 104 may be one or more memory chips capable of storing data and allowing any storage location to be directly accessed by the microprocessor 100, such as Static random access memory (SRAM), Burst SRAM or SynchBurst SRAM (BSRAM), Dynamic random access memory (DRAM), Fast Page Mode DRAM (FPM DRAM), Enhanced DRAM (EDRAM), Extended Data Output RAM (EDO RAM), Extended Data Output DRAM (EDO DRAM), Burst Extended Data Output DRAM (BEDO DRAM), Enhanced DRAM (EDRAM), synchronous DRAM (SDRAM), JEDEC SRAM, PC100 SDRAM, Double Data Rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), SyncLink DRAM (SLDRAM), Direct Rambus DRAM (DRDRAM), or Ferroelectric RAM (FRAM). The main memory 104 may be based on any of the above described memory chips, or any other available memory chips capable of operating as described herein. In the embodiment shown in
In the embodiment shown in
The computing device 102 may support any suitable installation device 116, such as a floppy disk drive for receiving floppy disks such as 3.5-inch, 5.25-inch disks or ZIP disks, a CD-ROM drive, a CD-R/RW drive, a DVD-ROM drive, tape drives of various formats, USB device, hard-drive or any other device suitable for installing software and programs such as the remote access client software 120 related to the present invention.
The computing device 102 may further comprise a storage device 128, such as one or more hard disk drives or redundant arrays of independent disks, for storing an operating system and other related software, and for storing application software programs such as any program related to the remote access client 120 of the present invention. Optionally, any of the installation devices 118 could also be used as the storage device 128. Additionally, the operating system and the proxy software 120 can be run from a bootable medium, for example, a bootable CD, such as KNOPPIX®, a bootable CD for GNU/Linux that is available as a GNU/Linux distribution from knoppix.net.
Furthermore, the computing device 102 may include a network interface 118 to interface to a Local Area Network (LAN), Wide Area Network (WAN) or the Internet through a variety of connections including, but not limited to, standard telephone lines, LAN or WAN links (e.g., 802.11, T1, T3, 56 kb, X.25), broadband connections (e.g., ISDN, Frame Relay, ATM), wireless connections, or some combination of any or all of the above. The network interface 118 may comprise a built-in network adapter, network interface card, PCMCIA network card, card bus network adapter, wireless network adapter, USB network adapter, modem or any other device suitable for interfacing the computing device 102 to any type of network capable of communication and performing the operations described herein.
A wide variety of I/O devices 130a-130n may be present in the computing device 102. Input devices include keyboards, mice, trackpads, trackballs, microphones, and drawing tablets. Output devices include video displays, speakers, inkjet printers, laser printers, and dye-sublimation printers. The I/O devices may be controlled by an I/O controller 123 as shown in
In further embodiments, an I/O device 130 may be a bridge 170 between the system bus 150 and an external communication bus, such as a USB bus, an Apple Desktop Bus, an RS-232 serial connection, a SCSI bus, a FireWire bus, a FireWire 800 bus, an Ethernet bus, an AppleTalk bus, a Gigabit Ethernet bus, an Asynchronous Transfer Mode bus, a HIPPI bus, a Super HIPPI bus, a SerialPlus bus, a SCI/LAMP bus, a FibreChannel bus, or a Serial Attached small computer system interface bus.
A computing device 102 of the sort depicted in
In other embodiments, the computing device 102 may have different processors, operating systems, and input devices consistent with the device. For example, in one embodiment the computer 102 is a Zire 71 personal digital assistant manufactured by Palm, Inc. In this embodiment, the Zire 71 operated under the control of the PalmOS operating system and includes a stylus input device as well as a five-way navigator device.
Moreover, the computing device 102 can be any workstation, desktop computer, laptop or notebook computer, server, handheld computer, mobile telephone, any other computer, or other form of computing or telecommunications device that is capable of communication and that has sufficient processor power and memory capacity to perform the operations described herein.
In one aspect, the present invention is related to providing various techniques for optimizing communications between computing devices, such as depicted in any of the illustrative environments
In one aspect, the present invention is related to providing a peer-to-peer route optimization technique between a first computing device accessing a second computing device via a gateway, such as the gateway 340 illustrated in
In one embodiment, the server 102 comprises a signaling server, which may provide any type and/or form of signaling services for establishing a communication session between computing devices, such as a first computing device 102a and a second computing device 102b. In one embodiment, the server 102c supports a Session Initiation Protocol, SIP, which is an Internet Engineering Task Force (IETF) standard protocol for initiating an interactive user session that involves multimedia elements such as video, voice, chat, gaming, and virtual reality. In one embodiment, SIP works in the application layer of the Open Systems Interconnection (OSI) communications model. In some embodiments, the first computing device 102a initiates a session via signaling, such as via the SIP protocol, to the signaling server 102c via signaling path 220. In one embodiment, the signaling server 102c in conjunction with the gateway 340 is used for establishing a media path 225 between the first computing device 102a and the second computing device 102b, such as for a VoIP telecommunication session between telephones 210a and 210b.
The first computing device 102a of environment 200 may be part of a network, private or public, accessing the gateway 340 via network 104 over the connection 341a and traversing the firewall 205a. The firewall 205a provides access to and traversal of a public network, and has assigned the IP address of 24.24.24.100. The first computing device 102a may be in communication with, or interfaced or coupled to a telecommunication device 210a, such as a VoIP communication device, or any other real-time data communication device. The second computing device 102b may be part of a private network and have assigned the IP address of 192.168.20.20. Additionally, the second computing device 102b may include a software based telecommunication device 210b, such as software-based VoIP telecommunication device or program. The second computing device 102b may access the gateway 340 via network 104 over connection 341b and traversing firewall 205b having a public network IP address of 216.216.10.10. The firewalls 205a and 205b may be any type and/or form of firewall as known to those ordinarily skilled in the art, such as a NAT firewall.
The first computing device 102a and second computing device 102b of
In brief overview of illustrative method 260, at step 262, the computing devices 102a and 102b establish tunneling sessions with the gateway 340. At step 264, the first computing device 102a initiates a session to second computing device 102b via gateway 340 using signaling protocol via the signaling path 220 to signaling server 102b. The session may be initiated by the telecommunication device 102a in communication with the first computing device 102a. At step 266, a signaling server 102c sets up the telecommunication session, and at step 268, provides the first computing device 102a with a first network identifier of the second computing device 102b. The first network identifier comprises the network address, such as a host name or IP address, of the second computing device 102b based on its IP address established via the tunnel 341b with the gateway 340. At step 270, the first computing device 102a communicates to the second computing device 102b using the first network identifier to establish a connection or communication session.
In further overview, at step 272, the gateway 340 intercepts the communications by the first computing device 102a and provides the first computing device 102a a second network identifier for the second computing device 102b. The second network identifier comprises an IP address or host name of the second computing device 102a directly or publicly accessible by the first computing device 102a, such as the last known public IP address of the second computing device 102b. At step 274, in one embodiment, the gateway 340 communicates to the second computing device 102b to request the second computing device 102b establish a swimmer session for first computing device 102a to connect to the second computing device 102b via firewall 205b. In some embodiments, the gateway 340, at step 276, may negotiate or otherwise provide encryptions keys for the first computing device 102a and second computing device 102b. At step 278, the first computing device 102a establishes a direct connection, communication session, or media path 225 to the second computing device 102b. In other embodiments, at step 280, the first computing device 102a and/or second computing device 102b match encryption keys received by the other computing device before allowing communications.
In some embodiments of illustrative step 262, the computing device 102a and 102b may establish a connection with the gateway 340 by any suitable means and/or mechanisms, such as by any type and/or form of tunneling or gateway protocol. In some embodiments, the connections 341a and 341b to the gateway 340 may form a virtual private network connection, and in other embodiments, may use SSL or TLS to provide secure communications to the private network, such as the private network identified by the IP range 10.10.10.XXX in illustrative
At illustrative step 264, in one embodiment, the telecommunication device 210a, such as a hard IP phone, initiates a telecommunication session, such as a telephone call, to the telecommunication device 210b, such as a soft IP phone. In some embodiments, the telecommunication device 210a initiates the telephone call by indicating the extension of the telecommunication device 210b. When the telecommunication device 210a initiates the telecommunication session, this initiation, indication, or request to establish a telecommunication session or media session may be sent to the signaling server 102a via SIP protocol, a proprietary signaling protocol, or any other type of protocol suitable for signaling. The signals are communicated via signaling path 220 via the tunneling session 341a to the gateway 230 and reach the signaling server 102c via the intranet routes of the private network behind the gateway 340.
Although the illustrative embodiment of method 260 is discussed in view of VoIP or telecommunication signaling and sessions, one ordinarily skilled in the art will recognize and appreciate that the present invention may be used for initiating any type and/or form of communication session, real-time or otherwise, such as an interactive user session that involves multimedia elements such as video, voice, chat, gaming, and virtual reality. As such, the telecommunication devices 210a-210b, signaling/signal path 220, and signaling server 120a may accordingly and suitably comprise the type and/or form of device, signaling, protocols, and communications corresponding to the type and/or form of communication session.
In some embodiments of illustrative step 266, the signal server 102c may set up, negotiate, or establish any type and/or form of communication session, and in one embodiment the signaling server 102c sets up a telecommunication session, such as the VoIP telephone call initiated by the telecommunication device 210a. When setting up the telecommunication or other media session, the signaling server 102c, at step 270, instructs, requests, signals or otherwise communicates to the initiating telecommunication device 210a and/or first computing device 102a to contact, signal, connect, or otherwise communicate to the peer telecommunication device 210b via a certain network address. In some embodiments, the network address provided by the signaling server 102c to the initiating telecommunication device 210a comprises the network address for the computing device 102b on the private network, i.e., 10.10.10.XXX, behind the gateway 340. In one embodiment, the network address for the peer telecommunication device 210b may comprise an enterprise private network address.
At this point, instead of contacting the peer telecommunication device 210b via its VPN private IP address, the illustrative method of 260, via the remote access client 120 facilities the telecommunication device 210a and/or the first computing device 102a to directly contact the peer or target telecommunication device 210b or the second computing device 102b. The techniques of the present invention is not specific to any VoIP protocol, and may be applied to any other protocols, such as any peer-to-peer protocol between computing devices. The techniques of the present invention makes decisions by way of the IP address of the resource a client is trying to connect with.
At step 270, when the telecommunication device 210a initiates a data connection to the telecommunication device 210b with the first network address provided by the signaling server 120c at step 268, such as the VPN private IP address of the soft IP phone, the gateway 340 intercepts the communication to provide the telecommunication device 210 and/or first computing device 102b with a second network address for contacting the telecommunication device 210b. In one embodiment, the gateway 340 intervenes and sends an out of band signal over the same established VPN tunnel 341a to the first computing device 102a that is facilitating traffic for the hard IP phone 210a. One ordinarily skilled in the art will recognize and appreciate that the gateway 340 may communicate to the telecommunication device 210 and/or computing device 102a that network address for contacting the computing device 102b and/or telecommunication device 210b directly by any suitable means and/or mechanisms. For example, the gateway 340 may communicate the second network address to the first computing device 102a via a second tunneling session.
In some embodiments, the gateway indicates to the first computing device 102a of the last known public IP address that the second computing device 102b which is running the soft IP phone 210b used to contact the gateway 340. In other embodiments, this public IP may not be the actual IP address of the second computing device but may be the IP address of the firewall 205b that the second computing device 102b is behind. If the computing device 210a contacts the public IP address of the firewall 205b directly, packets may be rejected by the firewall 205b. In these embodiments, the gateway 340 instructs the computing device 102b to establish what is known to those skilled in art as a swimmer session to the first computing device 102a. A forward hole is punched in the firewall 205b via which the first computing device 102a can traverse or get back in. In other embodiments, any suitable means and/or mechanism may be used to allow the first computing device 102a to traverse the firewall 205b to connect and communicate with the second computing device 102b.
Although illustrative method 260 is discussed in conjunction with environment 200 of
In some embodiments, the gateway 340, at step 276, may negotiate a secret key between the computing devices 102a-103b for secure communications. The remote access client 120 on the computing devices 102a-102b may use this key for secure and encrypted communicates, and/or to authenticate or authorize the other computing device. In other embodiments, to ensure that malicious computing devices do not take advantage of this open hole, the gateway 340 at step 276 negotiates a secret key between the two computing devices 102a and 102b and the respective remote access clients 120 ensure that the keys match before allowing data communication. For example, in the embodiment of establishing a swimmer session, this key ensures that the packets coming in the open hole are from the computing device that the swimmer session was meant for.
In other embodiments, the gateway 340 does not perform step 276 to provide a secure mechanism of peer-to-peer communication sessions between the computing devices 102a-102b. For example, the computing devices 102a-102b may be in the same private enterprise network and therefore, may be trusted. In further embodiments, instead of the gateway 340 negotiating a secret key, the computing devices 102a-102b use any suitable means and/or mechanism for authenticating and/or authorizing the other computing device for peer-to-peer communications. In some embodiments, the computing devices 102a-102b may authenticate and/or authorize via the gateway tunneling sessions, such as via path 341a, or at step 280, via the media path 225 established at step 278. For example, the remote access clients 120 of each computing device 102a-102b may check for matching keys over established media path 225 before allowing any data to be communication over the connection 225.
At step 278, the direct media path 224 for any type and/or form of communications is established between the computing devices 102a-102b without traversing the gateway 340, and, in some embodiments, not using the respective VPN assigned IP addresses of the computing devices 102a-102b but instead their public IP address or the IP address assigned to them by their resident network. Using the techniques of the present invention, the respective remote access client 120 of computing devices 102a-102b act as temporary peer-to-peer SSL gateways to each other, decrypting each other's SSL session directly without communicating via the gateway 340. The direct peer-to-peer communication session via path 225 avoids the extra-hop via the gateway 340. This will reduce any latency due to taking a longer route via the gateway 340, and will improve the quality, performance, and experience of real-time data communications, such as the VoIP communications illustrated in
In some embodiments, the gateway 340 may be configured to automatically perform the techniques of illustrative method 260 every time a computing device 102 is trying to establish a peer-to-peer communication session or otherwise access a resource via the gateway 340. In other embodiments, the gateway 340 may be configured to automatically perform the techniques of the illustrative method 260 only for a certain IP address range either for a source IP address, a destination IP address, or any combinations thereof. In further embodiments, the gateway 340 may perform this technique based on the type of application and/or resource being accessed via the gateway 340. For example, in one embodiment, the gateway 340 may automatically perform this technique for any type of desktop or screen sharing application sharing screen data via the gateway 340. In other embodiments, the gateway 340 may determine to perform this technique based on any type and/or form of business rules, access control policies, or other configuration, algorithm, and statistics. For example, the gateway 340 may perform this technique based on ping-based timing statistics between peer computing devices. If the peer computing devices are closer to each other than the gateway 340, the gateway performs the peer-to-peer routing technique. One ordinarily skilled in the art will recognize and appreciate the various ways the gateway of the present invention may be adapted or otherwise configured to perform the peer-to-peer routing technique of the present invention.
In one aspect, the present invention is related to allowing communications via a lossless protocol packets constructed for transmission via a lossy protocol. In one technique illustrated in
The illustrative method 360 of the embodiment of the present invention for practicing the false acknowledgement technique will be discussed in view of the illustrative environment 300 of
Client 105a may comprise a first network stack 310a, and the client 105 or gateway 340 may comprise a second network stack 310b. The network stacks 3201a-310a may comprise one or more network layers, such as any networks layers of Open Systems Interconnection (OSI) communications model. For example, as illustrated in
Additionally, the networks stacks 310a-310b may comprise an SSL 341a-341b layer for supporting SSL or SSL VPN communications. For example, the SSL layer 341a-341b may be used for a gateway or tunneling session between remote access clients 120 or between a remote access client 120 and a gateway 340. As illustrated in
The network stacks 310a-310b also include a shim 322a-322b of the remote access client 120 of the present invention. The shim 322a-322b may comprise any portion of the remote access client 120, and in some embodiments, comprises a network driver, network driver interface, or other network layer related mechanism for providing the false acknowledgement technique of the present invention as described herein. The shim 322a-322b may comprise software, hardware, or any combination of software and hardware. In one embodiment, the shim 322a-322b may operate at the IP layer of the network stack prior to a network packet reaching the TCP layer 343a. In other embodiments, the shim 322a-322b may operate at the TCP layer 343a-343b. One ordinarily skilled in the art will recognize and appreciate that the shim 322a-322b may operate in any manner associated with the layer of operations of the lossless protocol in the network stack 310a-310b, including in or adjacent to the layer of the lossless protocol.
The false acknowledgement technique of the present invention as illustrated by method 360 of
In brief overview of illustrative method 360, at step 365, the computing devices 102a and 102b or the gateway 340 establish a lossless protocol based connection, such as a TCP connection, by which lossless protocol packets are communicated. At step 370, the remote access client 120 of the present invention may detect that the payload of a lossless protocol packet comprises a lossy protocol, such as RTP or UDP, or otherwise comprises real-time data. In one embodiment, at step 375, the illustrative method 360 may encrypt the payload with a key, such as a key provided via an out of band TLS or SSL session of step 367. At step 380, a false acknowledgement of receipt of the lossless protocol packet may be communicated or otherwise provided to the network stacks 310a-310b, such as by the shim 322a-322b. In response to the receipt of the false acknowledgement of receipt of the lossless protocol packet, at step 385, the respective network stacks 310a-310b do not execute one or more, or all of the algorithms and operations that provide the reliable or lossless characteristics of the lossless protocol. At step 390, the lossless protocol packet with the lossy protocol payload is communicated between the network stacks 310a-310b.
At step 365 of illustrative method 360, the lossless protocol connection may be established via any suitable means and/or mechanisms using an type and/or form of lossless protocol. In one embodiment, the network stack 310a of a client 105a establishes a lossless protocol connection, such as TCP, to a peer client 105a having network stack 310b. In another embodiment, the network stack 310a of client 105a establishes a lossless protocol connection to a gateway 340 having network stack 310b. Additionally, the lossless protocol connection of step 365 may be established in a secured manner, such as SSL, or as a virtual private connection. Although the network stacks 310a-310b are illustrated as having the same network layers, one ordinarily skilled in the art will recognize and appreciate that the network stacks may have corresponding layers, which may be of different versions or associated with different operating systems and/or drivers, and that each network stack 310a-310b may have additional layers, less layers or different layers.
At illustrative step 360, in one embodiment, the remote access client 120 intercepts a network packet, such as via the packet capture mechanism 365, and inspects the network packet by any suitable means and/or mechanisms to determine the type of the protocol used in the payload of the network packet, or the type of contents in the payload of the network packet. In some embodiments, the shim 322a-322b of the remote access client 120 may be used for intercepting and inspecting the network packet. In one embodiment, the remote access client 120 may intercept a network packet and determine if the network packet comprises any lossless protocol or a specific lossless protocol, such as TCP. If the network packet is a lossless protocol, the remote access client 120 checks the payload to determine the type of protocol and/or the type of data. In one embodiment, the remote access client 120 may determine by any suitable fields of the payload of the network packet, such as any portion of header of the lossy protocol representing the payload, that the payload has a lossy protocol content. In another embodiment, the remote access client 120 may determine by any data of the payload, if the payload comprises a lossy protocol or comprises real-time data.
In one embodiment, the remote access client 120 determines that a TCP packet comprises a payload of RTP or UDP, and applies an encryption of the payload. The remote access client 120 may encrypt the payload of the network packet using any type and/or form of encryption with a key provided in any suitable manner. In some embodiments, the key or cipher is negotiated via an out of band TLS session between the clients 105a-105b or the client 105a and gateway as shown in
At step 380 of illustrative method 360 of the present invention, a false acknowledgment of receipt of the network packet, e.g., the lossless protocol packet, is issued, communicated, or otherwise provided to the network stacks 310a-310b comprising the respective sending and receiving computing devices 102a-120b, or gateway 340. The shim 322a-322b, any portion of the remote access client 120, or any portion of the network stack 310a-310b may issue the false acknowledgment of receipt of the network packet. In one aspect, the false acknowledgement of receipt of the network packet is false in the sense that it is communicated not to acknowledge the actual receipt of a network packet but in order to prevent the lossless and reliable mechanisms of the lossless protocol associated with the network stacks 310a-310b. As such, the false acknowledgement of receipt of the network packet may comprise the same form and/or type as an actual acknowledgement of receipt of the network packet.
In some embodiments, the false acknowledgement of receipt is issued to the network stacks 310a-310b prior to communicating the network packet or packets. In other embodiments, the false acknowledgement of receipt is issued after communicating the network packet(s) but at a time or in a manner such as to prevent the lossless protocol mechanisms of the receiving network stack 310a-310b from being applied to the transmitted network packet. In one embodiment, the false acknowledgment of receipt of the network packet is issued for each network packet, and in another embodiment, may be issued once per communication session or lossless protocol connection. Furthermore, one ordinarily skilled in the art will recognize and appreciate the false acknowledgement of receipt may be performed in different places in the network stack 310a-310b for different operating systems. For example, in one embodiment, the acknowledgement of receipt may be issued at the Network Driver Interface Specification (NDIS) driver level in the Microsoft Family of Windows Operating Systems.
At step 385 of illustrative method 360, the network stack 310a-310b receiving the false acknowledgment of receipt of the network packet from step 380 may in response to such receipt, may not execute, stop executing, or prevent from executing any one or more algorithms and operations providing one or more lossless characteristics of the lossless protocol. For example, in the embodiment of TCP as the lossless protocol, the network stack 310a-310b may not execute any one or more of the following with respect to the network packet, or the TCP connection: packet ordering, packet retransmission, a flow control algorithm, a sliding window algorithm, and/or a nagle's algorithm. In some embodiments, the false acknowledgment of receipt must be received on a packet by packet basis to prevent the lossless layer of the network stack 310a-310b from employing reliability algorithms. As such, the sending network stack 310a-310b can determine on a packet by packet basis which packets to apply the false acknowledgment techniques of the present invention to. There may be some lossless protocol network packets comprising the lossy protocol for which the reliability algorithms of the lossless protocol should be applied. In other embodiments, the false acknowledgment of receipt of the network packet may be received once for the lossless protocol connection to prevent employing reliability algorithms for any subsequent packets received during the lossless protocol session or connection.
At step 390, the illustrative method 360 communicates the lossless protocol packet having the lossless protocol payload via the network stacks 310a-310b. In one embodiment, the lossless protocol packet is communicated after step 385, or in other embodiments, before step 385. So, although the lossless protocol packet becomes lost in the network, no attempt is made to reclaim the packet as one would expect for a lossy protocol packet.
Although the illustrative embodiment of method 360 is discussed using a false acknowledgment of receipt of the network packet such as in TCP, any type and/or form of indication, request, or instruction may be communicated to the network stacks 310a-310b to prevent employing any reliability or lossless algorithms of the lossless protocol. In some embodiments, the lossless protocol layer of the network stack 310a-310b may be adapted or configured to have a configuration, flag, or instruction to not use the reliability algorithms either on a packet by packet basis, or a session or connection basis. For example, the lossless protocol may have fields, such in a header of a lossless protocol packet, that indicates whether reliability should be discarded or avoided for the packet.
Referring now to
Still referring to
At step 350, the first device 105 creates a first TCP packet including a first payload of the received first packet and a first TCP header of information associated with a TCP connection established between the first device 105 and a second device. For example, the TCP connection may be established between the client 105 and a peer computing device 102b in one embodiment, and between the client 105 and the gateway 340 in another embodiment. In some embodiments, the first device 105 indicates that the TCP packet contains a payload of packets constructed to be transmitted via a lossy protocol by opening a specific TCP port. In other embodiments, the first device 105 indicates that the TCP packet contains a payload of packets constructed to be transmitted via a lossy protocol by setting a flag in the TCP header. The TCP header may include information regarding the source node, information regarding the destination node, or a sequence number particularly identifying the TCP packet.
At step 352, the first device 105 transmits the first TCP packet to the second device. In some embodiments, the second device may be a gateway 340. In other embodiments, the second device is a “peer” computing device 102b. The first TCP packet may be encrypted before transmission to the second device using, for example, SSL or TLS.
At step 354, the first device 105 receives a second packet to be transmitted using an unreliable transport protocol, such as UDP. The second packet may be received from the same application 338 that generated the first packet. At step 356, the first device 105 creates a second TCP packet including a second payload of the received second packet and the first TCP header information, as described above. At step 358, the first device 105 then transmits, before receipt of an acknowledgement of the receipt of the first payload from the second device, the second TCP packet to the second device. In some embodiments, when an acknowledgment is received from the second device, the first device 105 updates the TCP header information before transmitting the packet. In other embodiments, the first device 105 creates a third TCP packet with updated TCP header information and having the second payload. The first device then transmits the third TCP packet.
Upon receipt of the TCP packet, the second device decrypts it, if necessary, and determines that the payload is one or more packets constructed to be transmitted using a lossy protocol. The second device may determine this based on the port on which the packet was received or by a flag in the TCP header information. Once determined, the second device strips the TCP header from the payload and delivers the payload.
In another aspect, the present invention is related to adjusting the reported maximum transmission unit (MTU) parameter to optimize network communications by reducing packet fragmentation for encrypted network packets. This technique may be applied on one or both network stacks 310a-310b of illustrative environment 300 of
Still referring to
Referring now to
Using this technique, any device on the network 104 may communicate network packets to the network stack 310a-310b according to the decreased MTU size that can be encrypted along the route to the network stack 310a-310b and not be fragmented. If the network packet is encrypted it should still fit in the actual MTU size of the physical network layer medium, such as Ethernet. For example, the MTU parameter 402a-402b may be set to the default MTU size of 1,500 for Ethernet and in accordance with the illustrative method 400 decreased by a determined number of bytes, for example 100, to account for encryption overhead. A network packet may be transmitted from a server resource to the client comprising a size equal to the reported MTU 402a-402b size of 1,400. The network packet may traverse the gateway 340 and get encrypted via the SSL tunnel, which in turns increases the network packet size to 1,475. Since this size fits into the MTU size of the Ethernet physical medium, the network packet will not be fragmented.
At step 405 of illustrative method 400, any type and/or form of communication session between a first computing device 102a and a second computing device 102b, such as client 105b or gateway 340 of
In some embodiments of step 410, the remote access client 120 detects a network packet having an encrypted payload. In one embodiment, the packet capture mechanism 365 intercepts network packets and the agent 326 determines if the packet is encrypted. However, any other portion of the remote access client 120, such as the filter 322 or frame monitor 360 may determine if the packet is encrypted. In one embodiment, the entire payload of the network packet is encrypted, while in other embodiments, a portion of the payload is encrypted. The present invention may use any type and/or form of means or mechanism for determining if a packet has encryption. For example, in some cases, the remote access client 120 may check for a flag or field of the network packet indicating the payload is encrypted. In other embodiments, the remote access client 120 may check whether any portion of the payload is unintelligible, because it contains random data or noise from encryption. Additionally, the encrypted payload may be encrypted in association with any layer of the network stack 310a-310b, such as layer 2, 3, 6 or 7 encryption.
In some embodiments of step 415, the illustrative method 400 of the present invention determines the adjustment to the reported MTU 402a-402b size on a packet by packet basis, or in other embodiments, on a connection or session basis, and at step 420 adjusts the MTU 402a-402b accordingly. In one embodiment, the MTU 402a-402b is decreased exactly by the amount of encryption overhead for the network packet. In some cases, the illustrative method 400 determines the MTU 402a-402b size adjustment once for the entire session or connection and decreases the size of the MTU 402a-402b to a value to account for encryption overhead for the entire session. For example, although network packets may have varying encryption overhead, the adjustment accounts for the largest encryption overhead. In further embodiments, the MTU 402a-402b may be adjusted to take into consideration encryption that may occur when the network packet leaves the network stack 310a-310b, such as encryption by a gateway 340 that may occur in the end-to-end network traversal of the network packet
Additionally, the MTU 402a-402b size may be adjusted for other network performance factors in addition to the encryption overhead. In some embodiments, although the MTU 402a-402b is decreased due to encryption overhead, it may be further decreased to account for other overhead and factors related to network communication, as well as increased in other cases. For example, the MTU 402a-402b may have been previously adjusted for a factor not related to encryption and after using the techniques of the present invention the MTU 402a-402b is decreased to take into account encryption overhead. One ordinarily skilled in the art will recognize and appreciate that there may be other factors and considerations for adjusting the MTU besides or in addition to adjusting for encryption overhead in accordance with the techniques of the present invention.
Referring now to
As illustrated in
The remote access client 120 may also have, access, or use a routing table 538 for determining how to route network packets of the client via the agent 326, such as onto the network 104 via a gateway 340. In one embodiment, the agent 326 establishes and maintains an SSL VPN connection to the gateway 340, such as illustrated in
Additionally, the remote access client 120 may have one or more policies 520 for specifying client-side prioritization of network communications related to applications 338a-338n running on application. These policies 520 may be specified by any suitable means and/or mechanisms. In some embodiments, the policies 520 may be specified by the name of the application 338a-338n and/or the type of application 338a-338n. In other embodiments, the policies 520 may be specified in accordance to the type of one or more protocols used by the applications 338a-338n and/or the size of the payload of the network packet. In another embodiment, the policies 520 define prioritization based on whether an application is running in the foreground or the background of the client 105. In yet another embodiment, policies 520 may indicate prioritization based on the destination network address, such as host name or IP address, and/or destination port number. Additionally, the policies 520 may be specified hierarchically to account for multiple applications 338a-338n and/or multiple protocols that may be executed on the client 105 at any point. Furthermore, the policies 520 may be specified conditionally, such as if one application 338a is running, a second application 338b may have a higher or lower priority. One ordinarily skilled in the art will recognize and appreciate the multitude of ways to define client-side application priorities.
The policies 520 may be accessible by the agent 326, configured into the agent 326, or loaded by the agent 326. For example, the policies 520 may be provided by or downloaded via the gateway 340. The policies 520 may comprise any type and format of syntax and/or language for specifying a policy, and may be provided via any type and/or form of medium, such as electronically by one or more network packets or via a file, such as an XML file. The policies 520 may be configurable by a user by any suitable means and/or mechanism. For example, the agent 326 may provide a configuration mechanism such as a user interface, graphical or otherwise, design and constructed for configuring or specifying the policies 520.
In view of the system 500 of
At step 555 of illustrative method 500, the client 105 may intercept network packets of one or more applications 338a-338n transparently to the application 338a-338n, the gateway 340, a peer computing device, and any of the network layers of a network stack. In this manner, the techniques of the present invention support any type of application 338a-338n on the client 105. In some embodiments, the network packets are intercepted by the packet capture mechanism 360 via agent 326 or filter 322. Any inbound and/or outbound network packets of an application 338a-338n may be intercepted by the remote access client 120 of the present invention.
At step 560, the network packets intercepted at step 555 may be stored in a queue 540a-540n. In one embodiment, the network packet is stored to a temporary queue 540a-540n prior to prioritizing the network packet at steps 565 and 570. In other embodiments, the network packet is stored to a determined priority queue 540a-540n or a queue 540a-540n associated with an application 338a-338n after the network packet is prioritized at steps 565 and/or step 570.
At step 565, the remote access client 120 of the present determines the association of network packets with applications 338a-338n in order to determine priorities and apply any priority based policies 520. The client 105, such as via agent 326, can associate network traffic with applications 338a-338n by any suitable means and/or mechanisms. In some embodiments, the agent 326 identifies the network packet as generated from an application 338a-338n by any of the content of the network packet, such as any headers, fields, or the type and content of data in the payload of the network packet. In other embodiments, a network packet is associated with an application 338a-338n by matching information from the routing table 538, such as source and destination IP addresses and ports numbers with the IP addresses and ports numbers of the network packet. In some embodiments, the agent 326, such as via the frame monitor 360, may perform a checksum on the packet to verify that the identified application actually generated the packet.
Additionally, the remote access client 120 may determine whether the application 338a-338n associated with the network packet is running in the foreground or the background of the client 105. Furthermore, the remote access client 120 may determine any priorities, such as process task priority, assigned to the application 338a-338n by the operating system of the client 105. In other embodiments, the remote access client 120 may determine any other characteristics or statistics of the application 338a-338n such as size, memory usage, total execution time, and/or frequency of use. One ordinarily skilled in the art will recognize and appreciate the various characteristics of an application the present technique may use for providing client-side application-aware network communication prioritization.
At step 570, the remote access client 120 of the present invention indicates a priority for intercepted and queued network packets based on the application 338a-338n associated with the packet at step 565. In one embodiment, the agent 326 uses the policies 520 to apply a priority to network packets of applications 338a-338n in accordance with the prioritization rules specified or indicated by the policies 520. In some embodiments, the agent 326 may use characteristics of the application 338a-338n, such as running in the foreground or background, to indicate priority for a network packet of the application 338a-338n. In other embodiments, the agent 326 may use any combination of the policies 520 and characteristics of the application 338a-338n to indicate a priority for the network packets of the application 338a-338n.
In some embodiments, the agent 326 indicates the priority to the filter 322 for management of network packet queues 540a-540n to apply the indicated priorities. The agent 326 may communicate the priority of network packets to the filter 322 by any suitable means and/or mechanism such as via an application programming interface (API), such an IOCTL interface, or any other type and/or form of interface known to those ordinarily skilled in the art. In one embodiment, the filter 322 is not aware of the application 338a-338n by name but can associate priorities to network packets of applications 338a-338n via the routing table 538. An application 338a-338n corresponding to a network packet can be identified by any combination of source and destination identifiers, such as IP addresses and port numbers. As such, in some embodiments, the agent 326 indicates priorities to the filter 322 by routing information instead of application name. In other embodiments, the agent 326 provides to the filter 322 a mapping between applications 338a-338n, such as by application name or process id, to the routing information in a routing table 538.
Based on the indicated priorities for applications 338a-338n, in some embodiments, the filter 322 may place, arrange, or coordinate network packets into queues 540a-540n in support of the priorities. In one embodiment, the filter 322 may move network packets from temporary queues 540a-540n or from memory or other storage to a queue 540a-540n associated with the application 338a-338n, a queue 540a-540n associated with a priority, or a queue 540a-540n associated with both an application and a priority. For example, in one embodiment, all high priority network traffic may be placed in a high priority queue 540a and arranged in order based on an order of priority of the application 338a-338n, such as real-time data applications 338a-338n prior to other applications 338a-338n. In some embodiments, the network packets may be arranged in order in a priority queue 540a-540n based on the time the network packet was intercepted by the packet capture mechanism 365, such as in a FIFO manner. In yet a further embodiment, one queue 540a-540n may be used for prioritization by the filter 322. Each network packet may be placed and arranged in a priority order respective to all other intercepted network packets to provide a packet by packet prioritization across all applications 338a-338n and intercepted network packets. One ordinarily skilled in the art will recognize and appreciate that the network packets may be arranged in various priority queues 540a-540n, such as high, medium, low, or by any other granularity, and be placed or arranged in the queue in any suitable manner in practicing the operations of the present invention described herein.
In one embodiment, all network packets for an application 338a-338n are placed in a queue 540a-540n associated with the application 540a-540n. For example, intercepted network packets for an application communicating to a first destination IP address, and a first destination port may be placed in a first queue 540a. In another embodiment, all networks packets for a type of application 338a-338n, such as an email or voice application, or all network packets for a type of protocol used by the application 338a-338n, such as RTP or UDP, may be placed in a queue 540a-540n for prioritizing networks packets for one or more applications. For example, online collaboration related applications 338a-338n may be placed and prioritized in a first queue 540a for collaboration related applications. A second queue 540b may be used for email related applications 338a-338n. In another example, a queue 540a may be used for applications 338a-338n communicating real-time data or communicating using the RTP and/or UDP protocol. In a further example, a queue 540a may be used for applications 38a-338n communicating using a remote display protocol, such as ICA or RDP.
Within each application associated queue 540a-540n organized by specific application 338a-338n, type or category of application 338a-338n, or by protocol, the network packets may be further prioritized by the characteristic of the application 338a-338n generating them, e.g., a foreground application, the size of the network packet, or the time the network packet was intercepted. In some embodiments, one or more queues 540a-540n may be used for network packets intercepted but not prioritized because a policy 520 does not exist or apply to the network packet, or the policies 520 indicate to ignore or not process the network packet for prioritization. One ordinarily skilled in the art will recognize and appreciate the various ways network packets may be placed and arranged in a priority based manner in queues 540a-540n associated with the application 338a-338n, the type of application 338a-338n or the protocol used by the application 338a-338n, and that the priority may be based on the policies 520 specified for the client 105.
At step 575 of illustrative method 550, the network packets are communicated from the queues 540a-540n according to the determined priorities for the network packets. In some embodiments, the network packets are organized into priority queues 540a-540b so that the network packets of the highest priority queue 540a-540n are communicated first, and then the next highest priority queue 540a-540n second, and so on. In other embodiments, the queues 540a-540n are organized by application 338a-338n, and therefore, at step 575, the present invention communicates network packets from the queue 540a-540n based on the respective priorities of the applications 338a-338n. Regardless of the queue 540a-540n organization and management, one ordinarily skilled in the art will recognize and appreciate that the remote access client of the present invention will communicate the network packets from the queues in a manner according to or consistent with the determined priorities, which in turn, may be based or derived from the policies 520 of the client.
In some embodiments, the remote access client 120 of the present invention considers other network factors in determining what network packets to communicate from what queue. For example, the remote access client 120 may receive an indication of network congestion, such as receiving a window size of zero for a TCP connection related to an application 338a-338n. In another example, the remote access client 120 may recognize a high number of retransmits to a particular destination. As such, in some embodiments, the remote access client 120 may throttle back or not communicate network packets related to other networks factors, such as congestion, even though the network packets may have a higher priority than other network packets in a queue 540a-540n. Thus, the client 105 controls and manages the prioritization of network communications of the client 105 on an application 338a-338n basis and in accordance with any policies 520 for the client 105 and in further view of any network statistics and other factors occurring on the network.
In yet a further aspect and referring now to
The network stacks 310a-310b may be considered to have a first portion 605a-605b of the network stack, and a second portion 610a-610b of the network stack. As illustrated in the example network stacks 310a-310b of
The network stacks 310a-310b illustrated in
The present invention uses a network disruption shielding technique as depicted by illustrative method 650 in
In brief overview of illustrative method 650, at step 665, a client 105 establishes a session via at least a first protocol over a network connection between the client and another device, such as a peer computing device or gateway. As such, a network stack 310a-310b is established or used on the client 105. The network stack 310a-310b has a first portion 605a-605b and a second portion 610a-610b. At step 660, a disruption in the network connection is detected causing the first portion 605a-605b of the network stack 310a-310b to be disestablished, or otherwise disrupted from being used or continued to be used. At step 665, the present invention maintains the second portion 610a-610b of the network stack 310a-310b during the disruption and maintaining a session, or sessions, associated with the network layers of the second portion 610a-610b.
During the disruption, at step 670, any network packets related to the second portion 610a-610b of the network stack 310a-310b may be queued. At step 675, the first portion 605a-605b of the network stack 310a-301b is reestablished or otherwise received from the network disruption. While the first portion 605a-605b of the network stack 310a-301b is reestablished, the present invention maintains the second portion 610a-610b, and sessions thereof, allowing at step 680, to continue with the session by linking or re-associating the second portion 610a-610b with the first portion 605a-605b of the network stack 310a-310b. The network connection and/or the session may automatically be re-authenticated at step 680. At step 685, the illustrative method may communicate any queued network packets and continue with the session transparently as if the network disruption did not occur.
In an embodiment of illustrative step 655, a first computing device 102a may establish a network connection with a second device, such as a peer computing device 102b or a gateway 340, by any suitable means and/or mechanism and using any type and/or form of connection based protocol. For example, the network connection may be established via a TCP connection on a TCP/IP network or by an SPX connection on an IPX/SPX network. In some embodiments, the network connection may be initiated by any of the applications 338a-338n on the client, such as any application illustrated in
In some embodiments, the second portion 610a-610b of the network stack 310a-310b is formed by establishing one more sessions, such as an SSL session, via any type and/or form of protocol over the network connection, such as a remote display protocol of ICA or RDP. The session may be established via any application 338a-338n or the remote access client 120 of the client. In one embodiment, the session may correspond to a tunneling or gateway session with a peer computing device 102b or a gateway 340. In another embodiment, the session may be any type of interactive session such as a media session established via a signaling protocol, SIP for example. For example, the session of the second portion 610a-610b of the network stack 310a-310b may comprise a VoIP communication session, such as one established by illustrative method 260 of
At step 660 of the illustrative method 650 of the present invention, a disruption is network connection is detected. In one embodiment, the network disruption may be caused by a mobile client 105 roaming between networks and networks segments, which, in some embodiments, causes the client 105 to obtain a new network IP address and/or host name. In some embodiments, the disruption disrupts the first portion 605a-605b of the network stack 310a-310b, such as, for example, causing a TCP or SPX connection to be disconnected. In one aspect, the disruption causes the first portion 605a-605b, or any portion thereof, of the network stack 310a-310b to be disestablished, or otherwise needing to be re-established, reconnected, reconfigured or rebuilt. For example, in some embodiments, the IP layer of the network stack may maintain intact while the TCP layer is reestablished. In one embodiment, any TCP related drivers may need to be re-started. In other embodiments, the TCP/IP layer be intact even though the network connection is disrupted, and only a new TCP connection needs to be established. In other embodiments, the TCP/IP layer is intact but needs to reconfigure itself for a new network or network segment, such as changing the IP address of the client 105. One ordinarily skilled in the art will recognize and appreciate the various ways a network connection may be disrupted and impact or affect a first portion of the network stack.
In some embodiments, the agent 326, or any other portion of the remote access client 120 may detect the network disruption by any suitable means and/or mechanisms. In one embodiment, the agent 326 may determine a network disruption by receiving an error message or failure upon calling or executing an API call to the first portion 605a-605b of the network stack 310a-310b. For example, the SSL session maintained by the agent 326 for the second portion 610a-610b relies or depends on the TCP connection of the first portion 605a-605b of the network stack 310a-310b. As the agent 326 transacts via the SSL session, the agent 326 may receive an error or failure message indicating a problem with the TCP connection. In other embodiments, the agent 326 may receive an event or message from any network layer of the first portion 605a-605b of the network stack 310a-310b indicating a network disruption. One ordinarily skilled in the art will recognize and appreciate the various ways the network disruption may be detected.
At illustrative step 665, in some embodiments, upon detection of the network disruption, the agent 326 or any other portion of the remote access client 120 of the present invention maintains the second portion 610a-601b of the network stack 310a-310b during the disruption. For example, although the SSL based session maintained by the agent 326 depends on an underlying TCP connection, the agent 326 keeps the SSL session open or active through the disruption to the TCP connection. As there may multiple sessions associated with one or more layers of the second portion 610a-610b of the network stack, the agent 326, in some embodiments, keeps one or more, or all, of the multiple sessions open or active although the first portion 605a-605b of the network stack 310a-310b is disrupted.
At step 670 of illustrative method 650, the remote access client 120 of the present invention, in some embodiments, queues one or more network packets of any of the protocols related to the second portion 610a-610b of the network stack 310a-310b during the network disruption. The remote access client 120 may use any type and/or form of queuing mechanisms, such as any of the queues 540a-540n illustrated in
At step 675 of illustrative method 650, the first portion 605a-605b of the network stack 310a-310b is reestablished while the second portion 610a-610b of the network stack 310a-310b is maintained along with maintaining any desired session or sessions of the second portion 610a-610b of the network stack 310a-310b. The first portion 605a-605b of the network stack 310a-310b may be reestablished by any suitable means and/or mechanisms. For example, the client 105 may reestablish the TCP/IP connection to the network 104, such as by logging into a new network for a roaming mobile client 105. In other embodiments, the remote access client 120, such as via the agent 326 or the filter 322, reestablishes the first portion 605a-605b of the network stack 310a-310b. For example, the agent 326 may initiate and establish a new TCP connection. Upon reestablishing the first portion 605a-605b, the second portion 610a-610b of the network stack 310a-310b is linked with, re-associated with or starts to use or continue to use the first portion 605a-605b to reestablish the network stack 310a-310b. In some embodiments, the agent 326 may be notified by an event of any network layer that the first portion 605a-605b has been reestablished or in other embodiments, may poll by any predetermined frequency to determine the first portion 605a-605b is reestablished. For example, the agent 326 may check if the TCP connection is active or can be reconnected.
In some embodiments, at step 680, the remote access client 120, such as the agent 326, may automatically re-authenticate the client 105 or a user of the client 105 for the network connection, such as a TCP connection for the first portion 605a-605b of the network stack 610a-610b. For example, the remote access client 120 may automatically re-authenticate the client 105 to a network 104 using any network related credentials of a user of the client 105. Additionally, the remote access client 120 may automatically re-authenticate the client 105 or a user of the client 105 for any session associated with the second portion 610a-610b of the network stack 310a-310b. For example, the SSL session between the agent 326 and the gateway 340 or peer computing device 102c may be re-authenticated.
In another example, an application 338a may be accessing a host service, web server, or application server that uses authentication credentials for access. The agent 326 may automatically re-authenticate the application 338a to the corresponding service or server using application related authentication credentials. In some embodiments, the remote access client 120 may re-authenticate the client and/or user of the client 105 at multiple levels, such as for network access and/or TCP connection, SSL or SSL VPN session, and/or any application level sessions, such as a media interactive user session, for example, a VoIP telephone session. Furthermore, the remote access client 120 may re-authenticate at any time prior to step 685, during step 685, for example, after communicating queued network packets but before continuing other communications, or after step 865, in response to a request to authenticate from a peer computing device, such as a server or the gateway 340.
At step 685 of illustrative method 650, the remote access client 120 of the present invention continues to use the session or sessions of the second portion 610a-610b of the network stack. If any network packets have been queued or remain queued at step 670, the remote access client 120 communicates the queued network packets and continues communicating any network packets of the client 105, such as network packets generated by or sent to the one more applications 338a-338n of the client 105. As such, the network disruption shielding technique of the present invention provides a seamless and transparent solution to nomadic mobile computing solutions and for generally providing reliable and persistent network connectivity and access.
In the example of a VoIP communications, the illustrative method 650 of the present invention will reduce the number of telephone call drops due to network disruptions and improve the usage of and experience with VoIP. A VoIP user will not need to reconnect the telephone call due to temporary network disruptions in network availability as the remote access client 120 of the present invention will automatically maintain the session and reconnect to the network. Additionally, the remote access client 120 of the present invention will automatically re-authenticate the connection and sessions for providing security after the network disruption. Furthermore, the network shielding technique of the present invention is useful for 1) continuing transactions, commands, or operations automatically through the network disruption, 2) maintaining session related context and cache through the network disruption, and 3) automatically handling change in network address of the client due to changes in the network.
By providing a reliable and persistent connection, the present invention also avoids interruptions to transactions, commands or operations as part of the functionality exercised between the a first computing device 102a and a second computing device 102b, such as client 105a and 105b in
Although this aspect of the invention is described in terms of a file copy operation example, one ordinarily skilled in the art will recognize that any operation, transaction, command, function call, etc. transacted between a first computing device 102a and a second computing device 102b, can be maintained and continued without failure from the network connection disruption, and, furthermore, without the client 105 or user of the client 105 recognizing there was a disruption or having notice of the disruption. Additionally, the transaction or operation can be maintained and continued transparently to the application 338, the gateway 340, second computing device 102c, and any part of the second portion 610a-610b of the network stack 310a-310b.
By providing the client 105 with a reliable and persistent connection to a peer computing device 102b or gateway 340, the present invention avoids the process of opening a new user session with an application 338 on the peer, such as a host service on server, by maintaining the user session through network connection interruptions. For each user session between peer computing device, each computing device may maintain session specific context and caches, and other application specific mechanisms related to that instance of the user session. For each new user session established, these session specific context and caches need to be re-populated or re-established to reflect the new user session. For example, a user on the client 105 may have an http session with a server 102c having a web server or web application. The server 102c may keep context specific to providing this instance of the http session with the client 105. The context may be stored in the memory of the server, in files of the server, a database or other component related to providing the functionality of the server 102c. Also, the client 105 may have local context specific to the instance of the http session, such as a mechanism for keeping track of an outstanding request to the web server. This context may be stored in memory of the client 105, in files on the client 105, or other software component interfaced with the client 105. If the connection between the client 105 and the server 102c is not persistent, then a new user session needs to be established with new session specific context on the server 102c and the client 105. The present invention maintains the session so that a new session, and therefore new specific session context, does not need to be re-established.
The present invention maintains the user session through network level connection interruptions and without notification to the user of the client that the session was interrupted. In operation of this aspect of the invention, the client 105 establishes the connection to the peer computing devices. Via the connection, a session between the client 105 and the server is established. The remote access client 120 can store and maintain any session related information such as authentication credentials, and client 105 and host server 102c context for the established session. Upon detection of a disruption in network connection, the remote access client 120 can re-establish the first portion 605a-605b of the network stack 310a-301b while maintaining the second portion 610a-610b of the network stack. The network connection disruption may cause an interruption to the underlying TCP/IP connection used by the session between the client 105 and the server 102c. However, since the second portion 610a-610b of the network stack 310a-310b is maintained, the session can be re-established and/or continued after the network connection is re-established without the user on the client 105 having notification that the session was interrupted. Thus, the interruption of the session caused by the network connection disruption is effectively hidden from the user using the network disruption shielding techniques of the present invention.
Furthermore, by providing a reliable and persistent connection, the present invention also enables a client 105 to traverse through different network topologies without re-starting a session or an application 338 on the client 105. For example, the client 105 may be a computer notebook with a wireless network connection. As the client 105 moves from a first wireless network to a second wireless network, the client's network connection may be temporarily disrupted from the first wireless network as a network connection is established with the second wireless network. The second wireless network may assign a new network identifier, such as a host name or internet protocol address, to the client 105. This new network identifier may be different than the network identifier assigned to the client 105 by the first wireless network. In another example, the client 105 may be physically connected through an Ethernet cable to a port on the network. The physical connection may be unplugged and the client 105 moved to another location to plug into a different port on the network. This would cause a disruption into the network connection and possibly a change in the assigned network identifier. Without the present invention, any sessions between peer computing devices may need to be restarted due to the change in the network topology, the disruption to the network connection, and/or the change in the assigned network identifier. By the method and systems described herein, the remote access client 120 of the present invention maintains the network connection for the client and automatically re-established the client's 105 network connection including handling changes in the network topology and network identifier. The client 105, and any applications or sessions on the client 105, can continue to operate as if there was not a network connection disruption or a change in the network identifier. Furthermore, the user on the client 105 may not recognize there were any interruptions or changes, and the client 105 may not receive any notice of such interruptions.
In an additional aspect, any of the techniques of the present invention, such as the illustrative methods of
The techniques of the present invention are complimentary to each other for network communication optimizations, such as for example in VoIP communications over a SSL VPN gateway. As such, each of the 1) peer-to-peer routing technique, 2) the false acknowledgement technique, 3) payload shifting technique, 4) the MTU adjustment technique, 5) the client-side application-aware technique, and 5) the network disruption shielding technique of the present invention may be practiced with one or more of the following techniques and optimization of the present invention: 1) the peer-to-peer routing technique, 2) the false acknowledgement technique, 3) payload shifting technique, 4) the MTU adjustment technique, 5) the client-side application-aware technique, and/or 5) the network disruption shielding technique.
In one further illustrative example of the present invention, an online meeting, collaboration and/or desktop sharing service, such as the hosted service of GoToMeeting.com, WebEx.com, or LiveMeeting.com may use the techniques of the present invention in one or more combinations. The host service may use a gateway 340, and the techniques of illustrative method 260 to facilitate a peer-to-peer connection between a first computing device of a meeting presenter and a second computing device of a meeting attendee. The computing devices of the meeting presenter and attendees may download via the host service the remote access client 120, or any portions thereof. Once the meeting presenter and the meeting attendee establish a peer-to-peer connection, the peer computing devices may use any of the optimization techniques of the present invention to optimize their communications, such as the MTU adjustment technique, client-side application aware technique, or the network disruption shielding technique. Along with the peer-to-peer routing, the optimization techniques of the present invention, will improve the performance, efficiency and user experience of the online meeting, collaboration, or desktop sharing.
In yet a further aspect and in view of
Many alterations and modifications may be made by those having ordinary skill in the art without departing from the spirit and scope of the invention. Therefore, it must be expressly understood that the illustrated embodiments have been shown only for the purposes of example and should not be taken as limiting the invention, which is defined by the following claims. These claims are to be read as including what they set forth literally and also those equivalent elements which are insubstantially different, even though not identical in other respects to what is shown and described in the above illustrations.
This present application claims priority to U.S. Provisional Patent Application No. 60/590,837, entitled “Ad Hoc Distributed Networks And Remote Access Architecture”, filed Jul. 23, 2004, and U.S. Provisional Patent Application No. 60/601,431, entitled “System And Method For Assuring Redundancy In Remote Access Solution”, filed Aug. 13, 2004, and U.S. Provisional Patent Application No. 60/607,420, entitled “Virtual Network Bridging”, filed Sep. 3, 2004, and U.S. Provisional Patent Application No. 60/608,814, entitled “System And Method For Assuring Redundancy In Remote Access Solution”, filed Sep. 10, 2004, all of which are incorporated herein by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4479195 | Herr et al. | Oct 1984 | A |
| 4701844 | Thompson et al. | Oct 1987 | A |
| 4885680 | Anthony et al. | Dec 1989 | A |
| 4935870 | Burk et al. | Jun 1990 | A |
| 5301270 | Steinberg et al. | Apr 1994 | A |
| 5307413 | Denzer | Apr 1994 | A |
| 5329619 | Page et al. | Jul 1994 | A |
| 5359712 | Cohen et al. | Oct 1994 | A |
| 5511208 | Boyles et al. | Apr 1996 | A |
| 5519699 | Ohsawa | May 1996 | A |
| 5521940 | Lane et al. | May 1996 | A |
| 5561769 | Kumar et al. | Oct 1996 | A |
| 5623492 | Teraslinna | Apr 1997 | A |
| 5625793 | Mirza | Apr 1997 | A |
| 5657390 | Elgamal et al. | Aug 1997 | A |
| 5671226 | Murakami et al. | Sep 1997 | A |
| 5708656 | Noneman et al. | Jan 1998 | A |
| 5742829 | Davis et al. | Apr 1998 | A |
| 5758085 | Kouoheris et al. | May 1998 | A |
| 5758110 | Boss et al. | May 1998 | A |
| 5761431 | Gross et al. | Jun 1998 | A |
| 5787470 | DeSimone et al. | Jul 1998 | A |
| 5812668 | Weber | Sep 1998 | A |
| 5815462 | Konishi et al. | Sep 1998 | A |
| 5819020 | Beeler, Jr. | Oct 1998 | A |
| 5822524 | Chen et al. | Oct 1998 | A |
| 5828840 | Cowan et al. | Oct 1998 | A |
| 5835726 | Shwed et al. | Nov 1998 | A |
| 5838920 | Rosborough | Nov 1998 | A |
| 5850446 | Berger et al. | Dec 1998 | A |
| 5852717 | Bhide et al. | Dec 1998 | A |
| 5859835 | Varma et al. | Jan 1999 | A |
| 5864837 | Maimone | Jan 1999 | A |
| 5881229 | Singh et al. | Mar 1999 | A |
| 5889863 | Weber | Mar 1999 | A |
| 5893150 | Hagersten et al. | Apr 1999 | A |
| 5911051 | Carson et al. | Jun 1999 | A |
| 5918244 | Percival | Jun 1999 | A |
| 5925100 | Drewry et al. | Jul 1999 | A |
| 5931917 | Nguyen et al. | Aug 1999 | A |
| 5931961 | Ranganathan et al. | Aug 1999 | A |
| 5933605 | Kawano et al. | Aug 1999 | A |
| 5940074 | Britt et al. | Aug 1999 | A |
| 5943424 | Berger et al. | Aug 1999 | A |
| 5956483 | Grate et al. | Sep 1999 | A |
| 5958016 | Chang et al. | Sep 1999 | A |
| 5974465 | Wong | Oct 1999 | A |
| 5978840 | Nguyen et al. | Nov 1999 | A |
| 5983208 | Haller et al. | Nov 1999 | A |
| 5987132 | Rowney | Nov 1999 | A |
| 5987482 | Bates et al. | Nov 1999 | A |
| 5987611 | Freund | Nov 1999 | A |
| 5995999 | Bharadhwaj | Nov 1999 | A |
| 5996076 | Rowney et al. | Nov 1999 | A |
| 5999179 | Kekic et al. | Dec 1999 | A |
| 5999525 | Krishnaswamy et al. | Dec 1999 | A |
| 6002767 | Kramer | Dec 1999 | A |
| 6021470 | Frank et al. | Feb 2000 | A |
| 6023724 | Bhatia et al. | Feb 2000 | A |
| 6026379 | Haller et al. | Feb 2000 | A |
| 6026440 | Shrader et al. | Feb 2000 | A |
| 6029175 | Chow et al. | Feb 2000 | A |
| 6058250 | Harwood et al. | May 2000 | A |
| 6061715 | Hawes | May 2000 | A |
| 6061769 | Kapulka et al. | May 2000 | A |
| 6061796 | Chen et al. | May 2000 | A |
| 6067569 | Khaki et al. | May 2000 | A |
| 6072870 | Nguyen et al. | Jun 2000 | A |
| 6092155 | Olnowich | Jul 2000 | A |
| 6101543 | Alden et al. | Aug 2000 | A |
| 6112085 | Garner et al. | Aug 2000 | A |
| 6119105 | Williams | Sep 2000 | A |
| 6119151 | Cantrell et al. | Sep 2000 | A |
| 6122403 | Rhoads | Sep 2000 | A |
| 6128627 | Mattis et al. | Oct 2000 | A |
| 6131120 | Reid | Oct 2000 | A |
| 6141686 | Jackowski et al. | Oct 2000 | A |
| 6144775 | Williams et al. | Nov 2000 | A |
| 6157955 | Narad et al. | Dec 2000 | A |
| 6161123 | Renouard et al. | Dec 2000 | A |
| 6163772 | Kramer et al. | Dec 2000 | A |
| 6170017 | Dias et al. | Jan 2001 | B1 |
| 6173325 | Kukreja | Jan 2001 | B1 |
| 6175869 | Ahuja et al. | Jan 2001 | B1 |
| 6178409 | Weber et al. | Jan 2001 | B1 |
| 6182139 | Brendel | Jan 2001 | B1 |
| 6192408 | Vahalia et al. | Feb 2001 | B1 |
| 6219669 | Haff et al. | Apr 2001 | B1 |
| 6233249 | Katseff et al. | May 2001 | B1 |
| 6233606 | Dujari | May 2001 | B1 |
| 6233619 | Narisi et al. | May 2001 | B1 |
| 6236652 | Preston et al. | May 2001 | B1 |
| 6252851 | Siu et al. | Jun 2001 | B1 |
| 6253027 | Weber et al. | Jun 2001 | B1 |
| 6253188 | Witek et al. | Jun 2001 | B1 |
| 6253327 | Zhang et al. | Jun 2001 | B1 |
| 6256773 | Bowman-Amuah | Jul 2001 | B1 |
| 6272146 | Bowater et al. | Aug 2001 | B1 |
| 6272148 | Takagi et al. | Aug 2001 | B1 |
| 6272556 | Gish | Aug 2001 | B1 |
| 6282172 | Robles et al. | Aug 2001 | B1 |
| 6289382 | Bowman-Amuah | Sep 2001 | B1 |
| 6289450 | Pensak et al. | Sep 2001 | B1 |
| 6301249 | Mansfield et al. | Oct 2001 | B1 |
| 6304915 | Nguyen et al. | Oct 2001 | B1 |
| 6308273 | Goertzel et al. | Oct 2001 | B1 |
| 6321235 | Bird | Nov 2001 | B1 |
| 6321337 | Reshef et al. | Nov 2001 | B1 |
| 6324525 | Kramer et al. | Nov 2001 | B1 |
| 6324582 | Sridhar et al. | Nov 2001 | B1 |
| 6324647 | Bowman-Amuah | Nov 2001 | B1 |
| 6324648 | Grantges, Jr. | Nov 2001 | B1 |
| 6327242 | Amicangioli et al. | Dec 2001 | B1 |
| 6332163 | Bowman-Amuah | Dec 2001 | B1 |
| 6333931 | LaPier et al. | Dec 2001 | B1 |
| 6334664 | Silverbrook | Jan 2002 | B1 |
| 6339832 | Bowman-Amuah | Jan 2002 | B1 |
| 6345239 | Bowman-Amuah | Feb 2002 | B1 |
| 6360265 | Falck et al. | Mar 2002 | B1 |
| 6363363 | Haller et al. | Mar 2002 | B1 |
| 6363478 | Lambert et al. | Mar 2002 | B1 |
| 6370573 | Bowman-Amuah | Apr 2002 | B1 |
| 6370599 | Anand et al. | Apr 2002 | B1 |
| 6373950 | Rowney | Apr 2002 | B1 |
| 6383478 | Prokop et al. | May 2002 | B1 |
| 6389462 | Cohen et al. | May 2002 | B1 |
| 6389505 | Emma et al. | May 2002 | B1 |
| 6398359 | Silverbrook et al. | Jun 2002 | B1 |
| 6405364 | Bowman-Amuah | Jun 2002 | B1 |
| 6412000 | Riddle et al. | Jun 2002 | B1 |
| 6415329 | Gelman et al. | Jul 2002 | B1 |
| 6425057 | Cherkasova et al. | Jul 2002 | B1 |
| 6427132 | Bowman-Amuah | Jul 2002 | B1 |
| 6427187 | Malcolm | Jul 2002 | B2 |
| 6431777 | Silverbrook | Aug 2002 | B1 |
| 6434568 | Bowman-Amuah | Aug 2002 | B1 |
| 6434618 | Cohen et al. | Aug 2002 | B1 |
| 6434628 | Bowman-Amuah | Aug 2002 | B1 |
| 6438127 | Le Goff et al. | Aug 2002 | B1 |
| 6438594 | Bowman-Amuah | Aug 2002 | B1 |
| 6442571 | Haff et al. | Aug 2002 | B1 |
| 6442682 | Pothapragada et al. | Aug 2002 | B1 |
| 6442748 | Bowman-Amuah | Aug 2002 | B1 |
| 6447113 | Silverbrook et al. | Sep 2002 | B1 |
| 6449658 | Lafe et al. | Sep 2002 | B1 |
| 6449695 | Bereznyi et al. | Sep 2002 | B1 |
| 6452915 | Jorgensen | Sep 2002 | B1 |
| 6452923 | Gerszberg et al. | Sep 2002 | B1 |
| 6457103 | Challenger et al. | Sep 2002 | B1 |
| 6473794 | Guheen et al. | Oct 2002 | B1 |
| 6473802 | Masters | Oct 2002 | B2 |
| 6477580 | Bowman-Amuah | Nov 2002 | B1 |
| 6477665 | Bowman-Amuah | Nov 2002 | B1 |
| 6484143 | Swildens et al. | Nov 2002 | B1 |
| 6484206 | Crump et al. | Nov 2002 | B2 |
| 6487641 | Cusson et al. | Nov 2002 | B1 |
| 6496481 | Wu et al. | Dec 2002 | B1 |
| 6496776 | Blumberg et al. | Dec 2002 | B1 |
| 6496850 | Bowman-Amuah | Dec 2002 | B1 |
| 6496935 | Fink et al. | Dec 2002 | B1 |
| 6502102 | Haswell et al. | Dec 2002 | B1 |
| 6502192 | Nguyen | Dec 2002 | B1 |
| 6502213 | Bowman-Amuah | Dec 2002 | B1 |
| 6507891 | Challenger et al. | Jan 2003 | B1 |
| 6519571 | Guheen et al. | Feb 2003 | B1 |
| 6523027 | Underwood | Feb 2003 | B1 |
| 6529909 | Bowman-Amuah | Mar 2003 | B1 |
| 6529948 | Bowman-Amuah | Mar 2003 | B1 |
| 6536037 | Guheen et al. | Mar 2003 | B1 |
| 6539396 | Bowman-Amuah | Mar 2003 | B1 |
| 6549949 | Bowman-Amuah | Apr 2003 | B1 |
| 6550012 | Villa et al. | Apr 2003 | B1 |
| 6550057 | Bowman-Amuah | Apr 2003 | B1 |
| 6553129 | Rhoads | Apr 2003 | B1 |
| 6553377 | Eschelbeck et al. | Apr 2003 | B1 |
| 6553409 | Zhang et al. | Apr 2003 | B1 |
| 6567806 | Tsuchida et al. | May 2003 | B1 |
| 6571282 | Bowman-Amuah | May 2003 | B1 |
| 6574668 | Gubbi et al. | Jun 2003 | B1 |
| 6574688 | Dale et al. | Jun 2003 | B1 |
| 6578068 | Bowman-Amuah | Jun 2003 | B1 |
| 6578073 | Starnes et al. | Jun 2003 | B1 |
| 6584569 | Reshef et al. | Jun 2003 | B2 |
| 6587806 | Mangiameli et al. | Jul 2003 | B2 |
| 6590588 | Lincke et al. | Jul 2003 | B2 |
| 6591266 | Li et al. | Jul 2003 | B1 |
| 6594690 | Cantwell | Jul 2003 | B2 |
| 6598075 | Ogdon et al. | Jul 2003 | B1 |
| 6601057 | Underwood et al. | Jul 2003 | B1 |
| 6601192 | Bowman-Amuah | Jul 2003 | B1 |
| 6601233 | Underwood | Jul 2003 | B1 |
| 6601234 | Bowman-Amuah | Jul 2003 | B1 |
| 6603738 | Kari et al. | Aug 2003 | B1 |
| 6606660 | Bowman-Amuah | Aug 2003 | B1 |
| 6606663 | Liao et al. | Aug 2003 | B1 |
| 6606744 | Mikurak | Aug 2003 | B1 |
| 6609128 | Underwood | Aug 2003 | B1 |
| 6611262 | Suzuki | Aug 2003 | B1 |
| 6611522 | Zheng et al. | Aug 2003 | B1 |
| 6611822 | Beams et al. | Aug 2003 | B1 |
| 6611867 | Bowman-Amuah | Aug 2003 | B1 |
| 6614800 | Genty et al. | Sep 2003 | B1 |
| 6615166 | Guheen et al. | Sep 2003 | B1 |
| 6615199 | Bowman-Amuah | Sep 2003 | B1 |
| 6615253 | Bowman-Amuah | Sep 2003 | B1 |
| 6618359 | Chen et al. | Sep 2003 | B1 |
| 6629081 | Cornelius et al. | Sep 2003 | B1 |
| 6631986 | Silverbrook | Oct 2003 | B2 |
| 6633574 | Koch et al. | Oct 2003 | B1 |
| 6633878 | Underwood | Oct 2003 | B1 |
| 6636242 | Bowman-Amuah | Oct 2003 | B2 |
| 6640238 | Bowman-Amuah | Oct 2003 | B1 |
| 6640240 | Hoffman et al. | Oct 2003 | B1 |
| 6640244 | Bowman-Amuah | Oct 2003 | B1 |
| 6640248 | Jorgensen | Oct 2003 | B1 |
| 6640249 | Bowman-Amuah | Oct 2003 | B1 |
| 6647130 | Rhoads | Nov 2003 | B2 |
| 6650640 | Muller et al. | Nov 2003 | B1 |
| 6652089 | Silverbrook | Nov 2003 | B2 |
| 6652090 | Silverbrook | Nov 2003 | B2 |
| 6662221 | Gonda et al. | Dec 2003 | B1 |
| 6662357 | Bowman-Amuah | Dec 2003 | B1 |
| 6664978 | Kekic et al. | Dec 2003 | B1 |
| 6671818 | Mikurak | Dec 2003 | B1 |
| 6678734 | Haatainen et al. | Jan 2004 | B1 |
| 6681029 | Rhoads | Jan 2004 | B1 |
| 6687732 | Bector et al. | Feb 2004 | B1 |
| 6691227 | Neves et al. | Feb 2004 | B1 |
| 6697824 | Bowman-Amuah | Feb 2004 | B1 |
| 6697844 | Chan et al. | Feb 2004 | B1 |
| 6697849 | Carlson | Feb 2004 | B1 |
| 6700902 | Meyer | Mar 2004 | B1 |
| 6701345 | Carley et al. | Mar 2004 | B1 |
| 6701514 | Haswell et al. | Mar 2004 | B1 |
| 6704873 | Underwood | Mar 2004 | B1 |
| 6715037 | Malcolm | Mar 2004 | B2 |
| 6715145 | Bowman-Amuah | Mar 2004 | B1 |
| 6718535 | Underwood | Apr 2004 | B1 |
| 6721713 | Guheen et al. | Apr 2004 | B1 |
| 6728787 | Leigh | Apr 2004 | B1 |
| 6732237 | Jacobs et al. | May 2004 | B1 |
| 6732269 | Baskey et al. | May 2004 | B1 |
| 6732314 | Borella et al. | May 2004 | B1 |
| 6735601 | Subrahmanyam | May 2004 | B1 |
| 6735691 | Capps et al. | May 2004 | B1 |
| 6742015 | Bowman-Amuah | May 2004 | B1 |
| 6744774 | Sharma | Jun 2004 | B2 |
| 6754699 | Swildens et al. | Jun 2004 | B2 |
| 6760748 | Hakim | Jul 2004 | B1 |
| 6766373 | Beadle et al. | Jul 2004 | B1 |
| 6772203 | Feiertag et al. | Aug 2004 | B1 |
| 6775392 | Rhoads | Aug 2004 | B1 |
| 6785719 | Jacobson et al. | Aug 2004 | B1 |
| 6788315 | Kekic et al. | Sep 2004 | B1 |
| 6789170 | Jacobs et al. | Sep 2004 | B1 |
| 6792615 | Rowe et al. | Sep 2004 | B1 |
| 6801927 | Smith et al. | Oct 2004 | B1 |
| 6802020 | Smith | Oct 2004 | B1 |
| 6807607 | Lamparter | Oct 2004 | B1 |
| 6820125 | Dias et al. | Nov 2004 | B1 |
| 6820133 | Grove et al. | Nov 2004 | B1 |
| 6820974 | Silverbrook | Nov 2004 | B2 |
| 6823374 | Kausik et al. | Nov 2004 | B2 |
| 6826626 | McManus | Nov 2004 | B1 |
| 6826627 | Sjollema et al. | Nov 2004 | B2 |
| 6831898 | Edsall et al. | Dec 2004 | B1 |
| 6842906 | Bowman-Amuah | Jan 2005 | B1 |
| 6847892 | Zhou et al. | Jan 2005 | B2 |
| 6850252 | Hoffberg | Feb 2005 | B1 |
| 6870921 | Elsey et al. | Mar 2005 | B1 |
| 6873988 | Herrmann et al. | Mar 2005 | B2 |
| 6880086 | Kidder et al. | Apr 2005 | B2 |
| 6883068 | Tsirigotis et al. | Apr 2005 | B2 |
| 6888927 | Cruickshank et al. | May 2005 | B1 |
| 6894981 | Coile et al. | May 2005 | B1 |
| 6899420 | Silverbrook | May 2005 | B2 |
| 6901072 | Wong | May 2005 | B1 |
| 6904449 | Quinones | Jun 2005 | B1 |
| 6904519 | Anand et al. | Jun 2005 | B2 |
| 6907546 | Haswell et al. | Jun 2005 | B1 |
| 6910074 | Amin et al. | Jun 2005 | B1 |
| 6912522 | Edgar | Jun 2005 | B2 |
| 6918113 | Patel et al. | Jul 2005 | B2 |
| 6918665 | Silverbrook | Jul 2005 | B2 |
| 6920502 | Araujo et al. | Jul 2005 | B2 |
| 6925495 | Hegde et al. | Aug 2005 | B2 |
| 6934288 | Dempo | Aug 2005 | B2 |
| 6935736 | Silverbrook | Aug 2005 | B2 |
| 6944279 | Elsey et al. | Sep 2005 | B2 |
| 6950848 | Yousefi'zadeh | Sep 2005 | B1 |
| 6954736 | Menninger et al. | Oct 2005 | B2 |
| 6954877 | Earl et al. | Oct 2005 | B2 |
| 6957186 | Guheen et al. | Oct 2005 | B1 |
| 6957249 | Salo et al. | Oct 2005 | B2 |
| 6959320 | Shah et al. | Oct 2005 | B2 |
| 6974928 | Bloom | Dec 2005 | B2 |
| 6976090 | Ben-Shaul et al. | Dec 2005 | B2 |
| 6980962 | Arganbright et al. | Dec 2005 | B1 |
| 6981029 | Menditto et al. | Dec 2005 | B1 |
| 6990070 | Aweya et al. | Jan 2006 | B1 |
| 6990480 | Burt | Jan 2006 | B1 |
| 6993016 | Liva et al. | Jan 2006 | B1 |
| 6996628 | Keane et al. | Feb 2006 | B2 |
| 6996631 | Aiken et al. | Feb 2006 | B1 |
| 7000012 | Moore et al. | Feb 2006 | B2 |
| 7007092 | Peiffer | Feb 2006 | B2 |
| 7007103 | Pinkerton et al. | Feb 2006 | B2 |
| 7010300 | Jones et al. | Mar 2006 | B1 |
| 7013290 | Ananian | Mar 2006 | B2 |
| 7016055 | Dodge et al. | Mar 2006 | B2 |
| 7020719 | Grove et al. | Mar 2006 | B1 |
| 7023979 | Wu et al. | Apr 2006 | B1 |
| 7024452 | O'Connell et al. | Apr 2006 | B1 |
| 7026954 | Slemmer et al. | Apr 2006 | B2 |
| 7027055 | Anderson et al. | Apr 2006 | B2 |
| 7028083 | Levine et al. | Apr 2006 | B2 |
| 7028333 | Tuomenoksa et al. | Apr 2006 | B2 |
| 7028334 | Tuomenoksa | Apr 2006 | B2 |
| 7031314 | Craig et al. | Apr 2006 | B2 |
| 7034691 | Rapaport et al. | Apr 2006 | B1 |
| 7035427 | Rhoads | Apr 2006 | B2 |
| 7036142 | Zhang et al. | Apr 2006 | B1 |
| 7039606 | Hoffman et al. | May 2006 | B2 |
| 7039708 | Knobl et al. | May 2006 | B1 |
| 7042879 | Eschbach et al. | May 2006 | B2 |
| 7043529 | Simonoff | May 2006 | B1 |
| 7047279 | Beams et al. | May 2006 | B1 |
| 7047424 | Bendinelli et al. | May 2006 | B2 |
| 7051161 | Dixit et al. | May 2006 | B2 |
| 7051316 | Charisius et al. | May 2006 | B2 |
| 7054837 | Hoffman et al. | May 2006 | B2 |
| 7054944 | Tang et al. | May 2006 | B2 |
| 7055028 | Peiffer et al. | May 2006 | B2 |
| 7055169 | Delpuch et al. | May 2006 | B2 |
| 7055947 | Silverbrook | Jun 2006 | B2 |
| 7057759 | Lapstun et al. | Jun 2006 | B2 |
| 7069234 | Cornelius et al. | Jun 2006 | B1 |
| 7070110 | Lapstun et al. | Jul 2006 | B2 |
| 7072665 | Blumberg et al. | Jul 2006 | B1 |
| 7072843 | Menninger et al. | Jul 2006 | B2 |
| 7072965 | Ryuutou et al. | Jul 2006 | B2 |
| 7080041 | Nagel | Jul 2006 | B2 |
| 7082409 | Cherry | Jul 2006 | B1 |
| 7085683 | Anderson et al. | Aug 2006 | B2 |
| 7085834 | Delany et al. | Aug 2006 | B2 |
| 7085854 | Keane et al. | Aug 2006 | B2 |
| 7086728 | Silverbrook | Aug 2006 | B2 |
| 7092370 | Jiang et al. | Aug 2006 | B2 |
| 7096009 | Mousseau et al. | Aug 2006 | B2 |
| 7096418 | Singhal et al. | Aug 2006 | B1 |
| 7096495 | Warrier et al. | Aug 2006 | B1 |
| 7097106 | Silverbrook et al. | Aug 2006 | B2 |
| 7100195 | Underwood | Aug 2006 | B1 |
| 7103068 | Gardner et al. | Sep 2006 | B1 |
| 7107285 | von Kaenel et al. | Sep 2006 | B2 |
| 7113779 | Fujisaki et al. | Sep 2006 | B1 |
| 7113962 | Kee et al. | Sep 2006 | B1 |
| 7114180 | DeCaprio | Sep 2006 | B1 |
| 7117504 | Smith et al. | Oct 2006 | B2 |
| 7117530 | Lin | Oct 2006 | B1 |
| 7120596 | Hoffman et al. | Oct 2006 | B2 |
| 7120666 | McCanne et al. | Oct 2006 | B2 |
| 7120690 | Krishnan et al. | Oct 2006 | B1 |
| 7120852 | Terry et al. | Oct 2006 | B2 |
| 7124101 | Mikurak | Oct 2006 | B1 |
| 7124442 | Nash-Putnam | Oct 2006 | B2 |
| 7126955 | Nabhan et al. | Oct 2006 | B2 |
| 7128265 | Silverbrook et al. | Oct 2006 | B2 |
| 7128270 | Silverbrook et al. | Oct 2006 | B2 |
| 7130792 | Tokieda et al. | Oct 2006 | B2 |
| 7130807 | Mikurak | Oct 2006 | B1 |
| 7131596 | Lapstun et al. | Nov 2006 | B2 |
| 7134131 | Hendricks et al. | Nov 2006 | B1 |
| 7135991 | Slemmer et al. | Nov 2006 | B2 |
| 7136645 | Hanson et al. | Nov 2006 | B2 |
| 7137566 | Silverbrook et al. | Nov 2006 | B2 |
| 7139999 | Bowman-Amuah | Nov 2006 | B2 |
| 7140044 | Redlich et al. | Nov 2006 | B2 |
| 7143153 | Black et al. | Nov 2006 | B1 |
| 7144095 | Silverbrook | Dec 2006 | B2 |
| 7146384 | Sawafta | Dec 2006 | B2 |
| 7146644 | Redlich et al. | Dec 2006 | B2 |
| 7149698 | Guheen et al. | Dec 2006 | B2 |
| 7149897 | Chincheck et al. | Dec 2006 | B2 |
| 7149959 | Jones et al. | Dec 2006 | B1 |
| 7150398 | Silverbrook et al. | Dec 2006 | B2 |
| 7152047 | Nagel | Dec 2006 | B1 |
| 7152092 | Beams et al. | Dec 2006 | B2 |
| 7152207 | Underwood et al. | Dec 2006 | B1 |
| 7155518 | Forslow | Dec 2006 | B2 |
| 7155676 | Land et al. | Dec 2006 | B2 |
| 7159014 | Kausik et al. | Jan 2007 | B2 |
| 7159777 | Silverbrook et al. | Jan 2007 | B2 |
| 7162540 | Jasen et al. | Jan 2007 | B2 |
| 7164680 | Loguinov | Jan 2007 | B2 |
| 7165041 | Guheen et al. | Jan 2007 | B1 |
| 7167844 | Leong et al. | Jan 2007 | B1 |
| 7171379 | Menninger et al. | Jan 2007 | B2 |
| 7175089 | Silverbrook et al. | Feb 2007 | B2 |
| 7178106 | Lamkin et al. | Feb 2007 | B2 |
| 7178719 | Silverbrook et al. | Feb 2007 | B2 |
| 7181766 | Bendinelli et al. | Feb 2007 | B2 |
| 7184445 | Gupta et al. | Feb 2007 | B2 |
| 7187470 | Lapstun et al. | Mar 2007 | B2 |
| 7188273 | Allen et al. | Mar 2007 | B2 |
| 7188769 | Silverbrook et al. | Mar 2007 | B2 |
| 7191252 | Redlich et al. | Mar 2007 | B2 |
| 7194761 | Champagne | Mar 2007 | B1 |
| 7197374 | Silverbrook et al. | Mar 2007 | B2 |
| 7197502 | Feinsmith | Mar 2007 | B2 |
| 7197570 | Eylon et al. | Mar 2007 | B2 |
| 7197602 | Malcolm | Mar 2007 | B2 |
| 7197751 | Fedotov et al. | Mar 2007 | B2 |
| 7199885 | Dodge | Apr 2007 | B2 |
| 7200804 | Khavari et al. | Apr 2007 | B1 |
| 7206811 | Skurikhin et al. | Apr 2007 | B2 |
| 7207483 | Silverbrook et al. | Apr 2007 | B2 |
| 7207485 | Silverbrook et al. | Apr 2007 | B2 |
| 7212296 | Dodge et al. | May 2007 | B2 |
| 7216173 | Clayton et al. | May 2007 | B2 |
| 7219127 | Huck et al. | May 2007 | B2 |
| 7221660 | Simonson et al. | May 2007 | B1 |
| 7222152 | Thompson et al. | May 2007 | B1 |
| 7222305 | Teplov et al. | May 2007 | B2 |
| 7225040 | Eller et al. | May 2007 | B2 |
| 7225244 | Reynolds et al. | May 2007 | B2 |
| 7225382 | Ramech et al. | May 2007 | B2 |
| 7228459 | Jiang et al. | Jun 2007 | B2 |
| 7246233 | Brabson et al. | Jul 2007 | B2 |
| 7260617 | Bazinet et al. | Aug 2007 | B2 |
| 7260840 | Swander | Aug 2007 | B2 |
| 7263071 | Yim | Aug 2007 | B2 |
| 7272853 | Goodman et al. | Sep 2007 | B2 |
| 7284044 | Teraoaka et al. | Oct 2007 | B2 |
| 7318100 | Demmer et al. | Jan 2008 | B2 |
| 7321906 | Green | Jan 2008 | B2 |
| 7328267 | Bashyam et al. | Feb 2008 | B1 |
| 7340772 | Panasyuk et al. | Mar 2008 | B2 |
| 7353533 | Wright et al. | Apr 2008 | B2 |
| 7363347 | Thomas | Apr 2008 | B2 |
| 7363378 | Holmes et al. | Apr 2008 | B2 |
| 7370353 | Yang | May 2008 | B2 |
| 7386631 | Sibal et al. | Jun 2008 | B1 |
| 7389462 | Wang et al. | Jun 2008 | B1 |
| 7392348 | Dumont | Jun 2008 | B2 |
| 7398320 | Minakuchi et al. | Jul 2008 | B1 |
| 7398552 | Pardee et al. | Jul 2008 | B2 |
| 7401116 | Chalfin et al. | Jul 2008 | B1 |
| 7401158 | Beauchamp et al. | Jul 2008 | B2 |
| 7404003 | Noble | Jul 2008 | B1 |
| 7406533 | Li et al. | Jul 2008 | B2 |
| 7409708 | Goodman et al. | Aug 2008 | B2 |
| 7415723 | Pandya | Aug 2008 | B2 |
| 7420992 | Fang et al. | Sep 2008 | B1 |
| 7433314 | Sharma et al. | Oct 2008 | B2 |
| 7441119 | Brabson et al. | Oct 2008 | B2 |
| 7458095 | Forsberg | Nov 2008 | B2 |
| 7464264 | Goodman et al. | Dec 2008 | B2 |
| 7480312 | Ossman | Jan 2009 | B2 |
| 7496659 | Coverdill et al. | Feb 2009 | B1 |
| 7505455 | Goodwin et al. | Mar 2009 | B1 |
| 7512702 | Srivastava et al. | Mar 2009 | B1 |
| 7522581 | Acharya et al. | Apr 2009 | B2 |
| 7533409 | Keane et al. | May 2009 | B2 |
| 7536715 | Markham | May 2009 | B2 |
| 7577144 | Chang et al. | Aug 2009 | B2 |
| 7606902 | Rao et al. | Oct 2009 | B2 |
| 7609721 | Rao et al. | Oct 2009 | B2 |
| 7644188 | Vlodavsky et al. | Jan 2010 | B2 |
| 7673048 | O'Toole et al. | Mar 2010 | B1 |
| 7676048 | Tsutsui | Mar 2010 | B2 |
| 7757074 | Sundarrajan et al. | Jul 2010 | B2 |
| 7774499 | Popek et al. | Aug 2010 | B1 |
| 7775074 | Tobias et al. | Aug 2010 | B1 |
| 7810089 | Sundarrajan et al. | Oct 2010 | B2 |
| 7849199 | Schulz et al. | Dec 2010 | B2 |
| 7882247 | Sturniolo et al. | Feb 2011 | B2 |
| 7921184 | Sundarrajan et al. | Apr 2011 | B2 |
| 7929442 | Connor et al. | Apr 2011 | B2 |
| 7945678 | Skene | May 2011 | B1 |
| 7979528 | Eisenberg et al. | Jul 2011 | B2 |
| 7979694 | Touitou et al. | Jul 2011 | B2 |
| 8005981 | Tuck et al. | Aug 2011 | B2 |
| 8205000 | Chang et al. | Jun 2012 | B2 |
| 8223647 | Kakani et al. | Jul 2012 | B2 |
| 8250214 | Susai et al. | Aug 2012 | B2 |
| 8255456 | Sundarrajan et al. | Aug 2012 | B2 |
| 8261057 | Sundarrajan et al. | Sep 2012 | B2 |
| 8291119 | Rao et al. | Oct 2012 | B2 |
| 8351327 | Binns | Jan 2013 | B1 |
| 8495305 | Sundarrajan et al. | Jul 2013 | B2 |
| 8499057 | Sundarrajan et al. | Jul 2013 | B2 |
| 8559449 | Rao et al. | Oct 2013 | B2 |
| 20010030970 | Wiryaman et al. | Oct 2001 | A1 |
| 20010037387 | Gilde et al. | Nov 2001 | A1 |
| 20010043600 | Chatterjee et al. | Nov 2001 | A1 |
| 20010046212 | Nakajima | Nov 2001 | A1 |
| 20010047406 | Araujo et al. | Nov 2001 | A1 |
| 20010049717 | Freeman et al. | Dec 2001 | A1 |
| 20010049741 | Skene et al. | Dec 2001 | A1 |
| 20010052016 | Skene et al. | Dec 2001 | A1 |
| 20010052065 | Alexander, III et al. | Dec 2001 | A1 |
| 20020004834 | Guenther et al. | Jan 2002 | A1 |
| 20020004902 | Toh et al. | Jan 2002 | A1 |
| 20020007402 | Thomas Huston et al. | Jan 2002 | A1 |
| 20020007404 | Vange et al. | Jan 2002 | A1 |
| 20020016827 | McCabe et al. | Feb 2002 | A1 |
| 20020023210 | Tuomenoksa et al. | Feb 2002 | A1 |
| 20020026478 | Rodgers et al. | Feb 2002 | A1 |
| 20020026531 | Keane et al. | Feb 2002 | A1 |
| 20020029285 | Collins | Mar 2002 | A1 |
| 20020032725 | Araujo et al. | Mar 2002 | A1 |
| 20020032798 | Xu | Mar 2002 | A1 |
| 20020035451 | Rothermel | Mar 2002 | A1 |
| 20020035596 | Yang et al. | Mar 2002 | A1 |
| 20020038339 | Xu | Mar 2002 | A1 |
| 20020042875 | Shukla | Apr 2002 | A1 |
| 20020049608 | Hartsell et al. | Apr 2002 | A1 |
| 20020049841 | Johnson et al. | Apr 2002 | A1 |
| 20020055966 | Border et al. | May 2002 | A1 |
| 20020057717 | Mallory | May 2002 | A1 |
| 20020059274 | Hartsell et al. | May 2002 | A1 |
| 20020059429 | Carpenter et al. | May 2002 | A1 |
| 20020059435 | Border et al. | May 2002 | A1 |
| 20020065864 | Hartsell et al. | May 2002 | A1 |
| 20020065919 | Taylor et al. | May 2002 | A1 |
| 20020069278 | Forslow | Jun 2002 | A1 |
| 20020071438 | Singh | Jun 2002 | A1 |
| 20020073061 | Collins | Jun 2002 | A1 |
| 20020073298 | Geiger et al. | Jun 2002 | A1 |
| 20020081971 | Travostino | Jun 2002 | A1 |
| 20020083175 | Afek et al. | Jun 2002 | A1 |
| 20020083183 | Pujare et al. | Jun 2002 | A1 |
| 20020087729 | Edgar | Jul 2002 | A1 |
| 20020091788 | Chlan et al. | Jul 2002 | A1 |
| 20020095400 | Johnson et al. | Jul 2002 | A1 |
| 20020095498 | Chanda et al. | Jul 2002 | A1 |
| 20020098840 | Hanson et al. | Jul 2002 | A1 |
| 20020099940 | Wang | Jul 2002 | A1 |
| 20020101848 | Lee et al. | Aug 2002 | A1 |
| 20020101860 | Thornton et al. | Aug 2002 | A1 |
| 20020105972 | Richter et al. | Aug 2002 | A1 |
| 20020107903 | Richter et al. | Aug 2002 | A1 |
| 20020107962 | Richter et al. | Aug 2002 | A1 |
| 20020107971 | Bailey et al. | Aug 2002 | A1 |
| 20020107989 | Johnson et al. | Aug 2002 | A1 |
| 20020107990 | Johnson et al. | Aug 2002 | A1 |
| 20020108059 | Canion et al. | Aug 2002 | A1 |
| 20020116452 | Johnson et al. | Aug 2002 | A1 |
| 20020116582 | Copeland et al. | Aug 2002 | A1 |
| 20020120743 | Shabtay et al. | Aug 2002 | A1 |
| 20020126675 | Yoshimura et al. | Sep 2002 | A1 |
| 20020133593 | Johnson et al. | Sep 2002 | A1 |
| 20020138511 | Psounis et al. | Sep 2002 | A1 |
| 20020138572 | Delany et al. | Sep 2002 | A1 |
| 20020138618 | Szabo | Sep 2002 | A1 |
| 20020138640 | Raz et al. | Sep 2002 | A1 |
| 20020147795 | Cantwell | Oct 2002 | A1 |
| 20020147822 | Susai et al. | Oct 2002 | A1 |
| 20020150064 | Lucidarme | Oct 2002 | A1 |
| 20020152373 | Sun et al. | Oct 2002 | A1 |
| 20020152423 | McCabe | Oct 2002 | A1 |
| 20020156927 | Boucher et al. | Oct 2002 | A1 |
| 20020161908 | Benitez et al. | Oct 2002 | A1 |
| 20020163882 | Bornstein et al. | Nov 2002 | A1 |
| 20020174227 | Hartsell et al. | Nov 2002 | A1 |
| 20020174255 | Hayter et al. | Nov 2002 | A1 |
| 20020176532 | McClelland et al. | Nov 2002 | A1 |
| 20020184224 | Haff et al. | Dec 2002 | A1 |
| 20020194382 | Kausik et al. | Dec 2002 | A1 |
| 20020196279 | Bloomfield et al. | Dec 2002 | A1 |
| 20020199007 | Clayton et al. | Dec 2002 | A1 |
| 20030009538 | Shah et al. | Jan 2003 | A1 |
| 20030014623 | Freed et al. | Jan 2003 | A1 |
| 20030014624 | Maturana et al. | Jan 2003 | A1 |
| 20030014625 | Freed et al. | Jan 2003 | A1 |
| 20030014628 | Freed et al. | Jan 2003 | A1 |
| 20030014650 | Freed et al. | Jan 2003 | A1 |
| 20030018891 | Hall et al. | Jan 2003 | A1 |
| 20030023767 | Brabson et al. | Jan 2003 | A1 |
| 20030026241 | Ono et al. | Feb 2003 | A1 |
| 20030033520 | Peiffer et al. | Feb 2003 | A1 |
| 20030037108 | Peiffer et al. | Feb 2003 | A1 |
| 20030039354 | Kimble et al. | Feb 2003 | A1 |
| 20030046586 | Bheemarasetti et al. | Mar 2003 | A1 |
| 20030046587 | Bheemarasetti et al. | Mar 2003 | A1 |
| 20030051100 | Patel | Mar 2003 | A1 |
| 20030051102 | Jacobs et al. | Mar 2003 | A1 |
| 20030055883 | Wiles, Jr. | Mar 2003 | A1 |
| 20030055962 | Freund et al. | Mar 2003 | A1 |
| 20030061505 | Sperry et al. | Mar 2003 | A1 |
| 20030065646 | Joseph et al. | Apr 2003 | A1 |
| 20030065763 | Swildens et al. | Apr 2003 | A1 |
| 20030067874 | See et al. | Apr 2003 | A1 |
| 20030069941 | Peiffer | Apr 2003 | A1 |
| 20030079031 | Nagano | Apr 2003 | A1 |
| 20030084162 | Johnson et al. | May 2003 | A1 |
| 20030084165 | Kjellberg et al. | May 2003 | A1 |
| 20030088698 | Singh et al. | May 2003 | A1 |
| 20030088788 | Yang | May 2003 | A1 |
| 20030093566 | Jardin | May 2003 | A1 |
| 20030105604 | Ash et al. | Jun 2003 | A1 |
| 20030105977 | Brabson et al. | Jun 2003 | A1 |
| 20030110296 | Kirsch et al. | Jun 2003 | A1 |
| 20030110379 | Ylonen et al. | Jun 2003 | A1 |
| 20030112809 | Bharali et al. | Jun 2003 | A1 |
| 20030112823 | Collins et al. | Jun 2003 | A1 |
| 20030115421 | McHenry et al. | Jun 2003 | A1 |
| 20030123394 | Neale et al. | Jul 2003 | A1 |
| 20030123481 | Neale et al. | Jul 2003 | A1 |
| 20030131079 | Neale et al. | Jul 2003 | A1 |
| 20030131263 | Keane et al. | Jul 2003 | A1 |
| 20030135505 | Hind et al. | Jul 2003 | A1 |
| 20030140121 | Adams | Jul 2003 | A1 |
| 20030149899 | Boden et al. | Aug 2003 | A1 |
| 20030152028 | Raisanen et al. | Aug 2003 | A1 |
| 20030152096 | Chapman | Aug 2003 | A1 |
| 20030154110 | Walter et al. | Aug 2003 | A1 |
| 20030154239 | Davis et al. | Aug 2003 | A1 |
| 20030165138 | Swonk et al. | Sep 2003 | A1 |
| 20030167403 | McCurley et al. | Sep 2003 | A1 |
| 20030174718 | Sampath et al. | Sep 2003 | A1 |
| 20030177389 | Albert et al. | Sep 2003 | A1 |
| 20030177395 | Pardee et al. | Sep 2003 | A1 |
| 20030182423 | Shafir et al. | Sep 2003 | A1 |
| 20030182431 | Sturniolo et al. | Sep 2003 | A1 |
| 20030182437 | Kobayashi et al. | Sep 2003 | A1 |
| 20030188001 | Eisenberg et al. | Oct 2003 | A1 |
| 20030191799 | Araujo et al. | Oct 2003 | A1 |
| 20030191812 | Agarwalla et al. | Oct 2003 | A1 |
| 20030198189 | Roberts et al. | Oct 2003 | A1 |
| 20030200295 | Roberts et al. | Oct 2003 | A1 |
| 20030200353 | Dogra et al. | Oct 2003 | A1 |
| 20030208602 | Bhalla et al. | Nov 2003 | A1 |
| 20030212760 | Chen et al. | Nov 2003 | A1 |
| 20030212776 | Roberts et al. | Nov 2003 | A1 |
| 20030217105 | Zircher et al. | Nov 2003 | A1 |
| 20030217126 | Polcha et al. | Nov 2003 | A1 |
| 20030217149 | Crichton et al. | Nov 2003 | A1 |
| 20030223361 | Hussain et al. | Dec 2003 | A1 |
| 20030223418 | Desai et al. | Dec 2003 | A1 |
| 20030223433 | Lee et al. | Dec 2003 | A1 |
| 20030226018 | Tardo et al. | Dec 2003 | A1 |
| 20030229718 | Tock et al. | Dec 2003 | A1 |
| 20030229761 | Basu et al. | Dec 2003 | A1 |
| 20030233423 | Dilley et al. | Dec 2003 | A1 |
| 20030236831 | Ortiz et al. | Dec 2003 | A1 |
| 20030236837 | Johnson et al. | Dec 2003 | A1 |
| 20030236861 | Johnson et al. | Dec 2003 | A1 |
| 20030236919 | Johnson et al. | Dec 2003 | A1 |
| 20040003101 | Roth et al. | Jan 2004 | A1 |
| 20040003137 | Callender et al. | Jan 2004 | A1 |
| 20040006708 | Mukherjee et al. | Jan 2004 | A1 |
| 20040008693 | Grove et al. | Jan 2004 | A1 |
| 20040010601 | Afergan et al. | Jan 2004 | A1 |
| 20040010604 | Tanaka et al. | Jan 2004 | A1 |
| 20040010621 | Afergan et al. | Jan 2004 | A1 |
| 20040026971 | McClellan-Derrickson | Feb 2004 | A1 |
| 20040031058 | Reisman | Feb 2004 | A1 |
| 20040034744 | Karlsson et al. | Feb 2004 | A1 |
| 20040034794 | Mayer et al. | Feb 2004 | A1 |
| 20040039827 | Thomas et al. | Feb 2004 | A1 |
| 20040042487 | Ossman | Mar 2004 | A1 |
| 20040044521 | Chen et al. | Mar 2004 | A1 |
| 20040044731 | Chen et al. | Mar 2004 | A1 |
| 20040049515 | Haff et al. | Mar 2004 | A1 |
| 20040073716 | Boom et al. | Apr 2004 | A1 |
| 20040078621 | Talaugon et al. | Apr 2004 | A1 |
| 20040078772 | Balay et al. | Apr 2004 | A1 |
| 20040087304 | Buddhikot et al. | May 2004 | A1 |
| 20040098486 | Gu et al. | May 2004 | A1 |
| 20040100976 | Chang et al. | May 2004 | A1 |
| 20040103150 | Ogdon et al. | May 2004 | A1 |
| 20040103225 | McAlpine et al. | May 2004 | A1 |
| 20040103438 | Yan et al. | May 2004 | A1 |
| 20040107360 | Herrmann et al. | Jun 2004 | A1 |
| 20040111519 | Fu et al. | Jun 2004 | A1 |
| 20040128252 | Shirai et al. | Jul 2004 | A1 |
| 20040128346 | Melamed et al. | Jul 2004 | A1 |
| 20040141525 | Bhushan et al. | Jul 2004 | A1 |
| 20040143655 | Narad et al. | Jul 2004 | A1 |
| 20040143734 | Buer et al. | Jul 2004 | A1 |
| 20040146053 | Nabhan et al. | Jul 2004 | A1 |
| 20040162876 | Kohavi | Aug 2004 | A1 |
| 20040177158 | Bauch et al. | Sep 2004 | A1 |
| 20040177359 | Bauch et al. | Sep 2004 | A1 |
| 20040190092 | Silverbrook et al. | Sep 2004 | A1 |
| 20040202160 | Westphal | Oct 2004 | A1 |
| 20040202171 | Hama | Oct 2004 | A1 |
| 20040203296 | Moreton et al. | Oct 2004 | A1 |
| 20040205439 | Carmeli et al. | Oct 2004 | A1 |
| 20040210320 | Pandya | Oct 2004 | A1 |
| 20040213248 | Okuda et al. | Oct 2004 | A1 |
| 20040215665 | Edgar et al. | Oct 2004 | A1 |
| 20040215746 | McCanne et al. | Oct 2004 | A1 |
| 20040221031 | Desai | Nov 2004 | A1 |
| 20040225898 | Frost et al. | Nov 2004 | A1 |
| 20040225911 | Smith | Nov 2004 | A1 |
| 20040246971 | Banerjee et al. | Dec 2004 | A1 |
| 20040249911 | Alkhatib et al. | Dec 2004 | A1 |
| 20040249975 | Tuck et al. | Dec 2004 | A1 |
| 20040258003 | Kokot et al. | Dec 2004 | A1 |
| 20040260922 | Goodman et al. | Dec 2004 | A1 |
| 20040268175 | Koch et al. | Dec 2004 | A1 |
| 20040268357 | Joy et al. | Dec 2004 | A1 |
| 20040268358 | Darling et al. | Dec 2004 | A1 |
| 20050005014 | Holmes et al. | Jan 2005 | A1 |
| 20050005107 | Touboul | Jan 2005 | A1 |
| 20050013280 | Buddhikot et al. | Jan 2005 | A1 |
| 20050021511 | Zarom | Jan 2005 | A1 |
| 20050021761 | Thomas | Jan 2005 | A1 |
| 20050021762 | Gbadegesin | Jan 2005 | A1 |
| 20050022011 | Swander et al. | Jan 2005 | A1 |
| 20050022012 | Bluestone et al. | Jan 2005 | A1 |
| 20050022031 | Goodman et al. | Jan 2005 | A1 |
| 20050025150 | Helmy et al. | Feb 2005 | A1 |
| 20050027788 | Koopmans et al. | Feb 2005 | A1 |
| 20050031058 | Soong et al. | Feb 2005 | A1 |
| 20050033858 | Swildens et al. | Feb 2005 | A1 |
| 20050033926 | Dumont | Feb 2005 | A1 |
| 20050044350 | White et al. | Feb 2005 | A1 |
| 20050050317 | Kramer et al. | Mar 2005 | A1 |
| 20050055690 | Cornillon et al. | Mar 2005 | A1 |
| 20050058112 | Lahey et al. | Mar 2005 | A1 |
| 20050080850 | Salesky et al. | Apr 2005 | A1 |
| 20050080907 | Panasyuk et al. | Apr 2005 | A1 |
| 20050094582 | Forissier et al. | May 2005 | A1 |
| 20050102529 | Buddhikot et al. | May 2005 | A1 |
| 20050108412 | Sjollema et al. | May 2005 | A1 |
| 20050108517 | Dillon et al. | May 2005 | A1 |
| 20050122980 | Anand et al. | Jun 2005 | A1 |
| 20050125663 | Funk | Jun 2005 | A1 |
| 20050132030 | Hopen et al. | Jun 2005 | A1 |
| 20050132060 | Mo et al. | Jun 2005 | A1 |
| 20050135250 | Singh et al. | Jun 2005 | A1 |
| 20050144186 | Hesselink et al. | Jun 2005 | A1 |
| 20050144481 | Hopen et al. | Jun 2005 | A1 |
| 20050144614 | Moslander et al. | Jun 2005 | A1 |
| 20050147126 | Qiu et al. | Jul 2005 | A1 |
| 20050149481 | Hesselink et al. | Jul 2005 | A1 |
| 20050149726 | Joshi et al. | Jul 2005 | A1 |
| 20050165928 | Shu et al. | Jul 2005 | A1 |
| 20050177866 | Kirsch | Aug 2005 | A1 |
| 20050185647 | Rao et al. | Aug 2005 | A1 |
| 20050193075 | Haff et al. | Sep 2005 | A1 |
| 20050195780 | Haverinen et al. | Sep 2005 | A1 |
| 20050198380 | Panasyuk et al. | Sep 2005 | A1 |
| 20050198532 | Comlekoglu et al. | Sep 2005 | A1 |
| 20050210150 | Bahl | Sep 2005 | A1 |
| 20050223084 | Cheng | Oct 2005 | A1 |
| 20050223412 | Nadalin et al. | Oct 2005 | A1 |
| 20050232161 | Maufer et al. | Oct 2005 | A1 |
| 20050232298 | Beverly et al. | Oct 2005 | A1 |
| 20050246346 | Gerdes et al. | Nov 2005 | A1 |
| 20050246445 | Panasyuk et al. | Nov 2005 | A1 |
| 20050256923 | Adachi | Nov 2005 | A1 |
| 20050259634 | Ross | Nov 2005 | A1 |
| 20050262357 | Araujo et al. | Nov 2005 | A1 |
| 20050265315 | Edgar | Dec 2005 | A1 |
| 20050265353 | Sengupta et al. | Dec 2005 | A1 |
| 20050267974 | Panasyuk et al. | Dec 2005 | A1 |
| 20050286466 | Tagg et al. | Dec 2005 | A1 |
| 20060005240 | Sundarrajan et al. | Jan 2006 | A1 |
| 20060015570 | Khemani et al. | Jan 2006 | A1 |
| 20060018332 | Kakani et al. | Jan 2006 | A1 |
| 20060031547 | Tsui et al. | Feb 2006 | A1 |
| 20060034283 | Ko et al. | Feb 2006 | A1 |
| 20060041635 | Alexander et al. | Feb 2006 | A1 |
| 20060053164 | Ewing et al. | Mar 2006 | A1 |
| 20060053253 | Roth et al. | Mar 2006 | A1 |
| 20060059370 | Asnis et al. | Mar 2006 | A1 |
| 20060064500 | Roth et al. | Mar 2006 | A1 |
| 20060067257 | Bonta | Mar 2006 | A1 |
| 20060069719 | McCanne et al. | Mar 2006 | A1 |
| 20060080441 | Chen et al. | Apr 2006 | A1 |
| 20060089996 | Peiffer | Apr 2006 | A1 |
| 20060106943 | Akisada et al. | May 2006 | A1 |
| 20060112185 | Van Bemmel | May 2006 | A1 |
| 20060123477 | Raghavan et al. | Jun 2006 | A1 |
| 20060129528 | Miyamoto et al. | Jun 2006 | A1 |
| 20060129689 | Ho et al. | Jun 2006 | A1 |
| 20060133405 | Fee | Jun 2006 | A1 |
| 20060142878 | Banik et al. | Jun 2006 | A1 |
| 20060146877 | Srivastava | Jul 2006 | A1 |
| 20060156023 | Luo et al. | Jul 2006 | A1 |
| 20060161680 | Balsevich | Jul 2006 | A1 |
| 20060167883 | Boukobza | Jul 2006 | A1 |
| 20060185010 | Sultan | Aug 2006 | A1 |
| 20060190719 | Rao et al. | Aug 2006 | A1 |
| 20060225130 | Chen et al. | Oct 2006 | A1 |
| 20060245414 | Susai et al. | Nov 2006 | A1 |
| 20060271652 | Stavrakos et al. | Nov 2006 | A1 |
| 20060274761 | Error et al. | Dec 2006 | A1 |
| 20060274828 | Siemens et al. | Dec 2006 | A1 |
| 20070008883 | Kobayashi | Jan 2007 | A1 |
| 20070038703 | Tendjoukian et al. | Feb 2007 | A1 |
| 20070061067 | Zeinstra et al. | Mar 2007 | A1 |
| 20070067366 | Landis | Mar 2007 | A1 |
| 20070073703 | Quin | Mar 2007 | A1 |
| 20070110046 | Farrell et al. | May 2007 | A1 |
| 20070130324 | Wang | Jun 2007 | A1 |
| 20070130334 | Carley | Jun 2007 | A1 |
| 20070156852 | Sundarrajan et al. | Jul 2007 | A1 |
| 20070169179 | Narad | Jul 2007 | A1 |
| 20070179955 | Croft et al. | Aug 2007 | A1 |
| 20070192827 | Maxted et al. | Aug 2007 | A1 |
| 20070198684 | Mizushima | Aug 2007 | A1 |
| 20070203910 | Ferguson et al. | Aug 2007 | A1 |
| 20070206621 | Plamondon et al. | Sep 2007 | A1 |
| 20070233910 | Paley et al. | Oct 2007 | A1 |
| 20070245409 | Harris et al. | Oct 2007 | A1 |
| 20070271570 | Brown et al. | Nov 2007 | A1 |
| 20080034416 | Kumar et al. | Feb 2008 | A1 |
| 20080046616 | Verzunov et al. | Feb 2008 | A1 |
| 20080049786 | Ram et al. | Feb 2008 | A1 |
| 20080071915 | Gbadegesin | Mar 2008 | A1 |
| 20080104089 | Pragada et al. | May 2008 | A1 |
| 20080225720 | Khemani et al. | Sep 2008 | A1 |
| 20080225748 | Khemani et al. | Sep 2008 | A1 |
| 20080225753 | Khemani et al. | Sep 2008 | A1 |
| 20080229381 | Sikka et al. | Sep 2008 | A1 |
| 20080320007 | Hind et al. | Dec 2008 | A1 |
| 20080320151 | McCanne et al. | Dec 2008 | A1 |
| 20090034537 | Colrain et al. | Feb 2009 | A1 |
| 20090133015 | Nagashima | May 2009 | A1 |
| 20090234957 | Li et al. | Sep 2009 | A1 |
| 20090271385 | Krishnamoorthy et al. | Oct 2009 | A1 |
| 20100005180 | Tyukasz et al. | Jan 2010 | A1 |
| 20100241846 | Sundarrajan et al. | Sep 2010 | A1 |
| 20110145330 | Sundarrajan et al. | Jun 2011 | A1 |
| 20110258273 | Crawford | Oct 2011 | A1 |
| 20130112823 | Kreft | May 2013 | A1 |
| Number | Date | Country |
|---|---|---|
| 1394042 | Jan 2003 | CN |
| 1410905 | Apr 2003 | CN |
| 0 838 930 | Jan 1900 | EP |
| 0 436 365 | Jul 1991 | EP |
| 0 618 708 | Oct 1994 | EP |
| 1 045 553 | Oct 2000 | EP |
| 1045553 | Oct 2000 | EP |
| 1134942 | Sep 2001 | EP |
| 1427133 | Jun 2004 | EP |
| 1432209 | Jun 2004 | EP |
| 07302237 | Nov 1995 | JP |
| 08-006910 | Jan 1996 | JP |
| 10-178450 | Jun 1998 | JP |
| 2002-532784 | Feb 2002 | JP |
| 2002-084289 | Mar 2002 | JP |
| 2004-078783 | Mar 2004 | JP |
| WO-9904343 | Jan 1999 | WO |
| WO-0034885 | Jun 2000 | WO |
| WO-0147185 | Jun 2001 | WO |
| WO-0213037 | Feb 2002 | WO |
| WO-0223362 | Mar 2002 | WO |
| WO-0239301 | May 2002 | WO |
| WO-02069604 | Sep 2002 | WO |
| WO-03019876 | Mar 2003 | WO |
| WO-03026244 | Mar 2003 | WO |
| WO-03048936 | Jun 2003 | WO |
| WO-03083692 | Oct 2003 | WO |
| WO-2004088933 | Oct 2004 | WO |
| WO-2004114529 | Dec 2004 | WO |
| WO-2005013534 | Feb 2005 | WO |
| WO-2005024567 | Mar 2005 | WO |
| WO-2005048106 | May 2005 | WO |
| WO-2005088476 | Sep 2005 | WO |
| WO-2006005078 | Jan 2006 | WO |
| WO-2006012612 | Feb 2006 | WO |
| WO-2006020823 | Feb 2006 | WO |
| WO-2006074072 | Jul 2006 | WO |
| WO-2006075219 | Jul 2006 | WO |
| WO-2008112691 | Sep 2008 | WO |
| WO-2008112698 | Sep 2008 | WO |
| Entry |
|---|
| EP Communication for EP Patent Application No. 07007414.1 dated Jun. 5, 2008. (6 pages). |
| EP Communication for European Patent Application No. 05776653.7 dated Oct. 5, 2007. (7 pages). |
| EP Communication from EP Patent Application No. 05 785 297.2, dated May 18, 2007, 2 pages. |
| European Search Report for European Patent Application No. EP 07007414 dated Jul. 16, 2007. (2 pages). |
| Final Office Action dated Dec. 9, 2008 pertaining to U.S. Appl. No. 11/187,562. 15 pages. |
| Final Office Action dated Dec. 23, 2008 pertaining to U.S. Appl. No. 11/188,279. 12 pages. |
| International Search Report for PCT/US2005/022884, mailed on Jul. 8, 2008. |
| International Search Report for PCT/US2005/026300, Mailing date: Dec. 16, 2005. 3 pages. |
| International Search Report for PCT/US2005/028663, Mailing date: Nov. 16, 2005. 3 pages. |
| International Search Report to PCT/US04/37918, mailed on Apr. 27, 2008, 1 page. |
| International Search Report to PCT/US2005/026296, mailed on Jan. 31, 2006, 5 pgs. |
| Non Final Office Action dated Jan. 24, 2008 pertaining to U.S. Appl. No. 10/988,004. 6 pages. |
| Non Final Office Action dated Jun. 10, 2008 pertaining to U.S. Appl. No. 11/187,562. 15 pages. |
| Non Final Office Action dated Jun. 23, 2008 pertaining to U.S. Appl. No. 11/039,946. (14 pages). |
| Non Final Office Action dated Aug. 5, 2008 pertaining to U.S. Appl. No. 11/161,091. 17 pages. |
| Non Final Office Action dated Aug. 20, 2008 pertaining to U.S. Appl. No. 11/161,092. (16 pages). |
| Non Final Office Action dated Oct. 28, 2008 pertaining to U.S. Appl. No. 11/161,656. 21 pages. |
| Non Final Office Action dated Dec. 11, 2007 pertaining to U.S. Appl. No. 10/683,881. 10 pages. |
| Non Final Office Action dated Jun. 26, 2008 pertaining to U.S. Appl. No. 11/188,279. 12 pages. |
| Non Final Office Action dated Aug. 15, 2008 pertaining to U.S. Appl. No. 11/161,090 25 pages. |
| Notice of Allowance dated Sep. 18, 2008. U.S. Appl. No. 10/988,004 5 pgs. |
| Office Action dated Sep. 26, 2008 from Chinese Application No. 200480040249.X corresponding to U.S. Appl. No. 10/988,004 22 pgs. |
| Written Opinion of the International Searching Authority to PCT/US04/37918, mailed on Apr. 27, 2005, 7 pages. |
| Written Opinion of the International Searching Authority to PCT/US2005/026296, mailed on Jan. 31, 2006. |
| Written Opinion of the International Searching Authority to PCT/US2005/026300; Mailed on Dec. 16, 2005, 7 pages. |
| Written Opinion of the International Searching Authority to PCT/US2005/028663; Mailed on Nov. 16, 2005, 7 pages. |
| Written Opinion of the ISA for PCT/US2005/022884, mailed on Jul. 8, 2008. |
| Advisory Action for U.S. Appl. No. 11/187,512 dated Mar. 16, 2011. |
| Advisory Action for U.S. Appl. No. 11/161,093 dated Nov. 16, 2009. |
| Advisory Action for U.S. Appl. No. 11/161,093 dated Dec. 14, 2009. |
| Advisory Action for U.S. Appl. No. 11/039,946 dated Mar. 24, 2009. |
| Advisory Action for U.S. Appl. No. 11/161,091 dated May 6, 2009. |
| Advisory Action for U.S. Appl. No. 11/161,092 dated Apr. 24, 2009. |
| Advisory Action for U.S. Appl. No. 11/161,656 dated Jul. 29, 2009. |
| Biagioni et al., Signature for a network Protocol Stack: A System Application of Standard ML, Jul. 1994. |
| Canadian Office Action for CA appl. 2545496 dated Feb. 15, 2011. |
| Chinese Office Action on 200580028535.9 dated Dec. 13, 2011. |
| Dictionary service [online], [retrieved on Jul. 23, 2009]. Retrieved from the Internet &It;URL: http://dictionary.reference.com/browse/discard>. |
| Doug Allen, Layer-7 Load Balancers Pack New Punch, CMP Media LLC Network Magazine, Sep. 2003. |
| EP Search Report for EP appl. 10184310.0 dated Dec. 9, 2010. |
| European Communication on 05763688.8 dated Dec. 20, 2011. |
| European Communication on 05776653.7 dated Jun. 24, 2011. |
| European Communication on 05855922.0 dated Nov. 24, 2011. |
| European Exam Report on 07007414.1 dated Aug. 11, 2011. |
| European Exam Report on 10184310.0 dated Aug. 11, 2011. |
| European Examination Report on 05774886.5 dated Nov. 24, 2011. |
| European Examination Report on 05855924.6 dated Nov. 24, 2011. |
| European Supplemental Search Report on 05763688.8 dated Dec. 1, 2011. |
| Exam report for EP appl. 05785297.2 dated Jun. 19, 2009. |
| Exam Report for EP appl. 070074141 dated Nov. 17, 2009. |
| Exam Report for EP appln 05776653.7 dated Apr. 20, 2009. |
| Japanese Office Action on 2007-48001 dated Oct. 29, 2010. |
| Japanese Office Action on 2007-48003 dated Nov. 8, 2010. |
| Kong, et al; “Pseudo-serving: a user-responsible paradigm for internet access”; Apr. 7-11, 1997; SO Computer Networks and ISDN Systems; vol. 29; pp. 1053-1064. |
| Korean Office Action for KR appl. 2006-7009144 dated Jan. 14, 2011. |
| Krishnamurthy B.C. et al., “Key differences between HTTP/1.0 and HTTP/1.1,” Computer Networks, Elsevier Science Publishers B.V., vol. 31, No. 11-16, pp. 1737-1751, May 1999. |
| Lazenka, M. “The Evolution of Software Distribution: Where Did We Come From and Where Are We Heading?”, 2005, ACM, p. 179-183. |
| Ipswitch Inc., WSFTP User's Guide, Chapter 8: Security, Jun. 25, 2003, 8 pages. |
| Noriaki Kobayashi, “Internet VPN”, N+1 Network Guide, vol. 3, No. 9, Oct. 1, 2003, pp. 44-49. (9 pages) (English Abstract). |
| Notice of Acceptance for AU 2010214746 dated Nov. 2, 2010. |
| Notice of Acceptance for AU Appl. 2005266943 dated May 28, 2010. (3 pages). |
| Notice of Acceptance for AU Appl. 2005272779 dated May 26, 2010. (3 pages). |
| Notice of Allowance for U.S. Appl. No. 11/161,090 dated Mar. 4, 2011. |
| Notice of Allowance for U.S. Appl. No. 12/336,795 dated Mar. 2, 2011. |
| Notice of Allowance for U.S. Appl. No. 11/187,512 dated Jun. 23, 2011. |
| Notice of Allowance for U.S. Appl. No. 11/161,092 dated Jun. 11, 2009. |
| Notice of Allowance for U.S. Appl. No. 11/161,656 dated Sep. 18, 2009. |
| Notice of Allowance on U.S. Appl. No. 12/557,497 dated May 6, 2011. |
| Notice of Allowance on U.S. Appl. No. 12/560,154 dated May 2, 2011. |
| Office Action for AU appl. 2005266943 dated May 14, 2009. |
| Office Action for AU appl. 2005272779 dated Apr. 23, 2009. |
| Office Action for CN Appl. 20050034849X dated Aug. 3, 2010. |
| Office Action for CN appl. 200580034849.X dated Sep. 25, 2009. |
| Office Action for CN appln 00480040249.X dated Jun. 19, 2009. |
| Office Action for CN appln 200580028535 dated Jan. 15, 2010. |
| Office Action for CN appln 200580034849X dated Apr. 7, 2010. |
| Office Action for IL Application No. 180402 dated Dec. 15, 2010. |
| Office Action for IL Application No. 180405 dated Jan. 2, 2011. |
| Office Action for IL Application No. 180891 dated Jan. 4, 2011. |
| Office Action for IL application No. 18169 dated Jan. 2, 2011. |
| Office Action for IN Appl. 1514KOLNP2006 dated Sep. 7, 2010 (3 pages). |
| Office Action for JP App. No. 2007-48001 dated Apr. 29, 2010. |
| Office Action for JP appl. 2006-539930 dated Feb. 18, 2010. |
| Office Action for JP Appl. 2007-048002 dated Nov. 8, 2010. (7 pages) (English Abstract). |
| Office Action for JP Appl. 2007-519353 dated Jul. 12, 2010. (6 pages) (English Abstract). |
| Office Action for JP Appl. 2007-522841 dated Sep. 10, 2010. (9 pages) (English Abstract). |
| Office Action for JP appl. 2007-522843 dated Dec. 1, 2010. |
| Office Action for JP Appl. 2007-525810 dated Aug. 4, 2010. (9 pages) (English Abstract). |
| Office Action for U.S. Appl. No. 11/161,091 dated Apr. 5, 2011. |
| Office Action for U.S. Appl. No. 11/187,512 dated Jun. 22, 2010. (20 pages). |
| Office Action for U.S. Appl. No. 11/188,274 dated Mar. 29, 2010. (15 pages). |
| Non-Final Office Action for U.S. Appl. No. 12/871,246 mailed Feb. 24, 2011. |
| Office Action for U.S. Appl. No. 12/560,154 dated Feb. 4, 2011. |
| Office Action for U.S. Appl. No. 12/560,154 dated Sep. 1, 2010. |
| Office Action for U.S. Appl. No. 11/161,093 dated Jan. 2, 2009. |
| Office Action for U.S. Appl. No. 11/187,512 dated Mar. 3, 2009. |
| Office Action for U.S. Appl. No. 11/187,512 dated Sep. 15, 2009. |
| Office Action for U.S. Appl. No. 11/161,093 dated Jun. 19, 2009. |
| Office Action for U.S. Appl. No. 11/161,091 dated Dec. 7, 2010. |
| Office Action for U.S. Appl. No. 11/187,512 dated Nov. 30, 2010. |
| Office Action for U.S. Appl. No. 12/336,795 dated Dec. 16, 2010. |
| Office action for U.S. Appl. No. 11/161,090 dated Jun. 10, 2010. |
| Office Action for U.S. Appl. No. 11/161,093 dated Sep. 2, 2009. |
| Office Action for U.S. Appl. No. 11/039,946 dated Jan. 23, 2009. |
| Office Action for U.S. Appl. No. 11/039,946 dated Jun. 23, 2009. |
| Office action for U.S. Appl. No. 11/161,090 dated Jan. 6, 2010. |
| Office action for U.S. Appl. No. 11/161,090 dated May 28, 2009. |
| Office Action for U.S. Appl. No. 11/161,093 dated Feb. 22, 2010. |
| Office action for U.S. Appl. No. 11/161,091 dated Feb. 24, 2010. |
| Office action for U.S. Appl. No. 11/161,091 dated Aug. 3, 2009. |
| Office Action for U.S. Appl. No. 11/161,656 dated May 13, 2009. |
| Office Action for U.S. Appl. No. 11/187,512 dated Dec. 23, 2009. |
| Office Action on U.S. Appl. No. 11/161,091 dated Oct. 5, 2011. |
| Office Action on U.S. Appl. No. 11/161,093 dated Nov. 3, 2011. |
| Office Action on U.S. Appl. No. 11/161,093 dated Jun. 28, 2011. |
| Office Action on U.S. Appl. No. 11/188,274 dated Oct. 18, 2011. |
| Office Action on U.S. Appl. No. 11/188,274 dated Jun. 27, 2011. |
| Office Action on U.S. Appl. No. 12/557,497 dated Nov. 18, 2010. |
| Office Action on U.S. Appl. No. 12/557,497 dated Nov. 19, 2010. |
| Office Action on U.S. Appl. No. 12/794,446 dated Nov. 23, 2011. |
| Office Action on U.S. Appl. No. 12/871,246 dated Sep. 27, 2011. |
| Pedro Hernandez, “Tacit Adds to Softricity's Spark”, Nov. 18, 2005. Available online at: www.enterpriseitplant.com/networking/news/article.php/3565401. |
| R. Briscoe, “The Implications of Pervasive Computing on Network Design,” BT Technology Journal, pp. 170-190, Jul. 2004. |
| Ranzau et al., “Softricity/Tacit, An Innovative Approach to Virtual Computing,” http://www.daboc.com/downloadnow.aspx?file=211&is=617, Oct. 20, 2005. |
| Restriction Requirement for U.S. Appl. No. 11/161,093 dated Jul. 26, 2010.(9 pages). |
| Search Report for EP appl. 10184310.0 dated Dec. 9, 2010. |
| Summons to Oral Proceedings for EP appl. 05776653.7 dated Jan. 14, 2011. |
| Supplementary European Search Report for EP04810901 dated Jul. 20, 2011. |
| Teruhara Serada, “SSL VPN”, N+1 Network LAN, vol. 21, No. 3, Mar. 1, 2003, pp. 25-40. (19 pages) (English Abstract). |
| Yoshikazu Kobayashi, VPN service introduction, Computer & Network LAN, vol. 21, No. 3, Mar. 1, 2003, pp. 25-40. (19 pages) (English Abstract). |
| Office Action for CN Appl. 200580030928.3 dated Apr. 23, 2010.(5 pages). |
| EP Search Report for EP appl. 10184317.5 dated Dec. 7, 2010. |
| “Cisco Distributed Director,” Posted Feb. 21, 1997, 16 pages, [Online] [Retrieved on Dec. 4, 1997] Retrieved from the Internet<URL:http://www.cisco.com/wart/public/751/distdir/dd—wp.htm>. |
| Dutta D. et al., An Active Proxy Based Architecture for TCP in Heterogeneous Variable Bandwidth Networks, Proceedings of IEEE Globecom 2001, vol. 4, p. 2316-2320, Nov. 2001. |
| EP Search Report for Application No. 04810901.1 dated Jul. 28, 2011. |
| AU Examination Report for Application No. 2005266945 dated Jul. 21, 2009. |
| AU Examination Report for Application No. 2005272779 dated May 14, 2009. |
| IN Examination Report for Application No. 648/KOLNP/2007 dated May 17, 2013. |
| IN Examination Report for Application No. 3929/KOLNP/2006 dated Nov. 30, 2012. |
| Hasegawa et al., “A Mechanism for TCP Performance Enhancement over Asymmetrical Environment,” Proceedings 8th IEEE ISCC'03, 1530-1346/03, 2003. |
| IN Examination Report for Application No. 3959/KOLNP/2006 dated Feb. 5, 2013. |
| IN Examination Report for Application No. 531/KOLNP/2007 dated Feb. 8, 2013. |
| J. C. Mogul, “The Case for Persistent-Connection HTTP,” 8282 Computer Communication Review 25, Oct. 1995. |
| IL Notice of Allowance for Application No. 180404 dated Jan. 9, 2011. |
| JP Notice of Allowance for Application No. 2007-048001 dated Mar. 2, 2011. |
| US Notice of Allowance for U.S. Appl. No. 11/188,279 dated Jun. 17, 2009. |
| US Notice of Allowance for U.S. Appl. No. 11/188,279 dated Jun. 29, 2009. |
| US Notice of Allowance for U.S. Appl. No. 12/336,795 dated Mar. 2, 2011. |
| US Notice of Allowance for U.S. Appl. No. 11/161,091 dated Sep. 28, 2012. |
| US Notice of Allowance for U.S. Appl. No. 11/161,093 dated Jun. 18, 2012. |
| US Notice of Allowance for U.S. Appl. No. 12/794,446 dated May 7, 2012. |
| US Notice of Allowance for U.S. Appl. No. 12/871,246 dated Sep. 17, 2012. |
| CA Office Action for Application No. 2545496 dated Feb. 15, 2010. |
| EP Office action for Application No. 05776653.7 dated Oct. 5, 2007. |
| IL Office Action for Application No. 181269 dated Jan. 2, 2011. |
| IL Office Action for Application No. 180403 dated Dec. 15, 2010. |
| US Office Action for U.S. Appl. No. 11/039,946 dated on Jun. 23, 2008. |
| US Office Action for U.S. Appl. No. 11/161,090 dated Feb. 4, 2009. |
| US Office action for U.S. Appl. No. 11/161,091 dated Feb. 18, 2009. |
| US Office Action for U.S. Appl. No. 11/161,092 dated Feb. 12, 2009. |
| US Office Action for U.S. Appl. No. 11/161,093 dated Feb. 3, 2011. |
| US Office Action for U.S. Appl. No. 11/187,508 dated Sep. 15, 2010. |
| US Office Action for U.S. Appl. No. 11/187,508 dated Jul. 6, 2011. |
| US Office Action for U.S. Appl. No. 11/187,512 dated Mar. 3, 2009. |
| US Office Action for U.S. Appl. No. 11/187,512 dated Sep. 15, 2009. |
| US Office Action for U.S. Appl. No. 11/187,562 dated Apr. 27, 2009. |
| Office Action for U.S. Appl. No. 11/187,562 dated Dec. 9, 2008. |
| Office Action for U.S. Appl. No. 11/187,562 dated Jun. 10, 2008. |
| Office Action for U.S. Appl. No. 11/187,508 dated Dec. 20, 2011. |
| Office Action for U.S. Appl. No. 12/787,231 dated Apr. 11, 2013. |
| Office Action for U.S. Appl. No. 12/871,246 dated May 15, 2012. |
| Office Action for U.S. Appl. No. 13/590,630 dated Apr. 30, 2013. |
| Office Action for U.S. Appl. No. 13/739,895 dated Mar. 13, 2013. |
| US Restriction Requirement for U.S. Appl. No. 11/161,093 dated Jun. 28, 2011. |
| Search Report for EP for Application No. 10184317.5 dated Dec. 7, 2010. |
| US Notice of Allowance for U.S. Appl. No. 12/787,231 dated Sep. 12, 2013. |
| US Notice of Allowance for U.S. Appl. No. 13/149,383 dated May 28, 2013. |
| US Notice of Allowance for U.S. Appl. No. 13/590,630 dated Jan. 2, 2014. |
| US Office Action for U.S. Appl. No. 13/618,180 dated Feb. 19, 2014. |
| US Office Action for U.S. Appl. No. 13/149,383 dated Jan. 29, 2013. |
| US Office Action for U.S. Appl. No. 13/739,895 dated Sep. 5, 2013. |
| US Office Action for U.S. Appl. No. 11/188,274 dated Nov. 5, 2013. |
| US Office Action for U.S. Appl. No. 13/590,630 dated Oct. 17, 2013. |
| Wang et al., Shield: Vulnerability-Driven Network Filters for Preventing Known Vulnerability Exploits, Feb. 2004, Microsoft Research, MSR-TR-2003-81, 14 pages. |
| US Notice of Allowance for U.S. Appl. No. 11/187,512 dated Jun. 23, 2011. |
| US Notice of Allowance for U.S. Appl. No. 11/039,946 dated Mar. 5, 2010. |
| Hu, et al., Adaptive Fast Path Architecture, IBM J. Res & Dev, vol. 45, No. 2; Mar. 1, 2001, pp. 191-206. Retrieved from the internet at: http://gec.di.uminho.pt/discip/minf/ac0203/ICCA03IBM—WebCachArch.pdf, 15 pages. |
| Extended European Search Report issued May 21, 2014 in European Patent Application No. 13195627.8. |
| Office Action for U.S. Appl. No. 14/015,078 dated Sep. 8, 2014. |
| Office Action issued Mar. 13, 2014 in Indian Patent Application No. 648/KOLNP/2007. |
| US Notice of Allowance for U.S. Appl. No. 14/015,078 dated Dec. 1, 2014. |
| US Notice of Allowance for U.S. Appl. No. 11/188,274 dated Aug. 14, 2014. |
| US Notice of Allowance for U.S. Appl. No. 13/618,180 dated Jul. 21, 2014. |
| US Notice of Allowance for U.S. Appl. No. 13/739,895 dated Mar. 24, 2014. |
| US Office Action for U.S. Appl. No. 11/188,274 dated Jun. 2, 2014. |
| Number | Date | Country | |
|---|---|---|---|
| 20060039354 A1 | Feb 2006 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60590837 | Jul 2004 | US | |
| 60601431 | Aug 2004 | US | |
| 60607420 | Sep 2004 | US | |
| 60608814 | Sep 2004 | US |
