Titlebook: Resilient Networks and Services; Second International David Hausheer,Jürgen Schönwälder Conference proceedings 2008 IFIP International Fede

demote

A Distributed Certification System for Structured P2P Networkss, hence a varying number of nodes. This number is dynamically adjusted to enforce the ratio in a fully distributed way, which is mandatory for decentralized varying-size P2P networks. A certificate allows then to link the key pair of a node to some rights granted to it.

conscribe

斜

Secure Sharing of an ICT Infrastructure through Vinciamong a set of users with distinct security levels and reliability requirements. To this purpose, Vinci decomposes users into ., each consisting of a set of users, their applications, a set of services and of shared resources. Users with distinct privileges and applications with distinct trust level

ascetic

hyperuricemia

Service Load Balancing with Autonomic Servers: Reversing the Decision Making Processitative decision is made by the load balancer, which decides to which server the requests are forwarded. However, the autonomy of servers is often incompatible with these strategies, as they may accept or refuse to process a request on a voluntary basis. We present in this paper the benefits and lim

gorgeous

Cougar

RLTE: Reinforcement Learning for Traffic-EngineeringS routing and Traffic Engineering in connection oriented networks, e.g. MPLS networks. Based on reinforcement learning the algorithm learns the optimal routing policy for incoming connection requests while minimizing the blocking probability. In contrast to other approaches our method does not rely

thwart

SNMP Trace Analysis Definitionsetworks. To analyze these traces, it is necessary to split potentially large traces into more manageable pieces that make it easier to deal with large data sets and simplify the analysis of the data. This document introduces some common definitions that have been found useful for implementing tools

ADORE

Dynamic Consistency Analysis for Convergent Operatorsut this management technique. We discuss how an autonomous agent can reason about whether its convergent operators share a fixed point with the operators of other agents. Using a concept of time based upon operator repetition, we show that a failure to achieve convergence within specific time limits

刀锋

A Theory of Closure Operators operator is idempotent only for the states that it assures, and define a more general concept in which acceptable states are a superset of assurable states. This modified definition permits operators to make arbitrary choices that are later changed by other operators, easing their composition and a