A Distributed Consensus Algorithm for Decision Making in Service-Oriented Internet of Things

In a service-oriented Internet of things (IoT) deployment, it is difficult to make consensus decisions for services at different IoT edge nodes where available information might be insufficient or overloaded. Existing statistical methods attempt to resolve the inconsistency, which requires adequate information to make decisions. Distributed consensus decision making (CDM) methods can provide an efficient and reliable means of synthesizing information by using a wider range of information than existing statistical methods. In this paper, we first discuss service composition for the IoT by minimizing the multi-parameter dependent matching value. Subsequently, a cluster-based distributed algorithm is proposed, whereby consensuses are first calculated locally and subsequently combined in an iterative fashion to reach global consensus. The distributed consensus method improves the robustness and trustiness of the decision process

Network Game Theory Models of Services and Quality Competition with Applications to Future Internet Architectures and Supply Chains

The Internet has transformed the way in which we conduct business and perform economic and financial transactions. One key challenge of the Internet is the inefficiency of the mechanisms by which technology is deployed and the business and economic models surrounding these processes (Wolf et al. (2014)). Equilibrium models for the Internet generally assume basic economic relationships. However, in new paradigms for the Internet and in supply chain networks, price is not the only factor; quality of service (QoS) is also of increasing importance. Supply chains networks, which give us the means to manufacture products and deliver them to points of demand across the globe, are also under many pressures to offer differentiated products and services (Nagurney (2014)). It is well-known today that success is determined by how well the entire supply chain performs, rather than the performance of its individual entities. This dissertation contributes to the analysis, design, and management of the future Internet and supply chain networks with a focus on price and quality competition in service-oriented networks. Specifically, I focus on economic models for the Internet of the future by developing both a basic and a general network economic game theory model of a quality-based service-oriented Internet to study competition among service providers. To study and analyze the underlying dynamics of the various economic decision-makers, subsequently, I develop a dynamic network economic model of a service-oriented Internet with price and quality competition using projected dynamical systems theory. Then, to assess the prices for various contract durations at the demand markets, I consider a game theory model of a service-oriented Internet in which the network providers compete in usage service rates, quality levels, and duration-based contracts. Finally, I construct a model that captures the competition among manufacturers and freight service providers in a supply chain network. This model is the first one in the literature that handles both price and quality competition with multiple modes of shipment from both equilibrium and dynamic perspectives. For each model, I derive the governing equilibrium conditions and provide the equivalent variational inequality formulations. In order to illustrate the modeling framework and the algorithm, I present computed solutions to several numerical examples for each model as well as sensitivity analysis results. This dissertation is heavily based on the following papers: Saberi, Nagurney, and Wolf (2014), Nagurney et al. (2014a), Nagurney et al. (2015b), and Nagurney et al. (2015a) as well as additional results and conclusions

Pricing differentiated brokered internet services

Price war, as an important factor in undercutting competitors and attracting customers, has spurred considerable work that analyzes such conflict situation. However, in most of these studies, quality of service (QoS), as an important decision-making criterion, has been neglected. Furthermore, with the rise of service-oriented architectures, where players may offer different levels of QoS for different prices, more studies are needed to examine the interaction among players within the service hierarchy. In this paper, we present a new approach to modeling price competition in service-oriented architectures, where there are multiple service levels. In our model, brokers, as the intermediaries between end-users and service providers, offer different QoS by adapting the service that they obtain from lower-level providers so as to match the demands of their clients to the services of providers. To maximize profit, players at each level, compete in a Bertrand game, while they offer different QoS. To maintain an oligopoly market, we then describe underlying dynamics which lead to a Bertrand game with price constraints at the providers' level. Numerical examples demonstrate the behavior of brokers and providers and the effect of price competition on their market shares.http://www.cs.bu.edu/fac/matta/Papers/sdp2016.pdfAccepted manuscrip

The effect of competition among brokers on the quality and price of differentiated internet services

Price war, as an important factor in undercutting competitors and attracting customers, has spurred considerable work that analyzes such conflict situation. However, in most of these studies, quality of service (QoS), as an important decision-making criterion, has been neglected. Furthermore, with the rise of service-oriented architectures, where players may offer different levels of QoS for different prices, more studies are needed to examine the interaction among players within the service hierarchy. In this paper, we present a new approach to modeling price competition in (virtualized) service-oriented architectures, where there are multiple service levels. In our model, brokers, as the intermediaries between end-users and service providers, offer different QoS by adapting the service that they obtain from lower-level providers so as to match the demands of their clients to the services of providers. To maximize profit, players, i.e. providers and brokers, at each level compete in a Bertrand game while they offer different QoS. To maintain an oligopoly market, we then describe underlying dynamics which lead to a Bertrand game with price constraints at the providers' level. Numerical simulations demonstrate the behavior of brokers and providers and the effect of price competition on their market shares.This work has been partly supported by National Science Foundation awards: CNS-0963974, CNS-1346688, CNS-1536090 and CNS-1647084

