• When & Where: Seminars are generally (please, check the timeline and location before coming!) held on:
    • Wednesday afternoon at LINCS (14h-15h, Salle de Conseil) and
    • Thursday afternoon at Barrault (14h-15h, Amphi Saphir).
  • Contact us: if you wish to give a talk on networking, math, software or embedded-system topics, do not hesitate to contact us

[Next talks] [All talks]

01/07/2015Wong Wing Shing (Chinese University Hong Kong)Protocol Sequence based MAC for Multiple Packet Reception
01/07/2015Jeremie Leguay (Huawei)Online network optimization with SDN
08/07/2015Rahul Vaze (Tata Institute of Fundamental Research, Mumbai)Being Greedy is Good : Approximating the FDMA Capacity

Date:01/07/2015, 11h
Room:LINCS, Salle du Conseil
Speaker:Wong Wing Shing (Chinese University Hong Kong)
Talk:Protocol Sequence based MAC for Multiple Packet Reception
Abstract:Massey and Mathys proposed protocol sequences as a new design approach to media access control protocol without feedback that delivers throughput performance that can asymptotically converge to systems with feedback. In this talk, we present recent research results on protocol sequences that have potential application to future wireless networks. These protocol sequence results relate to multiple-packet reception networks, frequency hoping and successive interference cancellation MIMO systems.
Links:back to the list item, list top or summary top

Date:01/07/2015, 14h
Room:LINCS, Salle du Conseil
Speaker:Jeremie Leguay (Huawei)
Talk:Online network optimization with SDN
Abstract:Software-Defined Networking (SDN) is an emerging network architecture decoupling the network control and forwarding functions, and it enables the network elements to become directly programmable and the underlying infrastructure to be abstracted for applications and network services. SDN is ideal for the bandwidth hungry and dynamic nature of today's applications, since it permits through a logically centralized controller to reconfigure instantaneously the network, thus exploiting the network capacity more efficiently than distributed routing protocols. Looking at classical networking problems through the angle of centralization brings very challenging and new online network optimization problems. These problems were not considered when everything was done at network planning phase with no hard time constraints. This talk gives an introduction to this new domain and presents a few contributions on fast connection setup and network re-optimization.
Biography:Dr. Jérémie Leguay received his a Ph.D. degree from Pierre & Marie Curie University in Paris on ad hoc and delay tolerant networks. He was awarded the Thales Ph.D Prize for this work in 2007. From 2007 to 2009, he worked as a Research Engineer at Thales Communications and extended his research activities to vehicular and wireless sensor networks. From 2009 to 2014, he was responsible for the Research & Technology lab on networked systems at Thales Communications & Security where he especially developed activities on mobile wireless networks and software-defined networks. He joined Huawei’s French research Center in November 2014 to lead the traffic and network optimization team. His current research interests are protocol design and network optimization for fix and mobile environments.
Links:back to the list item, list top or summary top

Date:08/07/2015, 14h
Room:LINCS, Salle du Conseil
Speaker:Rahul Vaze (Tata Institute of Fundamental Research, Mumbai)
Talk:Being Greedy is Good : Approximating the FDMA Capacity
Abstract:We consider the classical problem of approximating the FDMA capacity,where the problem is to allocate disjoint resources (frequencies) tomultiple users so as to maximize the sum-utility (data rate). Manyheuristic approaches, such as convex relaxation etc,. are known to solvefor the FDMA capacity, however, fail to give any theoretical guarantees.We approach this problem via results on greedy algorithms for sub-modularfunctions. The main result is to show that the capacity of parallelGaussian channels is a sub-modular function. Following this result, we geta 2-approximation (which is at least 1/2 times equal) to the optimalFDMA capacity.
Biography:Rahul Vaze received his Ph.D. from The University of Texas at Austin in 2009. SinceOct. 2009 he is a Reader at the School of Technology and ComputerScience, Tata Institute of Fundamental Research, Mumbai, India. Hisresearch interest are in multiple antenna communication, ad hoc networks,combinatorial resource allocation. He is a co-recipient of the Eurasipbest paper award for year 2010 for the Journal of Wireless Communicationand Networking, and recipient of Indian National Science Academy's youngscientist award for the year 2013 and Indian National Academy ofEngineering's young engineer award for the year 2013.
Links:back to the list item, list top or summary top