Friday, September 7th, 2018

9:20 am9:30 am
Speaker: Derya Cansevar (ARO)
9:30 am10:00 am
Speaker: P.R. Kumar (Texas A&M University)

The traditional Groves mechanism assures incentive compatibility for static agents, but it does not extend to general dynamic stochastic systems. We identify an explicit class of games of broad interest for which mechanisms for incentive compatibility can be established. Motivated by energy markets, we also address the issue of ensuring budget balance and individual rationality. Joint work with Ke Ma.

Bio:
Dr. P. R. Kumar’s current focus includes Cyberphysical Systems, Security, Privacy, Autonomous Vehicles, Unmanned Air Vehicle Traffic Management, 5G, Wireless Networks, Power Systems, Control Theory, Information Theory, Stochastic Systems, Operations Research. He is a member of the U.S. National Academy of Engineering, The World Academy of Sciences, and the Indian National Academy of Engineering. He was awarded an honorary doctorate by ETH, Zurich. He has received the IEEE Field Award for Control Systems, the Donald Eckman Award of American Automatic Control Council, the Fred Ellersick Prize of IEEE Communications Society, the Outstanding Contribution Award of ACM SIGMOBILE, the Infocom Achievement Award, and a SIGMOBILE Test-of-Time Paper Award. He is a Fellow of IEEE and ACM Fellow. He was Leader of the Guest Chair Professor Group on Wireless Communication and Networking at Tsinghua University, is a Gandhi Distinguished Visiting Professor at IIT Bombay, and Honorary Professor at IIT Hyderabad. He was awarded the Distinguished Alumnus Award from IIT Madras, the Alumni Achievement Award from Washington University in St. Louis, and the Daniel Drucker Eminent Faculty Award from College of Engineering, University of Illinois.

10:00 am10:30 am
Speaker: John Tsitsiklis (MIT)

We provide a new perspective into the structural properties of the max-weight policy, a much studied centerpiece within the field of stochastic network scheduling. We argue that the deterministic max-weight dynamics have a key property: the effects of input (arrival) fluctuations on state trajectories are bounded by a constant multiple of the fluctuations of the cumulative arrival process. This fact, in conjunction with concentration assumptions on the arrival process, provides a new machinery for deriving old and new limiting results, e.g., on fluid limits or state space collapse. (Joint work with A. Sharifnassab and S. J. Golestani)

Bio
John N. Tsitsiklis received the B.S. degree in mathematics and the B.S., M.S., and Ph.D. degrees in electrical engineering from the Massachusetts Institute of Technology (MIT), Cambridge, MA, USA, in 1980, 1980, 1981, and 1984, respectively. His research interests are in systems, optimization, communications, control, and operations research. He has coauthored four books and several journal papers in these areas.

He is currently a Clarence J. Lebel Professor with the Department of Electrical Engineering and Computer Science, MIT, where he serves as the director of the Laboratory for Information and Decision Systems. He is a member of the National Academy of Engineering and holds  honorary doctorates from the Université catholique de Louvain, Louvain-la-Neuve, Belgium, and the Athens University of Economics and Business, Athens, Greece. Among other distinctions, he is a recipient of the ACM SIGMETRICS Achievement Award (2016) and the IEEE Control Systems Award (2018).

11:00 am11:30 am
Speaker: Costas Courcoubetis (SUTD)

The availability of drivers at a certain location affects the waiting time of passengers that arrive to be served by the platform. We introduce a queueing model for this waiting time and consider the effect on stability of available drivers’ mobility pattern, their willingness to accept rides in a given location, and the incentives offered by the platform. For any fixed number of drivers, we characterize the largest set of passenger arrival rates which can result to stable queues under some policy dictating the movement of available drivers and their acceptance of rides. It turns out that any such policy can be enforced by offering appropriate region-dependent rewards to drivers for passenger pick up. Next, we show that dynamic rewards which are proportional to the passenger queue lengths, have the property of stabilizing queues for any arrival rates within the stability region. Seen from the perspective of drivers, such rewards –which resemble surge pricing– maximize their utilization. This is joint work with Antonis Dimakis, AUEB.

