Field of the Invention
The present invention is generally related to optimizing the transfer of packetized data between electronic devices in a computer network. More specifically, the present invention relates to assembling, and compressing a plurality of fragmented packets in a manner that minimizes the size of payload data when transferring digital information over a computer network. Description of the Related Art
Internet protocol (IP) payload compression (IPComp) is a technique that compresses and encrypts IP packets as the IP packets are being transmitted through a computer network. Conventionally a set of data or a stream of data is fragmented into a series of packets that are commonly referred to as fragmented IP packets. Generally an electronic device such as a gateway compresses, encrypts, and re-transmits fragmented packets of information as they are received. After being received at a destination the packets are de-encrypted, de-compressed, and re-assembled into the complete data set or data stream.
A series of fragmented packets may include any sort of computer data that is transmitted from a source computer to a destination computer communicating over a computer network. The packets may contain information relating to a file, a message, commands, a video or audio stream, or may include encapsulated data.
Data transferred over a computer network may be a datagram, which may be a self-contained data structure including sufficient information to be routed from a source computer to a destination computer without requiring exchanges of information that setup or configure a communication path between the source computer and the destination computer or a computer network over which the datagram is transmitted. Datagrams may be transmitted over standard computer networks. Datagrams commonly include fields of information that may include a preamble, a header length, a header checksum, a destination address, a source address, payload data, a data type, a length field, and a frame sequence number. In certain instances all of the information included in a datagram is compressed and then encapsulated into a set of data before an IP packet including the datagram is transmitted. In certain instances a datagram may be an IP packet or be encapsulated within an IP packet.
Frequently, at least some of the information included in the datagram is information that is not used by an application program at the destination computer. For example, an application program playing streaming audio may only require the payload data in the datagram. When transmitted over a computer network these additional pieces of information consume a portion of the overall network bandwidth. The more packets used to transfer a particular data set increase the overhead associated with transferring data over a computer network. For example, a data set transferred over a computer network using 10 packets could include twice as much additional pieces of information (i.e., overhead) than the same set of data transferred over the computer network using 5 packets.
Another factor that increases the overhead associated with transferring data over a computer network is the compression efficiency. Generally data from a data set when compressed will include fewer bytes of data as compared to fragmenting the data set into a plurality of pieces and then compressing each of the plurality of pieces of fragmented data independently.
Electronic devices transferring packets over a computer network commonly compress, encrypt, and then re-transmit packets as they are received. This practice increases the overhead associated with transferring data over the computer network because the total number of bytes transferred over the computer network is not optimized. Legacy computer networks commonly use standardized IPComp techniques when re-transmitting a plurality of fragmented packets over a computer network. Even though IPComp protocols reduce the size of IP datagrams transmitted over the internet, IPComp protocols do not maximize the efficiency of transmitting these fragmented packets. One reason for this is that the packets transmitted may not be of an optimal size when they are compressed.
An example of an IPComp protocol is the RFC3173 standardized compression protocol. Frequently IPComp is used with an IP security (IPSec) Virtual Private Network (VPN) when transmitting packets over a computer network. When IPComp is combined with a secure IPSec VPN, fragmented packets received are compressed according to an IPComp standard, each compressed packet is then individually encrypted by a IPSec VPN engine, and then each compressed/encrypted packet is transmitted over the computer network to a destination address.
What is needed is an increase in the efficiency of transmitting data over a computer network as to reduce the number of bytes of data transferred over the computer network.
The present invention increases the efficiency of transmitting data from a plurality of fragmented internet protocol (IP) packets over a computer network. A computing device such as a gateway or a firewall in a computer network that receives fragmented IP packets over a computer network interface may assemble or reassemble data from a plurality of fragmented IP packets into a single IP packet. Data from the plurality of fragmented IP packets may be concatenated or coalesced within the single IP packet. The single IP packet may then be compressed using a compression algorithm and the compressed IP packet may then be transmitted over a computer network interface to a destination computer. The compressed IP packet may also be encrypted before being transmitted over the computer network interface.
The present invention may repeat the process of reassembling numerous sets of fragmented IP packets where each set of fragmented IP packets may include a plurality of different IP packets. Each set of fragmented IP packets may be coalesced into an individual IP packet and each individual IP packet may be compressed and encrypted before being transmitted over the computer network interface to a destination.
The present invention increases the efficiency of transmitting data from a plurality of fragmented internet protocol (IP) packets over a computer network. After receiving a plurality of fragmented packets over a computer network interface a computing device may reassemble data from the plurality of packets into a reassembled (concatenated/coalesced) IP packet that includes data from each of the plurality fragmented IP packets. The reassembled IP packet may then be compressed before being transmitted to a computer identified in a destination address in each of the plurality of fragmented packets. In certain instances the compressed IP packet may also be encrypted before transmitting the encrypted compressed IP packet to a destination address.
In certain instances the data from the plurality of fragmented IP packets received may be concatenated in the order received, in other instances the plurality of fragmented IP packets may be re-ordered when out of order before the data is concatenated. The plurality of fragmented IP packets may be received over a computer network interface from a computing device connected to the internet or an intranet.
The single IP packet may then be compressed using a compression algorithm. The compression algorithm may be implemented in hardware, in software, or combination thereof. In certain instances the present invention may be implemented as a software program executing instructions out of memory, in an application specific integrated circuit (ASIC), using a field programmable gate array (FPGA), or be implemented using a combination of hardware and software.
The components shown in
Mass storage device 130, which may include mass storage implemented with a magnetic disk drive, an optical disk drive, FLASH memory, or be a portable USB data storage device. Mass storage device 130 can store the system software for implementing embodiments of the present invention for purposes of loading that software into main memory 120. The system software for implementing embodiments of the present invention may be stored on such a portable medium and input to the computer system 100 via the portable storage device.
Antenna 140 may include one or more antennas for communicating wirelessly with another device. Antenna 140 may be used, for example, to communicate wirelessly via Wi-Fi, Bluetooth, with a cellular network, or with other wireless protocols and systems. The one or more antennas may be controlled by a processor 110, which may include a controller, to transmit and receive wireless signals. For example, processor 110 executes programs stored in memory 120 to control antenna 140, transmit a wireless signal to a cellular network, and receive a wireless signal from the cellular network. Even though firewalls do not typically include an antenna and do not support receiving and transmitting wireless communications, a firewall consistent with the present invention could include wireless communications.
The system 100 as shown in
Display system 170 may include a liquid crystal display (LCD), LED display, a plasma display, or be another suitable display device. Display system 170 receives textual and graphical information, and processes the information for output to the display device.
Peripherals 180 may include any type of computer support device to add additional functionality to the computer system. For example, peripheral device(s) 180 may include a modem or a router.
The components contained in the computer system 100 of
Data contained in one or more of the fields in the reassembled IP packet may be adjusted. For example, information in a header length filed, a header checksum field, a payload data filed, and in a total length field may be adjusted to reflect information included in the reassembled IP packet. Redundant overhead information, such as, a destination and a source address may optionally be removed from a data set when reassembling an IP packet. When overhead information is removed from a data set that is reassembled into an IP packet, the number of bytes included in the reassembled IP packet may be reduced as compared to an IP packet that includes redundant overhead information.
The present invention may optionally remove redundant overhead information when reassembling a data set from each of a plurality of fragmented IP packets. Data from the plurality of fragmented IP packets may be concatenated before being compressed. Redundant overhead information may include any information contained within a set of fragmented packets that may not be used by an application program at a destination computer including, yet not limited to a header length, a header checksum, a destination address, a source address, a data type, a length field, and a frame sequence number.
Next in step 230 the reassembled IP packet may then be compressed. When encryption is used the reassembled datagram may be encrypted in step 240 of the flow chart. In step 250 of the flow chart the reassembled IP packet may then be transmitted over a network communication interface to a destination computer.
The number of fragmented packets reassembled into a coalesced IP packet may be configured by an administrator of a computer network, or may be dynamically adjusted based on one or more characteristics identified in the plurality of fragmented IP packets. When the number of fragmented packets is configured by an administrator of a computer network, the administrator may enter information into a graphical user interface displayed on a display at a computing device accessed by the administrator.
For example, when the fragmented packets contain only tens of bytes of information a dozen fragmented packets may be coalesced into a reassembled IP packet. Alternatively when the fragmented packets include hundreds of bytes of information only five fragmented packets may be coalesced into a reassembled IP packet.
In a second example, data from a plurality of fragmented packets may be coalesced such that the reassembled IP packet includes all information that corresponds to a single complete message or command being transmitted from a source computer to a destination computer. In this instance after the reassembled IP packet has been compressed and encrypted it may be sent to the destination computer. When such a reassembled IP packet includes more bytes than identified by a maximum transmission unit (MTU) setting, the reassembled packet may be fragmented into two or more IP packets and then the fragmented IP packets may be sent to the destination computer.
In a third example, data from an audio or video data stream may be reassembled continuously into a series of individual coalesced IP packets before each coalesced IP packet is compressed and transmitted to a destination computer. Initially 10 fragmented packets from the data stream may be reassembled into an IP packet before being transmitted to a destination computer. The size of the reassembled compressed IP packet may then be used to adjust the number of packets coalesced into a next reassembled IP packet from the data stream. In the instance where data from the 10 fragmented packets after being coalesced and compressed includes a number of bytes that are less than half of a maximum transmission unit byte size, the present invention may coalesce the next 20 fragmented packets received into a second reassembled IP packet. After reassembling the second IP packet, the second IP packet may then be compressed and transmitted to a destination computer with confidence that the second reassembled IP packet should not exceed the MTU setting.
The number of fragmented packets reassembled into a coalesced IP packet may be dynamically adjusted according to an average amount of information in each fragmented packet, according to an average size of coalesced compressed and encrypted IP packets, or be adjusted according to settings set by an network administrator.
The various methods may be performed by software operating in conjunction with hardware. For example, instructions executed by a processor, the instructions otherwise stored in a non-transitory computer readable medium such as memory. Various interfaces may be implemented—both communications and interface. One skilled in the art will appreciate the various requisite components of a mobile device and integration of the same with one or more of the foregoing figures and/or descriptions.
While various embodiments have been described above, it should be understood that they have been presented by way of example only, and not limitation. The description are not intended to limit the scope of the presently claimed invention or to limit the scope of embodiments of the present invention. The present descriptions are intended to cover alternatives, modifications, and equivalents consistent with the spirit and scope of the disclosure.
Number | Name | Date | Kind |
---|---|---|---|
5991713 | Unger et al. | Nov 1999 | A |
6282542 | Carneal et al. | Aug 2001 | B1 |
6826152 | Kroon | Nov 2004 | B1 |
7120666 | McCanne et al. | Oct 2006 | B2 |
7254636 | O'Toole, Jr. et al. | Aug 2007 | B1 |
7564861 | Subbiah | Jul 2009 | B1 |
7716307 | Ben-Shaul et al. | May 2010 | B1 |
7809693 | Lango et al. | Oct 2010 | B2 |
8090866 | Bashyam et al. | Jan 2012 | B1 |
8112505 | Ben-Shaul et al. | Feb 2012 | B1 |
8176186 | McCanne et al. | May 2012 | B2 |
8244864 | Bahl et al. | Aug 2012 | B1 |
9813526 | Liddicott | Nov 2017 | B2 |
9917882 | Liddicott et al. | Mar 2018 | B2 |
20030039248 | Weaver | Feb 2003 | A1 |
20030065796 | Borr | Apr 2003 | A1 |
20030084183 | Odlund et al. | May 2003 | A1 |
20030204593 | Brown et al. | Oct 2003 | A1 |
20040088375 | Sethi et al. | May 2004 | A1 |
20040255048 | Lev Ran et al. | Dec 2004 | A1 |
20050015461 | Richard | Jan 2005 | A1 |
20050086306 | Lemke | Apr 2005 | A1 |
20050114436 | Betarbet | May 2005 | A1 |
20050262220 | Ecklund | Nov 2005 | A1 |
20070124477 | Martin | May 2007 | A1 |
20070250552 | Lango et al. | Oct 2007 | A1 |
20080229025 | Plamondon | Sep 2008 | A1 |
20090077252 | Abdo | Mar 2009 | A1 |
20090222515 | Thompson et al. | Sep 2009 | A1 |
20090276543 | Turner et al. | Nov 2009 | A1 |
20090300162 | Demarie et al. | Dec 2009 | A1 |
20100098092 | Luo et al. | Apr 2010 | A1 |
20100177642 | Sebastian et al. | Jul 2010 | A1 |
20110051173 | Yagishita | Mar 2011 | A1 |
20120226738 | Taneja et al. | Sep 2012 | A1 |
20120257120 | Nakai | Oct 2012 | A1 |
20120257500 | Lynch | Oct 2012 | A1 |
20120265892 | Ma | Oct 2012 | A1 |
20130091303 | Mitra | Apr 2013 | A1 |
20130097309 | Ma et al. | Apr 2013 | A1 |
20130198868 | Georgiev | Aug 2013 | A1 |
20130297679 | Kim | Nov 2013 | A1 |
20140026182 | Pearl | Jan 2014 | A1 |
20140040353 | Sebastian | Feb 2014 | A1 |
20150089019 | Chou | Mar 2015 | A1 |
20150142874 | He et al. | May 2015 | A1 |
20160085920 | Cyran | Mar 2016 | A1 |
20160156696 | Liddicott | Jun 2016 | A1 |
20160218902 | Hwang | Jul 2016 | A1 |
20160335324 | Caulfield | Nov 2016 | A1 |
20160352869 | Liddicott | Dec 2016 | A1 |
20170041431 | Liddicott | Feb 2017 | A1 |
20170366651 | Liddicott | Dec 2017 | A1 |
Entry |
---|
U.S. Appl. No. 14/821,635 Office Action dated Apr. 24, 2017. |
U.S. Appl. No. 14/556,157 Office Action dated Nov. 15, 2016. |
U.S. Appl. No. 14/556,157 Office Action dated Jun. 5, 2017. |
U.S. Appl. No. 15/690,642, filed Aug. 30, 2017, Samuel Liddicott, Reducing Transmission Pathway Lengths Withing a Distributed Network. |
U.S. Appl. No. 14/821,635 Final Office Action dated Sep. 22, 2017. |
U.S. Appl. No. 14/821,635 Office Action dated Feb. 6, 2018. |
Number | Date | Country | |
---|---|---|---|
20160198020 A1 | Jul 2016 | US |