Processing data packets in performance enhancing proxy (PEP) environment

Information

  • Patent Grant
  • 9906630
  • Patent Number
    9,906,630
  • Date Filed
    Tuesday, July 28, 2015
    8 years ago
  • Date Issued
    Tuesday, February 27, 2018
    6 years ago
Abstract
Methods and systems for processing network packets within a Performance Enhancing Proxy (PEP) environment are described. An example method comprises receiving network data to be transported between a first PEP and a second PEP. The network data is segmented in one or more original network packets. The method may further comprise collecting packet identifying data associated with the one or more original network packets before the network data is packetized into one or more performance enhanced packets by the first PEP. The method may further comprise transmitting the identifying data to the second PEP. Upon receiving of the identifying data, the second PEP may recreate the segmentation of the original network data.
Description
TECHNICAL FIELD

This disclosure relates generally to networking and, more specifically, to methods and systems for processing data packets in Performance Enhancing Proxy (PEP) environment.


DESCRIPTION OF RELATED ART

The approaches described in this section could be pursued but are not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section.


Data transfers over Wide Area Networks (WANs), such as the Internet, are widely used to allow the sharing of resources and information between multiple computer systems and hardware components. A WAN may include network optimizing agents such as PEPs. PEPs are designed to improve end-to-end performance of communication protocols such as the Transmission Control Protocol (TCP) and others. PEPs function by breaking the end-to-end connection into multiple connections and using various parameters to transfer data across different legs.


Communication networks may use PEPs to improve TCP performance. End systems (e.g., clients and servers) may use the standard TCP with no modifications, and typically be oblivious to the existence of the PEPs in between. The transport layer of the PEPs may intercept TCP connections between the end systems. The PEPs may then either use TCP or some other protocols to transfer data between them before delivering the data to its final destination.


In one example, TCP data packets transported from a first Local Area Network (LAN) or Wide Area Network (WAN) to a first PEP may be of small, varying, and/or non-optimal lengths. To improve the networking performance, the first PEP may process the incoming data packets, incorporate them into larger data packets, and transmit the larger data packets over the network towards a second PEP. The transmission between the first and second PEPs may be implemented in an improved manner and may, sometimes, use different data transfer standards. Once these enhanced data packets are received by the second PEP, the data packets may be processed and separated into a plurality of data packets. However, instead of recreating the original data packets, new data packets are generated in order to be suitable for the settings of the second LAN, and normally the lengths and data distribution among of the new data packets are different from those received by the first LAN. Thus, the original segmentation data is typically lost when data packets are processed by PEPs.


Unfortunately, some stacks or some applications, especially older ones, may easily break down when they receive these new data packets. This may happen because the lengths of these new data packets differ from the original packets and, therefore, unexpected by the applications. A well written application that follows the rules related to implementing a TCP application may not encounter this problem. However, some applications may not be well written and include latent bugs, which only become apparent when the segmentation of the delivered data packets is different from the original. When such applications receive data packets having unexpected data lengths, they may freeze up or even break down the entire stack, an application, or a computing system. Additionally, if transformations take place while the data is in transit, it is difficult to establish whether the original application/system or the performance enhancing intermediaries are responsible for the application problems (e.g., data corruption).


There are currently no effective methods to prevent such problems and to determine the responsible party within PEP environments.


SUMMARY

This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter.


In accordance with various embodiments and the corresponding disclosure thereof, a computer-implemented method for processing network packets within a PEP environment is provided. The method may comprise receiving network data to be transported between a first PEP and a second PEP. The network data can be segmented into one or more original network packets. The method may further comprise collecting packet identifying data associated with the one or more original network packets before the network data is packetized into one or more performance enhanced packets by the first PEP. The method may further comprise transmitting the identifying data to the second PEP. Based on the identifying data, the second PEP can recreate the segmentation of the network data. The one or more original data packets can be compliant with the TCP. In some example embodiments, the packet identifying data can be transmitted with the network data. The packet identifying data can be inserted into the network data after the network data is compressed and before the network data is encrypted. In other example embodiments, the packet identifying data can be transmitted separately from the network data. The identifying data can be descriptive of the lengths of the one or more original data packets, length deltas, protocol settings, Differentiated Services Code Point (DSCP) markings and the like.


In accordance with other embodiments, a computer-implemented method for processing network packets in a PEP environment is provided. The method may comprise receiving compressed network data to be transported between a first PEP and a second PEP. The network data can be received in one or more original network packets. The method may further comprise collecting packet identifying data associated with the one or more original network packets before the compressed network data is packetized into one or more performance enhanced packets by the first PEP. The method may further comprise transmitting the identifying data to the second PEP. The second PEP may recreate the segmentation of the network data based on the identifying data. The packet identifying data can be transmitted with the network data.


In accordance with yet more embodiments, a system for processing network packets is described. The system may comprise a Local Area Network (LAN) receiving module configured to receive network data to be transported between a first PEP and a second PEP, a Wide Area Network (WAN) receiving module configured to collect packet identifying data associated with the one or more original network packets before the network data is packetized into one or more performance enhanced packets by the first PEP, and a Wide Area Network (WAN) transmitting module configured to transmit the identifying data the second PEP. The system may further comprise a Local Area Network (LAN) transmitting module configured to recreate the segmentation of the network data.


Also disclosed are computer-readable media having instructions stored thereon, which when executed by one or more computers, can cause the one or more computers to implement the methods for processing network packets which are disclosed herein.


To the accomplishment of the foregoing and related ends, the one or more aspects comprise the features hereinafter fully described and particularly pointed out in the claims. The following description and the drawings set forth in detail certain illustrative features of the one or more aspects. These features are indicative, however, of but a few of the various ways in which the principles of various aspects may be employed, and this description is intended to include all such aspects and their equivalents.





BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:



FIG. 1 shows a block diagram illustrating an example network environment suitable for implementing various embodiments.



FIG. 2 shows a block diagram illustrating an example network system integrating a PEP environment on which various embodiments can be implemented.



FIG. 3 is a block diagram showing an approach for processing data packets in a PEP environment.



FIG. 4 is a block diagram showing a further approach for processing data packets in a PEP environment, according to another embodiment.



FIG. 5 is a diagram of a system for processing network packets.



FIG. 6 is a process flow diagram showing a method for processing network packets within a PEP environment.



FIG. 7 is a diagram of an example machine in the form of a computer system within which a set of instructions, for the machine to perform any one or more of the methodologies discussed herein, is executed.





DETAILED DESCRIPTION

The following detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show illustrations in accordance with example embodiments. These example embodiments, which are also referred to herein as “examples,” are described in enough detail to enable those skilled in the art to practice the present subject matter. The embodiments can be combined, other embodiments can be utilized, or structural, logical and electrical changes can be made without departing from the scope of what is claimed. The following detailed description is, therefore, not to be taken in a limiting sense, and the scope is defined by the appended claims and their equivalents.


Methods and systems for processing network packets within a PEP environment are disclosed. The disclosed approaches are effective ways of processing data packets. The data packets are restored to their original form after they are processed by the PEP proxies, regardless of how they are transmitted through the PEP environment.


