Important Dates

ITC 21:
15-17 September 2009



ITC 21 is featuring 5 keynotes from worldwide experts on various topics.


Keynote I

Multi-Hop Wireless Networks

Catherine Rosenberg (University of Waterloo, Canada)


Wireless mesh networks (WMNs) are seen as a promising alternative to other (wired) broadband access technologies. In order to offer high throughput, they will have to be correctly configured by the operator in terms of routing, scheduling, power control, and rate adaptation.We present here a number of significant engineering insights on what makes a good configuration for medium- to large-size WMNs. We confirm that power control is useful but that the number of power levels might be less important than the actual values that are used. We also quantify the advantage of multi-hop over single-hop, show that multi-path optimal routing is not much more efficient than single-path optimal routing and that not all min-hop routing are equally efficient. We also find that the relationship between spatial reuse and network performance is not that straightforward.We then examine the importance of the interference model and show how simplistic models yield results that are qualitatively very different from the results obtained using a SINR-based model.Finally, we address the issue of lifetime and show interesting results on the tradeoff between throughput and lifetime.

Catherine Rosenberg is a Professor and a University Research Chair in Electrical and Computer Engineering at the University of Waterloo. She started her career in ALCATEL, France and then at AT&T Bell Labs., USA. From 1988-1996, she was afaculty member at the Department of Electrical and Computer Engineering, Ecole Polytechnique, Montréal, Canada. In 1996, she joined Nortel Networks in the UK where she created and headed the R&D Department in Broadband Satellite Networking. She was also a Visiting Professor in the Department of Electrical and Electronics Engineering at Imperial College. Dr. Rosenberg joined the faculty of the School of Electrical and Computer Engineering at Purdue University in August 1999 where she co-founded in May 2002 the Center for Wireless Systems and Applications (CWSA). She joined University of Waterloo on Sept 1st, 2004 as the Chair of the Department of Electrical and Computer Engineering.Catherine Rosenberg is on the Scientific Advisory Board of France-Telecom and was on the Board of Governors of the IEEE Communications Society from January 2007 to December 2008. She was an Associate Editor for IEEE Communications Magazine,Telecommunications Systems, and IEEE Transactions on Mobile Computing, and served as IEEE Communications Surveys and Series co-Editor for the Series on Adhoc and Sensor Networks for IEEE Communications Magazine. She has been and is involved in many conferences including IEEE Infocom, IEEE Globecom, International Teletraffic Congress (ITC) and IFIP Broadband Communication. She has authored over 100 papers on broadband and wireless networking and traffic engineering and has been awarded eight US patents.


Keynote II

What QoS for the future Internet?

James Roberts (Orange Labs, France)


The design and implementation of QoS mechanisms for multiservice networks remain issues of key importance for networking researchers in general and the teletraffic community in particular. Recent calls to adopt a clean slate approach to the design of a future Internet offer an excellent opportunity to reappraise past proposals and to imagine new solutions that are hypothetically unconstrained by the weight of existing infrastructure and developing business relations. What would be the ideal service model offering users adequate quality at the best price for all envisaged applications while allowing the development of sound business models for the providers of networks, services and content? If we can identify such a service model, can we also define the trajectory that will take us to it from the current Internet? We seek in the talk to bring some elements of response to these questions by applying our understanding of the nature of Internet traffic and of the feasibility of controlling user perceived performance. This understanding is key, in particular, to analysing the prospects for a future Internet architecture that remains as propitious as IP for the development of innovative applications.

Jim Roberts has a BSc in mathematics from the University of Surrey, UK and a PhD from the University of Paris. He has worked for the British Post Office, Socotel and France Telecom, mainly performing research on the performance evaluation and design of traffic controls for multiservice networks including ISDN, ATM and the Internet. He left Orange Labs in May 2009. He was chairman of three successive European COST projects on the performance of multiservice networks, this activity culminating in the publication of the book "Broadband Network Teletraffic" (Springer 1996). He has published extensively in journals and conferences gaining a best paper award at Infocom 1999. He has been a member of several journal editorial boards, including Computer Networks, IEEE/ACM Transactions on Networking and IEEE JSAC, and many conference programme committees in the networking field, including ITC, Infocom and SIGCOMM. He was TPC co-chair for ITC14 and Infocom 2003. His current research is focused on the definition and evaluation of traffic control and transport mechanisms for a future Internet.


Keynote III


Bringing Network Coding into the Network

