Network device detection, identification, and management

Information

  • Patent Grant
  • 10594563
  • Patent Number
    10,594,563
  • Date Filed
    Tuesday, October 6, 2015
    9 years ago
  • Date Issued
    Tuesday, March 17, 2020
    4 years ago
Abstract
A method for identifying devices on a network using a two-step process of first scanning a range network addresses for devices and then acquiring device information from each of the accessible devices. The method involves scanning the network for devices by sending a request to each of a plurality of network addresses, receiving a response from one or more of the devices, obtaining a hardware address for at least some of the responding devices, and identifying the device based on the hardware address. A user interface is provided to display the results of the scan along with the more specific identifying information for some or all of the responding devices.
Description
TECHNICAL FIELD

This invention relates generally to computer networks and, more particularly, to techniques for discovering and configuring networked devices over a computer network.


BACKGROUND OF THE INVENTION

Networked based devices such as IP video cameras, servers and other devices utilize a unique identifier, such as a MAC address which comprises a hardware address permanently stored in the device's memory. This address is a hexadecimal number of 12 digits (IPv4) and possibly more or less digits in future revisions. In the current network environment, the highest order 6 bytes of the MAC address identify the manufacturer, and the low order 6 bytes uniquely distinguishes the device from others by that manufacturer. Some manufacturers may have more than one identifying prefix code, whereas others might own a range of sub-prefix numbers and not the entire prefix itself, in which case more than just the high order 6 bytes are needed to distinguish between manufacturers.


When a device is placed on a network and assigned a network address (e.g., an IP address), the device will respond or otherwise communicate according to one or more protocols enabled by the manufacturer; for example, by http, ftp, or udp request to the proper port. Moreover, manufacturers typically provide one or more methods by which their device can be discovered on the network, and there may be different methods used by different manufacturers or for different types of network devices. These methods include, but are not limited to:

    • 1. The device may broadcast an IP or UDP ‘signature’ that is monitored by an application loaded on a client computer. This application is provided by the manufacturer for use in accessing and possibly configuring the device. In some instances, this broadcast may occur for a limited period of time; e.g., for ten minutes following boot up after which it stops.
    • 2. The device may have an open port listening for command or data signatures from the manufacturer's application.
    • 3. The manufacturer's application may communicate with the device via http, ftp, Telnet or other protocol to discover the product type.
    • 4. The manufacturer's device may support UPnP (Universal Plug and Play)
    • 5. The device may utilize non standard/proprietary methods for communicating over the network wire, radio or other process.


This list represents a few methods to discover the product. Further complication exists where:

    • 1. The device is restricted by firewalls or other management software/firmware and or switching.
    • 2. The device has an unknown user or admin access login account.
    • 3. The device has an older firmware and does not understand the manufacturer's software functions and signatures/listening ports.
    • 4. The device has been configured to deny normal access.
    • 5. The device is malfunctioning, but still online.


      With all the possible permutations, it becomes quite apparent that a network containing multiple vendors' products could be difficult to manage, and this difficulty can be exacerbated in situations involving a large scale network of many devices.


When management is required for a particular device, the IP address is typically referenced to locate the specific device. Once this address is known, a web browser or other software can be used to access and manage the device. Management of such devices can become problematic, especially where the number of networked devices becomes large and/or the network contains a variety of different types of devices (e.g., computers, printers, IP cameras).


Definitions of Terms Used in this Application

“network address” means a unique network identifier used by a network communication protocol to access a device over a network; for example, an IP address.


“hardware address” means a unique device identifier associated with and stored on a device to distinguish that device from other devices; for example, a MAC address.


“computer readable memory” is any memory device capable of storing computer program code including magnetic media, solid-state memories, optical media (DVD, etc.).


SUMMARY OF THE INVENTION

In accordance with the invention there is provided a system, method, and computer readable memory programmed for identifying devices on a network. The identification of devices is carried out using the steps of scanning the network for devices by sending a request to each of a plurality of network addresses, receiving a response from one or more of the devices, obtaining a hardware address for at least some of the responding devices, and identifying the device based on the hardware address. In one embodiment, the method is used on a TCP/IP network to scan a range of IP addresses, obtain MAC addresses from devices located at addresses within the range, and then determine more specific identifying information for the devices. A user interface can be provided to display the results of the scan along with the more specific identifying information for some or all of the responding devices. In accordance with another aspect of the invention, this scanning and identification process can be used for network device management.





BRIEF DESCRIPTION OF THE DRAWINGS

Preferred exemplary embodiments of the invention will hereinafter be described in conjunction with the appended drawings, wherein like designations denote like elements, and wherein:



FIG. 1 is a flowchart of a method for identifying devices on a network in accordance with the invention;



FIGS. 2 and 3 depict an exemplary user interface display of the results of the process of FIG. 1;



FIG. 4 is a diagram depicting an example of the multi-threaded process and results of the network scan using that process;



FIG. 5 is a flowchart of the multi-threaded network scanning process used in the method of FIG. 1;



FIG. 6 is a flowchart of a process for identifying a device using http where the MAC address of the device was returned in during the network scan;



FIG. 7 is a flowchart of a process for identifying a device using http where the MAC address of the device was not returned in during the network scan;



FIG. 8 shows a more detailed example of how device information can be obtained using the process of FIG. 7;



FIG. 9 is a flowchart of a process for identifying a device using ftp;



FIG. 10 is a flowchart of a first process for identifying a device using udp;



FIG. 11 is a flowchart of a second process for identifying a device using udp; and



FIG. 12 depicts an alternative embodiment of the user interface shown in FIGS. 2 and 3.





DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Referring to FIG. 1, there is shown an overview of a network device scanner process that can be used to determine which addresses within a range of IP addresses have accessible devices assigned to the IP address and, further, can discover the particular type of device (including manufacturer, make, and model) at each accessible IP address. This process can be implemented in software (e.g., as an applet) stored on a computer-readable medium and executed by a computer connected to the particular network to be scanned. The illustrated embodiment utilizes an Ethernet network running TCP/IP with MAC addresses being used as the primary means to determine device manufacturer and type; however, it will be appreciated by those skilled in the art that the invention can be used in conjunction with other types of networks and communication protocols, and furthermore that device discovery can be carried out in many instances without the use of a MAC address or other unique device identifier. U.S. Pat. No. 6,891,566 B2, issued May 10, 2005, discloses an exemplary suitable Ethernet network running TCI/IP that includes pingable devices uniquely identifiable by MAC addresses, along with a client computer having a computer readable memory on which the software discussed herein can be stored. The entire contents of this U.S. Pat. No. 6,891,566 B2 are hereby incorporated by reference.



