Patent application number | Description | Published |
20100209099 | Network Restoration Under Link or Node Failure Using Preconfigured Virtual Cycles - The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks. | 08-19-2010 |
20110185229 | FAULT DIAGNOSIS EMPLOYING PROBABILISTIC MODELS AND STATISTICAL LEARNING - A computer implemented fault diagnosis method employing both probabilistic models and statistical learning that diagnoses faults using probabilities and time windows learned during the actual operation of a system being monitored. In a preferred embodiment, the method maintains for each possible root cause fault an a-priori probability that the fault will appear in a time window of specified length as well as maintaining—for each possible resulting symptom(s)—probabilities that the symptom(s) will appear in a time window containing the fault and probabilities that the alarm will not appear in a time window containing the fault. Consequently, the method according to the present invention may advantageously determine—at any time—the probability that a fault has occurred, and report faults which are sufficiently likely to have occurred. These probabilities are updated based upon past time windows in which we have determined fault(s) and their cause(s). Advantageously, each root cause fault may be assigned its own time window length. By maintaining these probability parameters for several different window lengths, a window length that is particularly well-suited to a particular set of conditions may be chosen. | 07-28-2011 |
20120328282 | Network Restoration Under Link or Node Failure Using Preconfigured Virtual Cycles - The design of telecommunication networks is such that there is provision of end-to-end path protection to multiple demands under a single link or node failure in the networks. Restoration routes are provided on Preconfigured Virtual Cycles (PVC's), where each demand is assigned one restoration route and specific restoration wavelengths on a segment of one cycle. Multiple demands may share restoration wavelengths, and the number of restoration wavelengths may vary among the PVC links. First, a plurality of candidate PVC's are generated where each demand may be assigned to multiple candidates. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PVC. Next, a set of PVC's is selected from among the candidates, while minimizing total reserved restoration capacity and ensuring that all demands are protected. Next duplicate assignments are eliminated. Finally, conflicts of wavelength assignments are resolved. The invention focuses primarily on optical networks. | 12-27-2012 |
Patent application number | Description | Published |
20100192013 | System and Method for Automated Distributed Diagnostics for Networks - A method for distributed computations for fault-diagnosis in a system whose fault propagation model has deterministic couplings between faults and symptoms includes creating a ‘relation graph’ in which the nodes correspond to the potential faults, with two nodes connected by a ‘relational link’ if their corresponding faults have an observed symptom in common. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms. In each domain, all the optimal local solutions to the domain's sub-problem are first determined, and then a combination is selected of the local solutions, one from each domain, that explains the maximum number of cross-domain symptoms, where the optimal solution is supplemented, if necessary, with additional faults to explain any remaining unexplained cross-domain symptoms, determining also a bound on the deviation from optimality of the global solution. | 07-29-2010 |
20110064404 | Network Restoration Under Dual Failures Using Path Protecting Preconfigured Cycles - The design of optical telecommunication networks is such that there is provision of end-to-end path restoration to specified demands under up to two links or nodes failures. Restoration routes are provided on Path Protecting Preconfigured Cycles (PP-PCs), where each demand is assigned one or two restoration routes and restoration wavelengths on a segment of one cycle. Splitting of demand across multiple restoration routes is not allowed. All restoration routes and restoration wavelengths are predetermined where multiple demands may share restoration wavelengths without resorting to intermediate switching or wavelength conversions along restoration routes. First, numerous candidate PP-PCs are generated. Assignment of demands with common failure scenarios are allowed, under certain conditions, to the same PP-PC. Next, a set of PP-PCs is selected from among the candidates, while minimizing total reserved restoration wavelengths cost and ensuring that all demands are protected as required. Finally, conflicts of wavelength assignments are resolved. | 03-17-2011 |
20130055020 | Method for Automated Distributed Diagnostics for Networks - A method for distributed computations for fault-diagnosis in a system whose fault propagation model has deterministic couplings between faults and symptoms includes creating a ‘relation graph’ in which the nodes correspond to the potential faults, with two nodes connected by a ‘relational link’ if their corresponding faults have an observed symptom in common. Each relational link is assigned a weight equal to the sum, taken over the symptoms represented by the relational link, of the reciprocal of the number of distinct fault-pairs that produce each such symptom. The relation graph is then partitioned into several domains, while minimizing the number of cross-domain relational links, which correspond to cross-domain symptoms. In each domain, all the optimal local solutions to the domain's sub-problem are first determined, and then a combination is selected of the local solutions, one from each domain, that explains the maximum number of cross-domain symptoms, where the optimal solution is supplemented, if necessary, with additional faults to explain any remaining unexplained cross-domain symptoms, determining also a bound on the deviation from optimality of the global solution. | 02-28-2013 |
20140006093 | Method for Systematic Modeling and Evaluation of Application Flows | 01-02-2014 |
Patent application number | Description | Published |
20120304073 | Web Browser with Quick Site Access User Interface - Various embodiments provide a unified and organized Web browser navigational experience that draws potential navigable pages from multiple different sources and presents the pages in an easily-explorable user interface. Presentation of these potentially navigable pages occurs automatically, in a contextually relevant manner, based upon an implied user intent to navigate away from a current page. | 11-29-2012 |
20120304081 | Navigation User Interface in Support of Page-Focused, Touch- or Gesture-based Browsing Experience - Various embodiments provide a web browser user interface that permits users to become more fully immersed in web page content that is displayed by a web browser. The inventive approach emphasizes a “content-over-chrome” approach by providing a navigation user interface model that contextually adapts and modifies the navigation user interface based on a particular current user task. In one or more embodiments, locational modifications are made to place various browser instrumentalities, e.g. navigation instrumentalities, in locations that are selected to enhance the user experience by enabling the user to focus more easily on content-relevant portions of the display screen or device. | 11-29-2012 |
20140359519 | Determination of Intended Navigation Destination Based on User-Generated and Analysis-Based Information - Various embodiments provide a web platform, e.g., a web browser, which is designed to facilitate user access to websites in a quick and efficient manner. The web platform includes an address bar and, as keystrokes are entered into the address bar, a user interface container is populated with relevant suggestions from a combination of various data sources based on matching character input. Data sources can include a user's browsing history, favorites, and domain suggestions from a remote source, such as a service provider. | 12-04-2014 |