Quality of Distributed Applications

2000 ◽  
pp. 33-36
Author(s):  
Henryk Krawczyk ◽  
Bogdan Wiszniewski
Keyword(s):  
Distributed Applications

Toward a Quality-of-Service Framework for Peer-to-Peer Applications

2012 ◽  
pp. 74-97
Author(s):  
Ankur Gupta ◽  
Lalit K. Awasthi
Keyword(s):  
Quality Of Service ◽  
Service Level ◽  
Distributed Applications ◽  
Peer To Peer ◽  
Content Sharing ◽  
Early Results ◽  
The Individual ◽  
P2p Applications ◽  
Quality Of Service Parameters

P2P networks have caught the imagination of the research community and application developers with their sheer scalability and fault-tolerance characteristics. However, only content-sharing applications based on the P2P concept have reached the desired level of maturity. The potential of the P2P concept for designing the next-generation of real-world distributed applications can be realized only if a comprehensive framework quantifying the performance related aspects of all classes of P2P applications is available. Researchers have proposed some QoS (Quality-of-Service) parameters for content-sharing P2P applications based on response time and delay, but these do not cover the gamut of application domains that the P2P concept is applicable to. Hence, this research paper proposes an early QoS framework covering various classes of P2P applications; content distribution, distributed computing and communication and collaboration. Early results from the prototype implementation of the Peer Enterprises framework (a cross-organizational P2P collaborative application) are used as a basis for formulation of the QoS parameters. The individual performance measures which comprise the QoS framework are also discussed in detail along with some thoughts on how these can be complied with. The proposed framework would hopefully lead to quantifiable Service-Level Agreements for a variety of peer-to-peer services and applications.

Toward a Quality-of-Service Framework for Peer-to-Peer Applications

2010 ◽  
Vol 1 (3) ◽  
pp. 1-23 ◽  
Author(s):  
Ankur Gupta ◽  
Lalit K. Awasthi
Keyword(s):  
Quality Of Service ◽  
Service Level ◽  
Individual Performance ◽  
Distributed Applications ◽  
Peer To Peer ◽  
Content Sharing ◽  
Early Results ◽  
The Individual ◽  
P2p Applications

P2P networks have caught the imagination of the research community and application developers with their sheer scalability and fault-tolerance characteristics. However, only content-sharing applications based on the P2P concept have reached the desired level of maturity. The potential of the P2P concept for designing the next-generation of real-world distributed applications can be realized only if a comprehensive framework quantifying the performance related aspects of all classes of P2P applications is available. Researchers have proposed some QoS (Quality-of-Service) parameters for content-sharing P2P applications based on response time and delay, but these do not cover the gamut of application domains that the P2P concept is applicable to. Hence, this research paper proposes an early QoS framework covering various classes of P2P applications; content distribution, distributed computing and communication and collaboration. Early results from the prototype implementation of the Peer Enterprises framework (a cross-organizational P2P collaborative application) are used as a basis for formulation of the QoS parameters. The individual performance measures which comprise the QoS framework are also discussed in detail along with some thoughts on how these can be complied with. The proposed framework would hopefully lead to quantifiable Service-Level Agreements for a variety of peer-to-peer services and applications.

scholarly journals Massively multi-user online platform for large-scale applications

2021 ◽  
Author(s):  
Allen Yen-Cheng Yu
Keyword(s):  
Grid Computing ◽  
High Performance ◽  
Large Scale ◽  
Distributed Applications ◽  
Service Architecture ◽  
Online Application ◽  
Online Platform ◽  
Massively Multiplayer Online Game ◽  
And Performance

