30 research outputs found
Automated Bidding in Computing Service Markets. Strategies, Architectures, Protocols
This dissertation contributes to the research on Computational Mechanism Design by providing novel theoretical and software models - a novel bidding strategy called Q-Strategy, which automates bidding processes in imperfect information markets, a software framework for realizing agents and bidding strategies called BidGenerator and a communication protocol called MX/CS, for expressing and exchanging economic and technical information in a market-based scheduling system
Economic-based Distributed Resource Management and Scheduling for Grid Computing
Computational Grids, emerging as an infrastructure for next generation
computing, enable the sharing, selection, and aggregation of geographically
distributed resources for solving large-scale problems in science, engineering,
and commerce. As the resources in the Grid are heterogeneous and geographically
distributed with varying availability and a variety of usage and cost policies
for diverse users at different times and, priorities as well as goals that vary
with time. The management of resources and application scheduling in such a
large and distributed environment is a complex task. This thesis proposes a
distributed computational economy as an effective metaphor for the management
of resources and application scheduling. It proposes an architectural framework
that supports resource trading and quality of services based scheduling. It
enables the regulation of supply and demand for resources and provides an
incentive for resource owners for participating in the Grid and motives the
users to trade-off between the deadline, budget, and the required level of
quality of service. The thesis demonstrates the capability of economic-based
systems for peer-to-peer distributed computing by developing users'
quality-of-service requirements driven scheduling strategies and algorithms. It
demonstrates their effectiveness by performing scheduling experiments on the
World-Wide Grid for solving parameter sweep applications
An economic market for the brokering of time and budget guarantees
Grids offer best effort services to users. Service level agreements offer the opportunity to provide guarantees upon services offered, in such a way that it captures the users’ requirements, while also considering concerns of the service providers. This is achieved via a process of converging requirements and service cost values from both sides towards an agreement. This paper presents the intelligent scheduling for quality of service market-oriented mechanism for brokering guarantees upon completion time and cost for jobs submitted to a batch-oriented compute service. Web Services agreement (negotiation) is used along with the planning of schedules in determining pricing, ensuring that jobs become prioritised depending on their budget constraints. An evaluation is performed to demonstrate how market mechanisms can be used to achieve this, whilst also showing the effects that scheduling algorithms can have upon the market in terms of rescheduling. The evaluation is completed with a comparison of the broker’s capabilities in relation to the literature
Coordination in Service Value Networks - A Mechanism Design Approach
The fundamental paradigm shift from traditional value chains to agile service value networks (SVN) implies new economic and organizational challenges. This work provides an auction-based coordination mechanism that enables the allocation and pricing of service compositions in SVNs. The mechanism is multidimensional incentive compatible and implements an ex-post service level enforcement. Further extensions of the mechanism are evaluated following analytical and numerical research methods
Negotiated resource brokering for quality of service provision of grid applications
Grid Computing is a distributed computing paradigm where many computers often formed from different organisations work together so that their computing power may be
aggregated. Grids are often heterogeneous and resources vary significantly in CPU power, available RAM, disk space, OS, architecture and installed software etc. Added to this lack of uniformity is that best effort services are usually offered, as opposed to services that offer guarantees upon completion time via the use of Service Level Agreements (SLAs). The lack of guarantees means the uptake of Grids is stifled. The challenge tackled here is to add such guarantees, thus ensuring users are more willing to use the Grid given an obvious reluctance to pay or contribute, if the quality of the services returned lacks any guarantees.
Grids resources are also finite in nature, hence priorities need establishing in order to best meet any guarantees placed upon the limited resources available. An economic
approach is hence adopted to ensure end users reveal their true priorities for jobs, whilst also adding incentive for provisioning services, via a service charge.
An economically oriented model is therefore proposed that provides SLAs with bicriteria constraints upon time and cost. This model is tested via discrete event simulation
and a simulator is presented that is capable of testing the model. An architecture is then established that was developed to utilise the economic model for negotiating SLAs. Finally experimentation is reported upon from the use of the software developed when it was deployed upon a testbed, including admission control and steering of jobs within the Grid. Results are presented that show the interactions and relationship between the time
and cost constraints within the model, including transitions between the dominance of one constraint over the other and other things such as the effects of rescheduling upon the market
Multiple criteria decision making in application layer networks
This work is concerned with the conduct of MCDM by intelligent agents trading commodities in ALNs. These agents consider trustworthiness in their course of negotiation and select offers with respect to product price and seller reputation. --Grid Computing
Recommended from our members
Database Usability Enhancement in Data Exploration
Database usability has become an important research topic over the last decade. In the early days, database management systems were maintained by sophisticated users like database administrators. Today, due to the availability of data and computing resources, more non-expert users are involved in database computation. From their point of view, database systems lack ease of use. So researchers believe that usability is as important as the performance and functionality of databases and therefore developed many techniques such as natural language interface to enhance the ease of use of databases. In this thesis, we find some deeper technical issues in database usability, so we look at several core database technologies to further improve the ease of use of databases in two dimensions: we help users process data and exploit computing capacities.
We start by helping users find the data. In the real world, public data is everywhere on the Web, but it is scattered around. We extract a prototype relational knowledge base to solve this problem. We start from the most basic binary mapping relationships (sometimes also named bridge tables) between entities from the web. This mapping relationship facilitates many data transformation applications such as auto-correct, auto-fill, and auto-join.
After finding the data, we help users explore the data. When users issue queries to explore the data, their query results may contain too many items. So the system designer has to present a small subset of representative and diverse items rather than all items. This is known as the query result diversification problem. We propose the RC-Index, which helps to solve the diversification problem by significantly reducing the number of items that must be retrieved by the database to form a diverse set of a desired size. It is nearly an order of magnitude faster than the state-of-the-art and has a good performance guarantee, which improves the ease of use of databases in terms of querying.
Finally, we shift our focus from data to computing capacities. We propose a framework to help users choose configurations in the cloud. Cloud computing has revolutionized data analysis, but choosing the right configuration is challenging because the common pricing mechanism of the public cloud is too complicated. Users have to consider low-level resources to find the best plan for their computational tasks. To address this issue, we propose a new market-based framework for pricing computational tasks in the cloud. We introduce agents to help users configure their personalized databases, which improves the ease of use of databases in the cloud
Recommended from our members
Modeling Construction Competitive Bidding: An Agent-Based Approach
The construction industry is a complex, multi-level system that includes a large collection of independent, heterogeneous organizations and institutions and is associated with several economic sectors and markets. Because of its unique characteristics, the construction industry as one of the major economic sectors and contributors to the economic development of the nation needs its own specific and dedicated economics. The shortcomings of the existing methodologies call for the use of more sophisticated modeling tools that can capture more important aspects of the real world and its complexity in particular the interconnections among elements of the system, their idiosyncrasies, and emergent behavior. As a pioneer attempt in the exploration of a new theory of construction economics, this study aims to found the first building blocks of the comprehensive economic model of the construction industry. In this dissertation, an agent-based approach is applied to model the low-bid lump-sum construction competitive bidding by which most construction works are allocated. This model has several advantages over the previous analytical and empirical models including the capability of observing the bidding process dynamics, the interaction between the heterogeneous and learning agents, and the emergent bidding patterns arising from multiple scenarios of market conditions and contractors’ attributes. Then the model is used as a virtual laboratory for conducting a variety of experiments to answer several important research questions in the field of construction economics. The main research objectives of this study are to: (1) analyze the effectiveness of major quantitative methods in the bidding environment under a variety of market conditions (2) study the effect of contractors’ risk behavior, cost estimating and project management skills, and complexity of projects on contractors’ choice of optimal markup, long-term financial growth and market share (3) investigate the impact of risk behavior and need for work on contractors’ performance. The results presented in this dissertation offer new understandings and insights on the construction bidding environment and recommendations for both owners and contractors’ competitive success, which are not available using conventional approaches. In particular, results suggest that (1) using Friedman model can result in considerably higher market share whereas using Gates model can result in higher profit per project, (2) the optimal policy for contractors is moderation in both dimensions of risk attitude and need for work, (3) the comparative performance of slightly and extremely risk averse contractors are depending on level of cost estimating accuracy and project execution skills of contractors as well as the level of project complexities