The Community for Technology Leaders
RSS Icon
Subscribe
Bangkok
Jan. 28, 2013 to Jan. 30, 2013
ISBN: 978-1-4673-5740-1
pp: 365-370
Hyunggon Park , Multimedia Communications and Networking Laboratory Ewha Womans University, Seoul, Korea
ABSTRACT
Efficient and fast resource allocation has become important as the multimedia applications are deployed over multi-user and resource constrained networks. In order to ensure the Quality of Service (QoS) and the collaboration among users resource management strategies based on the cooperative game theory have been proposed. Specifically, we deploy the Nash bargaining solution (NBS) for fair and optimal resource allocation while explicitly considering delay constraints, minimum quality and multimedia characteristics of each user. Moreover, we consider a time-varying channel condition where a fast resource allocation is essential for ensuring QoS. In order to reduce the computational complexity required to find the NBS, we propose a low complexity algorithm based on a transformation that exploits the relationship between feasible utility sets adjacent over time. We show that the complexity required to find the NBS based on the proposed algorithm can be significantly reduced with improved accuracy.
INDEX TERMS
Intra NBS, Multimedia resource fair allocation, Nash bargaining solution (NBS), gradual bargaining
CITATION
Hyunggon Park, "Transformation based low complexity algorithm for Nash bargaining solutions in dynamic networks", ICOIN, 2013, 2013 International Conference on Information Networking (ICOIN), 2013 International Conference on Information Networking (ICOIN) 2013, pp. 365-370, doi:10.1109/ICOIN.2013.6496405
46 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool