Titlebook: Inter-Domain Management; First International Arosha K. Bandara,Mark Burgess Conference proceedings 2007 Springer-Verlag Berlin Heidelberg

Terrace

眉毛

Self-forming Network Management Topologies in the Madeira Management Systemaintained automatically by the underlying network of elements. An implementation of these self-forming management topologies as developed in the Celtic European research project Madeira is described.  The self-forming topologies use peer-to-peer communication facilities provided by the Madeira platf

弄污

Activity-Based Scheduling of IT Changesptions to the business services as a result of performing IT changes. Currently, one of the most pressing problems in change management is the scheduling and planning of changes. Building on an earlier mathematical formulation of the change scheduling problem, in this paper we take the formulation o

高谈阔论

Estimating Reliability of Conditional Promises of when conditions operate and when promises are expected to be fulfilled. This inspires an analytical method that attributes promise failures to incomplete knowledge rather than agent unreliability. This analysis allows agents to choose between conditional offers of service based upon statistical

上坡

Modeling Change Without Breaking Promiseswhich bindings must change over time due to both contingencies and changes in policy. We define two new kinds of promises that provide temporal scope for a conditional promise. We show that simple temporally-scoped promises can describe common network behaviors such as leasing and failover, and allo

concentrate

Norms and Swarmsher than the programmed rules commonly used to mimick swarm behaviour. We look for a general and underlying meaning to swarms as a form of organization. Noting that swarms lead to an autonomous reduction of total information of the ensemble of agents, we propose that our definition of swarming sugge

GRAZE

needle

A ‘Pumping’ Model for the Spreading of Computer Virusesld. This question is relevant for real computer viruses, which spread by following the (logical) directed links formed by address lists. Our arguments build on previous work in two (seemingly unrelated) areas: epidemic spreading on undirected graphs, and eigenvectors of directed graphs as applied to

exclusice

Improving Anomaly Detection Event Analysis Using the EventRank Algorithmbasic assumption is that regular and periodic usage of a system will yield patterns of events that can be learned by data-mining. Events that deviate from this pattern can then be filtered out and receive special attention. Our approach compares the anomaly detection framework from Cfengine and the

戏法