FIGS. 2 and 3 depict an exemplary user interface display for the software that carries out the device scanning process of FIG. 1. The user interface includes an upper region that displays the IP address of the host computer on which the program resides, as well as several user-fillable fields that provide the basic parameters used for network scanning and device access. In particular, there is provided a Ping Timeout field, an IP Address Base field, and an Http Port field. The Ping Timeout field allows the user to specify the amount of time (in milliseconds) that the program will wait to receive a response from a possible device located at an IP address before giving up and assuming that there is no pingable device at that address. The IP Address Base specifies the IP address range to be scanned, so that the user specifies the base address xxx.xxx.xxx and the program will scan from xxx.xxx.xxx.1 through xxx.xxx.xxx.255. The Http Port field allows the user to specify on what port the program will attempt an http request to a particular IP address specified by the user. The user interface also includes two lower side-by-side windows, one on the left to list the scanned IP addresses for which a response was received, and one on the right to provide details about the devices at the various accessible IP addresses in the event the user requests that the devices be discovered.


With reference back to FIG. 1, the overall process for network scanning and device discovery will now be described in conjunction with the screen displays shown in FIGS. 2 and 3. Upon startup of the program, the program detects the IP address of the computer executing the program and displays it in the top left of the user interface as shown. Also, this IP address is used to provide a default value in the IP Address Base field, which the user can then change to a different address range, if desired. The other fields also have default values, as shown. Once the desired IP Address Base is provided in the supplied field, the user clicks on the “Scan All” button, at which point the program scans all of the IP addresses within that base range. Preferably, this is done by pinging the IP addresses and thereafter displaying a list of IP addresses for which a response was received. At this point, the network has now been scanned for pingable devices located within the base IP address range.


Next, the device discovery process can be initiated by the user. This involves clicking on the “Discover” button which causes the program to go through the list of displayed IP addresses and attempt to retrieve further information that can be used to identify the device at each particular IP address. To accomplish this, the program attempts access to each device initially by sending an http request and, if a response is received, the returned information is parsed for a MAC address if not already known. If a MAC address has been obtained, it can be used to determine the manufacturer and this information can then be used to determine that particular manufacturer's scheme for supplying device information. This then enables the program to obtain the device information and the discovery process is then done for that IP address. If, instead, no MAC address was received, then the program initiates a series of manufacturer-specific access attempts using known URL and/or other request formats to obtain the MAC address and/or other specific device information. If the information cannot be obtained in this manner, then the discovery process essentially repeats, this time using another protocol such as ftp, which for some devices can be used to obtain a stored file containing the device information. This loop is repeated one or more times again, if necessary, each time using a different access protocol. If none of these processes result in the desired information being discovered, then the IP address is reported in the right pane along with an “Unknown” message such as is shown in FIG. 3 for IP address 111.111.111.1. If the device information is obtained, then it is provided as shown in FIG. 3 for IP address 111.111.111.51. In this case, the manufacturer, model number, and MAC address is displayed, although more or less information could be included. Also, if the “Detail” check button is selected, then the displayed results can include additional information, such as firmware version number or the administrator-assigned device name, if one exists.


The remaining figures and description provide additional detail and features concerning the disclosed embodiment. Turning now to FIG. 4, a multi-threaded process is used to effect the network scan of IP addresses. This involves initiating a separate thread for each IP address and then (nearly) simultaneously pinging all of the IP addresses within the range. By simultaneous it is meant that pinging of addresses is carried out in parallel and not sequentially so that, rather than sending out a ping to one IP address and then waiting for the response or a timeout before pinging the next address, the program instead initiates a thread for each IP address and sends out a separate ping on each thread. This provides a very quick way of scanning the network since the total time to obtain results for all IP addresses in the range is the timeout set in the Ping Timeout field.



FIG. 5 depicts the network scan process in greater detail. Initially, the program gets the host computer's IP address and displays it on the user interface, as discussed above. Then, it sets the IP search range, which for this embodiment is 0-255 and assigns a variable n equal to the total number of IP addresses in the range (e.g., 256). Next, a thread initiation routine is used to start a thread for each IP address. This involves setting up a loop X that will cycle n times, with each loop including the steps of: (1) creating the next IP address using the IP Address Base specified by the user (e.g., 111.111.111.X), (2) adding it to an array IP(X), (3) initiating a thread X, and (4) assigning the IP address to the thread. Once this is done, the threads are executed as shown in FIG. 5. This involves starting a new loop X=1 to n, beginning a fail timer for that thread, executing the thread, releasing control to allow other processing (e.g., by a DOevents( ) function), and then looping until all threads have been executed. The execution of each thread is shown in FIG. 5 wherein the thread is started, the IP address assigned to that thread is received (pulled from the array IP(X)), and the IP address is pinged. If a response is received, then a RaiseEvent statement is used to initiate the Response processing shown in FIG. 5. If no response is received and the timeout timer has not yet expired, then the process loops back and this continues until either a response is received or the timer expires. Once the timer expires, the thread is terminated and the failure can be logged or just ignored. Where a response is received, the timer is stopped, the thread terminated, and the result logged, which includes displaying the successful IP address in the left hand pane of the user interface. Again, this thread execution and result processing can be carried out concurrently for each of the IP addresses, thereby providing a fast way to scan a network for devices.


