Market mechanisms for network resource sharing
Market mechanisms for network resource sharing
Convex Optimization
Efficiency Loss in a Network Resource Allocation Game
Mathematics of Operations Research
Double Auction Protocols for Resource Allocation in Grids
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
A new strategy for bidding in the network-wide progressive second price auction for bandwidth
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Network optimization and control
Foundations and Trends® in Networking
Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding
IEEE Transactions on Parallel and Distributed Systems
Optimal mechanism design and money burning
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
VCG auction-based bandwidth allocation with network coding in wireless networks
ACACOS'11 Proceedings of the 10th WSEAS international conference on Applied computer and applied computational science
Behavior modeling for spectrum sharing in wireless cognitive networks
Wireless Networks
Hi-index | 0.07 |
Auction mechanisms are used for allocating a resource among multiple agents with the objective to maximize social welfare. What makes auctions attractive is that they are agnostic to utility functions of agents. Auctions involve a bidding method by agents-buyers, which is then mapped by a central controller to an allocation and a payment for each agent. In autonomic networks comprising self-interested nodes with different needs and utility functions, each entity possesses some resource and can engage in transactions with others to achieve its needs. In fact, efficient network operation relies on node synergy and multi-lateral resource trading. Nodes face the dilemma of devoting their limited resource to their own benefit versus acting altruistically and anticipating to be aided in the future. Wireless ad-hoc networks, peer-to-peer networks and disruption-tolerant networks are instances of autonomic networks where the challenges above arise and the traded resource is energy, bandwidth and storage space respectively. Clearly, the decentralized complex node interactions and the double node role as resource provider and consumer amidst resource constraints cannot be addressed by single-sided auctions and even more by mechanisms with a central controller. We introduce a double-sided auction market framework to address the challenges above. Each node announces one bid for buying and one for selling the resource.We prove that there exist bidding and charging strategies that maximize social welfare and we explicitly compute them. We generalize our result to a generic network objective. Nodes are induced to follow these strategies, otherwise they are isolated by the network. Furthermore, we propose a decentralized realization of the double-sided auction with light-weight network feedback. Finally, we introduce a pricing method which does not need a charging infrastructure. Simulation results verify the desirable properties of our approach.