4 resultados para distributed denial of service

em Department of Computer Science E-Repository - King's College London, Strand, London


Relevância:

100.00% 100.00%

Publicador:

Resumo:

We define personalisation as the set of capabilities that enables a user or an organisation to customise their working environment to suit their specific needs, preferences and circumstances. In the context of service discovery on the Grid, the demand for personalisation comes from individual users, who want their preferences to be taken into account during the search and selection of suitable services. These preferences can express, for example, the reliability of a service, quality of results, functionality, and so on. In this paper, we identify the problems related to personalising service discovery and present our solution: a personalised service registry or View. We describe scenarios in which personsalised service discovery would be useful and describe how our technology achieves them.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The Grid is a large-scale computer system that is capable of coordinating resources that are not subject to centralised control, whilst using standard, open, general-purpose protocols and interfaces, and delivering non-trivial qualities of service. In this chapter, we argue that Grid applications very strongly suggest the use of agent-based computing, and we review key uses of agent technologies in Grids: user agents, able to customize and personalise data; agent communication languages offering a generic and portable communication medium; and negotiation allowing multiple distributed entities to reach service level agreements. In the second part of the chapter, we focus on Grid service discovery, which we have identified as a prime candidate for use of agent technologies: we show that Grid-services need to be located via personalised, semantic-rich discovery processes, which must rely on the storage of arbitrary metadata about services that originates from both service providers and service users. We present UDDI-MT, an extension to the standard UDDI service directory approach that supports the storage of such metadata via a tunnelling technique that ties the metadata store to the original UDDI directory. The outcome is a flexible service registry which is compatible with existing standards and also provides metadata-enhanced service discovery.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Distributed notification services allow consumers and publishers of notifications to interact with different notification services. However, such a distributed infrastructure makes it difficult to share notifications between consumers when consumers are allowed to specify Quality of Service levels. In this paper, we present a chained negotiation engine, enabling distributed notification services to support negotiation and to reuse existing subscriptions. We demonstrate the benefit to the system as a whole by reducing load on service providers and enabling content to be shared.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Dynamic composition of services provides the ability to build complex distributed applications at run time by combining existing services, thus coping with a large variety of complex requirements that cannot be met by individual services alone. However, with the increasing amount of available services that differ in granularity (amount of functionality provided) and qualities, selecting the best combination of services becomes very complex. In response, this paper addresses the challenges of service selection, and makes a twofold contribution. First, a rich representation of compositional planning knowledge is provided, allowing the expression of multiple decompositions of tasks at arbitrary levels of granularity. Second, two distinct search space reduction techniques are introduced, the application of which, prior to performing service selection, results in significant improvement in selection performance in terms of execution time, which is demonstrated via experimental results.