As shown in FIG. 2, the example scan returned 16 devices on the network for the selected range of IP addresses. There are actually 17, one of which is the host system running the software above, and is not reported in the list by design. This IP address could be listed in the left pane if the user desired it. To assist the user in discovering information concerning the device at each IP address and/or for web-based configuration of such devices, the program allows the user to double click on any of the IP addresses displayed in the left pane, and the program then launches a browser window (e.g., the computer's default browser such as Microsoft™ Internet Explorer™) and sends an http web page request to that IP address using the port number (e.g., 80) specified in the Http Port field. If the device is a web enabled IP camera, video server or other compatible web based device, a web page will launch in the systems default web browser at the port specified. If the device does not successfully return a page of information, the user could adjust the port number to any other valid port number and refresh the request from the browser or other application. Furthermore, a port loop can be included in the process to test for all ports for a given IP address from 0 to the limits of IPV4 ports (e.g., a search of 111.111.111.33:1 to 111.111.111.33:3200). While this port iteration is more intensive a search, increasing total search time, it is able to find devices more robustly. If desired, the program can be used to launch a different (non-browser) application that seeks to access the device at the IP address, and the program can allow user configuration of the application to be launched as well as of various parameters used by the chosen application. Other type of device queries could be made available in addition to or in lieu of the http request and this can be made available to the user either by clicking on the IP address or by some other user interface means.


Turning now to the remaining figures, further details of the device discovery process of FIG. 1 will now be described. In general, the approach involves scanning the known IP addresses displayed in the left pane, and querying them with multiple protocols and methods. Known signatures (typically based on manufacturer) in the memory and or firmware of the device are scanned and those that are found are reported. Reporting can include, but is not limited to:

    • 1) IP address
    • 2) MAC address
    • 3) Manufacturer Name
    • 4) Manufacturer Model
    • 5) Model Revision
    • 6) Firmware version
    • 7) Other required or desired information


      These items are collected and reported in the right pane as shown in FIG. 3, with more or less of the information being displayed based on whether or not the Detail checkbox has been marked. This information could also be placed into a file, database, or communicated to another process.


The fundamental approach used by the program for device discovery is to attempt accesses to the device using different protocols and, as necessary for each protocol, attempting accesses using the different known approaches for obtaining device information, many of which are manufacturer specific. The protocols are used in order of probability of success and, for this purpose, the first iterative loop uses an http request, as shown in FIGS. 6 and 7. The processes of these two figures are alternatives based on whether or not the device MAC address has already been obtained. As is known, the MAC address is often transmitted on typical IP networks at a low level with the IP packet information and, thus, the MAC address is often obtained as a result of the network scan ping. If so, then the process of FIG. 6 is used wherein a loop X=1 to n is begun, n being the number of displayed IP addresses in the left pane. First, the MAC address already received is obtained along with the associated IP address. The MAC prefix is used to do a lookup of the manufacturer and, based on this, a URL is built using the syntax and content used by that manufacturer to query the device for information. The URL is then sent as an http request. If not successful, the process loops back to try another URL or other request approach consistent with that manufacturer. Different request formats may be used by the manufacturer for different models, firmware versions, or types of devices. Preferably, these requests are ordered by likelihood of success to minimize the time required to successfully obtain the device information. For example, for a particular manufacturer they can be ordered by popularity of type of device or model number. Once a successful request is made, the information is returned as one or more pages of data which are then parsed for the desired information. Parsing of the received data can be done according to the known content and organization used by the particular manufacturer. Thereafter, the information is reported (displayed in the right pane of the user interface) and/or otherwise processed or stored. This process then repeats for the next IP address. Although not shown, if the iterative process of sending different requests to obtain the data is not successful to the point where the process exhausts its list of possible requests, then the program can break out of this loop and rely on attempts using another protocol to get the desired information.



FIG. 7 depicts the http request process where the MAC address has been stripped from the IP packet information or is otherwise not reported during the network ping scan. This process is similar to that of FIG. 6 except, that since no MAC address is known, the process includes an internal loop Y in which it loops through a comprehensive list of manufacturers and builds URLs based on the different manufacturers and their specific devices and models. Although this process could include a further nested loop as in FIG. 6 to attempt different requests for each manufacturer, instead, in the illustrated process, each of the different URL or other requests for a particular manufacturer are treated as different manufacturers (MFG(Y)).



FIG. 8 shows an example http request according to the process of FIG. 7 in which a URL specific to Axis™ network cameras is sent to the IP address 192.168.0.202. This may be one of hundreds of different URL commands sent as a result of the process of FIG. 7 attempting to obtain a response using different manufacturers' URL requests. In this case, the device responds with the data shown and the program then parses this data to locate the MAC address and possibly other desired information. The location of the MAC address and other information in the returned data can be determined using known information about the structure of the returned information based on product type or manufacturer, etc.


In the event that the http request approach is not successful, the process of FIG. 1 attempts access to the device at a particular IP address using the next protocol, in this case ftp as shown in FIG. 9. The process is similar to that of FIG. 7, except that the program must attempt to login to the ftp (which can be attempted anonymously or based on known manufacturer-specific default IDs and passwords). Where the login is successful for a particular device, the program then requests the appropriate file containing the device information and, again, this request can be specific to such things as the manufacturer, type of device, and/or model. Once the file is obtained, the relevant information is extracted and displayed in the right pane of the user interface.



FIGS. 10 and 11 provide further protocol examples which can be used in the event that both the http and ftp approaches fail. Since some devices utilize UDP differently, the program can try different UDP approaches; for example, the UDP broadcast of FIG. 10 wherein the device opens a listening port and then listens for the proper manufacturer-specific signature to be sent from the application program. Alternatively, in FIG. 11, a UDP application sniffer can be used in which the application program itself opens a listening port and listens for the device to transmit over that port per the manufacturer's specification. In either event, if the expected response (signature) is received, then the program extracts the desired data and displays it.



FIG. 12 depicts another embodiment of the user interface shown in FIGS. 2 and 3. This embodiment differs primarily in that it includes a configurable range control for the IP addresses scanned. In the example show, a start value of 20 and stop value of 225 has been included such that the scan will be limited to 111.111.111.20 through 111.111.111.225. It will be appreciated by those skilled in the art that the illustrated embodiments are directed to a typical TCP/IP environment in which addresses are limited to 0-255; however, the scanning process can be used to cover addresses beyond that range. Furthermore, the IP base address need not be limited to xxx.xxx.xxx, but any range of addresses can be scanned, e.g., by specifying only xxx.xxx or xxx.xx in the IP Address Base field. Also, the process can be designed to allow exclusions of regions for which scanning is not desired or may be problematic. Another difference of the FIG. 12 user interface embodiment from that of FIG. 3 is that the returned listing of devices can be sorted alphanumerically as shown in FIG. 12, rather than in order of their IP address.


