Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Houwayda Elfawal Mansour

dblp:28/10474 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Services computing and microservices · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 50% Hardware reliability and fault tolerance · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Services computing and microservices › service composition
web service composition
0.112011
Dependability and Rollback Recovery for Composite Web Services · IEEE Trans. Serv. Comput. 2011
Services computing and microservices › quality-of-service management
web service reliability
0.112011
Dependability and Rollback Recovery for Composite Web Services · IEEE Trans. Serv. Comput. 2011
Distributed systems
fault tolerance
0.012011
Dependability and Rollback Recovery for Composite Web Services · IEEE Trans. Serv. Comput. 2011
Hardware reliability and fault tolerance › redundancy › modular redundancy
triple modular redundancy
0.012011
Dependability and Rollback Recovery for Composite Web Services · IEEE Trans. Serv. Comput. 2011

Methods — techniques the papers use, named apart from their topics

recovery block · 0.2n-version programming · 0.2doubly stochastic model · 0.2renewal processes · 0.1renewal process · 0.1
YearPublicationVenuePosition
2013 Composite web QoS with workflow conditional pathways using bounded sets
Houwayda Elfawal Mansour, Ali Mansour, Tharam S. Dillon
Serv. Oriented Comput. Appl.1
2011 Dependability and Rollback Recovery for Composite Web Services
abstract
In this paper, we propose a service-oriented reliability model that dynamically calculates the reliability of composite web services with rollback recovery based on the real-time reliabilities of the atomic web services of the composition. Our model is a hybrid reliability model based on both path-based and state-based models. Many reliability models assume that failure or error arrival times are exponentially distributed. This is inappropriate for web services as error arrival times are dependent on the operating state including workload of servers where the web service resides. In this manuscript, we modify our previous model (for software based on the Doubly Stochastic Model and Renewal Processes) to evaluate the reliability of atomic web services. In order to fix our idea, we developed the case of one simple web service which contains two states, i.e., idle and active states. In real-world applications, where web services could contain quite a large number of atomic services, the calculus as well as the computing complexity increases greatly. To limit our computing efforts and calculus, we chose the bounded set techniques that we apply using the previously developed stochastic model. As a first type of system combination, we proposed to study a scheme based on combining web services into parallel and serial configurations with centralized coordination. In this case, the broker has an acceptance testing mechanism that examines the results returned from a particular web service. If it was acceptable, then the computation continues to the next web service. Otherwise, it involves rollback and invokes another web service already specified by a checkpoint algorithm. Finally, the acceptance test is conducted using the broker. The broker can be considered as a single point of failure. To increase the reliability of the broker introduced in our systems and mask out errors at the broker level, we suggest a modified general scheme based on Triple modular redundancy and N-version programming. To imitate a real scenario where errors could happen at any stage of our application and improve the quality of Service QoS of the proposed model, we introduce fault-tolerance techniques using an adaption of the recovery block technique.
Houwayda Elfawal Mansour, Tharam S. Dillon
IEEE Trans. Serv. Comput.1