Efficient discovery and resource allocation is one of the challenges of current Peer-to-Peer systems. In centralized approaches, the user requests can be matched to the fastest, cheapest or most available resource. This approach, however, shows scalability limits. In decentralized models, the functionality of the system is often more important than achieving assignments which reduce its overall...

this paper addresses the mixed integer reliability redundancy allocation problems to determine simultaneous allocation of optimal reliability and redundancy level of components based on three objective goals. system engineering principles suggest that the best design is the design that maximizes the system operational effectiveness and at the same time minimizes the total cost of ownership (tco...

With the rapid development of economy, challenges faced by enterprises are becoming more and severe. In order to enhance core competitiveness themselves, pay attention accounting cost accounting. However, for a long time, have been using traditional costing methods, which greatly hampered enterprises. The Fourier transform (FT) algorithm is commonly used information transformation method, can s...

In this project, we have developed a framework for resource allocation in a multi user cooperative wireless network. We have considered centralized and decentralized node-relay assignment with the objective of maximizing the sum throughput. We present an efficient polynomial time centralized assignment algorithm to achieve this objective, and also investigate efficient decentralized schemes tha...

A dynamic spatial model is constructed where there is a role for money and for centralized payments arrangements, and where there are aggregate fluctuations driven by fluctuations in aggregate productivity. With decentralized monetary exchange and no centralized payments arrangements, there is price level indeterminacy, and the equilibrium allocation is inefficient. A private clearinghouse arra...

In this paper, we present provably-good distributed task allocation (assignment) algorithms for a heterogeneous multi-robot system where the tasks form disjoint groups and there are constraints on the number of tasks a robot can do (both within the overall mission and within each task group). Our problem is motivated by applications where multiple robots with heterogeneous capabilities have to ...

The explosive growth of Internet users, the increased user demand for bandwidth, and the declining cost of technology have all resulted in the emergence of new classes of high-speed distributed IP-router architectures with packet-forwarding rates on the order of gigabits, or even terabits, per second. This paper develops an analytical framework for modeling and analyzing the impact of technolog...