The Experts below are selected from a list of 207 Experts worldwide ranked by ideXlab platform
Hussam Soliman M Ramadan - One of the best experts on this subject based on the ideXlab platform.
-
performance evaluation of an efficient fault tolerant Service discovery protocol for vehicular networks
Journal of Network and Computer Applications, 2012Co-Authors: Kaouther Abrougui, Azzedine Boukerche, Hussam Soliman M RamadanAbstract:Recently, vehicular networks and inter-vehicle communication have received attention from the research community and the automotive industry. In this context, many Services are deployed in vehicular networks that are beneficial to drivers and passengers. Service discovery in vehicular networks is vital to make such Services useful. However, due to the lack of communication reliability in vehicular ad hoc networks, it is necessary to implement fault-tolerant techniques during the discovery of Service providers in vehicular networks. Very few Service discovery protocols for vehicular networks have considered fault tolerant techniques, which are very important for the efficiency of Service discovery. Fault tolerant techniques improve Service request satisfaction and reduce dropped connections due to faulty components between the Service provider and the Service Requester. In this paper, we propose a fault tolerant location based Service discovery protocol for vehicular networks which can work well under Service provider failures, communication link failures and roadside router failures. Our protocol permits the discovery of location based Services where the Requester specifies the region of interest within the request. Our protocol uses an infrastructure support consisting of clusters of roadside routers formed in specific regions in the vehicular network. In addition, Service discovery messages are integrated into the network layer and use channel diversity in order to improve Service discovery efficiency. We describe our fault tolerant location based vehicular Service discovery protocol (FTLocVSDP) and discuss its proof of correctness and performance evaluation. We prove that the success rate is improved in the roadside router failure and in the communication link failure scenarios by 50% and 30%, respectively, compared to the location based Service discovery protocol for vehicular networks (LocVSDP) which does not consider fault tolerant techniques.
Pinson Suzanne - One of the best experts on this subject based on the ideXlab platform.
-
Trust-Based Service Discovery in Multi-relation Social Networks
'Springer Science and Business Media LLC', 2017Co-Authors: Pinson Suzanne, El Haddad Joyce, Louati AmineAbstract:With the increasing number of Services, the need to locate relevant Services remains essential. To satisfy the query of a Service Requester, available Service providers has first to be discovered. This task has been heavily investigated from both industrial and academic perspectives based essentially on registers. However, they completely ignore the contribution of the social dimension. When integrating social trust dimension to Service discovery, this task will gain wider credibility and acceptance. If a Service Requester knows that discovered Services are offered by trustworthy providers, he will be more confident. In this paper, we present a new discovery technique based on a social trust measure that ranks Service providers belonging to the Service Requester’s multi-relation social network. The proposed measure is an aggregation of three measures: the social position, the social proximity and the social similarity. To compute these measures, we take into account both semantic and structural knowledge extracted from the multi-relation social network. Semantic information includes Service requestor and provider profiles and their interactions. Structural information includes among other the position of Service providers in the multi-relation social network graph.nonouirechercheInternationa
-
A Multi-Agent Approach for Trust-Based Service Discovery and Selection in Social Networks
'Scalable Computing: Practice and Experience', 2017Co-Authors: Louati Amine, El Haddad Joyce, Pinson SuzanneAbstract:Service discovery and selection approaches are often done using a centralized registry-based technique, which only captures common Quality of Service criteria. With more and more Services offered via social networks, these approaches are not able to evaluate trust in Service providers and often fail to comply with new Requester's expectations. This is because theses approaches are not able (i) to take into consideration the social dimension and (ii) to capitalize on information resulting from previous experiences. To address these challenges, we propose the use of multi-agent systems as they have demonstrated the capability to use previous interactions, knowledge representation and distributed reasoning, as well as social metaphors like trust. More precisely, in this paper, we enhance Service discovery and selection processes by integrating the societal view in trust modeling. Based on relationships between agents, their previous experiences and extracted information from social network, we define a trust model built upon social, expert and recommender-based components. The social-based component judges whether the provider is worthwhile pursuing before using his Services (viz. trust in sociability). The expert-based component estimates whether the Service behaves well and as expected (viz. trust in expertise). The recommender-based component assesses for an agent whether one's can rely on its recommendations (viz. trust in recommendation). However, when searching for a Service in a social network, agents (Service Requester and Service providers) may have no direct interactions or previous experiences. This requires a method to infer trust between them. Based on a probabilistic model, we estimate trust between non adjacent agents while taking into account roles (recommender or provider) of intermediate agents. Moreover, we propose a distributed algorithm for trustworthy Service discovery and selection using referral systems in social networks. Experiments demonstrate that our approach is effective and outperforms existing ones, and can deliver more trustworthy results.nonouirechercheInternationa
-
A Multi-Agent Approach for Trust-Based Service Discovery and Selection in Social Networks
'Scalable Computing: Practice and Experience', 2015Co-Authors: Louati Amine, El Haddad Joyce, Pinson SuzanneAbstract:International audienceService discovery and selection approaches are often done using a centralized registry-based technique, which only captures common Quality of Service criteria. With more and more Services offered via social networks, these approaches are not able to evaluate trust in Service providers and often fail to comply with new Requester's expectations. This is because theses approaches are not able (i) to take into consideration the social dimension and (ii) to capitalize on information resulting from previous experiences. To address these challenges, we propose the use of multi-agent systems as they have demonstrated the capability to use previous interactions, knowledge representation and distributed reasoning, as well as social metaphors like trust. More precisely, in this paper, we enhance Service discovery and selection processes by integrating the societal view in trust modeling. Based on relationships between agents, their previous experiences and extracted information from social network, we define a trust model built upon social, expert and recommender-based components. The social-based component judges whether the provider is worthwhile pursuing before using his Services (viz. trust in sociability). The expert-based component estimates whether the Service behaves well and as expected (viz. trust in expertise). The recommender-based component assesses for an agent whether one's can rely on its recommendations (viz. trust in recommendation). However, when searching for a Service in a social network, agents (Service Requester and Service providers) may have no direct interactions or previous experiences. This requires a method to infer trust between them. Based on a probabilistic model, we estimate trust between non adjacent agents while taking into account roles (recommender or provider) of intermediate agents. Moreover, we propose a distributed algorithm for trustworthy Service discovery and selection using referral systems in social networks. Experiments demonstrate that our approach is effective and outperforms existing ones, and can deliver more trustworthy results
Kaouther Abrougui - One of the best experts on this subject based on the ideXlab platform.
-
performance evaluation of an efficient fault tolerant Service discovery protocol for vehicular networks
Journal of Network and Computer Applications, 2012Co-Authors: Kaouther Abrougui, Azzedine Boukerche, Hussam Soliman M RamadanAbstract:Recently, vehicular networks and inter-vehicle communication have received attention from the research community and the automotive industry. In this context, many Services are deployed in vehicular networks that are beneficial to drivers and passengers. Service discovery in vehicular networks is vital to make such Services useful. However, due to the lack of communication reliability in vehicular ad hoc networks, it is necessary to implement fault-tolerant techniques during the discovery of Service providers in vehicular networks. Very few Service discovery protocols for vehicular networks have considered fault tolerant techniques, which are very important for the efficiency of Service discovery. Fault tolerant techniques improve Service request satisfaction and reduce dropped connections due to faulty components between the Service provider and the Service Requester. In this paper, we propose a fault tolerant location based Service discovery protocol for vehicular networks which can work well under Service provider failures, communication link failures and roadside router failures. Our protocol permits the discovery of location based Services where the Requester specifies the region of interest within the request. Our protocol uses an infrastructure support consisting of clusters of roadside routers formed in specific regions in the vehicular network. In addition, Service discovery messages are integrated into the network layer and use channel diversity in order to improve Service discovery efficiency. We describe our fault tolerant location based vehicular Service discovery protocol (FTLocVSDP) and discuss its proof of correctness and performance evaluation. We prove that the success rate is improved in the roadside router failure and in the communication link failure scenarios by 50% and 30%, respectively, compared to the location based Service discovery protocol for vehicular networks (LocVSDP) which does not consider fault tolerant techniques.
-
GLOBECOM - An Efficient Fault Tolerant Location Based Service Discovery Protocol for Vehicular Networks
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010Co-Authors: Kaouther Abrougui, Azzedine Boukerche, Richard W PazziAbstract:Recent studies on Service discovery protocols in vehicular networks have shown promising results. However, very little work has been reported on how to integrate the fault tolerance feature into these mechanisms. This feature is vital for the success of the deployment of Service discovery protocols in vehicular networks. Drivers on their cars should not have their requests dissatisfied or their connections dropped because a Service provider or some components between the Service provider and the Service Requester have failed. In this paper, we present a fault tolerant location based Service discovery protocol for Vehicular Networks. The main advantages of our protocol is its ability to tolerate Service providers failure, communication links failure and roadside routers failure. We present our fault tolerant protocol, and report on its performance evaluation. Our simulation experiments show that our proposed fault tolerant LocVSDP algorithm improves the success rate significantly over the basic LocVSDP. In fact, the success rate is improved in the roadside routers failures scenario and in the links failures scenarios by 50 percent and 30 percent respectively.
Munindar P. Singh - One of the best experts on this subject based on the ideXlab platform.
-
A Collaborative Approach to Predicting Service Price for QoS-Aware Service Selection
2016Co-Authors: Puwei Wang, Anup K. Kalia, Munindar P. SinghAbstract:Abstract—In QoS-aware Service selection, a Service Requester seeks to maximize its utility by selecting a Service provider that charges the lowest Service price while meeting the Requester’s QoS requirements. In existing selection approaches, a Service Requester focuses on finding providers based on their QoS and thereby ignores their Service prices that could change with their QoS. High QoS may provide more benefits, but may require a high Service price. As a result, the highest QoS may not produce the maximum utility. A Service Requester and candidate Service providers have a conflicting interest over Service prices. Since a provider would not reveal its minimum acceptable price, it is important for a Requester to predict the minimum price for a Service that meets its QoS requirements. We propose a collaborative approach to predicting a provider’s minimum price for a desired QoS based on prior usage experience. The experimental results show our approach can find the optimal Service providers efficiently and effectively. I
-
Enabling Persistent Web Services via Commitments
Information Technology and Management, 2005Co-Authors: Feng Wan, Munindar P. SinghAbstract:Web Services are gaining popularity for supporting reusable business processes across distributed and heterogeneous environments. Current Web Services are understood as taking inputs, executing their internal logic, and delivering outputs. When outputs are delivered, the interaction related to the given Service ends. However, in many cases, the delivery of a Service does not mean that the business transaction has ended, because there may be a change or cancellation of the original request (from the Service Requester) or an update of results (from the Service provider). Current approaches deal with such scenarios by creating additional operations, thereby arbitrarily splitting the business logic and thus complicating Service modeling and execution. This paper introduces the persistence of Services via commitments. Commitments represent agreements between Service Requesters and providers. The commitments must be fulfilled to ensure successful business transactions. A commitment may last longer than individual episodes of Service request and delivery. Operations on commitments, such as create, update, cancel, and discharge, reflect the persistence of the corresponding Services and assist in constructing Service models and protocols. We show that commitment-enhanced Web Service descriptions are simpler and yet more general than current approaches, so that reliable and flexible Service compositions can be produced.
David Al-dabass - One of the best experts on this subject based on the ideXlab platform.
-
Utilisation of Case-Based Reasoning for Semantic Web Services Composition
International Journal of Intelligent Information Technologies, 2009Co-Authors: Taha Osman, Dhavalkumar Thakker, David Al-dabassAbstract:With the rapid proliferation of Web Services as the medium of choice to securely publish application Services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar Services gains importance both for the human user and for dynamic composition engines. In this article, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web Service discovery and matchmaking, and investigate the use of case adaptation for Service composition. Our framework considers Web Services execution experiences in the decision making process and is highly adaptable to the Service Requester constraints. The framework also utilizes OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web Services.
-
UKSim - Knowledge-Intensive Semantic Web Services Composition
Tenth International Conference on Computer Modeling and Simulation (uksim 2008), 2008Co-Authors: Dhavalkumar Thakker, Taha Osman, David Al-dabassAbstract:With the rapid proliferation of Web Services as the medium of choice to securely publish application Services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar Services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web Service discovery and matchmaking, and investigate the use of case adaptation for Service composition. Our framework considers Web Services execution experiences in the decision making process and is highly adaptable to the Service Requester constraints. The framework takes knowledge-intensive approach and utilizes OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web Services.
-
ECOWS - Semantic-Driven Matchmaking and Composition of Web Services Using Case-Based Reasoning
Fifth European Conference on Web Services (ECOWS'07), 2007Co-Authors: Dhavalkumar Thakker, Taha Osman, David Al-dabassAbstract:With the rapid proliferation of Web Services as the medium of choice to securely publish application Services beyond the firewall, the importance of accurate, yet flexible matchmaking of similar Services gains importance both for the human user and for dynamic composition engines. In this paper, we present a novel approach that utilizes the case based reasoning methodology for modelling dynamic Web Service discovery and matchmaking, and investigate the use of case adaptation for Service composition. Our framework considers Web Services execution experiences in the decision making process and is highly adaptable to the Service Requester constraints. The framework also utilizes OWL semantic descriptions extensively for implementing both the components of the CBR engine and the matchmaking profile of the Web Services.