TL;DR: The authors describe a network management system and illustrates its application to managing a distributed database application on a complex enterprise network.
Abstract: The authors describe a network management system and illustrate its application to managing a distributed database application on a complex enterprise network.
TL;DR: A so-called true concurrency approach, in which no global state and no global time is available, is followed, which uses only local states in combination with a partial order model of time.
Abstract: In this paper, we consider the diagnosis of asynchronous discrete event systems. We follow a so-called true concurrency approach, in which no global state and no global time is available. Instead, we use only local states in combination with a partial order model of time. Our basic mathematical tool is that of net unfoldings originating from the Petri net research area. This study was motivated by the problem of event correlation in telecommunications network management.
TL;DR: In this article, a system and method for opening and tracking trouble tickets over the public Internet is presented, where customer service management system provides information included within a customer profile record to a Web enabled infrastructure which is accessible by a remote customer workstation having a web browser and Internet access.
Abstract: A system and method for opening and tracking trouble tickets over the public Internet. A customer service management system provides information included within a customer profile record to a Web enabled infrastructure which is accessible by a remote customer workstation having a web browser and Internet access. The customer profile information is used to prepopulate data fields in dialogs used to open a trouble ticket. Once a trouble ticket is opened, the customer workstation tracks the existing trouble tickets through a browser based graphical user interface. The graphical user interface provides current and historical status reports of the actions taken to resolve a network event and the service organizations responsible for resolving the network event.
TL;DR: Preliminary benchmarks of the SEMS demonstrate that the coding approach provides a speedup at least two orders of magnitude over other published correlation systems, and scales well to very large domains involving thousands of problems.
Abstract: This paper describes a novel approach to event correlation in networks based on coding techniques. Observable symptom events are viewed as a code that identifies the problems that caused them; correlation is performed by decoding the set of observed symptoms. The coding approach has been implemented in SMARTS Event Management System (SEMS), as server running under Sun Solaris 2.3. Preliminary benchmarks of the SEMS demonstrate that the coding approach provides a speedup at least two orders of magnitude over other published correlation systems. In addition, it is resilient to high rates of symptom loss and false alarms. Finally, the coding approach scales well to very large domains involving thousands of problems.
TL;DR: The Event-Model-F is developed following the pattern-oriented approach of DUL, is modularized in different ontologies, and can be easily extended by domain specific ontologies.
Abstract: The lack of a formal model of events hinders interoperability in distributed event-based systems. In this paper, we present a formal model of events, called Event-Model-F. The model is based on the foundational ontology DOLCE+DnS Ultralight (DUL) and provides comprehensive support to represent time and space, objects and persons, as well as mereological, causal, and correlative relationships between events. In addition, the Event-Model-F provides a flexible means for event composition, modeling event causality and event correlation, and representing different interpretations of the same event. The Event-Model-F is developed following the pattern-oriented approach of DUL, is modularized in different ontologies, and can be easily extended by domain specific ontologies.