The PEP environment may utilize protocols suitable for data transmission over a satellite link, which normally utilizes packets with bigger window sizes. This new data packet may be called a performance enhanced data packet. Each original packet may include a header and a payload. The TCP stack may copy the payload into a buffer that leads to a TCP/IP socket where the payload can be read by an application. In the prior art, as the payloads are copied into the buffer of the TCP stack, the headers are discarded, the data from the original packets is coalesced and any information related to the boundaries of the original packets is lost. Thus, for example, the data previously contained in three packets of 100 bytes can be reassembled into two packets of 150 bytes each. Even though both packets are valid from the TCP point of view, an application may request to read 100 bytes, expecting these 100 bytes to represent the original packet with specific data. However, in the situation this situation, the first 100 bytes of the first 150 byte packet will be read and there would be 50 bytes left unread. When the application reads another 100 bytes of what it expects to be the second 100 byte packet, it will only read 50 bytes left over in the first 150 byte packet. A poorly written application may not check the actual number of bytes read resulting, in this particular example, in an offset of 50 bytes of what is expected.


In the disclosed methods and systems for processing network packets within a PEP environment when the original data packets are first buffered, the first PEP also extracts or otherwise determines length information for every original data packet. In addition, some other information such as, for example, protocol settings, Differentiated Services Code Point (DSCP) markings and the like can be extracted. This data may be collected by the first PEP as “packet identifying data,” which is descriptive of original data packet lengths.


The performance enhanced data packet may then be transmitted within the PEP environment. In some examples, the information stored within the performance enhanced data packet can also be compressed and/or encrypted. Either way, the performance enhanced data packet and the packet identifying data are both conveyed to the second PEP. The packet identifying data can be conveyed with other packets, separately from other packets, or even over different data networks. When conveyed with the other packets, the packet identifying data can optionally be incorporated into the performance enhanced data packet (e.g., in the header or between the header and the data segment).


When the performance enhanced data packet is received by the second PEP, new data packets are generated based on the information stored within the performance enhanced data packet. Using the packet identifying data, the original data packets can be recreated. Thus, the recreated data packets can have the same segmentation and same lengths as the original data packets. Thus, when the new data packets are delivered to the destination party, it is like they have never been through the PEP environment.


The following description provides the detailed description of various example embodiments related to methods and systems for processing network packets.


Referring now to the drawings, FIG. 1 shows a block diagram illustrating an exemplary network environment 100 suitable for implementing various embodiments. The network environment 100 may comprise one or more computing systems 112, 114, 116, 182, 184, and 186, which can be integrated within their respective LAN 120 and LAN 170 with the help of one or more respective communication appliances 130 and 190 (e.g., a router and a switch). The computing systems 112, 114, 116, 182, 184, and 186 may be also considered “client” devices. The network environment 100 may further comprise one or more servers, which can also be integrated in a separated LAN (not shown). The computing systems of LAN 120 and LAN 170 may transmit data to each other over a communication network, namely a WAN 150. The WAN 150 may refer to the Internet, a satellite communication network, or the like. The computing systems LAN 120 and LAN 170 may be communicatively coupled to the WAN 150 through proxies 140 and 160.


The proxies 140 and 160 may refer to servers which can be implemented as hardware, software, or a combination thereof and act as intermediaries for requests between the computing systems 112, 114, 116, 182, 184, and 186. As data travels between LAN 120 and LAN 170, data packets generated by the computing systems 112, 114, 116, 182, 184, and 186 can be broken apart by proxies 140 and 160 and new data packets created. Those skilled in the art would appreciate that the network environment 100 may comprise additional, fewer, or different components depending on the application.



FIG. 2 shows a block diagram illustrating an exemplary network system 200 integrating a PEP environment on which various embodiments can be implemented. In the diagram shown, there is an originating party 210 and a destination party 220 interconnected via a WAN 150. The originating party 210 and the destination party 220 may refer to a computer, a laptop, a tablet computer, a portable computing device, a personal digital assistant (PDA), a handheld cellular phone, a mobile phone, a smart phone, a handheld device having wire or wireless connection capability, or any other electronic device suitable for communicating data via the WAN 150. The originating party 210 and/or the destination party 220 may also refer to a group of interconnected electronic devices, such as a LAN. In some other examples, the originating party 210 and/or the destination party 220 may be simplified to hardware, software, or a combination thereof suitable to generate and process network data packets.


The network system 200 may comprise two or more PEPs 230. The term “PEP,” as used herein, refers to a network optimizing agent configured to improve the end-to-end performance of some communications protocols. PEPs can often be used to improve the performance of the IP in environments where native performance suffers for some reason, usually due to a characteristic of the environment. A PEP implementation may function at the TCP layer or at the application layer.


Accordingly, the originating party 210 may generate one or more data packets complying with a certain protocol (e.g., the TCP) and transmit them towards the destination party 220, which may also utilize data packets complying with the same protocol as in the originating party 210. First, original data packets 240 are transmitted to the first PEP 230, where they can be buffered, processed, and reassembled in new data packets, which can comply with another communication protocol suitable for data transmission within the PEP environment 250. Such new data packets are called “performance enhanced packets” 260. Consequently, the performance enhanced packets 260 comprise data obtained from the original data packets 240. In some embodiments, the performance enhanced packets 260 may comprise encrypted and/or compressed data associated with the original data packets 240.


Further, the performance enhanced packets 260 are transmitted to the second PEP 230, where they can be buffered, processed, and reassembled into recreated data packets 270. The recreated data packets 270 are segmented as the original data packets 240. In contrast, in the prior art, the same data can be delivered but the packets may not be of the same lengths.



FIG. 3 is a block diagram showing an approach for processing data packets in a PEP environment. As shown in the figure, the originating party 210 may generate 1 to N original data packets 240. Each original data packet 240 may comprise a header 242 to transmit service information (e.g., originating and destination party addresses, check sums, pointers, flags, lengths, sizes, etc.) and a data segment 244. It should be noted that each original data packet 240 may be of the same or different lengths.


The first PEP 230 may receive the original data packets 240 as generated by the originating party 210, discard the headers 242 and coalesce the data segments 244. The first PEP 230 may determine the lengths of each original data packet 240. In some cases, the first PEP 230 does not determine the entire length of the data packet 240, but only the length of the data segment 244. Some examples of length determinations may include reading and analyzing headers (e.g., retrieving and analyzing a maximum segment size (MSS) parameter, a maximum transmission unit (MTU) parameters, etc.), counting data packet length, calculating differences (deltas) between different data packets, and so forth. The information related to the lengths of every original data packet 240 or data segment 244 is collected as “packet identifying data” 310 (e.g., a length vector). In the example shown, the packet identifying data 310 can be reassembled as an information packet 320 by adding a header.


The first PEP 230 can process the original data packets 240 and extract the data segments 244 for each of them. For example, in a typical implementation, the operating system may strip the headers 242 from the original data packets 240 before forwarding the data segments 244 to the corresponding application. The data segments carry payload of the original data packets 240. All extracted data segments 244 are then used to create performance enhanced data packets 260. Specifically, the data segments 244 are broken apart and encapsulated in the performance enhanced data segments 264. The performance enhanced data packet 260 also comprises a header 262 carrying certain service information.


Subsequently, the performance enhanced data packet 260 is transmitted over the WAN 150 to the second PEP 230. The information packet 320 is also transmitted to the second PEP 230 using the same communication channel or another one. For example, the performance enhanced data packet 260 and the information packet 320 can be transmitted one after another or simultaneously.


Once the second PEP 230 receives the performance enhanced data packet 260 and the information packet 320, the second PEP 230 reads information related to the lengths of original data packets 240 encapsulated within the information packet 320, and then extracts data segments 244 exactly as if they were received in the first PEP 230. In some embodiments, if the encryption and/or compression were previously used, the second PEP 230 may additionally implement decryption and/or decompression.


Further, the second PEP 230 may generate new headers which are the same headers as the headers 242 for each data segment 244 such that new data packets 330 can be regenerated, which are identical to the original data packets 240. The regenerated data packets 330 are then delivered to the destination party 220.