Bio:
Prof. Costas A Courcoubetis was born in Athens, Greece and received his Diploma (1977) from the National Technical University of Athens, Greece, in Electrical and Mechanical Engineering, his MS (1980) and PhD (1982) from the University of California, Berkeley, in Electrical Engineering and Computer Science. He was MTS at the Mathematics Research Center, Bell Laboratories, Professor in the Computer Science Department at the University of Crete, Professor in the Department of Informatics at the Athens University of Economics and Business, and since 2013 Professor in the ESD Pillar, Singapore University of Technology and Design where he heads the Initiative for the Sharing Economy and co-directs the new ST-SUTD Center for Smart Systems. His current research interests are economics and performance analysis of networks and internet technologies, sharing economy, regulation policy, smart grids and energy systems, resource sharing and auctions. He is co-author with Richard Weber of “Pricing Communication Networks: Economics, Technology and Modeling” (Wiley, 2003).

11:30 am12:00 pm
Speaker: Francois Baccelli (UT Austin)

This talk features networks of coupled processor sharing queues in the Euclidean space, where customers arrive according to independent Poisson point processes at every queue, are served, and then leave the network. The coupling is through service rates. In any given queue, this rate is inversely proportional the interference seen by this queue, which is determined by the load in neighboring queues, attenuated by some distance-based path-loss function. The main focus is on the infinite grid network and translation invariant path-loss case.

The stability condition is identified. The minimal stationary regime is built using coupling from the past techniques. The mean queue size of this minimal stationary regime is determined in closed form using the rate conservation principle of Palm calculus. When the stability condition holds, for all bounded initial conditions, there is weak convergence to this minimal stationary regime; however, there exist translation invariant initial conditions for which all queue sizes converge to infinity.

Joint work with S. Foss (Edinburgh) and A. Sankararaman (Austin).

Bio:
F. Baccelli is Simons Math+X Chair in Mathematics and ECE at UT Austin.  His research directions are at the interface between Applied Mathematics and Communications. He is co-author of research monographs on point processes and queues, max plus algebras and network dynamics, stationary queuing networks, and stochastic geometry and wireless networks. He received the France Télécom Prize of the French Academy of Sciences in 2002, the ACM Sigmetrics Achievement Award in 2014, the 2014 Stephen O. Rice Prize, and the 2014 Leonard G. Abraham Prize Awards of the IEEE Communications Theory Society. He is a member of the French Academy of Sciences.

1:30 pm2:00 pm
Speaker: Don Towsley (UMass - Amherst)

Quantum information processing is at the cusp of having significant impacts on technology and society in the form of providing unbreakable security, ultra-high-precision distributed sensing with applications to metrology and science discovery (e.g., LIGO), much higher-rate deep space optical communications than possible with conventional systems, and polynomial speeds up on graphical search with implications to big data. Most of these applications are enabled by high-rate distributed shared entanglement between pairs and groups of users. A critical missing component that prevents crossing this threshold is a distributed infrastructure in the form of a world-wide "Quantum Internet"  to enable this. This motivates our study of quantum networks, namely what the right architecture is and how to operate it, i.e., route multiple quantum information flows, and allocate resources fairly and dynamically.

In this talk we review a specific quantum network architecture and present opportunities and challenges related to resource sharing among multiple parties of users.  In particular, we focus on the determination of the capacity region associated with a particular network, i.e., characterize the vector of user entanglement rates that can be supported by the network.  Throughout the talk we will focus on issues related to resource allocation based on global/local state information and the benefits of path diversity.

2:00 pm2:30 pm
Speaker: Andrea Goldsmith (Stanford University)