Muriel Médard (MIT, USA)

Theoretical developments in network coding have pointed to different possible approaches for how coding can be incorporated in networking. In this talk, we consider using network coding in different settings. In particular, we consider the use of network coding in peer-to-peer networks, TCP/IP connections, video transmission and mobile ad-hoc networks. We show that there is no single approach to network coding that can be successfully applied in all cases, but that careful co-design of network coding techniques with protocols may lead to significant gains.

Muriel Médard is a Professor in the Electrical Engineering and Computer Science at MIT. She was previously an Assistant Professor in the Electrical and Computer Engineering Department and a member of the Coordinated Science Laboratory at the University of Illinois Urbana-Champaign. From 1995 to 1998, she was a Staff Member at MIT Lincoln Laboratory in the Optical Communications and the Advanced Networking Groups. Muriel received B.S. degrees in EECS and in Mathematics in 1989, a B.S. degree in Humanities in 1990, a M.S. degree in EE 1991, and a Sc D. degree in EE in 1995, all from the Massachusetts Institute of Technology (MIT), Cambridge. She has served as an editor of several IEEE journals.
Muriel’s research interests are in the areas of network coding and reliable communications, particularly for optical and wireless networks.
Muriel was awarded IEEE Leon K. Kirchmayer Prize Paper Award 2002, and was co-awarded the Best Paper Award at the Fourth International Workshop on the Design of Reliable Communication Networks (DRCN 2003), the Information Theory Society/ Communications Society Joint Best Paper Award 2009 and the William R. Bennett Prize in the Field of Communications Networking 2009. She received a NSF Career Award in 2001 and was co-winner of the MIT 2004 Harold E. Edgerton Faculty Achievement Award.  She was named a 2007 Gilbreth Lecturer by the National Academy of Engineering.
Muriel Médard is a member of the Board of Governors of the IEEE Information Theory Society and a Fellow of IEEE. She is also a Chief Scientist at Blackwave.


Keynote IV

Probabilistic Algorithms for Mining in Large Streams

Philippe Flajolet (INRIA-Rocquencourt, France)


Several algorithms have appeared over the past two decades that have proved instrumental in efficiently extracting quantitative characteristics of very large data sets. These algorithms are by nature probabilistic, being based on hashing. Their design is tightly coupled with their analysis, itself often grounded in methods of analytic combinatorics. Characteristics like the total number of elements, cardinality (the number of distinct elements), frequency moments, as well as unbiased samples can be gathered with little loss of information and only a small probability of failure. The algorithms are suitable for traffic monitoring in networks, data base query optimization, and some of the basic tasks of data mining. They apply to massive data streams and in many cases require strictly minimal auxiliary storage.

Philippe Flajolet, a former student from the Ecole Polytechnique in Paris, obtained a PhD and a DrSc from the University of Paris in 1973 and 1979. His main area of research is the analysis of algorithms and the study of discrete combinatorial and probabilistic models by means of analytic methods. Together with Sedgewick, he is the author of a popular introductory book on Analysis of Algorithms and he counts as one of the major founders of the domain known as "analytic combinatorics". He is author or coauthor of over 200 publications in these areas.


Keynote V

Statistical Multiplexing, the Stochastic Knapsack and Admission Control

Ravi R. Mazumdar (University of Waterloo, Canada)


Statistical multiplexing is by now a well understood concept in traffic engineering. Pioneering work in the 90's by Hui and Kelly on the notions of effective bandwidth provided the connection between the queueing and admission control phenomena. In this talk I will provide a mathematical framework for studying the various concepts and in particular show the coupling between statistical multiplexing and the stochastic knapsack problem that presents a way to map queueing phenomena to multirate loss models in a consistent way.

The speaker was educated at the Indian Institute of Technology, Bombay (B.Tech, 1977), Imperial College, London (MSc, DIC, 1978) and UCLA (PhD, 1983).
He is currently a University Research Chair Professor in the Dept. of ECE at the University of Waterloo, Ont., Canada where he has been since September 2004.
He is an editor of the IEEE/ACM Trans on Networking.
He is a Fellow of the IEEE and the Royal Statistical Society. He is a recipient of INFOCOM 2006 Best Paper Award and was runner-up for the Best Paper Award at INFOCOM 1998.
His research interests are in traffic engineering, modeling and control of wireline and wireless networks; and in applied probability and stochastic analysis with applications to queueing, and statistical filtering theory.