Security in collaborative peer groups is an active research topic. Most previous work focused on key management without addressing an important pre-requisite: admission control, i.e., how to securely admit a new member. This paper represents an initial attempt to sketch out an admission control framework suitable for different flavors of peer groups and match them with appropriate cryptographic...

and Reservations Herbert Bos email: [email protected], phone: +44-1223-334650, fax: +44-1223-334678 University of Cambridge, Computer Laboratory, Cambridge, CB2 3DQ, United Kingdom Abstract| We propose an innovative control architecture for ATM that allows users to reserve in advance complex connection patterns in the network. It o ers control over the resources via schedules but alleviates ...

Radio Resource Management is the bridge between diverse Radio Access Technologies. A common view of RRM, supporting a set of common radio-independent algorithms, provides a generic framework for the deployment of a wide variety of data services. An ideal heterogeneous control environment dynamically substitutes different algorithms and management strategies; such as capacity based or class base...

| We propose a minimum cost method for trafc shaping in the context of QoS-based networks. Given the user's desired QoS and the network's resource availability, our procedure determines the least-cost parameters for a tra c shaper which still guarantees access to the network whilst satisfying the QoS constraints. We illustrate our scheme using on-o sources and formulate the QoS constraints by e...

Überlast bedeutet, dass an ein System mehr Anforderungen gestellt werden, als es erfüllen kann. Im schlechtesten Fall ist es nicht mehr ansprechbar oder stürzt ab. Für Datenbankmanagementsysteme (DBMS) existiert eine spezielle Komponente, Admission Control (AC) genannt, welche die Systemlast überwacht, eintreffende Anfragen vor deren Ausführung überprüft und ggfs. zurückstellt. Für kontinuierli...

With the population of wireless subscribers increasing at a rapid rate overloaded sit uations are likely to become an increasing problem Admission control can be used to balance the goals of maximizing bandwidth utilization and ensuring su cient resources for high priority events In this paper we formulate the admission control problem as a Markov decision problem While dynamic programming can ...

When admission control is used, an online scheduler chooses whether or not to complete each individual job successfully by its deadline. An important consideration is at what point in time the scheduler determines if a job request will be satissed, and thus at what point the scheduler is able to provide notiication to the job owner as to the fate of the request. In the loosest model, often seen...

We consider the problem of dynamic admission control in a multi-class Markovian loss system receiving random batches, where each admitted class-i job demands an exponential service with rate μ, and brings a reward ri. We show that the optimal admission policy is a sequential threshold policy with monotone thresholds.