Resources allocation is complex undertaking problem in distributed resources share problems. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. By using economic models, mechanisms such as auctions may appropriate for the management of these problems. In this paper, we provide the design and theoretical analysis of auction mechanism, design the details of prices announcement, agent creation and resource situation submission, bidding rules, and temporary allocation rules. A simulation environment is established and the simulation experiments indicate that the algorithm meet the requirements of user's QoS better than the conventional algorithms.
We discuss a two-stage mechanism for e-procurement operations, which implements a multi-attribute combinatorial auction in first stage, followed by bargaining in the second stage. We find that an important difference between single-unit and heterogeneous e-procurement auctions is the existence of different types among the winning suppliers. In the auction stage, we discuss incentive-compatible bidding strategies for the procurement suppliers, and how the buyer should go about solving the winner determination problem. In the bargaining stage, the buyer can implement a strategy that views the winning suppliers as though they are in two different groups. We derive the decision conditions for the buyer's different procurement strategies. The most important finding is that, compared with classical Vickery-Clarke-Groves mechanism, the proposed mechanism improves social welfare.
The proliferation of computer network technology in Supervisory Control and Data Acquisition (SCADA) makes security issues more and more prominent. In order to protect the SCADA system, researchers should analyse potential vulnerabilities and propose relevant solutions to deal with malicious attacks. However, it is difficult to evaluate the abilities of the secure solutions being developed, because most research institutes lack modelling tools. Thus, building a SCADA test bed is indispensable to carry out some necessary experiments for evaluating those solutions before deployment. Relevant experiments can be conducted with such test beds. This paper analyses the construction schemes of the SCADA test beds proposed and shows the components and protocols used to construct such test beds. We also describe a series of attack experiments and mitigation strategies. Finally, we give the future directions in this research field.
The article focuses on how to integrate all the phases of Internet marketing process into a seamless pipeline. The current techniques used in three main phases: (1) customer targeting; (2) ads piece designing; and (3) marketing budget allocation, are described in detail to reveal the cohering inside of searching optimal marketing strategies.
It has been shown that the Multi-Path Transmission Control Protocol (MPTCP) can improve throughput, robustness and resilience of network transport. This paper seeks to discover the relationship of buffer size with throughput and congestion control algorithms, based on the statistical predictive modelling method. In spite of rapid growth of the implementations of MPTCP, the theoretical and fundamental question - how large the buffer size of MPTCP should be to meet the network traffic remains unaddressed, although there were graphic illustrations and descriptive discussions about it.
Whereas grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing grid resources is a complex undertaking. In this work, we consider the problem of engineering agents that act as proxies for the procurement of computational and data resources. Since applications may require multiple grid services, mechanisms such as single-good auctions may not be appropriate for the management of these services, we propose a new scheduling algorithm based on iterative combinatorial auction. We provide the design of prices announcement, agent creation and resource situation submission, bidding rules, and temporary allocation rules. A simulation environment is established based on the Gridsim toolkit and the simulation experiments indicate that the algorithm needs less communication and meet the requirements of userpsilas QoS better than the conventional algorithms.
Whereas grids enable the sharing, selection, query and aggregation of geographically distributed resources for solving large-scale problems, providing efficient resource allocation mechanism managing Grid resources is a complex undertaking. In this work, we have investigated several famous schedule methods proposed by Nimrod-G, a famous computational economy framework for regulating the supply and demand for resources. We proposed a new scheduling algorithm, called DBC deadline and cost optimization, which extends the DBC cost optimization and time optimize algorithm, keeping the cost and time optimization at the minimum. A compare of these several schedule algorithms that schedules user's Bag of Task applications on divisible auction-based resource allocation systems is executed. It is shows that the structure of the schedule method allows quasilinear characterization of a wide variety of broker tasks. We prove that the auction has a unique Nash equilibrium and propose a decentralized bidding strategy.
'/%3e%3cuse xlink:href='%23a' transform='rotate(23.036 .093 25.536)'/%3e%3cuse xlink:href='%23a' transform='rotate(45.87 1.273 16.18)'/%3e%3cuse xlink:href='%23a' transform='rotate(69.945 .996 12.078)'/%3e%3cuse xlink:href='%23a' transform='rotate(20.66 -19.689 31.932)'/%3e%3c/svg%3e)