Mitigating attacks in packet-switched networks.
Transport protocol heuristics in packet-switched networks address vulnerabilities by identifying and mitigating attacks through SACK message processing thresholds, ensuring efficient network operation.
Patent Information
- Application Number
- JP2021578042
- Authority / Receiving Office
- JP · JP
- Patent Type
- Patents
- Current Assignee / Owner
- Priority Date
- 2019-09-19
- Filing Date
- 2020-07-01
- Publication Date
- 2024-11-21
- Estimated Expiration
- 2040-07-01
AI Technical Summary
Existing packet-switched networks are vulnerable to attacks that exploit weaknesses in transport protocol acknowledgment systems, leading to server overload and performance degradation due to excessive acknowledgment messages.
Implementing transport protocol heuristics to process selective acknowledgment (SACK) messages, identifying thresholds for operational functions, and taking remedial actions when these thresholds are reached to mitigate security threats.
Effectively identifies and mitigates malicious behavior without limiting send map entries, maintaining network performance by reducing the computational burden of processing excessive acknowledgment messages.
Smart Images

Figure 0007588101000001 
Figure 0007588101000002 
Figure 0007588101000003
Abstract
Description
[Technical field]
[0001] [CROSS REFERENCE TO RELATED APPLICATIONS] This application claims the benefit of U.S. Provisional Application No. 62 / 870,621, filed July 3, 2019, and U.S. Nonprovisional Application No. 16 / 576,556, filed September 19, 2019, the disclosures of which are incorporated herein by reference in their entireties. [Background technology]
[0002] Every day, huge amounts of data are transmitted around the world through computer networks. These networks break data files into smaller data packets that are transmitted over wired or wireless data links. The data packets are transmitted using a variety of protocols. These protocols are often referred to as transport protocols. These transport protocols can specify how the data is transferred, and can also include indicating whether it is OK for any of the data packets to be received out of order. When such out-of-order transmission is allowed, such as in the Transmission Control Protocol (TCP), some data packets may be received at the end node out of the specified sequence. Since data packets may be received out of order, the end node and server keep track of which packets have arrived and which have not. When data packets arrive at an end node, the end node sends an acknowledgement (ACK) message to the server to notify the server that those data packets have arrived. However, this notification process is easily exploited and can be used by an attacker to paralyze the server. Summary of the Invention
[0003] As described in more detail below, the present disclosure describes methods and systems for mitigating attacks designed to exploit weaknesses in transport protocol acknowledgment systems.
[0004] In one example, a computer-implemented method for mitigating attacks in a computer networking environment includes applying a transport protocol heuristic to a selective acknowledgment (SACK) message received at a network adapter from a network node. The transport protocol heuristic identifies a threshold for an operational function to be performed when processing the SACK message. The method also includes determining that a threshold for the transport protocol heuristic has been reached by applying the transport protocol heuristic to the SACK message received from the network node. And, in response to determining that the threshold has been reached, the method includes identifying the network node as a security threat and taking remedial action to mitigate the security threat.
[0005] In some examples, applying the transport protocol heuristics to the SACK message includes incrementing various counters associated with operational functions when the SACK message is processed. The counters indicate when a threshold for the transport protocol heuristic is reached. In some cases, the counters are modified upon receiving an acknowledgment (ACK) message.
[0006] In some examples, the security threat is an attacking node conducting an attack against the network computing system, and at least one of the remedial actions used to mitigate the security threat includes ignoring at least some of the SACK messages received from the network node.
[0007] In some instances, at least one of the thresholds for the action functions performed when processing a SACK message includes an indication of whether to move the ACK location in a send map (a data map for tracking what data has been sent). At least one of the thresholds for the action functions performed when processing a SACK message includes a measurement of how far to move the ACK location in the send map. In other instances, at least one of the thresholds for the action functions performed when processing a SACK message includes an indication of how many SACK messages are received within a specified time period.
[0008] In some examples, the SACK messages are filtered to remove previously received SACK messages. In some examples, filtering the SACK messages further includes removing duplicate SACK messages. In some examples, at least one of the thresholds for the action functions performed when processing the SACK messages includes an indication of how many SACK messages have been filtered within a specified period of time.
[0009] In some examples, determining that a threshold for the transport protocol heuristic has been reached includes determining that the network node is attempting to acknowledge multiple different send attempts to increase the size of the send map. In some examples, a decay factor is added to the send map to decrease one or more counters associated with the ACK or SACK messages. In some examples, the network node is identified as a security threat while the ACK or SACK messages are being removed. Following a determination that the threshold is no longer met by the network node, the network node is removed from being classified as a security threat.
[0010] In some examples, thresholds for operational functions performed when processing SACK messages are dynamically altered based on current operating conditions in the network computing system, while in other examples, thresholds for operational functions performed when processing SACK messages are dynamically altered based on the occurrence of specified triggers.
[0011] Additionally, a corresponding network computing system for mitigating attacks in a computer networking environment includes a network adapter for transmitting and receiving data via a transport protocol, a memory device for at least temporarily storing data received at the network adapter, and a processor for processing at least some of the received data. The processor applies a transport protocol heuristic to selective acknowledgment (SACK) messages received at the network adapter from a network node, the transport protocol heuristic identifying a threshold for an operational function to be performed when processing the SACK message. The processor also determines that a threshold for the transport protocol heuristic has been reached by applying the transport protocol heuristic to the SACK messages received from the network node. And, in response to determining that the threshold has been reached, the processor identifies the network node as a security threat and takes remedial action to mitigate the security threat.
[0012] In some examples, the methods are encoded as computer-readable instructions on a computer-readable medium. For example, the computer-readable medium includes one or more computer-readable instructions that, when executed by at least one processor of a computing device, cause the computing device to apply one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node, the one or more thresholds for operational functions to be performed when processing the SACK message, determine that a threshold for one or more of the transport protocol heuristics has been reached by applying the one or more transport protocol heuristics to the SACK message received from the network node, and, in response to determining that one or more of the thresholds have been reached, identify the network node as a security threat and take one or more remedial actions to mitigate the security threat.
[0013] Features from any of the embodiments described herein may be used in combination with other features consistent with the general principles described herein. These and other embodiments, features, and advantages will be more fully understood from a reading of the following detailed description in conjunction with the accompanying drawings and claims.
[0014] The accompanying drawings depict numerous example embodiments and are a part of the specification, and together with the following description, these drawings illustrate and explain various principles of the present disclosure. [Brief description of the drawings]
[0015] [Figure 1] FIG. 1 is a block diagram of an example content delivery ecosystem. [Diagram 2] FIG. 2 is a block diagram of an example distribution infrastructure within the content distribution ecosystem shown in FIG. [Diagram 3]FIG. 3 is a block diagram of an example content player within the content delivery ecosystem shown in FIG. [Figure 4] FIG. 4 is a computing environment in which embodiments described herein operate. [Diagram 5] FIG. 5 is a flow diagram of an example method for mitigating attacks in a packet-switched network. [Figure 6] FIG. 6 is a chart identifying various counters, quantities, and connection identifiers. [Figure 7] FIG. 7 is a chart identifying various thresholds, current values for those thresholds, and maximum values for those thresholds. [Figure 8A] FIG. 8A illustrates an embodiment of a send map that is updated over time. [Figure 8B] FIG. 8B illustrates an embodiment of a send map that is updated over time. [Figure 9] FIG. 9 illustrates an embodiment in which the decay factor is applied to the message counter before being applied to the send map.
[0016] Throughout the drawings, like reference characters and descriptions indicate similar, but not necessarily identical, elements. While the example embodiments described herein may take various modifications and alternative forms, specific embodiments have been shown by way of example in the drawings and will be described in detail herein. However, the example embodiments described herein are not intended to be limited to the particular forms disclosed. Instead, the present disclosure covers all modifications, equivalents, and alternatives falling within the scope of the appended claims. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0017] The present disclosure is generally directed to mitigating attacks in packet-switched networks. As described in more detail below, embodiments of the present disclosure apply transport protocol heuristics to selective acknowledgment (SACK) messages received at a network adapter from a network node. The transport protocol heuristics identify a threshold for an operational function to be performed when processing the SACK message. These embodiments also determine that a threshold for the transport protocol heuristic has been reached by applying the transport protocol heuristics to the SACK messages received from the network node. And, in response to determining that the threshold has been reached, the network node is identified as a threat to security and remedial action is taken to mitigate the threat.
[0018] In traditional packet-switched networks, attackers often attempt to exploit weaknesses in the network design. For example, as noted above with respect to the Transmission Control Protocol (TCP), some data packets sent by a server may be received out of order at the receiver. Data packets often take a circuitous route through the Internet to reach their destination. Some links along this route may be earlier than others. Thus, some data packets may arrive at a receiving device (e.g., an end node) out of order, or may be lost entirely and never reach the receiving device (e.g., due to an overloaded router). Because data packets are often received out of order, end nodes send acknowledgment messages to the server to keep track of which packets have arrived and which have not. These notifications are typically maintained by the server in a send map, scoreboard, data tree, or other data structure. As used herein, a "send map" is a data map that keeps track of what data has been sent to peer nodes. The send map is used to process incoming acknowledgments from these peer nodes. A data tree or other data structure may be used in place of or in addition to a send map in the embodiments described herein.
[0019] When packets forwarded from the server arrive at an end node, the end node sends various types of acknowledgement (ACK) messages to inform the server that those data packets have arrived. A selective ACK (SACK) message acknowledges receipt of a message out of any particular order, while an ACK message acknowledges receipt of all previous messages up to the one being acknowledged. So, if a file is sent split into, say, 10 different packets, a SACK message sent by the receiving end node could indicate that packet 5 has arrived, and an ACK message sent by the receiving node end for packet 3 could indicate that all of packets 1-3 have been received. The send map could make a note that packets 1-3 and packet 5 have been received, and the status of packets 4 and packets 6-10 is unknown.
[0020] In a real-world scenario, of course, many different packets can be sent and received during a TCP connection - tens of thousands, millions, or even billions of them. Thus, the server may receive a very large number of ACK and SACK messages. An attacker can exploit this fact and try to overload the server by sending an excessive amount of ACK / SACK messages. By sending a large number of ACK / SACK messages, the send map will grow in size until it cannot function efficiently due to the large number of messages, and the server will become unresponsive and all of its computing power will be used to maintain the ever-growing send map.
[0021] Some conventional solutions to thwart these types of attacks include placing a limit on the total number of send map entries. Such solutions simply identify a specific number and do not allow the creation of any send map entries beyond that number. However, the send map operates under the assumption that a new entry can be created for each new send and transmission. Because each send needs to be tracked in a TCP connection, the server will not send the data packet if a send map entry cannot be created, thus preventing data from being transferred or severely limiting the amount of data that can be transferred. Other conventional solutions place a limit on the number of send map entries that can be assigned SACKs. If this limit is reached as additional SACK messages come in, the server will start discarding SACK information. This significantly degrades server performance.
[0022] The embodiments described herein avoid these shortcomings by establishing transport protocol heuristics that identify actions performed by an attacker. These transport protocol heuristics are configured to identify these malicious actions without the need to place limits on send map entries or to place limits on SACKs. Once established, the transport protocol heuristics monitor certain actions by establishing limits on certain actions that can be performed when processing data packet acknowledgments. When those limits are reached, the systems described herein monitor actions from a node and take remedial action, including limiting the number of actions (e.g., send map moves) that can be performed on acknowledgment messages received from that node. These embodiments can be used in conjunction with any transport protocol, including TCP, User Datagram Protocol (UDP), Reliable Data Protocol (RDP), or other transport protocols.
[0023] In some cases, applying the transport protocol heuristics to the SACK message includes incrementing various counters associated with operational functions when the SACK message is processed. The counters indicate when a threshold for the transport protocol heuristic is reached. In some cases, the counters are modified upon receipt of an acknowledgment (ACK) message.
[0024] At least one of the remedial actions used to mitigate the security threat includes ignoring at least some of the SACK messages received from the network node. In some examples, at least one of the thresholds for the operational functions performed when processing the SACK messages includes an indication of whether the ACK location should be moved within the send map. In other cases, the threshold includes a measurement of how far the ACK location should be moved within the send map. In yet other cases, the threshold includes an indication of how many SACK messages are received within a specified time period.
[0025] In some cases, the SACK messages are filtered to remove previously received SACK messages or to remove duplicate SACK messages, and in some cases, the threshold includes an indication of how many SACK messages have been filtered and not filtered within a specified time period.
[0026] In some cases, determining that a threshold for the transport protocol heuristic has been reached includes determining that the network node is attempting to acknowledge multiple different send attempts to increase the size of the send map. In some embodiments, a decay factor is added to the send map to decrement a stale ACK or SACK count before processing a new ACK or SACK message. While the stale ACK or SACK count is being decremented, the network node may be identified as a security threat. If the threshold is determined to be no longer met by the network node, the network node is subsequently eliminated from being classified as a security threat.
[0027] In some cases, thresholds for operational functions performed when processing SACK messages are dynamically changed based on current operating conditions in the network computing system, while in other cases, thresholds for operational functions performed when processing SACK messages are dynamically changed based on the occurrence of specified triggers.
[0028] Because many of the embodiments described herein can be used with virtually any type of computing network, including distributed networks designed to provide video content to a global audience, various computer networks and video distribution systems are first described with reference to Figures 1-3. These figures introduce various networks and distribution methods that may be used to provide video content to users. Figures 4-9 describe more specific embodiments in which transport protocol heuristics are applied to acknowledgment messages sent or received over such networks to identify attacking nodes and take remedial action to mitigate or prevent the attack.
[0029] 1 is a block diagram of a content delivery ecosystem 100 that includes a delivery infrastructure 110 in communication with a content player 120. In some embodiments, the delivery infrastructure 110 can be configured to encode data and forward the encoded data to the content player 120 via data packets. The content player 120 can be configured to receive the encoded data via the delivery infrastructure 110 and decode it for playback to a user. The data provided by the delivery infrastructure 110 can include audio, video, text, images, animation, interactive content, haptic data, virtual or augmented reality data, location data, gaming data, or any other type of data that can be provided via streaming.
[0030] The distribution infrastructure 110 is generally any service, hardware, software, or other infrastructure component configured to deliver content to end users. For example, the distribution infrastructure 110 can include content ingestion systems, media transcoding and packaging services, network components (e.g., network adapters), and / or a variety of other types of hardware and software. The distribution infrastructure 110 can be implemented as a highly complex distribution system, a single media server or device, or anything in between. In some examples, regardless of size or complexity, the distribution infrastructure 110 can include at least one physical processor 112 and at least one memory device 114. One or more modules 116 can be stored or loaded into the memory 114 to enable adaptive streaming as discussed herein.
[0031] The content player 120 is generally any type or shape of device or system capable of playing audio and / or video content provided via the distribution infrastructure 110. Examples of content players 120 include, but are not limited to, mobile phones, tablets, laptop computers, desktop computers, televisions, set-top boxes, digital media players, virtual reality headsets, augmented reality glasses, and / or any other type or shape of device capable of presenting digital content. Similar to the distribution infrastructure 110, the content player 120 may include a physical processor 122, memory 124, and one or more modules 126. Some or all of the adaptive streaming processes described herein may be performed or enabled by the modules 126, and in some examples, the modules 116 of the distribution infrastructure 110 may work in conjunction with the modules 126 of the content player 120 to provide adaptive streaming of multimedia content.
[0032] In one embodiment, one or more of modules 116 and / or 126 in Figure 1 can be one or more software applications or programs that, when executed by a computing device, cause the computing device to perform one or more tasks. For example, as described in more detail below, one or more of modules 116 and 126 can be modules stored and configured to run on one or more general-purpose computing devices. One or more of modules 116 and 126 in Figure 1 can also be all or part of one or more special-purpose computers configured to perform one or more tasks.
[0033] Additionally, one or more of the modules, processes, algorithms, or steps described herein can transform data, physical devices, and / or representations of physical devices from one form to another. For example, one or more of the modules detailed herein can receive defect identification data, transform the defect identification data by preparing the defect identification data for presentation in an interactive user interface, provide results of the transformation to the interactive user interface, and represent the transformed defect identification data on the interactive user interface. Additionally or alternatively, one or more of the modules detailed herein can transform a processor, volatile memory, non-volatile memory, and / or any other portion of a physical computing device from one form to another by executing on the computing device, storing data on the computing device, and / or interacting with the computing device.
[0034] The physical processors 112 and 122 are generally any type of hardware-implemented processing unit capable of interpreting and / or executing computer-readable instructions. In one example, the physical processors 112 and 122 can access and / or modify one or more of the modules 116 and 126, respectively. Additionally or alternatively, the physical processors 112 and 122 can execute one or more of the modules 116 and 126 to facilitate adaptive streaming of multimedia content. Examples of the physical processors 112 and 122 include, but are not limited to, a microprocessor, a microcontroller, a central processing unit (CPU), a field programmable gate array (FPGA) implementing a soft-core processor, an application specific integrated circuit (ASIC), one or more portions thereof, one or more variations or combinations thereof, and / or any other suitable physical processor.
[0035] The memories 114 and 124 are generally any type or form of volatile or non-volatile storage device or medium capable of storing data and / or computer readable instructions. In one example, the memories 114 and / or 124 can store, load, and / or maintain one or more of the modules 116 and 126. Examples of the memories 114 and / or 124 include, but are not limited to, random access memory (RAM), read only memory (ROM), flash memory, hard disk drive (HDD), solid state drive (SSD), optical disk drive, cache, any variation or combination of one or more thereof, and / or any other suitable memory device or system.
[0036] 2 is a block diagram of example components of a content delivery infrastructure 110 according to one embodiment. The delivery infrastructure 110 can include storage devices 210, services 220, and networks 230. Storage devices 210 are generally any device, set of devices, and / or systems that can store content for delivery to end users. Storage devices 210 can include a central storage structure having devices capable of storing terabytes or petabytes of data and / or can include distributed storage systems (e.g., appliances that mirror or cache content at Internet interconnected locations to provide faster access to mirrored content within a region).
[0037] As shown, storage device 210 can store, among other things, content 212, user data 214, and / or log data 216. Content 212 can include television programs, movies, video games, user generated content, and / or any other suitable type or form of content. User data 214 can include personally identifiable information (PII), payment information, preference settings, language and accessibility settings, and / or any other information associated with a particular user or content player. Log data 216 can include viewing history information, network throughput information, and / or any other metrics associated with a user's connection to or interaction with distribution infrastructure 110.
[0038] Services 220 can include a personalization service 222, a transcoding service 224, and / or a packaging service 226. The personalization service 222 can personalize recommendations, content streams, and / or other aspects of a user's experience with the delivery infrastructure 110. The transcoding service 224 can compress media at different bit rates allowing real-time switching between different encodings. The packaging service 226 can package the encoded video prior to deployment to a delivery network, such as network 230, for streaming.
[0039] Network 230 is generally any medium or architecture capable of facilitating communication or data transfer. Network 230 may facilitate communication and / or data transfer via a transport protocol using wireless and / or wired connections. Examples of network 230 include, but are not limited to, an intranet, a wide area network (WAN), a local area network (LAN), a personal area network (PAN), the Internet, power line communication (PLC), a cellular network (e.g., a Global System for Mobile Communications (GSM) network), one or more portions thereof, one or more variations or combinations thereof, and / or any other suitable network. For example, as shown in FIG. 2, network 230 may include an Internet backbone 232, an Internet service provider 234, and / or a local network 236.
[0040] Figure 3 is a block diagram of an example implementation of the content player 120 of Figure 1. The content player 120 is generally any type or shape of computing device capable of reading computer-executable instructions. The content player 120 may include, but is not limited to, a laptop, a tablet, a desktop, a server, a cellular phone, a multimedia player, an embedded system, an Internet of Things (IoT) device such as a wearable device (e.g., a smart watch, smart glasses, etc.), a smart vehicle, a gaming console, a smart appliance, etc., one or more variations or combinations thereof, and / or any other suitable computing device.
[0041] 3, in addition to the processor 122 and memory 124, the content player 120 may include a communications infrastructure 302 and a communications interface 322 coupled to a network connection 324. The content player 120 may also include a graphics interface 326 coupled to a graphics device 328, an input interface 334 coupled to an input device 336, and a storage interface 338 coupled to a storage device 340.
[0042] The communications infrastructure 302 is generally any type or shape of infrastructure capable of facilitating communication between one or more components of a computing device. Examples of communications infrastructure 302 include, but are not limited to, any type or shape of communications bus (e.g., a Peripheral Component Interconnect (PCI) bus, a PCI Express (PCIe) (Peripheral Component Interconnect Express) bus, a memory bus, a front-side bus, an Integrated Drive Electronics (IDE) bus, a control or registration bus, a host bus, etc.).
[0043] As noted, memory 124 is generally any type or form of volatile or non-volatile storage device or medium capable of storing data and / or other computer-readable instructions. In some examples, memory 124 can store and / or load an operating system 308 for execution by processor 122. In one example, operating system 308 can include and / or be software that manages computer hardware and software resources and / or provides common services to computer programs and / or applications on content player 120.
[0044] The operating system 308 may perform various system management functions, such as managing hardware components (e.g., the graphics interface 326, the audio interface 330, the input interface 334, and / or the storage interface 338). The operating system 308 may also handle a memory management model for the playback application 310. Modules of the playback application 310 may include, for example, a content buffer 312, an audio decoder 318, and a video decoder 320.
[0045] The playback application 310 can be configured to retrieve digital content via the communications interface 322 and play the digital content through the graphics interface 326. The video decoder 320 can read units of video data from the video buffer 316 and output the units of video data in a sequence of video frames that correspond in duration to a fixed length of playback time. Reading the units of video data from the video buffer 316 effectively removes the units of video data from the video buffer 316. The sequence of video frames can then be rendered by the graphics interface 326 and sent to the graphics device 328 for display to a user.
[0046] In situations where the bandwidth of the distribution infrastructure 110 is limited and / or variable, the playback application 310 can download and buffer successive portions of video and / or audio data from different bitrate video encodings based on a variety of factors (such as scene complexity, audio complexity, network bandwidth, device capabilities, etc.). In some embodiments, video playback quality can be given higher priority than audio playback quality. Audio playback and video playback quality can also be balanced against each other, and in some embodiments, audio playback quality can be given higher priority than video playback quality.
[0047] The content player 120 may also include a storage device 340 coupled to the communications infrastructure 302 via a storage interface 338. The storage device 340 is generally any type or form of storage device or medium capable of storing data and / or other computer-readable instructions. For example, the storage device 340 may be a magnetic disk drive, a solid state drive, an optical disk drive, a flash drive, etc. The storage interface 338 is generally any type or form of interface or device for transferring data between the storage device 340 and other components of the content player 120.
[0048] Many other devices or subsystems may be included in or connected to the content player 120. Conversely, one or more of the components and devices illustrated in Figure 3 need not be present to practice the embodiments described and / or illustrated herein. The above-mentioned devices and subsystems may also be interconnected in ways different from those shown in Figure 3. The content player 120 may also employ any number of software, firmware, and / or hardware configurations.
[0049] 4 illustrates a computing environment 400 that includes a networked computing system 401. The networked computing system 401 can be virtually any type of computing system, including a local computing system or a distributed (e.g., cloud) computing system. The networked computing system 401 can include at least one processor 402 and at least some system memory 403. The computing system 401 can include program modules for performing a variety of different functions. The program modules can be hardware-based, software-based, or can include a combination of hardware and software. Each program module can use computing hardware and / or software to perform the specified functions, including functions described below.
[0050] The network computing system 401 also includes a network adapter 404 configured to communicate with other computer systems. The network adapter 404 may include any wired or wireless communication means capable of receiving data from and / or transmitting data to other computer systems. These communication means may include an Ethernet adapter, a WIFI adapter, a hardware radio device including, for example, a hardware-based receiver 405, a hardware-based transmitter 406, or a combined hardware-based transceiver capable of both receiving and transmitting data. The radio device may be a cellular radio device, a Bluetooth radio device, a Global Positioning System (GPS) radio device, or other type of radio device. The network adapter 404 may be configured to interact with databases, mobile computing devices (such as mobile phones or tablets), embedded or other types of computing systems.
[0051] The network computing system 401 also includes a transport protocol heuristics module 407. The transport protocol heuristics module 407 generates heuristics 408 with one or more thresholds 409 for those heuristics. For example, when the network computing system 401 processes data 416 that includes an ACK message 417, a SACK message 418, or other type of acknowledgment (e.g., a negative acknowledgment (NACK)), the network computing system 401 takes certain actions. As noted above, one of these actions includes creating or updating a send map entry. When a computing system (e.g., a personal computer 414 or a mobile device 415) sends an ACK 417 or a SACK 518, the network computing system 401 creates an update to its send map. In some embodiments, the network computing system 401 also analyzes the heuristics 408 that are designed to detect malicious behavior.
[0052] One of these heuristics looks at the ratio of ACK messages to SACK messages sent by a receiving node. For example, if the network computing system 401 is a server sending data 416 (e.g., video content) to a user's mobile device 415, the mobile device will send a combination of ACK and SACK messages back to the network computing system 401 over time. The ACK and SACK messages are not necessarily sent together, but over time, and the network computing system 401 can detect patterns in the ACK to SACK ratio. If the mobile device 415 is sending many more SACKs than ACKs, this high ratio of SACKs to ACKs can indicate that the mobile device is an attacking node. At that point, the network computing system 401 will either mark the mobile device 415 as an attacking node, or the network computing system will wait and analyze other heuristics related to the mobile device before marking the device as an attacker.
[0053] Another heuristic 408 that the network computing system 401 examines is the number of moves made by ACK and SACK messages. For example, when an ACK 417 or SACK message 418 is received at the network computing system 401, the system determines whether a pointer in the send map that indicates that all previous data packets have been received at an end node (e.g., mobile device 415) needs to be moved along the send map. Moving the pointer requires computation by the network computing system 401, so excessive movements require excessive computation. If too many movements are made for a given send map, the send map movements will likely overwhelm the resources of the network computing system 401, and communication will slow down, slow down, or may even stop. Therefore, in the embodiment described herein, the network computing system 401 monitors the number of send map moves made by each end node. If an end node is making too many moves, the threat mitigation module 412 of the network computing system 401 can stop responding to ACKs and SACKs from that end node and take other mitigation actions 413. These considerations are further described below with respect to method 500 of FIG.
[0054] Figure 5 is a flow diagram of an example computer-implemented method 500 for mitigating attacks in a packet-switched network. The steps illustrated in Figure 5 may be performed by any suitable computer-executable code and / or computing system, including the network computing system illustrated in Figure 4. In one example, each of the steps illustrated in Figure 5 may represent an algorithm whose structure includes or is represented by multiple sub-steps, an example of which is provided in more detail below.
[0055] As illustrated in step 510 in method 500 of FIG. 5, the network computing system 401 of FIG. 4 applies one or more transport protocol heuristics 408 to SACK messages 418 received at network adapter 404 from a network node (e.g., 415). The transport protocol heuristics 408 can identify thresholds 409 for operational functions to be performed when processing the SACK messages. The thresholds can include one or more of the following: an ACK move threshold that identifies a threshold number of send map pointer moves that are permitted; an ACK-to-SACK threshold that identifies a ratio of received ACK messages to SACK messages; a SACK-to-move threshold that identifies when a SACK message causes a send map pointer move (or "move" herein) and when a SACK message does not cause a move; a repair threshold that identifies whether the attacker's announcement was a false positive; and a map minimum threshold that identifies a minimum count of send map entries in a list stored in the network computing system (e.g., list 421 of database 420). It will be appreciated that many different thresholds 409 can be used in the transport protocol heuristics, and the above thresholds are examples of such values and are not intended to be limiting.
[0056] In step 520 of method 500, the threshold monitoring module 410 of FIG. 4 determines that a threshold 409 for at least one of the transport protocol heuristics has been reached by applying the transport protocol heuristics 408 to a SACK message 418 received from a network node (e.g., 415). The threshold monitoring module 410 is configured to monitor the thresholds and determine when their values are exceeded. In some embodiments, counters corresponding to the thresholds are implemented. As each message processing event (e.g., a send map move event) occurs, the counter associated with that action is incremented. After a number of successive increments, the threshold monitoring module 410 can determine that the counter value has exceeded the established threshold 409 for that counter.
[0057] In response to determining that one or more of the thresholds 409 have been reached, the security threat identification module 411, in step 530, identifies the network node (e.g., 415) as a security threat, and in step 540, the threat mitigation module 412 takes one or more remedial, mitigation actions 413 to reduce or eliminate the security threat. The mitigation actions 413 may include responding to a smaller number of ACK / SACK messages received from the security threat, ignoring ACK / SACK messages from the security threat entirely, reducing the number or type of actions taken in response to ACK / SACK messages from the security threat (e.g., performing fewer send map move operations or creating fewer ACK / SACK entries in the send map), filtering ACK / SACKs, introducing a decay factor when processing ACK / SACK messages, or taking other mitigation actions. In some cases, the security threat identification module 411 continues to monitor the node marked as a security threat. Over time, if the node's threshold 409 returns to the normal expected range, the node can be reclassified as a non-threat.
[0058] In some embodiments, as noted above, these thresholds 409 are associated with counters. For example, as shown in FIG. 6, different counters in the chart 600 track different actions. When those actions occur (e.g., when the send map pointer is moved), the counter 601 associated with that action is incremented. The network computing system 401 establishes counters, such as an ACK_Total counter that indicates the total number of ACK messages received from a node. A connection that identifies a sender and a receiver can be identified by a connection identifier 603. For example, if the mobile handheld device 415 in FIG. 4 is identified as "A" and the network computing system 401 is identified as "B", the connection can be referred to as "AB". In cases where the devices have multiple transport protocol connections (either simultaneously or consecutively), the connection identifier 603 can include a number, such as "AB1" or "AB2". Thus, a unique set of counters 601 can be applied to each connection between nodes (e.g., "AB1"), or counters can be applied to all of the connections between nodes A and B. Thus, counters 601 track various thresholds over time as communications are transferred back and forth between the server and the end nodes.
[0059] In chart 600, counter ACK_Total indicates how many ACK messages have been received at network computing system 401, as indicated by quantity 602. The current quantity is 62, indicating that network computing system 401 has received 62 ACK messages from node "B". The SACK_Total counter indicates a count of 53 received SACK messages, and the Moved counter indicates a quantity of 14 send map pointer moves. A very large number of "moves" can indicate that the SACK messages are illegitimate and part of an attack from a security threat. The No_Move counter tracks the number of times a SACK message was received without moving the send map pointer. Most SACK messages result in a "no move", so a low count of "no moves" typically indicates that message transmission is working properly. When an ACK, SACK, or other acknowledgment message is received at network computing system 401, network computing system 401 adds the message to the total, notes when the send map pointer was moved, and increments the associated counters each time those operational functions are performed. It will be appreciated that many different types of counters can be implemented to track different types of messages and different types of actions taken in response to those messages.
[0060] 7 illustrates a chart 700 having different thresholds 701, their associated current values 702, and maximum values 703. As the names suggest, the current values 702 indicate the current value of the counter for the respective threshold. The maximum values 703 indicate the maximum allowed value for that threshold. When the value of the counter for that threshold is increased beyond the maximum value 703, the threshold monitoring module 410 of FIG. 4 indicates that the threshold for that threshold 701 has been reached. The thresholds 701 represent a sampling of potential transport protocol heuristics that the network computing system 401 may track and monitor.
[0061] In FIG. 7, ACK_Movement_Threshold identifies the threshold number of send map pointer movements allowed within a given time frame. The current value 702 is 27, indicating that 27 send map pointer movements have occurred in the given time frame or since the occurrence of a specified event. When the maximum value of 50 is reached, security threat identification module 411 of FIG. 4 identifies the end node (e.g., personal computer 414) as a security threat. ACK_to_SACK_Threshold identifies the ratio of received ACK messages to SACK messages received from the end node within a specified time frame or since the occurrence of a specified event. SACK_to_Move_Threshold identifies when a SACK message causes a send map pointer movement and when a SACK message does not cause a movement.
[0062] The SACK_to_Move_Threshold may be a percentage of SACK move to no_move (e.g., 61% in FIG. 7) that if exceeded, the security threat identification module 411 identifies the end node as a security threat. The Restoration_Threshold identifies a percentage that indicates whether the attacker's announcement was a false positive, and the Map_Minimum threshold identifies a minimum count of send map entries that are stored before starting to determine if the end node is a security threat. As with the counters identified above, it will be understood that the identified thresholds 701 represent a sampling of potential transport protocol heuristics that the network computing system 401 may track and monitor, and that other thresholds may be used in combination with or as an alternative to the listed thresholds.
[0063] In some cases, the current value of a counter may be modified or even reset upon receiving some type of acknowledgment message. For example, upon receiving an ACK message 417 from computer system 414, network computing system 401 may modify a counter that tracks the acknowledgment message, such as ACK_Total in counter 601. If an end node is sending an excessive amount of ACK or SACK messages, threshold monitoring module 410 determines that a threshold has been exceeded and security threat identification module 411 identifies the end node as a threat.
[0064] FIG. 8A illustrates an embodiment of a send map 800A having multiple entries identifying sent packets 801. When an ACK message is received at network adapter 404, network computing system 401 acknowledges each of the previously sent messages up to ACK message 802. In FIGS. 8A and 8B, acknowledged messages are indicated by downward slash shading, selectively acknowledged messages are indicated by upward slash shading, and unacknowledged packets are unshaded. At 803, network computing system 401 receives SACK message 803 acknowledging receipt of the packets. SACK message 804 similarly acknowledges receipt of a packet that was received out of order. When ACK message 805 is received, the ACK indicates that all data packets 801 up to ACK 805 have been received. Thus, as shown in FIG. 8B, all packets 801 up to ACK 805 are shaded as acknowledged. The newly received SACK message 806 indicates that another out-of-order packet has been selectively acknowledged.
[0065] When an ACK is moved (such as from 802 to 805), a "Moved" counter is incremented by one. In some embodiments, an excessive amount of send map movement (e.g., exceeding the ACK_Movement_Threshold in FIG. 7) indicates that the end node is a security threat, and the security threat identification module 411 marks the end node as a threat. In some cases, the network computing system 401 can determine how far the ACK location should be moved. In FIG. 8A, the ACK 802 is moved nine locations to the packet specified by the ACK message 805. A large number of short movements received from an end node can indicate a potential attack. Therefore, one of the operational functions performed when processing a SACK message includes determining how far the ACK location should be moved within the send map (e.g., 800A / 800B). Additionally, if a large number of SACK messages are received in a short period of time, the security threat identification module 411 also marks the end node as a threat.
[0066] Once the network computing system 401 has flagged an end node as a threat, the threat mitigation module 412 takes various mitigation actions 413 to reduce or eliminate the threat posed by the end node. One mitigation action is to completely cut off communication with that end node. Another mitigation action is to ignore all or some of the SACK messages received from that end node. Another mitigation action is to ignore other types of ACK messages or to only respond to certain ACK messages. By ignoring some or all of these ACK / SACK messages from the end node, the network computing system 401 stops consuming a lot of computing resources on maintaining the send map, thus effectively eliminating this attack front. The processor 402 continues to operate at a healthy rate and is not overly dedicated to processing requests from the attacking node.
[0067] FIG. 9 illustrates an embodiment in which SACK messages are filtered before they are processed. This filtering can be performed before detecting security threats. In one embodiment, SACK messages 901 are received at a server (e.g., network computing system 401 of FIG. 4). The server applies a filter 902 to filter one or more of SACK messages 901, so that the filtered SACK messages are not processed by the server (e.g., send map 904 is not updated). Filter 902 can also be used to remove previously received SACK messages or to remove duplicate SACK messages. Filtered messages are filtered before being processed in send map 904, so that processing resources are not consumed in processing those messages to update the send map. This type of filtering can thus save a lot of CPU and memory overhead that would otherwise be consumed in processing SACK messages 901. In some cases, the network computing system 401 tracks how many SACK messages are filtered within a specified time period and uses that number to determine whether a particular end node is attempting to carry out an attack.
[0068] The decay factor 903 is used to identify attacking nodes more quickly. The decay factor 903 is applied to a counter (e.g., 702 in FIG. 7) to uniformly decrease the quantity of the counter, thereby decreasing the amount of time required to reach the threshold amount. For example, even if an attacker tries to increase the size of the send map window quickly and sends a large number of ACKs (e.g., 50,000 ACKs), the ACK-to-SACK ratio is very large, so it is likely to remain well within the established ACK-to-SACK ratio threshold (e.g., 60%). As long as the ratio is within this threshold, the attacker can continue to send ACK messages to extend the send map window. However, by uniformly applying the decay factor 903 to the counter at a specified time increment (e.g., every second), the counter is decreased by 1 / 2 or 1 / 4 or some other ratio.
[0069] Since all counters are decreased by the same decay ratio, the ACK to SACK ratio also remains the same. For instance, in the above example, if 100 SACKs were received along with 50,000 ACKs, the ACK to SACK ratio would be 50,000:100. If a decay factor of 1 / 4 is applied, the counters would each be decreased to 1 / 4 of their original value, thus 12,500:25. Further reductions in counter values can bring the ACK to SACK ratio closer to an established ACK to SACK ratio threshold (e.g., 60% ACK to SACK). Once the ACK to SACK ratio threshold is reached, the system can take mitigating actions to neutralize the attacker. Reaching this threshold in a more efficient manner allows attackers to be identified and stopped more quickly.
[0070] In some cases, the security threat identification module 411 of FIG. 4 is configured to identify an end node (e.g., 415) as a security threat while filtering out stale ACK or SACK messages. For example, the security threat identification module 411 can consult a counter to determine that the end node 415 is sending a number of ACK / SACK messages that exceed a threshold amount. The network computing system 401 can ensure that older ACK / SACK messages are properly processed before new messages are processed. While the older, possibly stale, ACK / SACK messages are being processed, the network computing system 401 can simultaneously determine that the end node 415 is a security threat.
[0071] However, in some cases, the end node 415 may not be intentionally attacking the network computing system 401. For example, the ACK / SACK messages sent by the end node 415 may be delayed due to failures or low bandwidth network links. For example, the network may be heavily congested or may be experiencing some type of interference, which may cause the ACK / SACK messages to arrive in large packets. The security threat identification module 411 may flag the end node 415 as a security threat and initiate one or more mitigation actions 413. However, the network computing system 401 may continue to monitor the end node 415, and if, over time, the acknowledgment messages sent by the node 415 return to normal levels below an established threshold, the security threat identification module may reclassify the node as no longer a security threat.
[0072] Additionally, the thresholds themselves may be modified over time. In such cases, an end node that was classified as exceeding one or more thresholds may no longer exceed those thresholds. Thus, the end node may be reclassified as a non-threat. The thresholds 409 may be modified, for example, due to current operating conditions in the networked computing system 401. For example, if the networked computing system 401 is experiencing high CPU load, the thresholds 409 may be dynamically lowered. Or, if the networked computing system 401 is experiencing light load, the thresholds 409 may be dynamically increased since more computing power is available to process the send map changes.
[0073] In the case of a higher threshold, the end nodes are less likely to be falsely identified as a security threat and their current level of service reduced or removed. For example, if the SACK-to-ACK ratio is set to 99%, it may take longer to identify an attacker, but the network computing system 401 is less likely to make a false positive. Additionally or alternatively, the size of the send map (or data tree) can be considered. Most endpoints, e.g., endpoints that do not experience high levels of data loss, have very small send maps. Therefore, if the threshold for the number of send map entries required even to start monitoring is increased, the increased limit may eliminate many connections that would normally reach a high SACK-to-ACK ratio during loss recovery. However, the size of the send map is still relatively small, so the computational burden of maintaining the send map remains low. And, therefore, even if the SACK-to-ACK ratio is relatively high, the sending node is not identified as an attacker because the size is below a certain threshold size.
[0074] Thus, the network computing system 401 can change the thresholds 409 over time and based on different conditions or triggering events. In some cases, the thresholds for each counter are detailed in a policy. These policies can be updated by the threshold update module 419 of FIG. 4. The updated thresholds 422 specified in the policy are then implemented by the threshold monitoring module 410 when determining if a threshold has been exceeded. The thresholds can also be changed to change how quickly an attacker is identified, or how quickly a non-threat node that is providing a large number of ACK / SACKs for a bad connection is properly classified as a non-threat. Thus, the thresholds can be set and forgotten, or can be dynamically changed based on current conditions such as CPU or memory bandwidth or the occurrence of a specified triggering event (e.g., receiving packets from a node in a specified country, or from a specified browser, or from a bank of IP addresses).
[0075] In one embodiment, a network computing system in which method 500 operates includes a network adapter that transmits and receives data via a transport protocol, a memory device that at least temporarily stores data received at the network adapter, and a processor that processes at least some of the received data, and includes applying one or more transport protocol heuristics to selective acknowledgment (SACK) messages received at the network adapter from a network node, the one or more transport protocol heuristics identifying one or more thresholds for operational functions to be performed when processing the SACK messages, determining that a threshold for one or more of the transport protocol heuristics has been reached by applying the one or more transport protocol heuristics to the SACK messages received from the network node, and in response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat and taking one or more remedial actions to mitigate the security threat.
[0076] A corresponding non-transitory computer-readable medium includes one or more computer-executable instructions that, when executed by at least one processor of a computing device, cause the computing device to apply one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node, identifying one or more thresholds for operational functions to be performed when processing the SACK message, determining that a threshold for one or more of the transport protocol heuristics has been reached by applying the one or more transport protocol heuristics to the SACK message received from the network node, and, in response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat and taking one or more remedial actions to mitigate the security threat.
[0077] Thus, the methods and systems described herein can detect attackers using a variety of different transport protocol heuristics. These heuristics define thresholds for certain actions to be taken when an acknowledgment message is received. When those threshold amounts are met, the node is identified as an attacker and monitored for future malicious behavior. When the node's behavior returns to normal, the node is no longer classified as a threat. Furthermore, as the system's capacity to process messages increases, or other policy conditions are met, the thresholds can be changed and a node that was classified as a threat is no longer classified as such. This functionality is provided without imposing any limitations on the total number of send map entries or the number of send map entries to which SACKs can be assigned.
[0078] Example Embodiments
[0079] 1. A network computing system comprising a network adapter for sending and receiving data via a transport protocol, a memory device for at least temporarily storing data received at the network adapter, and a processor for processing at least some of the received data, the system including applying one or more transport protocol heuristics to selective acknowledgment (SACK) messages received at the network adapter from a network node, the one or more transport protocol heuristics identifying one or more thresholds for operational functions to be performed when processing the SACK messages, determining that a threshold for one or more of the transport protocol heuristics has been reached by applying the one or more transport protocol heuristics to the SACK messages received from the network node, and in response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat, and taking one or more remedial actions to mitigate the security threat.
[0080] 2. The network computing system of claim 1, wherein applying one or more transport protocol heuristics to the SACK message includes incrementing one or more counters associated with operational functions when the SACK message is processed.
[0081] 3. The network computing system of claim 2, wherein the counter indicates when a threshold for one or more of the transport protocol heuristics has been reached.
[0082] 4. The network computing system of claim 2, wherein one or more of the counters are modified upon receipt of an acknowledgement (ACK) message.
[0083] 5. The network computing system of claim 1, wherein the security threat comprises an attacking node executing an attack against the network computing system.
[0084] 6. The network computing system of claim 1, wherein at least one of the one or more remedial actions used to mitigate a security threat comprises ignoring at least some of the SACK messages received from the network node.
[0085] 7. The network computing system of claim 1, wherein at least one of the thresholds for the action functions performed when processing a SACK message comprises an indication of whether the ACK position should be moved within the send map.
[0086] 8. The network computing system of claim 7, wherein at least one of the thresholds for the action functions performed when processing a SACK message comprises a measure of how far the ACK location should be moved within the send map.
[0087] 9. The network computing system of claim 1, wherein at least one of the thresholds for the operational functions performed when processing SACK messages comprises a measure of how many SACK messages are received within a specified period of time.
[0088] 10. The network computing system of claim 1, further comprising filtering SACK messages to remove previously received SACK messages.
[0089] 11. The network computing system of claim 10, wherein filtering the SACK messages further comprises removing duplicate SACK messages.
[0090] 12. The network computing system of claim 10, wherein at least one of the thresholds for the action functions performed when processing SACK messages comprises an indication of how many SACK messages have been filtered within a specified period of time.
[0091] 13. A computer-implemented method, comprising: applying one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node, the one or more thresholds for operational functions to be performed when processing the SACK message; determining that a threshold for one or more of the transport protocol heuristics has been reached by applying the one or more transport protocol heuristics to the SACK message received from the network node; and in response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat; and taking one or more remedial actions to mitigate the security threat.
[0092] 14. The computer-implemented method of claim 13, wherein determining that a threshold for one or more of the transport protocol heuristics has been reached includes determining that the network node is attempting to acknowledge multiple send attempts to increase the size of the send map.
[0093] 15. The computer-implemented method of claim 14, further comprising adding a decay factor to the send map to decrement one or more counters associated with the ACK or SACK message.
[0094] 16. The computer-implemented method of claim 15, wherein a network node is identified as a security threat while an ACK or SACK message is being filtered out.
[0095] 17. The computer-implemented method of claim 16, wherein upon determining that the threshold is no longer met by the network node, the network node is subsequently eliminated from being classified as a security threat.
[0096] 18. The computer-implemented method of claim 13, wherein at least one of the thresholds for the operational functions performed when processing a SACK message is dynamically altered based on one or more current operating conditions in the network computing system.
[0097] 19. The computer-implemented method of claim 13, wherein at least one of the thresholds for the action functions performed when processing a SACK message is dynamically altered based on the occurrence of a specified trigger.
[0098] 20. A non-transitory computer-readable medium comprising one or more computer-executable instructions that, when executed by at least one processor of a computing device, cause the computing device to apply one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node, identifying one or more thresholds for operational functions to be performed when processing the SACK message, determining that a threshold for one or more of the transport protocol heuristics has been reached by applying the one or more transport protocol heuristics to the SACK message received from the network node, and, in response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat and taking one or more remedial actions to mitigate the security threat.
[0099] As detailed above, the computing devices and systems described and / or illustrated herein broadly represent any type or form of computing device or system capable of executing computer-readable instructions, such as those contained within the modules described herein. In their most basic configurations, these computing devices may each include at least one memory device and at least one physical processor.
[0100] In some examples, the term "memory device" generally refers to any type or form of volatile or non-volatile storage device or medium capable of storing data and / or computer-readable instructions. In one example, a memory device can store, load, and / or maintain one or more of the modules described herein. Examples of memory devices include, but are not limited to, random access memory (RAM), read-only memory (ROM), flash memory, hard disk drive (HDD), solid-state drive (SSD), optical disk drive, cache, any variation or combination of one or more thereof, or any other suitable storage memory.
[0101] In some examples, the term "physical processor" generally refers to any type or form of hardware-implemented processing unit capable of interpreting and / or executing computer-readable instructions. In one example, a physical processor can access and / or modify one or more modules stored in the memory device described above. Examples of physical processors include, but are not limited to, a microprocessor, a microcontroller, a central processing unit (CPU), a field programmable gate array (FPGA) implementing a soft-core processor, an application specific integrated circuit (ASIC), one or more portions thereof, one or more variations or combinations thereof, or any other suitable physical processor.
[0102] Although illustrated as separate elements, the modules described and / or illustrated herein may represent portions of a single module or application. Additionally, in some embodiments, one or more of these modules may represent one or more software applications or programs that, when executed by a computing device, cause the computing device to perform one or more tasks. For example, one or more of the modules described and / or illustrated herein may represent modules stored on and configured to operate on one or more of the computing devices or systems described and / or illustrated herein. One or more of these modules may also represent all or a portion of one or more special purpose computers configured to perform one or more tasks.
[0103] Additionally, one or more of the modules described herein can transform data, physical devices, and / or representations of physical devices from one form to another. For example, one or more of the modules detailed herein can receive data to be transformed, transform the data, output the results of the transformation to apply heuristics, use the results of the transformation to identify security threats, and store the results of the transformation to identify future security threats. Additionally or alternatively, one or more of the modules detailed herein can execute on a computing device, store data on a computing device, and / or interact with a computing device to transform a processor, volatile memory, non-volatile memory, and / or any other portion of a physical computing device from one form to another.
[0104] In some embodiments, the term "computer-readable medium" generally refers to any form of device, carrier, or medium capable of storing or carrying computer-readable instructions. Examples of computer-readable media include, but are not limited to, transmission-type media such as carrier waves, non-transitory-type media such as magnetic storage media (e.g., hard disk drives, tape drives, and floppy disks), optical storage media (e.g., compact discs (CDs), digital video discs (DVDs), and Blu-ray discs), electronic storage media (e.g., solid-state drives and flash media), and other distribution systems.
[0105] The process parameters and sequence of steps described and / or illustrated herein are presented for purposes of example only and can be varied as desired. For example, the steps illustrated and / or described herein can be shown or discussed in a particular order, and the steps do not necessarily have to be performed in the order illustrated or discussed. The various example methods described and / or illustrated herein can also omit one or more of the steps described or illustrated herein or can include additional steps in addition to those steps disclosed.
[0106] The above description is provided to enable those skilled in the art to best utilize various aspects of the exemplary embodiments disclosed herein. This exemplary description is not intended to be exhaustive or to be limited to any precise form disclosed. Numerous modifications and variations are possible without departing from the spirit and scope of the present disclosure. The embodiments disclosed herein should be considered in all respects as illustrative and not restrictive. When determining the scope of the present disclosure, reference should be made to the appended claims and their equivalents.
[0107] Unless otherwise specified, the terms "connected to" and "coupled to" (and their derivatives) as used in the specification and claims should be interpreted as allowing for both direct and indirect (i.e., via other elements or components) connections. In addition, the term "a" as used in the specification and claims should be interpreted as meaning "at least one." Finally, for simplicity of use, the terms "including" and "having" (and their derivatives) as used in the specification and claims are interchangeable with the term "comprising" and have the same meaning. Preferred embodiments of the present invention will be described below in detail. EMBODIMENT 1 1. A network computing system, comprising: a network adapter for sending and receiving data via a transport protocol; a memory device for at least temporarily storing data received by the network adapter; a processor for processing at least some of the received data; applying one or more transport protocol heuristics to selective acknowledgment (SACK) messages received at the network adapter from a network node, the heuristics identifying one or more thresholds for operational functions to be performed when processing the SACK messages; applying the one or more transport protocol heuristics to the SACK messages received from the network node to determine that the threshold for one or more of the transport protocol heuristics has been reached; In response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat; taking one or more remedial actions to mitigate the security threat. EMBODIMENT 2 2. The network computing system of claim 1, wherein applying the one or more transport protocol heuristics to the SACK message includes incrementing one or more counters associated with the operational function when the SACK message is processed. EMBODIMENT 3 3. The network computing system of embodiment 2, wherein the counter indicates when the threshold for one or more of the transport protocol heuristics is reached. EMBODIMENT 4 3. The network computing system of embodiment 2, wherein one or more of the counters are modified upon receipt of an acknowledgement (ACK) message. EMBODIMENT 5 2. The network computing system of embodiment 1, wherein the security threat comprises an attacking node executing an attack against the network computing system. EMBODIMENT 6 2. The network computing system of claim 1, wherein at least one of the one or more remedial actions used to mitigate the security threat comprises ignoring at least some of the SACK messages received from the network node. EMBODIMENT 7 2. The network computing system of claim 1, wherein at least one of the thresholds for operational functions performed when processing the SACK message includes an indication of whether the ACK position should be moved within the send map. EMBODIMENT 8 8. The network computing system of claim 7, wherein at least one of the thresholds for operational functions performed when processing the SACK message comprises a measure of how far the ACK location should be moved within the send map. EMBODIMENT 9 2. The network computing system of claim 1, wherein at least one of the thresholds for operational functions performed when processing the SACK message comprises an indication of how many SACK messages are received within a specified time period. EMBODIMENT 10 2. The network computing system of embodiment 1, further comprising filtering the SACK messages to remove previously received SACK messages. EMBODIMENT 11 11. The network computing system of embodiment 10, wherein filtering the SACK messages further comprises removing duplicate SACK messages. EMBODIMENT 12 11. The network computing system of claim 10, wherein at least one of the thresholds for an operational function performed when processing the SACK message comprises an indication of how many SACK messages have been filtered within a specified period of time. EMBODIMENT 13 1. A computer-implemented method comprising: applying one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node, the heuristic identifying one or more thresholds for operational functions to be performed when processing the SACK message; applying the one or more transport protocol heuristics to the SACK messages received from the network node to determine that the threshold for one or more of the transport protocol heuristics has been reached; In response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat; taking one or more remedial actions to mitigate the security threat. EMBODIMENT 14 14. The computer-implemented method of embodiment 13, wherein determining that the threshold for one or more of the transport protocol heuristics has been reached includes determining that the network node is attempting to acknowledge multiple send attempts to increase a size of a send map. EMBODIMENT 15 15. The computer-implemented method of embodiment 14, further comprising adding a decay factor to the send map to decrement one or more counters associated with ACK or SACK messages. EMBODIMENT 16 16. The computer-implemented method of embodiment 15, wherein the network node is identified as a security threat while the ACK or SACK message is being removed. EMBODIMENT 17 17. The computer-implemented method of embodiment 16, wherein upon determining that the threshold is no longer met by the network node, the network node is subsequently eliminated from being classified as a security threat. EMBODIMENT 18 14. The computer-implemented method of embodiment 13, wherein at least one of the thresholds for operational functions performed when processing the SACK message is dynamically changed based on one or more current operating conditions in the network computing system. EMBODIMENT 19 14. The computer-implemented method of embodiment 13, wherein at least one of the thresholds for operational functions performed when processing the SACK message is dynamically changed based on the occurrence of a specified trigger. EMBODIMENT 20 A non-transitory computer-readable medium comprising one or more computer-executable instructions that, when executed by at least one processor of a computing device, cause the computing device to: applying one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node, identifying one or more thresholds for operational functions to be performed when processing the SACK message; applying the one or more transport protocol heuristics to the SACK message received from the network node to determine that the threshold for one or more of the transport protocol heuristics has been reached, and in response to determining that one or more of the thresholds has been reached, identifying said network node as a security threat; 20. A non-transitory computer-readable medium for causing one or more remedial actions to be taken to mitigate said security threats.
Claims
1. 1. A network computing system, comprising: a network adapter for sending and receiving data via a transport protocol; a memory device for at least temporarily storing data received by the network adapter; a processor for performing at least some processing of the received data, the at least some processing comprising: applying one or more transport protocol heuristics to selective acknowledgment (SACK) messages received at the network adapter from a network node to identify one or more thresholds for operational functions to be performed when processing the SACK messages; applying the one or more transport protocol heuristics to the SACK message received from the network node to determine that the threshold for one or more of the transport protocol heuristics has been reached; In response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat; and taking one or more remedial actions to mitigate the security threat, wherein the SACK message is processed using a send map that tracks data sent to the network node.
2. 2. The network computing system of claim 1, wherein applying the one or more transport protocol heuristics to the SACK message comprises incrementing one or more counters associated with the operational function when the SACK message is processed.
3. 3. The network computing system of claim 2, wherein the counter indicates when the threshold for one or more of the transport protocol heuristics is reached.
4. 3. The network computing system of claim 2, wherein one or more of the counters are modified upon receipt of an acknowledgement (ACK) message.
5. 10. The network computing system of claim 1, wherein the security threat comprises an attacking node conducting an attack against the network computing system.
6. 2. The network computing system of claim 1, wherein at least one of the one or more remedial actions used to mitigate the security threat comprises ignoring at least some of the SACK messages received from the network node.
7. 2. The network computing system of claim 1, wherein at least one of the thresholds for an operational function performed when processing the SACK message comprises an indication of whether an ACK position should be moved within a send map.
8. 8. The network computing system of claim 7, wherein at least one of the thresholds for an operational function performed when processing the SACK message comprises a measure of how far the ACK location should be moved within the send map.
9. 2. The network computing system of claim 1, wherein at least one of the thresholds for operational functions performed when processing the SACK message comprises an indication of how many SACK messages are received within a specified time period.
10. 2. The network computing system of claim 1, further comprising filtering the SACK messages to remove previously received SACK messages.
11. 11. The network computing system of claim 10, wherein filtering the SACK messages further comprises removing duplicate SACK messages.
12. 11. The network computing system of claim 10, wherein at least one of the thresholds for an operational function performed when processing the SACK message comprises an indication of how many SACK messages have been filtered within a specified time period.
13. 1. A computer-implemented method comprising: applying one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node to identify one or more thresholds for operational functions to be performed when processing the SACK message; applying the one or more transport protocol heuristics to the SACK message received from the network node to determine that the threshold for one or more of the transport protocol heuristics has been reached; In response to determining that one or more of the thresholds have been reached, identifying the network node as a security threat; taking one or more remedial actions to mitigate the security threat; A computer-implemented method, wherein the SACK message is processed using a send map that tracks data sent to the network node.
14. 14. The computer-implemented method of claim 13, wherein determining that the threshold for one or more of the transport protocol heuristics has been reached comprises determining that the network node is attempting to respond to a multiple send attack to increase a size of a send map.
15. 15. The computer-implemented method of claim 14, further comprising applying a decay factor to the send map to decrement one or more counters associated with ACK or SACK messages.
16. 16. The computer-implemented method of claim 15, wherein the network node is identified as a security threat while the ACK or SACK message is being removed.
17. 17. The computer-implemented method of claim 16, wherein following a determination that the threshold is no longer met by the network node, the network node is eliminated from being classified as a security threat.
18. 14. The computer-implemented method of claim 13, wherein at least one of the thresholds for operational functions performed when processing the SACK message is dynamically changed based on one or more current operating conditions at the computer.
19. 14. The computer-implemented method of claim 13, wherein at least one of the thresholds for operational functions performed when processing the SACK message is dynamically changed based on the occurrence of a specified trigger.
20. A non-transitory computer-readable medium comprising one or more computer-executable instructions that, when executed by at least one processor of a computing device, cause the computing device to: applying one or more transport protocol heuristics to a selective acknowledgment (SACK) message received at a network adapter from a network node, the heuristic identifying one or more thresholds for operational functions to be performed when processing the SACK message; applying the one or more transport protocol heuristics to the SACK message received from the network node to determine that the threshold for one or more of the transport protocol heuristics has been reached, and in response to determining that one or more of the thresholds have been reached, identifying said network node as a security threat; taking one or more remedial actions to mitigate the security threat; The non-transitory computer-readable medium, wherein the SACK message is processed using a send map that tracks data sent to the network node.
Citation Information
Patent Citations
Distributed network protection
US20090138968A1
