Throttling network traffic generated by a network discovery tool during a discovery scan
Summary by NHIP
Network Discovery Traffic Limiter
The system limits bandwidth for network discovery processes within subnetworks using a dedicated limiter. It determines limits via a maximum transfer bandwidth or a percent ratio of maximum link speed and queues threads that exceed available bandwidth.
Claim Score by NHIP
Abstract
This invention describes a method to limit the number of concurrent discovery processes into networks based upon the network traffic volume and discovery duration per device.

Term
Projected expiry 25 June 2029.
- Priority
- Filed
- Granted
- Today
- Projected expiry
14 claims: 3 independent, 11 dependent
- 1A system for discovering devices in a network, comprising:at least one subnetwork;and a limiter for limiting an amount of bandwidth utilized for a discovery process into each subnetwork, in which the limiter utilizes a maximum transfer bandwidth into the subnetwork, and in which the limiter utilizes a percent ratio of a maximum link speed that can be utilized for discovery processes.
- 6A method of discovering devices in a network, comprising:determining a bandwidth limit for discovery processes;limiting an amount of bandwidth utilized for discovery process into each subnetwork in the network, and issuing a discovery process thread as long as the amount of bandwidth required for the discovery process thread does not exceed the amount of bandwidth utilized for discovery processes in the subnetwork, in which if the amount of bandwidth required for the discovery process thread does exceed the amount of bandwidth utilized for discovery processes in the subnetwork, then placing the discovery process in a queue for later processing.
- 10Broadest claimClaim Score 87, broad(NHIP)A method of initially discovering devices in a network, comprising:setting the number of concurrent discovery processes within a subnetwork to 1;issuing a discovery process thread within the subnetwork;and adjusting the number of concurrent discovery processes based on a maximum transfer bandwidth into the subnetwork.
Independent claims3
39 paragraphs in 6 sections, as filed
CROSS REFERENCE TO RELATED APPLICATIONS
0001This Application claims the benefit of provisional patent application Ser. No. 61/059,925, filed Jun. 9, 2008, titled “Throttling Network Traffic Generated By A Network Discovery Tool During A Discovery Scan,” which application is incorporated by reference herein as if reproduced in full below.
FIELD OF THE INVENTION
0002The present invention relates generally to the field of network discovery tools.
BACKGROUND OF THE INVENTION
0003Network discovery tools are an important part of managing or administrating a network. They are utilized to scan for devices on the network within a specific IP range. Network discovery tools generally run on Local Area Networks (LANs), and other networks such as Wide Area Networks (WANs). WAN networks are typically used in geographically distributed networks. These tools are utilized to obtain information about all of the devices on the network. A network discovery tool can also alert you to rogue devices that are tapping into network resources, data leaks, and so forth. A LAN typically supports link speeds anywhere from 10 Mbit/s to 10 Gbit/s. A WAN typically supports link speeds anywhere from 128 Kbit/s to 1 Gbit/s. Prior art discovery tools either do not take into account bandwidth limitations, or set a global bandwidth limit for all networks.
0004Thus, there is a need in the art for an improved discovery tool.
SUMMARY OF THE INVENTION
0005One embodiment of the invention relates to a system for discovering devices in a network, comprising at least one subnetwork and a limiter for limiting an amount of bandwidth utilized for discovery process into each subnetwork.
0006Another embodiment of the invention relates to a method of discovering devices in a network, comprising determining a bandwidth limit for discovery processes and limiting an amount of bandwidth utilized for discovery process into each subnetwork in the network.
0007Another embodiment of the invention relates to a system for discovering devices in a network, comprising means for maintaining at least one subnetwork and means for limiting an amount of bandwidth utilized for discovery process into each subnetwork.
BRIEF DESCRIPTION OF THE DRAWINGS
0008<figref idref="DRAWINGS">FIG. 1</figref> is a diagram of one embodiment of the invention.
0009<figref idref="DRAWINGS">FIG. 2</figref> is an exemplary table of discovery traffic statistics.
0010<figref idref="DRAWINGS">FIG. 3</figref> is an exemplary table of network statistics.
0011<figref idref="DRAWINGS">FIG. 4</figref> is a graph detailing the relationship between bandwidth and processes.
0012<figref idref="DRAWINGS">FIG. 5</figref> is a schematic diagram of one embodiment of the invention.
0013<figref idref="DRAWINGS">FIG. 6</figref> is a flowchart depicting one embodiment of the invention.
0014<figref idref="DRAWINGS">FIG. 7</figref> is a diagram of one embodiment of the invention.
0015<figref idref="DRAWINGS">FIG. 8</figref> is a flowchart depicting one embodiment of the invention.
0016<figref idref="DRAWINGS">FIG. 9</figref> is a diagram of one embodiment of the invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
0017A network discovery tool, in one embodiment, generates additional network traffic while scanning devices on the network. <figref idref="DRAWINGS">FIG. 1</figref> details a typical corporate network that would utilize a network discovery tool. The network contains a Data Center LAN <b>100</b>, a Data Center WAN Router <b>110</b>, a WAN <b>120</b>, a Branch Office <b>1</b> WAN Router <b>130</b>, a Branch Office <b>2</b> WAN Router <b>140</b>, a LAN (for Branch Office <b>1</b>) <b>150</b> and a LAN (for Branch Office <b>2</b>) <b>160</b>. The Data Center LAN <b>100</b> contains a server (not pictured) that runs a discovery tool for the network. The discovery traffic into the Branch Offices <b>1</b> and <b>2</b> will go from the Data Center WAN Router <b>110</b> to the WAN <b>120</b> and through the Branch Office WAN Routers <b>130</b> and <b>140</b>. In one embodiment, the WAN <b>120</b> may support a link speed of 1 Mbit/s. In one embodiment, the Branch Office WAN routers <b>130</b> and <b>140</b> may support link speeds of 128 kbit/s.
0018In one embodiment, when a device has been discovered, the discovery process creates or updates a record for the device in a database with the actual discovery duration [seconds] and the network traffic volume [Bytes], which has been transferred to and from the device. In one embodiment, a packet capture library such as WinPcap may be utilized to obtain this information. In another embodiment, another device could be placed in the network that gathered statistics. For example, a sniffer tool could be placed between network segments or on a specific network segment, and could obtain statistics based upon IP address. Examples of statistics are detailed below, in conjunction with <figref idref="DRAWINGS">FIGS. 2 and 3</figref>. In this embodiment, a discovery server could then pull the statistics from this device. In another embodiment, the discovery server could obtain these statistics from routers in the network. In another embodiment, the NIC card of the server could be configured to capture and receive information based on every network segment. In this embodiment, a packet capture library could configure the adapter to be in a capture or pernicious mode by setting it to capture such packet information. The discovery server could then access the packet capture library to obtain a packet count for each and every address in the network, as well as a volume for each packet counted.
0019Other statistics could potentially be calculated based upon obtained information. In one embodiment, an average network transfer bandwidth is calculated by dividing the average network transfer volume by the average discovery duration. Other statistics could also be calculated from obtained values. The method by which this information is obtained, and the types of statistics calculated or obtained from the method, is not limiting on the invention.
0020<figref idref="DRAWINGS">FIG. 2</figref> depicts a table of exemplary traffic statistics. A Device Type <b>200</b> is displayed, as well as the minimum discovery traffic volume <b>210</b> for the device, the maximum discovery traffic volume <b>220</b> for the device, and the average discovery traffic volume <b>230</b> for the device. The statistics could be created, in one embodiment, by a tool such as HP asset. The table includes the volume of traffic it takes to discover systems on a network that include Windows 2000 XP client, Windows 2000, 2003 server, Windows NT client and server, UNIX, switches and routers. This embodiment is based upon the network described in <figref idref="DRAWINGS">FIG. 1</figref>. A server in the Data Center LAN <b>100</b> is running a discovery tool.
0021In the course of discovery of every device in the network, statistics are obtained that measure transfer volume and discovery time for every system. Exemplary volumes utilized by different types of operating systems are depicted in <figref idref="DRAWINGS">FIG. 2</figref>. Average traffic volume <b>230</b> is calculated, and then utilized to determine link bandwidth and how much bandwidth to set aside for discovery of devices.
0022In one embodiment, a windows XP computer is discovered to be located in Branch Office <b>2</b>. As shown in <figref idref="DRAWINGS">FIG. 2</figref>, the average traffic volume utilized to discover a Windows XP computer in Branch Office <b>2</b> is calculated to be 12,480 Kb, based upon the minimum <b>210</b> and maximum <b>220</b> values recorded. The average discovery time for discovering this Windows XP computer is recorded to be 3 minutes. Thus, the average network bandwidth utilization during a 3 minute timeframe is calculated to be: <br />12480 [Kbit]/3 [min]*60 [s/min]=69 [Kbit/s]
0023The discovery of this single Windows XP computer in Branch Office <b>2</b> will utilize the 128 Kbit/s link in the Branch Office <b>2</b> WAN Router with 69 Kbit/s for 3 minutes. If only one more device in Branch Office <b>2</b> would be discovered at the same time, the network connection from the Data Center into Branch Office <b>2</b> would be fully congested during this time. Thus, the invention in one embodiment provides throttling of the discovery mechanism that can be customized for each specific network. This throttling serves to ensure that the network links maintain a guaranteed bandwidth for discovery, with bandwidth available for other purposes.
0024<figref idref="DRAWINGS">FIG. 3</figref> depicts the network statistics described above for the entire network, detailing more statistics obtained during the discovery process. The Network Name <b>300</b> is displayed, as well as the network link speed <b>310</b>, the number of devices in the network <b>320</b>, the average discovery duration for the network <b>330</b>, and the average transfer volume for the network <b>340</b>. The invention utilizes these value to dynamically adjust the number of concurrent discovery processes into each network. The advantages of such adjustment include speeding up the overall discovery process and avoiding network congestion and user disturbance. The invention utilizes a maximum bandwidth for concurrent discovery processes for each network to dynamically adjust the number of concurrent discovery processes into each network.
0025<figref idref="DRAWINGS">FIG. 4</figref> is a diagram that shows a relationship between the number of concurrent discovery processes and the effective network transfer bandwidth. A discovery process represents an actual execution of discovering a device on the network. In many embodiments, a discovery thread and discovery process can be considered to have the same effect.
0026As shown in the diagram, the effective network transfer bandwidth increases with every new concurrent discovery process. However, the effective network bandwidth reaches a peak once the network link gets close to its congestion point <b>400</b> due to the running of many concurrent threads. In some embodiments, depending on the network technology, the effective network transfer bandwidth even drops with a further increased number of discovery threads. For example, in an Ethernet realm, the effective network transfer bandwidth would drop with a further increased number of discovery threads. <figref idref="DRAWINGS">FIG. 4</figref> also shows the maximum bandwidth for concurrent discovery processes <b>410</b>, the bandwidth utilization of the discovery tool <b>420</b>, and the bandwidth utilization of “users” of the network <b>430</b>.
0027As mentioned above, network related parameters, such as number of devices, average discovery duration and average transfer volume can be collected during the discovery process. However, determining a maximum transfer bandwidth into a network can be a much more difficult process. In one embodiment, if all routers, switches and other network equipment (including all interfaces) along the trace-route path (forward and backward) from the data center into all branch office networks would be known, a static link speed analysis could provide the maximum link speed for the all network paths into all branch offices. This embodiment takes a theoretical approach. Although it may yield the most accurate maximum transfer bandwidth results, in some embodiments, all of the information needed is not known.
0028In another embodiment, the maximum transfer bandwidth is manually set via a user interface. In one embodiment, this interface could be associated with a branch office or a corporate office. In another embodiment, the interface with be associated with a distinct link bandwidth. The association of the interface is not limiting on the invention. A network administrator, or other authorized person, could utilize the interface to provide settings information. In most embodiments, there is no general equation relating to the maximum transfer bandwidth. Rather, it is often network specific. The network saturation point often depends upon the network technology and its parameters. For example, the saturation point depends upon the protocols the network uses, whether the network is in a full-duplex or half-duplex mode, and the available link bandwidths, to name a few. In most embodiments, network administrators are familiar with the various network technologies, and utilize their knowledge to set the initial maximum transfer bandwidth for each network. In one embodiment, for an Ethernet realm, a network administrator could utilize the backoff time that a client can send packets after a collision to determine the saturation point of the network. In this embodiment, the saturation point drops because of the backoff.
0029As mentioned above, network administrators know rather well what networks (by address and subnet mask) are connected by LAN (high-speed) or WAN (low-speed) links as each network is usually associated with a country/location/site/building. Once the maximum transfer bandwidth into each network is known or well educated assumptions have been provided, the discovery tool can use these values to limit the number of discovery processes (threads) into each network at any time to avoid congestion of WAN links and user disturbance. In one embodiment, maximum transfer bandwidth could be utilized to limit the number of concurrent discovery processes into each network. In another embodiment, a percent ratio could specify how much of the maximum link speed a discovery tool is permitted to utilize at the maximum. For example, a percent ratio could be set at 50%. In another embodiment, both of these values, the maximum transfer bandwidth and the percent ratio, can be taken into account. In another embodiment, there may not be any such limit specific for a network. In this embodiment, the discovery tool does not need to limit the number of concurrent discovery processes into that network.
0030Calculating statistically meaningful average transfer volume and discovery duration for a particular network requires a reasonable number of devices in the network that is being discovered. If a network is discovered for the very first time, then there are no records of prior average transfer volume and discovery duration available. In this situation, in one embodiment, the number of concurrent discovery processes for that network will be set to 1. Once the network has been discovered, and an average transfer volume for the network is able to be calculated, the number of concurrent discovery processes can be adjusted according to the maximum transfer bandwidth into the network. In one embodiment, the number of concurrent discovery processes is only adjusted after a statistically meaningful average transfer volume for the network has been calculated. In another embodiment, the number of concurrent discovery processes can be adjusted according to the configured maximum transfer bandwidth into the network and also take into account a maximum utilization ratio (or percent ratio). This embodiment could potentially be utilized as a type of global policy for the discovery tool configuration. In one embodiment, a limiting number of concurrent discovery processes could be determined, for example, by a fixed percentage of devices (based on IP address) that have been discovered relative to the number of available IP addresses in the network. For example, in this embodiment, a reasonable number of concurrent threads could be determined after discovering a fixed percentage (5%) of the devices based upon available IP addresses.
0031<figref idref="DRAWINGS">FIG. 5</figref> depicts a relationship between IP addresses waiting for discovery in a network, and the discovery processes that are running or are queued to run, that actually execute the discovery of a single device in the network (per its IP address). <figref idref="DRAWINGS">FIG. 5</figref> includes a Ping Service <b>510</b>, an ARP service <b>520</b>, a Route Service <b>530</b> and a Manual Entry Service via a User Interface <b>540</b>. These services are utilized to discover devices in the network. The usage of these services for discovery purposes is known in the art. The types of services and method of discovery utilized are not limiting on the invention.
0032As shown in <figref idref="DRAWINGS">FIG. 5</figref>, these services are utilized in discovering devices. The discovery of devices is processed based upon their IP addresses. <figref idref="DRAWINGS">FIG. 5</figref> also shows a queue <b>550</b>, with a list of IP addresses, IP<b>1</b>, IP<b>2</b>, IPn, and so forth. Depending upon bandwidth limits, threads <b>560</b><i>a </i>to <b>560</b><i>n </i>are issued. Each thread discovers one device by passing the IP address along the chain of the configured discovery services.
0033<figref idref="DRAWINGS">FIG. 6</figref> shows an embodiment of the invention. Specifically, <figref idref="DRAWINGS">FIG. 6</figref> shows a method of discovering devices in the network. Whenever there is a thread available the discovery queue will forward an IP address from the queue to the thread. Based upon the maximum transfer bandwidth value, and also potentially the amount of devices to be discovered, a bandwidth limit for discovery is calculated in step <b>600</b>. By way of example, this calculation could comprise determining a specific percentage of the maximum transfer bandwidth value to set as the bandwidth limit for discovery. Based upon this bandwidth limit, the invention decides whether issuing a process thread to discover another device would utilize more bandwidth than the bandwidth limit in step <b>610</b>. If issuing the thread does not surpass the bandwidth limit (branch “Yes”), the process thread is executed in step <b>620</b>. In one embodiment, the process thread discovers one device by passing the IP address along the chain of the configured discovery services <b>640</b>. Statistics are obtained from the discovery process and stored in step <b>650</b>. In one embodiment, the discovery process thread runs the entire discovery process for the IP address, gets information regarding discovery and the state of the network, updates the network and traffic statistics, and stores the information in a database. These statistics can be utilized to update the bandwidth limit. If the bandwidth limit would be surpassed by executing the discovery process thread (branch “No”), the IP address is requeued in step <b>660</b>. In one embodiment, if the IP address (from the queue) points to a network that is already close to its configured maximum transfer bandwidth, the IP address is requeued for later processing. Control then returns to step <b>600</b> to continue discovering the network.
0034<figref idref="DRAWINGS">FIG. 7</figref> depicts another embodiment of the invention. Specifically, <figref idref="DRAWINGS">FIG. 7</figref> depicts a system for discovering devices in a network, including at least one subnetwork <b>710</b> and a limiter <b>720</b> for limiting the amount of bandwidth utilized for discovery process into each subnetwork <b>710</b>. A subnetwork could be considered to be any part of the network, including the network as a whole, or specific portions of the network. For example, with regards to <figref idref="DRAWINGS">FIG. 1</figref>, a subnetwork could be viewed as the whole network displayed, or as the network from the WAN to the Branch Office <b>1</b>, to name a few.
0035<figref idref="DRAWINGS">FIG. 8</figref> depicts another embodiment of the invention. Specifically, <figref idref="DRAWINGS">FIG. 8</figref> depicts method of discovering devices in a network, comprising the steps of determining a bandwidth limit for discovery processes <b>800</b> and limiting <b>810</b> the amount of bandwidth utilized for discovery process into each subnetwork in the network.
0036<figref idref="DRAWINGS">FIG. 9</figref> depicts another embodiment of the invention. Specifically, <figref idref="DRAWINGS">FIG. 9</figref> depicts a system for discovering devices in a network, including a component <b>910</b> for maintaining at least one subnetwork and a component <b>920</b> for limiting the amount of bandwidth utilized for discovery process into each subnetwork. These components could be any part of the discovery server, a sniffer device, or other implementations as described in detail above.
0037An exemplary system for implementing the overall system or method or portions of the invention might include a general purpose computing device in the form of a conventional computer, including a processing unit, a system memory, and a system bus that couples various system components including the system memory to the processing unit. The system memory may include read only memory (ROM) and random access memory (RAM). The computer may also include a magnetic hard disk drive for reading from and writing to a magnetic hard disk, a magnetic disk drive for reading from or writing to a removable magnetic disk, and an optical disk drive for reading from or writing to removable optical disk such as a CD-ROM or other optical media. The drives and their associated computer-readable media provide nonvolatile storage of computer-executable instructions, data structures, program modules and other data for the computer.
0038Software and web implementations of the present invention could be accomplished with standard programming techniques with rule based logic and other logic to accomplish the various database searching steps, correlation steps, comparison steps and decision steps. It should also be noted that the word “component” as used herein and in the claims is intended to encompass implementations using one or more lines of software code, and/or hardware implementations, and/or equipment for receiving manual inputs.
0039The foregoing description of embodiments of the invention has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the invention to the precise form disclosed, and modifications and variations are possible in light of the above teachings or may be acquired from practice of the invention. The embodiments were chosen and described in order to explain the principals of the invention and its practical application to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated.
Contents6
11 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| CN107835101A | Cited by | China | Search report |
| US2002075844A1 | Cites | United States of America | Search report |
| US2002110084A1 | Cites | United States of America | Search report |
| US2002112039A1 | Cites | United States of America | Search report |
| US2003088609A1 | Cites | United States of America | Search report |
| US2003103450A1 | Cites | United States of America | Search report |
| US2004221032A1 | Cites | United States of America | Search report |
| US2005083973A1 | Cites | United States of America | Search report |
| US2005086338A1 | Cites | United States of America | Search report |
| US2005086339A1 | Cites | United States of America | Search report |
| US2005108422A1 | Cites | United States of America | Search report |
| US2005111489A1 | Cites | United States of America | Search report |
| US2005243862A1 | Cites | United States of America | Search report |
| US2006168239A1 | Cites | United States of America | Search report |
| US2006233108A1 | Cites | United States of America | Search report |
| US2007091811A1 | Cites | United States of America | Search report |
| US2007263553A1 | Cites | United States of America | Search report |
| US2008310407A1 | Cites | United States of America | Search report |
| US6067545A | Cites | United States of America | Search report |
| US6262976B1 | Cites | United States of America | Search report |
| US6578077B1 | Cites | United States of America | Search report |
| US6628616B2 | Cites | United States of America | Search report |
| US7324447B1 | Cites | United States of America | Search report |
| US7457883B2 | Cites | United States of America | Search report |
| US7472185B2 | Cites | United States of America | Search report |
| US7554983B1 | Cites | United States of America | Search report |
| US7561520B2 | Cites | United States of America | Search report |
| US7656822B1 | Cites | United States of America | Search report |
| US7668958B2 | Cites | United States of America | Search report |
| US7680035B2 | Cites | United States of America | Search report |
| US7720980B1 | Cites | United States of America | Search report |
| US20020075844A1 | Cites | United States of America | Search report |
| US20020110084A1 | Cites | United States of America | Search report |
| US20020112039A1 | Cites | United States of America | Search report |
| US20030088609A1 | Cites | United States of America | Search report |
| US20030103450A1 | Cites | United States of America | Search report |
| US20040221032A1 | Cites | United States of America | Search report |
| US20050083973A1 | Cites | United States of America | Search report |
| US20050086338A1 | Cites | United States of America | Search report |
| US20050086339A1 | Cites | United States of America | Search report |
| US20050108422A1 | Cites | United States of America | Search report |
| US20050111489A1 | Cites | United States of America | Search report |
| US20050243862A1 | Cites | United States of America | Search report |
| US20060168239A1 | Cites | United States of America | Search report |
| US20060233108A1 | Cites | United States of America | Search report |
| US20070091811A1 | Cites | United States of America | Search report |
| US20070263553A1 | Cites | United States of America | Search report |
| US20080310407A1 | Cites | United States of America | Search report |
2 members in 1 office; this record represents the family
Priority claims1
| Document | Office | Kind | Date |
|---|---|---|---|
| 5992508 | United States of America | P |
Members2
| Document | Office | Kind | |
|---|---|---|---|
| US2010080145A1 | United States of America | A1 | |
| US8199671B2This record | United States of America | B2 |
59 transactions on the USPTO file
Allowed after 3 non-final rejections, 1 final rejection and 1 appeal.
- Non-final rejections
- 3
- Final rejections
- 1
- RCEs
- 0
- Appeals
- 1
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Expire PatentEXP. | EXP. | |
| Maintenance Fee Reminder MailedREM. | REM. | |
| Payment of Maintenance Fee, 8th Year, Large EntityM1552 | M1552 | |
| Correspondence Address ChangeC.ADB | C.ADB | |
| Post Issue Communication - Certificate of CorrectionN423 | N423 | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Email NotificationEML_NTR | EML_NTR | |
| Filing Receipt - CorrectedFLRCPT.C | FLRCPT.C | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Reasons for AllowanceEX.R | EX.R | |
| Miscellaneous Incoming LetterLET. | LET. | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Amendment/Argument after Notice of AppealAP/A | AP/A | |
| Notice of Appeal FiledN/AP | N/AP | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Email NotificationEML_NTR | EML_NTR | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| IFW TSS Processing by Tech Center CompleteTSSCOMP | TSSCOMP | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Email NotificationEML_NTR | EML_NTR | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Sent to Classification ContractorPGPC | PGPC | |
| Preliminary AmendmentA.PE | A.PE | |
| Cleared by OIPE CSRL194 | L194 | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX |
12 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| Lapsed due to failure to pay maintenance feeLapsedFP | FP | |
| Lapse for failure to pay maintenance feesLapsedPATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYLAPS | LAPS | |
| Information on status: patent discontinuationPATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362STCH | STCH | |
| Fee payment procedureMAINTENANCE FEE REMINDER MAILED (ORIGINAL EVENT CODE: REM.); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| Maintenance fee paymentMAFP | MAFP | |
| Fee paymentFPAY | FPAY | |
| AssignmentAS | AS | |
| Certificate of correctionCC | CC | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| AssignmentAS | AS | |
| Notice of allowance mailedORIGINAL CODE: MN/=.ZAAB | ZAAB | |
| Notice of allowance and fees dueORIGINAL CODE: NOAZAAA | ZAAA |
Numbers
- Publication
- 8199671
- Application
- 12241728
Titles
- English
- Throttling network traffic generated by a network discovery tool during a discovery scan
Patent term adjustment
- A delay
- +182 daysthe office missed an examination deadline
- B delay
- +86 dayspendency past three years
- Net adjustment
- 268 days
Classification
- CPC, 1
- H04L41/12
- IPC, 2
- H04L12 28
- H04L41 0896