SubjectSpectrum Sharing: How much to give?
Date2018.06.18 (Mon) 10:00-12:00
SpeakerProf. Manjunath (Dept of Electrical Engineering, Indian Institute of Technology, Bombay)
PlaceN1 B/D #201
Competition between service providers is believed to improve market efficiency. On the other hand, fragmentation of expensive resources, e.g., spectrum for wireless services, between providers can introduce inefficiencies in resource utilisation and worsen overall system performance. In such cases, resource pooling among the independent service providers can be used to improve overall system performance. For providers to agree upon resource pooling in competitive environments, it has to be
beneficial to all of them. However, the traditional notion of resource pooling, which implies full sharing, need not have this property. For example, with full pooling, one of the providers may be worse off and hence have no incentive to share. We propose the bounded overflow partial resource sharing model as a generalization of full pooling and which has the feature of sharing that is beneficial to all participants. Here each provider contributes a fraction of its resources to a common pool which can be used all the providers.
We formally define and analyze the bounded overflow model, for two service providers, each of which is an Erlang-B loss system with the blocking probabilities as the performance measure. We show that there always exist partial sharing configurations that are beneficial to both providers independently of the load and the number of circuits of each of the providers. A key result is that the Pareto frontier has at least one of the providers sharing all its resources in the common pool. Furthermore, full pooling may not lie inside this Pareto set. The choice of the sharing configurations within the Pareto set is formalized based on bargaining theory. Another key result is that both the Kalai-Smorodinsky and the egalitarian solutions are unique in spite of the non-convexity of the utility set. Finally, large system approximations of the blocking probabilities in the quality-efficiency-driven regime are presented.
D. Manjunath received his BE from Mysore University, MS from IIT Madras and PhD from Rensselaer Polytechnic Institute in 1986, 1989, and 1993 respectively. He has been with the Electrical Engineering Department of IIT Bombay since July 1998 where he is now an Institute Chair Professor. He has previously worked in the Corporate R&D Center of General Electric in Scehenectady NY (1990), Computer and Information Sciences Department of the University of Delaware (1992-93), Computer Science Department, University of Toronto (1993-94) and the Department of Electrical Engineering of IIT Kanpur (1994--98). At IIT Bombay, he was Head of the Computer Centre during 2011-15. His research interests are in the general areas of communication networks and performance analysis. His recent research has concentrated on random networks with applications in wireless and sensor networks, network pricing and queue control. He is a recipient of the best paper award at ACM SIGMETRICS 2010. He is an associate editor of IEEE Transactions on Networking, Queueing Systems: Theory and Applications, and of Sadhana: The Proceedings of the Indian Academy of Sciences. He was TPC chair for COMSNETS 2011 and NCC 2015 and general chair for ACM MobiHoc 2013 and COMSNETS 2015. He is a coauthor of two textbooks, "Communication Networking: An Analytical Approach" (May 2004) and "Wireless Networking (Apr 2008), both of which are published by Morgan-Kaufman Publishers.