Many large-scale online applications enable thousands of users to access their services simultaneously. However, the overall service quality of an online application usually degrades when the number of users increases because, traditionally, centralized server architecture does not scale well. In order to provide better Quality of Service (QoS), service architecture such as Grid computing can be used. This type of architecture offers service scalability by utilizing heterogeneous hardware resources. In this thesis, a novel design of Grid computing middleware, Massively Multi-user Online Platform (MMOP), which integrates the Peer-to-Peer (P2P) structured overlays, is proposed. The objectives of this proposed design are to offer scalability and system design flexibility, simplify development processes of distributed applications, and improve QoS by following specified policy rules. A Massively Multiplayer Online Game (MMOG) has been created to validate the functionality and performance of MMOP. The simulation results have demonstrated that MMOP is a high performance and scalable servicing and computing middleware.

scholarly journals Massively multi-user online platform for large-scale applications

2021 ◽  
Author(s):  
Allen Yen-Cheng Yu
Keyword(s):  
Grid Computing ◽  
High Performance ◽  
Large Scale ◽  
Distributed Applications ◽  
Service Architecture ◽  
Online Application ◽  
Online Platform ◽  
Massively Multiplayer Online Game ◽  
And Performance

Many large-scale online applications enable thousands of users to access their services simultaneously. However, the overall service quality of an online application usually degrades when the number of users increases because, traditionally, centralized server architecture does not scale well. In order to provide better Quality of Service (QoS), service architecture such as Grid computing can be used. This type of architecture offers service scalability by utilizing heterogeneous hardware resources. In this thesis, a novel design of Grid computing middleware, Massively Multi-user Online Platform (MMOP), which integrates the Peer-to-Peer (P2P) structured overlays, is proposed. The objectives of this proposed design are to offer scalability and system design flexibility, simplify development processes of distributed applications, and improve QoS by following specified policy rules. A Massively Multiplayer Online Game (MMOG) has been created to validate the functionality and performance of MMOP. The simulation results have demonstrated that MMOP is a high performance and scalable servicing and computing middleware.

A Tool Chain for Constructing QoS-aware Web Services

2012 ◽  
pp. 189-211
Author(s):  
Bernhard Hollunder ◽  
Ahmed Al-Moayed ◽  
Alexander Wahl
Keyword(s):  
Web Services ◽  
Dominant Role ◽  
Distributed Applications ◽  
Service Oriented Architectures ◽  
Tool Chain ◽  
Service Computing ◽  
Service Oriented ◽  
Development Support ◽  
Standard Components

Web services play a dominant role in service computing and for realizing service-oriented architectures (SOA), which define the architectural foundation for various kinds of distributed applications. In many business domains, Web services must exhibit quality attributes such as robustness, security, dependability, performance, scalability and accounting. As a consequence, there is a high demand to develop, deploy and consume Web services equipped with well-defined quality of service (QoS) attributes – so-called QoS-aware Web services. Currently, there is only limited development support for the creation of QoS-aware Web services, though. In this work we present a tool chain that facilitates development, deployment and testing of QoS-aware Web services. The tool chain has following features: i) integration of standard components such as widely used IDEs, ii) usage of standards and specifications, and iii) support for various application servers and Web services infrastructures.

Evaluating single web service trust employing a three-level neuro-fuzzy system considering k-means clustering

2021 ◽  
Vol 40 (5) ◽  
pp. 9143-9157
Author(s):  
Baharak Shakeri Aski ◽  
Abolfazl Toroghi Haghighat ◽  
Mehran Mohsenzadeh
Keyword(s):  
Web Services ◽  
Web Service ◽  
Fuzzy System ◽  
Distributed Applications ◽  
User Preference ◽  
Fuzzy Membership Functions ◽  
Neuro Fuzzy ◽  
High Prediction ◽  
Software Platforms

