Abstract:
A system for gathering data for purposes of analyzing a network. The data is gathered based on values that are passed from node-to-node within processing devices, such as servers, in a network. The values are generated from characteristics obtained from measuring device performance and resource utilization. Values are passed peer-to-peer and successively combined with values at each receiving system so that, ultimately, a value is obtained that reflects the operation of a group of devices. A correlation matrix is maintained to indicate discrepancies in value meanings from different devices. The correlation matrix is used to more accurately combine values to achieve meaningful composite values.

Description:
CLAIM OF PRIORITY  
       [0001]    This application claims priority from U.S. Provisional Patent Application No. 60/243,783, filed Oct. 26, 2000.  
       CROSS-REFERENCES TO RELATED APPLICATIONS  
       [0002]    This application is related to the following co-pending applications, each of which is incorporated by reference as if set forth in full in this application:  
         [0003]    U.S. patent application entitled “System-Wide Optimization Integration Model” (020897-000110U.S.) filed on Oct. 12, 2001, Ser. No. [TBD]; U.S. patent application entitled “Multi-Platform Optimization Model” (020897-000120U.S.) filed on Oct. 12, 2001, Ser. No. [TBD]; U.S. patent application entitled “Application Program Interface for Optimization Integration Model” (020897-000140U.S.) filed on Oct. 26, 2001, Ser. No. [TBD]. 
     
    
     
       BACKGROUND OF THE INVENTION  
         [0004]    Digital computer networks, such as the Internet, are now used extensively in many aspects of commerce, education, research and entertainment. Because of the need to handle high volumes of traffic, many Internet sites are designed using several groups of server computers. An example of a site network system is shown in FIG. 1A.  
           [0005]    In FIG. 1A, network system  10  includes four major tiers. These are communications tier  12 , web tier  14 , application tier  16  and database tier  18 . Each tier represents an interface between a group of server computers or other processing, storage or communication systems. Each interface handles communication between two groups of server computers. Note that the tiers are significant in that they represent the communication protocols, routing, traffic control and other features relating to transfer of information between the groups of server computers. As is known in the art, software and hardware is used to perform the communication function represented by each tier.  
           [0006]    Server computers are illustrated by boxes such as  20 . Database  22  and Internet  24  are represented symbolically and can contain any number of servers, processing systems or other devices. A server in a group typically communicates with one or more computers in adjacent groups as defined and controlled by the tier between the groups. For example, a request for information (e.g., records from a database) is received from the Internet and is directed to server computer  26  in the Web-Com Servers group. The communication takes place in communications tier  12 .  
           [0007]    Server computer  26  may require processing by multiple computers in the Application Servers group such as computers  20 ,  28  and  30 . Such a request for processing is transferred over web tier  14 . Next, the requested computers in the Application Servers group may invoke computers  32 ,  34 ,  36  and  38  in the Database Servers group via application tier  16 . Finally, the invoked computers make requests of database  22  via database tier  18 . The returned records are propagated back through the tiers and servers to Internet  24  to fulfill the request for information.  
           [0008]    Of particular concern in today&#39;s large and complex network systems is monitoring the performance of, and optimizing, the system. One way that prior art approaches monitor system performance is to use a process at certain points in the network to report data back to a central location such as console  40 . In FIG. 1A, the request for database records can be monitored by having a process at server  26  log the time and nature of the request. A process at server  20  then logs the time at which a request from server  26  is received. Similarly, server  32  (or whichever server receives the database request from server  20 ) logs its participation in the transaction. This “chain” of logged transactions is illustrated by bold arrows in FIG. 1A.  
           [0009]    In this manner, the prior art monitoring system can determine how long it takes for a request for a record to propagate through the network. The transaction can also be tracked in the other direction to determine how long it takes to fulfill the request. The nature of such data logging is complex since a server in one tier, or group, may ask multiple other servers for assistance, or processing. Also, different servers can be asked at different points in time. The speed at which requests, processing and transactions occur can cause large amounts of data to be logged very rapidly. At some later time, the data is transferred to console  40 . Console  40  acts to resolve the data and produce meaningful results about system performance that can be analyzed by a human administrator.  
           [0010]    A problem with the prior art approach is that the logging processes are segregated and do little, if any, communication with each other. This means that complex dependencies among processes, servers, etc., are not accurately analyzed. The logging processes tend to create high overhead in the host servers in which they execute. One approach uses the console to poll the processes. Frequent polling of many processes also creates excessive overhead. Optimization and performance improvement based on the prior art approach is hampered by the use of disparate platforms and the lack of more encompassing analysis. Having to dump data to the console at intervals, and then have the data resolved, ultimately means that monitoring is not performed in real time.  
           [0011]    Thus, it is desirable to provide a system that improves upon one or more shortcomings in the prior art.  
         BRIEF SUMMARY OF THE INVENTION  
         [0012]    The invention provides a system for gathering data for purposes of analyzing a network. The data is gathered based on values that are passed from node-to-node within processing devices, such as servers, in a network. The values are generated from characteristics obtained from measuring device performance and resource utilization. Values are passed peer-to-peer and successively combined with values at each receiving system so that, ultimately, a value is obtained that reflects the operation of a group of devices. A correlation matrix is maintained to indicate discrepancies in value meanings from different devices. The correlation matrix is used to more accurately combine values to achieve meaningful composite values.  
           [0013]    In one embodiment the invention provides a method for collecting information about a network&#39;s operation, wherein the network includes a plurality of devices, the method comprising using peer-to-peer communication among a plurality of devices in the network to obtain a measure of the network performance. 
       
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS  
       [0014]    [0014]FIG. 1A shows network performance measured in a prior art system;  
         [0015]    [0015]FIG. 1B shows network performance measured according to the present invention;  
         [0016]    [0016]FIG. 2A shows intelligence objects and performance value passing in the present invention;  
         [0017]    [0017]FIG. 2B illustrates architectural components of the present invention; and  
         [0018]    [0018]FIG. 2C illustrates a network system with multiple platforms. 
     
    
     DETAILED DESCRIPTION OF THE INVENTION  
       [0019]    A preferred embodiment of the present invention is incorporated into products, documentation and other systems and materials created and distributed by MetiLinx, Inc. as a suite of products referred to as “Metilinx iSystem Enterprise” system. The Metilinx system is designed to monitor and optimize digital networks, especially networks of many computer servers in large Internet applications such as technical support centers, web page servers, database access, etc.  
         [0020]    The system of the present invention uses software mechanisms called “intelligence objects” (IOs) executing on the various servers, computers, or other processing platforms, in a network. The intelligence objects are used to obtain information on the performance of a process or processes, hardware operation, resource usage, or other factors affecting network performance. Values are passed among the intelligence objects so that a composite value that indicates the performance of a greater portion of the network can be derived.  
         [0021]    [0021]FIG. 2A illustrates intelligence objects and value passing. In FIG. 2A, intelligence objects such as  102  and  104  reside in computer servers. Any number of intelligence objects can reside in a server computer and any number of server computers in the n-tiered system can be equipped with one or more intelligence objects. A first type of intelligence object is a software process called a system level object (SLO) that can monitor and report on one or more aspects of other processes or hardware operating in its host computer server. A second type of intelligence object, called a transaction level object (TLO) is designed to monitor transaction load with respect to its host computer or processes executing within the host computer.  
         [0022]    In one embodiment, IO  102  measures a performance characteristic of its host computer and represents the characteristic as a binary value. This value is referred to as the “local” utilization value since it is a measure of only the host computer, or of transaction information relating to the host computer. The local utilization value is passed to IO  104 . IO  104  can modify the passed value to include a measurement of its own host computer. The modified value is referred to as a “composite” utilization value. The composite utilization value can, in turn, be passed on to other intelligence objects that continue to build on, or add to, the measurements so that performance across multiple computer, tiers, operating systems, applications, etc., is achieved.  
         [0023]    Ultimately, the utilization value, or values, is passed on to other processes which can display the result of the combined measurements to a human user, use the result to derive other results, use the result to automate optimization of the n-tiered system, or use the result for other purposes. One aspect of the invention provides for redirecting processes and interconnections on the network based on the assessed utilization values of the computers, or nodes, in order to improve, or optimize, network performance. The processes that perform the redirection are referred to as “process redirection objects.” 
         [0024]    Note that although the invention is sometimes discussed with respect to a multi-tiered server arrangement that any arrangement of servers, computers, digital processors, etc., is possible. The term “processing device” is used to refer to any hardware capable of performing a function on data. Processing devices include servers, computers, digital processors, storage devices, network devices, input/output devices, etc. Networks need not be in a multi-tiered arrangement of processing devices but can use any arrangement, topology, interconnection, etc. Any type of physical or logical organization of a network is adaptable for use with the present invention.  
         [0025]    [0025]FIG. 2B illustrates one possible arrangement of more specific components of the present invention. Note that the term “component” as used in this specification includes any type of processing device, hardware or software that may exist within, or may be executed by, a digital processor or system.  
         [0026]    Systems such as those illustrated in FIGS. 1, 2A and  2 B, along with virtually any type of networked system, can be provided with IOs. In a preferred embodiment, the IOs are installed on each server in the network in a distributed peer-to-peer architecture. The IOs measure real-time behavior of the servers components, resources, etc. to achieve an overall ;measure of the behavior and performance of the network.  
         [0027]    A software system for populating a network with nodes, and for monitoring, analyzing, managing and optimizing a network is provided in the co-pending applications cited above.  
         [0028]    A preferred embodiment collects data on low-level system and network parameters such as CPU utilization, network utilization, latency, etc. About 400 different measured characteristics are used. Table I, below, lists some of the characteristics that are monitored in the preferred embodiment.  
                                           BEGIN TABLE I                                SYSTEM       File Read Operations/sec       File Write Operations/sec       File Control Operations/sec       File Control Operations/sec       File Write Bytes/sec       File Control Bytes/sec       Context Switches/sec       System Calls/sec       % Total Processor Time       % Total User Time       % Total Privileged Time       Total Interrupts/sec       System Up Time       Alignment Fixups/sec       Exception Dispatches/sec       Floating Emulations/sec       % Total DPC Time       % Total Interrupt Time       Total DPCs Queued/sec       Total DPC Rate       Total DPC Bypasses/sec       Total APC Bypasses/sec       % Registry Quota In Use       PROCESSOR       % Processor Time       % User Time       % Privileged Time       % DPC Time       % Interrupt Time       Interrupts/sec       DPCs Queued/sec       DPC Rate       DPC Bypasses/sec       APC Bypasses/sec       MEMORY       Available Bytes       Committed Bytes       Commit Limit       Write Copies/sec       Transition Faults/sec       Cache Faults/sec       Demand Zero Faults/sec       Pages/sec       Pages Input/sec       Page Reads/sec       Pages Output/sec       Page Writes/sec       Pool Paged Bytes       Pool Nonpaged Bytes       Pool Paged Allocs       Pool Nonpaged Allocs       Free System Page Table Entries       Cache Bytes       Cache Bytes Peak       Pool Paged Resident Bytes       System Code Total Bytes       System Code Resident Bytes       System Driver Total Bytes       System Driver Resident Bytes       System Cache Resident Bytes       % Committed Bytes In Use       % Committed Bytes In Use       PHYSICAL DISK       Current Disk Queue Length       % Disk Time       Avg. Disk Queue Length       % Disk Read Time       Avg. Disk Read Queue Length       % Disk Write Time       Avg. Disk Write Queue Length       Avg. Disk sec/Transfer       Avg. Disk sec/Read       Avg. Disk sec/Write       Disk Transfers/sec       Disk Reads/sec       Disk Writes/sec       Disk Bytes/sec       Disk Read Bytes/sec       Disk Write Bytes/sec       Avg. Disk Bytes/Transfer       Avg. Disk Bytes/Read       Avg. Disk Bytes/Write       LOGICAL DISK       % Free Space       Free Megabytes       Current Disk Queue Length       % Disk Time       Avg. Disk Queue Length       % Disk Read Time       Avg. Disk Read Queue Length       % Disk Write Time       Avg. Disk Write Queue Length       Avg. Disk sec/Transfer       Avg. Disk sec/Read       Avg. Disk sec/Write       Disk Transfers/sec       Disk Reads/sec       Disk Writes/sec       Disk Bytes/sec       Disk Read Bytes/sec       Disk Write Bytes/sec       Avg. Disk Bytes/Transfer       THREADS       % Processor Time       % User Time       % Privileged Time       Context Switches/sec       Elapsed Time       Priority Current       Priority Base       Start Address       Thread State       Thread Wait Reason       ID Process       ID Thread       OBJECTS       Processes       Threads       Events       Semaphores       Mutexes       Sections       SERVER       Bytes Total/sec       Bytes Received/sec       Bytes Transmitted/sec       Sessions Timed Out       Sessions Errored Out       Sessions Logged Off       Sessions Forced Off       Errors Logon       Errors Access Permissions       Errors Granted Access       Errors System       Blocking Requests Rejected       Work Item Shortages       Files Opened Total       Files Open       Server Sessions       File Directory Searches       Pool Nonpaged Bytes       Pool Nonpaged Failures       Pool Nonpaged Peak       Pool Paged Bytes       Pool Paged Failures       Pool Paged Peak       Context Blocks Queued/sec       Logon/sec       Logon Total       SERVER WORK QUEUES       Queue Length       Active Threads       Available Threads       Available Work Items       Borrowed Work Items       Work Item Shortages       Current Clients       Bytes Received/sec       Bytes Sent/sec       Bytes Transferred/sec       Read Operations/sec       Read Bytes/sec       Write Operations/sec       Write Bytes/sec       Total Bytes/sec       Total Operations/sec       Context Blocks Queued/sec       CPU PERFORMANCE       processor ID       minor faults       major faults       inter-processor cross-calls       interrupts       interrupts as threads       context switches       involuntary context switches       thread migrations       spins on mutexes       spins on readers/writer locks       system calls       percent user time       percent system time       percent wait time       percent idle time       processor set membership of the CPU       read() + readv() system calls       write() + writev() system calls       forks       vforks       execs       bytes read by rdwr()       bytes written by rdwr()       terminal input characters       chars handled in canonical mode       terminal output characters       msg count (msgrcv() + msgsnd() calls)       CPU PERFORMANCE       semaphore ops count (semop () calls)       pathname lookups       ufs_iget() calls       directory blocks read       inodes taken with attached pages       inodes taken with no attached pages       inode table overflows       file table overflows       proc table overflows       interrupts as threads (below clock)       intrs blkd(swtch)       times idle thread scheduled       involuntary context switches       thread_create()s       cpu migrations by threads       xcalls to other cpus       failed mutex enters (adaptive)       rw reader failures       rw writer failures       times loadable module loaded       times loadable module unloaded       physical block writes (async)       tries to acquire rw lock       reg window user overflows       reg window user underflows       reg window system overflows       reg window system underflows       reg window system user overflows       procs waiting for block I/O       page reclaims (includes pageout)       page reclaims from free list       pageins       pages paged in       pageouts       pages paged out       swapins       pages swapped in       swapouts       pages swapped out       pages zero filled on demand       pages freed by daemon or auto       pages examined by pageout daemon       revolutions of the page daemon hand       minor page faults via hat_fault()       minor page faults via as_fault()       major page faults       copy-on-write faults       protection faults       faults due to software locking req       as_fault()s in kernel addr space       times pager scheduled       executable pages paged in       executable pages paged out       executable pages freed       anon pages paged in       anon pages paged out       anon pages freed       fs pages paged in       fs pages paged out       fs pages free       FILE SYSTEM       file access system routines       buffer activity       data transfers per second       accesses of system buffers.       cache hit ratios       raw transfers       system calls       specific system calls.       characters transferred       block device activity       device load ratio       average wait time       average service time       physical block reads       physical block writes (sync + async)       logical block reads       logical block writes       KERNEL STATISTICS (KSTATS)       Interrupt statistics       Event timer statistics       I/O statistics       NETWORK       Packet log and description       RPC response time       VIRTUAL MEMORY       processes in run queue       processes runnable but swapped       virtual and real memory.       swap space currently available       size of the free list       page faults and paging activity       page reclaims       minor faults       kilobytes paged in       kilobytes paged out       kilobytes freed       anticipated short-term memory shortfall       pages scanned by clock algorithm       disk operations per second       trap/interrupt rates (per second).       device interrupts       system calls       CPU context switches       percentage usage of CPU time       user time       system time       idle time       swap ins       swap outs       pages swapped in       pages swapped out       PROCESSES       forks       vforks       lexecs       cpu context switches       device interrupts       traps       system calls       total name lookups       user cpu       system cpu       idle cpu       wait cpu       process start time       usr + sys cpu time for this process       usr + sys cpu time for reaped children       priority       % of recent cpu time       % of system memory used by the process       CPU PERFORMANCE       user time       system time       idle time       nice time       average load       number of processes       run queue length       VIRTUAL MEMORY       pages swapped in       pages swapped out       Total amount of memory       Amount of memory in use       Currently unused real memory.       Total amount of shared memory       Memory used for buffers       Total swap space(s)       Used disk swap       Free swap space.       Cached memory       NETWORK       For each interface:       Number of received packets from system boot.       Number of received mangled packets from system boot.       Number of received but dropped packets.       Number of received packet with framing error.       Number of transmitted packets.       Number of errors during transmitting. i.e. late detected collision.       Number of dropped packets.       Number of collisions during transmitting.       Number of carrier loses during transmitting.       Allocated buffers       Socket usage per protocol       Resource usage per protocol       Kernel ARP table       NETWORK       network devices with statistics       Lists the Layer2 multicast groups a device is listening to (interface index,       label, number of references, number of bound addresses).       number of pages that are ′code′       number of pages of data/stack       network device status       Firewall chain linkage       Firewall chains       Network statistics       Raw device statistics       Routing cache       Socket statistics       PROCESSES       forks       cpu context switches       device interrupts       state (R, S, D, Z, T)       minor faults       major faults       timeslices       user mode jiffies       kernel mode jiffies       nice value       timeout jiffies       uptime jiffies       Virtual memory size.       Resident number of pages       total program size       size of in memory portions       number of the pages that are shared       number of pages of library       number of dirty pages       PHYSICAL DISK       I/O statistics       Number of read requests to whole disk not only for partitions.       Number of write requests to whole disk.       Number of read blocks from whole disk.       Number of written blocks from whole disk.       LOGICAL DISK       Busy time       Average queue length       Sectors read/written       Blocks read/written       Average waiting time       GENERAL SETS       Local response process latency       Local resource access latency (physical and virtual memory, hdd, sockets,       etc).       Spanned resource access latency (physical and virtual memory, hdd,       sockets, etc). System process flow organized across functional groups       Single arc latency between nodes       Combined arc latency across subnet       Processor time slice assignments       Functional resource arc analysis in tier-specific evaluations of standard       and native parameters (related to web servers, database servers and       different app servers)       Functional resource arc analysis of harmonized Native Sensor Data and       harmonized multi platform data       Application priorities       Transactional priorities            END TABLE I                  
 
         [0029]    Data is produced at each node as a four-byte value reflecting the characteristics of the host processing system for the node. These values are referred to as Local Node Values (LNVs). Multiple LNVs from different nodes are combined into a composite value called a Composite Node Value (CNV). CNVs can also include CNVs passed by other nodes.  
         [0030]    The CNVs remain four-bytes in size. A CNV is passed along the network hierarchy and used to obtain further composite values by combining with a LNV at successive nodes so that overall system performance is ultimately provided in the composite values. Node value propagation is typically organized into organizational and functional blocks, as described in the related applications. Typically, node value propagation is in the direction of dependencies, or counter to request flow. However, since request flow and dependencies are loosely adhered to in any particular network (and can change with time) the system of the present invention can adapt to changing conditions. In general, the passing of node values can change dynamically, can be one-to-many or many-to-one and is bi-directional. Thus, unlike the limited directional “chaining” of prior art systems as shown in FIG. 1A, the system of the present invention can provide flexible peer-to-peer value passing. Performance and usage information from many nodes can be combined in varied patterns to achieve more versatile analysis structures such as that illustrated in FIG. 1B (by bold arrows).  
         [0031]    Naturally, in other embodiments, the local and composite values can be of any size, varying sizes, etc. The values can be more complex data structures as opposed to “values.” Any combination of network characteristics can be measured.  
         [0032]    LNVs and CNVs are made up of four sub-values. Each sub-value is a byte of data with a higher value (e.g., 255) indicating optimal functioning in the sub-value&#39;s associated network property. A first sub-value is a System Balance Value (SBV). The SBV measures the balanced operation of server nodes within functional groups. Functional groups are designated by a user/administrator and are used by the system of the present invention to define groups among which CNVs accumulate values. A higher SBV value indicates that functional groupings of server nodes are operating in good balance.  
         [0033]    A second sub-value is the System Utilization Value (SUV). The SUV represents the system resource utilization, based on analyses of individual and aggregated resource nodes. A higher values indicates that resources are being utilized more efficiently.  
         [0034]    A third sub-value is the Performance Optimization Value (POV). The POV represents the metric for speed or response of the system resources. A higher value means that response times are shorter, or that speed of response is higher.  
         [0035]    A fourth, and final, sub-value is called the MetiLinx Optimization Value (MOV). The MOV indicates the degree of total system optimization. A high value indicates that functional groups are more optimally balanced. The MOV reflects the other sub-values of balance, resource utilization and speed of response.  
         [0036]    In order to meaningfully composite LNV and CNV values received from other nodes, each node maintains a “correlation matrix.” The correlation matrix includes numerical weighting factors based on differences in characteristics of different node environments in the network. For example, best performance values can be maintained for every node in the system. Node A might be recorded at a best performance combination of 90% utilization and a 3 second response. Node B might have a 90% utilization with a 2 second response. When node C receives LNV or CNV values indicating 90% utilization with a 3 second response for each node, node C is now aware that node A&#39;s host environment is operating at a high performance while node B&#39;s environment is operating at a lower than desired utilization since the response time is slower than previously achieved. In generating a CNV from node A and B values, node C&#39;s process combines the utilization and response times by weighting according to the correlation matrix. In this simplified example, if “A” is the dependency of node C on node A&#39;s utilization (for node C&#39;s efficient operation and utilization), while “B” is the dependency of node C on node B&#39;s utilization, then the CNV at node C can be computed as A+(B* 2)/3.  
         [0037]    Each node&#39;s correlation matrix is updated based on information the node receives from other nodes. For example, if node C is informed that node B is now operating at 90% utilization with a 1 second response time, node C&#39;s correlation matrix factors with respect to node B are updated. Note that the correlation matrix is multi-dimensional. With the simplified example, alone, there can be a two dimensional array for utilization versus response time for each node.  
         [0038]    In a preferred embodiment the correlation matrix is stored locally to the node process. Usually the correlation matrix resides in fast RAM in the node&#39;s host processing system. However, other embodiments can use variations on the correlation matrix and can maintain and access the correlation matrix in different ways. For example, correlation matrices can be stored on, and accessed from, a central console computer.  
         [0039]    Nodes may be removed from the network as, for example, when an administrator deactivates the node, the node&#39;s host processor is brought down, etc. When a node is brought down the optimization system traffic of the present invention is routed to different nodes. It is advantageous to transfer the correlation matrix of the node taken down to the one or more nodes to which traffic is being re-routed so that the information in the correlation matrix does not have to be recreated.  
         [0040]    A preferred embodiment of the invention uses varying latency cycles to allow nodes to gather characteristics data to generate local values at varying frequencies. For example, a latency cycle can vary from 0 to 100. A larger number means that a characteristic is obtained less frequently. A value of 0 for a latency cycle means that a characteristic value is obtained as often as possible. Naturally, a lower latency cycle means that the host CPU is spending more time acquiring characteristic data and, possibly, generating values, also.  
         [0041]    Although the present invention has been discussed with respect to specific embodiments, these embodiments are merely illustrative, and not restrictive, of the invention.  
         [0042]    Thus, the scope of the invention is to be determined solely by the appended claims.