|Publication number||US7350207 B2|
|Application number||US 10/153,952|
|Publication date||Mar 25, 2008|
|Filing date||May 23, 2002|
|Priority date||May 25, 2001|
|Also published as||US20030088684, WO2002097626A1|
|Publication number||10153952, 153952, US 7350207 B2, US 7350207B2, US-B2-7350207, US7350207 B2, US7350207B2|
|Inventors||Matthew D. Fisher|
|Original Assignee||Tellabs Operations, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (18), Non-Patent Citations (7), Referenced by (25), Classifications (11), Legal Events (5)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This application claims the benefit of U.S. Provisional Application Ser. No. 60/293,178 filed May 25, 2001 and Provisional Application Ser. No. 60/293,230 filed May 25, 2001.
The present invention generally relates to downloading software over a network to a target element. In particular, this invention provides means for verifying compatibility and data integrity of software to be installed at a target element.
It is well known in the prior art to download computer software to a target element in a network in order to upgrade or replace existing software or to replace faulty software. However, current software downloading models either do not adequately address software and hardware compatibility and data integrity issues, or address them in a costly manner. In the former case, software may be downloaded over a network without checking compatibility, and by relying on network protocols to ensure data integrity. These protocols, typically conducted at a packet level, provide a limited degree of assurance that no corrupted data has been transmitted.
Indeed, in some cases, network-level reliability checks are not required. This may be satisfactory in single-instance cases where the user already knows that the software to be downloaded is compatible with software and hardware at the target, and where the user does not mind resending the software if the software is corrupted during transmission.
If the software is not corrupted in the transmission process, or if any corruption that occurs is detected and corrected through the reliability checks built into the network, the software may arrive at the target in an uncorrupted state; and if it is compatible with software at the target element, then it will function properly after it has been downloaded. In other cases, however, especially where the software is to be downloaded at a multiplicity of targets, each having particular software and hardware compatibility issues, there is a need to take additional measures to ensure compatibility and data integrity.
Accordingly, an inexpensive and reliable means of installing, replacing or upgrading software at a target element over a network is needed.
The features of the present invention, which are believed to be novel, are set forth with particularity in the appended claims. The invention may best be understood by reference to the following description taken in conjunction with the accompanying drawings, in the several figures of which like reference numerals identify like elements, and in which:
Embodiments of the present invention provide an inexpensive and reliable method for installing software over a network to a network element, and also provide an inexpensive and reliable method for upgrading installed software components on a network. Embodiments of the present invention also increase the reliability of data transmission over a network. Greater data transfer reliability is achieved through use of a nested-CRC (Cyclic Redundancy Check) approach.
According to an embodiment of the present invention a data trailer is provided that is capable of containing software compatibility tags with maximum flexibility in terms of number of tags, size of tags, and format of data within the tags. Furthermore, according to an embodiment of the present invention a data trailer is provided that is not dependent on the data payload, and thus can be used in any type of data, including encrypted and non-encrypted data, and proprietary and open encodings. An embodiment of the present invention uses a rule-based approach for compatibility testing for a software installation procedure. This rule-based approach to compatibility testing facilitates evaluating complex expressions that can vary widely from target to target.
Embodiments of the present invention provide reliable, efficient means for installing software sent from one node of a network to another node in the network, without corruption, and with compatibility with existing software or hardware. Specifically, the embodiments provide a method for providing downloadable software from a sending element to a target element comprising (1) providing a data unit comprising a payload and a data trailer; (2) storing a software program constituent in the payload; (3) storing at least one software compatibility tag in the data trailer, each software compatibility tag containing at least one software compatibility tag rule associated with the software compatibility tag, and each software compatibility tag containing information specific to the software program in the data trailer; and (4) transmitting the data unit to a target element, the target element having information specific to software located at the target element, and the target element evaluating the software compatibility tag rule.
In one embodiment, an application at the target element evaluates the software compatibility tag rule and determines, based on the rule, whether to install the payload to the target element. Specific embodiments include an indicator, provided in the data trailer, of whether the at least one software compatibility tag rule should be evaluated, and an indicator, in the software compatibility tag, of whether a software compatibility tag rule associated with the software compatibility tag should be evaluated. A data unit sent in accordance with one embodiment further comprises two reliability checking parameters in the data trailer, where one such parameter is associated exclusively with the data in the payload, and the other such parameter is associated with the data unit as a whole.
In another embodiment, a data unit containing the contents of the above-described data trailer but without a payload is sent to a target element for evaluation of the rules of any SCTs in the data trailer. If the rules evaluate satisfactorily, then a signal is sent to the sending element, which prompts the sending element to send a data unit containing the payload for installation at the target element.
The following defined terms are used in the present description.
“Checksum” is defined as a means for checking reliability of a data transmission that includes both checksums and cyclical redundancy checks, as those terms are understood by those with skill in the art.
“Data unit” refers to data that is sent over a network according to an embodiment of the present invention, and typically comprises a payload portion and a data trailer. The payload portion typically contains one or more files, which may be compressed.
“Package,” as used herein, can be synonymous with “data unit” and thus in some usages refers to a file or set of files that are associated with a data trailer, but can also refer to a file or set of files without regard to whether the file or files are associated with a data trailer.
“Install,” “installation” as used herein refers to installing, replacing, upgrading, updating, or running software (as defined herein) at a target element.
“Software,” as used herein, refers to executable software computer programs, as well as files without any executable components, such as data files.
“Data trailer,” as used herein, refers to any data trailer that can be populated with checksums and/or SCTs, and is not to be construed as limited to the specific embodiments of data trailers discussed herein.
“Software Compatibility Tag,” or “SCT,” as used herein, refers to any SCT that can be populated with identifying information (such as a part number) and rules for comparing the identifying information to like information external to the SCT, and is not to be construed as limited to the specific embodiments of SCTs described herein.
In one embodiment, each data unit is provided with a data trailer in accordance with the present invention, where the data trailer typically includes a checksum that covers the entire data unit (including both data trailer and payload), as well as a checksum that covers only the payload. In one embodiment, the aforementioned checksums are Cyclical Redundancy Checks (CRCs). The data trailer also may contain one or more software compatibility tags, as described herein. The data unit, including the data trailer, is sent over network 103 to be installed at any or all of target elements 105, 107, and 109. At the receiving target element, software installed at the target element receives the incoming software and evaluates the checksums for corruption, and, using rule engine 113, evaluates the rules provided in the software compatibility tags to determine compatibility. These steps are treated in more detail in the discussion of
As shown in
As shown in
In the embodiment of
In the embodiment of
Utilize SCT bytes for compatibility resolution.
Ignore all SCT bytes.
In the embodiment depicted in
In the embodiment depicted in
In the embodiment depicted in
In the embodiment depicted in
In the embodiment depicted in
In the embodiment depicted in
Rule is not required.
Rule is required.
In the preferred embodiment depicted in
In the embodiment depicted in
The SCTR operates by comparing Part Number and Part Number Version information relating to the incoming application to the Part Number and Part Number Version of a software or hardware component at the target node (the Part Number and Part Number Version of such a component at the target node are referred to, respectively, as the “Target Part Number” and the “Target Part Number Version”). If the Target Part Number does not match the Part Number in the SCT 300, then the rule is not evaluated. If the Target Part Number does match the Part Number in the SCT 300, then the rule is evaluated. The rules comprise a plurality of mathematical expressions, for example those in Table 5:
Equality comparison ( == ).
Inequality comparison ( != ).
Less than comparison ( < ).
Less than or equality comparison ( <= ).
Greater than comparison ( > ).
Greater than or equality comparison ( >= ).
If the OVR bit is not set, then the application extracts the software compatibility tag information (step 413). If the SCT Required (REQ) bit is set (determination made at step 414), the application proceeds to step 415 to extract the Part Number (PN) from the SCT (step 415). If the SCT REQ bit is not set, then the application checks to see if there are any more SCTs to be evaluated (step 421). If not, then application checks to see if any rules were evaluated (step 422). If no more SCTs remain to be evaluated, and if none of the rules have been evaluated, then the application discards the payload and trailer (step 403). If, at step 421, there are no more SCTs to be evaluated, and all the rules evaluated were evaluated correctly, then the Payload, Payload Part Number (PN) and Payload Version (PV) from the data trailer are installed on the target (step 411). If there are more SCTs to be evaluated, the application advances to the next SCT (step 423), extracts the SCT information from that SCT (step 413), and proceeds as discussed above.
Returning to step 415, if no Target Part Number matches the SCT PN, then the application checks to see if there are any more SCTs to be evaluated (step 421) and proceeds as discussed above. If any Target Part Number matches the SCT PN, the application extracts the Part Number Version (PNV) from the SCT (step 417) and then evaluates the SCT rule against the target Part Number's version and the SCT PNV (step 419). If the rule does not evaluate correctly (determination made at step 425), then the payload and trailer are discarded (step 403). If the rule does evaluate correctly, the application checks to see if there are any more SCTs to be evaluated (step 421). If there are more SCTs to be evaluated, the application advances to the next SCT (step 423) and extracts the SCT information from that SCT (step 413), and proceeds as described above. If there are no more SCTs to be evaluated, and if all the rules evaluated were evaluated correctly, then the Payload, Payload Part Number (PN) and Payload Version (PV) from the data trailer are installed on the target (step 411). If the rule for any SCT did not evaluate correctly (determination made at step 427), the payload and trailer are discarded (step 403).
A specific example of the manner in which an SCT is evaluated at a target element is described in Example 1 below. A software application to be sent to a network node only works at network nodes having part number 1233 and a part number version number between 100 and 200, inclusively, and at network nodes having part number 1234 and a part number version number between 600 and 850, exclusively. The software is sent to a target node along with a data trailer containing SCTs, which contain SCT rules reflecting these requirements. In this case, four SCTs are required. Table 6 is a partial list of the contents of these SCTs:
Part Number Version
When the application is sent to a node having a part number of 1234 and a version number of 777, the following evaluation of the SCTs occurs at the target node. An application at the target extracts the Required Bit from the first SCT and determines that this rule is “required” (step 414). Next, the target application extracts the part number from the first SCT and compares it to the Part Number at the target (step 416). If the part numbers do not match, the rule is disregarded. In this case, the first two rules are disregarded because the part number at the target (1234) is different from the part number specified in the SCT rule (1233). However, the remaining two SCT rules do apply, because the part number at the target (1234) matches that specified in these rules. The target application then evaluates the remaining rules by applying each rule's corresponding SCTR against its PNV and the target node's part number version (777) (steps 417, 419). Thus, the third rule evaluates to “true” because the target node's part number version is greater than the minimum PNV specified for the incoming software (600), and the fourth rule evaluates to “true” because the target node's part number version (777) is lower than the maximum PNV specified for the incoming software (800). Because both rules evaluated to true, the payload and its version would be installed locally at the target node. If either rule had evaluated to “false,” the payload would have been discarded.
It will be appreciated by those with ordinary skill in the art that the above example involving hardware and a single part number can easily be extended to more complex situations, including applying the scheme to software (or a hardware/software mix) and to those targets that have multiple parts (e.g. an operating system, or a Fully Programmable Gate Array (FPGA) for an embedded chip) and multiple part numbers. In the case of multiple parts, each part would be assigned its own data trailer and its own set of SCTs. In these cases, each part would evaluate each rule independently of the other parts (N rules and M part numbers would mean N×M rule evaluations).
When a software module is ready to be deployed to some number of network elements, the module is run through an application that creates zero or more rules, and creates and attaches the trailer to the module. To use this encoding, the application must be able to convert user-supplied version data into 26-bit numbers, as dictated by the PNV field. In a preferred embodiment, the transformation from a custom versioning scheme to a 26-bit integer is accomplished as follows:
The 26-bit field for PNV enables the application to handle PNVs that have values of up to 67,108,863 (226−1). It is well within the ability of those with ordinary skill in the art to modify the above-described method—including by providing a field for PNV with more than 26 bits—to handle a PNV with an even greater value.
Once the module is received by a network element and the trailer is removed and analyzed, the rule engine on the target will execute the steps described in
To begin reading from the ith SCT, move the pointer as follows:
For each SCT:
d. Read the req variable (
result = (lpnv == pnv);
result = (lpnv!= pnv);
result = (lpnv < pnv);
result = (lpnv <= pnv);
result = (lpnv > pnv);
result = (lpnv >= pnv);
While various embodiments of the present invention have been described above, it should be understood that they have been presented by way of example only, and not limitation. For example, the location and size of the various data fields within the data trailer and SCT of the depicted embodiment are merely exemplary and do not limit the scope of the invention. It is also to be understood, of course, that the present invention in various embodiments can be implemented in hardware, software, or in combinations of hardware and software. As such, the breadth and scope of the present invention should not be limited to any of the above-described exemplary embodiments, but should be defined only in accordance with the following claims and their equivalents.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5832275||Jun 4, 1997||Nov 3, 1998||Novell, Inc.||System for dynamically replacing operating software which provides distributed directory service after verifying that versions of new software and the operating software are compatible|
|US5867714||Oct 31, 1996||Feb 2, 1999||Ncr Corporation||System and method for distributing configuration-dependent software revisions to a computer system|
|US5901320 *||May 13, 1997||May 4, 1999||Fujitsu Limited||Communication system configured to enhance system reliability using special program version management|
|US6247128 *||Apr 30, 1998||Jun 12, 2001||Compaq Computer Corporation||Computer manufacturing with smart configuration methods|
|US6286051 *||Nov 12, 1997||Sep 4, 2001||International Business Machines Corporation||Method and apparatus for extending a java archive file|
|US6341373||Dec 1, 2000||Jan 22, 2002||Liberate Technologies||Secure data downloading, recovery and upgrading|
|US6550057 *||Aug 31, 1999||Apr 15, 2003||Accenture Llp||Piecemeal retrieval in an information services patterns environment|
|US6557100 *||Oct 21, 1999||Apr 29, 2003||International Business Machines Corporation||Fastpath redeployment of EJBs|
|US6802054 *||Aug 9, 2001||Oct 5, 2004||International Business Machines Corporation||Generation of runtime execution traces of applications and associated problem determination|
|US7222341 *||Feb 8, 2002||May 22, 2007||Microsoft Corporation||Method and system for processing software dependencies in management of software packages|
|US20020021307 *||Apr 23, 2001||Feb 21, 2002||Steve Glenn||Method and apparatus for utilizing online presence information|
|US20020073415||Nov 20, 2001||Jun 13, 2002||Kim In-Soo||System and method for upgrading device driver|
|US20020087962||Dec 29, 2000||Jul 4, 2002||Hudson Charles A.||System and process for migrating enhancements to a system|
|US20020104080 *||May 10, 2001||Aug 1, 2002||Virtual Access Networks, Inc.||Server based extraction, transfer, storage and processing of remote settings, files and data|
|US20020144248 *||Feb 8, 2002||Oct 3, 2002||Microsoft Corporation||Software package management|
|US20030051026 *||Jan 19, 2001||Mar 13, 2003||Carter Ernst B.||Network surveillance and security system|
|US20040015952 *||Apr 18, 2002||Jan 22, 2004||Domosys Corporation||Method of remotely upgrading firmware in field-deployed devices|
|US20040034686 *||Aug 19, 2003||Feb 19, 2004||David Guthrie||System and method for delivering targeted data to a subscriber base via a computer network|
|1||Building Custom Rule Engines; (originally published in PC AI magazine, vol. 10, No. 2 Mar./Apr. 1996) pp. 1-12.|
|2||Encoder-SRS Home/Front Page/Monthly Issue/Index; Motorola's S-Record; pp. 1-3; http://www.seattlerobotics.org/encoder/jun99/dougl.html.|
|3||IEE/ACM Transactions on Networking. vol. 6, No. 5, Oct. 1998; Performance of Checksums and CRC's over Real Data; 1063-6692/98$10.00 (C) 1998 IEEE.|
|4||International Standard; ISO/IEC 3309, Fifth edition Dec. 15, 1993; Information technology-Telecommunications and information exchange between systems-High-level data link control (HDLC) procedures-Frame structure; pp. ii-iv; 1-8.|
|5||Library of Congress Cataloging in Publication Data; Tanenbaum, Andrew S. 1944-; Computer networks/Andrew S. Tanenbaum-3rd ed. p. cm.; pp. 182, 187, 188, 189, 190, 191.|
|6||Notification of Transmittal of the International Search Report or the Declaration (from PCT counterpart application) dated Sep. 5, 2002.|
|7||Telcordia Technologies; Performance from Experience; Application of Software management OSI Information Model to Software Download and Memory Restoration; Issue 3, Nov. 1999; pp. 2-1-2-4; 3-1-3-4.|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7478386 *||May 3, 2005||Jan 13, 2009||International Business Machines Corporation||Resource-conservative installation of compressed archives|
|US7624377||Jan 4, 2005||Nov 24, 2009||Sap Ag||Methods relating to configuration of software|
|US7941795 *||May 7, 2004||May 10, 2011||Herman Becker Automotive Systems Gmbh||System for updating and outputting speech data|
|US8180724 *||Nov 17, 2008||May 15, 2012||Zenprise, Inc.||Systems and methods for encoding knowledge for automated management of software application deployments|
|US8234485 *||Jan 4, 2005||Jul 31, 2012||Sap Ag||Method relating to rule-regulated software configuration|
|US8332719||Jul 23, 2008||Dec 11, 2012||Lg Electronics Inc.||Error detection code generating method and error detection code generator|
|US8418024 *||Jul 23, 2008||Apr 9, 2013||Lg Electronics Inc.||Error detection code generating method and error detection code generator|
|US8755522||Aug 16, 2013||Jun 17, 2014||Luminal, Inc.||System and method for interleaving information into slices of a data packet, differentially encrypting the slices, and obfuscating information in the data packet|
|US8819836||Aug 16, 2013||Aug 26, 2014||Luminal, Inc.||System and method for limiting exploitable of potentially exploitable sub-components in software components|
|US8832679 *||Aug 28, 2007||Sep 9, 2014||Red Hat, Inc.||Registration process for determining compatibility with 32-bit or 64-bit software|
|US8993943||Oct 19, 2011||Mar 31, 2015||Trumpf Huettinger Gmbh + Co. Kg||Systems for operating multiple plasma and/or induction heating systems and related methods|
|US9003372 *||Aug 16, 2013||Apr 7, 2015||Luminal, Inc.||System and method for replacing software components with corresponding known-good software components without regard to whether the software components have been compromised or potentially compromised|
|US9003525||Aug 25, 2014||Apr 7, 2015||Luminal, Inc.||System and method for limiting exploitable or potentially exploitable sub-components in software components|
|US9014373||Jun 16, 2014||Apr 21, 2015||Luminal, Inc.||System and method for interleaving information into slices of a data packet, differentially encrypting the slices, and obfuscating information in the data packet|
|US9032390 *||Dec 23, 2008||May 12, 2015||Qualcomm Incorporated||Framework versioning|
|US20050010420 *||May 7, 2004||Jan 13, 2005||Lars Russlies||Speech output system|
|US20060155891 *||Jan 4, 2005||Jul 13, 2006||Yuh-Cherng Wu||Method relating to rule-regulated software configuration|
|US20060155909 *||Jan 4, 2005||Jul 13, 2006||Yuh-Cherng Wu||Methods relating to configuration of software|
|US20060253631 *||May 3, 2005||Nov 9, 2006||International Business Machines Corporation||System/tool for resource-conservative installation of compressed archives|
|US20080282131 *||Jul 23, 2008||Nov 13, 2008||Lg Electronics Inc.||Error detection code generating method and error detection code generator|
|US20080282137 *||Jul 23, 2008||Nov 13, 2008||Lg Electronics Inc.||Error detection code generating method and error detection code generator|
|US20090064132 *||Aug 28, 2007||Mar 5, 2009||Red Hat, Inc.||Registration process for determining compatibility with 32-bit or 64-bit software|
|US20090064133 *||Aug 28, 2007||Mar 5, 2009||Red Hat, Inc.||Provisioning for 32-bit or 64-bit systems|
|US20100162229 *||Dec 23, 2008||Jun 24, 2010||Palm, Inc.||Framework versioning|
|US20130254621 *||Mar 25, 2013||Sep 26, 2013||Lg Electronics Inc.||Error detection code generating method and error detection code generator|
|U.S. Classification||717/178, 717/168, 717/173, 717/174, 717/177, 717/172|
|International Classification||G06F9/445, G06F11/14|
|Cooperative Classification||G06F11/1433, G06F8/61|
|Aug 22, 2002||AS||Assignment|
Owner name: TELLABS OPERATIONS, INC., ILLINOIS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:FISHER, MATTHEW D.;REEL/FRAME:013212/0786
Effective date: 20020812
|Mar 30, 2011||FPAY||Fee payment|
Year of fee payment: 4
|Dec 6, 2013||AS||Assignment|
Owner name: CERBERUS BUSINESS FINANCE, LLC, AS COLLATERAL AGEN
Free format text: SECURITY AGREEMENT;ASSIGNORS:TELLABS OPERATIONS, INC.;TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.);WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.);REEL/FRAME:031768/0155
Effective date: 20131203
|Nov 26, 2014||AS||Assignment|
Owner name: TELECOM HOLDING PARENT LLC, CALIFORNIA
Free format text: ASSIGNMENT FOR SECURITY - - PATENTS;ASSIGNORS:CORIANT OPERATIONS, INC.;TELLABS RESTON, LLC (FORMERLY KNOWN AS TELLABS RESTON, INC.);WICHORUS, LLC (FORMERLY KNOWN AS WICHORUS, INC.);REEL/FRAME:034484/0740
Effective date: 20141126
|Sep 9, 2015||FPAY||Fee payment|
Year of fee payment: 8