Network spares audit optimization and maintenance systems and methods
Claim Score by NHIP
Abstract
A network spares audit, optimization, and maintenance system and method, including: an application running on a processor of one of (1) a network management system of a network and (2) a logistics management tool external to the network and in communication with the network management system of the network, the application including: a mapping algorithm executed by the application and operable for mapping network elements of one or more networks to spares depots; and a probabilistic risk analysis algorithm executed by the application and operable for utilizing statistical analysis to determine how many and what types of spares are stocked at each spares depot based on inputted conditions; wherein operation and output of the application is dynamically updated based on network configuration information automatically received from the network management system of the network.

Term
6.6 yearsto projected expiry
Projected expiry 17 April 2033, counted from filing; an application has no term until it is granted.
- Priority and filed
- Published
- Today
- Projected expiry
22 claims: 3 independent, 19 dependent
- 1Broadest claimClaim Score 54, average(NHIP)A network spares audit, optimization, and maintenance system, comprising:an application running on a processor of one of (1) a network management system of a network and (2) a logistics management tool external to the network and in communication with the network management system of the network, the application comprising: a mapping algorithm executed by the application and operable for mapping network elements of one or more networks to spares depots;and a probabilistic risk analysis algorithm executed by the application and operable for utilizing statistical analysis to determine how many and what types of spares are stocked at each spares depot based on inputted conditions;wherein operation and output of the application is dynamically updated based on network configuration information automatically received from the network management system of the network.
- 9A network spares audit, optimization, and maintenance method, comprising:providing an application running on a processor of one of (1) a network management system of a network and (2) a logistics management tool external to the network and in communication with the network management system of the network, the application comprising: a mapping algorithm executed by the application and operable for mapping network elements of one or more networks to spares depots;and a probabilistic risk analysis algorithm executed by the application and operable for utilizing statistical analysis to determine how many and what types of spares are stocked at each spares depot based on inputted conditions;wherein operation and output of the application is dynamically updated based on network configuration information automatically received from the network management system of the network.
- 17A network management system of a network, comprising:a network spares audit, optimization, and maintenance application running on an associated processor, the network spares audit, optimization, and maintenance application comprising: a mapping algorithm executed by the application and operable for mapping network elements of one or more networks to spares depots;and a probabilistic risk analysis algorithm executed by the application and operable for utilizing statistical analysis to determine how many and what types of spares are stocked at each spares depot based on inputted conditions;wherein operation and output of the application is dynamically updated based on network configuration information automatically received by the network management system of the network;and wherein the network management system of the network is in communication with a logistics management tool external to the network.
Independent claims3
91 paragraphs in 5 sections, as filed
FIELD OF THE DISCLOSURE
0001The present disclosure relates generally to network systems and methods, such as optical network systems and methods. More specifically, the present disclosure relates to network spares audit, optimization, and maintenance systems and methods.
BACKGROUND OF THE DISCLOSURE
0002Once a network, such as an optical network, is deployed, the maintenance of service availability according to Service Level Agreements (SLAs) necessitates the storage of spare parts at the ready to service deployed parts following faults. However, for large and/or complex networks, the selection of the exact quantities of spares to store at particular depots can be complicated, especially for networks serviced by multiple depots.
0003Further, the assessment of the risk and cost associated with various spares configurations (which is important to align the selection of spares quantities with business objectives and strategies) is currently not available using a single tool. Thus, unreliable estimates and guesswork are required and routinely utilized. However, once risk levels are objectively quantified, informed judgments can be made concerning the trade-offs between the risk of spares depletion and the cost of mitigation.
0004Additionally, the task of assuring the correct levels of spares servicing a dynamic network is human-resource intensive and involves multiple manual procedures. Particularly, the monitoring of a network for changes in the requirements for spares is not presently automated.
0005The state-of-the-art procedure for determining the number of spares to place at each depot is manual and involves the selection of type and quantity of spares to place on an ad-hoc or ‘rule of thumb’ basis. The handling of placing spares for large and/or complex networks is carried out by an individual who may typically spend several weeks acquiring data and still, in the end, resort to guesswork in order to bolster spares holdings. Spares are normally purchased at the time of network build (for example, 3 spares for every 30 parts). However, the network can rapidly change and what may have previously been 30 spares for parts (SFPs) can quickly become more than 300 SFPs within the space of a year. The many individuals involved in the various aspects of providing spares for the network do not usually have a central repository to store data or new pieces of information, and so related information is usually multiple and in generally unknown locations.
0006Referring specifically to <figref idref="DRAWINGS">FIG. 1</figref>, the state-of-the-art procedure <b>10</b> for determining the number of spares to place at each depot typically involves tech support <b>12</b> obtaining network data and network inventory from a Network Management System (NMS) <b>14</b>, service operations <b>16</b> retrieving spares inventory from a Logistics Management Tool (LMT), and an account manager <b>20</b> retrieving contractual obligations <b>22</b>, all of which can take from days to months. This information is then passed to a systems engineer <b>24</b>, who determines Network Element (NE) locations <b>26</b>, maps the NEs to specific spares depots <b>28</b>, creates a spares map algorithm <b>30</b>, and determines the required spares per location per part and determines the present additional parts to order <b>32</b>, all of which can take weeks. The result is a spares analysis report <b>34</b> which is used by service operations <b>36</b> to set the required spares, which information is again passed to the LMT <b>38</b>.
0007The shortcomings of this procedure include the following: there are no procedures in place to know whether SLAs are being kept; there is no way of knowing the actual coverage levels for networks served by multiple depots, therefore estimates are needed; there are too many manual or labor-intensive tasks; due to the durations and resources involved in completing a spares analysis, the process is completed annually and there could be extended periods of non-coverage following network upgrades; interdepartmental communication delays lead to increased analysis times; large manpower is required to complete a single analysis; following just one network upgrade, the whole process must be completed in order to know whether or how many more spares are needed; the notification of network changes for the process of spares management requires additional agreements and communications with the customer; tracking the location of each site requires additional and extensive communication with the customer; the management of important information, such as SLA requirements, spares algorithms, and the mapped location of NEs is difficult; and there are potential levels of spares coverage inconsistencies within large and/or complex networks serviced by multiple depots, as different systems engineers (in charge of different regions) may employ different algorithms.
0008Thus, the state-of-the-art procedure for the monitoring and recommendation of spares requirements is largely manual and especially difficult for large and/or complex networks, where recommendations are the result of rough estimates and best guesses. Moreover the risk associated with particular levels of spares is not currently quantified or even known, which does not facilitate objective business decisionmaking regarding risk versus cost. For complex networks spanning multiple geographies or served by multiple spares depots, the analyses of what type and how many spares to place at particular depots becomes extremely difficult and prone to error. Such work typically spans multiple departments and functions, and is subject to low priority and communication delays. Following network changes, the calculation of the new requirements for network spares does not take place due to the complexity, lack of data, and extreme length of time required. Therefore, shortages in spares holdings are known only when a critical fault (that cannot be serviced by an available spare part) occurs; which can cost the party responsible thousands of dollars in SLA breaches. Further, over a period of several years, the tracking of contractual obligations or special arrangements can become difficult, as the original sales leads, negotiators, and/or systems engineer analyzers of spares may have moved to a different role or left a vendor.
BRIEF SUMMARY OF THE DISCLOSURE
0009The solution of the present disclosure is a Spares Audit, Optimization, and Maintenance Application (SAOMA) that maps network parts to storage depots in order to enable the determination (from Mean Time to Breakdown (MTTB) and Mean Time to Replace (MTTR) data) of the type and quantity of spares to place at specific depots and the level of risk and cost associated with various spares amounts, even for large and/or complex networks, such as optical networks.
0010The SAOMA leverages NMS capabilities to automatically monitor live network data in order to maintain the dynamic requirements for spares. Additionally, the SAOMA can communicate with LMTs to determine, from actual spares holdings, the near real-time risk of depletion of spares, produce Bills of Quantity (BoQs) where there is a deficit from required spares, and recommend spares optimizations for risk mitigation and/or for chosen risk-cost balances. In this regard, the SAOMA can run on a NMS, or can run on a LMT, both of which are in communication.
0011In one exemplary embodiment, the present disclosure provides a network spares audit, optimization, and maintenance system, including: an application running on a processor of one of (1) a network management system of a network and (2) a logistics management tool external to the network and in communication with the network management system of the network, the application including: a mapping algorithm executed by the application and operable for mapping network elements of one or more networks to spares depots; and a probabilistic risk analysis algorithm executed by the application and operable for utilizing statistical analysis to determine how many and what types of spares are stocked at each spares depot based on inputted conditions; wherein operation and output of the application is dynamically updated based on network configuration information automatically received from the network management system of the network. Optionally, mapping the network elements of the one or more networks to the spares depots includes first mapping the network elements of the one or more networks to sites and then mapping the sites to the spares depots. The application retrieves data from the logistics management tool external to the network and compares actual spares levels in the spares depots to required spares levels in the spares depots and flags any discrepancies prior to a fault occurring. The inputted conditions comprise one or more of contractual obligations, customer specified sparing algorithms, risks, risk limits, costs, cost limits, Mean Time to Breakdown data, Mean Time to Replace data, fault data, repair data, service interruption data, and network growth predictions, among other inputted conditions. The application monitors the one or more networks for configuration changes and, if detected, updates its sparing analyses. The network elements of the one or more networks are each mapped to one or more spares depots. The mapping algorithm is further operable for highlighting any network element that is not mapped to a spares depot. The probabilistic risk analysis algorithm is further operable for indicating a confidence interval within which a risk evaluation falls based on a standard deviation of one or more of Mean Time to Breakdown data and Mean Time to Replace data.
0012In another exemplary embodiment, the present disclosure provides a network spares audit, optimization, and maintenance method, including: providing an application running on a processor of one of (1) a network management system of a network and (2) a logistics management tool external to the network and in communication with the network management system of the network, the application including: a mapping algorithm executed by the application and operable for mapping network elements of one or more networks to spares depots; and a probabilistic risk analysis algorithm executed by the application and operable for utilizing statistical analysis to determine how many and what types of spares are stocked at each spares depot based on inputted conditions; wherein operation and output of the application is dynamically updated based on network configuration information automatically received from the network management system of the network. Optionally, mapping the network elements of the one or more networks to the spares depots includes first mapping the network elements of the one or more networks to sites and then mapping the sites to the spares depots. The application retrieves data from the logistics management tool external to the network and compares actual spares levels in the spares depots to required spares levels in the spares depots and flags any discrepancies prior to a fault occurring. The inputted conditions comprise one or more of contractual obligations, customer specified sparing algorithms, risks, risk limits, costs, cost limits, Mean Time to Breakdown data, Mean Time to Replace data, fault data, repair data, service interruption data, and network growth predictions, among other inputted conditions. The application monitors the one or more networks for configuration changes and, if detected, updates its sparing analyses. The network elements of the one or more networks are each mapped to one or more spares depots. The mapping algorithm is further operable for highlighting any network element that is not mapped to a spares depot. The probabilistic risk analysis algorithm is further operable for indicating a confidence interval within which a risk evaluation falls based on a standard deviation of one or more of Mean Time to Breakdown data and Mean Time to Replace data.
0013In a further exemplary embodiment, the present disclosure provides a network management system of a network, including: a network spares audit, optimization, and maintenance application running on an associated processor, the network spares audit, optimization, and maintenance application including: a mapping algorithm executed by the application and operable for mapping network elements of one or more networks to spares depots; and a probabilistic risk analysis algorithm executed by the application and operable for utilizing statistical analysis to determine how many and what types of spares are stocked at each spares depot based on inputted conditions; wherein operation and output of the application is dynamically updated based on network configuration information automatically received by the network management system of the network; and wherein the network management system of the network is in communication with a logistics management tool external to the network. Optionally, mapping the network elements of the one or more networks to the spares depots includes first mapping the network elements of the one or more networks to sites and then mapping the sites to the spares depots. The application retrieves data from the logistics management tool external to the network and compares actual spares levels in the spares depots to required spares levels in the spares depots and flags any discrepancies prior to a fault occurring. The inputted conditions comprise one or more of contractual obligations, customer specified sparing algorithms, risks, risk limits, costs, cost limits, Mean Time to Breakdown data, Mean Time to Replace data, fault data, repair data, service interruption data, and network growth predictions, among other inputted conditions. The application monitors the one or more networks for configuration changes and, if detected, updates its sparing analyses. The network elements of the one or more networks are each mapped to one or more spares depots.
0014It should be noted that, under a vendor managed spares arrangement (where the vendor monitors and manages the customer's spares) the benefits include: <ul id="ul0001" list-style="none"><li id="ul0001-0001" num="0015">reduced spares calculation times (from months to minutes), reduced risk of warehouse depletion;</li><li id="ul0001-0002" num="0016">elimination of manual tasks, reduced workforce demands;</li><li id="ul0001-0003" num="0017">automatic network monitoring and calculation to BoQ generation, more streamlined and efficient business processes;</li><li id="ul0001-0004" num="0018">active notification of new spares requirements and automatic real-time assessments of risk, reduced possibility of SLA breach;</li><li id="ul0001-0005" num="0019">all relevant information is accessible from single location, reduced staff training time and cost, faster access for objective decision making;</li><li id="ul0001-0006" num="0020">repeatability, possible to quickly repeat analyses;</li><li id="ul0001-0007" num="0021">mapping of spares to storage sites—handles complexities for large and/or complex networks;</li><li id="ul0001-0008" num="0022">user assistance to handle whole process, staff turnover survivability; and</li><li id="ul0001-0009" num="0023">accuracy and consistency of analyses over whole network (especially a large network).</li></ul>
0024However, under a non-vendor managed spares arrangement, where a customer is responsible for managing their own spares, the SAOMA can be licensed to the customer so that the customer receives all the above benefits. The benefit in this case to the vendor is: <ul id="ul0002" list-style="none"><li id="ul0002-0001" num="0025">new revenue streams,</li><li id="ul0002-0002" num="0026">improved reputation, credibility, brand, image; and</li><li id="ul0002-0003" num="0027">larger portfolio of solutions.</li></ul>
BRIEF DESCRIPTION OF THE DRAWINGS
0028The present disclosure is illustrated and described herein with reference to the various drawings, in which like reference numbers are used to denote like system components/method steps, as appropriate, and in which:
0029<figref idref="DRAWINGS">FIG. 1</figref> is a schematic diagram illustrating a conventional spares requirement calculation process;
0030<figref idref="DRAWINGS">FIG. 2</figref> is a schematic diagram illustrating one exemplary embodiment of the spares requirement calculation process of the present disclosure, utilizing the SAOMA;
0031<figref idref="DRAWINGS">FIG. 3</figref> is a schematic diagram illustrating one exemplary embodiment of a spares mapping process of the present disclosure, utilizing the SAOMA;
0032<figref idref="DRAWINGS">FIG. 4</figref> is a plot of storage spares versus risk of critical failures generated utilizing the SAOMA;
0033<figref idref="DRAWINGS">FIG. 5</figref> is a plot of risk versus number of spares for a network part with an arbitrary 5-year MTTB.
DETAILED DESCRIPTION OF THE DISCLOSURE
0034Referring specifically to <figref idref="DRAWINGS">FIG. 2</figref>, the procedure <b>50</b> for determining the number of spares to place at each depot of the present disclosure utilizes the SAOMA <b>52</b> operating on a NMS, or, optionally, operating on a LMT in communication with the NMS. The SAOMA <b>52</b> determines the required spares per spares depot site per part based on a Network Inventory and Spares Algorithm (NISA) <b>54</b>, as described in greater detail herein below. The NISA utilizes data regarding the mapping of the NEs to spares depot sites <b>56</b> and a spares algorithm and SLA requirements data <b>58</b>. The output is a spares analysis report <b>60</b> that is utilized by service operations <b>62</b> to specify required spares <b>64</b>. The required spares per spares depot site per part <b>66</b> is then utilized by the LMT.
0035The SAOMA <b>52</b> automates the calculation of spares requirements based on preconfigured preferences. The SAOMA <b>52</b> also considers the risk of spares depletion associated with each type of part at each depot using the formula:
0000<maths id="MATH-US-00001" num="00001"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><mi>Z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>,</mo><mi>S</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><mn>1</mn><mo>-</mo><mrow><munderover><mo>∏</mo><mrow><mi>s</mi><mo>=</mo><mn>1</mn></mrow><mi>S</mi></munderover><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><mi>Z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow></mrow><mo>)</mo></mrow></mrow></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></maths>
0000This allows for the known reliability or risk of selections.
0036The SAOMA <b>52</b> allows for NEs to be mapped to particular spares depots. The calculation of the number of spares required can then be automatically carried out via a user-approved algorithm to handle the complexity of large or geographically diverse networks and to reduce the chance of human error on the calculations.
0037The SAOMA <b>52</b> monitors live network data from the NMS in order to dynamically calculate changes in sparing requirements. Further, the SAOMA <b>52</b> retrieves data from LMTs in order to compare actual holdings with required holdings to flag shortages to a user or recommend optimizations of spares. This avoids notification via critical failures or SLA breaches, for example.
0038The SAOMA <b>52</b> forms a central access point for all relevant information regarding spares holdings. This includes, for example, contractual obligations, customer-specified algorithms, costs, risks, price MTTB and MTTR information, etc. Thus, the loss of information through staff turnover or the like is avoided.
0039An important aspect of the present disclosure is the utilization of a combination of live network data, along with reliability, geographical, logistics, and cost information; and the automation of the related analysis using customizable risk mitigation algorithms to yield optimum risk/cost balance of spares holdings at regional depots.
0040The analysis utilizes a geographical mapping algorithm, coupled with a probabilistic risk analysis algorithm, and leverages network discovery technologies already available on the NMS to gain an accurate picture of the network equipping per site. This data is augmented with manufacturer MTTB data and operator MTTR refinement data to gain a view of the probability of specific failures per site, as well as to assess the risk of warehouse depletion. Data on operator MTTR targets and per fault type repair data is then processed to determine viable spares distance and to identify the amount of equipment each item of spares supports. The solution provides information on the risk of spares exhaustion for each equipment type at each depot and indicates risk aversion through additional equipment. The solution uses equipment price data to provide a view of the cost of risk reduction and proposes an optimum cost balance by evaluating the average cost of MTTR targets being exceeded.
0041The analysis can be extended to account more precisely for the service impact of any failure, so as to provide refinements to the risk figures as the value of services passing through particular sites vary and propose adjustments to the spares holdings to maintain chosen risk levels.
0042The analysis can also be extended to account for live network failures and fault location information to identify the appropriate spares depot for a maintenance crew to either acquire the spare for a necessary repair or to follow up restocking the local exchange after the repair.
0043The analysis can further be extended using predictions related to network growth and service deployments to provide a projection of spares holding requirements to maintain the chosen risk levels associated with ongoing equipment purchases.
0044Again, the solution of the present disclosure can be packaged with planning systems, NMSs, and/or LMTs. It should be noted, however, that a simple LMT is not described. The involvement of LMTs with spares includes tracking the physical movement of spares and potentially monitoring spares at the storage depot. However, such LMTs do not map live network data to depots to determine from MTTB and/or MTTR information and/or the like the number of particular spares at each storage depot required in order to contractually maintain service availability with selected levels of risk, and calculated degrees of certainty. Moreover, the specific use of live network data means that, as the network grows, new requirements (for spares) due to the changed network, can be calculated effectively and efficiently.
0045Likewise, this is not a stocking-level tool that would be used by online retailers, for example. Such tools work on and with a completely different set of parameters. For example, turnover cycles of stock and stock value and storage capacity could be possible parameters. However, in accordance with the systems and methods of the present disclosure, there is live network to monitor, for example, with NE locations mapped to storage depots and possible MTTB rates to consider.
0046Further, this is not a generic sparing functionality that could be provided by a LMT in other industries, such as utilities, manufacturing, rentals, etc. The dynamic nature of the telecommunications industry, and, moreover, the need for high service availability, generates the need for a (responsive) dynamic tool that can monitor large and/or complex networks (with elements potentially spanning multiple geographies, or in remote locations where spares cannot be placed, therefore the need to be mapped to other locations).
0047Still further, this is not a simple extension of the functionality of a network planning tool that could plan for spares based on future planned or predicted network specifications details. The application of the present disclosure involves the real-time monitoring of live network data and requirements in order to dynamically recommend levels of spares in detail. This approach allows for provider flexibility in the deployment of new service equipment and introduction of new technology as a network is actively and automatically monitored for changes in spares requirements to facilitate known (or selected) levels of risk.
0048As described above, the process of the present disclosure is highly automated from beginning to end. Fundamental to this level of automation, is the SAOMA running on or in communication with the vendor's NMS. As shown, the relevant data necessary for the calculation of spares is placed directly on the SAOMA, which then monitors the network for changes and automatically generates the Spares Analysis Report containing the required spares at each storage depot on a per part basis. It is important to note that, once the requirements have been placed onto the SAOMA, the manual tasks for systems engineers, service operations, account management, and tech support are essentially eliminated.
0049Referring to the shortcomings of conventional processes, described above, the process of the present disclosure solves them all: there are no procedures in place to know whether SLAs are being kept (SLAs are used to generate the spares calculation algorithm once, and are then autonomously monitored by the SAOMA for compliance); there is no way of knowing the actual coverage levels for networks served by multiple depots, therefore estimates are needed (NEs are conveniently mapped to particular depots on the SAOMA upon NE addition); there are too many manual or labor-intensive tasks (the SAOMA is automated); due to the durations and resources involved in completing a spares analysis, the process is completed annually and there could be extended periods of non-coverage following network upgrades (calculation times are significantly reduced by the SAOMA); interdepartmental communication delays lead to increased analysis times (all underlying data is readily retrievable through the SAOMA); large manpower is required to complete a single analysis (the SAOMA on the NMS provides complete end-to-end automation of the analysis process); following just one network upgrade, the whole process must be completed in order to know whether or how many more spares are needed (placing the SAOMA on the NMS leverages existing automated link discovery protocols and produces instantaneous notification of and adaptation to changes); the notification of network changes for the process of spares management requires additional agreements and communications with the customer (again, SLAs are used to generate the spares calculation algorithm once, and are then autonomously monitored by the SAOMA for compliance); tracking the location of each site requires additional and extensive communication with the customer (again, all underlying data is readily retrievable through the SAOMA); the management of important information, such as SLA requirements, spares algorithms, and the mapped location of NEs is difficult (again, the SAOMA is automated); and there are potential levels of spares coverage inconsistencies within large and/or complex networks serviced by multiple depots, as different systems engineers (in charge of different regions) may employ different algorithms (the SAOMA provides a centralized, unified, and consistent algorithm for spares calculations). In general, the SAOMA does in minutes what previously took months and teams of people to do.
0050As an example of the systems and methods of the present disclosure, a telecom service provider purchased a 140 node network with 30 types of (spare-able) parts totaling 1000 parts. Spares for the network are stored in 3 geographically separated locations to allow for spares to be transferred from storage to network sites within contractual obligation times. Upon initial network build, 30 spare parts were bought in order to service faults in accordance with a policy of a minimum of 3% spares coverage for each part.
0051Following the network build, the service provider network operations team employs the SAOMA. Referring specifically to <figref idref="DRAWINGS">FIG. 3</figref>, the SAOMA allows for NEs <b>80</b> to be grouped to sites <b>82</b> (1) and mapped to particular spares depots <b>84</b>. Once each NE <b>80</b> is mapped, all parts within the NE <b>80</b> can automatically be assigned to each depot <b>84</b>. The allocation of NEs <b>80</b> can be conducted automatically on a geographical basis <b>86</b> or can be user-specified. For greater flexibility, to optimize spares quantities at each depot <b>84</b>, each NE part <b>88</b> or site <b>82</b> can be mapped to multiple storage depots <b>84</b> (2) and parts within NEs <b>80</b> can be mapped to different depots <b>84</b>.
0052The mapping process <b>90</b> produces a list of part codes and quantities for each storage depot <b>84</b> to be considered for spares. The service provider network operations team then specifies the algorithm to determine spares, which could be (but is not limited to) one of the following: <ul id="ul0003" list-style="none"><li id="ul0003-0001" num="0053">spares determined based on a fixed and/or percentage basis;</li><li id="ul0003-0002" num="0054">based on a probability and/or risk management basis;</li><li id="ul0003-0003" num="0055">based on MTTB, MTTR, and/or MTBF; and/or</li><li id="ul0003-0004" num="0056">algorithms could also be implemented in bands (1-3:1, 4-10:1+5%, >11:1+4%, etc.)</li></ul>
0057In the present example, the policy requires a minimum of 3% spares, therefore a percentage of 3 with minimum of 1 spare for parts could be used.
0058Once the spares level is chosen for each part, the SAOMA then calculates certain performance statistics, such as the probability or risk of critical or unserviceable faults (where failed parts are unable to be replaced by available spares). For each part in the network, the risk that a critical number of part failures mapped to the spares depot can be given as:
0000<maths id="MATH-US-00002" num="00002"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo>,</mo><msub><mi>N</mi><mi>p</mi></msub><mo>,</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><munderover><mo>∑</mo><mrow><mi>x</mi><mo>=</mo><msub><mi>x</mi><mi>crit</mi></msub></mrow><msub><mi>N</mi><mi>p</mi></msub></munderover><mo></mo><mrow><msup><mrow><mo>(</mo><mrow><msub><mi>P</mi><mi>R</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow><mo>)</mo></mrow><mi>x</mi></msup><mo>×</mo><msup><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>R</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow></mrow><mo>)</mo></mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow></msup><mo>×</mo><mfrac><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>!</mo></mrow><mrow><mrow><mi>x</mi><mo>!</mo></mrow><mo></mo><mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow><mo>!</mo></mrow></mrow></mfrac></mrow></mrow></mrow></math></maths>
0000where X<sub>crit</sub>—is 1 plus the number of spares in holding; <br /> N<sub>p</sub>—is the number of parts considered; <br /> P<sub>F</sub><img file="US2014098677A1_D0001.tif" />0|T<sub>R</sub><img file="US2014098677A1_D0002.tif" />—is the probability of failure of a part within the specified time period; and <br /> T<sub>R</sub>—is the mean time to replace.
0059This can calculated for S depots with z(s) types of parts mapped as:
0000<maths id="MATH-US-00003" num="00003"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>N</mi><mi>P</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><mi>Z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>,</mo><mi>S</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><mn>1</mn><mo>-</mo><mrow><munderover><mo>∏</mo><mrow><mi>s</mi><mo>=</mo><mn>1</mn></mrow><mi>S</mi></munderover><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>N</mi><mi>P</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><mi>Z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow></mrow><mo>)</mo></mrow></mrow></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></maths>
0000This is the risk of critical failures across the whole network.
0060Based on these calculations, the service provider network operations team would then decide whether more spares are needed for various part types (perhaps with faster MTTBs or longer MTTRs), in addition to the policy minimum requirement of 3%.
0061The SAOMA, resident in the NMS, would directly connect to the LMT used by a service provider to retrieve information regarding the actual number of spares held at each storage site for the network. Once the information is analyzed, the tool would then flag shortages of spares and possibly excess spares and produce a bill of materials for the shortages and recommend optimization (i.e. the shifting of spares) where there may be excess (which could be done with respect to risk and/or cost mitigation).
0062As the network grows (i.e. parts are added), the likelihood of faults increases and, vice versa, as parts are taken out, the likelihood of faults decreases. Therefore, the SAOMA would monitor the service provider's network for changes and automatically calculate new spares requirements. Once changes to the spares requirements occur, the SAOMA would notify the service provider network operations team to initiate the process of acquiring more spares. A bill of materials or purchase orders could also be produced automatically and sent to the service provider's supplier(s). Should storage sites change, the tool would be able to accommodate for this by allowing the easy transfer of mapped parts to whichever site is available.
0063Empirical data related to live network data is captured to fine tune performance evaluations, where the average and standard deviation of the following types of data can be improved: <ul id="ul0004" list-style="none"><li id="ul0004-0001" num="0064">Mean Time To Breakdown;</li><li id="ul0004-0002" num="0065">Mean Time To Repair; and/or</li><li id="ul0004-0003" num="0066">Mean Time To Replace Spares at spares depots, etc.</li></ul>
0067In terms of derivations, the probability of x failures of N<sub>p </sub>parts is given by:
0000<maths id="MATH-US-00004" num="00004"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>x</mi><mo>,</mo><msub><mi>N</mi><mi>p</mi></msub></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><msubsup><mi>P</mi><mi>p</mi><mi>x</mi></msubsup><mo>×</mo><msup><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><msub><mi>P</mi><mi>F</mi></msub></mrow><mo>)</mo></mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow></msup><mo>×</mo><mfrac><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>!</mo></mrow><mrow><mrow><mi>x</mi><mo>!</mo></mrow><mo></mo><mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow><mo>!</mo></mrow></mrow></mfrac></mrow></mrow></math></maths>
0000where P<sub>F </sub>is the probability of failure of a single part; and the failure rate is assumed to be equal for all N<sub>p </sub>parts.
0068The probability of failure, P<sub>F</sub>, of a single part can be calculated from part failure rates, R<sub>F</sub>, which can be estimated from MTTB (T<sub>B</sub>) using:
0000<maths id="MATH-US-00005" num="00005"><math overflow="scroll"><mrow><msub><mi>R</mi><mi>F</mi></msub><mo>=</mo><mfrac><mn>1</mn><mrow><mn>2</mn><mo></mo><msub><mi>T</mi><mi>B</mi></msub></mrow></mfrac></mrow></math></maths>
0000(because over the period of time T<sub>B</sub>, it is expected that 50% of the parts would have failed).
0069Therefore, the number of failures expected over a time period T is given by:
0000<br /><i>n</i><sub>F</sub><img file="US2014098677A1_D0003.tif" />0<i>|T</i><img file="US2014098677A1_D0004.tif" />=cell{<i>T×R</i><sub>F</sub><i>×N</i><sub>p</sub>}
0000(provided that a consistent unit of time is used for all variables) and the probability of a failure of an individual part over a period of time T can be estimated as:
0000<br /><i>P</i><sub>F</sub><img file="US2014098677A1_D0005.tif" />0|<i>T</i><img file="US2014098677A1_D0006.tif" /><i>=T×R</i><sub>F</sub>
0000where N<sub>p</sub>=1 and T<=2T<sub>B</sub>, or for multiple parts, T<2N<sub>p</sub>T<sub>B</sub>.
0070Therefore, the probability of x failures of N<sub>p </sub>parts over a given period of time T (or <0|T>) is given by:
0000<maths id="MATH-US-00006" num="00006"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>x</mi><mo>,</mo><msub><mi>N</mi><mi>p</mi></msub><mo>,</mo><mi>T</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><msup><mrow><mo>(</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><mi>T</mi></mrow><mo>〉</mo></mrow></mrow><mo>)</mo></mrow><mi>x</mi></msup><mo>×</mo><msup><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><mi>T</mi></mrow><mo>〉</mo></mrow></mrow></mrow><mo>)</mo></mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow></msup><mo>×</mo><mfrac><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>!</mo></mrow><mrow><mrow><mi>x</mi><mo>!</mo></mrow><mo></mo><mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow><mo>!</mo></mrow></mrow></mfrac></mrow></mrow></math></maths>
0000where P<sub>F </sub>lies strictly between 0 and 1 and can be approximated as P<sub>F</sub>=T/2 T<sub>B</sub>. For P<sub>F </sub>approximation considerations for greater time periods these equations may be extended, as described in greater detail herein below.
0071If n parts are held in storage, then should n part failures occur within the mean time to replace T<sub>R </sub>spares at the storage depot, then the depot would be depleted of spares, and should an additional part failure occur (i.e. n+1 in total), there would be no more spares available to service the fault. Therefore, the critical number of faults can be defined as x<sub>crit</sub>=n+1.
0072Therefore, the probability of at least the critical number of faults occurring within the mean time to replace, T<sub>R</sub>, can be given as:
0000<maths id="MATH-US-00007" num="00007"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo>,</mo><msub><mi>N</mi><mi>p</mi></msub><mo>,</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><munderover><mo>∑</mo><mrow><mi>x</mi><mo>=</mo><msub><mi>x</mi><mi>crit</mi></msub></mrow><msub><mi>N</mi><mi>p</mi></msub></munderover><mo></mo><mrow><msup><mrow><mo>(</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow><mo>)</mo></mrow><mi>x</mi></msup><mo>×</mo><msup><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow></mrow><mo>)</mo></mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow></msup><mo>×</mo><mfrac><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>!</mo></mrow><mrow><mrow><mi>x</mi><mo>!</mo></mrow><mo></mo><mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow><mo>!</mo></mrow></mrow></mfrac></mrow></mrow></mrow></math></maths>
0000where the probability of a part failure is given for a certain time period, T<sub>R</sub>, as:
0000<maths id="MATH-US-00008" num="00008"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow><mo>=</mo><mrow><mrow><msub><mi>T</mi><mi>R</mi></msub><mo>×</mo><msub><mi>R</mi><mi>F</mi></msub></mrow><mo>=</mo><mfrac><msub><mi>T</mi><mi>R</mi></msub><mrow><mn>2</mn><mo></mo><msub><mi>T</mi><mi>B</mi></msub></mrow></mfrac></mrow></mrow></math></maths>
0000or, alternatively
0000<maths id="MATH-US-00009" num="00009"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo>,</mo><msub><mi>N</mi><mi>p</mi></msub><mo>,</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><munderover><mo>∑</mo><mrow><mi>x</mi><mo>=</mo><mn>0</mn></mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo>-</mo><mn>1</mn></mrow></munderover><mo></mo><mrow><mo>(</mo><mrow><msup><mrow><mo>(</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow><mo>)</mo></mrow><mi>x</mi></msup><mo>×</mo><msup><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow></mrow><mo>)</mo></mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow></msup><mo>×</mo><mfrac><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>!</mo></mrow><mrow><mrow><mi>x</mi><mo>!</mo></mrow><mo></mo><mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow><mo>!</mo></mrow></mrow></mfrac></mrow><mo>)</mo></mrow></mrow></mrow></math></maths>
0000which offers faster convergence through the summation over a smaller range.
0073For Z types of parts in the network mapped to a single storage depot, the probability of at least one critical failure can be calculated as:
0000<maths id="MATH-US-00010" num="00010"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow><mo>,</mo><mi>Z</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><mn>1</mn><mo>-</mo><mrow><munderover><mo>∏</mo><mrow><mi>s</mi><mo>=</mo><mn>1</mn></mrow><mi>S</mi></munderover><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><munderover><mo>∑</mo><mrow><mi>x</mi><mo>=</mo><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow></mrow><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow></munderover><mo></mo><mrow><msup><mrow><mo>(</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow></mrow><mo>〉</mo></mrow></mrow><mo>)</mo></mrow><mi>x</mi></msup><mo>×</mo><msup><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow></mrow><mo>〉</mo></mrow></mrow></mrow><mo>)</mo></mrow><mrow><mo>(</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo>-</mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow></msup><mo>×</mo><mfrac><mrow><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow><mo>!</mo></mrow><mrow><mrow><mi>x</mi><mo>!</mo></mrow><mo></mo><mrow><mrow><mo>(</mo><mrow><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mi>z</mi><mo>)</mo></mrow></mrow><mo>-</mo><mi>x</mi></mrow><mo>)</mo></mrow><mo>!</mo></mrow></mrow></mfrac></mrow></mrow></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></maths>
0074Therefore, for S storage depots, with Z(s) types of network parts mapped to each, the probability of critical part failure for the whole network can be given by:
0000<maths id="MATH-US-00011" num="00011"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><mi>Z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>,</mo><mi>S</mi></mrow><mo>)</mo></mrow></mrow><mo>=</mo><mrow><mn>1</mn><mo>-</mo><mrow><munderover><mo>∏</mo><mrow><mi>s</mi><mo>=</mo><mn>1</mn></mrow><mi>S</mi></munderover><mo></mo><mstyle><mspace width="0.3em" height="0.3ex" /></mstyle><mo></mo><mrow><mo>(</mo><mrow><mn>1</mn><mo>-</mo><mrow><msub><mi>P</mi><mi>r</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mrow><msub><mi>x</mi><mi>crit</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>N</mi><mi>p</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo></mo><mrow><mo>(</mo><mrow><mi>z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow><mo>)</mo></mrow></mrow><mo>,</mo><mrow><mi>Z</mi><mo></mo><mrow><mo>(</mo><mi>s</mi><mo>)</mo></mrow></mrow></mrow><mo>)</mo></mrow></mrow></mrow><mo>)</mo></mrow></mrow></mrow></mrow></math></maths>
0000which represents a reliable risk figure of critical failure over the whole network.
0075The equation can be extended to include or consider the possibility of multiple sets of x<sub>crit </sub>failures over a given period of time, or the possibility of multiple failures of a single part within the given time period. Further equation extensions could consider the risk (probability figure) of failure over multiple separate networks. Also, the probability of failure of a single part can be approximated by the sigmoid function P<sub>F</sub>(x)=1/(1+e<sup>−(ax+b)</sup>) shifted to where P<sub>F</sub>(T<sub>B</sub>)=0.5, where T<sub>B </sub>is the mean time to breakdown. The approach allows the approximation of probabilities of failure for time periods greater than T<sub>B</sub>.
0076Additionally, if the standard deviation, σ<sub>TB</sub>, of T<sub>B</sub>, and the standard deviation, σ<sub>TR</sub>, of T<sub>R </sub>(the equation inputs) are known, then they can be used to implement confidence intervals for a given probability calculation, where for a set of data the probability of the failure of a part over time period T becomes:
0000<maths id="MATH-US-00012" num="00012"><math overflow="scroll"><mrow><mrow><msub><mi>P</mi><mi>F</mi></msub><mo></mo><mrow><mo>〈</mo><mrow><mn>0</mn><mo>|</mo><msub><mi>T</mi><mi>R</mi></msub></mrow><mo>〉</mo></mrow></mrow><mo>=</mo><mfrac><mrow><mo>(</mo><mrow><msub><mi>T</mi><mi>R</mi></msub><mo>±</mo><msub><mi>ϕ</mi><mi>R</mi></msub></mrow><mo>)</mo></mrow><mrow><mn>2</mn><mo>×</mo><mrow><mo>(</mo><mrow><msub><mi>T</mi><mi>B</mi></msub><mo>±</mo><msub><mi>ϕ</mi><mi>B</mi></msub></mrow><mo>)</mo></mrow></mrow></mfrac></mrow></math></maths>
0077For various values of φ<sub>R </sub>and φ<sub>T</sub>, a spread range of probabilities can be determined that lie within a certain range of confidence (i.e. confidence intervals), as illustrated in the table below:
0000<tables id="TABLE-US-00001" num="00001"><table frame="none" colsep="0" rowsep="0"><tgroup align="left" colsep="0" rowsep="0" cols="4"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="56pt" align="left" /><colspec colname="2" colwidth="28pt" align="left" /><colspec colname="3" colwidth="105pt" align="center" /><thead><row><entry /><entry namest="offset" nameend="3" align="center" rowsep="1" /></row><row><entry /><entry>φ<sub>R</sub></entry><entry>φ<sub>B</sub></entry><entry>Confidence/%</entry></row><row><entry /><entry namest="offset" nameend="3" align="center" rowsep="1" /></row></thead><tbody valign="top"><row><entry /></row></tbody></tgroup><tgroup align="left" colsep="0" rowsep="0" cols="4"><colspec colname="offset" colwidth="28pt" align="left" /><colspec colname="1" colwidth="56pt" align="left" /><colspec colname="2" colwidth="28pt" align="left" /><colspec colname="3" colwidth="105pt" align="char" char="." /><tbody valign="top"><row><entry /><entry>σ<sub>TR</sub></entry><entry>σ<sub>TB</sub></entry><entry>68.2</entry></row><row><entry /><entry>2 × σ<sub>TR</sub></entry><entry>2 × σ<sub>TB</sub></entry><entry>95.4</entry></row><row><entry /><entry>3 × σ<sub>TR</sub></entry><entry>3 × σ<sub>TB</sub></entry><entry>99.7</entry></row><row><entry /><entry namest="offset" nameend="3" align="center" rowsep="1" /></row></tbody></tgroup></table></tables>
0078The expected variation of T<sub>R </sub>and T<sub>B </sub>is assumed to be normally distributed.
0079The expected output of storage spares versus risk of critical failures is provided in <figref idref="DRAWINGS">FIG. 4</figref>, where the application of plus or minus φ produces a range of probabilities for each plot. For the case illustrated, φ was selected as 2×σ, implying a 95.5% confidence that the actual probability of critical part failures lies within the ranges calculated.
0080In summary, the SAOMA has the following features, applications, and extensions: <ul id="ul0005" list-style="none"><li id="ul0005-0001" num="0081">Ability to recommend specific numbers of spares for each part code at each spares depot location based on the network size primarily; <ul id="ul0006" list-style="none"><li id="ul0006-0001" num="0082">Mean Time To Breakdown/Repair (MTTB/R);</li><li id="ul0006-0002" num="0083">Virtual capacity limitations of storage sites;</li><li id="ul0006-0003" num="0084">Location of NEs at storage sites;</li><li id="ul0006-0004" num="0085">Desired levels of risk;</li><li id="ul0006-0005" num="0086">1+1, site based, probability distribution based;</li><li id="ul0006-0006" num="0087">Replacement cost of parts to various locations;</li></ul></li><li id="ul0005-0002" num="0088">Ability to automatically detect network changes and recommend new levels of spares requirements;</li><li id="ul0005-0003" num="0089">Ability to notify automatically of changes to spares requirements;</li><li id="ul0005-0004" num="0090">Ability to group NEs in sites and map NEs or sites to Storage depots;</li><li id="ul0005-0005" num="0091">Ability to map NEs to multiple sites. This allows for flexibility to optimize levels of storage in sites;</li><li id="ul0005-0006" num="0092">The ability to map parts within NEs to multiple storage depots;</li><li id="ul0005-0007" num="0093">Ability to limit or assign weights to storage capacity of storage sites;</li><li id="ul0005-0008" num="0094">Ability to automatically map NEs to storage depots (to assist user); <ul id="ul0007" list-style="none"><li id="ul0007-0001" num="0095">based on the following input data; <ul id="ul0008" list-style="none"><li id="ul0008-0001" num="0096">GPS coordinates;</li><li id="ul0008-0002" num="0097">Postcode;</li><li id="ul0008-0003" num="0098">IP address;</li><li id="ul0008-0004" num="0099">City;</li><li id="ul0008-0005" num="0100">Adjacent NEs for estimates;</li></ul></li><li id="ul0007-0002" num="0101">where distanced-based mapping could be considered with virtual distance adjustments from possible; <ul id="ul0009" list-style="none"><li id="ul0009-0001" num="0102">Replacement cost (to boost service efficiency);</li><li id="ul0009-0002" num="0103">Replacement time (to boost network survivability);</li></ul></li></ul></li><li id="ul0005-0009" num="0104">Ability to consider the potential replacement of a part version 1 by the later release of that part version 2, where both parts may be available for spares, and where the replacement of version 2 with version 1 may not be viable/feasible. Even though the replacement for version 1 with version 2 may be viable;</li><li id="ul0005-0010" num="0105">Ability to electronically, systematically, and automatically communicate with logistics management or planning tools in order to; <ul id="ul0010" list-style="none"><li id="ul0010-0001" num="0106">retrieve information on spares and depot sites, for assistance in the mapping process of network sites to spares depots;</li><li id="ul0010-0002" num="0107">transfer or upload specific spares recommendation levels for each part per storage depot;</li><li id="ul0010-0003" num="0108">retrieve information on the number of spares held in each storage depot in order to calculate and flag to the user; <ul id="ul0011" list-style="none"><li id="ul0011-0001" num="0109">Additional spares required;</li><li id="ul0011-0002" num="0110">Excess numbers of spares at depots;</li><li id="ul0011-0003" num="0111">Potential optimization options to redistribute spares based on risk;</li></ul></li><li id="ul0010-0004" num="0112">Generate BoQ's or PO's based on the deficit between the required and actual spares holdings;</li></ul></li><li id="ul0005-0011" num="0113">Ability to rate or assess availability performance (failure survivability) of various levels of spares based on statistical analyses of recommendation spares levels or actual spares levels retrieved from an interoperable logistics management tool, where each assessment could be calculated following a fault or shipment of various parts from each depot;</li><li id="ul0005-0012" num="0114">Ability to assess risk of unserviceable part failures in the whole network, and assign a numerical value for each part;</li><li id="ul0005-0013" num="0115">Ability to assess uncertainty of data in order to determine risk, where uncertainty would rise through lack of information provided to the tool; <ul id="ul0012" list-style="none"><li id="ul0012-0001" num="0116">For example, unknown MTTB/R rates;</li><li id="ul0012-0002" num="0117">Unknown part/NE locations or assigned replacement costs;</li><li id="ul0012-0003" num="0118">Or even intervals between analyses of spares could raise risk analysis uncertainty as the network may have changed since previous analyses; and</li></ul></li><li id="ul0005-0014" num="0119">Ability to extract information from other networks in order to recommend specific spares requirement levels for those networks as well with associated levels of risk, uncertainty, and availability metrics involved, with potential for functionality on a near-real-time basis.</li></ul>
0120<figref idref="DRAWINGS">FIG. 5</figref> is a plot of risk versus number of spares for a network part with an arbitrary 5-year MTTB, as an exemplary result of the systems and methods of the present disclosure.
0121It will be appreciated by those of ordinary skill in the art that some exemplary embodiments described herein may include one or more generic or specialized processors, such as microprocessors, digital signal processors, customized processors, and field programmable gate arrays (FPGAs) and unique stored program instructions (including both software and firmware) that control the one or more processors to implement, in conjunction with certain non-processor circuits, some, most, or all of the functions of the systems and/or methods described herein. Alternatively, some or all functions may be implemented by a state machine that has no stored program instructions, or in one or more application specific integrated circuits (ASICs), in which each function or some combinations of certain of the functions are implemented as custom logic. Of course, a combination of the aforementioned approaches may be used. Moreover, some exemplary embodiments may be implemented as a non-transitory computer-readable storage medium having computer readable code stored thereon for programming a computer, server, appliance, device, etc., each of which may include a processor to perform methods as described and claimed herein. Examples of such computer-readable storage media include, but are not limited to, a hard disk, an optical storage device, a magnetic storage device, a ROM (Read Only Memory), a PROM (Programmable Read Only Memory), an EPROM (Erasable Programmable Read Only Memory), an EEPROM (Electrically Erasable Programmable Read Only Memory), Flash memory, and the like. When stored in the non-transitory computer readable medium, software can include instructions executable by a processor that, in response to such execution, cause a processor or any other circuitry to perform a set of operations, steps, methods, processes, algorithms, etc.
0122Although the present disclosure has been illustrated and described herein with reference to preferred embodiments and specific examples thereof, it will be readily apparent to those of ordinary skill in the art that other embodiments and examples may perform similar functions and/or achieve like results. All such equivalent embodiments and examples are within the spirit and scope of the present disclosure, are contemplated thereby, and are intended to be covered by the following claims.
Contents5
22 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19 Sheet 20 Sheet 21 Sheet 22
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| CN110705726A | Cited by | China | Search report |
| US11277420B2 | Cited by | United States of America | Applicant |
| US11792217B2 | Cited by | United States of America | Applicant |
| US9628340B2 | Cited by | United States of America | Search report |
| CN113676349A | Cited by | China | Search report |
| US2015199629A1 | Cited by | United States of America | Pre-grant |
| US2016337200A1 | Cited by | United States of America | Pre-grant |
| US2015317197A1 | Cited by | United States of America | Pre-grant |
| US9703653B2 | Cited by | United States of America | Search report |
| CN110838925A | Cited by | China | Search report |
| WO2019234297A1 | Cited by | World Intellectual Property Organization (WIPO) | International search |
| US2015261630A1 | Cited by | United States of America | Pre-grant |
| US9721316B2 | Cited by | United States of America | Search report |
| US10057136B2 | Cited by | United States of America | Search report |
| US2003101107A1 | Cites | United States of America | Pre-grant |
| US2005071317A1 | Cites | United States of America | Pre-grant |
| US2007152049A1 | Cites | United States of America | Pre-grant |
| US2009279551A1 | Cites | United States of America | Pre-grant |
2 members in 1 office
Priority claims2
| Document | Office | Kind | Date |
|---|---|---|---|
| 201213647918 | United States of America | A | |
| US201213647918 | – | – | – |
Members2
| Document | Office | Kind | |
|---|---|---|---|
| US2014098677A1 | United States of America | A1 | |
| US9049135B2 | United States of America | B2 |
65 transactions on the USPTO file
Allowed after 1 non-final rejection, 1 final rejection and 1 RCE.
- Non-final rejections
- 1
- Final rejections
- 1
- RCEs
- 1
- Appeals
- 0
Over time
Point at a mark for the transactionTransactions
| Event | Code | |
|---|---|---|
| Payment of Maintenance Fee, 8th Year, Large EntityM1552 | M1552 | |
| Payment of Maintenance Fee, 4th Year, Large EntityM1551 | M1551 | |
| Recordation of Patent Grant MailedPGM/ | PGM/ | |
| Patent Issue Date Used in PTA CalculationAllowedPTAC | PTAC | |
| Email NotificationEML_NTR | EML_NTR | |
| Issue Notification MailedAllowedWPIR | WPIR | |
| Dispatch to FDCD1935 | D1935 | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail Response to 312 Amendment (PTO-271)MN271 | MN271 | |
| Application Is Considered Ready for IssuePILS | PILS | |
| Response to Amendment under Rule 312N271 | N271 | |
| Issue Fee Payment VerifiedN084 | N084 | |
| Issue Fee Payment ReceivedIFEE | IFEE | |
| Amendment after Notice of Allowance (Rule 312)AllowedA.NA | A.NA | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail PUB other miscellaneous communication to applicantMM327-D | MM327-D | |
| PUB Other miscellaneous communication to applicantM327-D | M327-D | |
| Email NotificationEML_NTR | EML_NTR | |
| Filing Receipt - CorrectedFLRCPT.C | FLRCPT.C | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Notice of AllowanceAllowedMN/=. | MN/=. | |
| Notice of Allowance Data Verification CompletedAllowedN/=. | N/=. | |
| Examiner's Amendment CommunicationEX.A | EX.A | |
| Interview Summary - Examiner Initiated - TelephonicEXET | EXET | |
| Interview Summary - Examiner InitiatedEXIE | EXIE | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Disposal for a RCE / CPA / R129AbandonedABN9 | ABN9 | |
| Request for Continued Examination (RCE)RCEX | RCEX | |
| Workflow - Request for RCE - BeginBRCE | BRCE | |
| Email NotificationEML_NTR | EML_NTR | |
| Mail Advisory Action (PTOL - 303)MCTAV | MCTAV | |
| Advisory Action (PTOL-303)CTAV | CTAV | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Final ActionA.NE | A.NE | |
| PILOT- Request for After Final Consideration ProgramRAFC | RAFC | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Final Rejection (PTOL - 326)Final rejectionMCTFR | MCTFR | |
| Final RejectionFinal rejectionCTFR | CTFR | |
| Date Forwarded to ExaminerFWDX | FWDX | |
| Response after Non-Final ActionA... | A... | |
| Electronic ReviewELC_RVW | ELC_RVW | |
| Email NotificationEML_NTF | EML_NTF | |
| Mail Non-Final RejectionNon-final rejectionMCTNF | MCTNF | |
| Non-Final RejectionNon-final rejectionCTNF | CTNF | |
| Information Disclosure Statement consideredIDSC | IDSC | |
| Email NotificationEML_NTR | EML_NTR | |
| PG-Pub Issue NotificationPG-ISSUE | PG-ISSUE | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Case Docketed to Examiner in GAUDOCK | DOCK | |
| Application Dispatched from OIPEOIPE | OIPE | |
| Application Is Now CompleteCOMP | COMP | |
| Email NotificationEML_NTR | EML_NTR | |
| Email NotificationEML_NTR | EML_NTR | |
| Change in Power of Attorney (May Include Associate POA)PA.. | PA.. | |
| Filing ReceiptFLRCPT.O | FLRCPT.O | |
| Sent to Classification ContractorPGPC | PGPC | |
| Cleared by OIPE CSRL194 | L194 | |
| Reference capture on IDSRCAP | RCAP | |
| Information Disclosure Statement (IDS) FiledM844 | M844 | |
| Information Disclosure Statement (IDS) FiledWIDS | WIDS | |
| IFW Scan & PACR Auto Security ReviewSCAN | SCAN | |
| Initial Exam Team nnIEXX | IEXX |
12 legal events, as the office reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | |
|---|---|---|
| AssignmentAS | AS | |
| Maintenance fee paymentMAFP | MAFP | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| Maintenance fee paymentMAFP | MAFP | |
| Information on status: patent grantGrantedPATENTED CASESTCF | STCF | |
| Fee payment procedurePAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITYFEPP | FEPP | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS | |
| AssignmentAS | AS |
Numbers
- Publication
- 20140098677
- Publication, DOCDB
- 2014098677
- Publication, EPODOC
- US2014098677
- Application
- 13647918
- Application, DOCDB
- 201213647918
- Application, EPODOC
- US201213647918
Titles
- English
- NETWORK SPARES AUDIT OPTIMIZATION AND MAINTENANCE SYSTEMS AND METHODS
Patent term adjustment
- A delay
- +198 daysthe office missed an examination deadline
- Applicant delay
- −8 days
- Net adjustment
- 190 days
Classification
- CPC, 3
- H04L41/145
- G06Q10/0875
- H04L41/5019
- IPC, 1
- H04L12 26
- USPC, 1
- 370242000