Using Web services to assess data in a distributed configuration, apart from different hardware and software platforms for employing standard criteria, is practical because of development in the Internet and network infrastructure. Distributed applications can transfer data using web services. Trust is the main criterion to select the appropriate web service. Neuro-fuzzy systems including clustering are applied to assess the trust of single web services. This paper considers nine criteria including quality of service, subjective perspectives, user preference, credibility of raters, objective perspectives, dynamic computing, bootstrapping, independency and security. To obtain a neuro-fuzzy system with high prediction accuracy, the paper considers eight neuro-fuzzy membership functions (i.e., trapmf, gbellmf, trimf, gaussmf, dsigmf, psigmf, gauss2mf, pimf) using the k-means clustering. Also, to increase the speed and reduce the fuzzy rules, a three-level neuro-fuzzy system (13 neuro-fuzzy) is investigated. The main target of this paper is evaluating the trust of single web services using the nine aforementioned criteria, as web services selection is a main issue which is still absorbing researchers to conduct research works on this field and analyze it. Ultimately, the results show reasonable root mean square error (RMSE) amount, precision value, recall value, and F-score value. In comparison to previous research works, this study obtained the lower amounts of errors and presents the more accurate trust of single web services.

SDN‐based architecture for providing quality of service to high‐performance distributed applications

2019 ◽  
Author(s):  
Alexandre T. Oliveira ◽  
Bruno José C. A. Martins ◽  
Marcelo F. Moreno ◽  
Antônio Tadeu A. Gomes ◽  
Artur Ziviani ◽  
...  
Keyword(s):  
Quality Of Service ◽  
High Performance ◽  
Distributed Applications

scholarly journals SLA-driven adaptive monitoring of distributed applications for performance problem localization

2013 ◽  
Vol 10 (1) ◽  
pp. 25-50 ◽  
Author(s):  
Dusan Okanovic ◽  
van Hoorn ◽  
Zora Konjovic ◽  
Milan Vidakovic
Keyword(s):  
Continuous Monitoring ◽  
Service Level ◽  
Distributed Applications ◽  
Software Systems ◽  
Application Performance ◽  
Adaptive Monitoring ◽  
Performance Problem ◽  
Problem Localization ◽  
Level Monitoring

Continuous monitoring of software systems under production workload provides valuable data about application runtime behavior and usage. An adaptive monitoring infrastructure allows controlling, for instance, the overhead as well as the granularity and quality of collected data at runtime. Focusing on application-level monitoring, this paper presents the DProf approach which allows changing the instrumentation of software operations in monitored distributed applications at runtime. It simulates the process human testers employ-monitoring only such parts of an application that cause problems. DProf uses performance objectives specified in service level agreements (SLAs), along with call tree information, to detect and localize problems in application performance. As a proof-of-concept, DProf was used for adaptive monitoring of a sample distributed application.

scholarly journals On Minimizing the Completion Times of Long Flows over Inter-Datacenter WAN

2018 ◽  
Author(s):  
Mohammad Noormohammadpour ◽  
Ajitesh Srivastava ◽  
Cauligi S. Raghavendra
Keyword(s):  
Completion Time ◽  
Network Performance ◽  
Distributed Applications ◽  
Traffic Patterns ◽  
Worst Case ◽  
Link Utilization ◽  
Performance Metric ◽  
Routing Heuristics ◽  
Optimality Gap

Long flows contribute huge volumes of traffic over inter-datacenter WAN. The Flow Completion Time (FCT) is a vital network performance metric that affects the running time of distributed applications and the users' quality of experience. Flow routing techniques based on propagation or queuing latency or instantaneous link utilization are insufficient for minimization of the long flows' FCT. We propose a routing approach that uses the remaining sizes and paths of all ongoing flows to minimize the worst-case completion time of incoming flows assuming no knowledge of future flow arrivals. Our approach can be formulated as an NP-Hard graph optimization problem. We propose BWRH, a heuristic to quickly generate an approximate solution. We evaluate BWRH against several real WAN topologies and two different traffic patterns. We see that BWRH provides solutions with an average optimality gap of less than 0.25%. Furthermore, we show that compared to other popular routing heuristics, BWRH reduces the mean and tail FCT by up to 1.46× and 1.53×, respectively.

Sign in / Sign up

Export Citation Format

Share Document