FIG. 4 is a block diagram showing an approach for processing data packets in a PEP environment.


Similarly to the above described, the originating party 210 may generate original data packets 240, which comprise headers 242 and data segments 244.


The first PEP 230 may receive the original data packets 240 and temporary buffer them for a predetermined period of time. The first PEP 230 may then determine the lengths for each buffered original data packet 240. The information about lengths is then collected as packet identifying data 310.


The first PEP 230 also processes the buffered original data packets 240 and extracts the data segments 244 for each of them. The extracted data segments 244 are then used to create a performance enhanced data packet 260. Specifically, the data segments 244 are encapsulated in the performance enhanced data packet 260 such that they occupy the data segment 244. The performance enhanced data packet 260 also comprises a header 262, which carries certain service information.


In contrast to the approach disclosed with reference to FIG. 3, the packet identifying data 310 is incorporated into the performance enhanced data packet 260. In an example embodiment, the packet identifying data 310 is positioned between the header 262 and the data segment 264. In some other embodiments, the packet identifying data 310 can be incorporated within the header 262 or within the data segment 244. The packet identifying data 310 can also be somehow encrypted and/or compressed. In either case, the packet identifying data 310 is transmitted in the performance enhanced data packet 260. Further, the performance enhanced data packet 260 is transmitted over the WAN 150 to the second PEP 230.


Once the second PEP 230 receives the performance enhanced data packet 260, the second PEP 230 retrieves information about the lengths of original data packets 240, and then extracts data segments 244 exactly as they were retrieved in the first PEP 230. Again, if encryption and/or compression were previously used, the second PEP 230 may additionally implement decryption and/or decompression.


Further, the second PEP 230 may generate new headers which can be the same headers as the headers 242 for each data segment 244 such that new data packets 330 can be regenerated, which are identical to the original data packets 240. The regenerated data packets 330 are then delivered to the destination party 220.



FIG. 5 is a diagram of a system 500 for processing network packets. In this embodiment, the system 500 for processing network packets may include an LAN receiving module 510, a WAN receiving module 520, a WAN transmitting module 530, and a LAN transmitting module 540. The system 500 for processing network packets, in this context, may refer to the first and second PEPs 230.


In other embodiments, the system 500 for processing network packets may include additional, fewer, or different modules for various applications. Furthermore, all modules can be integrated within a single apparatus, or, alternatively, can be remotely located and optionally be accessed via a third party.


The LAN receiving module 510 may be configured to receive network data to be transported between the first PEP 230 and the second PEP 230. The LAN receiving module 510 may be receiving LAN data from the LAN 120 shown in FIG. 1. The LAN receiving module 510 may be configured to collect packet identifying data 310 associated with the one or more original network data packets 240 before the network data is packetized into one or more performance enhanced packets 260 by the first PEP 230. The LAN receiving module 510 may pass the data to the WAN receiving module 520. The WAN receiving module 520 can be further configured to determine the lengths of the original data packets 240 and/or the data segments 244.


In addition, the WAN receiving module 520 can be configured to receive the performance enhanced data packet 260, the packet identifying data 310, and/or the information packet 320 from another PEP 230. Once the performance enhanced data packets are created the WAN transmitting module 530 may transmit the data to the WAN 150 shown in FIG. 1.


The WAN transmitting module 530 can also be configured to generate the performance enhanced data packet 260, which comprises previously extracted data segments 244. The WAN transmitting module 530 can be further configured to transmit the performance enhanced data packet 260 and the packet identifying data 310 (and/or the information packets 320) to the second PEP 230.


The LAN transmitting module 540 can be configured to recreate the segmentation of the packet data as the one or more original network data packets 240. The recreation can be implemented utilizing the packet identifying data 310 and/or the information packets 320.



FIG. 6 is a process flow diagram showing a method 600 for processing network packets within a PEP environment. The method 600 may be performed by processing logic that may comprise hardware (e.g., dedicated logic, programmable logic, and microcode), software (such as software run on a general-purpose computer system or a dedicated machine), or a combination of both. In one example embodiment, the processing logic resides at the first and/or second PEP 230.


The method 600 can be performed by various modules discussed above with reference to FIG. 5. Each of these modules can comprise processing logic. It will be appreciated by one of ordinary skill that examples of the foregoing modules may be virtual, and instructions said to be executed by a module may, in fact, be retrieved and executed by a processor. Although various modules may be configured to perform some or all of various steps described herein, fewer or more modules may be provided and still fall within the scope of various embodiments.


As shown in FIG. 6, the method 600 may commence at operation 610 with the LAN receiving module 510 receiving network data to be transported between the first PEP 230 and the second PEP 230. The received network data can be segmented in one or more original network data packets 240.


At operation 620, the WAN receiving module 520 may receive packet identifying data 310 associated with the one or more original network data packets 240 before the network data is packetized into one or more performance enhanced packets 260 by the first PEP 230. The packet identifying data 310 may be descriptive of lengths of the one or more original network data packets 240 and/or their data segments 244. At operation 630 the packet data can be optionally compressed/encrypted.


At operation 640, the WAN transmitting module 530 may transmit the packet identifying data 310 to the second PEP 230. As mentioned, the packet identifying data 310 can be transmitted within the one or more performance enhanced packets 260 (e.g., by being encapsulated between the header 262 and the data segment 244) or separately (for example, as the information packet 320).


If the network data was optionally compressed/encrypted at operation 620, it can be decompressed/decrypted at operation 650.


The method 600 may further comprise an optional operation 660, with the LAN transmitting module 540 recreating the segmentation of the packet data as the one or more original network data packets 240. Accordingly, the recreation can be implemented utilizing the packet identifying data 310 and/or the information packets 320.



FIG. 7 shows a diagrammatic representation of a computing device for a machine in the example electronic form of a computer system 700, within which a set of instructions for causing the machine to perform any one or more of the methodologies discussed herein can be executed. In various example embodiments, the machine operates as a standalone device or can be connected (e.g., networked) to other machines. In a networked deployment, the machine can operate in the capacity of a server or a client machine in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment. The machine can be a server, a storage system, a personal computer (PC), a tablet PC, a web appliance, a network router, a switch, a bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while only a single machine is illustrated, the term “machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies discussed herein.


The example computer system 700 includes a processor or multiple processors 702 (e.g., a central processing unit (CPU)), and a main memory 704, which communicate with each other via a bus 706. The computer system 700 can further include a storage 708 and a network interface device 710.


The storage 708 may include a computer-readable medium 712 which stores one or more sets of instructions and data structures (e.g., instructions 714) embodying or utilized by any one or more of the methodologies or functions described herein. The instructions 714 can also reside, completely or at least partially, within the main memory 704 and/or within the processors 702 during execution thereof by the computer system 700. The main memory 704 and the processors 702 also constitute machine-readable media. The instructions 714 can further be transmitted or received over the network 150 via the network interface device 710 utilizing any one of a number of well-known transfer protocols (e.g., TCP/IP, UDP, HTTP, CAN, Serial, and Modbus).


While the computer-readable medium 712 is shown in an example embodiment to be a single medium, the term “computer-readable medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated buffers and servers) that store the one or more sets of instructions. The term “computer-readable medium” shall also be taken to include any medium that is capable of storing, encoding, or carrying a set of instructions for execution by the machine and that causes the machine to perform any one or more of the methodologies of the present application, or that is capable of storing, encoding, or carrying data structures utilized by or associated with such a set of instructions. The term “computer-readable medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical and magnetic media. Such media can also include, without limitation, hard disks, floppy disks, flash memory cards, digital video disks (DVDs), random access memory (RAM), read only memory (ROM), and the like.