The device discovery process has been described as being implemented using loops that sequentially attempt accesses based on such things as protocols (outer loop) and manufacturer and device type (inner loop). However, as an alternative implementation, it would be advantageous to test all permutations of device signatures simultaneously as is done for the initial network scan discussed above in connection with FIG. 4, since web based devices allow for multiple sessions of connections concurrently. This can include providing multiple simultaneous requests using different protocols and/or different request formats. For this approach, the device discovery process will immediately terminate other methods and processes attempting to do the same. Whichever approach is used (sequential or simultaneous requests), one approach for querying the devices in an optimized order is by the following methodology:

    • 1) Most popular Manufacturer
    • 2) Most popular methodology based on #1
    • 3) ‘Other’ methods allowed by the manufacturer or protocol used.
    • 4) Other utilities result sets yielding device and or network information


The manufacturer and device specific information can be hardcoded into the program or can be supplied as one or more separate script libraries. Each manufacturer can have its own script library specifying the particular URL, ftp, UDP, and other request syntax that is specific to that manufacturer, as well as the information needed to extract the desired data out of the response received from the device. Alternatively, the script libraries can be set up by device type so that the program can be used to detect only a specific type of device or even device model. The program would then only use the script library or libraries associated with the desired device type when doing the device discovery. Where the manufacturer or device type information is not organized into separate groups (scripts), then discovery of only certain types of devices can be carried out by discovering all devices and then filtering out for the desired type(s) only.


Apart from network scanning and device discovery, the program can further be used for network management. For example, the program can be used to create a database of devices and settings so that a network administrator can then more easily determine and manage such things as firmware versions. Also, the program can be configured to poll the devices periodically to confirm that they are present and, if desired, that they are working properly. This can be accomplished by performing an initial scan and discovery in which the devices and their configuration is obtained and stored. Thereafter, when the scan is run again, the reported information can be compared with the stored configuration information to determine if anything has changed. Where port scanning is used for one or more IP addresses, found devices discovered via particular ports can be stored with their port numbers making successive scans for these devices and ports more targeted so that, for example, only those ports previously used at an IP address can be subsequently scanned. For such things as network cameras, pinging of the camera might result in a response even if the camera is not functioning properly and able to stream images. Thus, the program can further be configured to request an image or stream to verify that the camera is operating properly. Other advantages of the device reporting provided by the program are:

    • 1) Firmware revisions can be easily reported, scanned for obsolescence and updated where necessary
    • 2) Inventories of devices can be updated in seconds
    • 3) Catastrophic failures can be identified in seconds.
    • 4) Rogue devices can be located, identified and managed.
    • 5) Other value added information can be extracted and or managed.


Device management using the processes described above can also include security monitoring where such devices are present on the network. The devices can be monitored in real time and some devices permit polling or monitoring for counts, triggers, and other events, or for unauthorized access or use.


Another optional feature that can be useful is, for example, to perform a reverse DNS lookup of the IP addresses for which a response is received and then log and/or display the associated domain name. Also, the program can include a library of icons representing the different types of devices and these icons can be included in the display of discovered devices to provide an improved user interface. This could also be used to enable the user to reorder the devices by type.


It is to be understood that the foregoing description is of one or more preferred exemplary embodiments of the invention. The invention is not limited to the particular embodiment(s) disclosed herein. Furthermore, the statements contained in the foregoing description relate to particular embodiments and are not to be construed as limitations on the scope of the invention or on the definition of terms, except where a term or phrase is expressly defined above. Various other embodiments and various changes and modifications to the disclosed embodiment(s) will become apparent to those skilled in the art. For example, although the network scan process described above uses pinging to detect devices, and thus will not detect devices that do not allow ping, if desired, these devices can still be detected by including additional steps that will be known to those skilled in the art. All such other embodiments, changes, and modifications are intended to come within the scope of the invention.


As used herein, the terms “for example,” “for instance,” and “such as,” and the verbs “comprising,” “having,” “including,” and their other verb forms, when used in conjunction with a listing of one or more components or other items, are each to be construed as open-ended, meaning that that the listing is not to be considered as excluding other, additional components or items. Other terms are to be construed using their broadest reasonable meaning unless they are used in a context that requires a different interpretation.

