Invited Talks

Tara Javidi

Department of Electrical and Computer Engineering

University of California San Diego, USA

Rate–Reliability Tradeoff in Two-Dimensional Visual Search

By: Mohammad Naghshvar and Tara Javidi

Abstract: Consider the problem of sequentially searching for a single target in a uniform image. Let the image be divided into M × M equal sized segments where M determines the resolution of the search. In each step, the player can visually inspect an allowable combination of the segments and the outcome of the inspection is noisy. The goal is to find the segment that contains the target quickly and accurately. In this paper, a fundamental trade-off between the rate and reliability of information acquisition is established. More specifically, it is shown that as the expected duration of search increases there is a fundamental tension between increasing the resolution of the search versus decreasing the error probability. The proof relies on a lower bound, obtained via a dynamic programming formulation, and an achievability scheme that maximizes the Extrinsic Jensen-Shannon divergence in each step of the search.

Tara Javidi studied electrical engineering at Sharif University of Technology, Tehran, Iran from 1992 to 1996. She received the MS degrees in electrical engineering (systems), and in applied mathematics (stochastics) from the University of Michigan, Ann Arbor, in 1998 and 1999, respectively. She received her Ph.D. in electrical engineering and computer science from the University of Michigan, Ann Arbor, in 2002. From 2002 to 2004, she was an assistant professor at the Electrical Engineering Department, University of Washington, Seattle. She joined University of California, San Diego, in 2005, where she is currently an associate professor of electrical and computer engineering.

Mohsen Razavi

School of Electronic and Electrical Engineering

University of Leeds, UK

Architectural Considerations in Hybrid Quantum-Classical Networks

By: Nicolo Lo Piparo, Christiana Panayi, Divya Ramanujachari, David E. Bruschi and Mohsen Razavi

Abstract: Emerging technologies in quantum communications are anticipated to find their way, sooner or later, into people's homes and be part of service packages offered by the telecommunication industry. The integration of the two technologies—quantum and classical—is, however, a challenging task. Classical systems are designed to transfer large amounts of data quickly and reliably, whereas quantum systems' imminent objective is information security. In this talk, three network architectures, compatible with passive optical networks, for future hybrid quantum-classical networks are proposed and compared. These setups rely on three different schemes for quantum key distribution (QKD): BB84, entanglement-based QKD, and measurement-device-independent QKD (MDI-QKD). It turns out that, while for small-to-moderate-size networks BB84 supports the highest secret key generation rate, it will cost almost twice as much as other setups. For larger networks, MDI-QKD offers the highest key rate if fast single-photon detectors are employed. Entanglement-based networks offer the longest security distance among the three setups. MDI-QKD is, however, the only resilient architecture to detection loopholes and its less demanding end-user technology would further make it the favorite system. Entanglement-based and MDI-QKD setups can both be combined with quantum repeater systems to allow long-distance QKD with no trust constraints on the service provider.

Mohsen Razavi received his B.Sc. and M.Sc. degrees (with honors) in Electrical Engineering from Sharif University of Technology, Tehran, Iran, in 1998 and 2000, respectively. From August 1999 to June 2001, he was a member of research staff at the Iran Telecommunications Research Centre, Tehran, Iran, working on all-optical CMDA networks and the possible employment of optical amplifiers in such systems. He joined the Research Laboratory of Electronics, at the Massachusetts Institute of Technology (MIT), in 2001 to pursue his Ph.D. degree in Electrical Engineering and Computer Science, which he completed in 2006. His doctoral thesis covers a variety of topics related to the implementation of long-distance quantum communication systems. He continued his work at MIT as a Post-doctoral Associate during Fall 2006, before joining the Institute for Quantum Computing at the University of Waterloo as a Post-doctoral Fellow in January 2007. Since September 2009, he is a faculty member at the School of Electronic and Electrical Engineering at the University of Leeds. Dr Razavi is a recipient of the MIT-HP Alliance Fellowship and the FP7 Marie-Curie International Reintegration Grant. Working at the intersection of classical and quantum communications, his research interests include a variety of problems in classical optical communications, as well as quantum mechanical problems in quantum optics, quantum cryptography, and quantum networking.

S. Jamaloddin Golestani

Department of Electrical Engineering

Sharif University of Technology, Iran

Unified Treatment of Network Routing, Flow Control and Scheduling

Abstract: Network routing, flow control, and scheduling are fundamentally interrelated tasks, and can be viewed as various forms of resource allocation in a wired or wireless network. In this talk, we first present a historical overview of the development of distributed algorithms for performing these tasks, based on a unified convex optimization framework. We then propose a new algorithm for joint routing, flow control, and scheduling, derived from new methods of formulating or solving the convex problem. We show that the performance of the proposed algorithm is far superior to the existing ones.

S. Jamaloddin Golestani was born in Iran in 1955. He completed the B.S. program of electrical engineering at Sharif University of Technology in 1973, and the S.M. and Ph.D. programs of electrical engineering and computer science at the Massachusetts Institute of Technology in 1976 and 1979, respectively. Besides 16 years of academic experience in Iran, he has spent 17 years (1988-2005) at the networking research departments of Bell communications Research, Morristown, NJ, and Bell Laboratories, Murray Hill, NJ. He is currently affiliated with the EE department of Sharif University of Technology, Tehran, Iran. In 1979, he originated the optimization approach to network flow control. In 1990, by the invention of the stop-and-go queueing, he demonstrated the feasibility of congestion-free communication without per-session scheduling. His invention of the self-clocked fair queueing in 1994 provided the first feasible realization of fair queueing in high speed networks and helped start an active branch of research in this field. He served on the editorial board of the IEEE/ACM transactions on networking from 1999 to 2001. He is the recipient of the IEEE Fellow award in 2000 with the citation “for contributions to the theory of congestion control and provision of fairness and guaranteed services in packet networks”. His current research interests are network control and optimization, distributed computations, scheduling algorithms, cross-layer design of wireless networks, and network coding and information theory.

Farzad Parvaresh

Department of Electrical Engineering

University of Isfahan, Iran

On Computing Half-duplex Relaying Capacity in Networks with Orthogonal Channels

By: Farzad Parvaresh, Raul Etkin, Ilan Shomorony and Salman Avestimehr

Abstract: We consider computing the capacity of half-duplex relay networks with orthogonal channels. In such networks, if the network has a layered structure, we show that the capacity can be computed in polynomial using the ellipsoid method. Moreover, for networks with local connectivity, such that the connectivity radius is a constant independent of size of the network, a polynomial time algorithm is presented to compute the capacity.

Farzad Parvaresh is currently an Assistant Professor in the Department of Electrical Engineering, University of Isfahan, Isfahan, Iran. He received the Ph.D. and M.S. degrees both in electrical and computer engineering from the University of California, San Diego in 2003 and 2007 respectively. Prior to that, he obtained his B.S. in electrical engineering from the Sharif University of Technology, Tehran, Iran in 2001. He was a postdoctoral scholar in the Center for Mathematics of Information (CMI) at the California Institute of Technology, Pasadena, CA during 2007-2008 and a visiting researcher in the Information Theory Research Group at Hewlett-Packard Laboratories, Palo Alto, CA during 2010-2012. His current research interests are in the areas related to information theory and wireless communication networks and signal processing. Dr. Parvaresh received the best paper award from the 46th annual IEEE symposium on Foundations Of Computer Science (FOCS) in 2005, and awarded the Silver medal in the 28th International Physics Olympiad in 1997.

Invited Talks

May 8 and 9, 2013

Sharif University of Technology

Tehran, Iran

Home

Call for Papers

Paper Submission

Technical Program Committee