|Publication number||US7376694 B2|
|Application number||US 09/891,225|
|Publication date||May 20, 2008|
|Filing date||Jun 26, 2001|
|Priority date||Jun 26, 2001|
|Also published as||US20030009550|
|Publication number||09891225, 891225, US 7376694 B2, US 7376694B2, US-B2-7376694, US7376694 B2, US7376694B2|
|Inventors||Dale T. Taylor, Dave L. Matheny|
|Original Assignee||Intel Corporation|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (7), Referenced by (1), Classifications (22), Legal Events (3)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This patent document contains information subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent, as it appears in the U.S. Patent and Trademark Office files or records but otherwise reserves all copyright rights whatsoever.
Aspects of the present invention relate to gathering and use of information. Other aspects of the present invention relate to information synchronization.
In a society that is becoming increasingly networked, information is often gathered from different sources across a network and used to make various decisions. For example, managers of computer networks may use discovery agents to gather information from devices in the network. Examples of the information collected by discovery agents include operational status (e.g., the availability), transmission facilities (e.g., the bandwidth that a device can handle) of the underlying devices, or the capabilities of the installed devices which may include software and available hardware. Such collected information may be used to evaluate network performance such as determining the bottleneck of the network traffic, to determine the structure and the operation of the network, and to improve the network performance by reconfiguring the network based on the gathered information.
In a different application, database administrators may deploy similar agents to monitor data manipulation acts performed on devices that host different copies of the same data or to identify different versions of the same file stored on different devices. The information gathered from these monitoring agents may be used to determine appropriate consolidation operations to enforce data integrity. For example, a user may have a file stored on different devices with the same name (e.g., on a personal computer at home and on a Palm Pilot). The files with the same name may correspond to different versions of the same file that is edited under different circumstances (e.g., the user may have edited the file on the personal computer on Monday and edited it again while the user is on the road on Tuesday). An automated data administrator may automatically consolidate these different versions to maintain the data integrity of the file.
The aggregated information gathered from multiple sources (via or through agents) may contain duplicate data. For example, when a network manager sends inquiries to multiple agents to search for an available router device, more than one agent may respond (e.g., multiple routers are available). The inquiry from a database administrator to identify a file on different devices may yield multiple responses.
The present invention is further described in terms of exemplary embodiments, which will be described in detail with reference to the drawings. These embodiments are non-limiting exemplary embodiments, in which like reference numerals represent similar parts throughout the several views of the drawings, and wherein:
The inventions are described below, with reference to detailed illustrative embodiments. The inventions can be embodied in a wide variety of forms, some of which may be quite different from those of the disclosed exemplary embodiments. Consequently, the specific structural and functional detail is disclosed herein are merely representative and do not limit the scope of the invention.
The processing described below may be performed by a general-purpose computer alone or in connection with a special purpose computer. Such processing may be performed by a single platform or by a distributed processing platform. In addition, such processing and functionality can be implemented in the form of special purpose hardware or in the form of software being run by a general-purpose computer. Any data handled in such processing or created as a result of such processing can be stored in any memory as is conventional in the art. By way of example, such data may be stored in a temporary memory, such as in the RAM of a given computer system or subsystem. In addition, or in the alternative, such data may be stored in longer-term storage devices, for example, magnetic disks, rewritable optical disks, and so on. For purposes of the disclosure herein, a computer-readable media may comprise any form of data storage mechanism, including such existing memory technologies as well as hardware or circuit representations of such structures and of such data.
Each of the device groups may include one or more devices (not shown in
An agent connects to and communicates with the devices in its corresponding device group to, for example, acquire status information of the devices and to send such information to the priority rule-based coalescing mechanism 110 via the network 120. These devices may operate on different platforms (e.g., Unix platform and PC platform) or use different protocols (e.g., a computer and a home appliance such as a Video Cassette Recorder (VCR) may use different protocols) to communicate with their agent.
In configuration 100, an agent is capable of communicating with the devices in its device group that are running on different platforms and using different protocols. An agent serves as an interface between the devices in its device group and the priority rule-based coalescing mechanism 110. While interacting with the priority rule-based coalescing mechanism 110, a uniform schema or convention may be adopted. For example, a schema defined using the eXtensible Markup Language (XML) may be pre-specified to deliver the information from agents to the priority rule-based coalescing mechanism 110.
A device may send information as a response to its corresponding agent based on an inquiry. For example, an agent may query the status of a disk drive (a device) in its associated device group. An agent may query the timestamp of a particular file in a file system (a different device). A device may also send information to its associated agent based on its own initiative. For example, when a device finishes its current job and ready for other tasks, the device may actively send information to its associated agent to advertise its availability.
The priority rule-based coalescing mechanism 110 receives information from multiple sources (agents) and coalesces the received information based on certain priority rules. Such priority rules may specify the relative importance of different agents. The relative importance may be defined with respect to some criteria that may be specified according to application needs. A default priority may be assumed for an agent if no priority is defined explicitly. Priority rules provide a base for the priority rule-based coalescing mechanism 110 to prioritize the information from different sources.
In addition to the priority rules, the priority rule-based coalescing mechanism 110 may also integrate other types of information during coalescing. For example, a coalescing decision about the information relevant to a file may be made based on both the priority of the corresponding file manager (a device) as well as the timestamp of the file. For instance, if two copies (e.g., corresponding to different versions) of the same file (stored on different devices) have the same priority but one has a more recent timestamp, the one with the more recent timestamp may be kept during the coalescing and the other may be removed during the coalescing.
Priorities may also be defined with respect to devices in a device group. For example, a Central Processing Unit (CPU) of a computer in a device group, represented by an agent, may have a higher priority than a CPU of another computer in a different device group, represented by a different agent. The priority of a device in a device group may be inherited from the priority assigned to its associated agent or may be defined explicitly. When an explicit priority is assigned to a device, it may override the inherited priority of the device.
The information formatting mechanism 230 takes the information received from the devices and organizes it according to a pre-defined convention prior to sending the information to the priority rule-based coalescing mechanism 110. For example, if a file system sends a timestamp of a particular file together with the file name to the device interface (which may be subsequently sent to the priority rule-based coalescing mechanism 110), the information formatting mechanism 230 may organize the information according to a schema pre-specified in XML. The schema may specify tags for different types of information and how these tags are arranged. For example, according to a schema, a timestamp and the file name are placed into separate tag fields. Such a schema may be designed so that both the priority rule-based coalescing mechanism 110 and the agents 135, . . . , 145, 155, . . . , 165 can understand the information.
The formatted information generated by the information formatting mechanism 230, is sent to the priority rule-based coalescing mechanism 110 via the network communication mechanism 240. The network communication mechanism 240 is capable of interacting with the priority rule-based coalescing mechanism 110 using a protocol that is suitable for the network 120.
The responsibility of the priority rule-based coalescing mechanism 110 is to synchronize information from multiple sources. For example, different sources may send duplicate information or variants of the same information. Such information may have to be synchronized before it can be effectively used. The synchronization or coalescing may include removing duplicates or choosing one piece of specific information among a plurality of variants according to some criterion (which may be application dependent). According to the present invention, criteria used to coalesce the information from multiple agents include priorities associated with different sources of information (agents). Such priorities are centrally set-up and controlled within the priority rule-based coalescing mechanism 110. That is, sources of the information (i.e., agents) send information without priority information or without concerning about the specifics of how the information will be processed or whether the information will be used (or kept).
In addition to the priorities, the priority rule-based coalescing mechanism 110 may also combine other types of information (e.g., parameters from devices) with the priorities during coalescing. For instance, the bandwidth of a router may be used, together with the priority of the router, to make a coalescing decision.
The network communication mechanism 310 is responsible for interacting with the agents (e.g., agent i, 145), including sending inquiries and receiving information from the agents. The interaction may be carried out through a pre-defined protocol or convention. For example, the information sent from the agents may be constructed according to a schema described using a standard language such as XML.
The priority rule set-up mechanism 360 initializes or updates the priority rules and stores the priority rules in the priority rule database 365. The priority rules may define the relative importance of both agents and devices and they may be specified in terms of certain structure expressed in an understood syntax.
The structure of the priority rules may be defined as a schema specified in certain language. For example, XML may be used to specify the construct of priority rules. Below is an exemplary construct for priority rules specified in XML:
<priority> <agentname priority = “priority-value”> <device1-tag> “priority-value” </device1-tag> <device2-tag> “priority-value” </device2-tag> . . . <deviceM-tag> “priority-value” </deviceM-tag> </agentname> . . . </priority>
where <priority> . . . </priority> encloses the priority definition block which may include priority rule definitions for a plurality of agents, “agentname” corresponds to the identification of an agent, “priority” is a keyword denoting where the priority should be defined, “priority-value” may be a numeral defining a priority level, and </agentname> ends the definition of the priority for the agent named “agentname”. According to the exemplary schema, device priorities may be defined inside the agent priority definition block (enclosed in <agentname> </agenmame>). In the above exemplary schema, “device-tag” identifies a device and the “priority-value” is a numeral defining the priority of the device named in “device-tag”. Tag </device-tag> closes the priority definition block for the device. Based on the above exemplary schema, the following example shows priority rules defined according to the exemplary schema:
<agent1 priority = “10”>
<host> 2 </host>
<URL> 4 </URL>
<computer> 0 </computer>
<host> 5 </host>
<IPaddress> 3 </IPaddress>
<MACaddress> 12 </MACaddress>
<route> 10 </route>
In the above example, the priority for agent 1 is defined as level 10 and the priority of agent 2 is assumed default priority level, which may be pre-defined as, for example, level 0. A larger number may be defined to represent a higher priority. The devices associated with an agent may default to inherit the priority level assigned to their associated agent except when it is explicitly defined otherwise to override the inherited priority.
Devices associated with agent1 in the above example have, by default, precedence over any other device associated with other agents (all other agents in the above example have default priority level 0) except when it is explicitly defined differently. For instance, device “y” of agent1 has a higher priority (level 10—because it is not defined so it uses the default) than that of device “y” associated with agent2 (level 0). However, agent2's “MACaddress” has a higher priority than any other agent's “MACaddress” (because they are all default to level 0—except for agent1's which defaults to 10). Furthermore, in the above example, device “host” generated by agent2, if any, has a priority of 5 which overrides any “host” generated by any other agent including agent1 because it has been downgraded to level 2. The “route” generated by either agent1 or agent2 have the same level of priority (level 10). Depending on the specific implementation of the coalescing mechanism, information from agents with the same level of priority may be both kept in the final coalesced file. A coalescing mechanism may also be implemented to remove one using other criteria. Examples of other criteria may include timestamp or bandwidth. For instance, if two “routes” have the same priority but one allows higher bandwidth, the one with the higher bandwidth may be kept and the other may be removed from the coalesced file.
Referring back to
Priority rules are stored in the priority rule database 365. The priority rule access mechanism 370 retrieves priority rules whenever it is needed. For example, it may be triggered to retrieve relevant priority rules when new information is received by the network communication mechanism 310 from an agent. Based on received information (e.g., from a particular agent), the network communication mechanism 310 may instruct the priority rule access mechanism 370 to retrieve the rules associated with the agent and its associated devices. Such retrieved priority rules may be fed to both the transformation mechanism 320 (explained later) and the parsing mechanism 380 to parse the rules before they can be used by the coalescing mechanism 330. Other embodiments (not shown in
According to the present invention, the agents do not concern (or have no knowledge) about the priority associated with them. The information sent from the agents does not include priority information. When information is received from an agent, associated priority information (retrieved by the priority rule access mechanism 370) may be incorporated into the received information before the information is coalesced. In
Such modified information is fed to the coalescing mechanism 330. With appropriate priority information attached to the original information, the coalescing mechanism 330 coalesces the information accordingly and generates a coalesced file, which contains information that has been properly coalesced or synchronized. For example, duplicate information from multiple agents may be removed according to the priority rules.
As discussed earlier, the removal of a piece of information from a particular device may also be determined based on the operational parameters of the device. For example, if two devices have the same priority level but one has a higher computational power, the coalescing mechanism 330 may combine the priority with the computational power of the device and decides to retain the piece of information from the device with higher computational power. The coalesced file may be initially set up by the coalesced file initialization mechanism 350. The final coalesced file may be stored in the coalesced file database 335.
The coalescing mechanism 330 may perform coalescing in a different mode. One may be a synchronous mode and the other may be an asynchronous mode. In a synchronous mode, the coalescing mechanism 330 actively initiates each act in the coalescing process by sending an inquiry to an agent to collect information, coalescing the information, generating an updated coalesced file, and then moving on to the next agent. All is done in a synchronous fashion. In an asynchronous mode, the coalescing process is activated whenever information is received from an agent. That is, the coalescing process is activated by an agent.
In the synchronous mode, the priority rule-based coalescing mechanism 110 may actively send an inquiry, with a coalesced file containing information that has been properly coalesced, to an agent to collect information. To respond, the agent may simply append the requested information at the end of the coalesced file. When the appended coalesced file is returned to the priority rule-based coalescing mechanism 110, the appended information may be coalesced against the information that has been properly coalesced to generate an update coalesced file, which may then be passed onto the next agent.
In the asynchronous mode, the coalesced file may remain in the priority rule-based coalescing mechanism 110. When information is received by the network communication mechanism 310 from an agent, the coalescing mechanism 330 coalesces the newly received information against the information in the coalesced file to generate an update coalesced file.
During the coalescing process, the coalesced file is sent, via the network communication mechanism 310, to each agent, connected to the priority rule-based coalescing mechanism 110, with an inquiry and the requested information is returned as an appended portion in the coalesced file and sent back to the network communication mechanism 310. The returned coalesced file containing the newly appended information is then coalesced to generate an update coalesced file in which all the information has been properly coalesced. The process continues until all the agents have been enumerated. When this happens, determined at act 530, the coalesced file is stored, at act 535, in the coalesced file database 335.
During the enumeration, when there is a next agent, determined at act 530, the network communication mechanism 310 sends, at act 540, an inquiry together with the current coalesced file to the next agent. When the network communication mechanism 310 receives, at act 550, returned information (formatted according to, for example, XML), the priority rule access mechanism 370 retrieves, at act 560, the priority rules associated with the next agent. The retrieved priority rules are used to transform, by the transformation mechanism 320 at act 570, the appended information to generate modified information with the pre-defined priorities incorporated. The modified information and the retrieved priority rules are used to coalesce, at act 580, the coalesced file to generate, at act 590, an updated coalesced file. The process then returns to act 530 to determine whether the enumeration continues.
Upon receiving the inquiry, the agent connects, at act 620, to the device and collects, at act 630, the requested information. Before sending the information back to the priority rule-based coalescing mechanism 110, the agent constructs, at act 640, formatted information according to a pre-defined schema or structure and appends, at act 650, the formatted information to the coalesced file. Then, the agent sends, at act 660, the formatted information with the appended coalesced file to the priority rule-based coalescing mechanism 110.
In an asynchronous mode, the priority rule-based coalescing mechanism 110 is activated to perform coalescing whenever information is received from an agent. In
While the invention has been described with reference to the certain illustrated embodiments, the words that have been used herein are words of description, rather than words of limitation. Changes may be made, within the purview of the appended claims, without departing from the scope and spirit of the invention in its aspects. Although the invention has been described herein with reference to particular structures, acts, and materials, the invention is not to be limited to the particulars disclosed, but rather extends to all equivalent structures, acts, and, materials, such as are within the scope of the appended claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US6751663 *||Mar 25, 1999||Jun 15, 2004||Nortel Networks Limited||System wide flow aggregation process for aggregating network activity records|
|US6880005 *||Mar 31, 2000||Apr 12, 2005||Intel Corporation||Managing policy rules in a network|
|US20020062241 *||Feb 27, 2001||May 23, 2002||Janet Rubio||Apparatus and method for coding electronic direct marketing lists to common searchable format|
|US20020161883 *||Apr 30, 2001||Oct 31, 2002||David Matheny||System and method for collecting, aggregating, and coalescing network discovery data|
|US20030126136 *||Jun 24, 2002||Jul 3, 2003||Nosa Omoigui||System and method for knowledge retrieval, management, delivery and presentation|
|US20040030741 *||Apr 1, 2002||Feb 12, 2004||Wolton Richard Ernest||Method and apparatus for search, visual navigation, analysis and retrieval of information from networks with remote notification and content delivery|
|US20040230571 *||Feb 13, 2004||Nov 18, 2004||Gavin Robertson||Index and query processor for data and information retrieval, integration and sharing from multiple disparate data sources|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US9577891||Mar 15, 2013||Feb 21, 2017||Ca, Inc.||Method and system for defining and consolidating policies based on complex group membership|
|U.S. Classification||709/202, 709/217, 709/236, 707/E17.032, 707/999.001, 707/999.01|
|International Classification||H04L29/06, H04L29/08, G06F17/30, G06F13/00|
|Cooperative Classification||Y10S707/99931, H04L67/26, H04L69/329, H04L67/16, H04L29/06, G06F17/30215, G06F17/3015|
|European Classification||G06F17/30F8D3M, G06F17/30F7R, H04L29/08N25, H04L29/08N15, H04L29/06|
|Jan 2, 2002||AS||Assignment|
Owner name: INTEL CORPORATION, CALIFORNIA
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:TAYLOR, DALE T.;MATHENY, DAVE L.;REEL/FRAME:012424/0278
Effective date: 20010706
|Sep 21, 2011||FPAY||Fee payment|
Year of fee payment: 4
|Nov 4, 2015||FPAY||Fee payment|
Year of fee payment: 8