Claims
  • 1. A computer system for identifying one or more cameras on a network, comprising a computer having non-transitory memory for storing machine instructions that are to be executed by the computer, the machine instructions when executed by the computer implement the following functions: performing a network scan by scanning a plurality of network addresses to obtain an initial response from one or more camera devices, each camera device being accessible at a specific network address from the plurality of network addresses;beginning a fail timer for each of two or more connections to each of the network addresses of the one or more camera devices;establishing two or more connections to each of the network addresses of the one or more camera devices;simultaneously transmitting two or more camera device queries over the two or more connections to each of the specific network addresses of the one or more camera devices to attempt to obtain a query response to at least one of the two or more camera device queries, each of the camera device queries being sent according to a query protocol and a query format, the query protocol and/or query format differs for each of the camera device queries, and the query response including information relating to the camera device; andlooping the beginning, establishing and simultaneously transmitting steps until each fail timer expires or the query response to at least one of the two or more camera device queries is obtained.
  • 2. The system of claim 1, wherein the query protocol includes HTTP, FTP, or UDP.
  • 3. The system of claim 1, wherein the two or more camera device queries are sent according to two or more query protocols.
  • 4. The system of claim 3, wherein the two or more query protocols include at least one of HTTP, FTP, or UDP.
  • 5. The system of claim 1, wherein the two or more camera device queries are sent according to two or more query formats.
  • 6. The system of claim 5, wherein the two or more query formats include a first manufacturer-specific format and a second manufacturer-specific format.
  • 7. The system of claim 5, wherein the two or more query formats include a model-specific format, firmware-specific format, or a device-specific format.
  • 8. A method of identifying one or more cameras on a network, comprising: performing a network scan by scanning a plurality of network addresses to obtain an initial response from one or more camera devices, each camera device being accessible at a specific network address from the plurality of network addresses;beginning a fail timer for each of two or more connections to each of the network addresses of the one or more camera devices;establishing two or more connections to each of the network addresses of the one or more camera devices;simultaneously transmitting two or more camera device queries over the two or more connections to each of the specific network addresses of the one or more camera devices to attempt to obtain a query response to at least one of the two or more camera device queries, each of the camera device queries being sent according to a query protocol and a query format, the query protocol and/or query format differs for each of the camera device queries, and the query response including information relating to the camera device; andlooping the beginning, establishing and simultaneously transmitting steps until each fail timer expires or the query response to at least one of the two or more camera device queries is obtained.
  • 9. The method of claim 8, wherein the query protocol includes HTTP, FTP, or UDP.
  • 10. The method of claim 8, wherein the two or more camera device queries are sent according to two or more query protocols.
  • 11. The method of claim 10, wherein the two or more query protocols include at least one of HTTP, FTP, or UDP.
  • 12. The method of claim 8, wherein the two or more camera device queries are sent according to two or more query formats.
  • 13. The method of claim 12, wherein the two or more query formats include a first manufacturer-specific format and a second manufacturer-specific format.
  • 14. The method of claim 12, wherein the two or more query formats include a model-specific format, firmware-specific format, or a device-specific format.
  • 15. A computer system for identifying one or more cameras on a network, comprising a computer having non-transitory memory for storing machine instructions that are to be executed by the computer, the machine instructions when executed by the computer implement the following functions: performing a network scan by scanning a plurality of network addresses to obtain an initial response from one or more camera devices, each camera device being accessible at a specific network address from the plurality of network addresses;beginning a fail timer for each of two or more connections to each of the network addresses of the one or more camera devices;establishing two or more connections to each of the network addresses of the one or more camera devices; andsimultaneously transmitting two or more camera device queries over the two or more connections to each of the specific network addresses of the one or more camera devices to attempt to obtain a query response to at least one of the two or more camera device queries, each of the camera device queries being sent according to a query protocol and a query format, the query format differs for each of the two or more camera device queries, and the query response including information relating to the camera device, the two or more device queries include a device query sent according to a UDP protocol; andlooping the beginning, establishing and simultaneously transmitting steps until each fail timer expires or the query response to at least one of the two or more camera device queries is obtained.
  • 16. The computer system of claim 1, wherein the machine instructions when executed by the computer implement the following further function: assigning each of the plurality of network addresses to one of the threads of the plurality of threads.
  • 17. The computer system of claim 1, wherein the machine instructions when executed by the computer implement the following further function: adding each of the plurality of network addresses to an array IP(X).
  • 18. The computer system of claim 1, wherein the establishing and simultaneously transmitting functions are only performed in connection with the accessible specific network address for each camera device.
  • 19. The method of claim 8, further comprising assigning each of the plurality of network addresses to one of the threads of the plurality of threads.
  • 20. The computer system of claim 15, wherein the machine instructions when executed by the computer implement the following further function: assigning each of the plurality of network addresses to one of the threads of the plurality of threads.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. Ser. No. 11/697,045 filed Apr. 5, 2007, now U.S. Pat. No. 9,166,883, issued Oct. 20, 2015, which claims the benefit of U.S. Provisional Application No. 60,744,307, filed Apr. 5, 2006, the disclosures of which are hereby incorporated in their entirety by reference herein.