Towards Run-Time Verification of Compositions in the Web of Things using Complex Event Processing

Following the vision of the Internet of Things, physical world entities are integrated into virtual world things. Things are expected to become active participants in business and social processes. Then, the Internet of Things could benefit from the Web Service architecture like today’s Web does, so Future ser-vice-oriented Internet things will offer their functionality via service-enabled in-terfaces. In previous work, we demonstrated the need of considering the behav-iour of things to develop applications in a more rigorous way, and we proposed a lightweight model for representing such behaviour. Our methodology relies on the service-oriented paradigm and extends the DPWS profile to specify the order with which things can receive messages. We also proposed a static verifi-cation technique to check whether a mashup of things respects the behaviour, specified at design-time, of the composed things. However, a change in the be-haviour of a thing may cause that some compositions do not fulfill its behaviour anymore. Moreover, given that a thing can receive requests from instances of different mashups at run-time, these requests could violate the behaviour of that thing, even though each mashup fulfills such behaviour, due to the change of state of the thing. To address these issues, we present a proposal based on me-diation techniques and complex event processing to detect and inhibit invalid invocations, so things only receive requests compatible with their behaviour.Work partially supported by projects TIN2008-05932, TIN2012-35669, CSD2007-0004 funded by Spanish Ministry MINECO and FEDER; P11-TIC-7659 funded by Andalusian Government; and Universidad de Málaga, Campus de Excelencia Internacional Andalucía Tec

Dynamic verification of mashups of service-oriented things through a mediation platform

The new Internet is evolving into the vision of the Internet of Things, where physical world entities are integrated into virtual world things. Things are expected to become active participants in business, information and social processes. Then, the Internet of Things could benefit from the Web Service architecture like today’s Web does; so Future service-oriented Internet things will offer their functionality via service-enabled interfaces. As demonstrated in previous work, there is a need of considering the behaviour of things to develop applications in a more rigorous way. We proposed a lightweight model for representing such behaviour based on the service-oriented paradigm and extending the standard DPWS profile to specify the (partial) order with which things can receive messages. To check whether a mashup of things respects the behaviour, specified at design-time, of composed things, we proposed a static verification. However, at run-time a thing may change its behaviour or receive requests from instances of different mashups. Then, it is required to check and detect dynamically possible invalid invocations provoked by the behaviour’s changes. In this work, we extend our static verification with an approach based on mediation techniques and complex event processing to detect and inhibit invalid invocations, checking that things only receive requests compatible with their behaviour. The solution automatically generates the required elements to perform run-time validation of invocations, and it may be extended to validate other issues. Here, we have also dealt with quality of service and temporal restrictions

Cloud computing services: taxonomy and comparison

Cloud computing is a highly discussed topic in the technical and economic world, and many of the big players of the software industry have entered the development of cloud services. Several companies what to explore the possibilities and benefits of incorporating such cloud computing services in their business, as well as the possibilities to offer own cloud services. However, with the amount of cloud computing services increasing quickly, the need for a taxonomy framework rises. This paper examines the available cloud computing services and identifies and explains their main characteristics. Next, this paper organizes these characteristics and proposes a tree-structured taxonomy. This taxonomy allows quick classifications of the different cloud computing services and makes it easier to compare them. Based on existing taxonomies, this taxonomy provides more detailed characteristics and hierarchies. Additionally, the taxonomy offers a common terminology and baseline information for easy communication. Finally, the taxonomy is explained and verified using existing cloud services as examples

SLA Establishment with Guaranteed QoS in the Interdomain Network: A Stock Model

The new model that we present in this paper is introduced in the context of guaranteed QoS and resources management in the inter-domain routing framework. This model, called the stock model, is based on a reverse cascade approach and is applied in a distributed context. So transit providers have to learn the right capacities to buy and to stock and, therefore learning theory is applied through an iterative process. We show that transit providers manage to learn how to strategically choose their capacities on each route in order to maximize their benefits, despite the very incomplete information. Finally, we provide and analyse some simulation results given by the application of the model in a simple case where the model quickly converges to a stable state.Comment: 19 pages, 19 figures, IJCNC, http://airccse.org/journal/cnc/0711cnc13.pd