The example embodiments described herein can be implemented in an operating environment comprising computer-executable instructions (e.g., software) installed on a computer, in hardware, or in a combination of software and hardware. The computer-executable instructions can be written in a computer programming language or can be embodied in firmware logic. If written in a programming language conforming to a recognized standard, such instructions can be executed on a variety of hardware platforms and for interfaces to a variety of operating systems. Although not limited thereto, computer software programs for implementing the present method can be written in any number of suitable programming languages such as, for example, Java, C, C++, Perl, Visual Basic, or other compilers, assemblers, interpreters or other computer languages or platforms.


Thus, computer-implemented method and systems for processing network packets within a PEP environment are described. These methods and systems may effectively process data packets by PEPs so that the data packets can be reassembled when they are outputted from the PEP environment exactly as they were inputted into the PEP environment, regardless how they were transmitted within this environment. The described approaches significantly reduce a number of failures or break downs when stacks or software applications can not process data packets transferred through the PEP environment.


Although embodiments have been described with reference to specific example embodiments, it will be evident that various modifications and changes can be made to these example embodiments without departing from the broader spirit and scope of the present application. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.

Claims
  • 1. A computer-implemented method for processing network packets, the method comprising: receiving network data to be transported between a first Performance Enhancing Proxy (PEP) and a second PEP, the network data being segmented in two or more original network data packets;removing a header from each of the two or more original network data packets;collecting packet identifying data associated with the two or more original network packets from the removed header before the network data is packetized into one or more performance enhanced packets by the first PEP, the packet identifying data comprising information regarding the segmentation of the network data into the two or more original network data packets;transmitting the one or more performance enhanced packets from the first PEP to the second PEP;transmitting the packet identifying data to the second PEP; andrecreating by the second PEP the original packet segmentation of the network data upon receiving the packet identifying data and the performance enhanced packets from the first PEP, wherein the recreating comprises retrieving information about each length of the two or more original network data packets from the packet identifying data.
  • 2. The method of claim 1, wherein the recreating by the second PEP the original packet segmentation of the network data further comprises: extracting data segments in the two or more original network data packets exactly as they were received in the first PEP; andgenerating a new header that is the same as the removed header for each of the extracted data segments, such that new data packets are regenerated that are identical to the two or more original network data packets.
  • 3. The method of claim 1, wherein the packet identifying data includes one or more of the following: lengths, length deltas, Differentiated Services Code Point (DSCP) markings, priority markings, and options.
  • 4. The method of claim 1, wherein the two or more original network data packets are complying with a Transmission Control Protocol (TCP).
  • 5. The method of claim 1, wherein the packet identifying data is transmitted to the second PEP with the performance enhanced packets.
  • 6. The method of claim 1, wherein the received network data to be transmitted between the first PEP and the second PEP is compressed or encrypted.
  • 7. The method of claim 1, wherein the first PEP compresses or encrypts the network data before transmitting to the second PEP.
  • 8. The method of claim 1, wherein the packet identifying data is transmitted to the second PEP separately from the performance enhanced packets.
  • 9. The method of claim 1, wherein the packet identifying data is descriptive of lengths of the two or more original network data packets.
  • 10. The method of claim 7, wherein the packet identifying data is inserted into the network data after the network data is compressed and before the network data is encrypted.
  • 11. A system for processing network packets, the system comprising: a first module, stored in memory and executed by at least one processor, that receives network data to be transported between a first Performance Enhancing Proxy (PEP) and a second PEP, the network data being segmented into two or more original network data packets;a second module, stored in memory and executed by the at least one processor, that removes a header from each of the two or more original network data packets and collects packet identifying data associated with the two or more original network data packets from the removed header before the network data is packetized into one or more performance enhanced packets by the first PEP, the packet identifying data comprising data regarding the segmentation of the network data into the two or more original network data packets;a third module, stored in memory and executed by the at least one processor, that transmits the packet identifying data to the second PEP and transmits the one or more performance enhanced packets to the second PEP; anda fourth module, stored in memory and executed by the at least one processor, that recreates the original packet segmentation of the network data upon receiving the packet identifying data and the one or more performance enhanced packets by: retrieving information about each length of the two or more original network data packets from the packet identifying data.
  • 12. The system of claim 11, wherein the fourth module is executed by the second PEP to recreate the original packet segmentation of the network data upon receiving the packet identifying data and the one or more performance enhanced packets from the first PEP.
  • 13. The system of claim 11, wherein the fourth module further recreates the original packet segmentation of the network data upon receiving the packet identifying data and the one or more performance enhanced packets by: extracting data segments in the two or more original network data packets exactly as they were received in the first PEP, andgenerating a new header that is the same as the removed header for each one of the extracted data segments, such that new data packets are regenerated, the regenerated new data packets being identical to the two or more original network data packets.
  • 14. The system of claim 11, wherein the packet identifying data includes one or more of the following: lengths, length deltas, Differentiated Services Code Point (DSCP) markings, priority markings, and options.
  • 15. The system of claim 11, wherein the third module is configured to transmit the packet identifying data with the performance enhanced packets.
  • 16. The system of claim 11, wherein the received network data is compressed or encrypted.
  • 17. The system of claim 16, wherein the packet identifying data is descriptive of compressed lengths of the two or more original data packets.
  • 18. The system of claim 11, wherein the packet identifying data is inserted into the network data after the network data is compressed and before the network data is encrypted.
  • 19. The system of claim 11, wherein the third module is configured to transmit the packet identifying data separately from the performance enhanced packets.
  • 20. The system of claim 11, wherein the packet identifying data is descriptive of lengths of the two or more original network data packets.
  • 21. A non-transitory computer-readable medium having instructions stored thereon, which when executed by one or more computers, causes the one or more computers to: receive network data to be transported between a first Performance Enhancing Proxy (PEP) and a second PEP, the network data being segmented in two or more original network data packets;remove a header from each of the two or more original network data packets and collect packet identifying data associated with the two or more original network data packets from the removed header before the network data is packetized into one or more performance enhanced packets by the first PEP, the packet identifying data comprising data regarding the segmentation of the network data into the two or more original network data packets; andtransmit the packet identifying data and the one or more performance enhanced packets to the second PEP so that the second PEP can reproduce the original packet segmentation of the network data upon receiving the packet identifying data and the one or more performance enhanced packets from the first PEP based on information about each length of the two or more original network data packets from the packet identifying data.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation, and claims the priority benefit, of U.S. patent application Ser. No. 13/274,162 filed Oct. 14, 2011, now U.S. Pat. No. 9,130,991 issued on Sep. 8, 2015. The disclosure of the above-referenced application is incorporated by reference herein in its entirety for all purposes.