Wireless technology has enormous potential to change the way we live, work, and play over the next several decades. Future wireless networks will support 100 Gbps communication between people, devices, and the “Internet of Things,” with high reliability and uniform coverage indoors and out. The shortage of spectrum to support such systems will be alleviated by advances in massive MIMO and mmW technology as well as cognitive radios. Wireless technology will also enable smart and energy-efficient homes and buildings, automated highways and skyways, and in-body networks for monitoring, analysis and treatment of medical conditions. Breakthrough energy-efficiency architectures, algorithms and hardware will allow wireless networks to be powered by tiny batteries, energy-harvesting, or over-the-air power transfer. Finally, new communication systems based on biology and chemistry to encode bits will enable a wide range of new micro and macroscale applications. There are many technical challenges that must be overcome in order to make this vision a reality. This talk will describe what the wireless future might look like along with some of the innovations and breakthroughs required to realize this vision.

Bio
Andrea Goldsmith is the Stephen Harris professor in the School of Engineering and a professor of Electrical Engineering at Stanford University. She co-founded and served as Chief Technical Officer of Plume WiFi  and of Quantenna (QTNA), and she currently serves on the Corporate or Technical Advisory Boards of multiple public and private companies. She has also held industry positions at Maxim Technologies, Memorylink Corporation, and AT&T Bell Laboratories. Dr. Goldsmith is a member of the National Academy of Engineering and the American Academy of Arts and Sciences, a Fellow of the IEEE and of Stanford, and has received several awards for her work, including the ACM Athena Lecturer Award, the IEEE Comsoc Edwin H. Armstrong Achievement Award, the National Academy of Engineering Gilbreth Lecture Award, the Women in Communications Engineering Mentoring Award, and the Silicon Valley/San Jose Business Journal’s Women of Influence Award. She is author of the book ``Wireless Communications'' and co-author of the books ``MIMO Wireless Communications'' and “Principles of Cognitive Radio,” all published by Cambridge University Press, as well as an inventor on 29 patents. She has also launched and led several multi-university research projects. Her research interests are in information theory and communication theory, and their application to wireless communications and related fields. She received the B.S., M.S. and Ph.D. degrees in Electrical Engineering from U.C. Berkeley.

Dr. Goldsmith participates actively in committees and conference organization for the IEEE Information Theory and Communications Societies and has served on the Board of Governors for both societies. She has been a Distinguished Lecturer for both societies, served as the President of the IEEE Information Theory Society in 2009, founded and chaired the student committee of the IEEE Information Theory society, and is the founding chair of the IEEE TAB Committee on Diversity and Inclusion. At Stanford she has served as Chair of Stanford’s Faculty Senate and on its Advisory Board, Budget Group, Committee on Research, Planning and Policy Board, Commissions on Graduate and on Undergraduate Education, Faculty Women’s Forum Steering Committee, and Task Force on Women and Leadership.

3:00 pm3:45 pm
Speaker: Moderator: R. Srikant (UIUC)
Panelists: Mohammad Alizadeh (MIT), Balaji Prabhakar (Stanford), and Pramod Viswanath (UIUC)

The panel will discuss diverse emerging applications of networking to data centers, financial markets and blockchains, and new research trends such as the role of machine learning in network design.

4:00 pm4:05 pm
Speaker: Pravin Varaiya (UC Berkeley)

Pravin Varaiya is a Professor in the Department of Electrical Engineering and Computer Sciences at the University of California, Berkeley.  His current research is devoted to transportation networks and electric energy systems.   Varaiya has received the Field Medal of the IEEE Control Systems Society, and the Outstanding Researcher Award of the IEEE Intelligent Transportation Systems Society. He is a Fellow of IEEE, a Fellow of IFAC, a member of the National Academy of Engineering, and a Fellow of the American Academy of Arts and Sciences.

4:05 pm5:00 pm
Speaker: Jean Walrand (UC Berkeley)

In this presentation, I reflect on the lessons of forty years of dabbling in theory and playing a networking guy in the classroom.