391 resultados para QoS WAP Palvelunlaatu
Resumo:
WAP tulee olemaan tulevaisuudessa tärkeässä roolissa, kun etsitään sopivaa tiedonsiirtoprotokollaa uusille mobiilipalveluille. Vaikka WAP jollain tavalla epäonnistui ensimmäisessä tulemisessaan sen suosio varmasti tulevaisuudessa tulee kasvamaan. WAP:in heikko suosio ei johtunut niinkään protokollan tiedonsiirto ominaisuuksista, vaan WAP-palveluiden kehittymättömyydestä. Tulevaisuuden palvelut kuitenkin ovat kehittyneempiä ja WAP:in suosio tulee kasvamaan. Viimeisimpänä WAP:ia käyttävänä palveluna on esitelty MMS. Kun uudet WAP:iin pohjautuvat palvelut yleistyvät, asettaa se uusia vaatimuksia myös WAP gateway:lle. Työssä tarkastellaan erilaisia mahdollisuuksia mitata mobiilisti WAP palvelujen palvelun tasoa. Työssä myös toteutetaan mobiili WAP palveluiden mittauskomponentti, joka toimii osana laajempaa ohjelmistoa. Tarkoituksena on toteuttaa mittauskomponentti, joka emuloi mahdollisimman hyvin todellista loppukäyttäjää.
Resumo:
The large amount of information in electronic contracts hampers their establishment due to high complexity. An approach inspired in Software Product Line (PL) and based on feature modelling was proposed to make this process more systematic through information reuse and structuring. By assessing the feature-based approach in relation to a proposed set of requirements, it was showed that the approach does not allow the price of services and of Quality of Services (QoS) attributes to be considered in the negotiation and included in the electronic contract. Thus, this paper also presents an extension of such approach in which prices and price types associated to Web services and QoS levels are applied. An extended toolkit prototype is also presented as well as an experiment example of the proposed approach.
Resumo:
Os prestadores de serviços de telecomunicações e operadores de telecomunicações deparam-se com um aumento exponencial das necessidades de largura de banda. A evolução e massificação dos serviços Internet e Intranet pelos serviços públicos e privados deixaram de ser uma mera adaptação do protocolo TCP, à qualidade da ligação sendo uma necessidade a diferenciação do tráfego. As metodologias que asseguram uma qualidade de serviço no âmbito dos fornecedores de serviços internet são a forma de garantir uma qualidade de serviço adequada a cada tipo de tráfego. Estas metodologias são suportadas pela rede IP MPLS dos diversos operadores de telecomunicações no transporte dos diversos serviços dos seus clientes empresarias e domésticos no acesso à internet dos diversos serviços públicos de dados e voz e nas redes virtuais privadas. Os portais aplicacionais são a interface directa com o cliente para definição dos acordos de nível de serviço “Service Level Agreements” e a sua associação à especificação dos níveis de serviço “Service Level Specification”, para posterior relação com a definição de métricas adequadas à qualidade de serviço acordada com o cliente no desenho dos serviços de uma rede IP “MultiProtocol Label Switch”. A proposta consiste em criar uma metodologia para mapear as necessidades de serviços dos clientes em SLAs e registá-los numa base de dados, separando claramente a qualidade do serviço vista na óptica do operador em: arquitectura de rede de transporte, arquitectura do serviço e arquitectura de monitoria. Estes dados são mapeados em parâmetros e especificações de implementação dos serviços de suporte ao negócio do operador tendo em vista a criação de um “Work Flow” fim a fim. Paralelamente define-se os serviços a disponibilizar comercialmente, o conjunto de serviços suportados pela rede e tecnologia IP MPLS com a parametrização de ”Quality of Service Assurance” adequada a cada um, cria-se uma arquitectura de rede de suporte ao transporte base entre os diversos equipamentos agregadores de acessos através do “Backbone”, define-se uma arquitectura de suporte para cada tipo de serviço independente da arquitectura de transporte. Neste trabalho implementam-se algumas arquitecturas de QoS estudadas no IP MPLS em simuladores disponibilizados pela comunidade “Open Source” e analisamos as vantagens de desvantagens de cada uma. Todas as necessidades são devidamente equacionadas, prevendo o seu crescimento, desempenho, estabelecendo regras de distribuição de largura de banda e análise de desempenho, criando redes escaláveis e com estimativas de crescimento optimistas. Os serviços são desenhados de forma a adaptarem-se à evolução das necessidades aplicacionais, ao crescimento do número de utilizadores e evolução do próprio serviço.
Resumo:
Mestrado em Engenharia Electrotécnica e de Computadores
Resumo:
Actualmente, os smartphones e outros dispositivos móveis têm vindo a ser dotados com cada vez maior poder computacional, sendo capazes de executar um vasto conjunto de aplicações desde simples programas de para tirar notas até sofisticados programas de navegação. Porém, mesmo com a evolução do seu hardware, os actuais dispositivos móveis ainda não possuem as mesmas capacidades que os computadores de mesa ou portáteis. Uma possível solução para este problema é distribuir a aplicação, executando partes dela no dispositivo local e o resto em outros dispositivos ligados à rede. Adicionalmente, alguns tipos de aplicações como aplicações multimédia, jogos electrónicos ou aplicações de ambiente imersivos possuem requisitos em termos de Qualidade de Serviço, particularmente de tempo real. Ao longo desta tese é proposto um sistema de execução de código remota para sistemas distribuídos com restrições de tempo-real. A arquitectura proposta adapta-se a sistemas que necessitem de executar periodicamente e em paralelo mesmo conjunto de funções com garantias de tempo real, mesmo desconhecendo os tempos de execução das referidas funções. A plataforma proposta foi desenvolvida para sistemas móveis capazes de executar o Sistema Operativo Android.
Resumo:
Resource constraints are becoming a problem as many of the wireless mobile devices have increased generality. Our work tries to address this growing demand on resources and performance, by proposing the dynamic selection of neighbor nodes for cooperative service execution. This selection is in uenced by user's quality of service requirements expressed in his request, tailoring provided service to user's speci c needs. In this paper we improve our proposal's formulation algorithm with the ability to trade o time for the quality of the solution. At any given time, a complete solution for service execution exists, and the quality of that solution is expected to improve overtime.
Resumo:
In this paper we present a framework for managing QoS-aware applications in a dynamic, ad-hoc, distributed environment. This framework considers an available set of wireless/mobile and fixed nodes, which may temporally form groups in order to process a set of related services, and where there is the need to support different levels of service and different combinations of quality requirements. This framework is being developed both for testing and validating an approach, based on multidimensional QoS properties, which provides service negotiation and proposal evaluation algorithms, and for assessing the suitability of the Ada language to be used in the context of dynamic, QoS-aware systems.
Resumo:
Users of wireless devices increasingly demand access to multimedia content with speci c quality of service requirements. Users might tolerate di erent levels of service, or could be satis ed with di erent quality combinations choices. However, multimedia processing introduces heavy resource requirements on the client side. Our work tries to address the growing demand on resources and performance requirements, by allowing wireless nodes to cooperate with each other to meet resource allocation requests and handle stringent constraints, opportunistically taking advantage of the local ad-hoc network that is created spontaneously, as nodes move in range of each other, forming a temporary coalition for service execution. Coalition formation is necessary when a single node cannot execute a speci c service, but it may also be bene cial when groups perform more e ciently when compared to a single s node performance.
Resumo:
This paper focuses on the problem of providing efficient scheduling mechanisms for IP packets encapsulated in the frames of a real-time fieldbus network - the PROFIBUS. The approach described consists on a dual-stack approach encompassing both the controlrelated traffic ("native" fieldbus traffic) and the IPrelated traffic. The overall goal is to maintain the hard real-time guarantees of the control-related traffic, while at the same time providing the desired quality of service (QoS) to the coexistent IP applications. We start to describe the work which have been up to now carried out in the framework of the European project RFieldbus (High Performance Wireless Fieldbus in Industrial Multimedia-Related Environments - IST-1999-11316). Then we identify its limitations and point out solutions that are now being addressed out of the framework of the above-mentioned European project.
Resumo:
Emerging smart grid systems must be able to react quickly and predictably, adapting their operation to changing energy supply and demand, by controlling energy consuming and energy storage devices. An intrinsic problem with smart grids is that energy produced from in-house renewable sources is affected by fluctuating weather factors. The applications driving smart grids operation must rely on a solid communication network that is secure, highly scalable, and always available. Thus, any communication infrastructure for smart grids should support its potential of producing high quantities of real-time data, with the goal of reacting to state changes by actuating on devices in real-time, while providing Quality of Service (QoS).
Resumo:
Replication is a proven concept for increasing the availability of distributed systems. However, actively replicating every software component in distributed embedded systems may not be a feasible approach. Not only the available resources are often limited, but also the imposed overhead could significantly degrade the system's performance. The paper proposes heuristics to dynamically determine which components to replicate based on their significance to the system as a whole, its consequent number of passive replicas, and where to place those replicas in the network. The results show that the proposed heuristics achieve a reasonably higher system's availability than static offline decisions when lower replication ratios are imposed due to resource or cost limitations. The paper introduces a novel approach to coordinate the activation of passive replicas in interdependent distributed environments. The proposed distributed coordination model reduces the complexity of the needed interactions among nodes and is faster to converge to a globally acceptable solution than a traditional centralised approach.
Resumo:
Mobile applications are becoming increasingly more complex and making heavier demands on local system resources. Moreover, mobile systems are nowadays more open, allowing users to add more and more applications, including third-party developed ones. In this perspective, it is increasingly expected that users will want to execute in their devices applications which supersede currently available resources. It is therefore important to provide frameworks which allow applications to benefit from resources available on other nodes, capable of migrating some or all of its services to other nodes, depending on the user needs. These requirements are even more stringent when users want to execute Quality of Service (QoS) aware applications, such as voice or video. The required resources to guarantee the QoS levels demanded by an application can vary with time, and consequently, applications should be able to reconfigure themselves. This paper proposes a QoS-aware service-based framework able to support distributed, migration-capable, QoS-enabled applications on top of the Android Operating system.
Resumo:
In distributed soft real-time systems, maximizing the aggregate quality-of-service (QoS) is a typical system-wide goal, and addressing the problem through distributed optimization is challenging. Subtasks are subject to unpredictable failures in many practical environments, and this makes the problem much harder. In this paper, we present a robust optimization framework for maximizing the aggregate QoS in the presence of random failures. We introduce the notion of K-failure to bound the effect of random failures on schedulability. Using this notion we define the concept of K-robustness that quantifies the degree of robustness on QoS guarantee in a probabilistic sense. The parameter K helps to tradeoff achievable QoS versus robustness. The proposed robust framework produces optimal solutions through distributed computations on the basis of Lagrangian duality, and we present some implementation techniques. Our simulation results show that the proposed framework can probabilistically guarantee sub-optimal QoS which remains feasible even in the presence of random failures.
Resumo:
In this paper we propose a framework for the support of mobile application with Quality of Service (QoS) requirements, such as voice or video, capable of supporting distributed, migration-capable, QoS-enabled applications on top of the Android Operating system.
Resumo:
Due to the growing complexity and adaptability requirements of real-time systems, which often exhibit unrestricted Quality of Service (QoS) inter-dependencies among supported services and user-imposed quality constraints, it is increasingly difficult to optimise the level of service of a dynamic task set within an useful and bounded time. This is even more difficult when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may be inter-dependent. This paper focuses on optimising a dynamic local set of inter-dependent tasks that can be executed at varying levels of QoS to achieve an efficient resource usage that is constantly adapted to the specific constraints of devices and users, nature of executing tasks and dynamically changing system conditions. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.