US Referenced Citations (453)
Number Name Date Kind
4494108 Langdon, Jr. et al. Jan 1985 A
4558302 Welch Dec 1985 A
4612532 Bacon et al. Sep 1986 A
5023611 Chamzas et al. Jun 1991 A
5243341 Seroussi et al. Sep 1993 A
5307413 Denzer Apr 1994 A
5357250 Healey et al. Oct 1994 A
5359720 Tamura et al. Oct 1994 A
5373290 Lempel et al. Dec 1994 A
5483556 Pillan et al. Jan 1996 A
5532693 Winters et al. Jul 1996 A
5592613 Miyazawa et al. Jan 1997 A
5611049 Pitts Mar 1997 A
5627533 Clark May 1997 A
5635932 Shinagawa et al. Jun 1997 A
5652581 Furlan et al. Jul 1997 A
5659737 Matsuda Aug 1997 A
5675587 Okuyama et al. Oct 1997 A
5710562 Gormish et al. Jan 1998 A
5748122 Shinagawa et al. May 1998 A
5754774 Bittinger et al. May 1998 A
5802106 Packer Sep 1998 A
5805822 Long Sep 1998 A
5883891 Williams et al. Mar 1999 A
5903230 Masenas May 1999 A
5955976 Heath Sep 1999 A
6000053 Levine et al. Dec 1999 A
6003087 Housel, III et al. Dec 1999 A
6054943 Lawrence Apr 2000 A
6081883 Popelka et al. Jun 2000 A
6084855 Soirinsuo et al. Jul 2000 A
6175944 Urbanke et al. Jan 2001 B1
6191710 Waletzki Feb 2001 B1
6295541 Bodnar et al. Sep 2001 B1
6308148 Bruins et al. Oct 2001 B1
6311260 Stone et al. Oct 2001 B1
6339616 Kovalev Jan 2002 B1
6374266 Shnelvar Apr 2002 B1
6434641 Haupt et al. Aug 2002 B1
6434662 Greene et al. Aug 2002 B1
6438664 McGrath et al. Aug 2002 B1
6452915 Jorgensen Sep 2002 B1
6463001 Williams Oct 2002 B1
6489902 Heath Dec 2002 B2
6493698 Beylin Dec 2002 B1
6570511 Cooper May 2003 B1
6587985 Fukushima et al. Jul 2003 B1
6614368 Cooper Sep 2003 B1
6618397 Huang Sep 2003 B1
6633953 Stark Oct 2003 B2
6643259 Borella et al. Nov 2003 B1
6650644 Colley et al. Nov 2003 B1
6653954 Rijavec Nov 2003 B2
6667700 McCanne et al. Dec 2003 B1
6674769 Viswanath Jan 2004 B1
6718361 Basani et al. Apr 2004 B1
6728840 Shatil et al. Apr 2004 B1
6738379 Balazinski et al. May 2004 B1
6769048 Goldberg et al. Jul 2004 B2
6791945 Levenson et al. Sep 2004 B1
6842424 Key et al. Jan 2005 B1
6856651 Singh Feb 2005 B2
6859842 Nakamichi et al. Feb 2005 B1
6862602 Guha Mar 2005 B2
6910106 Sechrest et al. Jun 2005 B2
6963980 Mattsson Nov 2005 B1
6968374 Lemieux et al. Nov 2005 B2
6978384 Milliken Dec 2005 B1
7007044 Rafert et al. Feb 2006 B1
7020750 Thiyagaranjan et al. Mar 2006 B2
7035214 Seddigh et al. Apr 2006 B1
7047281 Kausik May 2006 B1
7069268 Burns et al. Jun 2006 B1
7069342 Biederman Jun 2006 B1
7110407 Khanna Sep 2006 B1
7111005 Wessman Sep 2006 B1
7113962 Kee et al. Sep 2006 B1
7120666 McCanne et al. Oct 2006 B2
7145889 Zhang et al. Dec 2006 B1
7177295 Sholander et al. Feb 2007 B1
7197597 Scheid et al. Mar 2007 B1
7200847 Straube et al. Apr 2007 B2
7215667 Davis May 2007 B1
7242681 Van Bokkelen et al. Jul 2007 B1
7243094 Tabellion et al. Jul 2007 B2
7266645 Garg et al. Sep 2007 B2
7278016 Detrick et al. Oct 2007 B1
7318100 Demmer et al. Jan 2008 B2
7366829 Luttrell et al. Apr 2008 B1
7380006 Srinivas et al. May 2008 B2
7383329 Erickson Jun 2008 B2
7383348 Seki et al. Jun 2008 B2
7388844 Brown et al. Jun 2008 B1
7389357 Duffie, III et al. Jun 2008 B2
7389393 Karr et al. Jun 2008 B1
7417570 Srinivasan et al. Aug 2008 B2
7417991 Crawford et al. Aug 2008 B1
7420992 Fang et al. Sep 2008 B1
7428573 McCanne et al. Sep 2008 B2
7451237 Takekawa et al. Nov 2008 B2
7453379 Plamondon Nov 2008 B2
7454443 Ram et al. Nov 2008 B2
7457315 Smith Nov 2008 B1
7460473 Kodama et al. Dec 2008 B1
7471629 Melpignano Dec 2008 B2
7532134 Samuels et al. May 2009 B2
7555484 Kulkarni et al. Jun 2009 B2
7571343 Xiang et al. Aug 2009 B1
7571344 Hughes et al. Aug 2009 B2
7587401 Yeo et al. Sep 2009 B2
7596802 Border et al. Sep 2009 B2
7619545 Samuels et al. Nov 2009 B2
7620870 Srinivasan et al. Nov 2009 B2
7624446 Wilhelm Nov 2009 B1
7630295 Hughes et al. Dec 2009 B2
7633942 Bearden et al. Dec 2009 B2
7639700 Nabhan et al. Dec 2009 B1
7643426 Lee et al. Jan 2010 B1
7644230 Hughes et al. Jan 2010 B1
7676554 Malmskog et al. Mar 2010 B1
7698431 Hughes Apr 2010 B1
7702843 Chen et al. Apr 2010 B1
7714747 Fallon May 2010 B2
7746781 Xiang Jun 2010 B1
7764606 Ferguson et al. Jul 2010 B1
7810155 Ravi Oct 2010 B1
7827237 Plamondon Nov 2010 B2
7849134 McCanne et al. Dec 2010 B2
7853699 Wu et al. Dec 2010 B2
7873786 Singh et al. Jan 2011 B1
7917599 Gopalan et al. Mar 2011 B1
7925711 Gopalan et al. Apr 2011 B1
7941606 Pullela et al. May 2011 B1
7945736 Hughes et al. May 2011 B2
7948921 Hughes et al. May 2011 B1
7953869 Demmer et al. May 2011 B2
7970898 Clubb et al. Jun 2011 B2
7975018 Unrau et al. Jul 2011 B2
8069225 McCanne et al. Nov 2011 B2
8072985 Golan et al. Dec 2011 B2
8090027 Schneider Jan 2012 B2
8095774 Hughes et al. Jan 2012 B1
8140757 Singh et al. Mar 2012 B1
8171238 Hughes et al. May 2012 B1
8209334 Doerner Jun 2012 B1
8225072 Hughes et al. Jul 2012 B2
8271325 Silverman et al. Sep 2012 B2
8307115 Hughes Nov 2012 B1
8312226 Hughes Nov 2012 B2
8352608 Keagy et al. Jan 2013 B1
8370583 Hughes Feb 2013 B2
8386797 Danilak Feb 2013 B1
8392684 Hughes Mar 2013 B2
8442052 Hughes May 2013 B1
8447740 Huang et al. May 2013 B1
8473714 Hughes et al. Jun 2013 B2
8489562 Hughes et al. Jul 2013 B1
8516158 Wu et al. Aug 2013 B1
8565118 Shukla et al. Oct 2013 B2
8595314 Hughes Nov 2013 B1
8613071 Day et al. Dec 2013 B2
8681614 McCanne et al. Mar 2014 B1
8699490 Zheng et al. Apr 2014 B2
8700771 Ramankutty et al. Apr 2014 B1
8706947 Vincent Apr 2014 B1
8725988 Hughes et al. May 2014 B2
8732423 Hughes May 2014 B1
8738865 Hughes et al. May 2014 B1
8743683 Hughes Jun 2014 B1
8755381 Hughes et al. Jun 2014 B2
8775413 Brown et al. Jul 2014 B2
8811431 Hughes Aug 2014 B2
8850324 Clemm et al. Sep 2014 B2
8885632 Hughes et al. Nov 2014 B2
8929380 Hughes et al. Jan 2015 B1
8929402 Hughes Jan 2015 B1
8930650 Hughes et al. Jan 2015 B1
9003541 Patidar Apr 2015 B1
9036662 Hughes May 2015 B1
9054876 Yagnik Jun 2015 B1
9092342 Hughes et al. Jul 2015 B2
9130991 Hughes Sep 2015 B2
9131510 Wang Sep 2015 B2
9143455 Hughes Sep 2015 B1
9152574 Hughes et al. Oct 2015 B2
9171251 Camp et al. Oct 2015 B2
9191342 Hughes et al. Nov 2015 B2
9202304 Baenziger et al. Dec 2015 B1
9253277 Hughes et al. Feb 2016 B2
9306818 Aumann et al. Apr 2016 B2
9307442 Bachmann Apr 2016 B2
9363309 Hughes Jun 2016 B2
9397951 Hughes Jul 2016 B1
9438538 Hughes et al. Sep 2016 B2
9549048 Hughes Jan 2017 B1
9584403 Hughes et al. Feb 2017 B2
9584414 Sung et al. Feb 2017 B2
9613071 Hughes Apr 2017 B1
9626224 Hughes et al. Apr 2017 B2
9647949 Varki et al. May 2017 B2
9712463 Hughes et al. Jul 2017 B1
9717021 Hughes et al. Jul 2017 B2
20010026231 Satoh Oct 2001 A1
20010054084 Kosmynin Dec 2001 A1
20020007413 Garcia-Luna-Aceves et al. Jan 2002 A1
20020010702 Ajtai et al. Jan 2002 A1
20020040475 Yap et al. Apr 2002 A1
20020061027 Abiru et al. May 2002 A1
20020065998 Buckland May 2002 A1
20020071436 Border Jun 2002 A1
20020078242 Viswanath Jun 2002 A1
20020101822 Ayyagari et al. Aug 2002 A1
20020107988 Jordan Aug 2002 A1
20020116424 Radermacher et al. Aug 2002 A1
20020129158 Zhang et al. Sep 2002 A1
20020129260 Benfield et al. Sep 2002 A1
20020131434 Vukovic et al. Sep 2002 A1
20020150041 Reinshmidt et al. Oct 2002 A1
20020163911 Wee et al. Nov 2002 A1
20020169818 Stewart et al. Nov 2002 A1
20020181494 Rhee Dec 2002 A1
20020188871 Noehring et al. Dec 2002 A1
20020194324 Guha Dec 2002 A1
20030002664 Anand Jan 2003 A1
20030009558 Ben-Yehezkel Jan 2003 A1
20030012400 McAuliffe et al. Jan 2003 A1
20030046572 Newman et al. Mar 2003 A1
20030123481 Neale et al. Jul 2003 A1
20030123671 He et al. Jul 2003 A1
20030131079 Neale et al. Jul 2003 A1
20030133568 Stein et al. Jul 2003 A1
20030142658 Ofuji et al. Jul 2003 A1
20030149661 Mitchell et al. Aug 2003 A1
20030149869 Gleichauf Aug 2003 A1
20030204619 Bays Oct 2003 A1
20030214502 Park et al. Nov 2003 A1
20030214954 Oldak et al. Nov 2003 A1
20030233431 Reddy et al. Dec 2003 A1
20040008711 Lahti et al. Jan 2004 A1
20040047308 Kavanagh et al. Mar 2004 A1
20040083299 Dietz et al. Apr 2004 A1
20040086114 Rarick May 2004 A1
20040088376 McCanne et al. May 2004 A1
20040114569 Naden et al. Jun 2004 A1
20040117571 Chang et al. Jun 2004 A1
20040123139 Aiello et al. Jun 2004 A1
20040158644 Albuquerque et al. Aug 2004 A1
20040179542 Murakami et al. Sep 2004 A1
20040181679 Dettinger et al. Sep 2004 A1
20040199771 Morten et al. Oct 2004 A1
20040202110 Kim Oct 2004 A1
20040203820 Billhartz Oct 2004 A1
20040205332 Bouchard et al. Oct 2004 A1
20040243571 Judd Dec 2004 A1
20040250027 Heflinger Dec 2004 A1
20040255048 Lev Ran et al. Dec 2004 A1
20050010653 McCanne Jan 2005 A1
20050044270 Grove et al. Feb 2005 A1
20050053094 Cain et al. Mar 2005 A1
20050055372 Springer, Jr. et al. Mar 2005 A1
20050055399 Savchuk Mar 2005 A1
20050071453 Ellis et al. Mar 2005 A1
20050091234 Hsu et al. Apr 2005 A1
20050111460 Sahita May 2005 A1
20050131939 Douglis et al. Jun 2005 A1
20050132252 Fifer et al. Jun 2005 A1
20050141425 Foulds Jun 2005 A1
20050171937 Hughes et al. Aug 2005 A1
20050177603 Shavit Aug 2005 A1
20050190694 Ben-Nun et al. Sep 2005 A1
20050207443 Kawamura et al. Sep 2005 A1
20050210151 Abdo et al. Sep 2005 A1
20050220019 Melpignano Oct 2005 A1
20050220097 Swami et al. Oct 2005 A1
20050235119 Sechrest et al. Oct 2005 A1
20050240380 Jones Oct 2005 A1
20050243743 Kimura Nov 2005 A1
20050243835 Sharma et al. Nov 2005 A1
20050256972 Cochran et al. Nov 2005 A1
20050278459 Boucher et al. Dec 2005 A1
20050283355 Itani et al. Dec 2005 A1
20050286526 Sood et al. Dec 2005 A1
20060013210 Bordogna et al. Jan 2006 A1
20060026425 Douceur et al. Feb 2006 A1
20060031936 Nelson et al. Feb 2006 A1
20060036901 Yang et al. Feb 2006 A1
20060039354 Rao et al. Feb 2006 A1
20060045096 Farmer et al. Mar 2006 A1
20060059171 Borthakur et al. Mar 2006 A1
20060059173 Hirsch et al. Mar 2006 A1
20060117385 Mester et al. Jun 2006 A1
20060136913 Sameske Jun 2006 A1
20060143497 Zohar et al. Jun 2006 A1
20060195547 Sundarrajan et al. Aug 2006 A1
20060195840 Sundarrajan et al. Aug 2006 A1
20060212426 Shakara et al. Sep 2006 A1
20060218390 Loughran et al. Sep 2006 A1
20060227717 van den Berg et al. Oct 2006 A1
20060250965 Irwin Nov 2006 A1
20060268932 Singh et al. Nov 2006 A1
20060280205 Cho Dec 2006 A1
20070002804 Xiong et al. Jan 2007 A1
20070008884 Tang Jan 2007 A1
20070011424 Sharma et al. Jan 2007 A1
20070038815 Hughes Feb 2007 A1
20070038816 Hughes et al. Feb 2007 A1
20070038858 Hughes Feb 2007 A1
20070050475 Hughes Mar 2007 A1
20070076693 Krishnaswamy Apr 2007 A1
20070081513 Torsner Apr 2007 A1
20070097874 Hughes et al. May 2007 A1
20070110046 Farrell et al. May 2007 A1
20070115812 Hughes May 2007 A1
20070127372 Khan et al. Jun 2007 A1
20070130114 Li et al. Jun 2007 A1
20070140129 Bauer et al. Jun 2007 A1
20070150497 De La Cruz et al. Jun 2007 A1
20070174428 Lev Ran et al. Jul 2007 A1
20070179900 Daase et al. Aug 2007 A1
20070195702 Yuen et al. Aug 2007 A1
20070195789 Yao Aug 2007 A1
20070198523 Hayim Aug 2007 A1
20070226320 Hager et al. Sep 2007 A1
20070237104 Alon et al. Oct 2007 A1
20070244987 Pedersen et al. Oct 2007 A1
20070245079 Bhattacharjee et al. Oct 2007 A1
20070248084 Whitehead Oct 2007 A1
20070258468 Bennett Nov 2007 A1
20070263554 Finn Nov 2007 A1
20070276983 Zohar et al. Nov 2007 A1
20070280245 Rosberg Dec 2007 A1
20080005156 Edwards et al. Jan 2008 A1
20080013532 Garner et al. Jan 2008 A1
20080016301 Chen Jan 2008 A1
20080028467 Kommareddy et al. Jan 2008 A1
20080031149 Hughes et al. Feb 2008 A1
20080031240 Hughes et al. Feb 2008 A1
20080071818 Apanowicz et al. Mar 2008 A1
20080095060 Yao Apr 2008 A1
20080133536 Bjorner et al. Jun 2008 A1
20080133561 Dubnicki et al. Jun 2008 A1
20080184081 Hama et al. Jul 2008 A1
20080205445 Kumar et al. Aug 2008 A1
20080222044 Gottlieb et al. Sep 2008 A1
20080229137 Samuels et al. Sep 2008 A1
20080243992 Jardetzky et al. Oct 2008 A1
20080267217 Colville Oct 2008 A1
20080300887 Chen et al. Dec 2008 A1
20080313318 Vermeulen et al. Dec 2008 A1
20080320151 McCanne et al. Dec 2008 A1
20090006801 Shultz et al. Jan 2009 A1
20090024763 Stepin et al. Jan 2009 A1
20090037448 Thomas Feb 2009 A1
20090060198 Little Mar 2009 A1
20090063696 Wang et al. Mar 2009 A1
20090080460 Kronewitter, III et al. Mar 2009 A1
20090089048 Pouzin Apr 2009 A1
20090092137 Haigh et al. Apr 2009 A1
20090100483 McDowell Apr 2009 A1
20090158417 Khanna et al. Jun 2009 A1
20090175172 Prytz et al. Jul 2009 A1
20090204961 DeHaan et al. Aug 2009 A1
20090234966 Samuels et al. Sep 2009 A1
20090245114 Vijayaraghavan Oct 2009 A1
20090265707 Goodman et al. Oct 2009 A1
20090274294 Itani Nov 2009 A1
20090279550 Romrell et al. Nov 2009 A1
20090281984 Black Nov 2009 A1
20100005222 Brant et al. Jan 2010 A1
20100011125 Yang et al. Jan 2010 A1
20100020693 Thakur Jan 2010 A1
20100054142 Moiso et al. Mar 2010 A1
20100070605 Hughes et al. Mar 2010 A1
20100077251 Liu et al. Mar 2010 A1
20100082545 Bhattacharjee et al. Apr 2010 A1
20100085964 Weir Apr 2010 A1
20100115137 Kim et al. May 2010 A1
20100121957 Roy et al. May 2010 A1
20100124239 Hughes May 2010 A1
20100131957 Kami May 2010 A1
20100169467 Shukla et al. Jul 2010 A1
20100177663 Johansson et al. Jul 2010 A1
20100225658 Coleman Sep 2010 A1
20100232443 Pandey Sep 2010 A1
20100242106 Harris et al. Sep 2010 A1
20100246584 Ferguson et al. Sep 2010 A1
20100290364 Black Nov 2010 A1
20100318892 Teevan et al. Dec 2010 A1
20100333212 Carpenter et al. Dec 2010 A1
20110002346 Wu Jan 2011 A1
20110022812 van der Linden et al. Jan 2011 A1
20110113472 Fung et al. May 2011 A1
20110154169 Gopal et al. Jun 2011 A1
20110154329 Arcese et al. Jun 2011 A1
20110181448 Koratagere Jul 2011 A1
20110219181 Hughes et al. Sep 2011 A1
20110225322 Oemidov et al. Sep 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110276963 Wu et al. Nov 2011 A1
20110299537 Saraiya et al. Dec 2011 A1
20120036325 Mashtizadeh et al. Feb 2012 A1
20120069131 Abelow Mar 2012 A1
20120147894 Mulligan et al. Jun 2012 A1
20120173759 Agarwal et al. Jul 2012 A1
20120218130 Boettcher et al. Aug 2012 A1
20120221611 Watanabe et al. Aug 2012 A1
20120230345 Ovsiannikov Sep 2012 A1
20120239872 Hughes et al. Sep 2012 A1
20130018722 Libby Jan 2013 A1
20130018765 Fork et al. Jan 2013 A1
20130031642 Dwivedi et al. Jan 2013 A1
20130044751 Casado et al. Feb 2013 A1
20130058354 Casado et al. Mar 2013 A1
20130080619 Assuncao et al. Mar 2013 A1
20130086236 Baucke et al. Apr 2013 A1
20130094501 Hughes Apr 2013 A1
20130103655 Fanghaenel et al. Apr 2013 A1
20130117494 Hughes et al. May 2013 A1
20130121209 Padmanabhan et al. May 2013 A1
20130141259 Hazarika et al. Jun 2013 A1
20130163594 Sharma et al. Jun 2013 A1
20130250951 Koganti Sep 2013 A1
20130263125 Shamsee et al. Oct 2013 A1
20130282970 Hughes et al. Oct 2013 A1
20130343191 Kim et al. Dec 2013 A1
20140052864 Van Der Linden et al. Feb 2014 A1
20140075554 Cooley Mar 2014 A1
20140101426 Senthurpandi Apr 2014 A1
20140108360 Kunath et al. Apr 2014 A1
20140114742 Lamontagne et al. Apr 2014 A1
20140123213 Vank et al. May 2014 A1
20140181381 Hughes et al. Jun 2014 A1
20140269705 DeCusatis et al. Sep 2014 A1
20140279078 Nukala et al. Sep 2014 A1
20140379937 Hughes et al. Dec 2014 A1
20150074291 Hughes Mar 2015 A1
20150074361 Hughes et al. Mar 2015 A1
20150078397 Hughes et al. Mar 2015 A1
20150120663 Le Scouarnec et al. Apr 2015 A1
20150143505 Border et al. May 2015 A1
20150170221 Shah Jun 2015 A1
20150281099 Banavalikar Oct 2015 A1
20150281391 Hughes et al. Oct 2015 A1
20160014051 Hughes et al. Jan 2016 A1
20160034305 Shear et al. Feb 2016 A1
20160093193 Silvers et al. Mar 2016 A1
20160218947 Hughes et al. Jul 2016 A1
20160255542 Hughes et al. Sep 2016 A1
20160380886 Blair et al. Dec 2016 A1
20170111692 An et al. Apr 2017 A1
20170149679 Hughes et al. May 2017 A1
20170187581 Hughes et al. Jun 2017 A1
Foreign Referenced Citations (3)
Number Date Country
1507353 Feb 2005 EP
H05-061964 Mar 1993 JP
WO0135226 May 2001 WO
Non-Patent Literature Citations (46)
Entry
Final Office Action, dated Jan. 11, 2016, U.S. Appl. No. 13/288,691, filed Nov. 3, 2011.
Final Office Action, dated Sep. 18, 2015, U.S. Appl. No. 14/477,804, filed Sep. 4, 2014.
Final Office Action, dated Dec. 21, 2015, U.S. Appl. No. 14/679,965, filed Apr. 6, 2015.
Non-Final Office Action, dated Aug. 11, 2015, U.S. Appl. No. 14/677,841, filed Apr. 2, 2015.
Non-Final Office Action, dated Aug. 18, 2015, U.S. Appl. No. 14/543,781, filed Nov. 17, 2014.
Notice of Allowance, dated Oct. 5, 2015, U.S. Appl. No. 14/734,949, filed Jun. 9, 2015.
Advisory Action, dated Nov. 25, 2015, U.S. Appl. No. 13/482,321, filed May 29, 2012.
Non-Final Office Action, dated Dec. 15, 2015, U.S. Appl. No. 14/479,131, filed Sep. 5, 2014.
Non-Final Office Action, dated Dec. 16, 2015, U.S. Appl. No. 14/859,179, filed Sep. 18, 2015.
Non-Final Office Action, dated Jan. 12, 2016, U.S. Appl. No. 14/477,804, filed Sep. 4, 2014
Notice of Allowance, dated Feb. 8, 2016, U.S. Appl. No. 14/543,781, filed Nov. 17, 2014.
“IPsec Anti-Replay Window: Expanding and Disabling,” Cisco IOS Security Configuration Guide. 2005-2006 Cisco Systems, Inc. Last updated: Sep. 12, 2006, 14 pages.
Singh et al. ; “Future of Internet Security—IPSEC”; 2005; pp. 1-8.
Muthitacharoen, Athicha et al., “A Low-bandwidth Network File System,” 2001, in Proc. of the 18th ACM Symposium on Operating Systems Principles, Banff, Canada, pp. 174-187.
“Shared LAN Cache Datasheet”, 1996, <http://www.lancache.com/slcdata.htm>.
Spring et al., “A protocol-independent technique for eliminating redundant network traffic”, ACM SIGCOMM Computer Communication Review, vol. 30, Issue 4 (Oct. 2000) pp. 87-95, Year of Publication: 2000.
Hong, B et al. “Duplicate data elimination in a SAN file system”, In Proceedings of the 21st Symposium on Mass Storage Systems (MSS'04), Goddard, MD, Apr. 2004. IEEE.
You, L. L. and Karamanolis, C. 2004. “Evaluation of efficient archival storage techniques”, In Proceedings of the 21st IEEE Symposium on Mass Storage Systems and Technologies (MSST).
Douglis, F. et al., “Application specific Delta-encoding via Resemblance Detection”, Published in the 2003 USENIX Annual Technical Conference.
You, L. L. et al., “Deep Store an Archival Storage System Architecture” Data Engineering, 2005. ICDE 2005. Proceedings of the 21st Intl. Conf. on Data Eng.,Tokyo, Japan, Apr. 5-8, 2005, pp. 12.
Manber, Udi, “Finding Similar Files in a Large File System”, TR 93-33 Oct. 1994, Department of Computer Science, University of Arizona. <http://webglimpse.net/pubs/TR93-33.pdf>. Also appears in the 1994 winter USENIX Technical Conference.
Knutsson, Bjorn et al., “Transparent Proxy Signalling”, Journal of Communications and Networks, vol. 3, No. 2, Jun. 2001.
Definition memory (n), Webster's Third New International Dictionary, Unabridged (1993), available at <http://lionreference.chadwyck.com> (Dictionaries/Webster's Dictionary). Copy not provided in IPR2013-00402 proceedings.
Definition appliance, 2c, Webster's Third New International Dictionary, Unabridged (1993), available at <http://lionreference.chadwyck.com> (Dictionaries/Webster's Dictionary). Copy not provided in IPR2013-00402 proceedings.
Newton, “Newton's Telecom Dictionary”, 17th Ed., 2001, pp. 38, 201, and 714.
Silver Peak Systems, “The Benefits of Byte-level WAN Deduplication” (2008).
“Business Wire, ““Silver Peak Systems Delivers Family of Appliances for Enterprise-Wide Centralization of Branch Office Infrastructure; Innovative Local Instance Networking Approach Overcomes Traditional Application Acceleration Pitfalls”” (available at http://www.businesswire.com/news/home/20050919005450/en/Silver-Peak-Systems-Delivers-Family-Appliances-Enterprise-Wide#.UVzkPk7u-1 (last visited Aug. 8, 2014)).”
Riverbed, “Riverbed Introduces Market-Leading WDS Solutions for Disaster Recovery and Business Application Acceleration” (available at http://www.riverbed.com/about/news-articles/pressreleases/riverbed-introduces-market-leading-wds-solutions-fordisaster-recovery-and-business-application-acceleration.html (last visited Aug. 8, 2014)).
Tseng, Josh, “When accelerating secure traffic is not secure” (available at http://www.riverbed.com/blogs/whenaccelerati.html?&isSearch=true&pageSize=3&page=2 (last visited Aug. 8, 2014)).
Riverbed, “The Riverbed Optimization System (RiOS) v4.0: A Technical Overview” (explaining “Data Security” through segmentation) (available at http://mediacms.riverbed.com/documents/TechOverview-Riverbed-RiOS—4—0.pdf (last visited Aug. 8, 2014)).
Riverbed, “Riverbed Awarded Patent on Core WDS Technology” (available at: http://www.riverbed.com/about/news-articles/pressreleases/riverbed-awarded-patent-on-core-wds-technology.html (last visited Aug. 8, 2014)).
Final Written Decision, Dec. 30, 2014, Inter Partes Review Case No. IPR2013-00403.
Final Written Decision, Dec. 30, 2014, Inter Partes Review Case No. IPR2013-00402.
Final Written Decision, Jun. 9, 2015, Inter Partes Review Case No. IPR2014-00245.
Final Office Action, dated Feb. 17, 2017, U.S. Appl. No. 15/148,933, filed May 6, 2016.
Notice of Allowance, dated Mar. 22, 2017, U.S. Appl. No. 13/621,534, filed Sep. 17, 2012.
Notice of Allowance, dated Mar. 23, 2017, U.S. Appl. No. 15/091,533, filed Apr. 5, 2016.
Non-Final Office Action, dated Apr. 27, 2017, U.S. Appl. No. 14/447,505, filed Jul. 30, 2014.
Final Office Action, dated May 3, 2017, U.S. Appl. No. 14/479,131, filed Sep. 5, 2014.
Non-Final Office Action, dated Jun. 20, 2017, U.S. Appl. No. 15/148,933, filed May 6, 2016.
Non-Final Office Action, dated Jul. 27, 2017, U.S. Appl. No. 14/981,814, filed Dec. 28, 2015.
Non-Final Office Action, dated Aug. 10, 2016, U.S. Appl. No. 15/148,933, filed May 6, 2016.
Notice of Allowance, dated Aug. 24, 2016, U.S. Appl. No. 14/679,965, filed Apr. 6, 2015.
Non-Final Office Action, dated Aug. 26, 2016, U.S. Appl. No. 13/621,534, filed Sep. 17, 2012.
Final Office Action, dated Oct. 4, 2016, U.S. Appl. No. 15/091,533, filed Apr. 5, 2016.
Non-Final Office Action, dated Oct. 6, 2016, U.S. Appl. No. 14/479,131, filed Sep. 5, 2014.
Related Publications (1)
Number Date Country
20150334210 A1 Nov 2015 US
Continuations (1)
Number Date Country
Parent 13274162 Oct 2011 US
Child 14811482 US