US Referenced Citations (239)
Number Name Date Kind
4513318 Wilensky et al. Apr 1985 A
4575124 Morrison Mar 1986 A
4628342 Desmons et al. Dec 1986 A
4814869 Oliver, Jr. Mar 1989 A
4989085 Elberbaum Jan 1991 A
4991193 Cecil et al. Feb 1991 A
5155585 Ishikawa Oct 1992 A
5311306 Tanaka et al. May 1994 A
5313280 Straus May 1994 A
5355453 Row et al. Oct 1994 A
5390326 Shah Feb 1995 A
5489896 Sofer et al. Feb 1996 A
5491511 Odle Feb 1996 A
5499180 Ammirato et al. Mar 1996 A
5504746 Meier Apr 1996 A
5512974 Abe et al. Apr 1996 A
5539908 Chen et al. Jul 1996 A
5561476 Kershaw et al. Oct 1996 A
5625410 Washino et al. Apr 1997 A
5627886 Bowman May 1997 A
5649185 Antognini et al. Jul 1997 A
5663951 Danneels et al. Sep 1997 A
5666152 Stoker Sep 1997 A
5671412 Christiano Sep 1997 A
5724475 Kirsten Mar 1998 A
5742757 Hamadani et al. Apr 1998 A
5745161 Ito Apr 1998 A
5754111 Garcia May 1998 A
5754763 Bereiter May 1998 A
5757924 Friedman et al. May 1998 A
5761655 Hoffman Jun 1998 A
5786872 Miyazaki et al. Jul 1998 A
5790548 Sistanizadeh et al. Aug 1998 A
5790664 Coley et al. Aug 1998 A
5802366 Row et al. Sep 1998 A
5805801 Holloway et al. Sep 1998 A
5822542 Smith et al. Oct 1998 A
5825432 Yonezawa Oct 1998 A
5861924 Pan et al. Jan 1999 A
5903762 Sakamoto et al. May 1999 A
5905859 Holloway et al. May 1999 A
5941954 Kalajan Aug 1999 A
5976083 Richardson et al. Nov 1999 A
5999979 Vellanki Dec 1999 A
6002428 Matsumura et al. Dec 1999 A
6002995 Suzuki et al. Dec 1999 A
6014183 Hoang Jan 2000 A
6031573 MacCormack et al. Feb 2000 A
6058420 Davies May 2000 A
6069655 Seeley et al. May 2000 A
6081845 Kanemaki Jun 2000 A
6091771 Seeley et al. Jul 2000 A
6092078 Adolfsson Jul 2000 A
6097429 Seeley et al. Aug 2000 A
6101182 Sistanizadeh et al. Aug 2000 A
6115035 Compton et al. Sep 2000 A
6122005 Sasaki et al. Sep 2000 A
6125108 Shaffer et al. Sep 2000 A
6135951 Richardson et al. Oct 2000 A
6160544 Hayashi et al. Dec 2000 A
6166729 Acosta et al. Dec 2000 A
6167446 Lister et al. Dec 2000 A
6175622 Chiniwala et al. Jan 2001 B1
6178419 Legh-Smith et al. Jan 2001 B1
6182116 Namma et al. Jan 2001 B1
6195458 Warnick et al. Feb 2001 B1
6204843 Freeman et al. Mar 2001 B1
6226031 Barraclough et al. May 2001 B1
6233428 Fryer May 2001 B1
6236395 Sezan et al. May 2001 B1
6241609 Rutgers Jun 2001 B1
6243468 Pearce et al. Jun 2001 B1
6266082 Yonezawa et al. Jul 2001 B1
6269309 Buckingham Jul 2001 B1
6271752 Vaios Aug 2001 B1
6272127 Golden et al. Aug 2001 B1
6292838 Nelson Sep 2001 B1
6323897 Kogane et al. Nov 2001 B1
6330027 Haba Dec 2001 B1
6353848 Morris Mar 2002 B1
6357042 Srinivasan et al. Mar 2002 B2
6396533 Hudson May 2002 B1
6400265 Saylor et al. Jun 2002 B1
6405318 Rowland Jun 2002 B1
6438530 Heiden et al. Aug 2002 B1
6438587 Kitamura Aug 2002 B2
6449426 Suga et al. Sep 2002 B1
6452925 Sistanizadeh et al. Sep 2002 B1
6473423 Tebeka et al. Oct 2002 B1
6476858 Diaz et al. Nov 2002 B1
6477648 Schell et al. Nov 2002 B1
6484219 Dunn et al. Nov 2002 B1
6493041 Hanko et al. Dec 2002 B1
6499054 Hesselink et al. Dec 2002 B1
6502079 Ball et al. Dec 2002 B1
6516340 Boys Feb 2003 B2
6522325 Sorokin et al. Feb 2003 B1
6529522 Ito et al. Mar 2003 B1
6539124 Sethuraman et al. Mar 2003 B2
6556241 Yoshimura et al. Apr 2003 B1
6564380 Murphy May 2003 B1
6567122 Anderson et al. May 2003 B1
6574612 Baratti et al. Jun 2003 B1
6583813 Enright et al. Jun 2003 B1
6591022 Dewald Jul 2003 B2
6591279 Emens et al. Jul 2003 B1
6608650 Torres et al. Aug 2003 B1
6618074 Seeley et al. Sep 2003 B1
6628325 Steinberg et al. Sep 2003 B1
6661340 Saylor et al. Dec 2003 B1
6698021 Amini et al. Feb 2004 B1
6726094 Rantze et al. Apr 2004 B1
6727940 Oka et al. Apr 2004 B1
6741977 Nagaya et al. May 2004 B1
6747692 Patel et al. Jun 2004 B2
6748318 Jones Jun 2004 B1
6760324 Scott et al. Jul 2004 B1
6763023 Gleeson et al. Jul 2004 B1
6775273 Kung et al. Aug 2004 B1
6784925 Tomat et al. Aug 2004 B1
6803945 Needham Oct 2004 B1
6804606 Jones Oct 2004 B2
6806975 Fujita et al. Oct 2004 B1
6813394 Matsumoto et al. Nov 2004 B1
6856346 Kobayashi et al. Feb 2005 B1
6856967 Woolston et al. Feb 2005 B1
6891566 Marchese May 2005 B2
6895511 Borsato et al. May 2005 B1
6904359 Jones Jun 2005 B2
6928656 Addington Aug 2005 B1
6954859 Simerly et al. Oct 2005 B1
6973200 Anaka et al. Dec 2005 B1
6978303 McCreesh et al. Dec 2005 B1
6985178 Morita et al. Jan 2006 B1
7015806 Naidoo et al. Mar 2006 B2
7020881 Takahashi et al. Mar 2006 B2
7035914 Payne et al. Apr 2006 B1
7039688 Matsuda et al. May 2006 B2
7047298 Davies May 2006 B2
7116357 Oya et al. Oct 2006 B1
7136838 Peinado et al. Nov 2006 B1
7185240 Saito et al. Feb 2007 B2
7197144 Casagrande Mar 2007 B1
7289995 Motoyama et al. Oct 2007 B2
7389914 Enright et al. Jun 2008 B1
7392310 Motoyama et al. Jun 2008 B2
7451312 Medvinsky et al. Nov 2008 B2
7478152 Motoyama et al. Jan 2009 B2
7500003 Motoyama et al. Mar 2009 B2
7523481 Creamer et al. Apr 2009 B2
7533805 Enright et al. May 2009 B1
7533806 Enright May 2009 B1
7545816 Coutts et al. Jun 2009 B1
7551612 Kobayashi et al. Jun 2009 B2
7577273 Rhoads et al. Aug 2009 B2
7595816 Enright et al. Sep 2009 B1
7596749 Motoyama Sep 2009 B2
7610380 Igarashi et al. Oct 2009 B2
7630986 Herz et al. Dec 2009 B1
7755668 Johnston et al. Jul 2010 B1
7859571 Brown et al. Dec 2010 B1
7900823 Knouff et al. Mar 2011 B1
7949722 Ullman et al. May 2011 B1
7950573 Enright et al. May 2011 B1
7952609 Simerly et al. May 2011 B2
7966632 Pan et al. Jun 2011 B1
8185964 Marchese May 2012 B2
8578439 Mathias et al. Nov 2013 B1
9374405 Marchese Jun 2016 B2
20010008014 Farrell et al. Jul 2001 A1
20010010523 Sezan et al. Aug 2001 A1
20010010545 Sasaki Aug 2001 A1
20010011253 Coley et al. Aug 2001 A1
20010012286 Huna et al. Aug 2001 A1
20010013123 Freeman et al. Aug 2001 A1
20010020299 Barraclough et al. Sep 2001 A1
20010023436 Srinivasan et al. Sep 2001 A1
20010024233 Urisaka et al. Sep 2001 A1
20010032335 Jones Oct 2001 A1
20010033332 Kato et al. Oct 2001 A1
20010033335 Kubota et al. Oct 2001 A1
20010049275 Pierry et al. Dec 2001 A1
20020003575 Marchese Jan 2002 A1
20020059407 Davies May 2002 A1
20020109863 Monroe Aug 2002 A1
20020147982 Naidoo et al. Oct 2002 A1
20030014759 Van Stam Jan 2003 A1
20030050718 Tracy et al. Mar 2003 A1
20030065754 Jones et al. Apr 2003 A1
20030085998 Ramirez-Diaz et al. May 2003 A1
20030093580 Thomas et al. May 2003 A1
20030184784 Ferlitsch Oct 2003 A1
20030195697 Jones Oct 2003 A1
20030195698 Jones Oct 2003 A1
20030197785 White et al. Oct 2003 A1
20030202408 Chobotaro et al. Oct 2003 A1
20030233188 Jones Dec 2003 A1
20030233190 Jones Dec 2003 A1
20040001214 Monroe Jan 2004 A1
20040030926 Clark Feb 2004 A1
20040051785 Yokonuma et al. Mar 2004 A1
20040078825 Murphy Apr 2004 A1
20040128315 Motoyama et al. Jul 2004 A1
20040128365 Motoyama et al. Jul 2004 A1
20040199619 Jai Oct 2004 A1
20040209617 Hrastar Oct 2004 A1
20040214559 Date et al. Oct 2004 A1
20040240453 Ikeda et al. Dec 2004 A1
20050018766 Iwamura Jan 2005 A1
20050031226 Sugimoto et al. Feb 2005 A1
20050055727 Creamer et al. Mar 2005 A1
20050132414 Bentley et al. Jun 2005 A1
20050165927 Motoyama et al. Jul 2005 A1
20050185823 Brown et al. Aug 2005 A1
20050200714 Marchese Sep 2005 A1
20050201273 Shimizu Sep 2005 A1
20050212912 Huster Sep 2005 A1
20050231596 Marchese Oct 2005 A1
20050268141 Alben et al. Dec 2005 A1
20060053459 Simerly et al. Mar 2006 A1
20060059255 Motoyama et al. Mar 2006 A1
20060061654 McKay et al. Mar 2006 A1
20060067304 McDowall et al. Mar 2006 A1
20060085831 Jones, III et al. Apr 2006 A1
20060106729 Roberts, Jr. May 2006 A1
20060159032 Ukrainetz et al. Jul 2006 A1
20060279774 Matsuoka et al. Dec 2006 A1
20070011450 McCreight Jan 2007 A1
20070124455 Motoyama et al. May 2007 A1
20070237141 Marchese Oct 2007 A1
20070279774 Huang Dec 2007 A1
20080106597 Amini et al. May 2008 A1
20080189405 Zarenin et al. Aug 2008 A1
20080303903 Bentley et al. Dec 2008 A1
20090019141 Bush Jan 2009 A1
20090216564 Rosenfeld Aug 2009 A1
20100212024 Marchese Aug 2010 A1
20110010307 Bates et al. Jan 2011 A1
20110173308 Gutekunst Jul 2011 A1
Foreign Referenced Citations (8)
Number Date Country
0871326 Oct 1998 EP
0967584 Dec 1999 EP
2329541 Mar 1999 GB
2004178565 Jun 2004 JP
9819450 May 1998 WO
9834360 Aug 1998 WO
9847117 Oct 1998 WO
0169405 Sep 2001 WO
Non-Patent Literature Citations (73)
Entry
Beausoft Main Page Achive (Feb. 29, 2000) Availible at http://web.archive.org/web/20000229205711/http://beausoft.com/ Downloaded Sep. 2, 2003, 2 pages.
Beausoft Webcam Watcher Descripiton Page (Feb. 29, 2000) Availible at http://web.archive.org/web/20000620224026/www.webcam-watcher.com/wcwindex.html Downloaded Sep. 2, 2003, 4 pages.
Tar(1) Man Page for Solaris 2.4 Availible at htpp://docs.sun.com/db/doc/801-6680-01/6i11qc0ml?a=view Downloaded Sep. 2, 2003, 8 pages.
Appendix D-1 Invalidity Claim Chart over Nomura and Secondary References U.S. Pat. No. 6,891,566, Jul. 18, 2013, 23 Pages.
Appendix A-1 Invalidity Claim Chart over Milestone's Prior Art Software, U.S. Pat. No. 8,185,964, AM22149760, Jul. 18, 2013, 2 Pages.
A Brief History of the Cygwin Project Availible at http://cygwin.com/history.html Downloaded Jun. 14, 2004, 18 pages.
JPEG Standard ISO/IEC IS 10918-1 / ITU-T Recommendation T .81 Sep. 1992, 186 pgs.
Bisdikian et al. “On the effectiveness of priorities in token ring for multimedia traffic,” In Proc. 18th Annu. Conf Local Computer Networks, Minneapolis, MN, Sep. 1993, 7 pages.
International Search Report for PCT/US01/08133, dated Jul. 26, 2001, 3 Pages.
Supplemental European International Search Report for EP 01 91 6650, dated Feb. 4, 2009, 1 Page.
Marshall K. McKusick, et al. “A Fast File System for UNIX,” ACM Transactions on Computer Systems, vol. 2, No. 3, Aug. 3, 1984, 17 pgs.
AR(4) Man Page, Retrieved Sep. 2, 2003 From http://docs.sun.com/db/doc/801-6680-01/6i11qc0ml?a=view, 4 pages.
AR(1) Man Page retrieved Sep. 2, 2003 from http://docs.sun/db/doc/801-6680-01/6i11qc0ml?=view, 3 Pages.
R. Fielding, et al. “Request for Comments (RFC) 2068”, Hypertext Transfer Protocol—HTTP/1.1, Jan. 1997, 162 Pages.
Webcam watcher Online Help, Webcam Watcher Version 3.0, Copyright 2001 Beau Software, Date Unknown, 6 Pages.
Appendix E-1 Invalidity Claim Chart over Matsumoto U.S. Pat. No. 6,891,566, Jul. 18, 2013, 8 Pages.
AXIS 200+ and 240 Camera Sever User's Guide, Revision 1.0 Dated Jan. 1999, 39 Pages.
AXIS 240 Network Camera Server Users Manual, Revision 1.4, Dated Nov. 1998, 129 Pages.
Appendix A-3 Supplemental Invalidity Claim Chart (Supplement to A-1) over Milestone Surveillance Pro Software U.S. Pat. No. 8,185,964, Aug. 5, 2013, 15 Pages.
Appendix A-4 Supplemental Invalidity Claim Chart (Supplement to A-2) over Milestone Surveillance Pro Software U.S. Pat. No. 6,891,566, Aug. 5, 2013, 35 Pages.
Appendix A-6 Invalidity Claim Chart over Suzuki in view of Peinado U.S. Pat. No. 6,891,566, Aug. 5, 2013, 53 Pages.
Appendix A-2 Invalidity Claim Chart over Milestone's Prior Art Software and Secondary References U.S. Pat. No. 6,891,566, Jul. 18, 2013, 15 Pages.
Appendix C-1 Invalidity Claim Chart over Suzuki in view of Simerly U.S. Pat. No. 6,891,566, Jul. 18, 2013, 10 Pages.
Appendix B-2 Supplemental Invalidity Claim Chart (Supplement to B-1) over Suzuki and Kogane U.S. Pat. No. 8,185,964, Aug. 5, 2013, 14 Pages.
Appendix B-3 Invalidity Claim Chart over Morita in view of Kogane U.S. Pat. No. 6,891,566, Aug. 5, 2013, 11 Pages.
Appendix C-2 Supplemental Invalidity Claim Chart (Supplement to C-1) over Suzuki in view of Simerly, U.S. Pat. No. 6,891,566, Aug. 5, 2013, 10 Pages.
Appendix C-3 Invalidity Claim Chart over Morita in view of Simerly U.S. Pat. No. 6,891,566, Aug. 5, 2013, 7 Pages.
Appendix D-2 Supplemental Invalidity Claim Chart (Supplement to D-1) over Normura and Secondary References, Aug. 5, 2013, 23 Pages.
Case No. 12-cv-12276-NGE-MJH, Eastern Disctrict of Michigan, “Defendant Milestone Systems, Inc's Second Supplemental Answers and Objections to First set of Interrogatories No. 2 and Supplemetnal Answers and Objections to Nos. 6 Through 10”, Aug. 2, 2013, 83 Pages.
Case No. 12-cv-12276-NGE-MJH, Eastern District of Michigan, “Defendant Milestone Systems A/S's Answers and Objections to First Set of Interrogatories Nos. 3 Through 10, and Supplemental Answer to No. 2”, Aug. 2, 2013, 83 Pages.
Case No. 12-cv-12276-NGE-MJH, Eastern District of Michigan, “Defendant Milestone Systems, Inc's Supplemental Answers and Objections to first set of interrogatories Nos. 1, 2 and 11”, Jul. 17, 2013, 41 Pages.
Case No. 12-cv-12276-NGE-MJH, Eastern District of Michigan, “Defendant Milestone Systems A/S's Answers and Objections to First Set of Interrogatories Nos. 1 and 2”, Jul. 17, 2013, 35 Pages.
Appendix B-1 Invalidity Claim Chart over Suzuki and Kogane U.S. Pat. No. 8,185,964, Jul. 18, 2013, 14 Pages.
Walpole, J. et al., “A Player for Adaptive MPEG Video Streaming Over the Internet,” Proc. SPIE 3240, 26th AIPR Workshop: Exploiting New Image Sources and Sensors, 270 (Mar. 1, 1998); doi:10.1117/12.300064; http://dx.doi.org/10.1117/12.300064, c. 1997 Society of Photo-Optical Instrumentation Engineers.
Affidavit of Christopher Butler and Exhibit dated Dec. 16, 2016, Avigilon Exhibit 1007, pp. 1-79.
ANSI/IEEE Std. 802.3 “Carrier Sense Multiple Access with Collision Detection (CSMA/CD) Access Method and Physical Layer Specifications”, 1985, 147 pgs.
AXIS 2100 Network Camera User's Guide, Nov. 1999, 56 pgs.
AXIS 2400 and AXIS 2401 Video Servers Administration Manual, Jul. 1999, 81 pgs.
Request for Comments (RFC) 2068 Hypertext Transfer Protocol—HTTP/1.1 Fielding et al. Jan. 1997, 162 pages.
A Fast Fly System for UNIX ACM Transactions on Computer Systems, vol. 2, No. 3, August 198, pp. 181-187. McKusick e tal.
Webcam Watcher V1.2 Computer Software Surveyor Corporation, Nov. 1999. 2 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 22 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-1, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 69 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-2, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 29 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-3, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 9 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-5, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 29 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-6, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 71 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-7, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 30 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-8, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 13 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-9, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 28 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-10, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 22 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-11, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 106 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-12, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 41 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-13, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 78 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-14, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 17 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-15, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 64 pages.
Case No. 2:15-cv-10385-AC-EAS, Eastern District of Michigan, Exhibit B-16, “Defendants Avigilon Corporation and Avigilon USA Corporation's Notice of Filing Infringement and Invalidity Contentions”, Sep. 27, 2018, 25 pages.
Alan Alper, “The Changing Face of Software Licensing”, Computerworld, May 1, 1994, 4 pages.
Aura et al., “Software license management with smart cards”, Usenix, May 10, 1999, Chicago, 12 pages.
BryerJoyner et al., “Secure local area network services for a high assurance multilevel network”, Calhoun: The NPS Institutional Archive DSpace Repository, Mar. 1999, California, 237 pages.
Marc Halpem, “Scalable unigraphics solutions”, Computer-aided Engineering, Oct. 1997, 2 pages.
“Rational Bolsters Rational ClearDDTS”, PR Newswire, Apr. 1, 1999, California, 2 pages.
Jim Duffy, “OpenView module faulted”, Network World, Inc., Mar. 24, 1997, 2 pages.
Mike Wilson, “NT and Unix in a heterogeneous environment”, Design Systems, Electronic Engineering, Feb. 2000, 2 pages.
Michele Dostert, “Novell, Gradient ease license management”, Computerworld, Mar. 1, 1993, Massachusetts, 2 pages.
“Peripherals”, New Products; Microcomputing; desktop computing; p. 48, Computerworld, Jun. 8, 1992, California, 3 pages.
J.C. Spohrer, “Information in places”, IBM Systems Journal, vol. 38, No. 4, May 20, 1999, California, 27 pages.
“Getting all fired up”, Network News, Nov. 18, 1998, 6 pages.
“Flexim End Users Manual, Version 7.0”, GLOBEtrotter Software, Inc, Apr. 2000, California, 125 pages.
Richard Goering, “Design-flow manager added to FPGA suite”, Copyright CMP Media Inc., Nov. 4, 1996, 2 pages.
“Ansoft Announces Delivery of Serenade 7.5; Power and Intuition Merge in PC Simulation Environment”, PR Newswire, Jun. 8, 1998, 3 pages.
Tygar et al., “Dyad: A System for Using Physically Secure Coprocessors”, School of Computer Science, May 4, 1991, Pennsylvania, 38 pages.
Hauser et al., “LTTP Protection—A Pragmatic Approach to Licensing”, IHIP International Federation for Information Processing, Jan. 13, 1994, Switzerland, 15 pages.
Related Publications (1)
Number Date Country
20160028590 A1 Jan 2016 US
Provisional Applications (1)
Number Date Country
60744307 Apr 2006 US
Continuations (1)
Number Date Country
Parent 11697045 Apr 2007 US
Child 14876181 US