The last decade has seen an unprecedented growth in the demand for wireless services. These services are fueled by applications that often require not only high data rates, but also very low latency to function as desired. However, as wireless networks grow and support increasingly large numbers of users, these control algorithms must also incur only low complexity in order to be implemented in practice. Therefore, there is a pressing need to develop wireless control algorithms that can achieve both high throughput and low delay, but with low-complexity operations. While these three…mehr
The last decade has seen an unprecedented growth in the demand for wireless services. These services are fueled by applications that often require not only high data rates, but also very low latency to function as desired. However, as wireless networks grow and support increasingly large numbers of users, these control algorithms must also incur only low complexity in order to be implemented in practice. Therefore, there is a pressing need to develop wireless control algorithms that can achieve both high throughput and low delay, but with low-complexity operations. While these three performance metrics, i.e., throughput, delay, and complexity, are widely acknowledged as being among the most important for modern wireless networks, existing approaches often have had to sacrifice a subset of them in order to optimize the others, leading to wireless resource allocation algorithms that either suffer poor performance or are difficult to implement. In contrast, the recent results presented inthis book demonstrate that, by cleverly taking advantage of multiple physical or virtual channels, one can develop new low-complexity algorithms that attain both provably high throughput and provably low delay. The book covers both the intra-cell and network-wide settings. In each case, after the pitfalls of existing approaches are examined, new systematic methodologies are provided to develop algorithms that perform provably well in all three dimensions.
Produktdetails
Produktdetails
Synthesis Lectures on Learning, Networks, and Algorithms
Bo Ji received his B.E. and M.E. degrees in Information Science and Electronic Engineering from Zhejiang University, Hangzhou, China, in 2004 and 2006, respectively, and his Ph.D. degree in Electrical and Computer Engineering from The Ohio State University, Columbus, OH, in 2012. He is currently an Assistant Professor of the Department of Computer and Information Sciences at Temple University. He is also a faculty member of the Center for Networked Computing (CNC) of Temple University. Prior to joining Temple University, he was a Senior Member of Technical Staff with AT&T Labs, San Ramon, CA, from January 2013 to June 2014. His research interests are in the modeling, analysis, control, and optimization of complex network systems, such as communication networks, cloud systems, and datacenters. Xiaojun Lin received his B.S. from Zhongshan University, Guangzhou, China, in 1994, and his M.S. and Ph.D. degrees from Purdue University, West Lafayette, Indiana, in 2000 and 2005, respectively.He is currently an Associate Professor of Electrical and Computer Engineering at Purdue University. His research interests are in the analysis, control, and optimization of wireless and wireline communication networks. He received the IEEE INFOCOM 2008 best paper award and 2005 best paper of the year award from the Journal of Communications and Networks. His paper was also one of two runner-up papers for the best-paper award at IEEE INFOCOM 2005. He received the NSF CAREER award in 2007. He is currently serving as an Associate Editor for IEEE/ACM Transactions on Networking and an Area Editor for (Elsevier) Computer Networks journal, and he has served as a Guest Editor for (Elsevier) Ad Hoc Networks journal. Ness B. Shroff received his B.S. degree from the University of Southern California in 1988, his M.S.E. degree from the University of Pennsylvania in 1990, and his M.Phil and Ph.D. degrees from Columbia University, NY, in 1993 and 1994, respectively. He immediately joined Purdue University as an Assistant Professor in 1994, and became a Professor in the School of Electrical and Computer Engineering in 2003, and Director of CWSA in 2004, a university-wide center on wireless systems and applications. In 2007, he joined the ECE and CSE departments at The Ohio State University, where he holds the Ohio Eminent Scholar Chaired Professorship in Networking and Communications. His research interests span the areas of communication, networking, storage, cloud, recommender, social, and cyberphysical systems. He is especially interested in fundamental problems in learning, design, control, performance, pricing, and security of these complex systems. He currently serves as the Editor-at-Large of the IEEE/ACM Transactions on Networking, and the Senior Editor of the IEEE Transactions on Control of Networked Systems. He also serves on the Editorial Board of the IEEE Network Magazine. He has served on the technical and executive committees of several major conferences and workshops. He was the TPC Co-Chair of the IEEE INFOCOM03, the ACM Mobihoc08, and the General Chair of the IEEE CCW99 and WICON08. He has received numerous awards for his work, including two best paper awards at the IEEE INFOCOM in 2006 and 2008, the flagship conference of the field. He has also received the IEEE WiOPT 2013, the IEEE WiOpt 2012, and the IWQoS Best Student Paper Award, the 2005 Best Paper of the Year Award for the Journal of Communications and Networking, the 2003 Best Paper of the Year Award for Computer Networks, and the NSF CAREER Award in 1996. His IEEE INFOCOM 2013 and IEEE INFOCOM 2005 papers were also selected as runner-up papers. He is among the list of highly cited researchers from Thomson Reuters ISI (2014 and 2015), and in the Thomson Reuters book The World's Most Influential Scientific Minds. In 2014, he received the IEEE INFOCOM Achievement Award for seminal contributions to scheduling and resource allocation in wireless networks.
