CTS Events
November 14, 2012

Dr. Nebiyou Tilahun, UPP, presents a seminar entitled "An agent based model of origin destination estimation (ADOBE)" Wednesday, November 14th at 4:00 pm in Rm 1127 SEO


November 7, 2012

Mr. Thomas Murtha, CMAP, will address the CTS-IGERT community at 4:00 p.m. in Room 1127 SEO.


October 24, 2012

Please join us in welcoming Dr. Bo Zou, CME, on Wednesday, October 24th, Room 1127 SEO, 4:00 p.m.


CTS Happenings
September 25, 2012

Award Received by Joshua Auld, CTS-IGERT alumnus.


April 20, 2012

Congratulations to James Biagioni, CTS Fellow and CS PhD candidate, winner of the Dean's Scholar award.


January 2, 2012

James Biagioni, CTS Fellow, receives "Best Presentation Award" at SenSys2011


July 30, 2010

Dr. Ouri Wolfson, Dr. Phillip Yu, and Leon Stenneth, CS student and CTS Associate, recently had a paper accepted to the 6th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2010).


April 1, 2011

CTS welcomes Dr. Nitin Vaidya, University of Illinois Urbana-Champaign Department of Electrical and Computer Engineering, Friday, April 1st at 2:30 p.m.

"Multi-Valued Byzantine Consensus"

The "distributed consensus" problem arises in many contexts in distributed computing. Consensus in the presence of Byzantine faults is of interest when some of the nodes in the distributed system may fail or be compromised. Given its importance, there is a rich history of research on algorithms for Byzantine consensus. In this talk, we will first present a brief overview of the past work on the problem, followed by our research on "multi-valued" consensus, which allows the nodes to reach agreement on a long message (as opposed to agreeing on a single bit value). In particular, we will discuss two results:

* We will present an efficient algorithm for consensus in presence of Byzantine failures. Our algorithm achieves L-bit consensus among n nodes with optimal communication complexity O(nL) bits, for large L.

* Despite the rich history of research on consensus (and the related problem of Byzantine broadcast), the past research has ignored the impact of the capacity of the underlying communication network on the performance of distributed agreement. We will discuss an algorithm that takes the network capacity into account to optimize the performance of Byzantine broadcast.

Nitin Vaidya received the Ph.D. from the University of Massachusetts at Amherst. He is a Professor of Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign (UIUC), where he previously served as the Director of the Illinois Center for Wireless Systems (ICWS). He has held visiting positions at the Thomson Paris Research Lab, TU-Berlin, Indian Institute of Technology-Bombay, Microsoft Research, and Sun Microsystems, as well as a faculty position at the Texas A&M University. He co-authored papers that received awards at the 2007 ACM MobiHoc, 1998 ACM MobiCom, 2003 Personal Wireless Communications (PWC), 2010 ICDCN and 2010 WWIC conferences. Nitin Vaidya is a recipient of a CAREER award from the U.S. National Science Foundation. He has served as Editor-in-Chief for the IEEE Transactions on Mobile Computing, and Editor-in-Chief for ACM SIGMOBILE publication MC2R, and as the General Chair for the joint 2010 ACM MobiCom-MobiHoc event. Nitin is a Fellow of the IEEE.