The application of dependency management in an integrated manufacturing network framework
ABSTRACT Research into the effectiveness and performance of the mobile agent (MA)technology as a means of managing a domain of manufacturing devices has been conducted. However, it has been shown that MAs are not without their scalability issues. A strategic agent travelling algorithm will bring performance improvement as it allows agents to identify the best migration path in order to minimise the total expected time of searching for the desired information. The applications of process-driven dependency management along with MA techology are examined as methods for optimising the effiency of retrieving critical information in the manufacturing environment. An integrated framework is developed to investigate the alignment of network management paradigm to the strategic management decision.
- SourceAvailable from: psu.edu[show abstract] [hide abstract]
ABSTRACT: We describe a methodology for identifying and characterizing dynamic dependencies between system components in distributed application environments such as e-commerce systems. The methodology relies on active perturbation of the system to identify dependencies and the use of statistical modeling to compute dependency strengths. Unlike more traditional passive techniques, our active approach requires little initial knowledge of the implementation details of the system and has the potential to provide greater coverage and more direct evidence of causality for the dependencies it identifies. We experimentally demonstrate the efficacy of our approach by applying it to a prototypical e-commerce system based on the TPC-W web commerce benchmark, for which the active approach correctly identifies and characterizes 41 of 42 true dependencies out of a potential space of 140 dependencies. Finally, we consider how the dependencies computed by our approach can be used to simplify and guide the task of root-cause analysis, an important part of problem determination.02/2002;
Article: The Traveling Agent Problem.[show abstract] [hide abstract]
ABSTRACT: . This paper considers a sequencing problem which arises naturally in the scheduling of software agents. We are given n sites at which a certain task might be successfully performed. The probability of success is p i at the ith site and these probabilities are independent. Visiting site i and trying the task there requires time (or some other cost metric) t i whether successful or not. Latencies between sites i and j are l ij, that is, the travel time between those two sites. Should the task be successfully completed at a site then any remaining sites do not need to be visited. The Traveling Agent Problem is to find the sequence which minimizes the expected time to complete the task. The general formulation of this problem is NP-Complete. However, if the latencies are constant we show that the problem can be solved in polynomial time by sorting the ratios t i/p i according to increasing value and visiting the sites in that order. This result then leads to an efficient algorithm when groups of sites form subnets in which latencies within a subnet are constant but can vary across subnets. We also study the case when there are deadlines for solving the problem in which case the goal is to maximize probability of success subject to satisfying the deadlines. Applications to mobile and intelligent agents are described.Mathematics of Control Signals and Systems 01/2001; 14:213-232. · 0.42 Impact Factor
- 05/2003; John Wiley.