BEGIN:VCALENDAR VERSION:2.0 PRODID:-//wp-events-plugin.com//7.2.3.1//EN BEGIN:VEVENT UID:942@lincs.fr DTSTART;TZID=Europe/Paris:20260702T090000 DTEND;TZID=Europe/Paris:20260703T170000 DTSTAMP:20260204T162249Z URL:https://www.lincs.fr/events/lincs-annual-workshop-with-the-scientific- committee-2026/ SUMMARY:LINCS Annual Workshop with the Scientific Committee 2026 DESCRIPTION:\n Please save the date!\n\n As is tradition\, we are pleased to invite you to the 2026 edition of our Annual Workshop with the Scientific Committee : a two-day event taking place on July Tuesday 2 and Friday 3 in Palaiseau\, featuring scientific highlights\, surveys\, elevator pitches\, and posters from our scientific community. CATEGORIES:LINCS Workshop,Workshop LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:937@lincs.fr DTSTART;TZID=Europe/Paris:20260528T140000 DTEND;TZID=Europe/Paris:20260528T150000 DTSTAMP:20260331T144204Z URL:https://www.lincs.fr/events/real-time-cloud-between-vision-and-reality / SUMMARY:Real-Time Cloud: Between Vision and Reality DESCRIPTION:Real-time cloud envisions the migration of time-critical applications to shared cloud infrastructures in order to leverage elasticity\, scalability\, and operational flexibility. However\, this vision conflicts with core cloud design principles: deep resource sharing\, multi-tenancy\, and increasingly complex virtualization stacks.\n\nIn this talk\, we analyze the main threats to predictability and security in multi-tenant cloud systems that hinder the deployment of time-sinsitive applications\, with particular attention to shared memory subsystems and virtualization boundaries.\nWe then focus on two representative challenges: memory bandwidth isolation and hypervisor attack surfaces\, examining recent research efforts as well as their practical limitations.\n\nWe conclude by questioning whether real-time cloud is a technically grounded objective\, or a business-driven narrative that underestimates the structural constraints of modern cloud architectures. CATEGORIES:Seminars LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:941@lincs.fr DTSTART;TZID=Europe/Paris:20260521T090000 DTEND;TZID=Europe/Paris:20260521T180000 DTSTAMP:20260204T155338Z URL:https://www.lincs.fr/events/lincs-phd-student-day-2026/ SUMMARY:LINCS PhD Student Day 2026 DESCRIPTION:\n Please save the date!\n\n We are currently preparing the next edition of LINCS Ph.D Student DAY: an event entirely dedicated to the PhD students and postdocs of the lab that includes sessions with elevator pitches\, poster presentations\, and brainstorming\, along with a friendly lunch and a team-building activity that may take place outdoors.\n\n The aim of this event is to offer PhD students and postdocs an opportunity to present their work\, discover their peers’ research\, and receive valuable feedback from senior members of LINCS. Additionally\, it will serve as practice for those who will be presenting at the upcoming annual workshop in front of the scientific committee\, scheduled for July 2 & 3.\n\n The program is still a work in progress. We’d love to hear any suggestions you might have for the team-building activity.\n\n The proposed lunch and recreational activity will be covered by LINCS.\n\n CATEGORIES:PhD Elevator Pitch Session,Workshop END:VEVENT BEGIN:VEVENT UID:944@lincs.fr DTSTART;TZID=Europe/Paris:20260416T140000 DTEND;TZID=Europe/Paris:20260416T150000 DTSTAMP:20260311T134350Z URL:https://www.lincs.fr/events/tbd-11/ SUMMARY:TBD DESCRIPTION:TBD CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:947@lincs.fr DTSTART;TZID=Europe/Paris:20260409T140000 DTEND;TZID=Europe/Paris:20260409T150000 DTSTAMP:20260318T134106Z URL:https://www.lincs.fr/events/how-to-present-workshop/ SUMMARY:"How to Present” Workshop DESCRIPTION:Especially conceived for Ph.D students\, interns and postocs\, the “How to Present” workshop\, will go over some ideas on how to conceive your presentation based on the timing (from 3 to 40 minutes)\, your audience (scientific vs. industrial\, specialized vs. general)\, your content (is it a big chunk of maths? system architecture? a survey? etc.)\, and more.\n\nWe warmly encourage  to seize this opportunity by attending on April 9\, presenting both a poster and an elevator pitch\, and joining the afternoon activity on May 21. CATEGORIES:Working Group LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:945@lincs.fr DTSTART;TZID=Europe/Paris:20260402T140000 DTEND;TZID=Europe/Paris:20260507T150000 DTSTAMP:20260330T083742Z URL:https://www.lincs.fr/events/the-doppler-shannon-paradigm-in-vehicular- networks-a-stochastic-geometry-analysis/ SUMMARY:The Doppler-Shannon Paradigm in Vehicular Networks: A Stochastic Geometry Analysis DESCRIPTION:Historically\, in cellular networks\, the user equipment (UE) association with a base station (BS) has been largely confined to nearest BS association strategies. Unlike cellular networks wherein the BSs are static\, vehicular networks are prone to high mobility\, resulting in the UE experiencing a Doppler shift. The Doppler effect further results in the fading channel exhibiting high temporal variability. In this work\, we present a novel stochastic geometry framework by modeling the effects of the Doppler shift on the physical layer network performance through the coherence time. First\, the statistics of the Doppler shift are studied in a two- and three-dimensional Poisson point process (PPP) setting. The distribution and the geometric factors influencing the Doppler are analyzed. Next\, we propose Doppler aware utilities\, modeling the Doppler induced Shannon rate achievable in time-selective fading links. Through these utilities\, we study the outage and coverage probabilities for a UE to achieve a given quality of service. These probabilities are computed based on the optimal BS association in vehicular networks\, which go beyond the closest Euclidean distance. The novel BS association factors in the UE-BS line of sight\, the BS direction of motion\, the fading gain\, in addition to the Euclidean distance. We show that the nearest BS is no longer the optimal BS association\, resulting in non-convex coverage tessellations associated with the BSs. Our simulation results illustrate the need for a Doppler correction\, complementing the Shannon performance. The network performance achieved through the proposed Doppler-Shannon based association is proved\, analytically as well as through simulations\, to be superior to the classical Shannon based association achieving gains up to 12% and 55% in a 2D and 3D setting\, respectively. CATEGORIES:Seminars LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:933@lincs.fr DTSTART;TZID=Europe/Paris:20260326T140000 DTEND;TZID=Europe/Paris:20260326T150000 DTSTAMP:20260330T144315Z URL:https://www.lincs.fr/events/resource-efficient-nextg-mimo-sensing-and- communications-bridging-sparse-arrays-spatial-modulation-and-subspace-code s/ SUMMARY:Resource-efficient NextG MIMO Sensing and Communications: Bridging Sparse Arrays\, Spatial Modulation and Subspace Codes DESCRIPTION:This talk explores emerging connections between sensing\, modulation and coding through the unifying lens of sparse antenna array geometries. We first explore the versatile uses of index modulation via antenna selection in integrated communications and sensing (ISAC). We demonstrate that judicious antenna subset selection can offer enhanced sensing performance\, as well as a balance between spectral and energy efficiency by making clever use of multiple antennas per radio-frequency (RF) chain. We then show that the canonical sensing problem of direction-of-arrival estimation can be naturally interpreted as a so-called analog subspace coding problem. Subspace coding conventionally arises in non-coherent communications\, where neither transmitter nor receiver knows the channel\, and information is encoded in subspaces rather than vectors. However\, connections to sensing have remained unexplored. We bridge this gap and demonstrate how it fosters new research problems at the intersection of coding theory and signal processing\, including a new principled approach to noise-robust sparse array design based on optimizing subspace distance. Throughout the talk\, we show how sparse array geometries are key to enhancing sensing performance\, reducing hardware complexity\, and increasing energy efficiency of next-generation multiple-input multiple-output systems equipped with far fewer RF chains than antennas.\n \;\nBio: Robin Rajamäki (Member\, IEEE) received his D.Sc. degree in electrical engineering in 2021 from Aalto University\, Finland. From 2022-2024\, he was a postdoctoral scholar at the University of California San Diego. He is currently an assistant professor at Tampere University\, Finland. His research interests lie in the intersection of theory and applications of statistical signal processing with a focus on multisensor systems in sensing and wireless communications.\n CATEGORIES:Seminars,Youtube LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:939@lincs.fr DTSTART;TZID=Europe/Paris:20260319T140000 DTEND;TZID=Europe/Paris:20260319T150000 DTSTAMP:20260313T110322Z URL:https://www.lincs.fr/events/coexistence-of-embb-and-mmtc-in-cf-mmimo-s ystems/ SUMMARY:Coexistence of eMBB and mMTC in CF-mMIMO Systems DESCRIPTION:Future wireless networks must support heterogeneous services with markedly different requirements\, such as enhanced mobile broadband (eMBB)\, which demand high data rates\, and massive machine-type communications (mMTC)\, which seek long battery lifetimes. Recently\, cell-free massive MIMO (CF-mMIMO) has emerged as a promising paradigm for providing uniform service quality and flexible resource allocation in such scenarios.\n\nIn this talk\, we investigate uplink multiple-access schemes for the coexistence between these two use cases. We consider a non-orthogonal access strategy in which low-rate mMTC transmissions are spread across the time–frequency resources concurrently used by eMBB users\, enabling efficient resource reuse while supporting heterogeneous traffic. \n\nAssuming imperfect channel state information\, we derive closed-form expressions for the achievable uplink rates of both services\, based solely on statistical channel knowledge. For mMTC devices\, the analysis explicitly accounts for the finite blocklength (FBL) regime to characterize short-packet transmissions.\n\nTo accommodate heterogeneous service requirements\, we formulate a power-control problem that maximizes the minimum energy efficiency across mMTC devices while enforcing quality-of-service constraints for eMBB users. The resulting nonconvex fractional optimization is addressed via sequential fractional programming\, with formulations that cover both the classical Shannon and FBL regimes.\n\nNumerical results demonstrate that the proposed scheme enables effective multiplexing of eMBB and mMTC traffic while maintaining the desired reliability-efficiency trade-offs. As future work\, we plan to investigate learning-based approximations of the proposed optimization framework (e.g.\, using graph neural networks) to further reduce computational complexity and enable real-time operation.\nBIO\nSergi Liesegang (Member\, IEEE) received the bachelor’s degree in telecommunication engineering from the Universitat Politècnica de Catalunya (UPC) in 2015\, the joint master’s degree in telecommunication engineering from UPC in collaboration with the Technische Universität München (TUM) in 2017\, and the Ph.D. degree (cum laude) in signal theory and communications from UPC in 2022. From 2015 to 2018\, he was a Research Assistant in the Signal Theory and Communications Department at UPC. From March 2022 to June 2022\, he was a Visiting Researcher with the Università degli Studi di Cassino e del Lazio Meridionale (UNICAS). From September 2022 to May 2023\, he was a Research Associate with UPC. From June 2023 to July 2025\, he was a Post-Doctoral Fellow with the Consorzio Nazionale Interuniversitario per le Telecomunicazioni (CNIT). Since February 2024\, he has been the recipient of a Marie Sk?odowska-Curie Actions (MSCA) Individual Grant with UNICAS and is currently on secondment with Nokia Bell Labs Paris-Saclay. His areas of interest include signal processing and wireless communication theory\, with special emphasis on beyond-5G and 6G systems. CATEGORIES:Seminars LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:943@lincs.fr DTSTART;TZID=Europe/Paris:20260312T000000 DTEND;TZID=Europe/Paris:20260312T000000 DTSTAMP:20260313T085015Z URL:https://www.lincs.fr/events/scientific-strategy-session-follow-up-to-t he-members-retreat/ SUMMARY:Scientific Strategy Session: Follow-Up to the Members’ Retreat DESCRIPTION:The immersive LINCS workshop on December 17–18 was productive\, resulting in the identification of promising research areas\, new collaborations\, and adjustments to some lab activities.\n\nThe purpose of this meeting is to share these outcomes with all LINCS members (senior researchers\, postdoctoral fellows\, PhD candidates\, research engineers\, and interns)\, to present the thematic areas in detail\, to discuss possible extensions\, and to collectively shape the organization of our laboratory’s future activities.\n\nGROUPS\n\n AI &\; Networks (Daniel\, Leonardo\, Qiong\, Andrea\, Alonso\, Francesca\, Marc-Olivier B.\, Fabio)\n Quantum 2.0 (Ludovic\, Rémi\, Marc-Olivier R.\, Sébastien\, Joaquin)\n NTN (François\, Aslan\, Ashutosh\, Calvin\, Philippe)\n Information Theory (Aslan\, François\, Ashutosh\, Philippe)\n\nThe program and the presentations by the participating researchers are available on the event page :\nhttps://www.lincs.fr/events/members-immersive-workshop/ CATEGORIES:LINCS Workshop,Workshop LOCATION:Amphi 2\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 2:geo:0,0 END:VEVENT BEGIN:VEVENT UID:935@lincs.fr DTSTART;TZID=Europe/Paris:20260219T130000 DTEND;TZID=Europe/Paris:20260219T140000 DTSTAMP:20260225T134744Z URL:https://www.lincs.fr/events/network-calculus-guaranteed-performance-an alysis-in-networks/ SUMMARY:Network Calculus: Guaranteed performance analysis in networks DESCRIPTION:Network calculus is a theory developed to compute worst-case performance guarantees in networks. When analyzing complex networks (in particular multi-class)\, the analysis requires two-step approach: decomposing the network into several single-class networks\, and analyzing these single-class network. In this talk\, I will show that some scheduling policies (such as DRR) exhibit some inter-dependency structures and require that these two steps are intricate. I will present an iterative scheme that improves both the performance bounds and stability region compared to the state of the art. CATEGORIES:Seminars,Youtube LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:936@lincs.fr DTSTART;TZID=Europe/Paris:20260212T140000 DTEND;TZID=Europe/Paris:20260212T150000 DTSTAMP:20260218T103543Z URL:https://www.lincs.fr/events/metalore-learning-to-orchestrate-communica tion-and-computation-for-metaverse-synchronization/ SUMMARY:MetaLore: Learning to Orchestrate Communication and Computation for Metaverse Synchronization DESCRIPTION:As augmented and virtual reality evolve\, achieving seamless synchronization between physical and digital realms remains a critical challenge\, especially for real-time applications where delays affect the user experience. This paper presents MetaLore\, a Deep Reinforcement Learning (DRL) based framework for joint communication and computational resource allocation in Metaverse or digital twin environments.\n\nMetaLore dynamically shares the communication bandwidth and computational resources among sensors and mobile devices to optimize synchronization\, while offering high throughput performance. Special treatment is given in satisfying end-to-end delay guarantees. A key contribution is the introduction of two novel Age of Information (AoI) metrics: Age of Request Information (AoRI) and Age of Sensor Information (AoSI) — integrated into the reward function to enhance synchronization quality.\n\nAn open source simulator has been extended to incorporate and evaluate the approach. The DRL solution is shown to achieve the performance of full-enumeration brute-force solutions by making use of a small\, task-oriented observation space of two queue lengths at the network side. This allows the DRL approach the flexibility to effectively and autonomously adapt to dynamic traffic conditions. CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:934@lincs.fr DTSTART;TZID=Europe/Paris:20260204T134500 DTEND;TZID=Europe/Paris:20260204T144500 DTSTAMP:20260212T091120Z URL:https://www.lincs.fr/events/towards-a-federated-public-computing-conti nuum-platform/ SUMMARY:Towards a Federated Public Computing Continuum Platform DESCRIPTION:Building a large-scale\, multi-tenant\, public\, and geo-distributed computing continuum platform that includes both cloud and edge environments\, and where any application can be deployed\, requires a large amount of computing resources deployed across strategically distributed locations\, spanning an entire country or even a continent. One of the challenges to realizing this public computing continuum platform is scalability. To this end\, we focus on addressing some scalability challenges and propose a series of solutions. First\, we present the meta-federations concept\, where many independent local resource providers may lease their resources to multiple fog providers to solve the service coverage and resource utilization issues. We propose UnBound\, a scalable meta-federations framework that specifically addresses the difficult multi-tenancy challenges introduced by metafederations. Second\, we propose two monitoring frameworks designed for geo-distributed cluster federation environments\, Acala and AdapPF\, which aim to reduce the cross-cluster network traffic of monitoring while maintaining the accuracy of the monitoring data. CATEGORIES:Seminars,Youtube LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:938@lincs.fr DTSTART;TZID=Europe/Paris:20260128T140000 DTEND;TZID=Europe/Paris:20260128T150000 DTSTAMP:20260129T094015Z URL:https://www.lincs.fr/events/queuing-theory-for-throttled-quantum-link- protocol-modeling/ SUMMARY:Queuing Theory for Throttled Quantum Link Protocol Modeling DESCRIPTION:To facilitate the control and management of the future quantum networks\, one needs a quantum link protocol (QLP) that ensures a constant and reliable rate of entangled qubit storage in the adjacent nodes. In this talk\, we propose a throttled QLP. We use queuing modeling with Markov chains to evaluate its performances. We show the good performances of our throttled QLP proposal\, with stabilized rate of entanglement distribution and low probability of delivery failure. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:926@lincs.fr DTSTART;TZID=Europe/Paris:20260121T140000 DTEND;TZID=Europe/Paris:20260121T150000 DTSTAMP:20260122T115650Z URL:https://www.lincs.fr/events/toward-a-privacy-aware-intrusion-detection -in-intelligent-transportation-systems/ SUMMARY:Toward a privacy aware intrusion detection in Intelligent Transportation Systems DESCRIPTION:In Cooperative Intelligent Transportation Systems (C-ITS)\, the continuous exchange of large data volumes is critical for the effectiveness of applications\, making the security of these messages essential. For instance\, to protect the privacy of road users\, vehicles are required to frequently change their pseudonyms\, along with other network identifiers such as IP addresses\, MAC addresses\, and so on. This dynamic nature of identifier changes introduces significant challenges for performing efficient intrusion detection\, as tracking and identifying malicious behavior becomes more complex.\n\nIn this context\, there is a growing need for an advanced Intrusion Detection System (IDS) tailored for C-ITS environments. This IDS must ensure a balance between meeting the strict privacy requirements set by standards and enhancing the detection and prevention of intrusions and cyber threats. \n\nIn this presentation\, we emphasize the critical importance of privacy-aware intrusion detection and provide key recommendations for conducting research in this domain. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:928@lincs.fr DTSTART;TZID=Europe/Paris:20260114T140000 DTEND;TZID=Europe/Paris:20260114T150000 DTSTAMP:20260122T114240Z URL:https://www.lincs.fr/events/network-acceleration-for-ai-workloads/ SUMMARY:Network acceleration for AI workloads DESCRIPTION:Network acceleration is critical for modern AI workloads\, particularly in optimizing communication and data transfer among distributed GPUs. The network has emerged as a significant bottleneck for Large Language Model (LLM) training and execution\, driving rapid advancements in GPU network technologies. This evolution\, however\, introduces complex research challenges spanning load balancing\, congestion control\, collective communications\, and novel network architectures. This presentation will first establish the fundamental distinctions between AI data centers and conventional cloud computing environments\, followed by an overview of ongoing research topics in this rapidly evolving field.\n\n \n\nBio:\nJeremie Leguay received his Ph.D. degree in computer science from Pierre et Marie Curie University\, Paris\, France. He is Department Head at Nokia Bell Labs Paris Saclay on Network Systems Research. From 2004\, he conducted research and led the Networking Lab at Thales Communications and Security (SIX GTS division) where he developed activities on sensor networks\, mobile networks\, and software-defined networks for mission-critical networked systems. In 2014\, he joined Huawei Technologies as leader of the Network and Traffic Optimization Team to conduct research activities on the planning and control of IP networks. He is Senior IEEE member. He has been a Senior Expert and Director of the Datacom Dijkstra Lab at Huawei Technologies. His current activities are mainly on Routing\, Network Management and Optimization\, Self-driving networks\, Automation\, Network for AI. CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:932@lincs.fr DTSTART;TZID=Europe/Paris:20260108T140000 DTEND;TZID=Europe/Paris:20260108T150000 DTSTAMP:20260116T153824Z URL:https://www.lincs.fr/events/multi-user-linearly-decomposable-distribut ed-computing-fundamental-limits-and-new-coded-architectures/ SUMMARY:Multi-User Linearly-Decomposable Distributed Computing: Fundamental Limits and New Coded Architectures DESCRIPTION:This talk presents the main results of my PhD thesis\, defended in 2024 at Sorbonne University\, devoted to the theoretical study of multi-user distributed computation for linearly-decomposable functions. In this framework\, we construct a general model in which a matrix of computational demands can be factorized into two sparse matrices—a computation matrix and a communication matrix—revealing deep connections with several areas: coding theory\, covering codes\, syndrome decoding\, compressed sensing\, and fixed-support matrix factorization (tessellation).\n \nWe will discuss:\n\n fundamental lower and upper bounds on computation and communication costs\;\n the characterization of a new class of codes\, called partial covering codes\;\n optimal architectures for perfect distributed computing\;\n a new method called Tessellated Distributed Computing\, offering optimal computation–communication trade-offs\, both in the exact and approximate regimes.\n\nThese results lead to practical applications in large-scale distributed systems\, distributed machine learning\, and high-performance computing infrastructures.\n \;\nBio: Ali Khalesi is an Assistant Professor (Maître de conférences) at IPSA\, Ivry-sur-Seine\, and recipient of the 2nd Prize for the Best PhD Thesis—EDITE Paris 2025\, as well as finalist for the 2025 Chancellerie de Paris Awards.\nHe obtained his PhD in 2024 from Sorbonne University\, within EURECOM\, under the supervision of Prof. Petros Elia.\nHis research focuses on the fundamental limits of distributed computing\, information theory\, coding theory\, and the analysis of communication–computation trade-offs in modern distributed architectures. CATEGORIES:Seminars,Youtube LOCATION:Room 3C41\, 19 Pl. Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Pl. Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Room 3C41:geo:0,0 END:VEVENT BEGIN:VEVENT UID:929@lincs.fr DTSTART;TZID=Europe/Paris:20260107T140000 DTEND;TZID=Europe/Paris:20260107T150000 DTSTAMP:20260129T091323Z URL:https://www.lincs.fr/events/the-role-of-ai-in-the-phenomenon-of-inform ation-disorder-challenges-methods-and-insightstbd-11/ SUMMARY:The role of AI in the phenomenon of Information Disorder: Challenges\, Methods and Insights DESCRIPTION:This talk explores the growing phenomenon of information disorder and the dual role of artificial intelligence\, both in exacerbating the problem through increasingly sophisticated generative tools and in supporting its analysis\, detection and mitigation.\n\nWithin a national initiative\, SERICS (Security and Rights in the Cyberspace)\, we have developed and tested a set of models\, analytical components\, and prototype tools inspired by industry standards for threat intelligence and cognitive security. These research prototypes combine large-scale acquisition and enrichment of online content with AI-based modules for assessing source reliability\, detecting coordinated behaviours and supporting claim verification.\n\nThe seminar will also outline the directions we are now pursuing toward pre-bunking strategies\, aiming to anticipate manipulative dynamics before they unfold and to better support analysts and decision-makers in managing emerging cognitive threats.\n\nShort bio\nGiuseppe Fenza is an Associate Professor of Computer Science at the University of Salerno\, where his research spans computational intelligence\, knowledge extraction\, and AI-driven approaches to information disorder and cognitive security. He was co-founder of the digital-health spin-off Riatlas and is currently contributing to the creation of IntelliTrust\, focused on advanced solutions for countering disinformation. He has authored over 90 publications and serves as Associate Editor-in-Chief of Neurocomputing and Area Editor of KSII Transactions on Internet and Information Systems.\nSlides:\nhttps://www.lincs.fr/wp-content/uploads/2026/01/LINCS-Se minar_Fenza_07012026.pdf\nLinks\n\n https://github.com/Information-Disorder-Awareness\n https://huggingface.co/IDA-SERICS\n CATEGORIES:Seminars LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:940@lincs.fr DTSTART;TZID=Europe/Paris;VALUE=DATE:20251217 DTEND;TZID=Europe/Paris;VALUE=DATE:20251219 DTSTAMP:20260223T111350Z URL:https://www.lincs.fr/events/members-immersive-workshop/ SUMMARY:Members Immersive Workshop DESCRIPTION:\n\n\n\n\n\n\n\n\n\nThe objective is to step away from our daily routines in order to collectively reflect on the future activities of LINCS\, share our scientific visions\, identify priority research themes\, and strengthen collaborations within our joint laboratory.\n\nThis dedicated time will allow everyone to contribute to a strategic reflection on the lab’s future directions\, while benefiting from an environment conducive to exchange\, creativity\, and collegiality\, complemented by a range of informal and engaging activities.\n\nThe program will combine scientific sessions with brainstorming and debate\, as well as informal moments.\n\nThe outcomes of the plenary sessions and thematic working groups will soon be presented to the full community and will serve as the basis for shaping the LINCS two-year strategy through an inclusive\, collective process.\nScientific Programme\n\n\n\n\n\n Mot du directeur\n\n Rappel des objectifs du LINCS\, de son organisation\, des résultats structurants obtenus\, présentation de son écosystème (PEPR\, Centre RSTN\, FRAMExG\, France6G\, CSF\, agences de programme\, etc.)\n Rappel des difficultés générées par le déménagement et des actions entreprises pour les mitiger\n Etat de situation et vision d’ensemble des activités à venir\n Introduction aux échanges prévus dans les diverses activités des 2 journées\n\n\n Présentations de nouveaux membres : parcours\, sujets de recherche\, vision d’ensemble interactions prévues au sein du LINCS\n\n Aslan Tchamkerten (Télécom Paris)\n Ashutosh Balakrishnan (Télécom Paris)\n Marc-Olivier Renou (Inria)\n\n\n Présentations travaux membres\n\n Alonso Silva (Nokia Bell Labs)\n Andrea Araldo (Telecom Sud)\n Ashutosh Balakrishnan\n Chung Sue - Calvin (Nokia Bell Labs)\n Fabio Pianese (Nokia Bell Labs)\n Joaquin Garcia-Alfaro (Telecom SudParis)\n Remi Varloot (Nokia Bell Labs)\n\n\n Présentations thématiques structurantes pour le LINCS par les membres du COMEX\n\n François Baccelli (Inria\, Télécom Paris) : NTN\n Francesca Bassi (SystemX) : Cyber\n Ludovic Noirie (Nokia Bell Labs) : Quantique\n Sébastien Tixeuil (Sorbonne Université) : IA et Réseaux\n\n\n Brainstorming\n\n Identification de sujets de recherche existants et émergents au sein du LINCS à fort potentiel et à visibilité internationale\n Désignation d’un volontaire chargé de structurer les activités futures\n Sélection des sujets qui seront abordés dans la suite de l’événement\n\n\n Travail en groupe par thématique\n\nSynthèse et conclusions\n\n\n\n\n\n\n\n\n\n\n\n ATTACH;FMTTYPE=image/jpeg:https://www.lincs.fr/wp-content/uploads/2026/01/ Retraite-des-membres_best_half.png CATEGORIES:LINCS Workshop,Workshop END:VEVENT BEGIN:VEVENT UID:914@lincs.fr DTSTART;TZID=Europe/Paris:20251210T140000 DTEND;TZID=Europe/Paris:20251210T150000 DTSTAMP:20260115T162852Z URL:https://www.lincs.fr/events/llm-driven-scheduler-generation-for-intent -based-ran/ SUMMARY:LLM-Driven Scheduler Generation for Intent-Based RAN DESCRIPTION:The shift toward open\, programmable O-RAN and AI-RAN 6G networks presents new opportunities for Intent-Based Networking (IBN) to dynamically optimize RAN operations. However\, applying IBN to the RAN scheduler—a key component for resource allocation—remains challenging. Existing methods rely on coarse network slicing\, lacking the granularity to adapt to individual user conditions and traffic. While many scheduling algorithms exist\, their use is limited by implementation complexity\, lack of systematic evaluation\, and deployment challenges. To overcome this\, we introduce ALLSTaR\, a novel framework that uses LLMs to automate intent-driven scheduler design\, implementation\, and evaluation. ALLSTaR translates natural language intents\, extracts scheduler logic from academic literature using OCR and LLMs\, and deploys them as O-RAN dApps on a production-grade\, multi-vendor 5G testbed. This enables the largest OTA comparison of 18 synthesized schedulers and forms the basis for an Intent-Based Scheduling system that dynamically selects and deploys the optimal scheduler. Our approach supports use cases beyond current slicing techniques\, enabling fine-grained control based on buffer status\, PHY conditions\, and diverse traffic types.\n\nPreprint 1: https://arxiv.org/pdf/2505.18389\n\nPreprint 2: https://arxiv.org/abs/2508.17778\n\n \; CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:931@lincs.fr DTSTART;TZID=Europe/Paris:20251203T151500 DTEND;TZID=Europe/Paris:20251203T161500 DTSTAMP:20251209T153139Z URL:https://www.lincs.fr/events/high-speed-networking-from-kernel-bottlene cks-to-line-rate-packet-processing/ SUMMARY:High Speed Networking: From Kernel Bottlenecks to Line-Rate Packet Processing DESCRIPTION:Modern networked systems are moving from hardware into flexible\, programmable platforms. Among the key enablers of this shift we list the Intel DPDK and the eBPF ecosystem in conjunction with the eXpress Data Path (XDP)\, both allowing packet processing at very high rates.\nAs the classic per-packet processing model used by the usual networking stack can become a bottleneck (especially with pressure on CPU pipelines and the number of instructions per packet required)\, new designs require treating packets in batches\, data prefetching\, vectorized operations and better instruction-level parallelism. In this talk\, we will show how kernel bottlenecks impact line-rate packet processing and how modern approaches attempt to overcome them\, offering an accessible introduction to profiling\, optimization\, and programmable data paths in virtualized networking environments.\nThese ideas illustrate how rethinking execution models can significantly improve packet-processing efficiency. This talk provides an accessible introduction to these concepts\, focusing on how XDP fits into virtualized networking\, why profiling matters\, and how batching-aware techniques can unlock new optimization opportunities for modern programmable data paths.\n\nBio: Vladimiro is a second-year PhD student at Sapienza University of Rome. At the beginning of his PhD\, he focused on studying network functions and their performance. Together with his advisor\, Salvatore Pontarelli\, and his colleagues\, he developed a profiler for eBPF applications that introduces only minimal overhead on the program being analyzed. He is now working on improving the performance of eBPF-based networking applications by bringing a batching model to eBPF. CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:916@lincs.fr DTSTART;TZID=Europe/Paris:20251203T140000 DTEND;TZID=Europe/Paris:20251203T150000 DTSTAMP:20260116T145954Z URL:https://www.lincs.fr/events/fundamental-limits-of-distributed-detectio n-in-the-low-power-regime/ SUMMARY:Fundamental Limits of Distributed Detection in the Low-Power Regime DESCRIPTION:In this talk we consider distributed detection systems (sensor networks) where the sensors are subject to stringent communication constraints\, mostly stringent power or bandwidth constraints.\nWe present the optimal Stein-error exponents for different distributed detection systems and explain the communication and testing schemes that achieve these optimal exponents. Our results reveal interesting dichotomies of the Stein-exponent with respect to the connectivity of the channel: If all inputs can lead to all outputs\, then the Stein-exponent under stringent (probability 1) power constraints equals the exponent of a local test at the decision center only. I.e.\, The sensors and their observations cannot improve this exponent. In contrast\, if the channel is degenerate the Stein-exponent is the same as when communication is over a noiseless channel. Under slightly less stringent power constraints (on expectation instead of probability 1) the Stein-exponent will depend on the exact channel law if the channel is fully connected and also on whether the power constraint is imposed under all hypotheses or not. We completely characterize the Stein-exponent also when stringent power constraints are imposed on expectation. CATEGORIES:Seminars,Youtube LOCATION:Amphi 4\, 19 Pl. Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Pl. Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 4:geo:0,0 END:VEVENT BEGIN:VEVENT UID:930@lincs.fr DTSTART;TZID=Europe/Paris:20251127T140000 DTEND;TZID=Europe/Paris:20251127T180000 DTSTAMP:20251126T170339Z URL:https://www.lincs.fr/events/optimisation-de-lallocation-des-ressources -dans-les-reseaux-sans-fil-du-futur-en-presence-dincertitude/ SUMMARY:Optimisation de l’allocation des ressources dans les réseaux sans fil du futur en présence d’incertitude DESCRIPTION:We address in this thesis the challenge of efficient resource allocation under uncertainty for the transport of time-critical ultra reliable traffic in next-generation networks. We develop optimization and online-learning methods that provide rigorous performance guarantees for short-horizon probabilistic requirements and long-term cumulative constraints. We begin with Ultra-Reliable Low-Latency Communications (URLLC). Prior models for probabilistic delay either impose strong assumptions on arrivals or focus primarily on queue stability. We relax these assumptions and formulate a chance-constrained minimization of resource usage that holds under general arrival processes. By exploiting structural properties of the policy space\, we design efficient bandit-based algorithms for both offline (known statistics) and online (unknown statistics) settings. These algorithms provably converge in a fixed number of iterations while meeting stringent 1ms delay and (10^{-5}) reliability targets with minimal resource consumption. We then push these guarantees to extreme URLLC targeting (0.1\,mathrm{ms}) latency and reliability on the order of (10^{-7})\, where queuing is impermissible and the resource allocation schemes must rely on limited arrival information (historical samples\, mean\, variance). Static methods tend to over-allocate resources. We introduce an online\, dynamic reservation policy based on a sliding-window scenario approach that is robust and safe: it tracks minimal reservations from empirical data and avoids conservative over-provisioning while preserving stringent QoS constraints. Next\, we consider goal-oriented communications\, focusing on haptic applications that are highly sensitive to bursts of packet losses. We propose a queuing-theoretic framework which minimizes resource costs in the presence of losses from both collisions with other haptic packets and poor radio conditions. We design a joint control policy that combines adaptive transmit-power boosting with preemption of resources initially provisioned for enhanced Mobile Broadband (eMBB)\, governed by threshold policies. For heterogeneous users\, interdependence across user groups induces a high-dimensional decision space\, ruling out exhaustive search. To address this complexity\, we make use of a modified simulated-annealing algorithm with constraint handling through direct rejection of infeasible policies or cost-based penalties. Eventually\, we study long-term compliance and introduce Constrained Online Convex Optimization with Memory (COCO-M)\, where losses and constraints depend on the last (m) decisions. Prior work considered mainly fixed memory length. We generalize to arbitrary memory lengths and incorporate untrusted short-horizon predictions\, providing the first algorithms with provable sublinear regret and sublinear cumulative constraint violation in this general setting. This yields a versatile toolbox for online learning and predictive network control under adversarial conditions. CATEGORIES:PhD Defense LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:920@lincs.fr DTSTART;TZID=Europe/Paris:20251126T130000 DTEND;TZID=Europe/Paris:20251126T140000 DTSTAMP:20251121T092526Z URL:https://www.lincs.fr/events/privacy-aware-passive-sniffing-from-wirele ss-measurements-to-bounded-trajectories/ SUMMARY:Privacy-aware passive sniffing: from wireless measurements to bounded trajectories DESCRIPTION:With the widespread proliferation of smartphones\, wireless connectivity data has become a powerful lens for studying human behavior and mobility. In this talk\, I will focus on the full pipeline of using wireless connectivity data for mobility analysis. We will start from the design of the data collection itself: selecting the appropriate technologies\, frame types\, and header fields to capture\, while embedding privacy-preserving mechanisms directly into this process. Then\, we will address how to consolidate raw observations into coherent device-level views and how to build on these representations to reconstruct users’ trajectories. This spans the entire workflow\, ultimately transforming raw signals into meaningful mobility and context insights. CATEGORIES:Seminars LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:917@lincs.fr DTSTART;TZID=Europe/Paris:20251119T140000 DTEND;TZID=Europe/Paris:20251119T150000 DTSTAMP:20251126T123610Z URL:https://www.lincs.fr/events/ddos-attacks-impacts-detection-methods-and -advanced-strategies/ SUMMARY:DDoS Attacks: Impacts\, detection methods\, and advanced strategies DESCRIPTION:Distributed Denial of Service (DDoS) attack detection remains a challenging problem in cybersecurity. In DDoS\, a network of compromised devices is used to overwhelm a target with a flood of requests\, making it unable to serve legitimate requests. Recently\, we have witnessed increasing interest in DDoS detection using machine learning (ML) and deep learning (DL) algorithms. ML/DL can improve the detection accuracy\, but they can still be evaded through the use of ML/DL techniques in the generation of the attack traffic. In this talk\, we will discuss DDoS attacks\, their impacts\, and detection solutions. We will also present a DDoS detection method based on Long Short-Term Memory (LSTM) and explain how a GAN model generator can create DDoS traffic that closely matches the DDoS instances from our dataset\, making it appear similar to benign traffic. Additionally\, we will explain how to enhance this approach to detect adversarial DDoS attacks. CATEGORIES:Seminars,Youtube LOCATION:Amphi 5\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 5:geo:0,0 END:VEVENT BEGIN:VEVENT UID:923@lincs.fr DTSTART;TZID=Europe/Paris:20251112T140000 DTEND;TZID=Europe/Paris:20251112T150000 DTSTAMP:20251126T123442Z URL:https://www.lincs.fr/events/user-side-opportunistic-channel-charting-l ocation-aware-access-point-selection/ SUMMARY:User-side Opportunistic Channel Charting & Location-Aware Access Point Selection DESCRIPTION:Channel Charting (CC) is a promising tool for managing radio resources\, especially those tied to user location. Conventionally\, CC involves a dimensionality reduction of channel state information (CSI) to obtain a low-dimensional latent space. While conceived to be performed at the network side (e.g.\, base stations or access points)\, CC could be beneficial for end-devices. In practice\, end-user devices often have access to heterogeneous and non-cooperating networks\, with no coordination. In such a setup\, decision-making must occur on the user side to fully leverage available networks. For this reason\, user-side CC is particularly relevant. In this work\, we introduce a user-side CC framework: Opportunistic Channel Charting (OCC). OCC allows mobile devices to localize themselves in the radio environment opportunistically. Unlike CC\, OCC allows devices to build a chart from passively acquired CSI. This is done by monitoring the ambient wireless channels. Via real-world experiments\, using commodity devices\, we validate OCC. Our results show that OCC captures geometric information comparable to conventional CC in terms of trustworthiness and continuity while requiring no cooperation from surrounding devices. During measurements of CSI\, we also measure network quality. To exploit this\, we propose a new OCC-based Wi-Fi Access Point (AP) selection (OCCAPS).\n CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:919@lincs.fr DTSTART;TZID=Europe/Paris:20251105T140000 DTEND;TZID=Europe/Paris:20251105T150000 DTSTAMP:20251126T123507Z URL:https://www.lincs.fr/events/ran-automation-using-reinforcement-learnin g-the-cases-of-mobility-robustness-optimization-and-mu-mimo-frequency-sche duling/ SUMMARY:RAN Automation using Reinforcement Learning: the cases of Mobility Robustness Optimization and MU-MIMO Frequency Scheduling DESCRIPTION:This talk will present the ongoing activities at Ericsson Research in Massy\, France related to RAN automation. After a general presentation\, we will discuss in detail two specific use cases:\n\n(a) the Mobility Robustness Optimization for intra-frequency handover\; we learn to automatically tune the Cell Individual Offset of each cell boundary using offline Reinforcement Learning without exploration\, by exploiting already collected data.\n\n(b) the frequency scheduling of users to sub-bands supporting MU-MIMO concurrent transmission. This is a challenging large-action and large-state space problem which we tackle using online action decomposition methods inspired my multi-agent reinforcement learning (MARL) and Graph Neural Networks (GNNs).\n\nIn both use cases we show that AI-methods outperform traditional rule-based solutions and highlight the potential benefits from AI in RAN automation of future 6G networks.\n\nReferences:\n\n[MRO] “Offline Reinforcement Learning for Mobility Robustness Optimization”\, P. Alizadeh\, A. Giovanidis\, P. Ramachandra\, V. Koutsoukis\, O. Arouk\, in European Wireless 2025 (https://arxiv.org/abs/2506.22793)\n\n[MU-MIMO Frequency scheduling] A. Giovanidis\, M. Leconte\, S. Aroua\, T. Kvernvik and D. Sandberg\, "Online Frequency Scheduling by Learning Parallel Actions\," 2024 3rd International Conference on 6G Networking (6GNet)\, Paris\, France\, 2024\, pp. 153-160\, doi: 10.1109/6GNet63182.2024.10765674. CATEGORIES:Seminars,Youtube LOCATION:Amphi Estaunié\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Estaunié:geo:0,0 END:VEVENT BEGIN:VEVENT UID:927@lincs.fr DTSTART;TZID=Europe/Paris:20251104T140000 DTEND;TZID=Europe/Paris:20251104T180000 DTSTAMP:20251126T123214Z URL:https://www.lincs.fr/events/technical-economic-and-environmental-evalu ation-of-vehicular-and-edge-computing/ SUMMARY:Technical\, Economic and Environmental Evaluation of Vehicular and Edge Computing DESCRIPTION:Keywords: Vehicular Cloud Computing\, Task Offloading\, Game-Theoretic Optimization\, Sustainable Computing\n\nAbstract:\nThis thesis investigates the technical\, economical and environmental feasibility of computing architectures for supporting delaysensitive applications such as Augmented Reality (AR) and Autonomous Driving (AD). While Cloud Computing (CC) is the prevalent computing paradigm today\, it cannot offer sufficiently low latency. This limitation is overcome by Edge Computing (EC)\, which consists in deploying computational capability at the edge of the access network. However\, EC entails high infrastructure costs and raises environmental concerns\, due to the short lifecycle of electronic devices (around four years) and increased energy consumption.\n\nMeanwhile\, the number of connected vehicles is steadily increasing. These vehicles already carry onboard computing and communication resources that can be opportunistically exploited\, not only for driving-related tasks\, but also for task offloading computation from external devices\, e.g.\, smartphones\, laptops\, or wearable health devices of end-users. These resources available in the vehicles can be managed under the paradigm of Vehicular Cloud Computing (VCC).\n\nIn this thesis\, we first analyze the economic feasibility of Edge Computing deployment through a game-theoretic model\, showing how multitenant cooperation can mitigate the high cost of deployment. Then\, we evaluate under which conditions VCC can replace EC\, i.e.\, whether offloading tasks to vehicles can provide similar performance to EC. Results are obtained via high fidelity network and mobility simulations\, in an urban mobile network scenario. We find that VCC can achieve ultra-low latency\, with delays of about 10 ms\, even when vehicles are sparsely distributed. A comparative cost analysis shows that replacing EC with VCC can reduce infrastructure expenditure by approximately 10% over five years. Finally\, we propose a VCC management scheme to optimize energy consumption\, carbon emissions\, and to compute a fair allocation of the revenues generated by service end-user tasks.\n\nThe scheme is based on mathematical programming and coalitional game theory. Via Monte-Carlo simulation\, we show that energy consumption due to VCC is below 0.1% of the overall vehicle consumption in realistic scenarios\, and that vehicle owners receive substantial incentives for participating in task execution.\n\nIn summary\, this thesis demonstrates the feasibility of future generation mobile network architectures\, such as Edge Computing and Vehicular Cloud Computing\, to support extremely low-latency applications. CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:911@lincs.fr DTSTART;TZID=Europe/Paris:20251022T090000 DTEND;TZID=Europe/Paris:20251023T170000 DTSTAMP:20250924T145707Z URL:https://www.lincs.fr/events/way-to-6-g-mascots-conference/ SUMMARY:«Way to 6G» @ MASCOTS Conference DESCRIPTION:The 33rd International Conference on Modelling\, Analysis and Simulation of Computer and Telecommunications Systems (https://mascots25.iitis.pl/) will take place in Paris at Sorbonne University.\n\nThe LINCS organise the workshop « Way to  6G » that will be held on October 23.\n\n5G systems are now up and running in many countries and various regions across the world\, and research is turning its attention towards understanding the full potential and limitations of 5G\, defining and investigating relevant test-beds and experimental frameworks\, and defining the new frontier of 6G networks. Thus\, new and more demanding application areas are being considered\, such as Integrated Sensing and Communications (ISAC)\, Tele-Presence and enhanced reality\, Dependable Low Latency Systems that are needed for the Internet of Vehicles and other applications\, and massive-scale ubiquitous communications. These developments will be aided by artificial intelligence\, quantum communications and new terrestrial and spatial technologied to meet extremely high technical specifications. International bodies such 3GPP and the International Mobile Telecommunications project are already planning for these developments and the next five to six years 2025-2030 will allow us to address these challenges.\n\nThis workshop will attract research papers that:\n\n Investigate the important issues of sustainability\, security and network resilience\n Investigate the relevant theoretical and experimental methods\n The wired and wireless technologies that enable massive bandwidth enhancements and connect the unconnected\n Discuss potential technical solutions and usage scenarios\n Investigate the important issues of sustainability\, security and network resilience.\n CATEGORIES:Other Worshops,Workshop LOCATION:Sorbonne University - Campus Les Cordeliers\, 15\, rue de l'École-de-médecine\, Paris\, 75006\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=15\, rue de l'École-de-médecine\, Paris\, 75006\, France;X-APPLE-RADIUS=100;X-TITLE=Sorbonne University - Campus Les Cordeliers:geo:0,0 END:VEVENT BEGIN:VEVENT UID:924@lincs.fr DTSTART;TZID=Europe/Paris:20251015T140000 DTEND;TZID=Europe/Paris:20251015T150000 DTSTAMP:20251020T102022Z URL:https://www.lincs.fr/events/multi-agent-reinforcement-learning-for-url lc-modern-random-accesstbd-17/ SUMMARY:Multi-Agent Reinforcement Learning for URLLC Modern Random Access DESCRIPTION:Future wireless networks are expected to support a wide range of use cases with diverse requirements. Among these\, Ultra-Reliable Low-Latency Communications (URLLC) stand out as a key enabler for transformative applications across industries such as intelligent transportation\, smart grids\, and industrial automation.\n\nThese applications demand extremely high transmission reliability coupled with very low latency\, posing stringent quality of service (QoS) challenges. Since the emergence of 5G\, numerous enhancements have been introduced to meet URLLC demands.\n\nHowever\, ensuring adequate QoS still requires the design of new medium access control (MAC) protocols and advanced scheduling policies. In this seminar\, we present recent research addressing the scheduling of URLLC traffic on the uplink using Modern Random Access (MRA) and Multi-Agent Reinforcement Learning (MARL).\n\nWe first formulate the URLLC MRA (uMRA) problem as a Decentralized Partially Observable Markov Decision Process (Dec-POMDP). We then introduce uMRA-HAPPO\, a MARL-based solution employing the Heterogeneous Agents Proximal Policy Optimization (HAPPO) algorithm.\n\nFinally\, we evaluate our approach in scenarios inspired by 3GPP use cases\, demonstrating that uMRA-HAPPO achieves higher reliability than traditional deterministic and random scheduling strategies\, while satisfying strict latency constraints. CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:925@lincs.fr DTSTART;TZID=Europe/Paris:20251008T140000 DTEND;TZID=Europe/Paris:20251008T150000 DTSTAMP:20251020T101843Z URL:https://www.lincs.fr/events/estimating-the-hyperuniformity-exponent-of -point-processes/ SUMMARY:Estimating the hyperuniformity exponent of point processes DESCRIPTION:A joint work with G. Mastrilli\, B. Blaszczyszyn\, F. Lavancier\n\nHyperuniformity characterizes random spatial structures whose large-scale variance grows more slowly than that of Poisson processes. First introduced in statistical physics by Torquato and Stillinger [1]\, hyperuniform systems have attracted considerable attention due to their intermediate nature between perfect crystals\, liquids\, and glasses\, and appears in a wide range of applications\, from DNA organization and immune system dynamics to photoreceptor arrangements\, urban planning\, and cosmology.\nDetecting and quantifying hyperuniformity is essential across these diverse fields. Yet\, statistical testing for hyperuniformity has only recently begun to develop. In joint work [2]\, we address the problem of estimating the “strength” of hyperuniformity—formally\, the exponent governing the decay of the spectral density near zero frequency—in a class of stationary point\nprocesses in Euclidean space. The key mathematical idea is that the variance of linear statistics\, defined using smooth\, rapidly decaying test functions\, grows in a way that explicitly reflects this exponent. Using a multivariate central limit theorem for a family of such statistics\, constructed from orthogonal functions at multiple scales (e.g.\, wavelets)\, we derive an\nasymptotically consistent estimator of the strength of hyperuniformity. This estimator can be computed from a single realization of the point process and comes with explicit confidence intervals. We validate this approach through simulations of various point process models and demonstrate its applicability on real data.\n\nBibliography\n[1] Torquato\, S. and Stillinger\, F. H. (2003). Local density fluctuations\, hyperuniformity\, and order metrics. Physical Review E 68 041113.\n[2] Mastrilli\, G.\, B laszczyszyn\, B. and Lavancier\, F. (2024) Estimating the hyperuniformity exponent of point processes arXiv:2407.16797. CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:921@lincs.fr DTSTART;TZID=Europe/Paris:20251001T140000 DTEND;TZID=Europe/Paris:20251001T150000 DTSTAMP:20251020T101650Z URL:https://www.lincs.fr/events/statistical-learning-from-high-dimensional -and-distributed-data/ SUMMARY:Statistical learning from high-dimensional and distributed data DESCRIPTION:Modern learning algorithms must tackle real-world problems involving complex\, heterogeneous\, often unlabeled\, high-dimensional\, and potentially large-scale and/or distributed data.\n\nIn this talk\, the speaker will present a statistical learning approach focused on the design of latent variable models\, with approximation capabilities and learning guarantees. He will begin by introducing mixture-of-experts models designed for heterogeneous data and high-dimensional functional predictors\, which may be noisy\, and their training via regularization methods\, enabling sparse and interpretable representations.\n\nFinally\, when data are inherently distributed and/or constrained by confidentiality requirements\, the speaker will present federated learning and aggregation strategy for (statistical or neural) models trained in parallel.\n\n \; CATEGORIES:Seminars,Youtube LOCATION:Zoom + Amphi 4 chez Télécom-Paris\, 19 Place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + Amphi 4 chez Télécom-Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:922@lincs.fr DTSTART;TZID=Europe/Paris:20250924T140000 DTEND;TZID=Europe/Paris:20250924T150000 DTSTAMP:20250919T081312Z URL:https://www.lincs.fr/events/stochastic-geometry-and-dynamical-system-a nalysis-of-non-terrestrial-networks/ SUMMARY:Stochastic Geometry and Dynamical System Analysis of Non-Terrestrial Networks DESCRIPTION:This lecture will be mainly focused on broadband communication networks based Low Earth Orbit satellite constellations.\n\nIt will first describe the structure of these constellations\, their overall functionalities\, as well as the economic and strategic context of their current deployment.\n\nIt will then survey recent and ongoing results on the mathematical analysis of such networks.\n\nIt will first show that the stochastic geometry framework for planar cellular networks can be extended to this new spherical geometry setting. This leads to a system level analysis of coverage and spectral efficiency of this new\nclass of networks.\n\nIn addition\, it will show that a dynamical system analysis of this class of networks leads to new results on their ergodic or periodic behavior. The consequences on the dynamics of association\, handover\, and routing algorithms used in these networks will also be discussed. CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:915@lincs.fr DTSTART;TZID=Europe/Paris:20250917T140000 DTEND;TZID=Europe/Paris:20250917T150000 DTSTAMP:20251020T101414Z URL:https://www.lincs.fr/events/measuring-and-mitigating-risks-with-ai-dri ven-information-targeting-11/ SUMMARY:Measuring and Mitigating Risks with AI-Driven Information Targeting DESCRIPTION:In this talk\, the speaker will discuss risks related to online advertising and micro-targeting\, and present methods for measuring and reducing these risks. I will share insights from some of our latest results on political ad micro targeting CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:888@lincs.fr DTSTART;TZID=Europe/Paris:20250710T090000 DTEND;TZID=Europe/Paris:20250711T170000 DTSTAMP:20260204T162526Z URL:https://www.lincs.fr/events/lincs-annual-workshop-with-the-scientific- committee-2025/ SUMMARY:LINCS Annual Workshop with the Scientific Committee 2025 DESCRIPTION:As is tradition\, we are pleased to invite you to the 2025 edition of our Annual Workshop with the Scientific Committee : a two-day event taking place on July Tuesday 10 and Friday 11 in Palaiseau\, featuring scientific highlights\, surveys\, elevator pitches\, and posters from our scientific community.In addition\, on the evening of the 10th\, we are pleased to invite you to a dinner cruise on the river Seine.\n \nWe warmly encourage everyone\, to submit a presentation of their work to share with our scientific community.\n \n Like past years\, the 2025 edition will be filled by diffrents kind of talks:\n\n\n\nTalks by scientific committee members\n\n\n\nScientific Highlights talks by LINCS members\, Phd students\, postdocs or engineers\n\n\n\nSurvey talks by LINCS members\n\n\n\nElevator pitch &\; poster session by Phd students &\; postdocs\n\n\nThank you for your continued support and dedication to scientific progress and collaboration.\n \nProgram(click for printable version)\n\n\n\n\nThursday\, July 10th\, 2025\n\n\n \;\n\n\n\n\nCoffee reception \n\n\n9:00/9:30  \n\n\n\n\nOpening by Sébastien Tixeuil (Sorbonne University) Presentation of the edition 2025 of the LINCS Annual Workshop with the Scientific Committee\n\n\n9:30/9:35 \n\n\n\n\nDirector speech by Daniel Kofman (Télécom Paris) Presentation of LINCS: Identity / Spirit / Mission / Perspectives\n\n\n9:35/9:45 \n\n\n\n\n1st LINCS Scientific Highlights Securing V2X communications in cooperative driving applications: the platooning use caseFrancesca Bassi (SystemX) \n\n\n9:45/10:00 \n\n\n\n\n1st Invited talk from the Scientific Committee  A load-balancing journey towards improving earth-scale atmospheric modeling*Roch Guerin (Washington University in Saint Louis) \nModeling the earth atmosphere is both a scientific and computational grand challenge. Much progress has been made in developing and implementing models that track the planet-scale evolution of the earth atmosphere and predict its response to various perturbations. Those models are unsurprisingly computationally onerous and running them at scale is feasible only through extensive parallelization. In this work\, we target GEOS-Chem\, an open-source software for simulating the earth atmosphere used by hundreds of researchers worldwide and capable of large-scale parallelism. GEOS-Chem inherent parallelism notwithstanding\, leveraging it to realize effective speed-ups gives rise to interesting load-balancing and scheduling challenges. Of particular interest are the fact that computational workloads exhibit spatial and temporal variations and that the effectiveness of solutions to accommodate them vary based on the characteristics of the computational and communication platforms\, e.g.\, whether data movement is realized through a combination of Infiniband and RDMA or Ethernet and (AWS) EFA affects the underlying trade-off between computations and communication. This talks explores those questions and the different approaches they gave rise to\, and attempts to offer an illustration of the interplay between engineering and scientific investigations that effective solutions often require.\n* This is joint work with Daisy Wang\, Jordan Sun\, and Kunal Agrawal\n\n\n10:00/10:30  \n\n\n\n\nCoffee break \n\n\n10:30/11:00  \n\n\n\n\nPhD Elevator Pitch: Ahmad Nasser (Nokia Bell Labs) / Amal Sakr (Télécom SudParis) / Jules Sintes (Inria) / Alessa Mayer (Télécom SudParis) /  Baptiste Corban (Inria) / Thomas Le Corre (Inria) / Emanuele Mengoli (Télécom Paris) / Mohammed Amine Legheraba (Sorbonne University)  / Ludmila Courtillat-Piazza (Télécom Paris)\n\n\n11:00/11:45 \n\n\n\n\nLunch at the cantine + coffee in the inner garden\n\n\n11:45/13:30  \n\n\n\n\n1st LINCS Survey  Quantum 2.0 @ LINCSRémi Varloot et Ludovic Noirie (Nokia Bell Labs) \nThe 1st quantum revolution was about manipulating groups of quantum particles such as photons\, electrons and atoms\, and brought us technologies such as transistors and lasers. The 2nd quantum revolution\, or “Quantum 2.0”\, is about manipulating individual particles\, and promises its own set of game-changing innovations. These include quantum computing\, communications\, networks\, security\, sensing and more. These technologies are not fully mature\, however\, and each one provides numerous research opportunities. In this talk\, we give a quick overview of all things Quantum-2.0-related\, and outline the past\, current and future activities at LINCS in this field.\n\n\n13:30/14:00 \n\n\n\n\n2nd LINCS Scientific Highlights  Managing the cloud-to-edge continuum under uncertainty via AI methods with performance guaranteesAndrea Araldo (Télécom SudParis) \nThere is a long tradition of network management methods based on a precise model of the network and of the load. However\, in practical situations it is impossible to build such a model\, mainly because the load is uncertain and not known in advance. AI methods can overcome this model/reality gap\, by continuously adjusting decisions based on streams of monitoring observations. In this talk\, I will show how we applied AI to manage the cloud-to-edge continuum\, focusing on the following decisions: pricing\, placement of multiple “versions” of machine learning models\, resource allocation. The methods we applied are Hidden Parameter Markov Decision Processes\, Model-Based QLearning\, Online Learning. I will show that\, despite the uncertainty on the input load\, we are able to provide analytic guarantees on the worst-case performance or on the average performance. Such guarantees are important to foster the applicability of AI algorithms\, which is often hindered by their black-box nature.\n\n\n14:00/14:15 \n\n\n\n\n3rd LINCS Scientific Highlights  Some highlights and perspectives in Network CalculusAnne Bouillard (Inria) \nNetwork Calculus is a theory that has been developed to compute performance guarantees\, such as end-to-end delays\, in networks. In this talk\, I will discuss some improvement in analysis of multiclass network obtained in the past years (while working at Huawei)\, and present some perspective about the worst-case simulation.\n\n\n14:15/14:30 \n\n\n\n\n4th LINCS Scientific Highlights  Certainty-Guided Reasoning in Large Language Models: A Dynamic Thinking Budget ApproachAlonso Silva (Nokia Bell Labs)\nThe rise of large reasoning language models (LRLMs) has unlocked new potential for solving complex tasks. These models operate with a thinking budget\, that is\, a predefined number of reasoning tokens used to arrive at a solution. We propose a novel approach\, inspired by the generator/discriminator framework in generative adversarial networks\, in which a critic model (potentially a specialized model) periodically probes to assess whether it has reasoned enough to reach a confident conclusion. If not\, it continues reasoning until a target certainty threshold is met. We explore how model certainty can be quantified and integrated into the reasoning process\, and discuss its practical implications. Through experiments and analysis\, we show that certainty-guided reasoning improves accuracy while reducing unnecessary token usage.\n\n\n14:30/14:45 \n\n\n\n\nPoster session / Refreshment Break\n\n\n14:45/15:30  \n\n\n\n\n2nd Invited talk from the Scientific Committee DRACO: Dynamic Resource Allocation for Concurrent ML ApplicationsHolger Karl (Universität Potsdam) \nGPUs are increasingly used to accelerate ML applications. Often\, they are used to offload inference tasks\, which are usually latency-critical. But the arrival patterns of inference requests are often bursty and include periods without any load. Furthermore\, inference tasks may not be able to fully utilize the compute resources of a GPU\, even with larger batch sizes. Consequently\, the average utilization of a GPU that is exclusively used for an inference service is low. Industry has recognized the problem of underutilization and offers solutions to co-locate applications\, improving utilization and cost-efficiency. We show\, however\, that these state-of-the-art solutions only maintain low inference latency when their compute resources are significantly overprovisioned. We propose DRACO\, a system to co-locate latency-critical inference tasks with a batch job\, e.g.\, training an ML model\, without violating the inference latency requirements. DRACO autonomously estimates the resource requirements of inference tasks and detects periods with low load by periodically sampling the GPU's performance monitoring unit (PMU). Furthermore\, DRACO manages a pool of streaming multiprocessor (SM) partitions and dynamically assigns them to inference tasks to meet latency requirements. Leftover resources are granted to the co-located batch job. Depending on the workload\, DRACO increases throughput of the batch job by up to 4x compared to industrial solutions while keeping inference latency low.\n* This is a joint work with Theo Radig\n\n\n15:30/16:00  \n\n\n\n\n5rd LINCS Scientific Highlights  Modelling Equilibria under IrrationalityAshok Krishnan (Inria)\nModels of strategic decision making by human agents\, usually assume that the agents are rational. However\, in practice\, humans exhibit different kinds of irrational behaviour in their decision making. Prospect theory is a mathematical framework that models some aspects of this irrationality. The application of prospect theory in the study of games and equilibria is an emerging area\; this provides insights on change in equilibrium behaviour in the presence of irrationality. However\, the application of prospect theory throws open a number of theoretical challenges. The talk will outline some preliminary results and open questions.\n\n\n16:00/16:15 \n\n\n\n\n6th LINCS Scientific Highlights  Preventing WebRTC IP Address LeaksGuillaume Nibert (Sorbonne University) \nThe WebRTC API enables real-time communication of text\, video\, and audio media streams through a web browser without requiring third-party extensions. However\, it was not designed with privacy in mind. We conduct an experiment to analyse privacy leaks associated with WebRTC. Our findings show that despite recent updates to the WebRTC specification and its implementations\, sensitive public IP addresses can still be leaked during audio/video communication\, particularly in large non-NAT corporate networks\, even when using a VPN\, SOCKS or HTTP/S proxy. To address the observed leaks\, we develop a simple\, easily maintainable\, cross-platform open-source solution that confines the Mozilla Firefox web browser in a docker container. We also take into account the possibility of a malicious adversary compromising the browser. Our tests have shown that our containerised solution is effective in all situations without restricting applications.\n\nhttps://hal.science/hal-05048077\n\n\n16:15/16:30 \n\n\n\ n\nTransfer to Paris  for Reception Cruise\n\n\n17:00  \n\n\n\n\nPeniche TIVANO - Escales de Grenelle : Métro : Ligne 6 – stop Bir-Hakeim / RER C : stop Champ de Mars Tour Eiffel / Parking Centre commercial Beaugrenelle\, 5\, Quai André Citroën (70015) / Parking Kennedy / Radio France\, 1\, av. du Pdt Kennedy (70016)\n\n\n18:30 \n\n\n\n\nFriday\, July 11th\, 2025\n\n\n \;\n\n\n\n\nCoffee reception \n\n\n9:00/9:30  \n\n\n\n\n7th LINCS Scientific Highlights Overview of Regular Activities for the Upcoming Academic YearFrancesca Bassi (SystemX) \n\n\n9:30/9:45 \n\n\n\n\n8th LINCS Scientific Highlights Handover frequency in dynamic terrestrial communication networkSanjoy Kumar Jhawar (Télécom Paris) \nIn modern architecture of communication network using LEO and MEO satellite constellation\, it is crucial to know how frequently an user is performing handover. As a key performance metric of the system\, handover frequency essentially reflects onto the cost of quality service. In this talk we consider a far more simplified model of the same flavor of LEO and MEO satellite constellation using stochastic geometry. In this dynamic communication model on the Euclidean plane we consider an user located at origin and it is served by the mobile base stations with initial locations given by a homogeneous Poisson point process. The base stations are moving at an identical speed in a random direction. The user stays connected to the nearest base station at any given point of time. Since the base stations are moving\, the user disconnects and connects with different base stations over time\, which ever base station is the closest. We determine the handover frequency first in the single-speed setting and use it as a inspiration to the multi-speed scenario. The model explored in this work have several important variants which are linked to these motivations. These variants include the finite visibility case\, the case when the initial locations of the base stations are given by Poisson or Manhattan line Cox point processes. Their motion is along the underlying lines. The final variant is of course the spherical case. We shall briefly discuss about the steps towards relaxing these simplifications from the planar to spherical geometry.\n*This is a joint work with François Baccelli\, Inria Paris &\; Telecom Paris.\n\n\n9:45/10:00 \n\n\n\n\n3rd Invited talk from the Scientific Committee Finding General Hierarchies Beyond Binary TreesPatrick Thiran (EPFL) \nHierarchical clustering seeks to uncover nested structures in data by constructing a tree of clusters\, where deeper levels reveal finer-grained relationships. Traditional methods\, including top-down and bottom-up approaches\, face two major limitations: (i) They always return a hierarchy\, even if none exists\, and (ii) they are restricted to binary trees. In this talk\, we address both challenges and find the hierarchy that provides maximal insight into the relationships defined by a similarity measure: We call it the most informative hierarchy. It is not constrained to binary structures and\, when no hierarchical relationships exist\, it collapses to a star tree. To infer the most informative hierarchy\, we propose a two-step algorithm that trims the binary hierarchy obtained by a linkage algorithm\, and we show that it recovers the true hierarchy among clusters of a graph generated by a hierarchical extension of the degree-corrected block model.\nJoint work with Maximilien Dreveton\, Daichi Kuroda et Matthias Grossglauser\, EPFL.\n\n\n10:00/10:30  \n\n\n\n\nCoffee break \n\n\n10:30/11:00  \n\n\n\n\nPhD Elevator Pitch:  Alex Pierron (Télécom SudParis) / Tiphaine George (Télécom Paris)  / Julien Cardinal (Inria) / Luis Muneca Tomas (Nokia Bell Labs / Inria) / Aoyu Pang (Nokia Bell Labs) / Iain Burges (Télécom SudParis) / Hugo Rimlinger (Sorbonne University) / Shu Li (Inria)\n\n\n11:00/11:45 \n\n\n\n\nLunch at the cantine + coffee in the inner garden\n\n\n11:45/13:30  \n\n\n\n\n2nd LINCS Survey  Towards greener AIsMarc-Olivier Buob (Nokia Bell Labs) \nThis presentation explains how to make AI more eco-friendly. First\, we assess the current environmental impact of AI and its future evolution\, more specifically regarding to energy consumption. Secondly\, we present tools estimating the energy footprint of an AI. Thirdly\, we present techniques to mitigate this problem. Finally\, we conclude this presentation with a list of best practices.\n\n\n13:30/14:00 \n\n\n\n\n9thLINCS Scientific Highlights  Federated learning-based collaborative intrusion detection in highly heterogeneous environmentsGregory Blanc (Télécom SudParis) \nNetworks of the future\, including 5G and Beyond 5G\, as well as IoT\, are connecting more and more devices to the Internet\, improving the connectivity and increasing the service offer\, at the expense of their exposure to malicious actors. Although many countermeasures exist\, it remains a daunting task tosecure all devices\, in particular\, when they are owned by third parties. Monitoring has thus gained importance to assist security operators in discovering ongoing threats. Recent works have focused on leveraging machine learning (ML) to automate knowledge acquisition from local data or publiclyavailable datasets\, with the latter focusing on attack data and the former on benign data. The quality of such ML-based intrusion detection system (ML-IDS) depends on the quality or availability of the data. Therefore\, a collaborative approach may significantly improve the performance of individual ML-IDSes\, provided the data is from similar domains. As local training data cannot be shared for privacy reasons\, Federated learning-based IDS (FL-IDS) emerge as a promising solution. A few scientific locks remain on its true ability to enable knowledge sharing\, to work on heterogeneous data or to guarantee the privacy of its participants. In this talk\, we will discuss some solutions.\n\n\n14:00/14:15 \n\n\n\n\n10th LINCS Scientific Highlights  Timing advance and Doppler shift estimation in 5G NTN satellite networksAshutosh Balakrishnan (Télécom Paris) \nAccurate timing advance (TA) computation is critical in 5G non-terrestrial networks (NTN). It is necessary to compute it accurately to avoid inter user interference in the uplink at the satellite (BS) level. Estimating TA in low earth orbit (LEO) satellite networks is more challenging than in classical terrestrial deployments due to the larger path loss and high-speed movement of non-stationary LEO satellites. Capturing the doppler shift also becomes very pertinent in such scenarios. The problem becomes more challenging in the event of the UE being mobile itself. In this talk\, we first showcase an extended Kalman filter (EKF) based recursive Bayesian framework to accurately estimate the TA and Doppler shift in the presence of LEO satellite-UE joint motion dynamics. The framework first accurately models the joint motion dynamics and then constructs a Jacobian to linearize the inherent non-linearities present in the motion process. Probabilistic insights are also provided. The proposed framework is also useful when the satellite and UE clocks are not in sync\, with the corresponding clock drift a function of the measured time difference of arrivals. Our results showcase the efficacy and robustness of the proposed EKF framework to estimate the TA and Doppler shift\, even at very high UE speeds. The work is expected to be extremely useful in realizing LEO satellite based non-terrestrial networks. Further\, as a current work\, we are working on statistical characterization of the Doppler shift experienced at the UE. We showcase the probability densities of the Doppler shift in a 2D isotropic scenario and the engineering insights through it. \n\n\n14:15/14:30 \n\n\n\n\nPoster session / Refreshment Break\n\n\n14:30/15:15  \n\n\n\n\n11th LINCS Scientific Highlights  Robustness of Causal Discovery Algorithms: a Testbed Study on NFV SystemsFabio Pianese (Nokia Bell Labs)\nWe explore the applicability to high-speed NFV systems of causal discovery\, a framework of statistical and algorithmic techniques that aims to uncover causal relationships. This framework highlights the ‘true’ structure of the processes that lead to observed outcomes while transcending spurious correlations. Causal discovery is crucial in the NFV domain\, where introducing new levels of abstraction in the execution of virtualized services may diminish an observer’s ability to understand configuration or runtime issues. As a drawback\, however\, strict assumptions must be established concerning the data collection and the underlying system behavior. Most causal discovery techniques have been exercised on synthetic data\, which lack the complexity and subtlety of real-world data generation processes. In this paper\, we instrument a testbed to allow the controlled deployment and perturbation of NFV topologies and evaluate the algorithms’ robustness\, defined as their ability to successfully reconstruct a correct configuration from observational and interventional probings. We then consider some ramifications of discovery quality for anomaly detection.\n\n\n15:15/15:30 \n\n\n\n\n12h LINCS Scientific Highlights  Why Instant-Runoff Voting Is So Resilient to Coalitional Manipulation: Phase Transitions in the Perturbed CultureFrançois Durand (Nokia Bell Labs)\nPrevious studies have shown that Instant-Runoff Voting (IRV) is highly resistant to coalitional manipulation (CM)\, though the theoretical reasons for this remain unclear. To address this gap\, we analyze the susceptibility to CM of three major voting rules—Plurality\, Two-Round System\, and IRV—within the Perturbed Culture model. Our findings reveal that each rule undergoes a phase transition at a critical value ?_? of the concentration of preferences: the probability of CM for large electorates converges exponentially fast to 1 below ?_? and to 0 above ?_?. We introduce the Super Condorcet Winner (SCW)\, showing that its presence is a key factor of IRV’s resistance to coalitional manipulation\, both theoretically and empirically. Notably\, we use this notion to prove that for IRV\, ?_? = 0\, making it resistant to CM with even minimal preference concentration.\n\n\n15:30/15:45 \n\n\n\n\n13h LINCS Scientific Highlights  Stochastic Geometry and Dynamical System Analysis of Walker Satellite ConstellationsFrançois Baccelli (Inria/Télécom Paris)\nLow Earth orbit (LEO) and medium Earth orbit (MEO) satellite networks consist of multiple orbits which are populated with many satellites. A widely used spatial architecture for LEO or MEO satellites is the Walker constellation\, where the longitudes of orbits are equally spaced and the satellites are equally spaced along the orbits. In this paper\, we develop a stochastic geometry model for the Walker constellations. This proposed model enables an analysis based on dynamical system theory\, which allows one to address essential structural properties such as periodicity and ergodicity. It also enables a stochastic geometry analysis under which we derive the performance of downlink communications of a typical user at a given latitude\, as a function of the key constellation parameters.\n\n\n15:45/16:00 \n\n\n\n\nPublic Comment by the LINCS Scientific Committee  \n\n\n16:00/16:30  \n\n\n\n\nWorkshop Closing\n\n \n\n\n ATTACH;FMTTYPE=image/jpeg:https://www.lincs.fr/wp-content/uploads/2025/09/ Annual_WS_Cover_Small.png CATEGORIES:LINCS Workshop,Workshop LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:913@lincs.fr DTSTART;TZID=Europe/Paris:20250704T110000 DTEND;TZID=Europe/Paris:20250704T120000 DTSTAMP:20250626T074011Z URL:https://www.lincs.fr/events/designing-server-sets-for-anycast-cdn/ SUMMARY:Designing Server Sets for Anycast CDN DESCRIPTION:In recent years\, there has been growing interest in the effective operation of anycast Content Delivery Networks (CDN). Existing anycast CDNs answer the same set of cache servers (CSes) for all content requests without considering the geographical distribution of popularity of contents. It has also been reported that the appropriateness of the selection of delivery servers decreases as the number of servers assigned to the same IP address increases in anycast delivery. To solve these problems\, we propose a new anycast distribution method that incorporates the spatial locality of the popularity of content. Specifically\, we propose an algorithm that creates multiple CS sets consisting of a small number of CSs and assigns the optimal CS set to each content by minimizing the number of CSes in the CS set. The algorithm aims to reduce the dispersion of delivery delay by minimizing the number of CSes in the CS set\, while covering a wide range of countries. Using a genetic algorithm\, we construct CS sets that incorporates spatially biased ASes and verify its effectiveness through computer simulation. Numerical evaluation results show that the proposed method can effectively cover ab out 80% of requests of highly popular content with about 15 ASes. It is expected that the proposed method can effectively cover the requirements for most of the contents with a small number.\n\nShort bio:\nNoriaki Kamiyama received his M.E. and Ph.D. degrees in communications engineering from Osaka University in 1994 and 1996\, respectively.  From 1996 to 1997\, he was with the University of Southern California as a visiting researcher. He joined NTT Multimedia Network Laboratories in 1997\, and he has been at NTT Network Technology Laboratories by 2016. He was also with the Osaka University as an invited associate professor from 2013 to 2014 and an invited professor in 2015. From 2017\, he has been a professor of Fukuoka University. From 2021\, he is a professor of Ritsumeikan University. He has been engaged in research concerning content distribution systems\, network design\, network economics\, traffic measurement and analysis\, and traffic engineering. He received the best paper award at the IFIP/IEEE IM 2013. He is a member of IEEE\, ACM\, and IEICE.\n\n \; CATEGORIES:Seminars LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:889@lincs.fr DTSTART;TZID=Europe/Paris:20250625T090000 DTEND;TZID=Europe/Paris:20250625T180000 DTSTAMP:20260204T160416Z URL:https://www.lincs.fr/events/lincs-phd-student-day-2025/ SUMMARY:LINCS PhD Student Day 2025 DESCRIPTION:#RegistrationForm\nSimilar to last year\, for those who were there\, this day is entirely dedicated to the PhD Students and Postdocs of the lab. It will consist of a morning with elevator pitches\, posters\, and brainstorming\, followed by a friendly lunch and a team-building activity held outdoors.\n\nThe purpose of this day is to provide participants with an opportunity to present their work\, learn about their peers’ research\, and receive valuable feedback from senior members of LINCS.\n\nAll PhD Students and Postdocs are kindly invited to present both a poster and an elevator pitch.\n\nIf you need your poster to be printed\, please send it to me no later than June 16\, as the printing procedure at Telecom Paris requires a few days and is not under my control.\n\nThis event will also serve as practice for those presenting at the upcoming annual workshop in front of the scientific committee\, scheduled for July 10 &\; 11.\n\nFor the team-building activity\, we are still evaluating options\, but we truly appreciate the suggestions many of you have shared.\n\nThe proposed lunch and recreational activity will be covered by LINCS.\nPROGRAM OVERVIEW\n\n 8:45 – 12:00 TEAM BUILDING SESSION: The provider OOXYGENE – Jeux d’aventure will welcome you on Wednesday\, June 25 at 9:30 AM at the western section of Parc Eugène Chanlon (near 47\, rue de Corbeville – see attached map).\n\nIt will be a fun\, dynamic adventure! The goal is to slow down other teams\, hide to escape them\, find immunity items\, or rely on fate—anything goes\, as long as your quest leads you to the legendary treasure before others. Distance: about 2.5–3 km.\n\nDress code: sports shoes\, cap\, water bottle\, and shorts or lightweight trousers. No dedicated parking—you can park in nearby streets. Suggested team size: up to 7 participants. Please try to mix with people you don’t know yet! Note: there are no public restrooms on site.\n\n 12:00 – 13:45 LUNCH: In the hall of Telecom Paris or\, weather permitting\, in the inner garden next to the lecture halls.\n 13:45 OPENING: Speech by LINCS Director Daniel Kofman.\n 14:00 ELEVATOR PITCH SESSION 1\n\n Alex Pierron (14:00–14:05)\n Baptiste Corban (14:05–14:10)\n Capucine Barré (14:10–14:15)\n Emanuele Mengoli (14:15–14:20)\n Alessa Mayer (14:20–14:25)\n Daniel Henning (14:25–14:30)\n Israa Khaled (14:30–14:35)\n Guillaume Nibert (14:35–14:40)\n Jorge Mirande (14:40–14:45)\n Hugo Rimlinger (14:45–14:50)\n Junepyo Jung (14:50–14:55)\n Julien Cardinal (14:55–15:00)\n\n\n 15:00 REFRESHMENT BREAK &\; POSTER SESSION\n 15:20 ELEVATOR PITCH SESSION 2\n\n Ashutosh Balahrishnan (15:20–15:25)\n Ludmila Courtillat-Piazza (15:25–15:30)\n Iain Burge (15:30–15:35)\n Hakim Ouedraogo (15:35–15:40)\n Jules Sintes (15:40–15:45)\n Luis Munecas Tomas (15:45–15:50)\n Mohamed Amine Legheraba (15:50–15:55)\n Rosario Patanè (15:55–16:00)\n Tom Boumba (16:00–16:05)\n Tiphaine George (16:05–16:10)\n Ufuk Bombar (16:10–16:15)\n\n\n 16:15 – 17:00 REFRESHMENT BREAK &\; POSTER SESSION\n ATTACH;FMTTYPE=image/jpeg:https://www.lincs.fr/wp-content/uploads/2026/01/ PhD-Student-Day_half.png CATEGORIES:PhD Elevator Pitch Session,Workshop END:VEVENT BEGIN:VEVENT UID:910@lincs.fr DTSTART;TZID=Europe/Paris:20250618T140000 DTEND;TZID=Europe/Paris:20250618T150000 DTSTAMP:20250701T152827Z URL:https://www.lincs.fr/events/geometric-lower-bounds-for-stochastic-proc essing-networks-with-limited-connectivity/ SUMMARY:Geometric lower bounds for stochastic processing networks with limited connectivity DESCRIPTION:Abstract:\n\nWe consider processing networks where multiple dispatchers are connected to single-server queues by a bipartite compatibility graph\, modeling constraints that are common in distributed data center networks\, typical in cloud systems\, due to geographic reasons or data locality issues. We prove lower bounds for the steady-state occupancy\, i.e.\, the complementary cumulative distribution of the empirical queue length measure. Our lower bounds are geometric\, with ratios determined by two flexibility metrics: the average degree of the dispatchers and a novel metric that averages the minimum degree over the compatible dispatchers across the servers. Using these lower bounds\, we establish that the large scale asymptotic performance of a processing network cannot match that of the classic Power-of-d or JSQ policies unless these flexibility metrics approach infinity in this large scale limit.\n\nPreprint: https://arxiv.org/abs/2505.08974\n\nSpeaker: Andres Ferragut\, https://aferragu.github.io CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:909@lincs.fr DTSTART;TZID=Europe/Paris:20250606T110000 DTEND;TZID=Europe/Paris:20250606T120000 DTSTAMP:20250603T073249Z URL:https://www.lincs.fr/events/writing-reactive-code-in-python-3/ SUMMARY:Writing reactive code in Python DESCRIPTION:It is often stated that “there are 2 hard problems in computer science: cache invalidation\, naming things\, and off-by-1 errors.” In this talk\, we’ll take a shot at addressing an instance of the first problem: cache invalidation. More specifically\, we consider code in which a number of values are 1- computed based off of other (dynamic) values and 2- cached to avoid recomputing them all the time\, and look at how to automate lazy computation\, caching\, cache invalidation and dependency tracking. This will be designed with the mindset of building a library/module which aims to minimize the impact on user code. CATEGORIES:Tools, Tips and Tricks,Working Group END:VEVENT BEGIN:VEVENT UID:890@lincs.fr DTSTART;TZID=Europe/Paris:20250528T140000 DTEND;TZID=Europe/Paris:20250528T150000 DTSTAMP:20250527T084735Z URL:https://www.lincs.fr/events/pushing-the-boundary-for-index-policies-re cent-advances-challenges-and-opportunities/ SUMMARY:Pushing the Boundary for Index Policies: Recent Advances\, Challenges and Opportunities DESCRIPTION:Abstract\nMany network control problems (e.g.\, minimizing age-of-information\, network slicing\, and caching\, just to name a few examples) can be cast as Markov Decision Processes (MDP). However\, as the network size increases\, MDP is known to suffer from curse-of-dimensionality. Index policies\, e.g.\, the Whittle index\, can be a useful tool to decompose an otherwise intractable multi-agent MDP into per-agent problems\, which can then lead to low-complexity\, scalable and highly adaptive solutions. However\, the existing theory of Whittle index still has severe limitations. First\, when the problem of interest is slightly more complex\, even verifying Whittle indexability becomes very challenging. Second\, Whittle index cannot be used for systems with multiple heterogeneous resources. Third\, calculating the index can still incur high overhead. In this talk\, we will introduce some recent work that pushes the boundary for index policies in terms of (i) indexability verification\, (ii) partial index for multiple resources\, and (iii) fast index-computation. Our goal is to make index policies more easily applicable to a larger class of problem settings. We conclude with some discussions on further challenges and potential opportunities for index policies.\nBio:\nXiaojun Lin received his B.S. from Zhongshan University\, Guangzhou\, China\, in 1994\, and his M.S. and Ph.D. degrees from Purdue University\, West Lafayette\, Indiana\, in 2000 and 2005\, respectively. He joined the faculty of School of Electrical and Computer Engineering at Purdue University in 2005\, and became a Professor in 2017. Since June 2023\, he joined the Department of Information Engineering\, The Chinese University of Hong Kong\, as a Professor and Global STEM Scholar.\nDr. Lin's research interests are in the analysis\, control and learning of large and complex networked systems\, including both communication networks and cyber-physical systems. He received 2005 best paper of the year award from Journal of Communications and Networks\, IEEE INFOCOM 2008 best paper award\, ACM MobiHoc 2021 best paper award\, and ACM e-Energy 2022 best paper award. He received the NSF CAREER award in 2007. He has served as an Associate Editor for IEEE/ACM Transactions on Networking\, as an Area Editor for (Elsevier) Computer Networks journal\, and as a Guest Editor for (Elsevier) Ad Hoc Networks journal. Dr. Lin is a Fellow of IEEE. CATEGORIES:Seminars LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:907@lincs.fr DTSTART;TZID=Europe/Paris:20250523T110000 DTEND;TZID=Europe/Paris:20250523T120000 DTSTAMP:20250520T091853Z URL:https://www.lincs.fr/events/home-assistant-a-newbies-impressions/ SUMMARY:Home Assistant : a newbie’s impressions DESCRIPTION:Home IoT deployments including multi-vendor appliances and cloud services are becoming commonplace. In this talk\, I relate my first impressions of Home Assistant\, an open-source software project driven by a community of home automation enthusiasts which is approaching maturity after 12 years of development. I describe my experience setting up a base system at home\, learning about ESP32 microcontrollers and self-hosted voice assistants\, and then taking Home Assistant to work as a convenient base platform for voice-controlled\, LLM powered demos. CATEGORIES:Practical Networks,Working Group LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:897@lincs.fr DTSTART;TZID=Europe/Paris:20250507T140000 DTEND;TZID=Europe/Paris:20250507T150000 DTSTAMP:20250408T063502Z URL:https://www.lincs.fr/events/resilient-and-efficient-decentralized-lear ning/ SUMMARY:Resilient and Efficient Decentralized Learning DESCRIPTION:Decentralized learning enhances privacy\, scalability\, and fault tolerance by  distributing data and computation across nodes. A popular approach is Federated learning\, which relies on a central aggregator\, yet faces challenges such as server vulnerabilities\, scalability issues\, privacy risks and most importantly\, the single point of failure. Alternatively Gossip Learning offers fully decentralization through peer-to-peer exchanges of model updates\, ensuring robustness and privacy\, at the price of slower model convergence. In our work\, we introduce a novel decentralized learning framework called HEAL. By exploiting an innovative topology based on dynamic hubs\, HEAL delivers performance similar to that of Federated learning\, but with the decentralization and resilience of Gossip learning. CATEGORIES:Seminars LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:887@lincs.fr DTSTART;TZID=Europe/Paris:20250422T090000 DTEND;TZID=Europe/Paris:20250423T183000 DTSTAMP:20250516T133024Z URL:https://www.lincs.fr/events/joint-lincs-sorbonne-university-grifin-wor kshop-on-ai-networks-cybersecurityjoint-lincs-sorbonne-university-workshop -on-ai-networks-cybersecurity/ SUMMARY:Joint LINCS / Sorbonne University / Grifin Workshop on AI\, Networks & Cybersecurity DESCRIPTION:We are pleased to announce the upcoming Joint LINCS / Sorbonne University / ANR - Grifin Workshop on AI\, Networks &\; Cybersecurity\, which will take place on April 22 &\; 23\, 2025\, in Sorbonne University\, Les Cordeliers campus\, 15 rue de l'École-de-médecine\, 75006 Paris.\nRegistration\n\n Registration is mandatory.\n Are you a PhD Student or a Postdoc and want to be part of it? You can submit your poster and give an elevator pitch! Fill in the blanks.\n\nSpeakers\nApril 22 - Day 1\n\n 9h30-10h15: Accueil/Café\n 10h15-10h30: Introduction (presentation of LINCS\, GRIFIN\, and program)\n 10h30-11h00: "How dataset quality shapes resistance to data poisoning"\, by Katarzyna Wasielewska\n 11h00-11h30: "Network Data Augmentation Through Protocol-Constrained Traffic Generation" \, by Francesco Bronzino\n 11h30-12h30: "AI for the Detection and Mitigation of Cyberattacks" \, by Erol Gelenbe\n 12h30-14h00: Lunch\n 14h00-14h30: Elevator Pitch\n\n "Cybersecurity impact of AI Optimization in B5G networks"\, by Alex Pierron\n "Privacy Benchmarking of IDS with FREIDA"\, by Solayman Ayoubi\n "MetaLore: Learning to Orchestrate Communication and Computational Resources for Metaverse Synchronization" by Ohri Elif\n "Studying Gossip Learning" by Alexandre Pham\n\n\n 14h30-15h15: Poster around coffee\n 15h15-16h15: "Collaborative Learning attacks and defenses"\, by Alice Héliou\n 16h15-17h15: "A Small Tutorial on Byzantine-Robustness - Federated Learning with adversarial nodes"\, by Rafael Pinot\n\nApril 23 - Day 2\n\n 09h30-10h30: "Securing the Future: Understanding Attacks on AI-Driven Network Management"\, by Valeria Loscri\n 10h30-11h00: Pause café\n 11h00-11h30: "Can we still learn something from Darknet traffic?"\, by Jérôme François\n 11h30-12h00: "Automating security management for the cyberspace"\, by Rémi Badonnel\n 12h00-12h30: "Advanced Network Fuzzing for Networked System Testing" \, by W. Mallouli\n 12h30-14h00: Lunch\n 14h00-15h00: Elevator pitches\n\n "Improving anonymous secure communications on the Internet"\, by Guillaume Nibert\n "HEAL: Resilient and Self-* Hub-based Learning" by Mohamed Amine Legheraba\n "DDoS Mitigation while Preserving QoS: A Deep Reinforcement Learning-Based Approach" by Shurok Khozam\n "A genetic algorithm approach to flight optimization"\, by Massinissa Tighilt\n\n\n 14h30-15h30: Poster around coffee\n 15h30-16h00: "Data quality: the key to automation"\, by José Camacho\n 16h00-16h30: "Managing the cloud-to-edge continuum under uncertainty via AI methods with performance guarantees" by Andrea Araldo\n 16:30-16:45: Conclusion\n\nTalks\nAndrea Araldo (Télécom Sud Paris)\n"Managing the cloud-to-edge continuum under uncertainty via AI methods with performance guarantees"\n\n\nThere is a long tradition of network management methods based on a precise model of the network and of the load. However\, in practical situations it is impossible to build such a model\, mainly because the load is uncertain and not known in advance. AI methods can overcome this model/reality gap\, by continuously adjusting decisions based on streams of monitoring observations.\n\nIn this talk\, I will show how we applied AI to manage the cloud-to-edge continuum\, focusing on the following decisions: pricing\, placement of multiple “versions” of machine learning models\, resource allocation. The methods we applied are Hidden Parameter Markov Decision Processes\, Model-Based QLearning\, Online Learning. I will show that\, despite the uncertainty on the input load\, we are able to provide analytic guarantees on the worst-case performance or on the average performance. Such guarantees are important to foster the applicability of AI algorithms\, which is often hindered by their black-box nature.\nRémi Badonnel (Loria)\n"Automating security management for the cyberspace"\n\n\nThe Internet has become a great integration platform capable of efficiently interconnecting billions of entities\, from simple sensors to large data centers. This platform provides access to multiple hardware and virtualized resources (servers\, networking\, storage\, applications\, connected objects) ranging from cloud computing to Internet-of-Things infrastructures. From these resources that may be hosted and distributed amongst different providers and tenants\, the building and operation of complex and value-added networked systems is enabled. These systems are however exposed to a large variety of security attacks\, that are also gaining in sophistication and coordination.\n\nIn that context\, we investigate challenges about automating security management for the cyber-space\, through the development of new monitoring and configuration solutions tailored to these systems.\nFrancesco Bronzino (ENS Lyon)\n"Network Data Augmentation Through Protocol-Constrained Traffic Generation"\n\nTraffic Generation Datasets of labeled network traces are essential for a multitude of machine learning (ML) tasks in networking\, yet their availability is hindered by privacy and maintenance concerns\, such as data staleness. To overcome this limitation\, synthetic network traces can often augment existing datasets. Unfortunately\, current synthetic trace generation methods\, which typically produce only aggregated flow statistics or a few selected packet attributes\, do not always suffice\, especially when model training relies on having features that are only available from packet traces. This shortfall manifests in sub-optimal performance on ML tasks when employed for data augmentation.\n\nIn this talk\, we discuss our ongoing work on developing generative techniques to augment network datasets for a variety of tasks\, from traffic classification to QoE measurement. First\, we present NetDiffusion\, a tool that uses a finely-tuned\, controlled variant of a Stable Diffusion model to generate synthetic network traffic that is high fidelity and conforms to protocol specifications. Our evaluation demonstrates that packet captures generated from NetDiffusion can achieve higher statistical similarity to real data and improved ML model performance than current state-of-the-art approaches (e.g.\, GAN-based approaches). Second\, we discuss how this approach is more suited to support common network analysis tasks\, as well as our ongoing efforts solving NetDiffusion’s limitations.\nJosé Camacho (University of Granada)\n"Data quality: the key to automation"\n\n\nData quality is a central topic often neglected in Data Science. With the current interest in AI and Deep Learning\, some data scientists believe that creating a successful data analysis pipeline is simply a matter of finding a suitable AI model\, disregarding the possibility that the data itself may be poor. This view conflicts with the old Data Science mantra\, “Garbage In\, Garbage Out\,” which dates back to the origins of computational science. Can you predict when you will suffer from cancer\, if at all\, based on your eye color? Probably not. Can you detect a cybersecurity attack only from traffic traces? Well\, maybe\, but that might not be sufficient.\n\nIn my experience\, many data pipelines succeed only after proper experimental design (that controls data generation)\, data visualization and understanding\, filtering\, cleaning\, transformation\, and data fusion from complementary sources. In my experience\, again\, 75% of a data scientist’s traditional work is often devoted to data preparation\, which is quite complicated to automate.\n\nIn this talk\, I will discuss some of the pitfalls we face when designing an AI pipeline\, drawing examples from areas other than autonomic networks\, and I will make the association with challenges for AI automation in network management.\nJérôme François (University of Luxembourg)\n"Can we still learn something from Darknet traffic?"\n\n\nDarknet allows to collect supposed malicious traffic by exposing entire IP subnetworks into the wild. They have been used for more than two decades for monitoring large threats over Internet such as DDoS\, botnets or probing activities. Their passive nature limits the knowledge that can be gathered beyond these large phenomena.\n\nUsing the Darknet of the High Security Lab in Inria Nancy\, we have performed several analysis over the years showing that Darknet can still be used to anticipate some threats or extract relevant knowledge to perform traffic analysis in other networks. We'll briefly these different approaches and showing limitations and remaining opportunities.\nErol Gelenbe (Institute of Theoretical &\; Applied Informatics\, Polish Academy of Sciences\,  King’s College London &\; CNRS I3S\, Université Côte d’Azur\, Nice\, France)\nAI for the Detection and Mitigation of Cyberattacks\n\n\nGateway Servers for the Internet of Things are used in critical application areas such as industrial IoT\, the Internet of Vehicles and health monitoring. Thus they must meet stringent Security and Quality of Service (QoS) requirements\, offering cyber-attack protection with fast response and minimal loss of benign data. Therefore\, protecting these systems with effective traffic shaping\, accurate Attack Detection (AD) and Mitigation mechanisms is vital.\n\nWe will first demonstrate online and federated learning techniques that accurately detect attacks. Measurements of packet floods that convey a cyber-attack will be shown to impair the QoS at the Gateways and impede their capability to carry out AD. Using Queueing Theory\, and experimental measurements\, we show that the novel traffic shaping method QDTP ensures that a Gateway can allow AD to operate promptly during an attack. A new Adaptive Attack Mitigation (AAM) system is then introduced to sample the incoming packet stream\, determine whether an attack is ongoing\, and dynamically drop batches of packets at the input to reduce the effects of the attack\, and minimize the AD overhead and the cost of lost benign packets.\nAlice Héliou (Thales)\n"Collaborative Learning attacks and defenses"\n\n\nCollaborative learning allows to work together to train better models without directly exchanging data. Although very powerful\, applying secure\, robust\, and ethical machine learning approaches in a collaborative setting proves to be more complex than expected.\n\nThis talk will present our past\, current\, and future work on attacks and defenses applied to collaborative learning.\nValeria Loscri (Inria)\n"Securing the Future: Understanding Attacks on AI-Driven Network Management"\n\n\nIn the context of network management\, the integration of Artificial Intelligence (AI) and Machine Learning (ML) is gaining momentum\, permitting automation and optimization. However\, integrating AI/ML into network management\, changes the security landscape. From one side\, security can be improved\, by enhancing threat and anomaly detection\, by enabling a more rapid response to threats. Moreover\, vulnerabilities can be predicted and patches can be considered to avoid the exploitation of such vulnerabilities to convey impacting attacks. From another side\, AI/ML-based approaches are prone to different types of attacks\, ranging from adversarial attacks\, data privacy and confidentiality and model drift. These points need to be carefully considered and to mitigate security risks some key aspects related to secure AI/ML training and deployment and adversarial defense mechanism need to be explicitly considered.\n\nIn this talk\, we will review the benefits of AI/ML in network management as well as their dark side when employed in network management.\nWissam Mallouli (Montimage)\n"Advanced Network Fuzzing for Networked System Testing"\n\nIn this lecture\, we will explore the topic of network fuzzing\, a powerful technique for networked system testing\, used to identify both software bugs and security vulnerabilities that may affect the reliability and robustness of networked applications. Network fuzzing allows automatically generating and injecting malformed or unexpected inputs into network communications leading to potential crashes\, unexpected behaviors\, or security breaches.\n\nThis session will provide both theoretical insights and practical demonstrations using the Montimage Network Fuzzer\, an open-source tool designed to enhance automated testing.\nRafael Pinot (Sorbonne University)\n"A Small Tutorial on Byzantine-Robustness - Federated Learning with adversarial nodes"\n\nThe vast amount of data collected every day\, combined with the increasing complexity of machine learning models\, has led to the emergence of distributed learning schemes. In the now classical Federated learning architecture\, the learning procedure consists of multiple data owners (or clients) collaborating to build a global model with the help of a central entity (the server)\, typically using a distributed variant of SGD. Nevertheless\, this algorithm is vulnerable to ” misbehaving ” clients that could (either intentionally or inadvertently) sabotage the learning by sending arbitrarily bad gradients to the server. These clients are commonly referred to as Byzantine and can model very versatile behaviors going from crashing machines in a datacenter to colluding bots attempting to biase the outcome of a poll on the internet.\n\nThe purpose of this talk is to present a small introduction the emerging topic of Byzantine Robustness. Essentially\, the goal is to enhance distributed optimization algorithms\, such as distributed SGD\, in a way that guarantees convergence despite the presence of some Byzantine clients. We will take the time to present the setting and review some recent results as well as open problems in the community.\nKatarzyna Wasielewska (University of Granada)\n"How dataset quality shapes resistance to data poisoning"\n\n\nData poisoning attacks can introduce false data into the training dataset\, causing ML models to make incorrect and misleading decisions. These types of attacks exploit weaknesses in datasets.\n\nIn this talk\, we will try to answer the question of whether dataset quality is the first line of defense against data poisoning in AI systems.\n\nElevator Pitch Session\nSolayman Ayoubi (Sorbonne University)\n"Privacy Benchmarking of IDS with FREIDA"\n \n\nOhri Elif (Sorbonne University)\n"MetaLore: Learning to Orchestrate Communication and Computational Resources for Metaverse Synchronization"\n \n\nShurok Khozam (Telecom SudParis)\n"HEAL: DDoS Mitigation while Preserving QoS: A Deep Reinforcement Learning-Based Approach"\n \n\nMohamed Amine Legheraba (Sorbonne University)\n"HEAL: Resilient and Self-* Hub-based Learning"\n \n\nGuillaume Nibert (Sorbonne University)\n"Improving anonymous secure communications on the Internet"\n \n\nAlexandre Pham (Sorbonne University)\n"Studying Gossip Learning"\n \n\nAlex Pierron (Telecom SudParis)\n"Cybersecurity impact of AI Optimization in B5G networks"\n \n\nMassinissa Tighilt (Sorbonne University)\n"A genetic algorithm approach to flight optimization"\n \n\n\n\n\n\n\n\n\n\n\n ATTACH;FMTTYPE=image/jpeg:https://www.lincs.fr/wp-content/uploads/2025/03/ Rectangular_Joint-LincsSUGrifin.png CATEGORIES:LINCS Workshop,Workshop LOCATION:Sorbonne University - Campus Les Cordeliers\, 15\, rue de l'École-de-médecine\, Paris\, 75006\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=15\, rue de l'École-de-médecine\, Paris\, 75006\, France;X-APPLE-RADIUS=100;X-TITLE=Sorbonne University - Campus Les Cordeliers:geo:0,0 END:VEVENT BEGIN:VEVENT UID:894@lincs.fr DTSTART;TZID=Europe/Paris:20250411T110000 DTEND;TZID=Europe/Paris:20250411T120000 DTSTAMP:20250407T111644Z URL:https://www.lincs.fr/events/optimally-deceiving-a-learning-in-stackelb erg-games/ SUMMARY:Optimally deceiving a learning leader in Stackelberg games DESCRIPTION:Andrea Araldo will present the setting and some interesting proofs contained in the NeurIPS 2020 paper "Optimally deceiving a learning leader in Stackelberg games".\n\nTo ground the discussion in a concrete context\, I will discuss the paper is a demand-side management scenario.\n\nThe regulator (e.g.\, the government - acting as a leader) proposes incentives to  users (followers)\, to convince them to switch to sustainable alternatives (e.g.\, when choosing products or services). The regulator optimizes such incentives with the goal of maximizing social welfare. Users choose alternatives so as to maximize their utility function. The regulator has only partial information about the users' true utility function. Therefore\, users can can manipulate the regulator\, by choosing alternatives according to a "fake" utility function\, different than their true one. By doing so\, users can mislead the regulator and receive more favourable incentives than they would deserve. The paper shows analytically under which conditions users can basically mislead the regulator as much as they want.\n CATEGORIES:Network Theory,Working Group LOCATION:Zoom + Amphi 5 chez Télécom-Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + Amphi 5 chez Télécom-Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:884@lincs.fr DTSTART;TZID=Europe/Paris:20250409T140000 DTEND;TZID=Europe/Paris:20250409T150000 DTSTAMP:20250407T100234Z URL:https://www.lincs.fr/events/data-compression-with-locality-properties/ SUMMARY:Data Compression with Locality Properties DESCRIPTION:Traditional compression schemes typically require decompressing the entire compressed archive to access a single bit. Similarly\, updating a single bit requires re-encoding the entire archive. In this talk\, I will present recent advances in compression with locality\, where the goal is to minimize the number of bits that need to be accessed or modified when decoding or updating a single bit. Sample questions we will address include: What is the minimum number of bits that must be read or changed to decode or update a single bit? How does this minimum change when compression is handled in a distributed fashion (à la Slepian-Wolf)? And is it possible to decode a single bit with perfect privacy? CATEGORIES:Seminars LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:891@lincs.fr DTSTART;TZID=Europe/Paris:20250404T110000 DTEND;TZID=Europe/Paris:20250404T120000 DTSTAMP:20250401T131216Z URL:https://www.lincs.fr/events/optimisation-of-energy-aware-dns-server-al location-by-wang-and-rosetbd-9/ SUMMARY:Optimisation of energy-aware DNS server allocation by Wang & Rose DESCRIPTION:The lecture will focus on the paper written by Zheng Wang and Scott Rose\, which deals with the allocation of DNS servers by taking energy consumption into account while maintaining a satisfying quality of service. The authors have devised an analytical mathematical optimisation model that takes into account network and query processing delays\, and energy costs\, in order to minimise revenue losses without affecting quality of service. We will examine the proposed model and optimisation strategy\, as well as the results they obtained. CATEGORIES:Practical Networks,Working Group LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:858@lincs.fr DTSTART;TZID=Europe/Paris:20250402T140000 DTEND;TZID=Europe/Paris:20250402T150000 DTSTAMP:20250303T141706Z URL:https://www.lincs.fr/events/green-digitalization/ SUMMARY:Green digitalization ? DESCRIPTION:We provide an overview on Information and Communication Technologies comsumption in recent years by conducting different types of analysis. We evoke the rebound effect related to Green IT as well as the enablement effect related to ICT for Green. We also show on some simple examples how LCA (Life Cycle Assesment) can be taken into account in standard performance analysis. CATEGORIES:Seminars LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:882@lincs.fr DTSTART;TZID=Europe/Paris:20250326T140000 DTEND;TZID=Europe/Paris:20250326T150000 DTSTAMP:20250328T091151Z URL:https://www.lincs.fr/events/responsible-digital-developments-in-resear ch-and-educaition-where-to-stard11/ SUMMARY:Responsible digital developments in research and education: where do we start? DESCRIPTION:Several recent initiatives have proposed new directions for research practices and their operations in the computer science community\, from updated codes of conduct that clarify the use of AI-assisted tools to the inclusion of ethical statements and the organisation of working groups on the environmental footprint of digitalisation. In this talk\, we will discuss what framework(s)  are needed to help describe the sense of engagement and responsibilities to which the practitioner of a computing-related area may be confronted\, and guide one to think about the incidence of technical realisations beyond techno-centric contributions. We will share examples from current research projects and teaching practices to illustrate some concrete scenarios.\n CATEGORIES:Seminars,Youtube LOCATION:Amphi 2\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 2:geo:0,0 END:VEVENT BEGIN:VEVENT UID:877@lincs.fr DTSTART;TZID=Europe/Paris:20250321T110000 DTEND;TZID=Europe/Paris:20250321T120000 DTSTAMP:20250327T233459Z URL:https://www.lincs.fr/events/incentive-in-large-scale-demande-side-flex ibility-management-in-a-smart-energy-grids-the-resonance-approach/ SUMMARY:Incentives in large-scale demand-side flexibility management in smart energy grids: the RESONANCE approach DESCRIPTION:The increased contribution of renewable energy sources to energy production has led to increased variability and lower levels of controlability of energy generation. On the hand\, the electrification of transportation and heating systems and their integration to smart energy grids allows for higher levels of demand-side flexibility\, which can play a key role in achieving the desired balance of such grids. To this end\, Horizon Europe project RESONANCE aims to facilitate the management of flexibility at a large scale by developing and testing in pilots its own software architecture.\n\nIn the first part of this talk\, I will overview the technical approach of project RESONANCE\, with emphasis on the use of incentives for provision of flexibility by consumers. In the second part (*)\, I will present a model where a population of consumers has to collectively  achieve a particular total volume of flexibility but the contribution of each consumer to this target is not directly measurable. This case is modeled as the formation of the public good\; the analysis reveals that offering the proper incentives to users can have a considerable positive effect in reaching the flexibility target.\n\n(*) Joint work with Thanasis Papaioannou (Professor at National Kapodistrian University of Athens – Research Associate of STEcon-AUEB group).\n\n \;\n\nBio :\n\nGeorge D. Stamoulis is a Professor in the Department of  Informatics\,  of Athens University of Economics and Business (AUEB)\, and Head of the Services\, Technologies and Economics (STEcon - http://stecon.cs.aueb.gr/) research group. \n\nHe received the Diploma in Electrical Engineering (1987\, with highest honors) from the National Technical University of Athens\, Greece\, and the MS (1988) and PhD (1991) degrees in Electrical Engineering from the Massachusetts Institute of Technology\, Cambridge\, Massachusetts\, USA. His research interests are in economic and business models for networks\, clouds\, smart energy grids and blockchain environments\, demand response and flexibility management in smart energy grids\, telecommunications and power regulation\, auction mechanisms for scarce goods\, and reputation mechanisms for electronic environments. He has coordinated the participation of the STEcon Group of AUEB in several successful FP7\, H2020 and Horizon Europe projects\, including 6 projects in progress in the areas of smart grids\, blockchains and 5G/6G telecoms. He has published over 100 articles in high-quality scientific journals (IEEE Transactions on Control of Networked Systems\, IEEE/ACM Transactions on Networks\, IEEE Transactions on Communications\, Computer Networks\, Journal of the ACM etc.) and in top scientific conferences (such as INFOCOM\, ITC\, ACM SIGMETRICS\, CCGRID\, e- Energy\, SmartGridComm.) He has also collaborated with Greek Regulatory Authorities for Telecoms and Power on auction design and other regulatory issues and with Greek telecom companies on service pricing\, data analysis etc. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:881@lincs.fr DTSTART;TZID=Europe/Paris:20250319T140000 DTEND;TZID=Europe/Paris:20250319T150000 DTSTAMP:20250327T230224Z URL:https://www.lincs.fr/events/cybersecurity-and-resilience-of-complex-sy stems/ SUMMARY:Cybersecurity and Cyber Resilience of Complex Systems DESCRIPTION:Thanks to technological advancements\, critical infrastructures integrate many smart technologies and become highly connected to the cyber world. This is especially true for Cyber-Physical Systems (CPSs)\, which combine hardware and software components. Despite the advantages of smart infrastructures\, they remain vulnerable to cyber threats and adversarial events such as cyber-attacks. This talk focuses on quantifying the cyber resilience of complex systems modeled with a multi-layering approach. As a use case\, we consider the Secure Water Treatment System (SWaT) testbed.\n\n \; CATEGORIES:Seminars,Youtube LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:883@lincs.fr DTSTART;TZID=Europe/Paris:20250314T110000 DTEND;TZID=Europe/Paris:20250314T120000 DTSTAMP:20250327T222811Z URL:https://www.lincs.fr/events/deployment-of-an-end-to-end-4g-5g-testbed- based-on-a-single-computer/ SUMMARY:Deployment of an end to end 4G/5G testbed based on a single computer DESCRIPTION:This presentation will present the deployment and installation procedure of a 4G/5G testbded on single computer.\n\nThis testbed is based on SRSRAN open source 4G/5G software and relies on ZMQ socket interface for communication between different network nodes. The major network interfaces are provided\, including the air the interface. A software UE\, potentially connected to a smart card reader\, with a programmable SIM card\, can also be used to investigate security procedures between UE and SIM card.\n\nThis platform makes it possible to investigate radio and core network procedures.\n\nBy using Gnuradio software\, and connecting it to the simulator through ZMQ socket interface\, it is possible to do a wide range of processing on information exchanges on the air interface (simulation of a channel\, simulation of jamming\, ...) CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:885@lincs.fr DTSTART;TZID=Europe/Paris:20250307T110000 DTEND;TZID=Europe/Paris:20250307T120000 DTSTAMP:20250327T215337Z URL:https://www.lincs.fr/events/python-tricks-for-discrete-event-simulatio n/ SUMMARY:Python tricks for discrete-event simulation DESCRIPTION:In this presentation\, I will introduce discrete-event simulation\, provide a minimal Python implementation\, and then showcase how we can use certain Python features (decorators\, generator functions\, etc.) to improve upon this implementation.\n\nDiscrete-event-simulation.pdf CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:879@lincs.fr DTSTART;TZID=Europe/Paris:20250305T140000 DTEND;TZID=Europe/Paris:20250305T150000 DTSTAMP:20250327T205626Z URL:https://www.lincs.fr/events/orchestration-of-ai-based-applications-in- heterogeneous-and-distributed-computing-systems/ SUMMARY:Orchestration of AI-based Applications in Heterogeneous and Distributed Computing Systems DESCRIPTION:Today\, distributed systems are increasingly needed to support distributed applications that involve machine learning (ML) operations for both service providers and end users. These operations include training ML models across distributed infrastructures and deploying them over the network for inference. While the training of these models\, whether centralized or decentralized\, has been extensively studied\, the orchestration of inference models across the network remains largely unexamined. To ensure high-quality applications run effectively over these infrastructures\, orchestration presents several challenges\, including i) the interaction of models with other software components distributed across the network\; ii) deploying such components on heterogeneous and computationally limited resources\; and iii) adapting orchestration strategies to continuous changes in the data fed into these models. This seminar aims at exploring and discussing these methodological and technological challenges in the design of algorithmic solution for orchestrating AI-based applications within distributed computing systems.\n\nShort Bio. Francescomaria Faticanti is a postdoctoral researcher at ENS de Lyon\, France. From January 2022 to August 2023 he was a postdcotoral researcher at Inria Sophia Antipolis\, France. He received the PhD in Information and Communication Technology from University of Trento and Fondazione Bruno Kessler (FBK)\, Italy\, in November 2021. He serves as reviewer\, and member of the TPC\, for several international conferences and journals in the field of Networking and Distributed Systems. His research interests include algorithms for resource allocation in distributed systems\, distributed ML and combinatorial optimization. CATEGORIES:Seminars,Youtube LOCATION:Amphi 2\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 2:geo:0,0 END:VEVENT BEGIN:VEVENT UID:880@lincs.fr DTSTART;TZID=Europe/Paris:20250228T110000 DTEND;TZID=Europe/Paris:20250228T120000 DTSTAMP:20250324T151404Z URL:https://www.lincs.fr/events/communication-complexity-of-common-voting- rules/ SUMMARY:Communication Complexity of Common Voting Rules DESCRIPTION:In this presentation\, I will discuss the paper Communication Complexity of Common Voting Rules [1]\, which examines how many bits must be exchanged to elicit voters’ preferences and determine the outcome of an election\, depending on the voting rule used. I begin by presenting the concept of deterministic and non-deterministic communication complexity\, followed by an introduction of the main voting rules analyzed in the paper. I then explain the paper’s main results\, which primarily establish lower and upper bounds on the communication complexity of several well-known voting rules\, such as plurality\, Borda count\, and the Condorcet rule. This talk aims to provide a deeper understanding of the communication requirements of different voting systems.\n\n\n\nReferences\n[1] Vincent Conitzer and Tuomas Sandholm. Communication complexity of common voting rules. In Proceedings of the 6th ACM conference on Electronic commerce\, pages 78–87\, 2005.\n\n \;\n\nhttps://www.irif.fr/~mdr/cours2-2019.pdf CATEGORIES:Network Theory,Working Group LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:871@lincs.fr DTSTART;TZID=Europe/Paris:20250221T110000 DTEND;TZID=Europe/Paris:20250221T120000 DTSTAMP:20250228T150133Z URL:https://www.lincs.fr/events/fjord-fair-and-accurate-federated-learning -under-heterogeneous-targets-with-ordered-dropout/ SUMMARY:FjORD: Fair and Accurate Federated Learning under heterogeneous targets with Ordered Dropout DESCRIPTION:Federated Learning (FL) has been gaining significant traction across different ML tasks\, ranging from vision to keyboard predictions. In large-scale deployments\, client heterogeneity is a fact and constitutes a primary problem for fairness\, training performance and accuracy. Although significant efforts have been made into tackling statistical data heterogeneity\, the diversity in the processing capabilities and network bandwidth of clients\, termed as system heterogeneity\, has remained largely unexplored. Current solutions either disregard a large portion of available devices or set a uniform limit on the model's capacity\, restricted by the least capable participants. This work introduces Ordered Dropout\, a mechanism that achieves an ordered\, nested representation of knowledge in deep neural networks (DNNs) and enables the extraction of lower footprint submodels without the need of retraining. It further shows that for linear maps\, Ordered Dropout is equivalent to SVD. This technique\, along with a self-distillation methodology\, is applied in the realm of FL in a framework called FjORD. FjORD alleviates the problem of client system heterogeneity by tailoring the model width to the client's capabilities. Extensive evaluation on both CNNs and RNNs across diverse modalities shows that FjORD consistently leads to significant performance gains over state-of-the-art baselines\, while maintaining its nested structure. In this seminar\, we discuss this paper and we highlight some of its features and how it relates to my current work. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:878@lincs.fr DTSTART;TZID=Europe/Paris:20250219T140000 DTEND;TZID=Europe/Paris:20250219T150000 DTSTAMP:20250220T175130Z URL:https://www.lincs.fr/events/ai-for-the-detection-and-mitigation-of-cyb erattacks/ SUMMARY:AI for the Detection and Mitigation of Cyberattacks DESCRIPTION:Gateway Servers for the Internet of Things\, including critical application areas such as the Internet of Vehicles and health monitoring\, must meet stringent  Security and Quality of Service (QoS) requirements\, offering cyberattack protection with fast response and minimal loss of benign data. Therefore\, it is vital to protect these systems with adequate Attack Detection (AD) and Mitigation mechanisms.\n\nWe will first demonstrate online as well as federated learning techniques that accurately detect attacks. Measurements of packet floods that convey a cyberattack will also be shown to impair the QoS at the Gateways and impede their capability to carry out AD. Novel traffic shaping methods to ensure that a Gateway can allow AD to operate promptly during an attack will be discussed. A new Adaptive Attack Mitigation (AAM) system will be introduced to sample the incoming packet stream\, determine whether the attack is ongoing\, dynamically drop batches of packets at the input to reduce the effects of the attack and minimize the AD overhead and the cost of lost benign packets.\n\nSpeaker’s Bio: Erol Gelenbe MAE’05 FIEEE’86 FACM’02 FIFIP’19 FRSA’24 FRSS’20 FIET’03 graduated from METU (Ankara)\, received his PhD from the Tandon School of Engineering\, New York University and the State Doctorate in Mathematical Sciences from the Sorbonne (Paris). An expert on System Performance Evaluation as well as Machine Learning\, he invented the Random Neural Network and the eponymous G-Networks\, developed methods such as diffusion approximations\, and derived some of the first analytical results regarding the performance of communication protocols. Currently a Professor at the Institute of Theoretical and Applied Informatics\, Polish Academy of Sciences\, he graduated over 90 PhDs during his professorships in Belgium\, France\, the USA\, the UK and Poland. For his services to research and higher education\, he received the honours of Chevalier de la Légion d’Honneur\, Commander of Merit of France and Italy\, Commander of the Order of the Crown of Belgium\, and Officer of the Order of Merit of Poland\, and was elected Fellow of the National Academy of Technologies of France\, of the Science Academies of Belgium\, Poland and Turkey\, Honorary Fellow of the Hungarian Academy of Sciences (Budapest) and of the Islamic Academy of Sciences (Amman). He chairs the Informatics Section of Academia Europaea and won the ACM SIGMETRICS’08 Life-Time Award for his work on system performance modelling and analysis\, the Mustafa Award’17 for his invention of G-Networks\, the Grand Prix France-Télécom’96 (French Academy of Sciences) for his research on stochastic networks\, the IET Innovation Award (Oliver Lodge Medal’10) and other prizes. CATEGORIES:Seminars,Youtube LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:876@lincs.fr DTSTART;TZID=Europe/Paris:20250214T110000 DTEND;TZID=Europe/Paris:20250214T120000 DTSTAMP:20250228T141803Z URL:https://www.lincs.fr/events/master-python-efficiency-with-itertools-an d-joblib/ SUMMARY:Master Python Efficiency with itertools and joblib DESCRIPTION:This Python programming tutorial is designed for intermediate learners who want to optimize their code for performance\, scalability\, and elegance using two powerful libraries: itertools (for efficient iteration) and joblib (for parallel computing and caching). Whether you’re working with large datasets\, complex simulations\, or machine learning workflows\, this tutorial will equip you with tools to write faster\, cleaner\, and more memory-efficient code. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:862@lincs.fr DTSTART;TZID=Europe/Paris:20250212T140000 DTEND;TZID=Europe/Paris:20250212T150000 DTSTAMP:20250220T174115Z URL:https://www.lincs.fr/events/how-can-alpha-information-theory-formally- prove-that-your-sensitive-circuits-are-protected-against-side-channel-atta cks/ SUMMARY:How can alpha-information theory formally prove that your sensitive circuits are protected against side-channel attacks? DESCRIPTION:Cryptographic algorithms are ubiquitous in our digital society. Principles (such as Kerckhoffs’) and mathematical techniques for securing data against cryptanalysis are well established\, even with future quantum computers: the best attacks of this type are essentially brute force\, which takes several times the age of the universe.\n\nHowever\, one real threat is that algorithm implementations are vulnerable to side-channel attacks\, that exploit sensitive information leaks to recover the secret in a “divide and conquer” approach. Some attacks only require a few queries (leakage measurements). Thus\, the question is not whether you are secure or not\, since it is only a matter of time. The question is how much you can be secure\, e.g. with a protected implementation that use data masking. For that\, we need a formal evaluation.\n\nIn this talk\, I present such a formal evaluation using alpha-information theory\, based on Rényi alpha-divergence and alpha-entropy\, and Sibson’s alpha-information. The parameter alpha can be positive or negative\, and the limiting case alpha = minus infinity is related to the important notion of Doeblin coefficient\, which can be used to reduce the noisy leakage model to a random probing model. Fano and data processing inequalities\, as well as Mrs. Gerber’s lemma in the case of additive masking\, are used to establish lower bounds on the number of queries that any attacker has to make to achieve a given level of success. In this way\, it is possible to be proactive\, for example with ephemeral keys\, to maintain the security of an implementation.\n\n\n\n\n\n\nBio: Olivier Rioul (https://perso.telecom-paristech.fr/rioul/) is full Professor at the Department of Communication and Electronics at Télécom Paris\, Institut Polytechnique de Paris\, France. He graduated from École Polytechnique and from École Nationale Supérieure des Télécommunications\, Paris\, France\, where he obtained his PhD degree. His research interests are in applied mathematics and include various\, sometimes unconventional\, applications of information theory such as inequalities in statistics\, hardware security\, and experimental psychology. He has been teaching information theory and statistics at various universities for twenty years and has published a textbook which has become a classical French reference in the field. CATEGORIES:Seminars,Youtube LOCATION:Amphi 3\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 3:geo:0,0 END:VEVENT BEGIN:VEVENT UID:873@lincs.fr DTSTART;TZID=Europe/Paris:20250207T110000 DTEND;TZID=Europe/Paris:20250207T120000 DTSTAMP:20250214T142223Z URL:https://www.lincs.fr/events/particle-filter-based-statistical-inferenc e-for-positioning-and-tracking-applications/ SUMMARY:Particle filter based statistical inference for positioning and tracking applications DESCRIPTION:The lecture will provide a comprehensive summary of statistical inference using particle filters for positioning and tracking applications. The lecture will cover the motivation behind developing such frameworks\, the underlying motion and measurement models\, assumptions\, and the Bayesian approach towards solving such an estimation problem. The talk will also highlight the importance of linearity\, Gaussian\, and Markovian assumptions\, enabling a tractable solution framework also popularly termed as Kalman filter (KF). Insights will be provided into discrete time and continuous time KFs\, including the steady state stability conditions. Further\, to deal with non-linear systems\, the talk with discuss the linearization based extended Kalman filter.\n\nReference: Niclas Bergman\, "Recursive Bayesian Estimation Navigation and Tracking Applications"\, Department of Electrical Engineering Linkoping University\, Sweden CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Amphi 2\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 2:geo:0,0 END:VEVENT BEGIN:VEVENT UID:875@lincs.fr DTSTART;TZID=Europe/Paris:20250207T100000 DTEND;TZID=Europe/Paris:20250207T104500 DTSTAMP:20250220T164020Z URL:https://www.lincs.fr/events/the-restart-project-focus-on-network-progr ammability-and-orchestration-2/ SUMMARY:The RESTART Project: focus on Network Programmability and Orchestration DESCRIPTION:In the last decade\, software has been playing an increasingly relevant role in communication networks\, bringing advanced programmability features to network infrastructure management\, and enabling the adoption of solutions and technologies typical of the cloud computing paradigm. All this led to what is nowadays called “Network Softwarization.” In the seminar we will showcase the evolution of modern network infrastructures toward Network Softwarization\, discussing the main concepts and technologies that enabled the emerging network programmability and orchestration paradigms. Then\, we will explore the data models employed by common orchestration platforms (e.g.\, OpenSource MANO and Kubernetes) and show how services and applications can be defined. In the same context\, we will survey some monitoring tools and techniques to export the current relevant metrics from the system to the orchestration platform of choice. Finally\, we will show how these paradigms are already integrated into the current generation of mobile networks.\n\nBio: Walter Cerroni (Senior Member\, IEEE) is an Associate Professor of communication networks with the University of Bologna\, Italy. He coauthored more than 150 articles published in the most renowned international journals\, magazines\, and conference proceedings. His recent research interests focused on multiple aspects of control\, management and orchestration of communication network infrastructures\, including software-defined networking\, network function virtualization\, multi-access edge computing\, fog computing\, service function chaining\, intent-based networking systems. He serves/served as Series Editor for the IEEE Communications Magazine\, Associate Editor for the IEEE Communications Letters\, and General / Technical Program Co-Chair for IEEE-sponsored international workshops and conferences. He is also serving as Steering Committee Chair of the IEEE NetSoft conference and as Chair of the Transmission\, Access\, and Optical Systems (TAOS) Technical Committee of the IEEE Communications Society.\n CATEGORIES:Seminars,Youtube LOCATION:Amphi 2\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 2:geo:0,0 END:VEVENT BEGIN:VEVENT UID:870@lincs.fr DTSTART;TZID=Europe/Paris:20250205T013000 DTEND;TZID=Europe/Paris:20250205T030000 DTSTAMP:20250220T163747Z URL:https://www.lincs.fr/events/a-functioning-5g-core-network-deployed-on- top-of-a-standard-kubernetes-cluster/ SUMMARY:A functioning 5G core network deployed on top of a standard Kubernetes cluster DESCRIPTION:In this seminar\, we will show how to deploy a functioning 5G core network on top of a standard Kubernetes cluster. This talk will start by presenting how Kubernetes applications could be shipped with Helm\, explaining the concepts of Helm templates and Helm charts. After that\, a Helm chart of an open-source distribution of a 5G core network will be employed to show how we can customize the setup with our desired 5G network functions configuration.\nBio: Davide Borsatti (Member\, IEEE) received his B.S.\, M.S.\, and Ph.D. in Electronics\, Telecommunications\, and Information Technologies Engineering from the University of Bologna\, Italy\, in 2016\, 2018 and 2022\, respectively. He is currently an Assistant Professor in the Department of Electrical\, Electronic\, and Information Engineering "Guglielmo Marconi" at the University of Bologna. His research interests include NFV\, SDN\, intent-based networking\, MEC\, and 5G network slicing. CATEGORIES:Seminars,Youtube LOCATION:Amphi 7\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 7:geo:0,0 END:VEVENT BEGIN:VEVENT UID:872@lincs.fr DTSTART;TZID=Europe/Paris:20250131T110000 DTEND;TZID=Europe/Paris:20250131T120000 DTSTAMP:20250219T090631Z URL:https://www.lincs.fr/events/enhancing-network-efficiency-with-ebpf-xdp -technology/ SUMMARY:Enhancing Network Efficiency with eBPF/XDP Technology DESCRIPTION:eBPF (Extended Berkeley Packet Filter) and XDP (eXpress Data Path) have revolutionized the way we interact with the Linux kernel\, enabling developers to run custom\, high-performance programs directly in the kernel space without requiring kernel modifications. These technologies have opened up new possibilities in observability\, security\, and network optimization\, particularly in environments where low latency and high throughput are critical. In this talk\, we will explore how eBPF and XDP provide powerful tools to address the challenges of modern networking. I will demonstrate three practical examples: tracking kernel function execution time\, optimizing socket communication within the host\, and implementing high-performance packet filtering at the XDP layer. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:864@lincs.fr DTSTART;TZID=Europe/Paris:20250122T140000 DTEND;TZID=Europe/Paris:20250122T150000 DTSTAMP:20250206T104016Z URL:https://www.lincs.fr/events/quantum-advantage-in-distributed-computing / SUMMARY:Quantum advantage in distributed computing DESCRIPTION:In recent years many advances have been made in the field of quantum networks and even bigger improvements are expected in the foreseeable future: tasks are no longer processed by a central administrator\, but rather tackled in distributed networks with many interconnected processing units. To achieve that goal\, a lot more care will have to be employed to analyse and overcome the technical difficulties that accompany such advances\, in particular latency issues. As such\, reducing the communication with each other that independent processing units require is crucial to the viability of any protocol that we hope to implement. In this talk\, we will present and discuss our recent paper [arXiv:2411.03240v1]\, where we show that considering quantum strategies to distributed problems can greatly improve the communication cost of a task.\n\n\n\n\nBio: Isadora is a postdoc at PHIQuS\, located at Inria Paris-Saclay\, under the supervision of Marc-Olivier Renou. She did her PhD in CBPF - Brazil on quantum information theory. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:869@lincs.fr DTSTART;TZID=Europe/Paris:20250117T140000 DTEND;TZID=Europe/Paris:20250117T170000 DTSTAMP:20250121T124908Z URL:https://www.lincs.fr/events/exploiting-partial-system-knowledge-in-rei nforcement-learning-for-admission-control-and-electricity-storage-optimiza tion/ SUMMARY:Exploiting Partial System Knowledge in Reinforcement Learning for Admission Control and Electricity Storage Optimization DESCRIPTION:This thesis exploits partial system knowledge to design more efficient reinforcement learning (RL) algorithms for three problems: admission control (1)\, electricity storage optimization (2)\, and the acceleration of bias function computation (3).\n\nFor (1)\, the system is modeled as an M/M/c/S queue with m job classes. We propose a model-based algorithm\, named UCRL-AC\, with a finite-time regret bound dominated by O(S\\log T + \\sqrt{mT \\log T})\, where T is the total running time. UCRL-AC exploits the queuing structure by learning the arrival rates.\n\nFor (2)\, we design an RL algorithm that minimizes energy and demand charges by controlling a battery. The knowledge of the battery dynamics allows an efficient offline exploration\, which enables fast training with minimal data. The algorithm is tested on real-world data.\n\nFor (3)\, we show that for a fixed policy\, the bias function computation can be accelerated through the knowledge of eigenvalues of the transition probability matrix.\n\n\nComposition du jury:\n\n Urtzi Ayesta\, IRIT (rapporteur)\n Giovanni Neglia\, Centre Inria d'Université Côte d'Azur (rapporteur)\n Johanne Cohen\, LISN - Université Paris-Saclay (examinatrice)\n Bruno Gaujal\, Inria Grenoble (examinateur)\n Alain Jean-Marie\, Inria Montpellier (examinateur)\n Lorenzo Maggi\, NVIDIA (examinateur)\n Ana Buši?\, Inria Paris (directrice de thèse)\n Jiamin Zhu\, IFP Energies Nouvelles (co-encadrante de thèse)\n Tristan Charrier\, AMIAD (membre invité\, superviseur DGA)\n CATEGORIES:PhD Defense LOCATION:Inria Paris\, 48 rue Barrault\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=48 rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Inria Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:865@lincs.fr DTSTART;TZID=Europe/Paris:20250117T110000 DTEND;TZID=Europe/Paris:20250117T120000 DTSTAMP:20250125T182414Z URL:https://www.lincs.fr/events/sharp-phase-transitions-in-discrete-and-co ntinuum-percolation/ SUMMARY:Sharp phase transition in discrete and continuum percolation. DESCRIPTION:This talk consists of simple example of percolation models: Bernoulli bond and site percolation on lattice and Poisson Boolean model on Euclidean space. In these models we say that percolation happens\, if there exists a critical value of the parameter such that\, the system has infinite component above the critical value of the parameter and all the components are finite if it is below the critical value. In this talk we shall explore the concept of sharp phase transition in the above percolation models using the seminal works by Hugo Duminil-Copin and co-authors. The term ``sharp phase transition" is about how the probability of having a path from origin to a distance $n$\, decays in $n$\, in the sub-critical regime. It also captures how the percolation probability behaves in the supercritical regime. Later in this talk I will present some example of higher dimensional percolation models on the lattice on Z^d\, namely the hypercube percolation and hole percolation model. The first model can be thought of as a generalization of the usual bond/site percolation model. Hiraoka and Mikami was the first to define the hole graph model. We will try to see how we can use the ``OSSS method" developed by Hugo Duminil-Copin and co-authors\, to prove sharp phase transition. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:868@lincs.fr DTSTART;TZID=Europe/Paris:20250110T110000 DTEND;TZID=Europe/Paris:20250110T120000 DTSTAMP:20250106T153611Z URL:https://www.lincs.fr/events/some-network-emulation-tools/ SUMMARY:Some network emulation tools DESCRIPTION:In this talk\, we will explore various practical methods to obtain a functional network for running applications based on TCP/UDP/IP. We will delve into the SNEAC/NetMirage emulators [2\,3] and Mininet [1]\, particularly in conjunction with a SDN controller\, exclusively used to manage packet routing. Additionally\, we will examine the Internet Topology Zoo project [5]\, which features national research network topologies encoded in GraphML format\, importable into Mininet with the help of the Assessing Mininet project [4]. We will also provide a brief overview of other approaches\, including network simulation and large-scale testbeds.\n\nReferences:\n\n\n[1]\nB. Lantz\, B. Heller\, and N. McKeown\, A network in a laptop: rapid prototyping for software-defined networks\, in Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks\, in Hotnets-IX. New York\, NY\, USA: Association for Computing Machinery\, Oct. 2010\, pp. 1–6. doi: 10.1145/1868447.1868466. Accessed: Jan. 6\, 2025. [Project Website]. Available: https://mininet.org/\n\n\n\n\n[2]\nCrySP Team\, NetMirage | Cryptography\, Security\, and Privacy (CrySP) | University of Waterloo. (Jan. 09\, 2019). C. University of Waterloo. Accessed: Jan. 06\, 2025. [Linux]. Available: https://crysp.uwaterloo.ca/software/netmirage/\n\n\n\n\n[3]\nS. Singh\, Large-Scale Emulation of Anonymous Communication Networks\, Master Thesis\, University of Waterloo\, Waterloo\, Ontario\, Canada\, 2014. Accessed: Oct. 24\, 2024. [Online]. Available: http://hdl.handle.net/10012/8642\n\n\n\n\n[4]\nM. Großmann and S. J. A. Schuberth\, Auto-Mininet?: Assessing the Internet Topology Zoo in a Software-Defined Network Emulator\, 2014. Accessed: Nov. 20\, 2024. [Online]. Available: https://www.semanticscholar.org/paper/Auto-Mininet-%3A-Assessin g-the-Internet-Topology-Zoo-Gro%C3%9Fmann-Schuberth/9520a901f0d452cc29f6042 6ce0b26bda15eb12d. Accessed: Jan. 6\, 2024. [GitHub]: https://github.com/sjas/assessing-mininet\n\n\n\n\n[5]\nS. Knight\, H. X. Nguyen\, N. Falkner\, R. Bowden\, and M. Roughan\, The Internet Topology Zoo\, IEEE Journal on Selected Areas in Communications\, vol. 29\, no. 9\, pp. 1765–1775\, Oct. 2011\, doi: 10.1109/JSAC.2011.111002. Accessed: Jan. 6\, 2025. [Online]. Available: https://topology-zoo.org/\n\n CATEGORIES:Practical Networks,Working Group LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:857@lincs.fr DTSTART;TZID=Europe/Paris:20250108T140000 DTEND;TZID=Europe/Paris:20250108T150000 DTSTAMP:20241128T150357Z URL:https://www.lincs.fr/events/preventing-webrtc-ip-address-leaks/ SUMMARY:Preventing WebRTC IP Address Leaks DESCRIPTION:The WebRTC API enables real-time communication of text\, video\, and audio media streams through a web browser without requiring third-party extensions. However\, it was not designed with privacy in mind. We conduct an experiment to analyse privacy leaks associated with WebRTC. Our findings show that despite recent updates to the WebRTC specification and its implementations\, sensitive public IP addresses can still be leaked during audio/video communication\, particularly in large non-NAT corporate networks\, even when using a VPN\, SOCKS or HTTP/S proxy. To address the observed leaks\, we develop a simple\, easily maintainable\, cross-platform open-source solution that confines the Mozilla Firefox web browser in a docker container. We also take into account the possibility of a malicious adversary compromising the browser.\nOur tests have shown that our containerised solution is effective in all situations without restricting applications. CATEGORIES:Seminars LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:866@lincs.fr DTSTART;TZID=Europe/Paris:20241220T110000 DTEND;TZID=Europe/Paris:20241220T120000 DTSTAMP:20250125T170555Z URL:https://www.lincs.fr/events/git-happens-from-first-commit-sadness-to-c i-cd-greatness/ SUMMARY:Git happens: from first commit sadness\, to CI/CD greatness DESCRIPTION:Git is a developer’s best friend… until it isn’t. Whether it’s an accidental git push --force\, a mysterious merge conflict or the feared “detached HEAD” state that reflects more a state of mind than a Git feature\, we’ve all been there. In this talk\, we’ll embrace those edge cases\, laugh at our past mistakes\, and learn how to handle Git like a pro.\n\nBut Git is not just about fixing mistakes: it’s also the backbone of modern development workflows. We’ll dive into how effectively use Continuous Integration/Continuous Deployment (CI/CD) pipelines and Webhooks\, turning our repositories into automated collaboration companions.  From triggering tests and deployments to notifying Slack when someone finally fixes the typo in the documentation\, we’ll explore how Git can make your development life easier. By the end of this tutorial\, you will know how to recover gracefully from errors\, optimize your workflows\, and master the powerful tool that is Git. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:867@lincs.fr DTSTART;TZID=Europe/Paris:20241218T020000 DTEND;TZID=Europe/Paris:20241218T050000 DTSTAMP:20241217T124147Z URL:https://www.lincs.fr/events/a-stochastic-geometry-framework-for-ris-as sisted-cellular-networks/ SUMMARY:A Stochastic Geometry Framework for RIS-Assisted Cellular Networks DESCRIPTION:This thesis is jointly supervised by Prof. François Baccelli\, Dr. Luis Uzeda Garcia\, and Dr. Stefano Paris.\n\n\n\n\nThis thesis investigates the impact of deploying reconfigurable intelligent surfaces (RIS)\, which can engineer spatial diversity in complex cellular networks\, at a system level. We develop a framework to characterize the performance of RIS-assisted cellular networks\, focusing on downlink coverage probability and ergodic rate\, where we consider that multiple RISs can serve one UE simultaneously. To account for the inherent randomness in the spatial deployments of base stations (BSs) and RISs\, we model the placements of the RISs as point processes (PPs) conditioned on the associated BSs\, which are modeled by a Poisson point process (PPP). These RIS PPs can be adapted based on the deployment strategy. We focus on modeling the RISs as a Matérn cluster process (MCP)\, where each RIS cluster is a finite PPP with support of a disc centered on the association BS. We assume that the system uses the orthogonal frequency division multiplexing (OFDM) technique to exploit the multipath diversity provided by RISs. The coverage probability and the ergodic rate can be evaluated when RISs operate as batched powerless beamformers. The resulting analytical expressions provide a general methodology to evaluate the impact of key RIS-related parameters\, such as the density of RISs\, on system-level performance. To demonstrate the framework’s broad applicability\, we also analyze a RIS placement variant where RISs are deployed around coverage holes. Furthermore\, the proposed framework enables techno-economic analysis of RIS-assisted networks. We introduce a relative cost model considering the total cost of ownership (TCO) of deploying both BSs and RISs\, along with a return on investment (ROI) model that is proportional to spectral efficiency. This approach gives operators quantitative insights to develop investment strategies regarding whether to invest in RISs based on current BS and RIS densities. To assess performance and conduct techno-economic analysis\, the analytical expressions involving multiple integrals are computationally complex. We address this challenge by developing a novel numerical solver based on the Genz-Malik rule and parallel computing\, allowing efficient evaluation within acceptable time consumption and improving the practical applicability of the proposed framework. Based on this solver\, numerical evaluations of the analytical expressions and Monte-Carlosimulations jointly validate the proposed analytical approach and provide valuable insights into the design of future RIS-assisted cellular networks.\n CATEGORIES:PhD Defense LOCATION:Inria Paris\, 48 rue Barrault\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=48 rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Inria Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:863@lincs.fr DTSTART;TZID=Europe/Paris:20241211T140000 DTEND;TZID=Europe/Paris:20241211T150000 DTSTAMP:20241216T153607Z URL:https://www.lincs.fr/events/line-cox-processes-part-ii-large-scale-aut omotive-radar-networks-and-statistics-of-successive-successful-detection/ SUMMARY:Line Cox Processes Part II: Large Scale Automotive Radar Networks and Statistics of Successive Successful Detection DESCRIPTION:Note: Part I of this talk was presented at LINCS in 2023 (www.lincs.fr/events/seminar-talk-by-gourab-ghatak/).\n\n\n\nIn this talk\, first\, we revisit the newly introduced model -the binomial line Cox processes (BLCP) and discuss its validity from the perspective of real world street data. Then\, we employ the BLCP and the Poisson line Cox process (PLCP) to emulate a large scale automotive radar network. We will briefly discuss the classical stochastic geometry metrics of detection probability and the meta-distribution.\n\nThen\, we introduce a novel metric for stochastic geometry based analysis of automotive radar networks called target tracking probability. Unlike the well-investigated detection probability (often termed as the success or coverage probability in stochastic geometry)\, the tracking probability characterizes the event of successive successful target detection with a sequence of radar pulses. From a theoretical standpoint\, this work adds to the rich repertoire of statistical metrics in stochastic geometry. To optimize the target tracking probability in high interference scenarios\, we study a block medium access control (MAC) protocol for the automotive radars and recommend the optimal MAC parameter for a given vehicle and street density. Importantly\, we show that the optimal MAC parameter that maximizes the detection probability may not be the one that maximizes the tracking probability. Our research reveals how the tracking event can be naturally mapped to the quality of service (QoS) requirements of latency and reliability for different vehicular technology use-cases. This can enable use-case specific adaptive selection of radar parameters for optimal target tracking. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:860@lincs.fr DTSTART;TZID=Europe/Paris:20241206T110000 DTEND;TZID=Europe/Paris:20241206T120000 DTSTAMP:20241216T152845Z URL:https://www.lincs.fr/events/heroes-lightweight-federated-learning-with -neural-composition-and-adaptive-local-update-in-heterogeneous-edge-networ ks/ SUMMARY:Heroes: Lightweight Federated Learning with Neural Composition and Adaptive Local Update in Heterogeneous Edge Networks DESCRIPTION:Federated Learning (FL) enables distributed clients to collaboratively train models without exposing their private data. However\, it is difficult to implement efficient FL due to limited resources. Most existing works compress the transmitted gradients or prune the global model to reduce the resource cost\, but leave the compressed or pruned parameters under-optimized\, which degrades the training performance. To address this issue\, the neural composition technique constructs size-adjustable models by composing low-rank tensors\, allowing every parameter in the global model to learn the knowledge from all clients. Nevertheless\, some tensors can only be optimized by a small fraction of clients\, thus the global model may get insufficient training\, leading to a long completion time\, especially in heterogeneous edge scenarios. To this end\, we enhance the neural composition technique\, enabling all parameters to be fully trained. Further\, we propose a lightweight FL framework\, called Heroes\, with enhanced neural composition and adaptive local update. A greedy-based algorithm is designed to adaptively assign the proper tensors and local update frequencies for participating clients according to their heterogeneous capabilities and resource budgets. Extensive experiments demonstrate that Heroes can reduce traffic consumption by about 72.05% and provide up to 2.97× speedup compared to the baselines.\n\n\nAuthors: Jiaming Yan\; Jianchun Liu\; Shilong Wang\; Hongli Xu\; Haifeng Liu\; Jianhua Zhou\n\n\nPublished in: IEEE INFOCOM 2024 - IEEE Conference on Computer Communications CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:856@lincs.fr DTSTART;TZID=Europe/Paris:20241204T140000 DTEND;TZID=Europe/Paris:20241204T150000 DTSTAMP:20241216T134852Z URL:https://www.lincs.fr/events/handover-frequency-in-dynamic-terrestrial- network/ SUMMARY:Handover frequency in dynamic terrestrial network DESCRIPTION:In this work we shall consider a dynamic wireless communication model on real line or plane. Let us assume that a user located at origin\, which is served by mobile base stations. The initial locations of the base stations are given by a homogeneous Poisson point process. The base stations are given identical speed in uniformly chosen random direction. The user stays connected to the nearest base station at given point of time. Since the base stations are moving\, the user disconnects and connects with different base stations over time\, which ever base station is the closest. This gives rise to a handover phenomenon in the system and a point process on the time axis\, called as the ''handover point process''. We shall determine the handover frequency in single-speed and multi-speed scenarios. It is also interesting to investigate the case when user has finite visibility. If time permits\, we shall touch upon the case when the initial locations of the base stations are given by a Cox point process and their motion is along the underlying random environment.\n\nThis is an ongoing work with Prof. François Baccelli.\n CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:855@lincs.fr DTSTART;TZID=Europe/Paris:20241129T110000 DTEND;TZID=Europe/Paris:20241129T120000 DTSTAMP:20241216T130548Z URL:https://www.lincs.fr/events/the-functools-python-module/ SUMMARY:The functools python module DESCRIPTION:First\, we recall several concepts (lambda functions\, callbacks\, callables\, functors\, decorators) needed for the rest of the presentation.\nSecond\, we present the "functools" module\, which provides higher-order utilities dedicated to use callables (including caching\, ordering\, dispatching\, wrapping).\nThird\,  we give a quick overview of the "operator" module\, which is commonly used to transform python operators to callables or to define elegant callbacks. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:853@lincs.fr DTSTART;TZID=Europe/Paris:20241127T140000 DTEND;TZID=Europe/Paris:20241127T150000 DTSTAMP:20241216T110949Z URL:https://www.lincs.fr/events/knowledge-graph-llms/ SUMMARY:Knowledge Graphs Construction using Small Language Models DESCRIPTION:This talk demonstrates how to efficiently Knowledge Graphs Construction using Small Language Models like Llama-3.2-3B\, showing practical techniques for extracting structured knowledge from JSON and PDF sources through strategic prompting and LLM-based agents. By breaking down complex tasks and orchestrating these lighter models\, we achieve robust knowledge extraction while maintaining low computational costs and ensuring privacy.\n\n\n\nhttps://github.com/camilochs\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:859@lincs.fr DTSTART;TZID=Europe/Paris:20241122T110000 DTEND;TZID=Europe/Paris:20241122T120000 DTSTAMP:20241126T121942Z URL:https://www.lincs.fr/events/lagrangian-multipliers-normal-cones-and-kk t-optimality-conditions/ SUMMARY:Lagrangian multipliers\, normal cones and KKT optimality conditions DESCRIPTION:Lagrange multipliers are a go-to tool for anyone who’s worked in optimization.\nIn this talk we will explore the renowned Karush-Kuhn-Tucker optimality conditions starting from first principles\, leveraging visual insights\, and gradually progressing to the formal proof in the context of linear constraints.\nThe talk is based on the blog post: https://mlwithouttears.com/2024/11/06/lagrangian-multipliers-normal- cones-and-kkt-optimality-conditions/ CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:861@lincs.fr DTSTART;TZID=Europe/Paris:20241120T083000 DTEND;TZID=Europe/Paris:20241120T133000 DTSTAMP:20241118T170246Z URL:https://www.lincs.fr/events/lincs-phd-welcome-day/ SUMMARY:Lincs PhD Welcome Day DESCRIPTION:We are delighted to finally announce the programme (click on it!) for this special day dedicated to welcoming our PhD students !\nThe event will begin with a presentation of the lab by its director\, followed by an overview of our annual activities presented by the coordinators of our Reading groups. Each PhD student will then have three minutes to introduce themselves\, share their background\, and briefly present their research.\n \;\n\n \; CATEGORIES:Workshop END:VEVENT BEGIN:VEVENT UID:854@lincs.fr DTSTART;TZID=Europe/Paris:20241115T110000 DTEND;TZID=Europe/Paris:20241115T120000 DTSTAMP:20241202T155546Z URL:https://www.lincs.fr/events/optimizing-energy-consumption-and-performa nce-in-modern-cloud-systems/ SUMMARY:Optimizing Energy Consumption and Performance in Modern Cloud Systems DESCRIPTION:In the modern era of data-driven innovation\, the challenge of optimizing energy consumption without sacrificing performance in modern cloud system networks has become increasingly important. This talk goes through strategies to achieve energy-efficient\, high-performance cloud environments\, focusing on approaches like resource consolidation\, workload orchestration\, and intelligent offloading. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:852@lincs.fr DTSTART;TZID=Europe/Paris:20241108T110000 DTEND;TZID=Europe/Paris:20241108T120000 DTSTAMP:20241113T151110Z URL:https://www.lincs.fr/events/uv-an-extremely-fast-python-package-instal ler-and-resolver-marimo-notebooks-rethinking-the-notebook-to-create-reprod ucible-notebooks/ SUMMARY:uv: an extremely fast Python package installer and resolver & marimo notebooks: rethinking the notebook to create reproducible notebooks DESCRIPTION:In this session\, we will talk about uv\, an extremely fast Python package and project manager designed as a single tool to replace pip\, pip-tools\, pipx\, poetry\, pyenv\, virtualenv\, and more. We will also discuss marimo\, an open-source reactive notebook for Python that is reproducible\, git-friendly\, executable as a script\, and shareable as an app.\n\nPresentation : https://alonsosilvaallende.github.io/2024-11-08_uv_marimo_at_LINCS\n\nCode to make the presentation work in : alonsosilvaallende/2024-11-08_uv_marimo_at_LINCS: Presentation uv+marimo at LINCS CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:845@lincs.fr DTSTART;TZID=Europe/Paris:20241106T140000 DTEND;TZID=Europe/Paris:20241106T150000 DTSTAMP:20241113T153948Z URL:https://www.lincs.fr/events/the-squared-kemeny-rule-for-averaging-rank ings/ SUMMARY:The Squared Kemeny Rule for Averaging Rankings DESCRIPTION:\n\nFor the problem of aggregating several rankings into one ranking\, Kemeny (1959) proposed two methods: the median rule which selects the ranking with the smallest total swap distance to the input rankings\, and the mean rule which minimizes the squared swap distances to the input rankings. The median rule has been extensively studied since and is now known simply as Kemeny's rule. It exhibits majoritarian properties\, so for example if more than half of the input rankings are the same\, then the output of the rule is the same ranking.\n\nWe observe that this behavior is undesirable in many rank aggregation settings. For example\, when we rank objects by different criteria (quality\, price\, etc.) and want to aggregate them with specified weights for the criteria\, then a criterion with weight 51% should have 51% influence on the output instead of 100%. We show that the Squared Kemeny rule (i.e.\, the mean rule) behaves this way\, by establishing a bound on the distance of the output ranking to any input rankings\, as a function of their weights. Furthermore\, we give an axiomatic characterization of the Squared Kemeny rule\, which mirrors the existing characterization of the Kemeny rule but replaces the majoritarian Condorcet axiom by a proportionality axiom. Finally\, we discuss the computation of the rule and show its behavior in a simulation study.\n\n\nJoint work with Patrick Lederer and Tomasz W?s. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:850@lincs.fr DTSTART;TZID=Europe/Paris:20241030T140000 DTEND;TZID=Europe/Paris:20241030T150000 DTSTAMP:20241104T214501Z URL:https://www.lincs.fr/events/optimal-time-partitioning-in-v2v-isac-syst ems/ SUMMARY:Optimal time partitioning in V2V ISAC Systems DESCRIPTION:Platooning-based vehicle-to-vehicle (V2V) integrated sensing and communication (ISAC) frameworks have emerged as an attractive strategy in recent years. In this work\, we present an optimal time partitioning (OTP) framework in V2V ISAC systems. We propose a novel sensing measure for quantifying radar sensing performance as a function of the maximum detectable range and velocity of the radar. With the communication operation following the sensing operation\, an OTP problem is formulated and solved as a convex problem\, constrained by sensing and communication performance guarantees. Optimal bounds on the time duration for sensing and communication are derived\, along with the maximum achievable communication throughput. Furthermore\, analytical insights on the inherent trade-offs associated with the design parameters are presented. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:851@lincs.fr DTSTART;TZID=Europe/Paris:20241025T110000 DTEND;TZID=Europe/Paris:20241025T120000 DTSTAMP:20241028T133736Z URL:https://www.lincs.fr/events/hierarchical-community-detection-in-hierar chical-stochastic-block-models/ SUMMARY:Hierarchical Community Detection in Hierarchical Stochastic Block Models DESCRIPTION:In this session of our reading group\, I will discuss community detection in hierarchical clustering of networks\, based on the paper "When Does Bottom-up Beat Top-down in Hierarchical Community Detection?" by Maximilien Dreveton et al. Hierarchical clustering involves constructing a tree of communities\, with lower levels revealing finer-grained structures. Two main approaches address this problem: divisive (top-down) algorithms\, which recursively split nodes\, and agglomerative (bottom-up) algorithms\, which start by identifying the smallest communities and then merge them using a linkage method. This talk will focus on establishing theoretical guarantees for the exact recovery of the hierarchical tree under a Hierarchical Stochastic Block Model (HSBM) using a bottom-up algorithm. The findings show that bottom-up methods can achieve the information-theoretic threshold for exact recovery at intermediate hierarchy levels\, offering less restrictive conditions than top-down algorithms and expanding the feasible region for accurate community detection. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:849@lincs.fr DTSTART;TZID=Europe/Paris:20241018T140000 DTEND;TZID=Europe/Paris:20241018T150000 DTSTAMP:20241021T141220Z URL:https://www.lincs.fr/events/understanding-reinforcement-learning-error -in-image-based-environments/ SUMMARY:Understanding Reinforcement Learning error in image-based environments DESCRIPTION:In many Reinforcement Learning (RL) environments the state is represented by an image. In such cases\, if the RL doesn’t work well\, is the problem that the image processing doesn’t recognize the salient features of the image well (i.e. there’s a recognition issue)? Or is the problem that the RL can’t learn the correct action\, even though it correctly recognizes the state (i.e. there’s a decision issue)? Or is it a bit of both?\n\nIn this talk we’ll discuss two ways to formalize these questions. In the first\, we examine how well an agent can learn the “Q-value” of an image\, if it is given some explicit examples in a training set. We then compare an agent trained in this way with an agent trained with standard RL techniques. In the second\, we decompose the regret of an RL agent into two terms that separately capture the recognition and decision error.\n\nWe illustrate our techniques using standard RL environments such as Minigrid and Pong.\n\nJoint work with Alihan Huyuk\, Xueyuan She\, Atefeh Mohajeri\, Ryo Koblitz CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:843@lincs.fr DTSTART;TZID=Europe/Paris:20241018T110000 DTEND;TZID=Europe/Paris:20241018T120000 DTSTAMP:20241021T155529Z URL:https://www.lincs.fr/events/decentralized-federated-policy-gradient-wi th-byzantine-fault-tolerance-and-provably-fast-convergence/ SUMMARY:Decentralized Federated Policy Gradient with Byzantine Fault-Tolerance and Provably Fast Convergence DESCRIPTION:In Federated Reinforcement Learning (FRL)\, agents aim to collaboratively learn a common task\, while each agent is acting in its local environment without exchanging raw trajectories. Existing approaches for FRL either (a) do not provide any fault-tolerance guarantees (against misbehaving agents)\, or (b) rely on a trusted central agent (a single point of failure) for aggregating updates. We provide the first decentralized Byzantine fault-tolerant FRL method. Towards this end\, we first propose a new centralized Byzantine fault-tolerant policy gradient (PG) algorithm that improves over existing methods by relying only on assumptions standard for non-fault-tolerant PG. Then\, as our main contribution\, we show how a combination of robust aggregation and Byzantine-resilient agreement methods can be leveraged in order to eliminate the need for a trusted central entity. Since our results represent the first sample complexity analysis for Byzantine fault-tolerant decentralized federated non-convex optimization\, our technical contributions may be of independent interest. Finally\, we corroborate our theoretical results experimentally for common RL environments\, demonstrating the speed-up of decentralized federations w.r.t. the number of participating agents and resilience against various Byzantine attacks.\n\nPaper from Philip Jordan\, Florian Grötschla\, Flint Xiaofeng Fan and Roger Wattenhofer. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:847@lincs.fr DTSTART;TZID=Europe/Paris:20241011T110000 DTEND;TZID=Europe/Paris:20241011T120000 DTSTAMP:20240925T153045Z URL:https://www.lincs.fr/events/visual-studio-code-an-all-in-one-developme nt-environment/ SUMMARY:Visual Studio Code\, an all-in-one development environment DESCRIPTION:Rémi Varloot will present VS Code\, a text editor / development environment that can be used for just about every coding need\, and showcase how it can be used to work with Python (including notebooks)\, LaTeX\, Git\, code hosted on remote machines\, and more if time permits. CATEGORIES:Tools, Tips and Tricks,Working Group END:VEVENT BEGIN:VEVENT UID:842@lincs.fr DTSTART;TZID=Europe/Paris:20241009T140000 DTEND;TZID=Europe/Paris:20241009T150000 DTSTAMP:20241010T115401Z URL:https://www.lincs.fr/events/zero-knowledge-proofs-in-blockchain/ SUMMARY:Zero knowledge proofs in blockchain DESCRIPTION:In this talk\, we will explore the fundamental concept of Zero Knowledge Proofs (ZKPs)\, a cryptographic technique that allows one party to prove knowledge of a specific piece of information to another party without revealing the information itself. We will delve into two core computation models used in ZKPs: the circuit computation model and the machine computation model. These models form the basis of how ZKPs are designed and implemented. Furthermore\, we will examine various real-world applications of ZKPs\, with particular emphasis on their critical role in enhancing privacy and security in blockchain systems. Attendees will gain a foundational understanding of ZKPs and insight into how they are applied to diverse scenarios in modern cryptographic systems.\n\nShort bio\n\nJosé L. Muñoz-Tapia received the M.S. degree in telecommunications engineering and the Ph.D. degree in security engineering\, in 1999 and 2003\, respectively. He is currently a Researcher with the Information Security Group (ISG) and an Associate Professor with the Department of Network Engineering\, Universitat Politècnica de Catalunya (UPC). He is also the Director of the Master Program in Blockchain Technologies\, UPC School. He has worked in applied cryptography\, network security\, and game theory models applied to networks and simulators. His research interest includes distributed ledgers technologies. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:846@lincs.fr DTSTART;TZID=Europe/Paris:20241004T110000 DTEND;TZID=Europe/Paris:20241004T120000 DTSTAMP:20241007T124539Z URL:https://www.lincs.fr/events/quantum-states-are-relative-to-observers/ SUMMARY:Quantum states are relative to observers! DESCRIPTION:Many "pseudo-paradoxes" arise in quantum physics because "quantum states"  are generally considered to be absolute\, that is\, independent of observers. But entangled pairs of qubits in Bell states with two distant observers\, one per qubit\, force us to reconsider the status of quantum states\, revealing their observer-dependence. It is at the core of the "relational" interpretation of quantum mechanics\, as proposed by Carlo Rovelli [Rovelli 1996]\, or Asher Peres' interpretation of the Einstein-Podolsky-Rosen dilemma [Peres 2004\, §2]\,\nand it is related to the observer-dependence of time in special relativity. It is important to have in mind this observer-dependence in distributed quantum systems\, such as quantum networks where the speed of light cannot be considered as "infinite". It helps in understanding and accepting the physical phenomena involved in such systems.\n\nReferences:\n\n ("easy" to read\, mostly philosophical views on quantum physics)\n[Rovelli 1996] Carlo Rovelli\, Relational Quantum Mechanics\, 1996\nhttps://arxiv.org/abs/quant-ph/9609002\n [Peres 2004] Asher Peres\, Quantum information and general relativity\, 2004\nhttps://arxiv.org/abs/quant-ph/0405127\n\n\nSlides of the presentation: PDF.\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:848@lincs.fr DTSTART;TZID=Europe/Paris:20241002T150000 DTEND;TZID=Europe/Paris:20241002T160000 DTSTAMP:20241007T112812Z URL:https://www.lincs.fr/events/how-much-can-reconfigurable-intelligent-su rfaces-augment-sky-visibility-a-stochastic-geometry-approach/ SUMMARY:How Much Can Reconfigurable Intelligent Surfaces Augment Sky Visibility: A Stochastic Geometry Approach DESCRIPTION:This talk presents the application of point processes and stochastic geometry to quantify the sky visibility experienced by users located in an outdoor environment. The general idea is to represent the buildings of this environment as a stationary marked point process\, where the points represent the building locations and the marks their heights. The point process framework is first used to characterize the distribution of the blockage angle\, which limits the visibility of a typical user into the sky due to the obstruction by buildings. In the context of communications\, this distribution is useful when users try to connect to the nodes of an aerial or non-terrestrial network in a Line-of-Sight way. Within this context\, the point process framework can also be used to investigate the gain of connectivity obtained thanks to Reconfigurable Intelligent Surfaces.\nAssuming that such surfaces are installed on the top of buildings to extend the user's sky visibility\, this point process approach allows one to quantify the gain in visibility and hence the gain in connectivity obtained by the typical user. The distributional properties of visibility-related metrics are cross-validated by comparison to simulation results and 3GPP measurements. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:844@lincs.fr DTSTART;TZID=Europe/Paris:20241002T140000 DTEND;TZID=Europe/Paris:20241002T150000 DTSTAMP:20241007T090413Z URL:https://www.lincs.fr/events/design-and-optimizations-toward-smart-grid -connected-green-future-networks/ SUMMARY:Design and Optimizations Toward Smart Grid Connected Green Future Networks DESCRIPTION:Realizing energy sustainable communication networks has been a key challenge in the upcoming sixth generation (6G) networks. A key bottleneck has been to make the energy-efficient network solutions industrially attractive and scalable\, thereby necessitating a techno-economic analysis. Through this talk\, the prospects of achieving energy sustainability as well as cost profitability through ambient powered and grid connected communication framework is analyzed and studied. The power grid connectivity plays a vital role in achieving the aforesaid objective\, alongside ambient powered base stations (BSs). The networked system is further analyzed to outlay the challenges\, physical constraints\, and network operations involved in optimizing the system. The talk highlights the key system design objectives and their inherent techno-economic tradeoffs. Specifically\, the talk outlines the importance of energy balancing in networks\, and showcases the benefit of joint load-energy balancing in networks in contrast to the traditional load balancing paradigm. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:841@lincs.fr DTSTART;TZID=Europe/Paris:20240925T150000 DTEND;TZID=Europe/Paris:20240925T160000 DTSTAMP:20240927T093657Z URL:https://www.lincs.fr/events/gaming-on-the-edge-performance-issues-of-d istributed-online-gaming/ SUMMARY:Gaming on the Edge: Performance Issues of Distributed Online Gaming DESCRIPTION:Edge computing is revolutionising gaming and streaming services by processing data closer to the user\, which greatly reduces latency and enhances bandwidth efficiency. This talk delves into the integration of edge computing with online gaming\, focusing on the Gaming as a Service (GaaS) paradigm. Through an analytical model we show that edge-based gaming architectures can outperform traditional cloud gaming solutions in terms of response times. We will discuss insights into the benefits and complexities of edge computing in online gaming\, offering a framework for future developments in this dynamic field. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:840@lincs.fr DTSTART;TZID=Europe/Paris:20240925T140000 DTEND;TZID=Europe/Paris:20240925T150000 DTSTAMP:20240927T093339Z URL:https://www.lincs.fr/events/job-migrations-in-queueing-networks-some-n on-conventional-product-forms/ SUMMARY:Job migrations in queueing networks: some non-conventional product-forms DESCRIPTION:Job migrations are important to improve the performance in distributed systems.  In this talk\, we explore two policies for job migration that are receiver-initiated\, i.e.\, the migration of one or more jobs is triggered by the state of the stations that will receive the new workload. The first policy is aimed at improving the load-balancing in the queueing network\, and allows an empty station to 'steal' a geometrically distributed batch of jobs from another station\, if these are present. The second policy that we propose forces an empty station to steal one job from another station but\, if this is empty\, the job-stealing signal is propagated backward along the routing topology until a station with at least one job is found. We show that the queueing network models underlying these policies admit product-form solution under the usual exponential assumptions and discuss their mean value analysis. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:839@lincs.fr DTSTART;TZID=Europe/Paris:20240918T150000 DTEND;TZID=Europe/Paris:20240918T160000 DTSTAMP:20240923T154439Z URL:https://www.lincs.fr/events/an-economic-analysis-of-5g-network-slicing -and-the-impact-of-regulation/ SUMMARY: An Economic Analysis of 5G Network Slicing and the Impact of Regulation DESCRIPTION:\n\n\nA joint work with Yassine Hadjadj-Aoul\, Maël Le Treust\, and Bruno Tuffin\n\n\n\nNetwork slicing is a key component of 5G-and- beyond networks\, requiring to define a business model for resource allocation. We consider a model with a Service Provider (SP) that may purchase a slice in a wireless network\, in order to offer a “premium” service where the improved quality stems from higher prices leading to less demand and less congestion than the basic service offered by the network owner\, a scheme known as Paris Metro Pricing. One optimization problem for the SP is the choice of how much resource to allocate to that slice. We also compare with the case of a unique “pipe” (no premium service) and with the case of vertical integration to evaluate the impact of slicing on all actors and identify the “best” economic scenario.\n\n CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:838@lincs.fr DTSTART;TZID=Europe/Paris:20240918T140000 DTEND;TZID=Europe/Paris:20240918T150000 DTSTAMP:20240923T150705Z URL:https://www.lincs.fr/events/performance-analysis-of-a-buffered-cellula r-network-coverage-probability-channel-capacity-and-steady-state-analysis/ SUMMARY:Performance analysis of a buffered cellular network: Coverage probability\, channel capacity\, and steady-state analysis DESCRIPTION:In this talk I will discuss a stochastic geometric model of a buffered cellular network with either uplink or downlink transmissions. Various network models have been widely considered in many works from different perspectives\, and our work partially adopts general concepts of network topology. Some crucial features of our model include the presence of a buffer of finite or infinite capacity for failed signals\, the busy/idle state of the transmitters\, and the time-inhomogeneity of the network behavior. We start with defining a tractable mathematical model of the network which we then use to derive analytical expressions for coverage probability\, Shannon capacity\, stationary busy probability and buffer distribution. We will also look at some numerical and simulation results for visualization and model validation. CATEGORIES:Seminars,Youtube LOCATION:Amphi 6\, 19 Place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 6:geo:0,0 END:VEVENT BEGIN:VEVENT UID:837@lincs.fr DTSTART;TZID=Europe/Paris:20240627T090000 DTEND;TZID=Europe/Paris:20240628T180000 DTSTAMP:20260204T162441Z URL:https://www.lincs.fr/events/lincs-annual-workshop-with-its-scientific- committee-2024/ SUMMARY:LINCS Annual Workshop with its Scientific Committee 2024 DESCRIPTION:https://www.lincs.fr/2024-lincs-annual-workshop-with-its-scient ific-committee/\n\nThe event is reserved to the LINCS community\n\nPlease find the program by clicking =>\; Workshop LINCS - agenda 2024 CATEGORIES:LINCS Workshop LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:836@lincs.fr DTSTART;TZID=Europe/Paris:20240619T140000 DTEND;TZID=Europe/Paris:20240619T150000 DTSTAMP:20240617T082613Z URL:https://www.lincs.fr/events/elevator-self-and-persistent-hub-sampling- service-in-unstructured-peer-to-peer-networks/ SUMMARY:Elevator: Self-* and Persistent Hub Sampling Service in Unstructured Peer-to-Peer Networks DESCRIPTION:We present Elevator\, a novel algorithm for hub sampling in peer-to-peer networks\, enabling the construction of overlays with a\ntopology between a random graph and a star network\, and networks that have both hubs and are resilient to failures. Our approach emerges\nfrom principles of preferential attachment\, forming hubs spontaneously\, offering an innovative solution for decentralized networks that can benefit\nuse cases requiring a network with both low diameter and resilience to failures. CATEGORIES:Seminars LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:835@lincs.fr DTSTART;TZID=Europe/Paris:20240612T083000 DTEND;TZID=Europe/Paris:20240612T180000 DTSTAMP:20240611T060915Z URL:https://www.lincs.fr/events/lincs-phd-student-day-team-building/ SUMMARY:LINCS PhD Student Day + Team Building DESCRIPTION:Supporting our PhD students is crucial for nurturing their talent and ensuring the success of their research.\n\nWe are glad to be there for them\, stimulating their creativity and motivation\, which are essential for meaningful innovations.\n\nPREVISIONAL PROGRAMME OVERVIEW\n\n 8h30 Welcome Breakfast\n 9h00 Moderator Welcome Speech\n 9h05 Présentation of the PEPR Future Network and the National Center RS TN\n 9h15 Elevator Pitch - Session 1 : Each doctoral candidate will have 3 minutes to present their work\, followed by a brief Q&A session and feedback from senior members\n 10h15 Coffee Break & Posters Session\n 10h30 Elevator Pitch - Session 2 : Each doctoral candidate will have 3 minutes to present their work\, followed by a brief Q&A session and feedback from senior members\n 11h30 Brainstorming\n 12h30 Lunch\n 13h15 Depart to Aventure Floraval\n\n CATEGORIES:PhD Elevator Pitch Session END:VEVENT BEGIN:VEVENT UID:833@lincs.fr DTSTART;TZID=Europe/Paris:20240529T140000 DTEND;TZID=Europe/Paris:20240529T150000 DTSTAMP:20240601T084526Z URL:https://www.lincs.fr/events/understanding-and-modeling-collective-user -mis-behavior-driving-information-spread-online/ SUMMARY:Understanding and Modeling Collective User (Mis-)Behavior Driving Information Spread Online DESCRIPTION:The literature is quite rich in efforts to model and analyze how different aspects of user behavior may drive the dissemination of a piece of content online\, favoring its spread at large. Yet\, human behavior is often very heterogeneous\, highly dynamic\, and may manifest itself in multiple facets and scales\, with components that are conceptually hard to operationalize. As such\, inferring behavioral patterns and profiles from digital traces can be quite challenging. In this talk\, I will discuss our efforts towards inferring\, modeling and analyzing collective user behavior (notably user campaigns) towards favoring information dissemination online. I will show results applied to the study of spread of fake news\, illegal political ads\, and hate speech. Finally\, as a short detour\, I will discuss recent results on the use of similar techniques to a completely different context\, namely scientometrics\, to analyze the emergence of anomalous hyperprolific researchers.\n\n\n\nShort Bio\n\nJussara M Almeida is a Full Professor at the Universidade Federal de Minas Gerais\, Brazil\, where she currently leads the Social Computing Laboratory (LOCUS) at the Department of Computer Science. She holds a PhD from the University of Wisconsin-Madison (US) and is a former affiliate member of the Brazilian Academy of Sciences. Her areas of expertise are workload and user behavior characterization\, performance analysis and modeling of large-scale distributed systems\, and social computing. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:834@lincs.fr DTSTART;TZID=Europe/Paris:20240522T150000 DTEND;TZID=Europe/Paris:20240522T160000 DTSTAMP:20240601T083251Z URL:https://www.lincs.fr/events/caching-and-pre-fetching-the-role-of-hazar d-rates/ SUMMARY:Caching and pre-fetching: the role of hazard rates DESCRIPTION:Consider a local memory system receiving requests from a given catalog: the typical caching objective is to maximize its hit rate\, i.e. the number of items that are served directly from the cache. Two main alternatives have been studied: replacement policies (such as LRU) and timer-based policies (TTL).\nIn previous work\, we have explored the role of the hazard rate function of the inter-request times in the optimal TTL policy. Recently\, Towsley et al. also identified that the optimal non-anticipative replacement policy involves the hazard rate function.\nIn this talk we will discuss how these two concepts relate: we show that\, in large scale systems\, the optimal non-anticipative policy converges to a fixed threshold policy\, and that this threshold also characterizes the optimal TTL policy. Thus TTL caching is asymptotically optimal\, and we can approximate the maximal hit rate by that of the TTL policy fluid limit. This enables us to compute new a universal performance bound for caching performance. We also remark that\, in the case of increasing hazard rates\, caching is far from optimal and introduce the notion of optimal timer-based pre-fetching.\n\nhttps://aferragu.github.io CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:832@lincs.fr DTSTART;TZID=Europe/Paris:20240522T140000 DTEND;TZID=Europe/Paris:20240522T150000 DTSTAMP:20240601T074616Z URL:https://www.lincs.fr/events/hypercomputation-a-paradigm-for-network-in spired-computing/ SUMMARY:Hypercomputation: a paradigm for network-inspired computing DESCRIPTION:In this talk Carlos Zapata-Carratala will present evidence from recent work on hypergraph rewriting research and abstract algebra that points towards new ways to conceptualise and implement universal computation. The recent success of GPUs for ML/AI algorithm implementation illustrates the phenomenon that he will be presenting in a more general context. He will propose computing architectures that may optimize computational processes that are dependent on network topology. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:831@lincs.fr DTSTART;TZID=Europe/Paris:20240522T103000 DTEND;TZID=Europe/Paris:20240522T113000 DTSTAMP:20240531T151915Z URL:https://www.lincs.fr/events/how-to-create-pure-python-web-apps-solaraa nywidget/ SUMMARY:How to create pure Python web apps (Solara+AnyWidget) DESCRIPTION:Solara lets you build pure Python web apps. These apps work both inside the Jupyter Notebook and as standalone web apps.\n\nWith Solara\, you benefit from a paradigm that promotes component-based code and simplifies state management\, making the development process more efficient and the applications more maintainable. Solara offers the flexibility to build complex apps\, but keeps the simplicity of a small code base. We will compare Solara to Streamlit/Gradio and show their benefits and disadvantages.\n\nAnyWidget is a Python library that simplifies creating and publishing custom Jupyter Widgets. No messy build configuration or complicated cookiecutter templates. It is not a new interactive widgets framework\, but rather an abstraction for creating custom Jupyter Widgets using modern web standards.\n\nFinally\, we will see how Solara and AnyWidget synergize to create pure Python apps\, demonstrating the complementary nature of these two powerful tools.\n\nNotebook\n\nFull github repo\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:830@lincs.fr DTSTART;TZID=Europe/Paris:20240515T103000 DTEND;TZID=Europe/Paris:20240515T113000 DTSTAMP:20240531T150253Z URL:https://www.lincs.fr/events/navigating-5g-virtualization-constructing- a-kubernetes-cluster-for-seamless-deployments/ SUMMARY:Navigating 5G Virtualization: Constructing a Kubernetes Cluster for Seamless Deployments DESCRIPTION:This presentation navigates the intersection of 5G and virtualization\, offering  a comprehensive guide to building a Kubernetes (K8s) cluster and configuring the OAI 5G core network. It explores the role of virtualization in 5G networks\, emphasizing Docker's pivotal role in containerization. Attendees will gain insights into building their K8s cluster\, laying the groundwork for 5G deployments and learn to deploy the OpenAirInterface (OAI) core network alongside UERANSIM (gNB and UE) integration. This session provides essential insights for architects and developers venturing into 5G deployments amidst virtualized environments. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:829@lincs.fr DTSTART;TZID=Europe/Paris:20240424T103000 DTEND;TZID=Europe/Paris:20240424T113000 DTSTAMP:20240429T110525Z URL:https://www.lincs.fr/events/what-a-confidence-interval-really-is/ SUMMARY:What a confidence interval really is DESCRIPTION:By analyzing a (hopefully) illuminating example in depth\, we will show what a confidence interval really is\, and what are the common traps in its interpretation.\n\nThe overview of the notebook is given below. Unfortunately\, the interactive plots cannot be displayed in this "gist" version. To see them\, download the notebook and run it with your local distribution.\n\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:824@lincs.fr DTSTART;TZID=Europe/Paris:20240417T140000 DTEND;TZID=Europe/Paris:20240417T150000 DTSTAMP:20240515T090131Z URL:https://www.lincs.fr/events/seminar-talk-a-protocol-to-assess-the-accu racy-of-process-level-power-models/ SUMMARY:Seminar Talk : A Protocol to Assess the Accuracy of Process-Level Power Models DESCRIPTION:The energy consumption of servers has been a critical research area\, drawing significant interest from academic and industrial sectors. Various models have been developed to estimate power consumption of computing devices\, ranging from simple linear models to more complex ones. In recent years\, as the cloud paradigm has expanded and allowed applications to be hosted alongside others in virtual machines\, power models have evolved to distribute energy usage among applications on a server. These models aim to achieve two primary objec-tives: monitoring the energy footprint and optimizing energy consumption. Nonetheless\, little attention has been given in academic literature to evaluate the efficiency and accuracy of the allocation phase of this models. This paper presents a definition of power division and a protocol to evaluate models using such division. The proposed protocol is used to evaluate models on physical machines with different performance settings\, toggeling hyperthreading and turboboost. Before discussing the conceptual distinctions between power and energy allocation models\, our results show the existence of some limitations in the existing models. These results provide valuable insight into the missing information needed to improve the accuracy of power models. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:828@lincs.fr DTSTART;TZID=Europe/Paris:20240410T140000 DTEND;TZID=Europe/Paris:20240410T150000 DTSTAMP:20240423T092139Z URL:https://www.lincs.fr/events/level-strategyproof-belief-aggregation-mec hanisms/ SUMMARY:Level-strategyproof Belief Aggregation Mechanisms DESCRIPTION:In the problem of aggregating experts' probabilistic predictions over an ordered set of outcomes\, we introduce the axiom of level-strategy\\-proofness (level-SP) and prove that it is a natural notion with several applications. Moreover\, it is a robust concept as it implies incentive compatibility in a rich domain of single-peakedness over the space of cumulative distribution functions (CDFs). This contrasts with the literature which assumes single-peaked preferences over the space of probability distributions. Our main results are: (1) a reduction of our problem to the aggregation of CDFs\; (2) the axiomatic characterization of level-SP probability aggregation functions with and without the addition of other axioms\; (3) impossibility results which provide bounds for our characterization\; (4) the axiomatic characterization of two new and practical level-SP methods: the proportional-cumulative method and the middlemost-cumulative method\; and (5) the application of proportional-cumulative to extend approval voting\, majority rule\, and majority judgment methods to situations where voters/experts are uncertain about how to grade the candidates/alternatives to be ranked. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:823@lincs.fr DTSTART;TZID=Europe/Paris:20240403T140000 DTEND;TZID=Europe/Paris:20240403T150000 DTSTAMP:20240318T140616Z URL:https://www.lincs.fr/events/double-talk-can-edge-computing-fulfill-the -requirements-of-automated-vehicular-services-using-5g-network-can-vehicul ar-cloud-replace-edge-computing/ SUMMARY:Double talk : "Can Edge Computing fulfill the requirements of automated vehicular services using 5G network?" & "Can Vehicular Cloud Replace Edge Computing?" DESCRIPTION:Abstract 1: Communication and computation services support-\ning Connected and Automated Vehicles (CAVs) are characterized\nby stringent requirements\, in terms of response time and reliability.\nFulfilling these requirements is crucial for ensuring road\nsafety and traffic optimization. The conceptually simple solution\nof hosting these services in the vehicles increases their cost\n(mainly due to the installation and maintenance of computation\ninfrastructure) and may drain their battery excessively. Such\ndisadvantages can be tackled via Multi-Access Edge Computing\n(MEC)\, consisting in deploying computation capability in network\nnodes deployed close to the devices (vehicles in this case)\,\nsuch as to satisfy the stringent CAV requirements.\nHowever\, it is not yet clear under which conditions MEC can\nsupport CAV requirements and for which services. To shed light\non this question\, we conduct a simulation campaign using well-\nknown open-source simulation tools\, namely OMNeT++\, Simu5G\,\nVeins\, INET\, and SUMO. We are thus able to provide a reality\ncheck on MEC for CAV\, pinpointing what are the computation\ncapacities that must be installed in the MEC\, to support the\ndifferent services\, and the amount of vehicles that a single MEC\nnode can support. We find that such parameters must vary a\nlot\, depending on the service considered. This study can serve\nas a preliminary basis for network operators to plan future\ndeployment of MEC to support CAV.\n\n\nAbstract 2: Edge computing (EC) consists of deploying com-\nputation resources close to the users\, thus enabling low-latency\napplications\, such as augmented reality and online gaming.\nHowever\, large-scale deployment of edge nodes can be highly\nimpractical and expensive. Besides EC\, there is a rising concept\nknown as Vehicular Cloud Computing (VCC). VCC is a com-\nputing paradigm that amplifies the capabilities of vehicles by\nexploiting part of their computational resources\, enabling them\nto participate in services similar to those provided by the EC.\nThe advantage of VCC is that it can opportunistically exploit\npart of the computation resources already present on vehicles\,\nthus relieving a network operator from the deployment and\nmaintenance cost of EC nodes. However\, it is still unknown under\nwhich circumstances VCC can enable low-latency applications\nwithout EC. In this work\, we show that VCC has the potential to\neffectively supplant EC in urban areas\, especially given the higher\ndensity of vehicles in such environments. The goal of this paper\nis to analyze\, via simulation\, the key parameters determining\nthe conditions under which this substitution of EC by VCC is\nfeasible. In addition\, we provide a high level cost analysis to\nshow that VCC is much less costly for a network operator than\nadopting EC. CATEGORIES:Seminars LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:827@lincs.fr DTSTART;TZID=Europe/Paris:20240403T103000 DTEND;TZID=Europe/Paris:20240403T113000 DTSTAMP:20240403T073544Z URL:https://www.lincs.fr/events/c/ SUMMARY:C DESCRIPTION:As stated in WIkipedia\, C is a general-purpose computer programming language. It was created in the 1970s by Dennis Ritchie\, and remains very widely used and influential. By design\, C's features cleanly reflect the capabilities of the targeted CPUs. It has found lasting use in operating systems\, device drivers\, and protocol stacks\, but its use in application software has been decreasing. C is commonly used on computer architectures that range from the largest supercomputers to the smallest microcontrollers and embedded systems.\n\nAs the C language is significantly more efficient than language like Python\, it also offer the opportunity to develop efficient core module which can later be wrapped in a Python function.\n\nThis tutorial assumes that the audience is already familiar with another programming language (e.g.\, Python or Java). After briefly recalling the syntax of the C language\,  we focus on notions specific to the C language:\n\n\n precompilation and compilation (gcc\, make)\n pointers and memory allocation\n debugging (gdb\, valgrind)\n how to wrap C functions in python using poetry [1]\n\nHere are the slides.\n\n[1] https://github.com/ibgp2/Poetry_C_Extension_Example\n CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:826@lincs.fr DTSTART;TZID=Europe/Paris:20240327T103000 DTEND;TZID=Europe/Paris:20240327T113000 DTSTAMP:20240405T072633Z URL:https://www.lincs.fr/events/tournament-solutions/ SUMMARY:Tournament Solutions DESCRIPTION:A tournament is an oriented graph where there is exactly one edge between each pair of nodes\, in one direction or the other\, with the implicit interpretation that one node "beats" the other. If the binary relation induced by the tournament is transitive\, then there is a natural notion of winner\, which is the maximal element. But in the general case\, it would be interesting to have a function that\, to each tournament\, associates a set of cowinners\, and that has intuitively appealing properties. We will investigate such functions\, called "tournament solutions".\n\nReferences:\nLaslier\, Jean-François. Tournament solutions and majority voting. Springer\, 1997.\nBrandt\, Felix\, Markus Brill and Paul Harrenstein. Tournament Solution. In: Brandt\, Felix\, Vincent Conitzer\, Ulle Endriss\, et al (ed.). Handbook of computational social choice. Cambridge University Press\, 2016.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:822@lincs.fr DTSTART;TZID=Europe/Paris:20240320T103000 DTEND;TZID=Europe/Paris:20240320T113000 DTSTAMP:20240322T092910Z URL:https://www.lincs.fr/events/faites-tourner-votre-llm-chez-vous-ipywidg et/ SUMMARY:Double Feature: IPyWidgets + Using LLM DESCRIPTION:\nIPyWidgets is a popular Python library for creating interactive\, customizable user interfaces in Jupyter Notebooks and other environments using the power of the Widgets system from the Interactive Computing and Visualization Toolkit (IPython).\nLarge Language Models (LLMs) are advanced artificial intelligence models capable of generating human-like text based on the input they receive. These models have gained significant attention in recent times due to their ability to understand context\, generate creative responses\, and assist with various tasks such as text generation\, summarization\, translation\, and more.\nIn this tutorial\, we'll explore how to create interactive data visualizations using IPywidgets\, a popular Python library for building dynamic user interfaces\, and Large Language Models (LLMs) like Hugging Face Transformers. By combining these two powerful tools\, you can create engaging data visualizations that respond to user input in real-time.\nPrerequisites:\n- Basic understanding of Python programming\n- Familiarity with Jupyter Notebook or JupyterLab environment\nPreparation:\n- Install IPywidgets if it is not already in your distribution\n- Install llama-cpp-python with server option\n- Details: https://github.com/abetlen/llama-cpp-python\n- If you have a Cuda card\, try to install with cuBLAS option\n- Choose and download a GGUF model from Hugging Face\n- Small configurations: https://huggingface.co/TheBloke/phi-2-GGUF\n- Got a decent Cuda card? https://huggingface.co/TheBloke/Mistral-7B-Instruct-v0.2-GGUF\n- Look the size and required RAM to choose a specific (sub)version\n- Files are in the "Files and versions" tab\nLearning Objectives:\n- Understand the basics of IPywidgets and Hugging Face Transformers\n- Learn how to create interactive data visualizations using IPywidgets\n- Discover how to integrate LLMs with IPywidgets to create dynamic visualizations that respond to user input\n- Explore examples of practical applications of these techniques\nThe description above was generated using the assistance of a Mistral-7B-Instruct-v0.2-GGUF model \;)\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:821@lincs.fr DTSTART;TZID=Europe/Paris:20240313T103000 DTEND;TZID=Europe/Paris:20240313T113000 DTSTAMP:20240229T104103Z URL:https://www.lincs.fr/events/group-signature-in-dynamic-clusters/ SUMMARY:Group Signature in Dynamic Clusters DESCRIPTION:This talk presents a group signature scheme specifically designed for a cluster of moving vehicles. The group signature enables vehicles to authenticate themselves within dynamic clusters upon the departure or the arrival of entities. This ensures secure communication between entities\, while preserving their privacy.\n\n \; CATEGORIES:Practical Networks,Working Group LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:818@lincs.fr DTSTART;TZID=Europe/Paris:20240306T103000 DTEND;TZID=Europe/Paris:20240306T113000 DTSTAMP:20240307T145311Z URL:https://www.lincs.fr/events/introduction-to-the-cake-cutting-problem/ SUMMARY:Introduction to the cake cutting problem DESCRIPTION:The cake cutting problem arises when a cake must be divided fairly among individuals who have different preferences. In this presentation\, after a brief explanation of the model\, we will introduce different definitions of "dividing fairly"\, exploring what it means to achieve fairness in such a scenario. Notably\, we will emphasize on "envy-freeness" (no one envies the piece of cake allocated to another person)\,  especially by showing an algorithm that achieves it when the number of individuals is 2 or 3. This will be the occasion to talk about the computational complexity of allocation algorithms\, and the theoretical bounds obtained so far in the literature.\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:819@lincs.fr DTSTART;TZID=Europe/Paris:20240228T103000 DTEND;TZID=Europe/Paris:20240228T113000 DTSTAMP:20240307T132558Z URL:https://www.lincs.fr/events/is-reinforcement-learning-all-you-need/ SUMMARY:Is Reinforcement Learning all you need? DESCRIPTION:When attacking a new problem\, the algorithm designer typically follows 3 main steps:\n\n rule out options that are unlikely to work well\n test the handful of options that made the first cut\n pick the best one and polish it until it shines\n\nWhen reporting her/his work\, the algorithm designer will proudly focus on step 3)\, briefly mention 2) and likely sweep 1) under the carpet. Yet\, skimming alternatives off is a crucial step\, that inevitably impacts (positively or negatively) months of hard work on testing and polishing.\n\nI would like to lift the veil on step 1) and start sharing some subjective\, but hopefully relatable\, insights on how to navigate through the staggering amount of options available to the algorithm designer to solve a sequential decision-making problem\, notably in the field of telecommunications.\n\nBased on a recent blog post https://mlwithouttears.com/2023/10/27/is-reinforcement-learning-all-you-nee d/\n\nSlides CATEGORIES:Practical Networks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:820@lincs.fr DTSTART;TZID=Europe/Paris:20240222T093000 DTEND;TZID=Europe/Paris:20240223T170000 DTSTAMP:20240320T171202Z URL:https://www.lincs.fr/events/international-workshop-on-ris/ SUMMARY:International Workshop on RIS DESCRIPTION:Reconfigurable Intelligent Surfaces are very promising physical-layer candidates for sixth-generation cellular networks.\nThis international workshop will cover the main scientific and technological questions underlying this promise: electromagnetism\, meta-materials\, beamforming\, adaptive control\,network architecture\, and network energy expenditure.\nClick here below for further information :\n\n\n\nclick here to acces the program and the registration form\n CATEGORIES:LINCS Workshop,Workshop END:VEVENT BEGIN:VEVENT UID:817@lincs.fr DTSTART;TZID=Europe/Paris:20240221T103000 DTEND;TZID=Europe/Paris:20240221T113000 DTSTAMP:20240226T142449Z URL:https://www.lincs.fr/events/a-visual-journey-to-convey-complex-message s-through-mathematical-animation-manim/ SUMMARY:A visual journey to convey complex messages through MAThematical ANIMation - manim DESCRIPTION:Manim is a tool used to programmatically create precise and high-quality animations. \nBased (almost) entirely on Python\, manim evolved from being a powerful visualization engine for complex mathematical concepts\, to a general-purpose utility that extends far beyond the realm of mathematics. \nIn this presentation/tutorial\, we will dive into some Manim concepts\, exploring how can educators\, researchers\, and scientist leverage it to create dynamic and engaging scientific animations. \nThrough this hands-on session\, we will explore how to create simple animations with basic shapes\, how to animate generic text or formulas\, and then see some real examples (both from my personal library and some community code).\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:816@lincs.fr DTSTART;TZID=Europe/Paris:20240214T103000 DTEND;TZID=Europe/Paris:20240214T113000 DTSTAMP:20240215T091752Z URL:https://www.lincs.fr/events/a-new-perspective-of-entropy/ SUMMARY:A new perspective of entropy DESCRIPTION:Have you ever wondered how mathematicians "understand"? In a 1932 lecture\, Hermann Weyl identified two key modes of mathematical reasoning: topology and abstract algebra. These\, he argued\, can help us solve problems in a way subject to the Dirichlet principle\, minimizing mindless calculations and maximizing insightful thoughts. Recently\, Dr. Tai-Danae Bradley took this idea further\, suggesting that information theory\, using the formular of Shannon entropy\, can bridge these two modes of understanding. In this lecture\, I'll explore her fascinating work\, "Entropy as a Topological Operad Derivation"\, and show how it offers a new way to understand entropy - not just as a measure of disorder\, but also as a tool for mathematical reasoning. Join me to gain a fresh perspective on this interesting concept and its potential impact on our understanding of the world.\n\n[1]: Weyl\, Hermann. "Part I. Topology and abstract algebra as two roads of mathematical comprehension." The American mathematical monthly 102.5 (1995): 453-460.\n\n[2]: Weyl\, Hermann. "Part II. Topology and Abstract Algebra as Two Roads of Mathematical Comprehension." The American mathematical monthly 102.7 (1995): 646-651.\n\n[3]: Bradley\, Tai-Danae. "Entropy as a topological operad derivation." Entropy 23.9 (2021): 1195.\n\n[4]: A more accessible version of [3] provided by the same author https://uploads-ssl.webflow.com/649f7839d1d9d9bbdb8bc7ea/650e1fa362d02601b2 4d560b_bradley_spring22.pdf. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:814@lincs.fr DTSTART;TZID=Europe/Paris:20240207T140000 DTEND;TZID=Europe/Paris:20240207T150000 DTSTAMP:20240226T103802Z URL:https://www.lincs.fr/events/bell-theorem-and-the-role-of-complex-numbe rs-in-quantum-information-theory/ SUMMARY:Bell theorem and the role of complex numbers in quantum information theory DESCRIPTION:Quantum information theory has several puzzling properties. In particular\, it predicts that information carried by quantum objects is incompatible with the use of the logical ‘or’.\n\nWhile in our intuition of the world\, a cat hidden in a box can be dead or alive\, according to quantum mechanics this assertion is not valid anymore. Hence\, we need a new concept: we say that a quantum cat can be dead  ‘and’ alive.\n\nThis new concept is however hard to accept: couldn’t we imagine a new theory replacing quantum information theory and compatible again with  our stadard logical ‘or’?\n\nIn 1964\, Bell proved that\, in some sense\, this puzzling feature of quantum theory is a necessity: there does not exist any ‘reasonable’ theory of information (which would replace quantum information theory) compatible with this logical ‘or’.\n\nBell’s seminal proof is based on quantum correlations\, which are obtained when multiple parties perform independent measurements on a shared quantum state.\n\nI’ll first review this Bell theorem\, and discuss some of its main consequences for the foundations of physics and the more philosophical notion of determinism and randomness.\n\nThen\, I will discuss recent generalization of this theorem which were obtained in the context of quantum networks\, in which multiple parties perform independent measurements on several\, independent quantum states.\n\nIn particular\, I’ll show that Real Quantum Theory (the theory obtained replacing complex by real numbers in standard Quantum Information Theory) can be ruled out by a Bell-like experiment.\n\nThis talk is based on "La non-localité quantique à l’ère des réseaux\, Marc Olivier Renou\, Nicolas Brunner et Nicolas Gisin\, POUR LA SCIENCE N° 528 (20 septembre 2021)" and "Les nombres imaginaires sont indispensables à la théorie quantique pour décrire le monde\, Marc-Olivier Renou\, Antonio Acin et Miguel Navascués\, POUR LA SCIENCE N° 551\, 30 août 2023"\n\nBio:\nMarc-Olivier research focuses onquantum networks and distributed computing\, quantum protocols based on quantum correlations and the\nfoundations of quantum information theory. He obtained his PhD from Geneva university in 2019 (under the supervision of Nicolas Gisin).\n\nAfter a postdoc at ICFO (Barcelona\, Spain)\, he joined Inria Saclay in 2023. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:815@lincs.fr DTSTART;TZID=Europe/Paris:20240207T103000 DTEND;TZID=Europe/Paris:20240207T113000 DTSTAMP:20240419T093230Z URL:https://www.lincs.fr/events/an-introduction-to-anonymity-networks/ SUMMARY:An introduction to anonymity networks DESCRIPTION:Anonymity networks play a crucial role in preserving privacy on the Internet by masking users' identities and guaranteeing the confidentiality of communications. In this talk\, we will explore the origins of anonymisation networks through Chaum's seminal paper on mix networks [1]. Following this paper\, research in this area emerged and gave rise to four classes of anonymity networks [2]\, those based on mixnets\, those based on Tor and Onion Routing [3\,4]\, those based on random walks and DHTs\, and those based on DCNets [5]. There are others that fall into several classes [2].\nWe will present some popular networks from these classes and use them in a practical way to connect to different services.\n\n--\nReferences\n\n[1] D. Chaum\, Untraceable electronic mail\, return addresses\, and digital pseudonyms\, Communications of the ACM\, vol. 24\, no. 2\, pp. 84–90\, Feb. 1981\, doi: 10.1145/358549.358563. Available at: https://www.doi.org/10.1145/358549.358563\n[2] F. Shirazi\, M. Simeonovski\, M. R. Asghar\, M. Backes\, and C. Diaz\, A Survey on Routing in Anonymous Communication Protocols\, ACM Computing Surveys\, vol. 51\, no. 3\, p. 51:1-51:39\, Jun. 2018\, doi: 10.1145/3182658. Available at: https://lirias.kuleuven.be/bitstream/123456789/626536/2/a51-shirazi.pdf\n[3 ] R. Dingledine\, N. Mathewson\, and P. Syverson\, Tor: The Second-Generation Onion Router\, Defense Technical Information Center\, Fort Belvoir\, VA\, Jan. 2004. doi: 10.21236/ADA465464. Available at: https://apps.dtic.mil/sti/citations/ADA465464\n[4] D. M. Goldschlag\, M. G. Reed\, and P. F. Syverson\, Hiding Routing information\, in Information Hiding\, R. Anderson\, Ed.\, in Lecture Notes in Computer Science. Berlin\, Heidelberg: Springer\, 1996\, pp. 137–150. doi: 10.1007/3-540-61996-8_37. Available at: https://www.doi.org/10.1007/3-540-61996-8_37\n[5] D. Chaum\, The dining cryptographers problem: Unconditional sender and recipient untraceability\, J. Cryptology\, vol. 1\, no. 1\, pp. 65–75\, Jan. 1988\, doi: 10.1007/BF00206326. Available at: https://www.doi.org/10.1007/BF00206326\n\nSLIDES CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4B07\, 19 place Marguerite Perey\, Palaiseau\, Gabon X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, Gabon;X-APPLE-RADIUS=100;X-TITLE=Room 4B07:geo:0,0 END:VEVENT BEGIN:VEVENT UID:813@lincs.fr DTSTART;TZID=Europe/Paris:20240131T103000 DTEND;TZID=Europe/Paris:20240131T113000 DTSTAMP:20240226T102000Z URL:https://www.lincs.fr/events/everyone-procrastinates-a-beamer-demo/ SUMMARY:Everyone procrastinates: a Beamer demo DESCRIPTION:This tutorial delves into the intricacies of Beamer\, a powerful LaTeX document class designed for crafting presentations. We will explore basic and advanced features and customization options. Finally\, we will discover how to use Beamer for creating posters.\n\nhttps://overleaf.lincs.fr/read/psmtjjpmchcx#014e88\n\n \;\n \n \; CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:810@lincs.fr DTSTART;TZID=Europe/Paris:20240124T103000 DTEND;TZID=Europe/Paris:20240124T113000 DTSTAMP:20240115T163357Z URL:https://www.lincs.fr/events/understanding-quantum-computing-using-quir k-a-drag-and-drop-quantum-circuit-simulator-2/ SUMMARY:Understanding quantum computing using Quirk\, a drag-and-drop quantum circuit simulator - Quantum DESCRIPTION:Quirk (https://algassert.com/quirk) is a drag-and-drop quantum circuit simulator that is easy to use and very interesting to understand how quantum computers works. In this session\, I will use this tool to illustrate some quantum paradoxes. CATEGORIES:Network Theory,Working Group LOCATION:Salle 4A113 - TP @Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A113 - TP @Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:812@lincs.fr DTSTART;TZID=Europe/Paris:20240117T140000 DTEND;TZID=Europe/Paris:20240117T150000 DTSTAMP:20240122T122125Z URL:https://www.lincs.fr/events/data-poisoning-attacks-in-gossip-learning/ SUMMARY:Data Poisoning Attacks in Gossip Learning DESCRIPTION:Traditional machine learning systems were designed in a centralized man-ner. In such designs\, the central entity maintains both the machine learningmodel and the data used to adjust the model’s parameters. As data central-ization yields privacy issues\, Federated Learning was introduced to reducedata sharing and have a central server coordinate the learning of multiple devices.\n\nWhile Federated Learning is more decentralized\, it still relies on a centralentity that may fail or be subject to attacks\, provoking the failure of thewhole system. Then\, Decentralized Federated Learning removes the need fora central server entirely\, letting participating processes handle the coordina-tion of the model construction. This distributed control urges studying thepossibility of malicious attacks by the participants themselves.\n\nWhile poisoning attacks on Federated Learning have been extensively stud-ied\, their effects in Decentralized Federated Learning did not get the samelevel of attention. Our work is the first to propose a methodology to assesspoisoning attacks in Decentralized Federated Learning in both churn free andchurn prone scenarios. Furthermore\, in order to evaluate our methodologyon a case study representative for gossip learning we extended the gossipysimulator with an attack injector module.\n\nAdditional information\nThis presentation is about a work in submission by Alexandre Pham\, Maria Potop-Butucaru\, Sebastien Tixeuil and Serge Fdida. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:809@lincs.fr DTSTART;TZID=Europe/Paris:20240117T103000 DTEND;TZID=Europe/Paris:20240117T113000 DTSTAMP:20240122T114356Z URL:https://www.lincs.fr/events/understanding-quantum-computing-using-quir k-a-drag-and-drop-quantum-circuit-simulator-1/ SUMMARY:Understanding quantum computing using Quirk\, a drag-and-drop quantum circuit simulator - Basic DESCRIPTION:Quirk (https://algassert.com/quirk) is a drag-and-drop quantum circuit simulator that is easy to use and very interesting to understand how quantum computers works. In this session\, Ludovic Noirie will explain the basics of this tool\, illustrating how it woks on very small quantum circuits.\n\n\n\n\n CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Salle 4A113 - TP @Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A113 - TP @Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:799@lincs.fr DTSTART;TZID=Europe/Paris:20240110T140000 DTEND;TZID=Europe/Paris:20240110T150000 DTSTAMP:20240122T115221Z URL:https://www.lincs.fr/events/authentication-through-error-estimation-in -qkd/ SUMMARY:Authentication through error estimation in QKD DESCRIPTION:\n\nThe one-time pad is an encryption technique that is proven to be unbreakable by an eavesdropper. It relies on a single-use secret key shared between a sender and a receiver\, whose length is that of the message to be encrypted.\n\nThe creation of such a key can be achieved through Quantum Key Distribution (QKD)\, a method based on quantum physics that ensures eavesdroppers’ actions can be statistically detected with arbitrarily high probability. It requires a quantum channel for qubit transmission and a classical channel for classical bit transmission.\n\nHowever\, the classical channel is generally authenticated by classical means using cryptographic hash functions that are not provably secure. In this paper\, we propose for the first time a QKD protocol\, based on BB84\, that uses quantum error estimation to authenticate both channels.\n\nThis method relies on the consumption of a smaller pre-shared key\, and is provably secure thanks to fundamental results in both information theory and quantum physics.\n\n\nThis work is  a publication by Ludovic Noirie and Rémi Varloot (Nokia Bell Labs) at Globecom 2023: https://globecom2023.ieee-globecom.org/technical-program#S1569621407. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:811@lincs.fr DTSTART;TZID=Europe/Paris:20240110T103000 DTEND;TZID=Europe/Paris:20240110T113000 DTSTAMP:20240122T155512Z URL:https://www.lincs.fr/events/d3-js-tutorial-animating-a-card-game/ SUMMARY:D3.js tutorial: animating a card game DESCRIPTION:D3.js is a JavaScript library that facilitates the creation and animation of HTML and SVG content representing a (possibly dynamic) data structure. While clearly more involved than off-the-shelf solutions such as Chart.js or Highcharts\, it also provides more flexibility\, allowing us to define arbitrary representations for our data. In this tutorial\, we will learn the fundamentals of D3.js by creating a (minimalist) animation of a card game.\n\nhttps://github.com/rvarloot/lincs-d3js\n\n \; CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:794@lincs.fr DTSTART;TZID=Europe/Paris:20231220T103000 DTEND;TZID=Europe/Paris:20231220T113000 DTSTAMP:20240122T123339Z URL:https://www.lincs.fr/events/proving-and-analysing-security-protocols-w ith-tamarin-prover/ SUMMARY:Proving and analysing security protocols with Tamarin Prover DESCRIPTION:Tamarin Prover is an open source model checker for proving and verifying security protocols in the Dolev-Yao symbolic model\, initially developed at the Information Security Institute\, ETH Zürich. The verification algorithms implemented in Tamarin enable unbounded verification and falsification of the security properties of a protocol to be analysed. Tamarin supports XOR and Diffie-Hellmann exponentiation and has been used to analyse widely deployed protocols such as TLS 1.3 [1\, 2\, 3]\, 5G authentication [4\, 5\, 6] or the IEEE 802.11 WPA2 protocol [7] and its patched version against the KRACK attack [8].\n\nIn this session we will get to grips with the tool\, formally model protocols\, adversaries\, security properties and understand the mathematical logic behind these properties. The structure of the presentation follows that of the Tamarin manual.\n\nThe presentation is an adapted material from the Tamarin Prover's manual and is available under the CC BY-NC-SA 4.0 license.\n\nSlides\n\nPrerequisites for the participants who want to use the tool:\n- Windows: install Windows Subsystem for Linux (WSL) - https://learn.microsoft.com/en-gb/windows/wsl/install\, then install Homebrew - https://brew.sh/\n- macOS &\; Linux: install Homebrew - https://brew.sh/\n\nWebsite: https://tamarin-prover.com/\nUser manual: https://tamarin-prover.com/manual/\nTeaching materials: https://github.com/tamarin-prover/teaching\nGoogle Groups: https://groups.google.com/g/tamarin-prover\nSource code: https://github.com/tamarin-prover/tamarin-prover\nLicense: GNU GPL v3\n\nResearch materials: https://tamarin-prover.com/#research_papers_and_theses\n\n---\nReferences:\ n\n[1] C. Cremers\, M. Horvat\, S. Scott and T. van der Merwe\, Automated Analysis and Verification of TLS 1.3: 0-RTT\, Resumption and Delayed Authentication\, 2016 IEEE Symposium on Security and Privacy (SP)\, San Jose\, CA\, USA\, 2016\, pp. 470-485\, doi: 10.1109/SP.2016.35. Available at: https://ieeexplore.ieee.org/abstract/document/7546518\n\n[2] V. Stettler\, Formally Analyzing the TLS 1.3 proposal\, Bachelor thesis\, ETH Zürich\, Switzerland\, 2016. Available at: https://ethz.ch/content/dam/ethz/special-interest/infk/inst-infsec/informat ion-security-group-dam/research/software/TLS-1.3_thesis_vincent_stettler.pd f\n\n[3] C. Cremers\, M. Horvat\, J. Hoyland\, S. Scott\, and T. van der Merwe\, A Comprehensive Symbolic Analysis of TLS 1.3\, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security\, CCS '17. New York\, NY\, USA\, 2017\, pp. 1773–1788. doi: 10.1145/3133956.3134063. Available at: https://dl.acm.org/doi/10.1145/3133956.3134063\n\n[4] D. Lanzenberger\, Formal Analysis of 5G Protocols\, Bachelor thesis\, ETH Zürich\, Switzerland\, 2017. Available at: https://ethz.ch/content/dam/ethz/special-interest/infk/inst-infsec/informat ion-security-group-dam/research/software/5G_lanzenberger.pdf\n\n[5] D. Basin\, J. Dreier\, L. Hirschi\, S. Radomirovic\, R. Sasse\, and V. Stettler\, A Formal Analysis of 5G Authentication\, Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security\, CCS '18. New York\, NY\, USA\, 2018\, pp. 1383–1396. doi: 10.1145/3243734.3243846. Available at: https://arxiv.org/pdf/1806.10360\n\n[6] C. Cremers and M. Dehnel-Wild\, Component-based formal analysis of 5G-AKA: channel assumptions and session confusion\, Network and Distributed System Security Symposium (NDSS)\, 2019\, doi: 10.14722/ndss.2019.23394. Available at: https://ora.ox.ac.uk/objects/uuid:650ef867-79e1-476d-a602-e7e28dc64970\n\n[ 7] C. Cremers\, B. Kiesl\, and N. Medinger\, A Formal Analysis of IEEE 802.11's WPA2: Countering the Kracks Caused by Cracking the Counters\, 29th USENIX Security Symposium (USENIX Security 20)\, 2020\, pp. 1–17. Available at: https://www.usenix.org/conference/usenixsecurity20/presentation/cremers\n\n [8] M. Vanhoef and F. Piessens\, Key Reinstallation Attacks: Forcing Nonce Reuse in WPA2\, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security\, CCS '17. New York\, NY\, USA\, Oct. 2017\, pp. 1313–1328. doi: 10.1145/3133956.3134027. Available at: https://papers.mathyvanhoef.com/ccs2017.pdf CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:779@lincs.fr DTSTART;TZID=Europe/Paris:20231213T140000 DTEND;TZID=Europe/Paris:20231213T150000 DTSTAMP:20241128T183938Z URL:https://www.lincs.fr/events/binomial-line-cox-processes-modeling-stree ts-across-a-city/ SUMMARY:Binomial Line Cox Processes - Modeling Streets Across a City DESCRIPTION:Acknowledgment: Joint work with Martin Haenggi (University of Notre Dame)\n\nThe current analysis of wireless networks whose transceivers are confined to streets is largely based on Poissonian models\, such as Poisson line processes and Poisson line Cox processes. We demonstrate important scenarios where a model with a finite and deterministic number of streets\, termed the binomial line process (BLP)\, is more accurate. We characterize the statistical properties of the BLP and the corresponding binomial line Cox process (BLCP) and apply them to analyze the performance of a network whose access points (APs) are deployed along the streets of a city. In order to obtain a fine-grained insight into the network performance\, we derive the meta-distribution of the signal-to-interference and noise ratio (SINR). Accordingly\, we investigate the mean local delay in transmission and the density of successful transmissions. These metrics\, respectively\, characterize the latency and coverage performance of the network and are key performance indicators of next-generation wireless systems.\n\nBio:\nGourab Ghatak is an Assistant Professor at the Department of Electrical Engineering at IIT Delhi\, where he is also affiliated with the Bharti School of Telecommunication Technology and Management. His research interests are stochastic geometry\, MAC-PHY cross-layer issues in beyond 5G\, and machine learning for wireless communications.\n\n \; CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:795@lincs.fr DTSTART;TZID=Europe/Paris:20231213T103000 DTEND;TZID=Europe/Paris:20231213T113000 DTSTAMP:20240122T154502Z URL:https://www.lincs.fr/events/ensemble-distillation-for-robust-model-fus ion-in-federated-learning/ SUMMARY:Ensemble distillation for robust model fusion in federated learning DESCRIPTION:Federated Learning (FL) attempts to protect the privacy of the participants in the scheme by uploading locally-trained models from edge devices to a server\, where they get combined into a global model and redistributed to the edge devices. In the established FL literature\, this combination usually happens by averaging\, which appears to limit the accuracy of the global model and introduces challenges in applying the scheme to heterogeneous devices with different model architectures.\n\nThe paper we will present in this session\, "Ensemble distillation for robust model fusion in federated learning"\, introduces model fusion techniques based on knowledge distillation that enable the simultaneous use of various local model sizes / architectures. Distillation also drastically improves the global accuracy compared to average-based methods such as FedAVG - still without compromising users' data privacy. The proposed scheme\, FedDF\, is faster to train and requires fewer communication rounds than previously published FL techniques. We liked this paper because it introduces a couple of nifty ideas that might also be profitably applied in other FL scenarios.\n\nReference\n\nTao Lin\, Lingjing Kong\, Sebastian U. Stich\, and Martin Jaggi. Ensemble distillation for robust model fusion in federated learning. In Proceedings of the 34th International Conference on Neural Information Processing Systems\, NIPS’20\, pages 2351–2363\, Red Hook\, NY\, USA\, December 2020. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:803@lincs.fr DTSTART;TZID=Europe/Paris:20231208T100000 DTEND;TZID=Europe/Paris:20231208T113000 DTSTAMP:20231220T141114Z URL:https://www.lincs.fr/events/wireless-network-optimization-from-algorit hm-design-to-field-trials/ SUMMARY:Wireless Network Optimization: From Algorithm Design to Field Trials DESCRIPTION:An overview of François Durand and Lorenzo Maggi's activities on beamforming\, energy savings\, radiation exposure mitigation\, and scheduling over the last few years.\n\nFrançois' slides\n\nLorenzo's slides CATEGORIES:Twin Lectures,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:798@lincs.fr DTSTART;TZID=Europe/Paris:20231206T103000 DTEND;TZID=Europe/Paris:20231206T113000 DTSTAMP:20231211T161816Z URL:https://www.lincs.fr/events/apt-managing-software-under-debian-based-g nu-linux-distributions/ SUMMARY:APT: managing software under Debian-based GNU/Linux distributions DESCRIPTION:APT (Advanced Package Tool) is the package manager used under Debian and any Linux distribution based on Debian (Ubuntu\, Mint\, etc.). APT is used needed to search\, install\, remove and update packages. It is also used to upgrade the system release.\n\nThe tutoriel will present all the related notions (releases\, mirror\, file organization). Then\, it will showcase many practical use cases and the corresponding commands (apt\, apt-file\, aptitude\, dpkg\, deborphan\, etc).\n\nThe participants are encouraged to install virtualbox and download an iso of debian to try themselves the practicals.\n\n[1] https://www.virtualbox.org/\n[2] https://cdimage.debian.org/debian-cd/current/amd64/iso-cd/debian-12.2.0-amd 64-netinst.iso\n\napt.md CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:801@lincs.fr DTSTART;TZID=Europe/Paris:20231201T100000 DTEND;TZID=Europe/Paris:20231201T120000 DTSTAMP:20231211T164419Z URL:https://www.lincs.fr/events/pushing-programmability-to-the-edge-and-be yond-the-evolutions-of-mobile-networks-architecture-towards-smart-radio-en vironments/ SUMMARY:Pushing Programmability to the Edge and beyond: the Evolutions of Mobile Networks Architecture towards Smart Radio Environments DESCRIPTION:\n\nThis talk precede the talk of Prof. Andrea Araldo "Technical and economic strategies for Multi-Tenant Edge Computing".\n\nThe evolution of the architecture of Mobile Radio Networks is going in the direction of "softwarization" of network functions and the disaggregation of the Radio Access Network (RAN).\n\nMoving from specialized hardware to general purpose servers for a fully distributed system requires deep changes in the physical infrastructure with a hierarchy of mini data centers to be deployed\, but creates interesting synergies with the evolution of the Cloud architecture which is pushing computation towards the edge of the network.\n\n\nEmbracing the cloud paradigm does not only allows to virtualize network functions but also  create opportunities to open programmable interfaces and to implement intelligent control strategies able to optimize resources and adapt to traffic needs.\n\n\nAt the extreme periphery of the radio access network the need to use of high frequencies is also modifying the architecture with new smart radio devices (such as Reflective Intelligent Surfaces or Network Controlled Repeaters) that can also be controlled through open programmable interface.\n\n\nThe seminar will present these evolution trends of the architecture of radio networks and pinpoint the research opportunities for defining new algorithms for optimizing network behavior. CATEGORIES:Seminars,Twin Lectures,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:800@lincs.fr DTSTART;TZID=Europe/Paris:20231130T140000 DTEND;TZID=Europe/Paris:20231130T150000 DTSTAMP:20231211T114348Z URL:https://www.lincs.fr/events/phd-thesis-defense-artificial-intelligence -for-resource-allocation-in-multi-tenant-edge-computing/ SUMMARY:Phd Thesis Defense : Artificial Intelligence for Resource Allocation in Multi-Tenant Edge Computing DESCRIPTION:\n\n\n\n\nWe consider in this thesis Edge Computing (EC) as a multi-tenant environment  where Net- work Operators (NOs) own edge resources deployed in base stations\, central oces and/or smart boxes\, virtualize them and let third party Service Providers (SPs) - or tenants - dis- tribute part of their applications in the edge in order to serve the requests sent by the users. SPs with heterogeneous requirements coexist in the edge\, ranging from Ultra-Reliable Low Latency Communications (URLLC) for controlling cars or robots\, to massive Machine Type Communication (mMTC) for Internet of Things (IoT) requiring a massive number of connected devices\, to media services\, such as video streaming and Augmented/Virtual Reality (AR/VR)\, whose quality of experience is strongly dependant on the available re- sources. SPs independently orchestrate their set of microservices\, running on containers\, which can be easily replicated\, migrated or stopped. Each SP can adapt to the resources allocated by the NO\, deciding whether to run microservices in the devices\, in the edge nodes or in the cloud. We aim in this thesis to advance the emergence of real deployments of the “true” EC in real networks\, by showing the utility that NOs can collect thanks to EC. We believe that this can contribute to encourage concrete engagement and investments engagement of NOs in EC. For this\, we point to design novel data-driven strategies that efficiently allocate resources between heterogeneous SPs\, at the edge owned by the NO\, in order to optimize its relevant objectives\, e.g.\, cost reduction\, revenue maximization and better Quality of Service (QoS) perceived by end users\, in terms of latency\, reliability and throughput\, while satisfying the SPs requirements.\n\nThis thesis presents a perspective on how NOs\, the sole owners of resources at the far edge (e.g.\, at base stations)\, can extract value through the implementation of EC within a multi-tenant environment. By promoting this vision of EC and by supporting it via quantitative results and analysis\, this thesis provides\, mainly to NOs\, findings that can influence decision strategies about the future deployment of EC. This might foster the emergence of novel low-latency and data-intensive applications\, such as high resolution augmented reality\, which are not feasible in the current Cloud Computing (CC) setting.\n\nAnother contribution of the thesis it that it provides solutions based on novel methods that harness the power of data-driven optimization. We indeed adapt cutting-edge tech- niques from Reinforcement Learning (RL) and sequential decision making to the practical problem of resource allocation in EC. In doing so\, we succeed in reducing the learning time of the adopted strategies up to scales that are compatible with the EC dynamics\, via careful design of estimation models embedded in the learning process. Our strategies are conceived in order not to violate the confidentiality guarantees that are essential for SPs to accept running their computation at the EC\, thanks to the multi-tenant setting.\n\n\n\n\n CATEGORIES:PhD Defense,Youtube LOCATION:Amphi 2\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi 2:geo:0,0 END:VEVENT BEGIN:VEVENT UID:802@lincs.fr DTSTART;TZID=Europe/Paris:20231129T140000 DTEND;TZID=Europe/Paris:20231129T150000 DTSTAMP:20231211T094325Z URL:https://www.lincs.fr/events/reinforcement-learning-and-optimization-fo r-an-energy-and-resource-efficient-5g-slicing/ SUMMARY:Reinforcement Learning and optimization for an energy and resource efficient 5G slicing DESCRIPTION:This talk\, which will be the rehearsal of my thesis\, addresses resource allocation problems in 5G networks. Our objective is to leverage network slicing (e.g. the set of techniques based on virtualization and network softwarization which allows the network operator to provide different amounts of resources to different tenants) in order to to improve the energy-efficiency and resource consumption of 5G networks\, while guaranteeing Quality of Service constraints. To do so\, we formulate and solve optimization problems at the different domains of the network: We are first concerned with the placement of slices in the core network. To solve the problem\, a new approach combining Monte Carlo Search and Neighborhood Search is formulated.\n\nWe show it accepts more core slices than state-of-the-art approaches for the core network placement problem. Then we shift the focus to energy efficiency in resource allocation in 5G networks shared between Physical Network Operators (PNOs) and Mobile Virtual Network Operators (MVNOs). This framework jointly considers software component placement\, user request routing\, and resource dimensioning while meeting Service Level Agreements (SLAs) based on latency and reliability constraints.\n\nThrough Column Generation\, we obtain exact solutions\, demonstrating energy savings of up to 50\\% in real networks compared to existing placement or resource minimization algorithms. Finally\, we delve into the realm of energy optimization in Integrated Access and Backhaul (IAB) networks\, a key component of dense 5G deployments. Leveraging the Open Radio Access Network (O-RAN) framework\, our model minimizes active IAB nodes while ensuring a minimum capacity for User Equipment (UE).\n\nFormulated as a binary nonlinear program\, this approach reduces RAN energy consumption by 47\\%\, while maintaining Quality-Of-Service for UEs. Overall\, this thesis provides novel algorithms for improving resource and energy efficiency of 5G network slicing. Such improvement is studied in different parts of the network\, from the core up to the access network. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:793@lincs.fr DTSTART;TZID=Europe/Paris:20231129T103000 DTEND;TZID=Europe/Paris:20231129T113000 DTSTAMP:20231211T083531Z URL:https://www.lincs.fr/events/coverage-and-capacity-of-joint-communicati on-and-sensing-in-wireless-networks-2/ SUMMARY:Coverage and Capacity of Joint Communication and Sensing in Wireless Networks DESCRIPTION:\nJoint Communication and Sensing (JCAS) is a technology aiming at integrating both communication and sensing in one single system. It requires the  reevaluation of network performance from a multi-objective perspective.\n\nIn this reading group session\, we will see how to characterize and quantify the performance of JCAS using some information theoretic tools. To this end\, we'll need to give a formulation of sensing and communication coverage and  capacity\, which will be our metrics for performance. Using stochastic geometry\, we'll employ a network model that allows us to derive expressions for SINR and then deduce tractable bounds for making numerical computations.\n\nRéférence :\nCoverage and Capacity of Joint Communication and Sensing in Wireless Networks (2022) - Nicholas R. Olson\, Jeffrey G. Andrews\, and Robert W. Heath\, Jr.\n\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:776@lincs.fr DTSTART;TZID=Europe/Paris:20231122T140000 DTEND;TZID=Europe/Paris:20231122T150000 DTSTAMP:20231201T111844Z URL:https://www.lincs.fr/events/talk-by-masoud-hemmatpour/ SUMMARY:From Data Networks to Intelligent Networks: In-Network Computing's Promise DESCRIPTION:In-network computing technologies encompass a range of approaches and tools designed to enable computation and data processing within the network infrastructure\, such as Network Interface Card (NIC)\, and switches. The se technologies aim to reduce latency\, improve network efficiency\, and enhance the performance of distributed applications.\n\nIn this talk\, we will review the hardware and software technologies currently accessible forin-network computing. In our discussion\, we will outline the obstacles encountered in in-network computing and delve into the opportunities that this technology presents. Additionally\, we will explore a selection of applications that leverage in-network computing.\n\nBIO\nMasoud Hemmatpour is a Research Scientist at Simula Research Laboratory (SRL) and a postdoctoral fellow at the Arctic University of Norway (UiT). His research interests include memory access over High-Performance Computing (HPC) interconnect (e.g.\, InfiniBand\, RoCE\, and PCIe) and in-network computing. CATEGORIES:Seminars,Youtube LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:792@lincs.fr DTSTART;TZID=Europe/Paris:20231122T103000 DTEND;TZID=Europe/Paris:20231122T113000 DTSTAMP:20231201T111546Z URL:https://www.lincs.fr/events/gossip-learning-with-linear-models-on-full y-distributed-data/ SUMMARY:Gossip learning with linear models on fully distributed data DESCRIPTION:In the realm of distributed machine learning\, a novel approach called Gossip Learning\, was presented in 2013 by the paper "Gossip Learning with Linear Models on Fully Distributed Data"[1]. Gossip Learning introduces a decentralized communication framework among nodes\, allowing them to collaboratively train a machine learning model without the need for a central aggregator. This decentralized paradigm offers advantages in scalability\, fault tolerance\, and privacy preservation.\n\nThe presentation will delve into the key components of Gossip Learning\, highlighting the communication protocol that enable nodes to exchange information in a gossip-like fashion\, the convergence properties of Gossip Learning and its resilience to node failures.\nAdditionally\, the presentation will discuss comparisons with traditional centralized learning approaches (and federated learning approaches).\n\nReferences:\n\n[1] Ormándi\, R.\, Heged?s\, I.\, &\; Jelasity\, M. (2013). Gossip learning with linear models on fully distributed data. Concurrency and Computation: Practice and Experience\, 25(4)\, 556-571.\nhttps://arxiv.org/abs/1109.1396 CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:804@lincs.fr DTSTART;TZID=Europe/Paris:20231117T140000 DTEND;TZID=Europe/Paris:20231117T160000 DTSTAMP:20231211T162946Z URL:https://www.lincs.fr/events/3gpp-standardization-at-nokia-bell-labs-an d-its-interactions-with-research-part-2/ SUMMARY:Twin talk part 2 : 3GPP Standardization at Nokia Bell Labs and Its Interactions with Research DESCRIPTION:Luis Uzeda-Garcia and Stefano Paris will survey the topics of current and future interest to 3GPP. CATEGORIES:Twin Lectures LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:797@lincs.fr DTSTART;TZID=Europe/Paris:20231116T140000 DTEND;TZID=Europe/Paris:20231116T150000 DTSTAMP:20231115T101812Z URL:https://www.lincs.fr/events/systemx-attacks-trust-in-connected-network s-secure-behavioral-models/ SUMMARY:#SystemX : Attacks & trust in connected networks: secure behavioral models DESCRIPTION:A System X seminar. Please find all details and the registration form on the organiser's website :\n\nhttps://www.irt-systemx.fr/evenements/lyes-khoukhi-animera-un-seminars ystemx-le-16-novembre-2023/ CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:789@lincs.fr DTSTART;TZID=Europe/Paris:20231115T103000 DTEND;TZID=Europe/Paris:20231115T113000 DTSTAMP:20231121T135029Z URL:https://www.lincs.fr/events/poetry-package-helper-3/ SUMMARY:Developing Python packages with Poetry and Package Helper 3 DESCRIPTION:When you develop a Python project\, it is highly recommended that you design it as a Python package\, which gives you access to a variety of powerful development tools. With Package Helper 3 (https://balouf.github.io/package-helper-3/)\, it is easy and fast to do it! Things will go this way:\n\n PH3 helps you to create the file structure of your package in less than a minute.\n Using PyCharm\, you can out-of-the-box:\n\n Generate the documentation locally\,\n Run tests\,\n Have a “coverage” page\, which displays what parts of the package are covered by the tests.\n\n\n Your project is hosted on GitHub\, which is configured to automatically run the tests with several versions of Python and to automatically generate and publish the documentation.\n When desired\, GitHub publishes your package on PyPI\, so that any Python user can install it.\n\nUnder the hood\, the management of your package will be performed by Poetry\, a modern tool that unifies and simplifies the tasks required to develop a package\, such as installing a dedicated development environment\, making installation easy for other users\, building wheels\, managing and updating dependencies...\n\nTutorial: https://balouf.github.io/package-helper-3/tutorial.html. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Salle 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:778@lincs.fr DTSTART;TZID=Europe/Paris:20231108T140000 DTEND;TZID=Europe/Paris:20231108T150000 DTSTAMP:20231121T134846Z URL:https://www.lincs.fr/events/performance-of-analysis-of-ris-assisted-mi mo-ofdm-cellular-network-based-on-matern-cluster-processes/ SUMMARY:Performance Analysis of RIS-assisted MIMO-OFDM Cellular Networks Based on Matern Cluster Processes DESCRIPTION:Reconfigurable Intelligent Surfaces (RIS) technology are a promising physical-layer candidate for sixth-generation (6G) cellular networks. This paper provides a system-level performance assessment of RIS-assisted multi-input multi-output (MIMO) cellular networks in terms of downlink  coverage probability and ergodic rate.\n\nTo capture the inherent randomness in the spatial deployments of both Base Stations (BSs) and RISs\, we propose a new stochastic geometry model for such systems based on the Matern Cluster Process (MCP).  This model consists in randomly distributed RISs around BSs\, whose placement is according to a Poisson Point Process (PPP). The RISs provide the multipath diversity and the multiple antenna receiver provide the antenna diversity.\n\nThe system is assumed to use the orthogonal frequency division multiplexing (OFDM) technique to modulate the former and employ the maximal ratio combining (MRC) technique at the receiver to exploit the latter. We show that the coverage probability and the ergodic rate can be evaluated when considering RISs operate as batched powerless beamformers.\n\nThe resulting analytical expressions provide a generic methodology to evaluate the impact of key RIS-related parameters\, such as the size of RIS and the density of nodes\, on system level performance. Numerical evaluations of the analytical expressions and Monte-Carlo simulations jointly validate the proposed analytical approach and provide valuable insights into the design of future RIS-assisted radio cellular networks. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:796@lincs.fr DTSTART;TZID=Europe/Paris:20231108T103000 DTEND;TZID=Europe/Paris:20231108T113000 DTSTAMP:20231121T134744Z URL:https://www.lincs.fr/events/the-projection-method/ SUMMARY:The Projection Method: A Unified Framework for Community Detection DESCRIPTION:We present the class of projection methods for community detection that generalizes many popular community detection methods. In this framework\, we represent each clustering (partition) by a vector on a high-dimensional hypersphere. A community detection method is a projection method if it can be described by the following two-step approach:\n\n the graph is mapped to a query vector on the hypersphere\;\n the query vector is projected to the set of clustering vectors.\n\nThis last projection step is performed by minimizing the distance between the query vector and the clustering vector\, over the set of clusterings. This setup generalizes many popular community detection methods\, including the maximization of modularity\, Markov stability and the likelihood of several models.\n\nWe show that these different methods suffer from the same granularity problem: they have parameters that control the granularity of the resulting clustering\, but choosing these to obtain clusterings of the desired granularity is nontrivial. We provide a general heuristic to address this granularity problem\, which can be applied to any projection method. Finally\, we show how\, given a generator of graphs with community structure\, we can optimize a projection method for this generator in order to obtain a community detection method that performs well on this generator. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:805@lincs.fr DTSTART;TZID=Europe/Paris:20231103T100000 DTEND;TZID=Europe/Paris:20231103T120000 DTSTAMP:20231211T162907Z URL:https://www.lincs.fr/events/3gpp-standardization-at-nokia-bell-labs-an d-its-interactions-with-research-part-1/ SUMMARY:Twin talk part 1 : 3GPP Standardization at Nokia Bell Labs and Its Interactions with Research DESCRIPTION:Luis Uzeda-Garcia and Stefano Paris will survey the topics of current and future interest to 3GPP. CATEGORIES:Twin Lectures LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:790@lincs.fr DTSTART;TZID=Europe/Paris:20231025T103000 DTEND;TZID=Europe/Paris:20231025T113000 DTSTAMP:20231102T134228Z URL:https://www.lincs.fr/events/opportunistic-federated-learning-an-explor ation-of-egocentric-collaboration-for-pervasive-computing-applications/ SUMMARY:Opportunistic Federated Learning: An Exploration of Egocentric Collaboration for Pervasive Computing Applications. DESCRIPTION:Federated learning (FL) is an emerging distributed learning technique\, through  which models can be trained using the data collected by user devices in resource-constrained situations while protecting user privacy. However\, FL has three main limitations: First\, the parameter server (PS)\, which aggregates the local models that are trained using local user data\, is typically far from users. The large distance may burden the path links between the PS and local nodes\, thereby increasing the consumption of the network and computing resources. Second\, user device resources are limited \, but this aspect is not considered in the training of the local model and transmission of the model parameters. Third\, the PS-side links tend to become highly loaded as the number of participating clients increases. The links become congested owing to the large size of model parameters.\nOne of the kind in Federated Learning\, opportunistic federated learning\, in which individual devices belonging to different users seek to learn robust models that are personalized to their user’s own experiences. However\, instead of learning in isolation\, these models opportunistically incorporate the learned experiences of other devices they encounter opportunistically. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Salle 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:787@lincs.fr DTSTART;TZID=Europe/Paris:20231018T153000 DTEND;TZID=Europe/Paris:20231018T163000 DTSTAMP:20231023T130512Z URL:https://www.lincs.fr/events/modeling-of-leo-satellite-constellation-an d-downlink-analysis-leveraging-cox-point-process/ SUMMARY:Modeling of LEO Satellite Constellation and Downlink Analysis Leveraging Cox Point Processes DESCRIPTION:This work develops an analytical framework for downlink low earth orbit (LEO) satellite communications\, leveraging tools from stochastic geometry. We propose a tractable approach to the analysis of such satellite communication systems accounting for the fact that satellites are located on circular orbits. We accurately characterize this geometric property of such LEO satellite constellations by developing a Cox point process model that jointly produces orbits and satellites on these orbits. Our work differs from existing modeling studies that have assumed satellites' locations as completely random binomial point processes. For this newly developed Cox model\, we derive the outage probability of the proposed network and the distribution of the signal-to-interference-plus-noise ratio (SINR) of an arbitrarily located user in the network. By presenting various key network performance metrics as functions of key network parameters\, this work allows one to assess the statistical properties of downlink LEO satellite communications and thus can be used as a system-level design tool. CATEGORIES:Seminars,Youtube LOCATION:Salle 4A113 - TP @Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A113 - TP @Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:781@lincs.fr DTSTART;TZID=Europe/Paris:20231018T140000 DTEND;TZID=Europe/Paris:20231018T150000 DTSTAMP:20231023T123949Z URL:https://www.lincs.fr/events/seminar-talk-by-daniel-diaz-lopez/ SUMMARY:Application of Chaos Engineering Techniques to Protect Cloud-based IoT Ecosystems DESCRIPTION:System security represents a big challenge for many organizations\, and it must be specifically handled when a system is intended to be deployed in a cloud environment. Cloud environments provide multiple security services that run over a Shared Responsibility Model that requires the participation of the cloud provider and the customer. Thus\, this talk presents an architecture based on Artificial Intelligence to support the finding of system threats and errors in an early stage and on Security Chaos Engineering methodology to reliably test the existence of such errors. This proposed architecture may help orientate better system designs and contribute to building holistic security. A particular use case is described to show how the proposal can be applied to protect Cloud-based IoT Ecosystems.\n\nShort Bio\nDaniel Díaz-López holds a Ph.D. in Computer Science from the University of Murcia (Spain)\, is visiting professor at New York University (NYU) and assistant professor at the University of Rosario. He has been professor for more than 7 years\, teaching different cybersecurity courses: Ethical Hacking\, Security in the Software Development Life Cycle\, Forensic Analysis and Incident Management\, Threat Intelligence\, Security in Enterprise Architecture\, Artificial Intelligence for Cybersecurity\, among others. Daniel is a cybersecurity researcher with different publications in journals and conferences around techniques for cyber threat intelligence\, privacy-preserving mechanisms\, secure software development lifecycle\, techniques in ethical hacking\, and security for the Internet of Things (IoT).\n\n \;\n\n \; CATEGORIES:Seminars,Youtube LOCATION:Salle 4A113 - TP @Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A113 - TP @Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:788@lincs.fr DTSTART;TZID=Europe/Paris:20231018T103000 DTEND;TZID=Europe/Paris:20231018T113000 DTSTAMP:20231103T155720Z URL:https://www.lincs.fr/events/tikz-introduction-how-to-draw-a-platypus/ SUMMARY:Tikz introduction: how to draw a platypus DESCRIPTION:Emma Caizergues will present Tikz\, which is a language for producing vector graphics.\nIn particular\, I will show the method to draw graph-like figures (graphs\, automata\, trees\, etc) and to plot functions.\nNo background in Tikz is required. This presentation is designed as a tutorial to take your first steps with Tikz.\n\nClick here to find the support of the presentation : tikz intro CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:806@lincs.fr DTSTART;TZID=Europe/Paris:20231013T100000 DTEND;TZID=Europe/Paris:20231013T120000 DTSTAMP:20231204T120123Z URL:https://www.lincs.fr/events/critical-real-time-in-cellular-networks/ SUMMARY:Critical real-time in cellular networks DESCRIPTION: CATEGORIES:Twin Lectures LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:785@lincs.fr DTSTART;TZID=Europe/Paris:20231011T103000 DTEND;TZID=Europe/Paris:20231011T113000 DTSTAMP:20231018T120512Z URL:https://www.lincs.fr/events/reading-group-on-network-theory-quantum-ne tworks-for-5-year-old-network-researchers/ SUMMARY:Quantum Networks for 5-Year-Old Network Researchers DESCRIPTION:The aim of this talk is to present a quick overview of quantum networks. It will focus on their uses\, how they operate\, and most importantly how they differ from “classical” networks\, and the new networking challenges this provides. Rest assured: no understanding of quantum physics/computing is required\, nor will you gain any from this talk!\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4A 101\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A 101:geo:0,0 END:VEVENT BEGIN:VEVENT UID:807@lincs.fr DTSTART;TZID=Europe/Paris:20231006T093000 DTEND;TZID=Europe/Paris:20231006T113000 DTSTAMP:20231204T120950Z URL:https://www.lincs.fr/events/launch-of-communication-network-day/ SUMMARY:Launch of Communication Network Day DESCRIPTION:This semester\, LINCS is organizing regular meetings on communication networks. These meetings take place on Fridays and are open to all LINCS members interested in these topics. The aim is to foster interactions among LINCS partners. This particular semester also allows them to engage with visiting Prof. Catherine Rosenberg from the University of Waterloo in Canada.\n\nNous nous réunissons vendredi 6 à 9h30 en Salle 4B01 dans le but de lancer de nouvelles activités du LINCS dans le domaine des réseaux de communications.\n\nNous prévoyons pour cette première réunion 20 minutes de présentation de Catherine Rosemberg et 5 minutes pour chacun d'entre vous.\n\n \; CATEGORIES:Twin Lectures END:VEVENT BEGIN:VEVENT UID:777@lincs.fr DTSTART;TZID=Europe/Paris:20231004T140000 DTEND;TZID=Europe/Paris:20231004T150000 DTSTAMP:20231018T090510Z URL:https://www.lincs.fr/events/seminar-talk-by-iain-burge/ SUMMARY:Toward Quantum Explainable AI: A Quantum Algorithm for Shapley Value Estimation DESCRIPTION:In the classical context\, the cooperative game theory\nconcept of the Shapley value has been adapted for post hoc explanations\nof Machine Learning models. This approach does not easily translate to\neXplainable Quantum Machine Learning. Finding Shapley values can be\nhighly computationally complex. In this joint work with Prof. Michel\nBarbeau (Carleton University) and Prof. Joaquin Garcia- Alfaro (Télécom\nSudParis)\, we propose a quantum algorithm which can extract Shapley\nvalues within some confidence interval. Our results perform in\npolynomial time. We demonstrate the validity of our approach under\nspecific examples of cooperative voting games.\n\nBio\nIain Burge is a research assistant at Carleton University\nworking in the emerging field of quantum explainable AI. He has an\nundergraduate degree in cognitive science with a concentration in\ncomputation and minor in mathematics. CATEGORIES:Seminars,Youtube LOCATION:Room 4A101\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A101:geo:0,0 END:VEVENT BEGIN:VEVENT UID:786@lincs.fr DTSTART;TZID=Europe/Paris:20231004T103000 DTEND;TZID=Europe/Paris:20231004T113000 DTSTAMP:20231004T115548Z URL:https://www.lincs.fr/events/reading-group-on-practical-networks-a-hand s-on-introduction-to-software-defined-radio-based-network-emulation/ SUMMARY:Colosseum - A hands-on introduction to software defined radio based network emulation DESCRIPTION:Abstract: We will have a session on the Colosseum SDN-based emulation platform\, which lies at the intersection of software-defined radio (SDR) and advanced network emulation technology. The Colosseum platform offers a fresh approach to wireless network experimentation\, making use of genuine radio hardware and advanced channel emulation to establish a versatile and realistic testing environment.\nIn this talk\, we will introduce you to the Colosseum platform and demonstrate how it empowers researchers and engineers to emulate complex wireless scenarios. We will dive into the practical aspects of using Colosseum to emulate a 5G network\, with various scenarios\, leveraging openairinterface to instantiate a real network\, and perform data collection. This session will equip you with the knowledge and skills needed to harness the power of Colosseum for your own network experiments. If we have time we will also cover the use of Colosseum for experimenting with other radio technologies such as WiFi.\n\nResources\n\nAn introduction to Colusseum can be found here:\nhttps://arxiv.org/pdf/2110.10617.pdf\n\nTutorial material on Colosseum can be found here:\nhttps://github.com/colosseum-wiot/colosseum-school-2023\nin particular\, slides are here:\nhttps://github.com/colosseum-wiot/colosseum-school-2023/tree/main/sl ides\n\nFurther resources:\nhttps://github.com/wineslab/colosseum-scope\nhttps://openrangym .com/ CATEGORIES:Practical Networks,Working Group LOCATION:Salle 4A101 - Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A101 - Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:784@lincs.fr DTSTART;TZID=Europe/Paris:20230926T150000 DTEND;TZID=Europe/Paris:20230926T170000 DTSTAMP:20230922T132021Z URL:https://www.lincs.fr/events/phd-thesis-defense-unimodularity-in-random -networks-applications-to-the-null-recurrent-doeblin-graph-and-hierarchica l-clustering/ SUMMARY:Phd Thesis Defense : Unimodularity in Random Networks: Applications to the Null Recurrent Doeblin Graph and Hierarchical Clustering DESCRIPTION:This thesis is based on the notion of unimodularity in the context of random networks and explores two domains of application: Coupling from the Past in the null recurrent case based on the associated Doeblin Graphs and unsupervised classification based on hierarchical clustering on point processes. The first part of this thesis focuses on the properties of a specific random graph called the Doeblin Graph\, which is associated with the Coupling from the Past algorithm used for perfect sampling of the stationary distribution of a Markov Chain. In the irreducible\, aperiodic\, and positive recurrent case\, it is known that the Bridge Doeblin Graph\, a subgraph of the Doeblin Graph\, is an infinite tree that is unimodularizable and contains a unique biinfinite path. This bi-infinite path plays a crucial role in constructing a perfect sample of the stationary state of the Markov chain. This thesis extends the study to the null recurrent case\, where it is shown that the Bridge Doeblin Graph is either an infinite tree or a forest composed of a countable collection of infinite trees. In the former case\, the infinite tree possesses a single end\, is not generally unimodularizable\, but exhibits local unimodularity. These properties are leveraged to investigate the stationary regime of measure-valued random dynamics on the Bridge Doeblin Tree\, particularly the taboo and potential random dynamics. The second part of this thesis introduces a novel hierarchical clustering model tailored for unsupervised classifications of datasets which are countably infinite. Clustering\, a widely used technique in unsupervised learning\, aims to identify groups within a dataset based on element similarities. The proposed algorithm employs multiple levels of clustering\, constructing clusters at each level using nearest-neighbor chains of points or clusters. This algorithm is applied to the Poisson point process\, and it is proven that the clustering algorithm defines a phylogenetic forest on the Poisson point process\, which is a factor of the point process and is therefore unimodular. Various properties of this random forest\, such as the mean sizes of clusters at each level or the mean size of the cluster of a typical node\, are examined. CATEGORIES:PhD Defense LOCATION:Inria\, salle Philippe Flajolet\, 2 rue Simone Iff\, Paris\, 75012\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=2 rue Simone Iff\, Paris\, 75012\, France;X-APPLE-RADIUS=100;X-TITLE=Inria\, salle Philippe Flajolet:geo:0,0 END:VEVENT BEGIN:VEVENT UID:782@lincs.fr DTSTART;TZID=Europe/Paris:20230925T140000 DTEND;TZID=Europe/Paris:20230925T170000 DTSTAMP:20230922T132037Z URL:https://www.lincs.fr/events/michel-davydovs-phd-thesis-defense-dynamiq ues-markoviennes-a-base-de-processus-ponctuels-et-leurs-applications/ SUMMARY:Phd Thesis Defense : Dynamiques markoviennes à base de processus ponctuels et leurs applications DESCRIPTION:In this thesis\, we are interested in mathematical models of phenomena that can be interpreted as network dynamics. This includes for example neuron population models in which neurons interact at random times with their neighbors or epidemics propagation where infected or susceptible individuals move from town to town. The mathematical description of such phenomena generally requires a compromise between physical or biological relevance and mathematical tractability. The main focus of this work is the elaboration of mathematical proofs to justify the introduction of models taking into account the geometry of the underlying networks whilst preserving tractability. The main mathematical tool for that purpose is the replica-mean-field\, which consists in copies of the studied network between which interactions are routed randomly. The main results of this thesis concern the behavior of such a dynamical system when the number of replicas goes to infinity. In various settings\, we show that it concerges to dynamics under the Poisson Hypothesis\, that is\, interaction times are replaced by independent Poisson processes\, which allows to obtain closed forms in certain models. CATEGORIES:PhD Defense LOCATION:Inria\, salle Jacque-Louis Lion\, 2 rue Simone Iff\, Paris\, 75012 \, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=2 rue Simone Iff\, Paris\, 75012 \, France;X-APPLE-RADIUS=100;X-TITLE=Inria\, salle Jacque-Louis Lion:geo:0,0 END:VEVENT BEGIN:VEVENT UID:783@lincs.fr DTSTART;TZID=Europe/Paris:20230918T140000 DTEND;TZID=Europe/Paris:20230918T170000 DTSTAMP:20230922T132229Z URL:https://www.lincs.fr/events/bharath-roy-choudhury-s-phd-thesis-defense -records-of-stationary-processes-and-unimodular-graphs/ SUMMARY:Phd Thesis Defense : Records of stationary processes and unimodular graphs DESCRIPTION:Consider a navigation rule defined on a graph that maps every vertex of\nthe graph to a vertex in such a way that the navigation rule commutes\nwith every automorphism of the graph. It is to say that the navigation\nrule applied to the vertices remains the same after taking any\nautomorphism of the graph. Such a navigation rule is said to have the\ncovariance property. This study delves into a collection of such\ncovariant navigation rules\, indexed by locally finite graphs\, and\nsubject to a measurability condition. This ensemble of rules is termed a\nvertex-shift. More generally\, one can consider vertex-shifts on\nnetworks\, graphs that have labels on edges and on vertices. A\nvertex-shift induces a dynamic on the space of locally finite rooted\nnetworks. The central focus of this work lies in investigating the\ndynamic associated to a specific navigation rule called the record\nvertex-shift. It is defined on the trajectories of any one dimensional\ndiscrete random walk whose increments have finite mean and the random\nwalk can jump only one step to the left. Additionally\, the work includes\nseveral notable results concerning record vertex-shifts applied to\nprocesses with stationary increments. The thesis also contains results\non more general vertex-shifts on unimodular networks. CATEGORIES:PhD Defense LOCATION:Inria\, salle Gilles Hahn\, 2 rue Simone Iff\, Paris\, 75012\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=2 rue Simone Iff\, Paris\, 75012\, France;X-APPLE-RADIUS=100;X-TITLE=Inria\, salle Gilles Hahn:geo:0,0 END:VEVENT BEGIN:VEVENT UID:780@lincs.fr DTSTART;TZID=Europe/Paris;VALUE=DATE:20230918 DTEND;TZID=Europe/Paris;VALUE=DATE:20230928 DTSTAMP:20230919T124944Z URL:https://www.lincs.fr/events/erc-nemo-workshop-8-days-on-network-mathem atics/ SUMMARY:ERC NEMO Workshop : 8 Days on Network Mathematics DESCRIPTION:Between September 18th and September 27th\, our partner INRIA is hosting a two-week informal international workshop with a primary focus on stochastic networks\, spatial stochastic processes\, and their dynamic aspects. The workshop will feature three thesis defenses and a series of one-hour lectures delivered by active researchers in this domain.\n\nTitles and abstracts\nClic here to find all details and registration form on the organiser's website.\n\n \; CATEGORIES:Other Worshops LOCATION:INRIA Paris\, 2 rue Simone Iff\, Paris.\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=2 rue Simone Iff\, Paris.\, France;X-APPLE-RADIUS=100;X-TITLE=INRIA Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:772@lincs.fr DTSTART;TZID=Europe/Paris:20230705T093000 DTEND;TZID=Europe/Paris:20230706T180000 DTSTAMP:20230816T151229Z URL:https://www.lincs.fr/events/2023-lincs-annual-workshop/ SUMMARY:2023 LINCS Annual Workshop DESCRIPTION:The LINCS organizes its Annual Workshop with the Scientific Committee.\n**PROGRAM** (<\;= click)\n§ LINK to the SLIDES FOLDER \n\n \;\n\nA 2-day workshop with:\n\n LINCS members "scientific highlights"\n Scientific Committee members invited talks\n PhD students "elevator pitch" session + posters\n\nWe'll have coffe-breaks just outside the Amphi Rose Dieng and we'll have lunch at the cantine of Télécom-Paris.\n\nOn the evening of Wednesday July 5th we'll have a shuttle bringing us from Palaiseau to Jussieu (Paris 5e arr.) for a dinner cocktail on top of the Zamansky Tower.\nConfirmed talks by members of the Scientific Committee who will be in Palaiseau:\n\n Prof. Marco Ajmone Marsan (Politecnico di Torino)\n Prof. Nick Bambos (Stanford University)\n Prof. Roch Guerin (Washington University in Saint Luis)\n Prof. Patrick Thiran (EPFL)\n\nConfirmed talks by members of the Scientific Committee who will be connected via Zoom:\n\n Prof. Leandros Tassiulas (Yale University)\n\nScientific Committee members' titles+abstracts:\nProf. Marco Ajmone-Marsan (Politecnico di Torino)\nTitolo: Equalizing end user access to edge-based services\n\nAbstract: We consider a portion of a RAN where end-users access services that imply the issue of a request through their associated base station (BS)\, followed by a computation on one of the available in-network computing facilities\, and finally by the return of the result of the computation to the end-user who issued the request. The result must be returned within a specified latency deadline in order to be useful.\n\nSince not all BSs are equipped with a computing facility\, some end-users may be disadvantaged\, because they are associated with a BS from which the delay for a service request to reach a computing facility and for the results of the computation to come back is longer.\nAiming at uniform end-user satisfaction\, network operators should strive to on the one hand reduce differences in achieved end-user performance\, while on the other obtain an efficient use of network resources.\nWith simple analytical models we investigate the effectiveness of light network management algorithms\, consisting in carefully choosing the routing probabilities of service requests toward one of the available computing facilities. We argue that at least some of such light network management algorithms should be compatible with the very stringent European Network Neutrality rules\, and we show that they allow a good trade-off between overall resource utilization and equal performance experienced by end-users.\n\n\nProf. Nick Bambos (Stanford University)\nTitle: Controlling Epidemics in Random Environments via Testing\n\n\n\nAbstract: We model epidemic spreading (e.g. of pathogens\, rumors/misinformation) in a population within a large region. We allow for mobility of infected individuals\, who can infect others while roaming around. We distribute testing centers around the region\, where individuals testing positive are quarantined. Infected and recovered individuals cannot be reinfected in the current epidemic wave. The infection transmission rate (infectivity) is a random field over the region\, for example\, due to various counter-measures (e.g. masking and social distancing in the case of airborne pathogens).We infinitesimally seed the infection in the large region and explore conditions under which it inherently spreads (as opposed to dying out). We observe that the average infectivity is not enough to characterize spreading and fluctuations do matter\; indeed\, even under subcritical averages\, overcritical infectivity fluctuations can cause the infection to spread. We then focus on the impact of testing center density on suppressing an epidemic that has the inherent potential to spread. Finally\, we discuss how to optimize testing vs. recovery resources.\n\n*Joint work with Petros Meramveliotakis and Prof. Aris Moustakas (Univ. of Athens\, Greece) and Kyriakos Lotidis (Stanford).\n\n\n\n\nProf. Roch Guerin (Washington University in Saint Luis)\nTitle:  On the benefits of proactively changing traffic profiles*§\n\nAbstract:  Token buckets are commonly used to specify traffic profiles and there is a growing number of network environments where hard delay bounds are required (e.g.\, as in the DetNet or TSN standards).  In this talk\, we explore the extent to which it may be beneficial to modify up-front the traffic profiles originally specified by users\, i.e.\, "reprofile" them\, while still delivering the end-to-end delay bounds they require albeit with fewer network resources (less bandwidth).  The answer depends on the type of schedulers available in the network\, and in the degenerate one-hop case\, it is known that reprofiling is of no benefit when optimal schedulers (EDF) are available. We explore whether this also holds in a more general network setting and demonstrate that it does not.  However\, devising optimal reprofiling solutions\, unfortunately\, appears intractable.  As a result\, we explore and evaluate heuristics for networks with both EDF and FIFO schedulers.  In the latter case\, a simple strategy appears to perform well.\n\n* Joint work with Jiaming Qiu (WashU)\, Henry Sariowan (Google)\, and Jiayi Song (WashU\, now at ByteDance)\n\n§Some of this work is still in progress\n\n \;\nProf. Patrick Thiran (EPFL)\nTitle: Source location in random networks: the noisy case.\n\nAbstract: Last year\, I surveyed recent results on the location of the source of a diffusion or of an epidemics in a network\, given the infection data gathered at some of the nodes\, when the propagation delays along the edges of the network are deterministic. In this follow-up talk\, I will survey some early results on the more complex case\, when propagation delays are i.i.d. Gaussian random variables. We compare two sensor placement strategies: either all the sensors are placed at once\, before the diffusion starts (off-line placement) or they are placed sequentially\, as the diffusion unfolds in the network (on-line placement). The on-line placement strategy consumes obviously fewer sensors than an off-line placement\, but the difference is very small when the propagation delays are deterministic and the network is an Erdos-Renyi random graph. In contrast\, when the propagation delays have a sufficiently large variance\, the difference can be huge: from the order of n to log log n\, for a linear graph of n nodes. This is a joint work with Gergely Odor and Victor Lecomte.\nLINCS members scientific highlights:\nfrancois baccelli (inria)\nTitle: Cox Point Processes for Multi-Altitude LEO Satellite Networks\n\nAbstract: We propose a simple analytical approach to describe the locations of low earth orbit (LEO) satellites based on a Cox point process. We develop a variable-altitude Poisson orbit process by accounting for the fact that satellites are always located on circular orbits and these orbits may have different altitudes. Then\, the satellites on these orbits are modeled as the Poisson point processes conditionally on the orbit process. For this model\, we derive the distribution of the distance to the nearest visible satellite\, the outage probability\, the Laplace functional of the proposed satellite Cox point process\, and the Laplace transform of the interference under a general fading. The derived statistics allow one to evaluate the performance of such LEO satellite communication systems as functions of network parameters.\n\n \;\nLUDOVIC NOIRIE (Nokia)\nTitle: Quantum networking at LINCS\n\nAbstract: Quantum networking is an emerging scientific domain. Quantum networks are distributed systems of quantum devices that utilize fundamental\nquantum mechanical phenomena such as superposition\, entanglement\, and\nquantum measurement to achieve capabilities beyond what is possible with\nclassical networks. The potential applications of quantum networks are\nquantum cryptography (Quantum Key Distribution)\, quantum consensus\,\nprivacy-preserving quantum computing or distributed quantum computing\napplications. In this talk\, we will describe the past\, current and\nfuture activities at LINCS related to this prospective research domain\non quantum networking.\n\n \;\nLEONARDO LINGUAGLOSSA (Télécom-Paris)\nTitle: Inference of network characteristics using non-invasive data exploration\n\nAbstract: Recent years witnessed a trend of "softwarization" of network components. Instead of static\, expensive hardware\, operators have started to adopt a more flexible approach based on Virtual Network Functions. This paradigm (aka Network Function Virtualization) advocates implementing network middleboxes such as firewalls or NATs as pieces of software to be deployed and executed on commercial off-the-shelf (COTS) hardware. This has boosted the development of several packet processing frameworks and software switches\, which show nowadays multi 10-Gbps capabilities in COTS servers. In parallel\, network systems are increasingly adopting machine learning (ML) techniques to solve complex networking tasks such as traffic classification or resource allocation.\n\nAs ML techniques require a large amount of data to be collected for both training and validation\, when done in software\, such measurements can highly affect the measured values\, thus biasing the collected data. The intensity of this becomes stronger when measurements are taken close to the data path. Second\, even after the training phase\, complex model calculations may require dedicated hardware such as external GPUs or custom hardware designed for neural network processing such as TPUs or VPUs.\nIn this talk\, we present a novel approach based on non-invasive data collection relying on pure software.\n\n\nOur methodology consists in (i) low-impact network measurements with both direct and indirect observations\; (ii) inference/predictive modeling of a complete system with ML and/or classical approaches\; (iii) deployment of low-resource models for runtime query/action operations and automated recovery. The project (acronym: IONOS-DX) has received an individual grant from the ANR (French Agency of Research).\n\n \;\n\n\nALONSO SILVA (Nokia)\nTitle: Predicting network hardware faults through layered treatment of alarms logs\n\nAbstract: Maintaining and managing ever more complex telecommunication networks is an increasingly complex task\, which often challenges the capabilities of human experts. There is a consensus both in academia and in the industry on the need of enhancing human capabilities with sophisticated algorithmic tools for decision-making\, with the aim of transitioning towards more autonomous\, self-optimizing networks. We aim at contributing to this larger project. We tackle the problem of detecting and predicting the occurrence of faults in hardware components in a radio access network\, leveraging the alarm logs produced by the network elements. We design a range of algorithmic solutions\, and we test them on real data\, collected from a major telecommunication operator. We are able to predict the failure of a network component\, with satisfying precision and recall.\n\n\nTIMUR FRIEDMAN (Sorbonne)\nTitle: Towards An Open Edge Cloud\n\nAbstract: Cloud services are moving to the edge. With 5G\, it is envisaged that telecom operators will have their own data centers. Services hosted in these data centers will be closer to their customers than they would be if they were hosted in classic large centralized data centers. These services will enjoy: lower latency\, higher bandwidth\, and no intermediate parties along the path. Quality of service will be higher\, and the responsibility for maintaining that quality of service will be clearer. At least\, that is the vision. But much of the architecture of this future edge cloud remains to be conceived. We offer one important brick: a container orchestration tool for the edge cloud. Our tool\, EdgeNet\, is an extension to Kubernetes\, the de facto standard for deploying containers to classic large centralized data centers. EdgeNet takes into account the particular nature of the edge cloud: there will be many providers of edge clouds\; and there will be many customers that need to share more limited resources in each cloud. We describe the EdgeNet vision\, the components that we have built\, and those that remain to be built.\n\nThis talk presents the work of Berat Senel\, which formed the basis of the doctoral dissertation that he defended in June 2023 at Sorbonne Université.\n\n \;\nKE FENG (Inria)\nTitle: Spatial Network Calculus and Performance Guarantees in Wireless NetworksAbstract: Network calculus is initially a methodology allowing one to provide performance guarantees in queuing networks subject to regulated traffic arrivals and service guarantees. It is a key design tool for latency-critical wireline communication networks where it allows one to e.g. guarantee bounds on the end-to-end latency of all transmitted packets. In wireless networks\, service guarantees are more intricate as electromagnetic signals propagate in a heterogeneous medium and interfere each other. In this work\, we present a novel approach toward performance guarantees for all links in arbitrarily large wireless networks. We introduce spatial regulation properties for stationary spatial point processes\, and develop the first steps of a calculus for this type of regulation.\n\n \;\nfabien mathieu (invited inria)\nTitle: Corsort: An anytime sorting algorithm\n\nAbstract:  An anytime algorithm is an algorithm that is able to give an estimation of the result after each step of execution. Ee study the problem of anytime sorting. We consider that each comparison is a step of execution\, and we measure the proximity between the estimation and the sorted list with the Kendall tau distance. We present Corsort\, a family of anytime sorting algorithms using estimators. By simulation\, we show that a well-configured Corsort has a quasi-optimal termination time\, and gives better estimations than the other algorithms of our benchmark.\n\n \;\n\nSWAPNIL DHAMAL (Télécom-SudParis)\nTitle: Resource Allocation and Pricing for Network Slicing in 5G: A Learning Perspective\n\nAbstract: Network slicing is a critical component in 5G networks\, since the intended services such as Ultra Reliable Low Latency Communications (URLLC) and enhanced Mobile BroadBand (eMBB) give rise to very distinct requirements. Each slice can be customized for a given type of service\, and a given tenant who is characterized by a stochastic demand and a resource utility function reflecting its Quality-of-Service (QoS) requirements. In this work\, we study the techno-economic aspect of the slice market that involves the operator and the tenants (slice owners). In particular\, the game that we study is a Stackelberg game\, where the operator is the leader who presents a pricing scheme that defines the price corresponding to each bandwidth-level\, and the tenants are the followers who decide which bandwidth-level to request. Since the operator has a certain capacity constraint\, it takes the requested bandwidth-levels of the tenants into account\, and determines the admission control and resource allocation such that its expected profit is maximized while satisfying the capacity constraint. Our framework models the joint admission control\, resource allocation\, and pricing for network slicing in the above game\, as an optimization problem aiming to maximize the operator’s expected profit. We show that solving the formulated optimization problem is NP-hard. We also encounter a paradox that the operator's profit could decrease if a tenant’s resource utility increases. We consider a practical scenario where the utility matrix\, comprising the resource utilities of the tenants for the different bandwidth-levels\, are not known to the operator. We propose several approaches for learning an optimal pricing scheme\, including a neural network-based approach\, as well as approaches based on iteratively updating and refining the ambiguity set of utility matrices by observing the tenants’ requested bandwidth-levels corresponding to the presented pricing schemes. We study the performance of the various approaches and present insights.\n\n\n \;\nTIANZHU ZHANG (Nokia)\nTitle: Causal Reasoning for configurable network systems\n\nAbstract: With the rapid advancement in B5G\, IoT\, and network softwarization\, modern ICT network systems are becoming increasingly diverse\, disaggregated\, and complex. Consequently\, understanding and managing these systems has thus become a daunting task. Although AI/ML techniques can lend sound predictive services\, they need more robust\, counterfactual reasoning and decision-making. In this talk\, I will present our ongoing work exploring causal research for network diagnosis and optimization. Our study focuses on real-world systems capable of processing network traffic at extremely high speed\, e.g.\, 10-100 Gbps. We take two paths to approach causal reasoning: i) causal discovery from observational/interventional data and ii) causal inference for insight extraction. The ultimate goal is to implement a generic\, robust\, production-ready toolset that can effectively uncover performance bottlenecks and guide optimizations for different network systems. CATEGORIES:LINCS Workshop,Seminars LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:774@lincs.fr DTSTART;TZID=Europe/Paris:20230614T140000 DTEND;TZID=Europe/Paris:20230614T173000 DTSTAMP:20230531T083502Z URL:https://www.lincs.fr/events/phd-thesis-defense-of-pierre-popineau/ SUMMARY:PhD thesis defense of Pierre POPINEAU "Study of the dynamics of spatial point processes in wireless communication networks" DESCRIPTION:Thanks to the new paradigms introduced in the latest generation of wireless networks\, expectations concerning service time\, latency and network performance have increased. To model such networks\, point process theory and stochastic geometry have proven to be useful as they provide a versatile and robust framework to obtain results when working with such wireless networks. Adding to this Markov dynamics to model connections and service times completes this framework to analyze such wireless networks. The first contribution of the work presented in this thesis lies in the analysis of service differentiation: 5G NR networks have introduced bandwidth partitioning as a tool to increase network performance. Under this network setup\, not all users interfere with each other with the same power: users transmitting with a broader transmitting frequency spectrum will have a larger bandwidth\, but they will also encounter more interference from the other users in the network. In contrast\, users with a narrower spectrum will experience less interference. We define a Markovian framework to study such a multiclass spatial birth-and-death process\, and we describe its stability region. For such systems\, properties of the stationary regime are analyzed\, such as moment measures or statistical clustering\, leading to a better understanding of these dynamics. The second problem we look into is mobility\, which has become an important feature in wireless networks due to the use of highly directional antennas. Using a simple architecture for a two-tier cellular network\, we study two families of association policies: a first family which only relies on user mobility\, and the second offers a trade-off between network geometry and user mobility to increase network performance. These policies are then compared to a classical max-power association policy to assert their performance.\n CATEGORIES:PhD Defense,Seminars LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:775@lincs.fr DTSTART;TZID=Europe/Paris:20230612T130000 DTEND;TZID=Europe/Paris:20230612T160000 DTSTAMP:20230601T084341Z URL:https://www.lincs.fr/events/phd-thesis-defense-by-matthieu-gouel-inter net-scale-route-tracing-capture-and-analysis/ SUMMARY:PhD thesis defense by Matthieu Gouel "Internet-Scale Route Tracing Capture and Analysis" DESCRIPTION:The Internet is one of the most remarkable human creations\, enabling com-\nmunication among about two thirds of the global population. This network\nof networks spans the entire globe and is managed in a highly decentralized\nway\, making it impossible to fully comprehend at IP-level. Nonetheless\, for\nover two decades\, researchers have been devising new techniques\, developing\nnew tools\, and creating new platforms to capture and provide more precise\nand comprehensive maps of the Internet’s topology. These e?orts support\nnetwork operators in the industry and other researchers in improving core\nfeatures of the Internet such as its connectivity\, performance\, security\, or\nneutrality.\nThis thesis presents new contributions that improve the scalability of\nInternet topology measurement. It introduces a state of the art measurement\nplatform that enables the use of high-speed probing techniques for IP route\ntracing at Internet scale\, as well as a reinforcement learning approach to\nmaximize the discovery of the Internet topology. Because the analysis of the\nroute tracing data collected requires additional metadata\, the evolution of\nIP address geolocation over a 10-year period in a widely used proprietary\ndatabase is examined\, and lessons are provided to avoid biases in studies\nusing this database. Finally\, a large-scale analysis framework is developed to\neffectively utilize the large number of collected data and augmented metadata\nfrom other sources\, such as IP address geolocation\, to produce insightful\nstudies at the Internet scale.\nThis work aims to considerably improve the study of the Internet topology\nby providing tools to collect and analyze large amounts of Internet topology\ndata. This will allow researchers to better understand how the Internet is\nstructured and how it evolves over time\, leading to a more comprehensive\nunderstanding of this complex system. CATEGORIES:PhD Defense LOCATION:Jussieu\, Room 24-25/405-SOC\, 4 place Jussieu\, Paris\, 75005\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=4 place Jussieu\, Paris\, 75005\, France;X-APPLE-RADIUS=100;X-TITLE=Jussieu\, Room 24-25/405-SOC:geo:0,0 END:VEVENT BEGIN:VEVENT UID:770@lincs.fr DTSTART;TZID=Europe/Paris:20230607T150000 DTEND;TZID=Europe/Paris:20230607T160000 DTSTAMP:20230606T134601Z URL:https://www.lincs.fr/events/2nd-phds-elevator-pitch-training-session/ SUMMARY:2nd PhDs “elevator pitch” training session DESCRIPTION:\n\n\nBharath Roy Choudhury (Inria)\n\n\nGuillaume Nibert (Sorbonne/Snowpack)\n\n\nSayeh Khaniha (Inria)\n\n\nThomas Le Corre (Inria)\n\n\nClaire Bizon-Monroc (Inria)\n\n\nLucas Weber (Inria)\n\n\n CATEGORIES:Seminars LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:768@lincs.fr DTSTART;TZID=Europe/Paris:20230531T150000 DTEND;TZID=Europe/Paris:20230531T160000 DTSTAMP:20230420T114658Z URL:https://www.lincs.fr/events/seance-preparation-poster/ SUMMARY:Séance préparation POSTER DESCRIPTION: CATEGORIES:Seminars LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:769@lincs.fr DTSTART;TZID=Europe/Paris:20230524T150000 DTEND;TZID=Europe/Paris:20230524T160000 DTSTAMP:20230504T084715Z URL:https://www.lincs.fr/events/1st-phds-elevator-pitch-training-session/ SUMMARY:1st PhDs "elevator pitch" training session DESCRIPTION:\n\n\nEmma Caizergues (Dauphine/Nokia)\n\n\nGuodong Sun (Inria/Nokia)\n\n\nEmma Braiteh (Télécom-Paris/SystemX)\n\n\nShashwat Mishra (Nokia)\n\n\nMohammad Abdullah (Télécom-SudParis)\n\n\n CATEGORIES:Seminars LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:763@lincs.fr DTSTART;TZID=Europe/Paris:20230524T103000 DTEND;TZID=Europe/Paris:20230524T111500 DTSTAMP:20230526T084534Z URL:https://www.lincs.fr/events/presentation-by-makhlouf-hadji/ SUMMARY:Digital Twins for Networks of Future: Open Research Challenges and Opportunities DESCRIPTION:In this talk\, I will address the different definitions of Digital Twins (DT) and explain their differences according to the sectors and domains we consider. Next\, I propose to discuss the reference architecture of a Digital Twin highlighting its different and necessary  microservices. The talk will also consider certain domains of applications necessitating the DT and will focus on the specific case of Digital Twin for Networks of Future while addressing open research challenges and opportunities allowed by DTs. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:766@lincs.fr DTSTART;TZID=Europe/Paris:20230517T150000 DTEND;TZID=Europe/Paris:20230517T160000 DTSTAMP:20230526T083919Z URL:https://www.lincs.fr/events/three-perspectives-to-enhance-the-performa nce-of-high-speed-datacenter-networks/ SUMMARY:Three Perspectives to Enhance the Performance of High-Speed Datacenter Networks DESCRIPTION:The performance of large-scale computing systems often critically depends on high-performance communication networks. In this presentation\, I will focus on two key metrics throughput and latency from three perspectives within a datacenter network: end-host\, network dataplane and topology.\n\nAt the end-host\, I will discuss the impact of congestion control in achieving high throughput and low latency while requiring little to no buffer in the network. I will then present PowerTCP\, a power-based congestion control algorithm that leverages inband network telemetry and adapts to both the absolute state as well as the changes in the network (NSDI 2022).\n\nAt the network core\, I will discuss the role of buffer management in improving datacenter performance and present Active Buffer Management (ABM)\, a novel buffer sharing scheme for datacenter switches.  ABM not only offers isolation but also offers stable queueing delays which as we show essentially enhances the burst absorption capabilities of the switch (SIGCOMM 2022).\n\nAt the topological level\, I will show the fundamental tradeoffs across throughput\, latency and buffer requirements within a subset of the design space. I will briefly present Mars\, a near-optimal throughput reconfigurable datacenter topology that achieves high throughput within the given buffer capacity of the network devices (SIGMETRICS 2023).\n\nI will conclude by discussing ongoing works and open questions.\n\n \;\nBio\nVamsi is a third year PhD student at TU Berlin under the supervision of Prof. Stefan Schmid.  He obtained MSc. from Sorbonne University Paris and did his thesis at ETH Zurich. In 2017\, he started off his path towards research at Telecom Paris with Prof. Dario Rossi and Leonardo Linguaglossa hosted at Lincs. Currently\, he is broadly interested in network topologies\; congestion control and network flow problems\; online algorithms and competitive analysis\; buffer requirements and management\; and related areas. His research is mainly at the intersection of networking theory and systems. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:773@lincs.fr DTSTART;TZID=Europe/Paris:20230517T103000 DTEND;TZID=Europe/Paris:20230517T113000 DTSTAMP:20230629T135623Z URL:https://www.lincs.fr/events/sorting-under-partial-information/ SUMMARY:Sorting under Partial Information DESCRIPTION:We present the following article: Cardinal\, Fiorini\, Joret\, Jungers\, and Munro. Sorting under partial information (without the ellipsoid algorithm). Proceedings of the forty-second ACM symposium on Theory of computing. 2010.\n\n"We revisit the well-known problem of sorting under partial information: sort a finite set given the outcomes of comparisons between some pairs of elements. The input is a partially ordered set P\, and solving the problem amounts to discovering an unknown linear extension of P\, using pairwise comparisons. The information-theoretic lower bound on the number of comparisons needed in the worst case is log e(P)\, the binary logarithm of the number of linear extensions of P. In a breakthrough paper\, Jeff Kahn and Jeong Han Kim (STOC 1992) showed that there exists a polynomial-time algorithm for the problem achieving this bound up to a constant factor. Their algorithm invokes the ellipsoid algorithm at each iteration for determining the next comparison\, making it impractical.\n\nWe develop efficient algorithms for sorting under partial information. Like Kahn and Kim\, our approach relies on graph entropy. However\, our algorithms differ in essential ways from theirs. Rather than resorting to convex programming for computing the entropy\, we approximate the entropy\, or make sure it is computed only once in a restricted class of graphs\, permitting the use of a simpler algorithm." CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:767@lincs.fr DTSTART;TZID=Europe/Paris:20230510T150000 DTEND;TZID=Europe/Paris:20230510T160000 DTSTAMP:20230526T082147Z URL:https://www.lincs.fr/events/talk-jerome-ramos/ SUMMARY:Quantifying the Bias of Transformer-Based Language Models for African American English in Masked Language Modeling DESCRIPTION:\n\nIn recent years\, groundbreaking transformer-based language models (LMs) have made tremendous advances in natural language processing (NLP) tasks. However\, the measurement of their fairness with respect to different social groups still remains unsolved. In this paper\, we propose and thoroughly validate an evaluation technique to assess the quality and bias of language model predictions on transcripts of both spoken African American English (AAE) and Spoken American English (SAE). Our analysis reveals the presence of a bias towards SAE encoded by state-of-the-art LMs such as BERT and DistilBERT and a lower bias in distilled LMs. We also observe a bias towards AAE in RoBERTa and BART. Additionally\, we show evidence that this disparity is present across all the LMs when we only consider the grammar and the syntax specific to AAE.\nShort bio:\nJerome Ramos is a second year PhD student at University College London supervised by Dr. Aldo Lipani. His research interests include explainability and scrutability in conversational recommender systems.\n CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:771@lincs.fr DTSTART;TZID=Europe/Paris:20230510T103000 DTEND;TZID=Europe/Paris:20230510T113000 DTSTAMP:20230504T134645Z URL:https://www.lincs.fr/events/proving-and-analysing-security-protocols-w ith-scyther/ SUMMARY:Proving and analysing security protocols with Scyther DESCRIPTION:Scyther is an open source Python tool for proving and verifying security protocols. It offers the possibility to integrate adversaries to compromise protocols and to visualise the result associated with the corruption of these protocols. It has also been used to analyse the IKEv1 and IKEv2 protocols [1] used in VPNs and various authentication protocols [2]. In this workshop we will learn how to use the tool and prove some protocols.\n\nWebsite: https://people.cispa.io/cas.cremers/scyther/index.h tml\nSource code: https://github.com/cascremers/scyther\n\nReferences:\n\n[1] C. Cremers\, Key exchange in IPsec revisited: Formal analysis of IKEv1 and IKEv2 in Computer Security–ESORICS 2011: 16th European Symposium on Research in Computer Security\, Leuven\, Belgium\, September 12-14\, 2011. Proceedings 16\, Springer\, 2011\, pp. 315–334. Available at: https://people.cispa.io/cas.cremers/downloads/papers/Cr2011-IKE.pdf [ accessed on May 4\, 2023]\n\n[2] [1] D. Basin\, C. Cremers\, and S. Meier\, Provably repairing the ISO/IEC 9798 standard for entity authentication\, Journal of Computer Security\, vol. 21\, no. 6\, pp. 817–846\, 2013. Available at: https://people.cispa.io/cas.cremers/downloads/papers/BCM2012-iso9798.p df [accessed on May 4\, 2023] CATEGORIES:Tools, Tips and Tricks LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:765@lincs.fr DTSTART;TZID=Europe/Paris:20230426T150000 DTEND;TZID=Europe/Paris:20230426T160000 DTSTAMP:20230427T082159Z URL:https://www.lincs.fr/events/a-necessary-and-sufficient-condition-for-s tability-of-queuing-networks-with-state-dependent-departure-rates/ SUMMARY:A necessary and sufficient condition for stability of queuing networks with state-dependent departure rates DESCRIPTION:Reaching stability conditions for Markovian queueing networks is a problem for which many methods have been developed\, depending on the queueing policies\, laws for arrivals and departure of users in the system\, but obtaining instability or transience is a problem known to be harder.\nIn this talk\, we will focus on a type of queuing networks where the departure rate in a given queue is a decreasing function of the other queue lengths\, and increasing in its queue length. This type of queuing networks can be encountered in wireless communication systems\, where the departure rate depends on the interference in the system.\nWe first obtain a stability condition for the system using fluid limits\, and prove instability using stochastic domination arguments. This stability condition is interesting as it allows us to study systems for which the fluid models are not defined near 0.\n\nThe talk is based on the results of these papers :\n- S. Shneer and A. Stolyar\, Stability conditions for a decentralised medium access algorithm: single- and multi-hop networks\, Queuing Systems\, vol. 94\, pp. 109–128\, 2020\, https://link.springer.com/article/10.1007/s11134-019-09635-w\n- P. Popineau and S. Shneer\, An instability condition for queuing systems with state-dependent departure rates\, 2023\, https://arxiv.org/abs/2304.08853 CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:759@lincs.fr DTSTART;TZID=Europe/Paris:20230419T150000 DTEND;TZID=Europe/Paris:20230419T160000 DTSTAMP:20230427T152934Z URL:https://www.lincs.fr/events/strategic-computational-investment-in-bloc kchain-mining/ SUMMARY:Strategic Computational Investment in Blockchain Mining DESCRIPTION:This presentation will be based on our work on strategic investment of computational power by miners in blockchain. In particular\, we shall consider a setting where miners can arrive and depart over time\, and hence analyze their investment strategies and the obtained payoffs in the equilibrium of the underlying stochastic game. We shall see that depending on the mining scenario\, miners either follow a thresholding policy that is independent of the other miners\, or a smooth policy that depends on the other miners. Thereafter\, we will look at a Stackelberg game\, where the system decides the amount of reward to offer for mining a block and the miners decide how much power to invest based on the offered reward.\nAuthors: Swapnil Dhamal (Telecom SudParis)\, Walid Ben-Ameur (Telecom SudParis)\, Tijani Chahed (Telecom SudParis)\, Eitan Altman (INRIA Sophia Antipolis)\, Albert Sunny (IIT Palakkad)\, and Sudheer Poojary (Qualcomm) CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:764@lincs.fr DTSTART;TZID=Europe/Paris:20230419T103000 DTEND;TZID=Europe/Paris:20230419T113000 DTSTAMP:20230420T135124Z URL:https://www.lincs.fr/events/a-bit-of-gymnastics-in-python/ SUMMARY:A Bit of Gymnastics in Python DESCRIPTION:In this interactive session\, I will propose exercises inspired by the most popular questions about Python in Stack Overflow: https://stackoverflow.com/questions/tagged/python?tab=votes.\n\nHere is the approach of the session:\n\n For beginners\, search answers on the web\, discover some elements of the Python syntax\;\n For more advanced users\, try to do as much as possible without any help from the web\, gain speed and agility\, find several answers to the same question.\n\nRequirements: a computer with a Python installation + Jupyter Notebook. Only a minimal knowledge of Python is necessary.\n\nThe notebook displayed below gives only the problems. The one with the solutions can be accessed here: https://gist.github.com/francois-durand/d7f814a4336d3d00d3adec4cdf75113b.\n \n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:756@lincs.fr DTSTART;TZID=Europe/Paris:20230412T150000 DTEND;TZID=Europe/Paris:20230412T160000 DTSTAMP:20230413T090818Z URL:https://www.lincs.fr/events/distributed-function-computation-over-netw orks/ SUMMARY:Distributed Function Computation over Networks DESCRIPTION:Large-scale distributed computing systems\, such as MapReduce\, Spark\, or distributed deep networks\, are critical for parallelizing the execution of computational tasks. Nevertheless\, a struggle between computation and communication complexity lies at the heart of distributed computing. There has been recently a substantial effort to address this problem for a class of functions\, such as distributed matrix multiplication\, distributed gradient coding\, linearly separable functions\, etc. The optimal cost has been achieved under some constraints\, based mainly on ideas of linear separability of the tasks and linear space intersections. Motivated by the same challenge\, we propose a novel distributed computing framework where a master seeks to compute an arbitrary function of distributed datasets in an asymptotically lossless manner. Our approach exploits the notion of characteristic graphs\, which have been widely utilized by Shannon\, K¨orner\, and Witsenhausen to derive the rate lower bounds for computation\, and later by Alon- Orlitsky\, Orlitsky-Roche\, Doshi-Shah-M´edard\, and Feizi-M´edard\, to resolve some well known distributed coding and communication problems\, allowing for lowered communication complexity and even for a) correlated data\, b) a broad class of functions\, and c) well-known topologies. The novelty of our approach lies in accurately capturing the communication-computation cost tradeoff by melding the notions of characteristic graphs and distributed placement\, to provide a natural generalization of distributed linear function computation\, thus elevating distributed gradient coding and distributed linear transform to the realm of distributed computing of any function. In toy scenarios\, we demonstrate gains up to %70 over fully distributed solutions and an approximation ratio of 2 within the optimal centralized rate. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:757@lincs.fr DTSTART;TZID=Europe/Paris:20230405T150000 DTEND;TZID=Europe/Paris:20230405T160000 DTSTAMP:20230407T085639Z URL:https://www.lincs.fr/events/age-of-information-processes-under-strongl y-mixing-communication/ SUMMARY:Age of Information Processes under Strongly Mixing Communication DESCRIPTION:The decentralized nature of multi-agent systems requires continuous data\nexchange to achieve global objectives. In such scenarios\,\nAge-of-Information (AoI) has become an important metric for the\nfreshness of communicated data. The study of AoI consequently has to\ntake into account the dependencies that communication systems exhibit:\nThe process describing the success or failure of communication is highly\ncorrelated when these attempts are ``close'' in some domain. To study\nAoI in such scenarios\, I will introduce fundamental AoI processes\n$\\Delta(n)$\, expressing the discrete-time since the last update from a\nsource at a monitor: If during time slot $n$ the monitor receives a\nstatus update from the source (event $A(n)$)\, then $\\Delta(n+1)$ is\nreset to one\, otherwise\, $\\Delta(n)$ grows linearly in time. This AoI\nprocess is a special random walk with resets. The event process $A(n)$\nmay be non-stationary and we assume that its temporal dependencies\ndecay\, described by $\\alpha$-mixing. With this\, moment bounds and growth\nbounds follow for the resulting AoI process as a function of the mixing\nrate of $A(n)$. In addition\, the AoI process $\\Delta(n)$ is itself\n$\\alpha$-mixing. I will then discuss how the fundamental AoI processes\npresented can be used to model more complex AoI structures that do not\nnecessarily reset to one when information is updated and where multiple\nsources may lead to AoI at a monitor. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:762@lincs.fr DTSTART;TZID=Europe/Paris:20230405T103000 DTEND;TZID=Europe/Paris:20230405T113000 DTSTAMP:20230407T091748Z URL:https://www.lincs.fr/events/gaussian-limit-laws-and-generating-series/ SUMMARY:Gaussian limit laws and generating series DESCRIPTION:The Central Limit Theorem states that some sums of random variables\, once renormalized\, converge to the Gaussian distribution. Some parameters of large combinatorial objects have a similar flavor but do not satisfy the independence assumption. I will present tools from analytic combinatorics to handle those parameters and prove Gaussian limit laws (and many others!). CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:753@lincs.fr DTSTART;TZID=Europe/Paris:20230329T150000 DTEND;TZID=Europe/Paris:20230329T160000 DTSTAMP:20230407T092406Z URL:https://www.lincs.fr/events/fast-how-to-find-relevant-regular-expressi on-from-a-small-set-of-positive-examples/ SUMMARY:fAST: How to find relevant regular expression from a small set of positive examples DESCRIPTION:Regular expressions are ubiquitous in computer science but are cumbersome to code. In this work\, we present a new algorithm\, named fAST (find Abstract Syntax Tree)\, that infers a regular expression from a small set of positive examples. Its main strength (with respect to the start of the art) resides in its ability to perform this inference without counter examples.\n\nAuthors: Maxime Raynal (LIG\, NBLF)\, Marc-Olivier Buob (NBLF)\, Georges Quénot (LIG) CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:761@lincs.fr DTSTART;TZID=Europe/Paris:20230329T103000 DTEND;TZID=Europe/Paris:20230329T113000 DTSTAMP:20230329T133348Z URL:https://www.lincs.fr/events/content-delivery-networks-providing-conten t-at-global-scale/ SUMMARY:Content Delivery Networks: providing content at global scale DESCRIPTION:On April 13\, 2019\, 17.4 million users watched the newly released episode of Games of Thrones. The Trump vs. Clinton debate was streamed to 2 million simultaneous users over the Internet. Serving content at such a huge scale requires advanced engineering solutions\, to ensure scalability and security.\n\nContent Delivery Networks (CDNs) solve this challenge. Being conceived during a student competition on algorithms at MIT\, they are now the pillars of the Internet\, although the common man does not even know they exist.\n\nIn this talk I will describe the inner mechanics of CDNs\, with a particular focus on redirection\, authentication\, caching and video workflow. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:751@lincs.fr DTSTART;TZID=Europe/Paris:20230322T150000 DTEND;TZID=Europe/Paris:20230322T160000 DTSTAMP:20230314T092946Z URL:https://www.lincs.fr/events/talk-by-pierre-popineau/ SUMMARY:Talk à définir DESCRIPTION: CATEGORIES:Seminars LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:760@lincs.fr DTSTART;TZID=Europe/Paris:20230322T103000 DTEND;TZID=Europe/Paris:20230322T113000 DTSTAMP:20230329T131546Z URL:https://www.lincs.fr/events/wireless-communications-for-dummies-part-2 / SUMMARY:Wireless communications for dummies – part 2 DESCRIPTION:We will cover Chapter 3 of [1]\, including important concepts for modern wireless networks such as time/frequency/antenna diversity\, space-time codes\, and—if time permits—OFDM.\n\n[1] Tse\, David\, and Pramod Viswanath. Fundamentals of wireless communication. Cambridge university press\, 2005.\n\nslides: Wireless-for-dummies CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:758@lincs.fr DTSTART;TZID=Europe/Paris:20230315T103000 DTEND;TZID=Europe/Paris:20230315T113000 DTSTAMP:20230321T083541Z URL:https://www.lincs.fr/events/an-introduction-to-the-numerical-solver-fo r-multiple-integrals/ SUMMARY:An introduction to the numerical solver for multiple integrals DESCRIPTION:Evaluating multiple integrals is challenging when there exists no simple closed form representations. However\, they are frequently encountered in network analysis\, such as in queueing theory and stochastic geometry. In this reading group talk\, I will introduce the development of numerical integration\, namely the line of though from Newton’s Trapezoidal rule to Fourier’s spectrum method and to Gauss-Kronrod quadrature method\, in which the latest one is proven to be one of the most efficient for one dimensional(1D) numerical integration. This line of thought inspires numerical multiple integrals. As an example\, “Genz-Malik algorithm” will be presented\, which is used to solve N-dimensional smooth multiple integrals and is prove to be efficient when the dimension ranges from two (2D) to seven (7D). In addition\, I will compare the Genz-Malik algorithm with other solvers\, such as iterative one dimensional algorithm and Monte Carlo integration. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:748@lincs.fr DTSTART;TZID=Europe/Paris:20230308T090000 DTEND;TZID=Europe/Paris:20230309T174500 DTSTAMP:20230119T174525Z URL:https://www.lincs.fr/events/lincs-and-erc-nemo-2-day-workshop-performa nce-guarantees-in-wireless-networks/ SUMMARY:LINCS and ERC-NEMO 2-day Workshop "Performance Guarantees in Wireless Networks" DESCRIPTION:**CLICK to reach the web page of the Workshop**\nYou will find there the list of the confirmed invited speakers and the program\n \;\n\n\nThe LINCS and the ERC-NEMO are glad to announce a 2-day Workshop entitled "Performance Guarantees in Wireless Networks"\, organized by François Baccelli (INRIA and Telecom-Paris) and Jean-Marie Gorce (INRIA Lyon).\n\nThe workshop will take place on March 2023\, Wednesday 8th and Thursday 9th\, @LINCS: Télécom Paris\, 19 place Marguerite Perey\, Palaiseau\, Amphi Rose Dieng.\n\nIMPORTANT! Registering at the following link is required to attend: https://www.telecom-paris.fr/agenda/lincs-workshop-wireless-networ ks\n\n\nThe event is sponsored by LINCS and ERC-NEMO\, and by Telecom-Paris for the premises CATEGORIES:Seminars LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:754@lincs.fr DTSTART;TZID=Europe/Paris:20230301T150000 DTEND;TZID=Europe/Paris:20230301T160000 DTSTAMP:20231221T095048Z URL:https://www.lincs.fr/events/coverage-and-capacity-of-joint-communicati on-and-sensing-in-wireless-networks/ SUMMARY:Coverage and Capacity of Joint Communication and Sensing in Wireless Networks DESCRIPTION:From an information theoretic perspective\, joint communication and sensing (JCAS) represents a natural generalization of communication network functionality. However\, it requires the re-evaluation of network performance from a multi-objective perspective. We develop a novel mathematical framework for characterizing the sensing and communication coverage probability and ergodic capacity in JCAS networks. We employ an information theoretic formulation of radar tracking to extend the notions of coverage probability and ergodic capacity to the radar setting. We define sensing coverage probability as the probability that the rate of information extracted about the parameters of interest associated with a typical radar target exceeds some threshold\, and sensing ergodic capacity as the expected value of the aforementioned rate of information. Using this framework\, we analyze the downlink sensing and communication coverage and capacity of a JCAS network employing a shared multicarrier waveform and analog beamforming. Leveraging tools from stochastic geometry\, we derive upper and lower bounds for these quantities. We also develop several general technical results including: i) a generic method for obtaining closed form upper and lower bounds on the Laplace Transform of a shot noise process\, ii) a new analog of Ho?lder’s Inequality to the setting of harmonic means\, and iii) a relation between the Laplace and Mellin Transforms of a non-negative random variable. We use the derived bounds to numerically investigate the performance of JCAS networks under varying base station and blockage density. Among several insights\, our numerical analysis indicates that network densification improves sensing performance – in contrast to communications.\n\nSlides CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:755@lincs.fr DTSTART;TZID=Europe/Paris:20230301T103000 DTEND;TZID=Europe/Paris:20230301T113000 DTSTAMP:20230302T091224Z URL:https://www.lincs.fr/events/parse-and-analyze-source-codes-with-tree-s itter/ SUMMARY:Parse and analyze source codes with Tree-sitter DESCRIPTION:Tree-sitter is a library for parsing source codes. Compared to similar libraries\, Tree-sitter is very fast and dependency-free. This makes it easy to embed it in other programs\, such as text editors\, and use it for real-time applications\, such as syntax highlighting. In this talk we will study Tree-sitter’s query language to search for patterns in syntax trees\, and show how to use it from Python to analyze other programs.\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:740@lincs.fr DTSTART;TZID=Europe/Paris:20230222T150000 DTEND;TZID=Europe/Paris:20230222T160000 DTSTAMP:20230328T132654Z URL:https://www.lincs.fr/events/some-methods-to-improve-iot-performance-an d-cybersecurity/ SUMMARY:Some Methods to Improve IoT Performance and Cybersecurity DESCRIPTION:The relative simplicity and lightweight nature of many IoT devices\, and their widespread connectivity via the Internet and other wired and wireless networks\, raise issues regarding both their performance and vulnerability. Indeed\, their own connectivity patterns based on the need to frequently forward and receive\, data has given rise to the « Massive Access Problem (MAP) of the IoT » which is a form of congestion caused by the IoT’s synchronized and repetitive data transmission patterns. On the other hand\, the opportunity that IoT devices present to malicious third parties for generating highly contagious distributed denial of service (DDoS) and Botnet attacks\, is also a subject of concern which is widely studied. Thus this presentation will discuss our recent results and research directions that address both of these issues. Regarding the MAP\, we will outline the Quasi-Deterministic Transmission Policy (QDTP)\, and its main theoretical result\, and present trace driven measurements\, which show that QDTP can effectively mitigate MAP. We will also show how a Machine Learning approach using novel Auto-Associative Dense Random Neural Networks can detect DDos attacks with a high degree of accuracy\, and discuss the potential of « low cost » online learning to protect IoT gateways and devices against Cyberattacks. The speaker gratefully acknowledges research funding from the EC as part of the H2020 GHOST\, SerIoT and IoTAC projects.\n\nInfo on the speaker: https://en.wikipedia.org/wiki/Erol_Gelenbe\n\nSLIDES LINK CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:752@lincs.fr DTSTART;TZID=Europe/Paris:20230222T103000 DTEND;TZID=Europe/Paris:20230222T113000 DTSTAMP:20230222T111929Z URL:https://www.lincs.fr/events/introduction-to-differential-privacy/ SUMMARY:Introduction to Differential Privacy DESCRIPTION:Consider an individual who is deciding whether to allow their data to be included in a database. For example\, it may be a patient deciding whether their medical records can be used in a study\, or someone deciding whether to answer a survey. A useful notion of privacy would be an assurance that allowing their data to be included should have negligible impact on them in the future. Absolute privacy is inherently impossible but what we want to be guaranteed is that that the chance of a privacy violation is small. This is precisely what differential privacy (DP) provides. We will have an introduction to differential privacy\, in which we will cover the fundamentals of differential privacy\, such as epsilon-differential privacy\, the Laplace mechanism\, and the exponential mechanism. We will also discuss the strengths and limitations of differential privacy\, and the challenges associated with its implementation. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:750@lincs.fr DTSTART;TZID=Europe/Paris:20230215T113000 DTEND;TZID=Europe/Paris:20230215T123000 DTSTAMP:20230216T141801Z URL:https://www.lincs.fr/events/note-taking-and-knowledge-management-with- obsidian-md-and-zotero/ SUMMARY:Note taking and knowledge management with Obsidian.md and Zotero DESCRIPTION:Obsidian is a recent markdown note-taking software (2020) with powerful features\, such as the ability to link notes to each other\, to view these links as a graph\, and to read BibTex/BibLaTeX files via extensions. Connecting Zotero to Obsidian is great way to start studying a research topic. In this workshop\, we will learn how to use the power of Zotero combined with Obsidian and some useful extensions to be more efficient when taking notes\, writing articles and managing bibliographic references.\n\nDownload links:\n\n Zotero: https://www.zotero.org/\n Zotero Connector: https://www.zotero.org/download/connectors\n Obsidian: https://obsidian.md/\n Better BibTeX/BibLaTeX: https://retorque.re/zotero-better-bibtex/\n Zotfile: http://zotfile.com/\n Zotero Citation Counts: https://github.com/eschnett/zotero-citationcounts\n Zotero Translate: https://github.com/windingwind/zotero-pdf-translate\n\nSlides of the presentation. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:747@lincs.fr DTSTART;TZID=Europe/Paris:20230208T173000 DTEND;TZID=Europe/Paris:20230208T190000 DTSTAMP:20230215T112706Z URL:https://www.lincs.fr/events/what-next-event-for-the-phds/ SUMMARY:"What next?" - event for the PhDs DESCRIPTION:WHAT NEXT?\n\nNavigating the PhD is certainly not an easy task\, but making decisions about what to do next can be even more complicated and stressful.\n@LINCS we know how difficult and disorienting this can be\, thus we invited some former LINCS members (who were in this situation only a few years ago) to tell us their stories.\nWe chose people who undertook very different paths: they ended up in academia\, in startups\, in big companies\, in public institutions… They are all easy-going and nice people\, ready to share their experience\, including all their doubts\, their hesitations\, their failures\, their inspirations\, etc.\nIt is good to have an idea of “what’s outside” and it is important to think about what can make you happy. Different paths bring different pros and cons\, which it is worth exploring. Together is definitely better!\nWe hope to see many PhD students participating in this event :) Lot of time for Q&\;A and something for an apéro!\n\nLIST of CONFIRMED SPEAKERS:\n\n Francesca Bassi (SystemX)\n Gabriele Castellano (Huawei)\n Céline Comte (CNRS Toulouse)\n Rémy Léone (Scaleway)\n Leonardo Linguaglossa (Télécom-Paris)\n Flavia Salutari (BNP Paribas)\n\n \;\n\nHere're the slides of the event with a description of the best and worst aspects of each speaker's professional path.\n\nHere's the flyer of the event. CATEGORIES:Seminars LOCATION:Room 4C06\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4C06:geo:0,0 END:VEVENT BEGIN:VEVENT UID:738@lincs.fr DTSTART;TZID=Europe/Paris:20230208T150000 DTEND;TZID=Europe/Paris:20230208T160000 DTSTAMP:20230214T150354Z URL:https://www.lincs.fr/events/a-converse-for-fault-tolerant-quantum-comp utation/ SUMMARY:A Converse for Fault-tolerant Quantum Computation DESCRIPTION:As techniques for fault-tolerant quantum computation keep improving\, it is natural to ask: what is the fundamental lower bound on redundancy? In this paper\, we obtain a lower bound on the redundancy required for $\\epsilon$-accurate implementation of a large class of operations that includes unitary operators. For the practically relevant case of sub-exponential depth and sub-linear gate size\, our bound on redundancy is tighter than the known lower bounds. We obtain this bound by connecting fault-tolerant computation with a set of finite blocklength quantum communication problems whose accuracy requirements satisfy a joint constraint. The lower bound on redundancy obtained here leads to a strictly smaller upper bound on the noise threshold for non-degradable noise. Our bound directly extends to the case where noise at the outputs of a gate are non-i.i.d. but noise across gates are i.i.d.\n(This is a joint work with Uthirakalyani G\, IIT Madras and Anuj K. Nayak\, UIUC. No prior knowledge about quantum computation and communication will be assumed in this talk.) CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:749@lincs.fr DTSTART;TZID=Europe/Paris:20230208T113000 DTEND;TZID=Europe/Paris:20230208T123000 DTSTAMP:20231013T115141Z URL:https://www.lincs.fr/events/platooning-in-vanets/ SUMMARY:Platooning in VANETs DESCRIPTION:Platooning is a group of vehicles that drive in the same lane in a close  proximity aiming at improving road safety and traffic efficiency and reducing  fuel consumption. This application firstly relied on vehicular sensors to  calculate a minimal inter-vehicle distance\, it has then been enhanced to  integrate wireless communication to communicate vehicular information and calculate a safe driving distance within the platoon. In the LINCS talks\, I'll go over different existing platooning algorithms and technologies in VANETs and discuss the importance of collaborative in-platooning decisions to protect the platoon from cyberattacks. \nSlides CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Telecom Paris\, 4A113 (4th floor)\, Telecom Paris\, 4A113 (4th floor)\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Telecom Paris\, 4A113 (4th floor)\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris\, 4A113 (4th floor):geo:0,0 END:VEVENT BEGIN:VEVENT UID:744@lincs.fr DTSTART;TZID=Europe/Paris:20230201T150000 DTEND;TZID=Europe/Paris:20230201T160000 DTSTAMP:20230201T200223Z URL:https://www.lincs.fr/events/communications-and-sensing-a-winning-team- for-6g-wireless-communications/ SUMMARY:Communications and sensing\, a Winning team for 6G wireless communications DESCRIPTION:Up until now\, communications and radar sensing applications have employed different spectrum allocations and equipment\, despite both employing the same physical phenomenon\, i.e.\, the propagation of electromagnetic waves. Recently however\, technological trends\, like the usage of multiple antennas and wider bandwidths for communications\, and the increased digitalization of radar processing\, have made the integration of both systems easier. With this in mind\, joint communications and sensing is likely to be one of the key features of 6G wireless systems\, bringing about a plethora of new use cases. In this talk the promises and challenges of this new exciting technology will be discussed. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:746@lincs.fr DTSTART;TZID=Europe/Paris:20230201T113000 DTEND;TZID=Europe/Paris:20230201T123000 DTSTAMP:20230216T144055Z URL:https://www.lincs.fr/events/collective-behavior-emerging-from-multiple -agents-in-networks/ SUMMARY:Collective Behavior Emerging From Multiple Agents in Networks DESCRIPTION:Transport networks and computer networks can be described with the same mathematical framework: the infrastructure can be described as a graph and on top of it a set of agents compete for its capacity\, each aiming to selfishly optimize its own objective. Such agents are passengers in transport networks and TCP origin-destination pairs in computer networks.\nIn this talk I will review classic models that help to understand what happens in such networks from a macroscopic point of view. I will show that by acting selfishly\, agents are unwittingly also collectively solving a centralized optimization problem. This can be interpreted as a collective behavior resulting from the interaction of multiple selfish agents. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Telecom Paris\, 4A113 (4th floor)\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris\, 4A113 (4th floor):geo:0,0 END:VEVENT BEGIN:VEVENT UID:739@lincs.fr DTSTART;TZID=Europe/Paris:20230125T150000 DTEND;TZID=Europe/Paris:20230125T160000 DTSTAMP:20230201T195756Z URL:https://www.lincs.fr/events/spatial-network-calculus/ SUMMARY:Spatial network calculus and performance guarantees in wireless networks DESCRIPTION:Network calculus is initially a methodology allowing one to provide\n performance guarantees in queuing networks subject to random arrival and\n service processes. It relies on the notions of regulated traffic arrivals\n and service curves or guarantees. It is a key design tool for\n latency-critical wireline communication networks where it allows one to\n e.g. guarantee bounds on the end-to-end latency of all transmitted\n packets. In wireless networks\, service guarantees are more intricate as\n electromagnetic signals propagate in a heterogeneous medium where they\n are subject to unpredictable reflections and obstructions and as it is\n more difficult to isolate these signals from each other than in the\n wireline case. There is hence no methodology yet allowing one to give\n performance bounds holding for all links in wireless networks.\n\n In this talk\, we present a novel approach toward such bounds for all\n links in arbitrarily large wireless networks. We introduce spatial\n regulation properties for stationary spatial point processes\, which model\n transmitter and receiver locations\, and develop the first steps of a\n calculus for this type of regulation.   Using this approach\, we derive performance guarantees for\n various types of device-to-device and cellular wireless networks. Such guarantees do not exist in\n networks without spatial regulation\, e.g.\, Poisson networks. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:745@lincs.fr DTSTART;TZID=Europe/Paris:20230125T113000 DTEND;TZID=Europe/Paris:20230125T123000 DTSTAMP:20230216T150227Z URL:https://www.lincs.fr/events/hands-on-javascript/ SUMMARY:Hands-on JavaScript DESCRIPTION:In this tutorial\, we’ll build a simple “to-do list” client-server application. The aim is to present the different features\, pitfalls\, and general quirks of JavaScript through actual code.\nIf you want to play around with the code during the session\, you should install Node.js and NPM.\nThe code on GitHub: https://github.com/rvarloot/lincs-js-todo. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Telecom Paris\, 4A113 (4th floor)\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris\, 4A113 (4th floor):geo:0,0 END:VEVENT BEGIN:VEVENT UID:736@lincs.fr DTSTART;TZID=Europe/Paris:20230118T150000 DTEND;TZID=Europe/Paris:20230118T160000 DTSTAMP:20230123T155135Z URL:https://www.lincs.fr/events/talk-by-paolo-fittipaldi/ SUMMARY:A Linear Algebric Framework for Quantum Internet Dynamic Scheduling DESCRIPTION:The quantum internet is an envisioned worldwide quantum network that\npromises to enable quantum communication between arbitrary pairs of\ndistant nodes through the sharing of end-to-end entanglement. To realize\nthe quantum internet\, we need to solve the practical problems that arise\nwhen scaling up a network system\, which are already well known to\nclassical network science but come with new complications when\nconsidered on quantum hardware. I will introduce the problem of\nscheduling in classical and quantum networks\, propose a preliminary\nsolution to it through our recently published work "A Linear Algebraic\nFramework for Quantum Internet Dynamic Scheduling"\, that introduces a\ntoolbox for designing and benchmarking quantum dynamic scheduling\npolicies\, and show some examples of results that can be derived by\napplying our model to a small quantum network example. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:743@lincs.fr DTSTART;TZID=Europe/Paris:20230118T113000 DTEND;TZID=Europe/Paris:20230118T123000 DTSTAMP:20231013T115039Z URL:https://www.lincs.fr/events/how-google-manages-its-data-center-interco nnexion-with-sdn/ SUMMARY:How Google Manages Its Data-Center Interconnexion With SDN DESCRIPTION:Google has built a dozen data centers around the world. To avoid data loss and offer high availability\, Google replicates a massive amount of data through its own WAN network connecting all its sites with terabits/s bandwidth. But these kinds of networks are *very* expensive\, and are usually over-provisioned to face traffic variance. Google B4 optimizes the utilization of its network via sophisticated software-defined networking on handcrafted hardware. Let’s scratch together the surface of this large-scale real-world SDN implementation. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Telecom Paris\, 4A113 (4th floor)\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris\, 4A113 (4th floor):geo:0,0 END:VEVENT BEGIN:VEVENT UID:737@lincs.fr DTSTART;TZID=Europe/Paris:20230111T150000 DTEND;TZID=Europe/Paris:20230111T160000 DTSTAMP:20230113T151045Z URL:https://www.lincs.fr/events/talk-by-francois-durand/ SUMMARY:Coalitional Manipulation of Voting Rules: Simulations on Empirical Data DESCRIPTION:Using computer simulations based on empirical data\, we show that seven voting rules that we call the IRV family (Instant-Runoff Voting\, exhaustive ballot\, Condorcet-IRV\, Benham\, Smith-IRV\, Tideman and Woodall) are less sensitive to coalitional manipulation than a large selection of prominent voting rules. While the relative performances of these seven rules still deserve further investigation\, we show that the differences are at most marginal.\nTALK'S SLIDES CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:742@lincs.fr DTSTART;TZID=Europe/Paris:20230111T113000 DTEND;TZID=Europe/Paris:20230111T123000 DTSTAMP:20230124T132511Z URL:https://www.lincs.fr/events/optimal-bounds-for-the-no-show-paradox-via -sat-solving/ SUMMARY:Optimal Bounds for the No-Show Paradox via SAT Solving DESCRIPTION:The participation criterion is a social choice criterion that characterizes voting rules. A voting rule satisfies this criterion if\, considering a is the winner of the election\, the addition of a ballot where candidate a is preferred to candidate b should not make b win.\nWhen a voting rule fails the participation criterion\, the phenomenon is called the no-show paradox (Fishburn and Brams\, 1983). With this paradox comes several questions. One of them is to obtain a bound (on the number of candidates and/or voters) that characterizes the criterion's satisfaction for a given voting rule.\nIn this talk\, I will first present the participation criterion\, some voting rules that satisfy it and some that do not (Moulin\, 1987). Then\, I will focus an article of Brandt et al. (2017)\, which presents a way to obtain optimal bounds for the no-show paradox via SAT solving.\n\nReferences\nFelix Brandt\, Christian Geist\, and Dominik Peters. Optimal bounds for the no-show paradox via SAT solving. 2017.\nPeter C. Fishburn and Steven J. Brams. Paradoxes of preferential voting. 1983.\nHervé Moulin. Condorcet’s principle implies the no show paradox. 1987. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:741@lincs.fr DTSTART;TZID=Europe/Paris:20230104T133000 DTEND;TZID=Europe/Paris:20230104T164500 DTSTAMP:20230105T100258Z URL:https://www.lincs.fr/events/infres-seminar-on-kubernetes/ SUMMARY:INFRES seminar on "Kubernetes" DESCRIPTION:Leonardo Linguaglossa\, maitre de Conf. at Télécom-Paris (Dept. INFRES)\, invited Rémy Léone (Scaleway) to give a seminar talk on "Kubernetes" in the framework of his course on Cloud Systems. CATEGORIES:Seminars,Youtube LOCATION:Room 4B07\, 19 place Marguerite Perey\, Palaiseau\, Gabon X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, Gabon;X-APPLE-RADIUS=100;X-TITLE=Room 4B07:geo:0,0 END:VEVENT BEGIN:VEVENT UID:733@lincs.fr DTSTART;TZID=Europe/Paris:20221214T150000 DTEND;TZID=Europe/Paris:20221214T160000 DTSTAMP:20221220T084748Z URL:https://www.lincs.fr/events/pa-coda/ SUMMARY:PA-CODA: Planner-Agnostic Collision Detection and Avoidance for Multi-Robot Navigation DESCRIPTION:Coordinated path planning and motion control are crucial for collision-free navigation of a fleet of robots that share a space and potentially contend for the same paths and passages. Many existing navigation software packages are designed for single-robot navigation and treat other robots as any other observed obstacle\, but this strategy alone is not sufficient for the system to work reliably. The ability to use the existing single-robot stacks without modification while also achieving coordination has high practical value. This talk will present a system that achieves coordination without modifying the path planner or motion controller. The only requirement\, which exists already in most navigation stacks and is otherwise easy to implement using existing interfaces\, is that the navigation stack provide interfaces for injecting dynamic prohibition regions into the cost map and for requesting that the robot temporarily stop its motion. The system\, which we call PA-CODA\, observes the robots’ intents and uses a learned hidden Markov model to anticipate collisions\, which are then avoided by manipulating the cost map or temporarily stopping one or more robots. We ran a series of experiments with real robots to demonstrate PA-CODA’s ability to successfully detect and avoid collisions. CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:735@lincs.fr DTSTART;TZID=Europe/Paris:20221214T113000 DTEND;TZID=Europe/Paris:20221214T123000 DTSTAMP:20230124T121427Z URL:https://www.lincs.fr/events/what-is-javascript/ SUMMARY:What is JavaScript? DESCRIPTION:As a programming language\, JavaScript does has a few quirks here and there\, but what truly sets it apart is the central role it plays in the creation of web pages and applications. As such\, understanding JavaScript has more to do with understanding its contribution to the Web\, and the numerous evolutions it has undergone\, than mastering its syntax and internal logic. This presentation gives an overview of the more prominent trends that have appeared over the years\, and aims to showcase what programming in JavaScript can actually look like\, depending on your needs. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Telecom Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:730@lincs.fr DTSTART;TZID=Europe/Paris:20221207T150000 DTEND;TZID=Europe/Paris:20221207T160000 DTSTAMP:20221110T094338Z URL:https://www.lincs.fr/events/special-rg-session-presentation-of-the-tp- software-radio-platform/ SUMMARY:Special RG session: presentation of the TP software radio platform DESCRIPTION:Exceptionally\, we'll have a session of the "Practical Network" Reading Group that will be moved to the usual schedule of the LINCS seminar.\n\nPhilippe Martins will guide us in exploring the software radio platform installed at Télécom-Paris. CATEGORIES:Practical Networks,Seminars,Working Group LOCATION:Room 4A120\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A120:geo:0,0 END:VEVENT BEGIN:VEVENT UID:734@lincs.fr DTSTART;TZID=Europe/Paris:20221207T113000 DTEND;TZID=Europe/Paris:20221207T123000 DTSTAMP:20221207T152743Z URL:https://www.lincs.fr/events/the-magic-of-container-networking-a-not-so -short-introduction/ SUMMARY:The magic of container networking: a (not-so) short introduction DESCRIPTION:Like regular applications\, containers deployed within highly virtualized contexts need to communicate via a networking abstraction. In order to do so\, common technologies adopt Linux bridges\, virtual interfaces\, software switching (or routing) and other techniques. In this talk\, we explore how containerization has evolved from simple network namespace definition to fully fledged pure-software routing solutions. We provide examples of networking between containers on the same machine (using the default docker model) towards applications spanning multiple machines in cloud systems (as in Kubernetes). We conclude the talk with some real-life examples of cloud networking. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Room 4A113\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A113:geo:0,0 END:VEVENT BEGIN:VEVENT UID:727@lincs.fr DTSTART;TZID=Europe/Paris:20221130T150000 DTEND;TZID=Europe/Paris:20221130T160000 DTSTAMP:20221208T133920Z URL:https://www.lincs.fr/events/network-intelligence-in-the-open-ran-archi tectures-challenges-and-open-experimental-platforms/ SUMMARY:Network Intelligence in the Open RAN: architectures\, challenges and open experimental platforms DESCRIPTION:The Open Radio Access Network (RAN) paradigm and its embodiment based on the O-RAN Alliance specifications is poised to transform the telecom ecosystem via virtualized and disaggregated RAN\, open interfaces and RAN intelligent controllers (RICs). This talk will provide a comprehensive introduction to O-RAN\, including a clear overview of the potentials of the Open RAN paradigm and of the challenges to its realization. After a brief introduction on O-RAN and its architecture\, we will focus our attention on discussing how Artificial Intelligence (AI) and data-driven optimization will transform the ecosystem and will identify challenges to be overcome to de-risk AI\, as well as how to design\, train and deploy AI-based solutions that are able to generalize across multiple topologies\, network and traffic conditions. Finally\, the talk with focus on showcasing selected results obtained using OpenRAN Gym (https://openrangym.com/)\, an experimental platform for research on O-RAN developed by our team at Northeastern University.  CATEGORIES:Seminars,Youtube LOCATION:Room 4B01\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4B01:geo:0,0 END:VEVENT BEGIN:VEVENT UID:732@lincs.fr DTSTART;TZID=Europe/Paris:20221130T113000 DTEND;TZID=Europe/Paris:20221130T123000 DTSTAMP:20221206T102007Z URL:https://www.lincs.fr/events/unimodular-random-graphs/ SUMMARY:Unimodular Random Graphs DESCRIPTION:I will define the unimodularity of random graphs and then I will give several examples of applications concerning tessellations\, optimization\, dynamic systems\, etc. If time permits\, I will also show how unimodularity allows to develop analysis tools for random graphs which in a sense generalize Palm calculus of point processes. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Telecom Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:725@lincs.fr DTSTART;TZID=Europe/Paris:20221116T150000 DTEND;TZID=Europe/Paris:20221116T160000 DTSTAMP:20221208T133503Z URL:https://www.lincs.fr/events/coverage-and-stability-analysis-of-cellula r-network-with-temporal-traffic/ SUMMARY:Coverage and Stability Analysis of Cellular Network with Temporal Traffic DESCRIPTION:In this talk\, we discuss the stability region characterization of a random network when a traffic model is integrated into the network geometry description.\n\nFirst\, we characterized the stable coverage probability of a random network. Starting from the notion of dynamic coverage probability\, the interaction between the queue states in the network is taken into account using discrete Markov chain modelling of the queues\, where the typical user's service rate depends on the dynamic coverage probability.\n\nA more fine-grated description of the phenomenon is made by answering the question\, "what is the proportion of unstable queues in the network?" In this case\, the notion of epsilon-stability is exploited\, which describes the set of traffic intensities for which a queue taken at random has a probability of diverging less than epsilon.\n\nFinally\, the characterization of the stable region by considering the resource allocation is very difficult to obtain\, because of the dependence between the geometry and the network's dynamicists and the allocation strategy. However\, the dynamic nature of the network considered lends itself perfectly to description by a Markovian decision process\, for which reinforcement learning technologies can be proposed. We therefore study the stability-cost characteristic of the network operation according to the transmission policy. CATEGORIES:Seminars,Youtube LOCATION:Room 4A467 - Telecom Paris\, 19 place marguerite perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A467 - Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:731@lincs.fr DTSTART;TZID=Europe/Paris:20221116T113000 DTEND;TZID=Europe/Paris:20221116T123000 DTSTAMP:20221122T093205Z URL:https://www.lincs.fr/events/introduction-to-multi-agent-reinforcement- learning-with-petting-zoo/ SUMMARY:Introduction to Multi-Agent Reinforcement Learning with Petting Zoo DESCRIPTION:PettingZoo (https://pettingzoo.farama.org/) is an open source Python source library supported by Farama Foundation to accelerate research in multi-agent reinforcement learning (RL). Inheriting the standard features of the popular RL interface Gym\, it extends its API to handle multiple agents by following an Agent Environment Cycle ("AEC") games mode. In this workshop we will:\n\n Discover the PettingZoo library and explore supported multi-agent environments\,\n Learn RL policies for a multi-agent benchmark task in a PettingZoo environment\,\n Create a custom environment in PettingZoo.\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Telecom Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:716@lincs.fr DTSTART;TZID=Europe/Paris:20221109T150000 DTEND;TZID=Europe/Paris:20221109T160000 DTSTAMP:20221114T111757Z URL:https://www.lincs.fr/events/talking-to-robots-and-drones/ SUMMARY:Talking to robots and drones: Network requirements for autonomous agents in factories and warehouses of the future DESCRIPTION:Future factories and warehouses will contain fleets of autonomous agents to assist with monitoring and control. In this talk we will describe a variety of machine learning problems that arise in such a setting. These include robot navigation\, localization and multi-agent coordination\, as well as the construction of an analytics pipeline to understand the images streamed from an indoor drone.  A common thread in all these problems is the utilization of cloud robotics\, where most of the intelligence is migrated from the agents themselves to an edge cloud. In this environment the quality of the network is critical for effective operation. We will discuss the network performance required to support such systems\, and also describe some concrete deployments that support indoor farming and warehouse inventory management. CATEGORIES:Seminars,Youtube LOCATION:Room 4A467 - Telecom Paris\, 19 place marguerite perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A467 - Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:728@lincs.fr DTSTART;TZID=Europe/Paris:20221109T113000 DTEND;TZID=Europe/Paris:20221109T123000 DTSTAMP:20230124T121357Z URL:https://www.lincs.fr/events/an-introduction-to-network-calculus/ SUMMARY:An introduction to network calculus DESCRIPTION:Network calculus is a theoretical framework for performance guarantees in communication networks. Here we present a first introduction to some fundamental concepts and principles in network calculus\, including:\n\nArrival curve\,\nLeaky bucket\,\nDeterministic guarantees on queueing delay and backlog\,\nThe min-plus algebra and its connection with system theory.\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Telecom Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:729@lincs.fr DTSTART;TZID=Europe/Paris:20221108T150000 DTEND;TZID=Europe/Paris:20221108T180000 DTSTAMP:20221109T100037Z URL:https://www.lincs.fr/events/phd-thesis-defense-analysis-and-control-of -online-interactions-through-neural-natural-language-processing/ SUMMARY:PhD thesis defense "Analysis and Control of Online Interactions through Neural Natural Language Processing" DESCRIPTION:Natural Language Processing is motivated by applications where computers should gain a semantic and syntactic understanding of human language. Recently\, the field has been impacted by a paradigm shift. Deep learning architectures coupled with self-supervised training have become the core of state-of-the-art models used in Natural Language Understanding and Natural Language Generation. Sometimes considered as foundation models\, these systems pave the way for novel use cases. Driven by an academic-industrial partnership between the Institut Polytechnique de Paris and Google AI Research\, the present research has focused on investigating how pretrained neural Natural Language Processing models could be leveraged to improve online interactions.\n\nThis thesis first explored how self-supervised style transfer could be applied to the toxic-to-civil rephrasing of offensive comments found in online conversations. In the context of toxic content moderation online\, we proposed to fine-tune a pretrained text-to-text model (T5) with a denoising and cyclic auto-encoder loss.\n\nThen\, a subsequent work investigated the human labeling and automatic detection of toxic spans in online conversations. We released a new labeled dataset to train and evaluate systems\, which led to a shared task at the 15th International Workshop on Semantic Evaluation.\n\nFinally\, we developed a recommender system based on online reviews of items\, taking part in the topic of explaining users' tastes considered by the predicted recommendations. The method uses textual semantic similarity models to represent a user's preferences as a graph of textual snippets\, where the edges are defined by semantic similarity.\n\n \;\nThe jury is composed as follows:\n\n\n Mr. Benoît Sagot\, Research Director\, INRIA\, France (Examiner\, President)\n Ms. Serena Villata\, Tenured Researcher\, CNRS\, France (Reviewer)\n Mr. François Yvon\, Research Director\, CNRS\, France (Reviewer)\n Mr. Ion Androutsopoulos\, Professor\, Athens University of Economics and Business\, Greece (Examiner)\n Ms. Marine Carpuat\, Assistant professor\, University of Maryland\, United States (Examiner)\n Mr. Slav Petrov\, Distinguished Scientist\, Google AI Research\, United States (Examiner)\n Mr. Thomas Bonald\, Professor\, Télécom Paris\, France (Ph.D. supervisor)\n Mr. Lucas Dixon\, Research scientist\, Google AI Research\, France (Ph.D. co-supervisor)\n CATEGORIES:PhD Defense LOCATION:Zoom + Amphi 4 chez Télécom-Paris\, 19 Place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + Amphi 4 chez Télécom-Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:726@lincs.fr DTSTART;TZID=Europe/Paris:20221102T113000 DTEND;TZID=Europe/Paris:20221102T123000 DTSTAMP:20221117T082454Z URL:https://www.lincs.fr/events/distributed-optimization-for-cellular-netw orks/ SUMMARY:Distributed Optimization for Cellular Networks DESCRIPTION:In this presentation\, we will introduce a class of distributed optimization algorithms for resource allocation problem\, built on potential game and related to simulated annealing. We will use conventional 3GPP-LTE like eICIC/FeICIC networks in the real life as example to illustrate.  A general objective is to address the entangled inter-cell interference and user association problem. Some related works and questions would be discussed based on computer simulation results to explain some observations. CATEGORIES:Practical Networks,Youtube LOCATION:Room 4A120\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A120:geo:0,0 END:VEVENT BEGIN:VEVENT UID:715@lincs.fr DTSTART;TZID=Europe/Paris:20221026T150000 DTEND;TZID=Europe/Paris:20221026T160000 DTSTAMP:20221102T100234Z URL:https://www.lincs.fr/events/work-memory-requirements-in-error-suscepti ble-quantum-networks/ SUMMARY:Work Memory Requirements in Error Susceptible Quantum Networks DESCRIPTION:We consider the problem of path congestion avoidance in networks of quantum repeaters and terminals. In other words\, the avoidance of situations when demands exceed capacity. We assume networks in which the sets of complete paths between terminals may affect the capacity of repeaters in the network. We compare the reduction of congestion avoidance of path establishment algorithms: shortest-path establishment vs. layer-peeling path establishment. We observe that both strategies provide an equivalent entanglement rate\, while the layer-peeling establishment algorithm considerably reduces the congestion in the network of repeaters. Repeaters in the inner layers get less congested and require a lower number of qubits while providing a similar entanglement rate.\n\n \;\n\nMichel Barbeau\,\nProfessor and Director\nSchool of Computer Science\nCarleton University\, Ottawa\, Canada CATEGORIES:Seminars,Youtube LOCATION:Room 4A467 - Telecom Paris\, 19 place marguerite perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A467 - Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:724@lincs.fr DTSTART;TZID=Europe/Paris:20221026T113000 DTEND;TZID=Europe/Paris:20221026T123000 DTSTAMP:20230124T121327Z URL:https://www.lincs.fr/events/concurrent-programming-in-python3-using-as yncio/ SUMMARY:Concurrent Programming in Python3 Using Asyncio DESCRIPTION:Asyncio is a library to write concurrent code using the async/await syntax. Asyncio is used as a foundation for multiple Python asynchronous frameworks that provide high-performance network and web-servers\, database connection libraries\, distributed task queues\, etc. This tutorial presents the concepts and the syntax related to asyncio through simple examples. It is mainly based on the asyncio tutorial provided by realpython.com.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Telecom Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:723@lincs.fr DTSTART;TZID=Europe/Paris:20221019T113000 DTEND;TZID=Europe/Paris:20221019T123000 DTSTAMP:20221024T133354Z URL:https://www.lincs.fr/events/quantum-cryptography-quantum-key-distribut ion-protocols/ SUMMARY:Quantum Cryptography: Quantum Key Distribution protocols DESCRIPTION:Quantum cryptography [BBE92] consists of the communication of a shared secret key between two users (Alice and Bob) which prevents an eavesdropper (Eve) from intercepting it without being detected\, the security being proven by the principles of quantum physics. These mechanisms are called quantum key distribution (QKD) protocols.\nIn this talk\, we will present the first QKD protocol proposed in 1984 by Bennet and Brassard [BB84]\, explaining how the protocol works and why Eve cannot intercept the distributed key without being detected. We will also briefly present another protocol proposed by Ekert in 1991 [Eke91]. This alternative protocol is based on the violation of Bell's inequalities with quantum physics\, a fact that led to the 2022 Nobel Prize in Physics for Alain Aspect\, John Clauser and Anton Zeilinger [Nobel2022].\n\n\n\nReferences:\n\n[BB84] Charles H. Bennett and Gilles Brassard\, "Quantum cryptography: Public key distribution and coin tossing"\, in Proceedings of the International Conference on Computers\, Systems and Signal Processing\, pp. 175-179\, Bangalore\, 1984\, republished in Theoretical Computer Science\, vol. 560\,? 2014\, pp. 7–11\, https://dx.doi.org/10.1016/j.tcs.2014.05.025.\n\n[Eke91] Artur K. Ekert\, "Quantum cryptography based on Bell's theorem"\, Physical Review Letters\, Vol. 67\, no. 6\, pp. 661-663\, 1991\, https://link.aps.org/doi/10.1103/PhysRevLett.67.661.\n\n[BBE92] Charles H. Bennett\, Gilles Brassard and Artur K. Ekert\, "Quantum Cryptography"\, Scientific American\, vol. 267\, no. 4\, 1992\, pp. 50–57\, http://www.jstor.org/stable/24939253.\n\n[Nobel2022] The Nobel Prize website\, "The Nobel Prize in Physics 2022"\, https://www.nobelprize.org/prizes/physics/2022/summary/.\n\nSee also Wikipedia:\n- https://en.wikipedia.org/wiki/Quantum_cryptography\,\n- https://en.wikipedia.org/wiki/BB84.\n\n\n\n\nPresentation material: https://www.ludovic-noirie.fr/html/sciences/quantum-cryptography/. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Telecom Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:712@lincs.fr DTSTART;TZID=Europe/Paris:20221012T150000 DTEND;TZID=Europe/Paris:20221012T160000 DTSTAMP:20221026T091300Z URL:https://www.lincs.fr/events/extended-reality-in-5g-nr-and-beyond/ SUMMARY:Extended Reality in 5G NR and Beyond DESCRIPTION:Extended Reality (XR) has been one of the ambitious research topics under development for several decades and today it is becoming mature enough to appear in the mass market. The replacement of smartphones with smaller wearable devices and headset mounted devices enables numerous novel use cases in consumer\, engineering\, industrial\, and healthcare areas\, as well as represents a foundation for upcoming Metaverse revolution. The successful adoption of XR requires support from the underlying 5G system\, since XR introduce challenging requirements for radio mobile systems in terms of capacity and latency that do not perfectly fit into the existing classification of fifth-generation (5G) applications and services. Additionally\, power saving needs of user devices result in a clear trade-off between capacity and energy consumption. In this talk\, we will revise the main challenges discussed in 3GPP and possible solutions to fully support XR applications over 5G NR. In particular\, we will highlight the trade-off between power-saving and capacity focusing on possible enhancements to power saving features. CATEGORIES:Seminars,Youtube LOCATION:Room 4A467 - Telecom Paris\, 19 place marguerite perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A467 - Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:722@lincs.fr DTSTART;TZID=Europe/Paris:20221012T113000 DTEND;TZID=Europe/Paris:20221012T123000 DTSTAMP:20221026T091819Z URL:https://www.lincs.fr/events/vehicular-networks-in-practice/ SUMMARY:Vehicular Networks\, in Practice DESCRIPTION:Vehicular ad hoc networks are composed by vehicles sharing data over the radio channel. They are the basic infrastructure of Cooperative Intelligent Transport Systems (C-ITS)\, where vehicles communicate with other vehicles\, with other nomadic devices and with the infrastructure\, in order to increase road safety and eventually to enable cooperative and autonomous driving applications. This talk will overview some practical issues in the design and deployement of C-ITS originating from the use of heterogeneous radio access technologies. CATEGORIES:Practical Networks,Working Group,Youtube LOCATION:Telecom Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:717@lincs.fr DTSTART;TZID=Europe/Paris:20221005T113000 DTEND;TZID=Europe/Paris:20221005T123000 DTSTAMP:20221010T115423Z URL:https://www.lincs.fr/events/distributed-task-processing-with-gnu-paral lel/ SUMMARY:Distributed Task Processing with GNU Parallel DESCRIPTION:You probably tried many times to execute a script on multiple files in parallel\, or to download multiple files at the same time\, only to find out that you’ve exhausted your machine's resources or that some jobs have failed and needs to be retried. GNU Parallel is a tool for executing jobs in parallel using one or more computers. In this talk we will see how GNU Parallel makes it easy to distribute and monitor tasks\, independently of the programming language.\n\nCommands used in this session:\n\n\n\nDataset of URLs used as an example:\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Room 4A467 - Telecom Paris\, 19 place marguerite perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A467 - Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:714@lincs.fr DTSTART;TZID=Europe/Paris:20220928T150000 DTEND;TZID=Europe/Paris:20220928T160000 DTSTAMP:20221007T133427Z URL:https://www.lincs.fr/events/pcant-programable-capture-and-analysis-of- network-traffic/ SUMMARY:PCANT — Programable Capture and Analysis of Network Traffic DESCRIPTION:PCANT is a solution for streamlining the deployment of arbitrary online traffic analysis methods inside networks. It allows network administrators to dynamically instantiate new monitoring techniques on their network without the need for any manual setup\, and data scientists to test new algorithms on a network without requiring any skills pertaining to network equipment administration and configuration. CATEGORIES:Seminars,Youtube LOCATION:Salle 4A101 - Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A101 - Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:713@lincs.fr DTSTART;TZID=Europe/Paris:20220921T150000 DTEND;TZID=Europe/Paris:20220921T160000 DTSTAMP:20220926T091832Z URL:https://www.lincs.fr/events/calculating-the-probability-of-the-condorc et-paradox-using-combinatorics-tools/ SUMMARY:Calculating the probability of the Condorcet Paradox using combinatorics tools DESCRIPTION:The paradox of Condorcet (1785) is a phenomenon that occurs when people express their preferences amongst candidates. Calculating the limiting probability of the Condorcet paradox can be done by probabilistic methods. Krishnamoorthy and Raghavachari (2005) in particular\, found results for the General Independent Culture. During this talk\, I will first introduce some required knowledge in social choice theory and explain the problem. Then\, I will focus on Krishnamoorthy and Raghavachari (2005) work to detail and clear up their results. Finally\, I will present an analytic combinatorics method that permits to obtain the same kind of results. This will be the occasion to develop some classical technics of asymptotic analysis.\n\nReferences:\n\n Marie Jean Antoine Nicolas de Caritat\, marquis de Condorcet. Essai sur\nl’application de l’analyse à la probabilité des décisions rendues à la pluralité\ndes voix. Imprimerie royale\, 1785.\n Mukkai Krishnamoorthy and Madabhushi Raghavachari. Condorcet winner\nprobabilities - A statistical perspective\, 2005. URL https://arxiv.org/abs/math/0511140.\n CATEGORIES:Seminars,Youtube LOCATION:Salle 4A120 - Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A120 - Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:708@lincs.fr DTSTART;TZID=Europe/Paris:20220629T090000 DTEND;TZID=Europe/Paris:20220630T180000 DTSTAMP:20220429T114745Z URL:https://www.lincs.fr/events/2022-lincs-workshop-with-the-scientific-co mmittee/ SUMMARY:2022 LINCS Workshop with the Scientific Committee DESCRIPTION:This year Annual Workshop with the Scientific Committe will take place in LINCS new premises in Palaiseau (@Télécom-Paris).\n\nFour members of our Scientific Committee will be with us in presence and the others will be connected from abroad.\n\nThe event is reserved to the LINCS community but we will publish the Scientific Committee members' video recordings afterwards.\n\nAs last year\, the event will by hybrid (on place and through Zoom)\, but we hope it will be a chance to gather together again!\n\nWe'll have:\n\n the Invited Talks by the Scientific Committee\n the Scientific Highlights by the LINCS members\n the "Elevator Pitch" presentations by LINCS PhD students\n\n**WORKSHOP'S PROGRAM** (soon to be published) CATEGORIES:LINCS Workshop LOCATION:Amphi Rose Dieng\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Amphi Rose Dieng:geo:0,0 END:VEVENT BEGIN:VEVENT UID:706@lincs.fr DTSTART;TZID=Europe/Paris:20220622T150000 DTEND;TZID=Europe/Paris:20220622T160000 DTSTAMP:20220705T095644Z URL:https://www.lincs.fr/events/invertibility-on-the-poisson-space-and-con struction-of-hawkes-processes/ SUMMARY:Invertibility on the Poisson space and construction of Hawkes processes  DESCRIPTION:\nFollowing previous investigations by Üstünel   about the invertibility of some transformations on the Wiener space\, we find some entropic conditions under which a random change of time is invertible on the Poisson space. As a consequence\, we provide a new construction of Hawkes processes. We also establish a new variational representation of the entropy.\n\n\nBio\nLaurent Decreusefond is professor of probability and analysis at Telecom Paris since … (well\, most of you were not yet born). His research topics are focused around stochastic analysis and its applications\, mainly to telecommunications systems. CATEGORIES:Seminars,Youtube LOCATION:Salle 4A301 - TP @Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France\, 91120\, Ile de France\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France\, 91120\, Ile de France\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A301 - TP @Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:710@lincs.fr DTSTART;TZID=Europe/Paris:20220615T150000 DTEND;TZID=Europe/Paris:20220615T160000 DTSTAMP:20220705T095340Z URL:https://www.lincs.fr/events/bidding-efficiently-in-simultaneous-ascend ing-auctions-using-monte-carlo-tree-search/ SUMMARY:Bidding efficiently in Simultaneous Ascending Auctions using Monte Carlo Tree Search DESCRIPTION:We tackle in this work the problem for a player to efficiently bid in Simultaneous Ascending Auctions (SAA). Although the success of SAA partially comes from its relative simplicity\, bidding efficiently in such an auction is complicated as it presents a number of complex strategical problems. No generic algorithm or analytical solution has yet been able to compute the optimal bidding strategy in face of such complexities. By modelling the auction as a turn-based deterministic game with complete information\, we propose the first algorithm which tackles simultaneously two of its main issues: exposure and own price effect. Our bidding strategy is computed by  Monte Carlo Tree Search (MCTS) which relies on a new method for the prediction of closing prices. We show that our algorithm significantly outperforms state-of-the-art existing bidding methods. More precisely\, our algorithm achieves a higher expected utility by taking lower risks than existing strategies. CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:720@lincs.fr DTSTART;TZID=Europe/Paris:20220615T110000 DTEND;TZID=Europe/Paris:20220615T120000 DTSTAMP:20221010T100243Z URL:https://www.lincs.fr/events/enumerating-bipartite-graphs-with-degree-c onstraints/ SUMMARY:Enumerating Bipartite Graphs With Degree Constraints DESCRIPTION:Enumerating graphs with a given degree sequence is a problem of interest in many fields such as voting theory and statistics. If we are able to give nice asymptotic formulas [1]\, there does not exist an exact formula that is feasible to compute. Even though asymptotics already provides sufficient information for most applications\, some require an exact enumeration. In this presentation\, we will enumerate bipartite graphs with degree constraints using a special combinatorial technique. This will be the occasion to make an introduction to some classical combinatorial tools such as generating functions [2].\n\n[1] Asymptotic enumeration of digraphs and bipartite graphs by degree sequence\, A Liebenau\, N Wormald\, 2020\n[2] Analytic combinatorics\, P Flajolet\, R Sedgewick\, 2009 CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Telecom Paristech\, 19 place marguerite perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech:geo:0,0 END:VEVENT BEGIN:VEVENT UID:707@lincs.fr DTSTART;TZID=Europe/Paris:20220608T150000 DTEND;TZID=Europe/Paris:20220608T160000 DTSTAMP:20220704T155455Z URL:https://www.lincs.fr/events/stability-of-multiclass-spatial-birth-and- death-processes-with-wireless-type-interactions/ SUMMARY:Stability of multiclass spatial birth-and-death processes with wireless-type interactions DESCRIPTION:\nWith the densification of wireless networks and the increasing standards of wireless communication protocols\, the study of the stochastic stability of wireless networks becomes increasingly important. Here\, we study a multiclass spatial birth-and-death process on a compact region of the Euclidean plane modeling wireless interactions as seen in a telecommunication network: users arrive at a constant rate and leave the network at a rate inversely proportional to a shot-noise created by other interfering users in the network. The novelty of this work lies in the addition of service differentiation\, inspired by bandwidth partitioning introduced in the latest generation of wireless networks. In this setup\, users choose a fixed number of transmission channels\, and only interfere with transmissions on the channels they use. We restrict our study to symmetric networks\, where users transmitting on the same  number of bands have the same stochastic properties in the network.\nWe define a general mathematical framework using stochastic geometry and queuing the ory tools to study this category of processes and we prove the existence of a critical arrival rate above which the system is always unstable. We then introduce a discretization of the dynamics to reduce the study of stability to which of a queuing network in a countable state space. We then find a closed form of the critical arrival rate using fluid limits arguments. In a second part\, we define a heuristics to estimate the steady-state densities of users in the network. The first one relies on a Poisson approximation of the steady-states processes and allows us to define a heuristic for the critical arrival rate of the network. The second heuristic uses a cavity approximation and a second-order approximation to improve the performance.\n\n CATEGORIES:Seminars,Youtube LOCATION:Salle 4A113 - TP @Palaiseau\, 19 place Marguerite Perey\, Palaiseau\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 4A113 - TP @Palaiseau:geo:0,0 END:VEVENT BEGIN:VEVENT UID:719@lincs.fr DTSTART;TZID=Europe/Paris:20220608T110000 DTEND;TZID=Europe/Paris:20220608T120000 DTSTAMP:20221010T100227Z URL:https://www.lincs.fr/events/easy-convex-optimization-in-python-with-cv xpy/ SUMMARY:Easy Convex Optimization in Python with CVXPY DESCRIPTION:Convex Optimization provide a set of fast\, practical tools and algorithms which have applications accross many fields\, from Machine Learning to Networking or Finance. However\, most solvers require their users to have some knowledge of convex optimization to leverage their power. On the other hand\, CVXPY is a Python-based modeling framework which enables users to specify their problem with little to no mastery of convex optimization. In this workshop we will:\n\n\nDiscover the basic concepts underlying CVXPY\,\nLearn how to formulate problems from machine learning and networking and solve them with CVXPY\,\nIntroduce how extensions of CVXPY can be used for non-convex problems.\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Telecom Paris\, 19 place marguerite perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:702@lincs.fr DTSTART;TZID=Europe/Paris:20220518T150000 DTEND;TZID=Europe/Paris:20220518T160000 DTSTAMP:20220704T160324Z URL:https://www.lincs.fr/events/operationalizing-machine-learning-in-real- world-networks/ SUMMARY:Operationalizing machine learning in real world networks DESCRIPTION:Applications of machine learning to networking\, from performance diagnosis to security\, have conventionally relied on models that are trained on offline packet traces\, without regard to the limitations of existing measurement systems nor the cost of gathering\, computing\, and storing the corresponding input features. As a result\, there remains a significant gap between the development of statistical models for network operations and their application and systemization in practice. In this talk\, we explore the challenges of operationalizing machine learning models in real world networks. First\, we develop new models to infer quality metrics (i.e.\, startup delay and resolution) for encrypted streaming video services and demonstrate the models are practical through a 16-month deployment in 66 homes. Building on the lessons learned\, we design and develop Traffic Refinery\, a new framework and system that enables a joint evaluation of both the conventional notions of machine learning performance (e.g.\, model accuracy) and the systems-level costs of different representations of network traffic. Traffic Refinery makes it possible to explore different representations for learning\, balancing systems costs related to feature extraction and model training against model accuracy.\n\n\nBio\nFrancesco Bronzino is an Assistant Professor (maitre de conference) at Université Savoie Mont Blanc. His research interests broadly focus on the Internet infrastructure and the services that populate it\, particularly studying how to leverage emergent technologies to engineer software systems designed to measure and improve network service performance. His work has been published papers in top-tier conferences in this area such as ACM Sigmetrics\, IEEE/ACM SEC\, and PAM.\nFrancesco received his Ph.D. in Electrical and Computer Engineering from WINLAB at Rutgers University\, working on the design of name based services for future Internet and mobile network architectures. Before joining Université Savoie Mont Blanc\, he was a Research Scientist at Nokia Bell Labs as well as Post-Doctoral research fellow at Inria Paris focusing on network systems for application quality monitoring and inference.\n CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:711@lincs.fr DTSTART;TZID=Europe/Paris:20220518T110000 DTEND;TZID=Europe/Paris:20220518T120000 DTSTAMP:20221010T100210Z URL:https://www.lincs.fr/events/introduction-to-submodular-functions/ SUMMARY:Introduction to submodular functions DESCRIPTION:Submodularity is a property that models "diminishing return"\, when the benefits of adding a new element to a set decreases with the size of the set. One of its main advantages is a guarantee on the performance of greedy algorithms for problems where the optimal solution is NP-hard.\nThis session aims at presenting submodular functions at a beginners' level:\n\n Equivalent definitions\;\n A few practical examples of submodular functions\;\n (1-1/e) approximation under cardinality constraints.\n\n\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:698@lincs.fr DTSTART;TZID=Europe/Paris:20220511T150000 DTEND;TZID=Europe/Paris:20220511T160000 DTSTAMP:20220513T072854Z URL:https://www.lincs.fr/events/lincs-young-researchers-elevator-pitch-pre sentation-n3-2022/ SUMMARY:LINCS young researchers "elevator pitch" presentation n°3/2022 DESCRIPTION:\n\n\nBizon Monroc\nClaire\nInria\nPhD\nInformatique\n\n\nLe Corre\nThomas \;\nInria\nPhD\nSmart greed\n\n\nShilov\nIlia \;\nInria\nPhD\nGame theoretic approaches for decentralized electricity markets\n\n\nWeber\nLucas\nInria\nPhD\nThéorie du controle/reinforcement learning\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:697@lincs.fr DTSTART;TZID=Europe/Paris:20220504T150000 DTEND;TZID=Europe/Paris:20220504T161500 DTSTAMP:20220513T072030Z URL:https://www.lincs.fr/events/lincs-young-researchers-elevator-pitch-pre sentation-n2-2022/ SUMMARY:LINCS young researchers "elevator pitch" presentation n°2/2022 DESCRIPTION: \;\n\n \n\n\nDavydov\nMichel \;\nInria\nPhD\nDynamiques markoviennes à base de processus ponctuels et leurs applications\n\n\nKhaniha\nSayeh \;\nInria\nPhD\n \;\n\n\nPopineau\ nPierre \;\nInria\nPhD\nStudy of the dynamics of spatial point processes\n\n\nRaynal\nMaxime\nNokia Bell Labs\nPhD\nAlarm prediction in communication networks via space-time pattern matching and explainable machine learning\n\n\nRoy Choudhury\nBharath \;\nInria\nPhD\n \;\n\n\nSun\nGuodong\nInria\nPh D\nNetwork Theory\n\n\n\n \;\n CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:709@lincs.fr DTSTART;TZID=Europe/Paris:20220504T110000 DTEND;TZID=Europe/Paris:20220504T120000 DTSTAMP:20221010T100155Z URL:https://www.lincs.fr/events/introduction-to-gym-and-stable-baselines-f or-reinforcement-learning/ SUMMARY:Introduction to Gym and Stable Baselines for reinforcement learning DESCRIPTION:Gym by OpenAI is an open source interface to reinforcement learning (RL) tasks. It comes with a set of standard tasks useful for benchmarking RL algorithms (CartPole\, Pendulum\, Walking Humanoid\, etc.)\, and an easy\, standardized way to create a learning environment for a research problem. Stable Baselines 3 provides a set of reliable\, rigorously tested PyTorch implementations of popular Deep RL algorithms to facilitate results replication. Together they can be used for fast and easy RL benchmarks and prototyping.\n\nIn this workshop we will:\n\n Discover the python gym library and explore standard RL tasks\,\n Use Stable Baselines 3 to benchmark RL models in a Gym environment\,\n Learn how to create a Gym environment for a specific learning task.\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:705@lincs.fr DTSTART;TZID=Europe/Paris:20220502T100000 DTEND;TZID=Europe/Paris:20220502T130000 DTSTAMP:20220426T074500Z URL:https://www.lincs.fr/events/phd-thesis-defense-model-based-reinforceme nt-learning-for-dynamic-resource-allocation-in-cloud-environments/ SUMMARY:PhD Thesis defense "Model-Based Reinforcement Learning for Dynamic Resource Allocation in Cloud Environments" DESCRIPTION:The emergence of new technologies (Internet of Things\, smart cities\, autonomous vehicles\, health\, industrial automation\, ...) requires efficient resource allocation to satisfy the demand. These new offers are compatible with new 5G network infrastructure since it can provide low latency and reliability. However\, these new needs require high computational power to fulfill the demand\, implying more energy consumption in particular in cloud infrastructures and more particularly in data centers. Therefore\, it is critical to find new solutions that can satisfy these needs still reducing the power usage of resources in cloud environments. In this thesis we propose and compare new AI solutions (Reinforcement Learning) to orchestrate virtual resources in virtual network environments such that performances are guaranteed and operational costs are minimised. We consider queuing systems as a model for clouds IaaS infrastructures and bring learning methodologies to efficiently allocate the right number of resources for the users. Our objective is to minimise a cost function considering performance costs and operational costs. We go through different types of reinforcement learning algorithms (from model-free to relational model-based) to learn the best policy. Reinforcement learning is concerned with how a software agent ought to take actions in an environment to maximise some cumulative reward. We first develop queuing model of a cloud system with one physical node hosting several virtual resources. On this first part we assume the agent perfectly knows the model (dynamics of the environment and the cost function)\, giving him the opportunity to perform dynamic programming methods for optimal policy computation. Since the model is known in this part\, we also concentrate on the properties of the optimal policies\, which are threshold-based and hysteresis-based rules. This allows us to integrate the structural property of the policies into MDP algorithms. After providing a concrete cloud model with exponential arrivals with real intensities and energy data for cloud provider\, we compare in this first approach efficiency and time computation of MDP algorithms against heuristics built on top of the queuing Markov Chain stationary distributions. In a second part we consider that the agent does not have access to the model of the environment and concentrate our work with reinforcement learning techniques\, especially model based reinforcement learning. We first develop model-based reinforcement learning methods where the agent can re-use its experience replay to update its value function. We also consider MDP online techniques where the autonomous agent approximates environment model to perform dynamic programming. This part is evaluated in a larger network environment with two physical nodes in tandem and we assess convergence time and accuracy of different reinforcement learning methods\, mainly model-based techniques versus the state-of-the-art model-free methods (e.g. Q-Learning). The last part focuses on model-based reinforcement learning techniques with relational structure between environment variables. As these tandem networks have structural properties due to their infrastructure shape\, we investigate factored and causal approaches built-in reinforcement learning methods to integrate this information. We provide the autonomous agent with a relational knowledge of the environment where it can understand how variables are related to each other. The main goal is to accelerate convergence by: first having a more compact representation with factorisation where we devise a factored MDP online algorithm that we evaluate and compare with model-free and model-based reinforcement learning algorithms\; second integrating causal and counterfactual reasoning that can tackle environments with partial observations and unobserved confounders. CATEGORIES:PhD Defense LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:704@lincs.fr DTSTART;TZID=Europe/Paris:20220427T110000 DTEND;TZID=Europe/Paris:20220427T120000 DTSTAMP:20221010T100123Z URL:https://www.lincs.fr/events/representing-reputation-in-a-multiagent-sy stem/ SUMMARY:Representing reputation in a multiagent system DESCRIPTION:We consider the problem of a multiagent system where entities meet and interact in a pairwise fashion. Agents may rate the outcome of the interaction (e.g.\, on a discrete scale). In time\, this allows to build a reputation score for each agent. The aim of this talk is to explore how the reputation is represented\, using a Bayesian approach\, in the Beta and Dirichlet reputation systems. The Dirichlet reputation system is the foundation of Subjective Logic\, which is a probabilistic logic system that allows to explicitly represent uncertainty along with beliefs. Subjective logic\, which provides among other things a formalism to treat transitivity of trust\, is very useful in the representation of trust networks.\n\n[1] A. Josang and R. Ismail\, The beta reputation system\, Proc. of the 15th bled electronic commerce conference\, 2002.\n\n[2] A. Josang and H. Jochen\, Dirichlet reputation systems\, Proc. of the Second IEEE International Conference on Availability\, Reliability and Security (ARES)\, 2007.\n\n[3] A. Josang\, Subjective Logic: A formalism for reasoning under uncertainty\, Springer Verlag\, 2016. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:695@lincs.fr DTSTART;TZID=Europe/Paris:20220420T150000 DTEND;TZID=Europe/Paris:20220420T160000 DTSTAMP:20220421T073241Z URL:https://www.lincs.fr/events/cache-allocation-in-multi-tenant-edge-comp uting-via-online-reinforcement-learning/ SUMMARY:Cache Allocation in Multi-Tenant Edge Computing via online Reinforcement Learning DESCRIPTION:\nWe consider in this work Edge Computing (EC) in a multi-tenant environment: the resource owner\, i.e.\, the Network Operator (NO)\, virtualizes the resources and lets third party Service Providers (SPs - tenants) run their services\, which can be diverse and with heterogeneous requirements. Due to confidentiality guarantees\, the NO cannot observe the nature of the traffic of SPs\, which is encrypted. This makes resource allocation decisions challenging\, since they must be taken based solely on observed monitoring information.\nWe focus on one specific resource\, i.e.\, cache space\, deployed in some edge node\, e.g.\, a base station. We study the decision of the NO about how to partition cache among several SPs in order to minimize the upstream traffic. Our goal is to optimize cache allocation using purely data-driven\, model-free Reinforcement Learning (RL). Differently from most applications of RL\, in which the decision policy is learned offline on a simulator\, we assume no previous knowledge is available to build such a simulator. We thus apply RL in an online fashion\, i.e.\, the policy is learned by directly perturbing the actual system and monitoring how its performance changes. Since perturbations generate spurious traffic\, we also limit them. We show in simulation that our method rapidly converges toward the theoretical optimum\, we study its fairness\, its sensitivity to several scenario characteristics and compare it with a method from the state-of-the-art.\n CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:678@lincs.fr DTSTART;TZID=Europe/Paris:20220413T150000 DTEND;TZID=Europe/Paris:20220413T160000 DTSTAMP:20220419T112659Z URL:https://www.lincs.fr/events/towards-an-interactive-visualization-of-th e-internet/ SUMMARY:Towards an interactive visualization of the Internet DESCRIPTION:All kinds of Internet maps have been produced to emphasize various features of the network such as undersea cables [1]\, relationships between autonomous systems [2] or the use of the IPv4 address space [3]. The Opte Project [4]\, started in 2003\, uses the Large Graph Layout algorithm [5] to visualize paths between autonomous systems and the evolution of the Internet over time. This project has been widely successful in communicating the nature of the Internet towards the world\, including a map on display at the Museum of Modern Art in New York City. In this presentation we will revisit The Opte Project with 1) much more comprehensive measurements of the Internet topology than previously available and 2) the use of web cartography tools to build interactive maps. We will demonstrate such an interactive map\, and discuss how these maps can be useful for research but also for communicating the nature of the Internet to non-specialists.\n \;\n[1] \;https://www.submarinecablemap.com\n[2]  \;https://www.caida.org/projects/cartography/as-core/\n[3] \;https ://www.caida.org/archive/id-consumption/census-map/\n[4] \;https://www. opte.org\n[5] Adai\, Alex T.\, et al. "LGL: creating a map of protein function with an algorithm for visualizing very large biological networks." \;Journal of molecular biology \;340.1 (2004): 179-190. CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:703@lincs.fr DTSTART;TZID=Europe/Paris:20220413T110000 DTEND;TZID=Europe/Paris:20220413T120000 DTSTAMP:20220422T140241Z URL:https://www.lincs.fr/events/architecture-in-object-oriented-programmin g-a-case-study/ SUMMARY:Architecture in Object-Oriented Programming: A Case Study DESCRIPTION:What is often done:\n\n Explain basics of OOP (e.g. syntax)\,\n Give principles of clean programming (e.g. SOLID) with simplified examples\, more or less realistic.\n\nWhat I propose in this session:\n\n Take a more realistic example\, based on my personal experience\,\n See cases where application of principles is not as obvious as in didactic examples\,\n Show how understanding the "spirit" of the principles is the most important\, to be able to adapt them to real problems.\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:696@lincs.fr DTSTART;TZID=Europe/Paris:20220406T150000 DTEND;TZID=Europe/Paris:20220406T161500 DTSTAMP:20220419T111614Z URL:https://www.lincs.fr/events/lincs-young-researchers-elevator-pitch-pre sentation-n1-2022/ SUMMARY:LINCS young researchers "elevator pitch" presentation n°1/2022 DESCRIPTION: \;\n\n \n\n\nElkael\nMaxime\nTélécom-SudParis (IMT)\nPhD\nReinforcement learning\, Networking\n\n\nBen Ameur\nAyoub \;\nTélécom-SudParis (IMT)\nPhD\nEdge computing\n\n\nBezerra de Araujo\nJoao Paulo\nTélécom-Paris (IMT)\nPhD\nBlockchain\n\n\nHuang\nWei\nTélécom-SudParis (IMT)\nPhD\nWireless Network\, Artificial Intelligence\n\n\nPatané\nRosario \;\nTélécom-SudParis (IMT)\nPhD\nVehiCloud: How can vehicles increase the cloud intelligence?\n\n\nSpallina\nAlessandro\nTélécom-Paris (IMT)\nIngenieur\n5G\, Edge computing\n\n\nTonkikh\nAndrei \;\nTélécom-Paris (IMT)\nPhD\nDistributed computing &\; Blockchain\n\n\n\n \;\n CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:701@lincs.fr DTSTART;TZID=Europe/Paris:20220406T110000 DTEND;TZID=Europe/Paris:20220406T120000 DTSTAMP:20220422T130258Z URL:https://www.lincs.fr/events/the-weakest-failure-detector-abstraction/ SUMMARY:The Weakest Failure Detector Abstraction DESCRIPTION:Many important distributed computing problems cannot be solved in purely asynchronous fault-prone systems. These impossibilities can be circumvented with failure detectors\, distributed oracles that provide computing units with hints about failures. The weakest failure detector for a given problem defines necessary and sufficient assumptions about failures that enable the problem's solutions. In this meeting\, we are going to discuss how to determine two important weakest failure detectors: (1) Omega\, the leader election failure detector for solving consensus and (2) Sigma\, the quorum failure detector for implementing read-write storage.\n\nLiterature:\n[1] Tushar Deepak Chandra\, Sam Toueg: Unreliable Failure Detectors for Reliable Distributed Systems. J. ACM 43(2): 225-267 (1996).\n[2] Tushar Deepak Chandra\, Vassos Hadzilacos\, Sam Toueg: The Weakest Failure Detector for Solving Consensus. J. ACM 43(4): 685-722 (1996).\n[3] Carole Delporte-Gallet\, Hugues Fauconnier\, Rachid Guerraoui: Tight failure detection bounds on atomic object implementations. J. ACM 57(4): 22:1-22:32 (2010). CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:686@lincs.fr DTSTART;TZID=Europe/Paris:20220330T150000 DTEND;TZID=Europe/Paris:20220330T160000 DTSTAMP:20220330T152727Z URL:https://www.lincs.fr/events/seminar-talk-by-prof-ravi-mazumdar/ SUMMARY:Learning Optimal Bids in Second Price Auctions with Temporal and Overlapping Targeting Constraints DESCRIPTION:Ad placement in web-browsing and wireless mobiles is an increasingly important component of the advertisement market. The market size is over $ 100 billion and counting. The mechanism is as follows: when a user opens a webpage or mobile ap a message is sent to an exchange where multiple bidders have the possibility of placing an ad that would target the right user\, eg. age\, sex\, location\, etc. The ad that is displayed corresponds to the bidder who bids the highest while the cost is calculated according to a first or second price. Typically bidders are DSP (Demand Side Platforms) that aggregate bids on behalf of clients who wish to run a campaign for a given length of time with certain targeting criteria. The goal is to minimize the total cost of obtaining the required number of impressions (ads that meet targeting criteria) over the duration of a contract. The real time constraint is that bidding must be done within 100ms.\n\nIn this talk I will build upon the theory that we had earlier developed for computing the least cost bids in the second price context. This involves the notion of an information state for the problem. There is a very rich primal-dual theory that emerges\, one in the so called impressions space and the other in the contracts space. Computationally and structurally the primal and dual views of the optimization have different properties that can be exploited to come up with fast algorithms.\n\nThe optimal solutions depend on solving a constrained convex optimization problem when the information state is known. However this is not readily available and thus there is the problem of learning the information state. We show that in the second price case\, stochastic approximation (SA) algorithms that operate on censored data (prices are only known by a bidder when the bidder wins) can be devised that solve the constrained optimization problem without learning the information state explicitly and we prove their convergence. Finally I will present the dynamic behaviour through simulations.\n\nJoint work with Ryan Kinnear (Waterloo) and Peter Marbach (Toronto). We thank Addictive Mobility Inc.\, a Pelmorex company for having proposed the problem and to Addictive Mobility\, Ontario OCE VIP II\, and NSERC funding the work.\nBiography:\nThe speaker was educated at the Indian Institute of Technology\, Bombay (B.Tech\, 1977)\, Imperial College\, London (MSc\, DIC\, 1978) and obtained his PhD in Control Theory under A. V. Balakrishnan at UCLA in 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. Prior to this he was Professor of ECE at Purdue University\, West Lafayette\, USA. Since 2012 he is a D.J. Gandhi Distinguished Visiting Professor at the Indian Institute of Technology\, Bombay\, India and since May 2019 an Adjunct Professor at the Tata Institute of Fundamental Research (TIFR)\, Mumbai. He is a Fellow of the IEEE and the Royal Statistical Society. He is a recipient of the INFOCOM 2006 Best Paper Award\, the ITC-27 2015 Best Paper Award\, the Performance 2015 Best Paper Award and was runner-up for the Best Paper Award at INFOCOM 1998. His research interests are in stochastic modelling and analysis applied to complex networks and statistical inference. CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:691@lincs.fr DTSTART;TZID=Europe/Paris:20220323T150000 DTEND;TZID=Europe/Paris:20220323T160000 DTSTAMP:20220322T211954Z URL:https://www.lincs.fr/events/geolink-a-multimodal-approach-internet-sca le-geolocation-system-for-improved-coverage-and-accuracy/ SUMMARY:GeoLink: a Multimodal approach Internet Scale Geolocation System for Improved Coverage and Accuracy DESCRIPTION:Despite being critical infrastructure\, it remains challenging to accurately position the physical location of Internet routers. In contrast to end-host geolocation where provider databases\, registry information\, and crowd-sourcing techniques can be successfully leveraged\, router geolocation is known to be relatively inaccurate. While concerted efforts by the research community have produced recent systems capable of significantly better accuracy\, their coverage is generally low\; a state-of-the-art systems is capable of geolocating only 7.6% of the router IP addresses in Internet scale topology datasets. We develop\, evaluate\, and make public the GeoLink system for geolocating router IP addresses at Internet scale. Our key insights are three-fold: i) utilize unique capabilities and properties of routers\, i.e.\, timestamps\, aliases\, and DNS names\; ii) use multiple active measurement techniques to derive per-link latencies and identify co-location\; and iii) combine existing techniques to improve coverage and refine candidate inferences. To bootstrap GeoLink\, we extract geolocation candidates from multiple data sources including existing geolocation databases\, DNS names\, and PeeringDB. We finally use our new measurement techniques to obtain sound link latencies\, extend coverage for bidirectional links\, and ensure aliases are location geo-consistent. On a large validation set\, GeoLink provides 5 times coverage improvement over existing systems\, while simultaneously lowering error.\n \;\nShort bio: \;\nKevin \;Vermeulen is a researcher at CNRS. He has obtained his doctorate at Sorbonne Université ok internet cartography in 2020 and did a postdoc at Columbia University on building systems to analyze and improve internet paths before joining the CNRS. He is interested in building measurement systems for a better understanding of the internet. CATEGORIES:Seminars LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:700@lincs.fr DTSTART;TZID=Europe/Paris:20220323T110000 DTEND;TZID=Europe/Paris:20220323T120000 DTSTAMP:20220324T132726Z URL:https://www.lincs.fr/events/a-brief-introduction-to-sagemath/ SUMMARY:A brief introduction to Sagemath DESCRIPTION:SageMath is a free open-source mathematics software system licensed under the GPL. It builds on top of many existing open-source packages: NumPy\, SciPy\, matplotlib\, Sympy\, Maxima\, GAP\, FLINT\, R and many more. This session will give a quick overview of the features of Sagemath and how to get starting using Sagemath.\n\nPrerequisite: either install Sagemath on your computer (https://doc.sagemath.org/html/en/installation/index.html) to benefit from all the functionalities\, or open a free account on CoCalc (https://cocalc.com) to use Sagemath online on a notebook (slow).\n\nUseful links:\n\n https://www.sagemath.org - the main webpage of Sagemath.\n https://doc.sagemath.org/html/en/installation/index.html - installation instructions (many ways).\n https://cocalc.com — CoCalc (Collaborative Calculation and Data Science) - you can open a free account to use Sagemath online.\n https://doc.sagemath.org/html/en/reference/index.html - reference manual of Sagemath.\n https://doc.sagemath.org/html/en/tutorial/index.html - some tutorials.\n https://www.sagemath.org/sagebook/ — book in open access « Computational Mathematics with Sagemath ».\n https://ask.sagemath.org — get help on coding with Sagemath (and so many examples).\n https://groups.google.com/g/sage-devel — report bugs\, get help installing Sagemath\, etc.\n https://cython.org — know more about Cython.\n https://trac.sagemath.org — Sagemath development page (tickets\, git\, etc.).\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:661@lincs.fr DTSTART;TZID=Europe/Paris:20220316T150000 DTEND;TZID=Europe/Paris:20220316T160000 DTSTAMP:20220323T143844Z URL:https://www.lincs.fr/events/cryptocurrency-wallet-security-solutions/ SUMMARY:Cryptocurrency Wallet Security Solutions DESCRIPTION:With the growing popularity of cryptocurrencies\, interest in digital signatures for securing keys is also on the rise. Researchers have been attempting since the 90’s to enhance known signature schemes with new properties useful in specific cases. Due to their use in cryptocurrencies\, threshold ECDSA and EdDSA signatures have received much attention in recent years. \;\n\nIn the past few months\, a range of protocols has been published\, allowing for non-interactive\, proactive security\, identifiable aborts\, fairness in the honest majority setting\, and other properties such as dynamic settings and interoperability. Proactive security and non-interactivity properties are the most studied solutions for cryptocurrency securities. Proactive security is the notion of defending a distributed system against an attacker who compromises different devices through its lifetime\, but no more than a threshold number of them at any given time. Non-interactivity: allowing a subset of a group of people to generate a signature without having to interact. A solution to the quest for noninteractivity is to divide the signature into two steps: the presigning (or offline) phase condenses most communication rounds and can be performed long before the signature is needed\, while the signing (or online) phase takes only a single round and happens after the message is chosen. Most protocols however require that the subset of the signers be fixed before presigning\, since they are the only ones who participate in it. \;\n\nIn this talk\, I will present our two novel non-interactive threshold ECDSA protocols that remove the need for this assumption either partially or entirely. The security of these schemes is proven in a simulation-based definition. To evaluate the performance of the second protocol\, it has been implemented in RUST and benchmarked. Additionally\, I will talk about the extension of this work towards proactive security and interoperability-based solutions. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:699@lincs.fr DTSTART;TZID=Europe/Paris:20220316T110000 DTEND;TZID=Europe/Paris:20220316T120000 DTSTAMP:20220318T190743Z URL:https://www.lincs.fr/events/wireless-communication-channel-for-dummies -like-me/ SUMMARY:Wireless communication channel for dummies (like me) DESCRIPTION:The bulk of the scientific talks on wireless communication begin with: "Let’s consider the classic model y = Hx where x and y are the transmitted and received (complex) signals\, respectively\, and H is the channel (complex) matrix." Let’s try to understand together what this means from basic principles. \n\nMaterial largely inspired from chapter 1\,3 of https://web.stanford.edu/~dntse/wireless_book.html.\n\nSlides. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:688@lincs.fr DTSTART;TZID=Europe/Paris:20220310T090000 DTEND;TZID=Europe/Paris:20220311T180000 DTSTAMP:20250416T140657Z URL:https://www.lincs.fr/events/international-workshop-on-v2x/ SUMMARY:LINCS-NEMO WORKSHOP on V2X DESCRIPTION:\nLINCS-NEMO workshop on vehicular networks\n\n\n\nProgram\n\nMARCH 2022\, THURSDAY 10TH AND FRIDAY 11TH \;(9AM – 6PM)\n\nTo make our vehicles smarter and our roads safer\, communications are of paramount importance: vehicles will communicate with other vehicles (V2V)\, with the infrastructure (V2I)\, and with everything (V2X). Enabling and exploiting V2X communication at scale is still facing a huge amount of challenges\, at all levels of the network protocol stack\, in terms of global network architecture\, up to the design of advanced next-generation applications.\n\nThis international workshop will bring together researchers from the industry and Academia working on a wide class of topics including models and performance of the physical communication channel at different bands\, vehicle positioning and sensing\, 5G networks for V2X\, overall network architecture\, services on top of V2X and their requirements\, edge computing for vehicular applications\, etc.\n\nOrganization Committee\n\n\n François Baccelli (Inria)\n Andrea Araldo (Télécom-SudParis)\n Anna Frisone (LINCS)\n\n\nTHE WORKSHOP WILL BE HELD IN A PRESENCE-REMOTE \;HYBRID \;FORM AT \;LINCS \;– 23 AVENUE D’ITALIE\, 75013 PARIS\n\nINTERACTIVE MAP FOR LUNCH OPTIONS CLOSE TO THE LINCS [CREDITS TO ALESSANDRO SPALLINA]\nhttps://www.google.com/maps/d/edit?mid=1L-wdmqbhM9Btn2DPITTox41e Tl2SmQJk&\;usp=sharing\nConfirmed speakers:\nOnur ALTINTAS \;– \;Toyota \;: “Cooperation in Automation”\n\n\nConnected\, automated\, shared and electric (CASE) continues to be the dominant keyword in the automotive industry. In this talk we will briefly look into the general computing and communications vision supporting CASE and summarize recent developments in connected vehicles area\, including emerging standards.\n\nCarla CHIASSERINI \;– \;PoliTo \;: “Crowd-sourcing learning: Leveraging Connected Cars in ML Tasks”\n\nOne of the fundamental components of many applications in the automotive domain is represented by a machine learning (ML) task. At the same time\, vehicles are becoming mobile\, powerful computers that can gather\, share\, and process data\; thus\, they can not only consume services\, but also contribute to enabling ML-based applications. This can be enacted through distributed learning approaches\, according to which the learning process is split among a number of computing nodes. Distributed learning\, however\, may lead to significant communication overhead\, or to learners converging to different models. In this talk\, we therefore introduce a new distributed learning scheme that\, with the assistance of the network edge\, aims at exploiting the vehicles’ data and computing capabilities\, while enabling an accurate learning process. Further\, the talk will discuss different approaches to distributed learning and edge computing that can effectively involve connected vehicles.\n\nChang-sik CHOI \;– \;Hongik University \;: “Stochastic Geometry for Modeling and Analysis of Vehicular Networks”\n\nIn this lecture\, I will talk about recent work on the modeling and analysis of vehicular networks based on stochastic geometry.  \;I will cover a few topics such as SIR of vehicle-to-all communications\, data harvesting based on vehicles\, and an analytical framework for blockage. This lecture aims to provide a high-level idea on mathematical frameworks such as the Cox point process\, random graphs\, and Boolean model\, to characterize vehicular network architectures and to identify new challenges therein.\n\nHarpreet DHILLON \;– \;VirginiaTech \;“Poisson Line Cox Process: Distributional Properties and Applications to Vehicular Networks”\n\nIn this talk\, we present a doubly-stochastic model for vehicular networks\, termed the Poisson Line Cox Process (PLCP)\, in which the layout of the roads is modeled as a Poisson line process (PLP) and the wireless nodes\, such as vehicles and roadside units\, are modeled as independent Poisson point processes (PPPs) on each road. We will first share a brief historical perspective of PLP tracing back to a question posed by Neils Bohr that inspired early work on line processes. We will then discuss the construction of PLCP and a few representative distributional properties to highlight its analytical tractability. The rest of the talk will focus on the applications of PLCP to vehicular networks. Our specific focus will be on the rate and coverage analysis of a comprehensive cellular vehicle-to-everything (C-V2X) setup consisting of vehicular nodes\, roadside units\, and macrocellular base stations. As a part of this analysis\, we will also discuss some results related to the load served by macrocellular base stations and roadside units that will rely on understanding the intersection of PLP with the typical cell of an independent Poisson Voronoi tessellation modeling the service regions of macrocellular base stations. We will conclude the talk with a comparison of this model with the one used in 3GPP simulation studies. Time permitting\, we will also discuss the problem of shortest path distance distribution in PLCP and its potential applications to vehicular networks.\n\nFalko DRESSLER \;– \;TU Berlin \;: “From Vehicular Networking to 5G and Mobile Edge Computing to 6G and Virtual Edge Computing”\n\nWe will discuss the challenges and opportunities of the connected cars vision in relation to the need for distributed data management solutions ranging from the vehicle to the mobile edge and to the data centers. Vehicular networking solutions have been investigated for more than a decade but recent standardization efforts just enable a broad use of this technology to build large scale Intelligent Transportation Systems (ITS). Modern 5G networks promise to provide all means for communication in this domain\, particularly when integrating Mobile Edge Computing (MEC). However\, it turns out that despite the many advantages\, it is unlikely that such services will be provided with sufficient coverage. As a novel concept\, vehicle micro clouds have been proposed that bridge the gap between fully distributed vehicular networks based on short range device to device communication and 5G-based infrastructure. Using selected application examples\, we assess the advantages of such systems. We conclude the talk by shedding light on future virtual edge computing concepts that will enable edge computing even considering minimal deployment and coverage of 5G MEC.\n\nThierry ERNST \;– \;YoGoKo \;: “Cooperative ITS standards and technologies for automated connected &\; cooperative mobility”\n\nIn this talk\, Dr. Thierry Ernst is going to highlight the technologies and standards developed for Cooperative Intelligent Transport Systems (C-ITS) services\, i.e. services developed to share data between vehicles\, other road users\, the roadside infrastructure\, the urban infrastructure\, and control and service centers in the cloud. This sharing of data is essential to improve road safety and traffic efficiency and to develop many other innovative value added services for mobility of people and goods\, including but not limited to connected cooperative and automated mobility (CCAM). This presentation will particularly highlight standards developed at ISO\, CEN and ETSI under deployment in Europe and other regions in the world. C-ITS services under deployment rely on the ITS station communication and data management architecture. This architecture combines localized communication technologies (without support of telecom infrastructure) together with networked communication technologies (with support of telecom infrastructure) and facilities to manage and share data between various service domains and stakeholders. \;\n\nNuria GONZÁLEZ PRELCIC \;– \;NC State \;: “Integrating sensing and communication in millimeter wave vehicular networks”\n\nWireless networks are incorporating millimeter wave spectrum and beyond. This\, together with MIMO \; technology using large antenna arrays\, provides the key ingredients to develop integrated communication and sensing systems that exploit the similarities between the required hardware\, \; the signal processing algorithms or the sensing and communication channels. This is especially relevant in vehicular networks\, given the wealth of sensors available in a vehicular environment and the impact on safety that sensing capabilities can provide. In this talk\, I provide an overview of machine learning and signal processing techniques that enable different types of integration between sensing and communication. First\, I describe alternative strategies that pursue a fruitful collaboration among collocated sensing and communication modules which may be using different hardware or radio resources. I discuss algorithms for sensor-aided millimeter wave communication that significantly reduce the overhead associated with link configuration and reconfiguration or enable early blockage detection and array reconfiguration. Then I review the opposite setting: sensing aided by communications and its applications\, where communication provides information for enhanced sensing. Leveraging communication for sensing gives a new perspective on joint communication\, tracking and localization at mmWave frequencies. Throughout the talk\, I make the case that time is right for communication and sensing to be considered together. I also explain why communication and sensing will likely to be the defining physical layer feature of 6G.\n\nMartin HAENGGI \;– \;Notre Dame \;: “Transdimensional Modeling and Reliability Analysis of Vehicular Networks on General Street Systems”\n\nDue to their rapidly changing topology\, vehicular networks are naturally modeled and analyzed using tools from stochastic geometry. If links are required to be highly reliable\, as in vehicular safety messaging\, it is essential to find the maximum link density or distance or transmit probability that can be accommodated under a reliability constraint. To answer these questions\, standard spatial averages are inadequate\; instead\, meta distributions (distributions of conditional distributions) need to be derived\, which is considerably harder. To do so while maintaining wide generality in the underlying street system we propose an approximate approach based on transdimensional models\, which are a union of one- and two-dimensional point processes. This leads to significant simplifications and allows for a unified treatment of models with finite and infinitely long streets and intersections of arbitrary order.\n\nRobert HEATH \;– \;NC State \;: “Beam training in V2X leveraging machine learning”\nMillimeter-wave (MmWave) vehicular communication enables massive sensor data sharing in vehicular systems\, leading to enhances in automation\, safety\, transportation efficiency and infotainment. Estimating and tracking beams in mmWave vehicular communication\, however\, is challenging due to the use of large antenna arrays and high mobility in the vehicular context. In this talk\, I introduce data-driven approaches for beam training that leverage position information or underlying channel statistics to reduce training overhead. Data driven machine learning is valuable for V2X given the underlying correlations that can be exploited as vehicles travel similar paths through the environment.\n \;\nVincenzo MANCUSO \;– \;IMDEA Networks \;: “Edge-assisted platooning control and optimization”\n\nGrouping vehicles into platoons promises to improve road capacity\, driver safety\, and fuel consumption. However\, when large platoons have to allow for cross traffic maneuvers\, e.g.\, because of highway junctions\, the ability to control single large platoons is not sufficient\, and chaining smaller platoons becomes necessary. To this aim we study how to harmonically coordinate the maneuvers of multiple platoons and define a multi-platoon control architectures\, analyzing costs and benefits of multi-platooning and investigating on the feasibility of edge-controlled multi-platoons. We also consider distributed machine learning tools to handle the platoon control as a virtual network function residing at the edge of a cellular network. Using simulation\, we show that multi-platoons can be effectively controlled as long as the latency between individual platoon managers and the multi-platoon manager is kept below a few tens of milliseconds. Instead\, the latency between vehicles and managers is one order of magnitude less critical.\n\nTien viet NGUYEN \;– \;Qualcomm \;: “V2X at Qualcomm”\n\nNowadays\, with the proliferation of electronics components\, vehicles on the roads are becoming ever smarter and more connected. At Qualcomm technology\, we pioneer the ubiquitous 5G connection between vehicles to the cloud\, V2X communication among vehicles and infrastructure to provide maximum benefits to the transportation ecosystem. In this talk\, we would like to showcase three examples where such connectivity improves the safety\, positioning\, and enhanced user experience. In the first example\, we provide an example where the ubiquitous 5G connection helps to address the issue of vehicular radar interference. The second example demonstrates how V2X communication can augment positioning in scenarios where GNSS is not available. In the third example\, we show how such communication can improve safety and driver experience by providing real time information about traffic conditions and road hazards.\n\nVitaly PETROV \;– \;Nokia Bell Labs \;: “Terahertz Band Vehicular Communications”\n\nFuture smart connected vehicles are envisioned to incorporate high-data rate communications and high-resolution radar sensing capabilities operating in the millimeter-wave and (sub-)terahertz (THz) frequencies. This lecture will cover the recent progress in developing terahertz band wireless systems focusing on vehicular setups. The specifics of THz wireless channel are first revealed. Then\, several aspects are discussed related to the design of reliable and efficient solutions for physical and link layers. Finally\, some open research problems in the area are outlined.\n\nOyunchimeg SHAGDAR \;– \;VEDECOM \;: “Message Redundancy and Congestion Control for V2X Collective Perception Service”\n\nOne of the key roles of C-ITS is to contribute in extending perception of vehicles and road users so that they can avoid potential accidents. Such an extended perception is built by information exchange among vehicles\, pedestrians\, and infrastructure using different types of messages including Cooperative Awareness Message (CAM) and Collective Perception Message (CPM). The data carried by these messages are critical\, however\, they can be resource-consuming and may contain highly redundant information. In this work\, we propose a context-aware CPM generation schemes that take into account message contents and roadside infrastructure availability. An extensive simulation has been carried out to evaluate the performances of the schemes. The results present remarkable performance improvements provided by the schemes\, particularly in terms of Packet Delivery Ratio (PDR)\, CBR (Channel Busy Ratio)\, and awareness rate compared to the conventional non-context-aware CPM generation strategy.\n\nHenk WYMEERSCH \;– \;Chalmers \;: “Radio-Localization for 5G and Beyond 5G V2X”\n\nIncreases in carrier frequencies and bandwidths\, driven by high-rate communication applications have led to vastly improved capabilities for user positioning. With research underway towards 6G\, opportunities for integrating positioning and sensing into the communication system have become even more apparent. The aim of this talk is to provide an overview of this evolution\, focusing on 5G and 6G. The talk will comprise 3 main parts: first\, the foundations of radio-based positioning are introduced. Second\, we go deeper into 5G positioning\, covering both the standard approaches\, as well as more forward-looking potential modifications. In the last part\, we consider 6G from the perspective of positioning and sensing\, highlighting some of the novel enablers\, methods\, potentials\, but also the corresponding challenges.\n\n \;\nGiven the limited number of places due to anti-covid restrictions\, we invite you to register through the \;link \;here below \;to receive the details of the \;Zoom streaming. We’ll keep you posted about the possibility to attend in presence.\nRegistration LINK\n \;\n\n \; ATTACH;FMTTYPE=image/jpeg:https://www.lincs.fr/wp-content/uploads/2022/02/ V2X-image.png CATEGORIES:Other Worshops,Workshop LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:687@lincs.fr DTSTART;TZID=Europe/Paris:20220302T150000 DTEND;TZID=Europe/Paris:20220302T160000 DTSTAMP:20220318T190714Z URL:https://www.lincs.fr/events/wireless-scheduling-subject-to-slice-const raints/ SUMMARY:Wireless scheduling subject to slice constraints DESCRIPTION:We present methods for achieving slice guarantees in cellular networks by adjusting the MAC scheduling weights. A network slice is a portion of a network that is carved out for a particular set of users or a particular type of traffic. One slice provided by a national operator could be used to support a Mobile Virtual Network Operator (MVNO)\, another could support Ultra-Reliable Low Latency Communication for vehicular applications\, and a third could support an enterprise application such as an advanced wireless enabled factory.\nOur goal is to optimize network utility (e.g. Proportional Fairness) subject to a variety of slice constraints such as the minimum aggregate rate provided to a slice\, the minimum total resources provided to a slice\, or a guarantee on the fairness of service within a slice. We show how such constraints can be achieved using multiplicative or additive adjustments to the standard Proportional Fair scheduler weights and we analyze the differences between the two approaches. We also discuss how the interaction between the constraints can make the situation significantly more complex than the analogous problem with single-user minimum rate constraints only. For example\, with minimum resource constraints the optimum solution can lie in the interior of the achievable rate region.\nThis is joint work with Sem Borst\, Siegfried Klein\, Hans Kroener and Silvio Mandelli. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:694@lincs.fr DTSTART;TZID=Europe/Paris:20220302T110000 DTEND;TZID=Europe/Paris:20220302T120000 DTSTAMP:20220318T190803Z URL:https://www.lincs.fr/events/solid-principles-in-object-oriented-progra mming/ SUMMARY:SOLID Principles in Object-Oriented Programming DESCRIPTION:Once you know the basics of object-oriented programming\, a more difficult step can be to design the architecture of your code for a given project: what should be an object\, how to organize the classes\, how to make them work together\, etc. To that end\, you can find help in the programming principles gathered in the SOLID acronym:\n\n Single-Responsibility Principle.\n Open-Closed Principle.\n Liskov Substitution Principle.\n Interface Segregation Principle.\n Dependency Inversion Principle.\n\nIn this talk\, I will explain what these esoteric terms mean and illustrate them with very simple examples\, requiring only a minimal knowledge of Python.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:693@lincs.fr DTSTART;TZID=Europe/Paris:20220223T110000 DTEND;TZID=Europe/Paris:20220223T120000 DTSTAMP:20220318T190826Z URL:https://www.lincs.fr/events/application-of-stream-graphs-theory-on-int ernet-topology/ SUMMARY:Application of stream graphs theory on internet topology DESCRIPTION:The network topology of the internet and its dynamics has been studied extensively for two decades. Meanwhile\, Latapy et al. extended graph theory to capture the temporal and structural nature of interactions. In this session we propose to present the stream graphs and link streams work applied to internet topology dynamics. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:692@lincs.fr DTSTART;TZID=Europe/Paris:20220218T143000 DTEND;TZID=Europe/Paris:20220218T170000 DTSTAMP:20220217T121502Z URL:https://www.lincs.fr/events/phd-thesis-defense-andrian-putina/ SUMMARY:PhD thesis defense "Unsupervised Anomaly Detection: Methods and applications" DESCRIPTION:An anomaly (also known as outlier) is an instance that significantly deviates from the rest of the input data and being defined by Hawkins as an observation\, which deviates so much from other observations as to arouse suspicions that it was generated by a different mechanism.Anomaly detection (also known as outlier or novelty detection) is thus the machine learning and data mining field with the purpose of identifying those instances whose features appear to be inconsistent with the remainder of the dataset. In many applications\, correctly distinguishing the set of anomalous data points (outliers) from the set of normal ones (inliers) proves to be very important. A first application is data cleaning\, i.e.\, identifying noisy and fallacious measurement in a dataset before further applying learning algorithms.However\, with the explosive growth of data volume collectable from various sources\, e.g.\, card transactions\, internet connections\, temperature measurements\, etc. the use of anomaly detection becomes a crucial stand-alone task for continuous monitoring of the systems. In this context\, anomaly detection can be used to detect ongoing intrusion attacks\, faulty sensor networks or cancerous masses.The thesis proposes first a batch tree-based approach for unsupervised anomaly detection\, called Random Histogram Forest (RHF). The algorithm solves the curse of dimensionality problem using the fourth central moment (aka kurtosis) in the model construction while boasting linear running time. A stream based anomaly detection engine\, called ODS\, that leverages DenStream\, an unsupervised clustering technique is presented subsequently and finally Automated Anomaly Detection engine which alleviates the human effort required when dealing with several algorithm and hyper-parameters is presented as last contribution. CATEGORIES:PhD Defense LOCATION:Zoom + Amphi 5 chez Télécom-Paris\, 19 place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + Amphi 5 chez Télécom-Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:670@lincs.fr DTSTART;TZID=Europe/Paris:20220216T150000 DTEND;TZID=Europe/Paris:20220216T160000 DTSTAMP:20220223T154655Z URL:https://www.lincs.fr/events/securing-communications-in-the-c-its/ SUMMARY:Securing communications in the C-ITS DESCRIPTION:Cooperative Intelligent Transport Systems allow connected vehicles to communicate with each other\, with the road-side infrastructure\, and with other smart devices to improve road safety and optimize traffic efficiency. They allow to develop new services to prepare future semi-automated or fully automated vehicles.\nApplications are based on the exchange of V2X beacons broadcast by stations and received by neighboring vehicles. The beacons contain alerts and/or kinematic information of the originating station.\n \;\nThe functionality of the services and the safety of their operation depend on the correctness of the communication between stations. In this talk we explore the characteristics of the vehicular network and the measures that can be taken to secure the communication within the C-ITS. CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:675@lincs.fr DTSTART;TZID=Europe/Paris:20220209T143000 DTEND;TZID=Europe/Paris:20220209T173000 DTSTAMP:20220201T095020Z URL:https://www.lincs.fr/events/graph-based-contributions-to-machine-learn ing/ SUMMARY:Graph-based contributions to machine learning DESCRIPTION:A graph is a mathematical object that makes it possible to represent relationships (called edges) between entities (called nodes). Graphs have long been a focal point in a number of problems ranging from work by Euler to PageRank and shortest-path problems. In more recent times\, graphs have been used for machine learning.\n\nWith the advent of social networks and the world-wide web\, more and more datasets can be represented using graphs. Those graphs are ever bigger\, sometimes with billions of edges and billions of nodes. Designing efficient algorithms for analyzing those datasets has thus proven necessary. This thesis reviews the state of the art and introduces new algorithms for the clustering and the embedding of the nodes of massive graphs. Furthermore\, in order to facilitate the handling of large graphs and to apply the techniques under study\, we introduce Scikit-network\, a free and open-source Python library which was developed during the thesis. Many tasks\, such as the classification or the ranking of the nodes using centrality measures\, can be carried out thanks to Scikit-network.\n\nWe also tackle the problem of labeling data. Supervised machine learning techniques require labeled data to be trained. The quality of this labeled data has a heavy influence on the quality of the predictions of those techniques once trained. However\, building this data cannot be achieved through the sole use of machines and requires human intervention. We study the data labeling problem in a graph-based setting\, and we aim at describing the solutions that require as little human intervention as possible. We characterize those solutions and illustrate how they can be applied in real use-cases. CATEGORIES:PhD Defense,Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:690@lincs.fr DTSTART;TZID=Europe/Paris:20220209T110000 DTEND;TZID=Europe/Paris:20220209T120000 DTSTAMP:20220217T134455Z URL:https://www.lincs.fr/events/object-oriented-programming-in-python/ SUMMARY:Object-Oriented Programming in Python DESCRIPTION:We will deep dive into the OOP paradigm and see how it’s implemented in Python. This session will be beginner-friendly and aims to give explanations and practical examples on how to use OOP in a regular basis.\n\nSlides\nProgress sheet: https://docs.google.com/spreadsheets/d/1lBwaAsTdWx8Pl8WSZWLbaOb89MqBA7qmAE0 qxsZ-_og/edit?usp=sharing\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:674@lincs.fr DTSTART;TZID=Europe/Paris:20220202T150000 DTEND;TZID=Europe/Paris:20220202T160000 DTSTAMP:20220204T123752Z URL:https://www.lincs.fr/events/the-quantum-internet-recent-advances-and-c hallenges/ SUMMARY:The Quantum Internet: Recent Advances and Challenges DESCRIPTION:Quantum information processing is at the cusp of having significant impact 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)\, and polynomial speeds up on 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”. This motivates our study of quantum networks\, namely what is the right architecture and how should it operate\, i.e.\, route multiple quantum information flows\, and dynamically allocate resources fairly.\n\nIn this talk I will review a specific class of quantum networks - those that generate and distribute entangled quantum states to pairs or groups of users. I will present opportunities and challenges related to resource sharing in such networks focusing on similarities to and differences from classical networks. I will also present challenges of analyzing the performance of such networks. I will end the talk with a list of open problems. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:689@lincs.fr DTSTART;TZID=Europe/Paris:20220202T110000 DTEND;TZID=Europe/Paris:20220202T120000 DTSTAMP:20220217T134630Z URL:https://www.lincs.fr/events/infinite-hidden-markov-models/ SUMMARY:Infinite Hidden Markov Models DESCRIPTION:The Hidden Markov Model is a generative model in which the distribution of the observations depends on the state of a Markov chain. These models have been successfully applied to many problems\, including part-of-speech tagging\, handwriting recognition and time series clustering. A common issue is to infer the parameters of the HMM\, given a set of observations\, when the number of latent states is unknown. A traditional approach is to evaluate models of different dimensions and choose the one that offers a good compromise between the complexity of the model\, and its adequacy to the data\, in order to prevent over-fitting.\n\nIn this talk we will present the Infinite Hidden Markov Model\, or HDP-HMM (Hierarchical Dirichlet Process Hidden Markov Model)\, which offers an alternative solution to this problem. The HDP-HMM generalizes the HMM model by considering the number of state itself as an unknown quantity to be inferred\, through Bayesian inference. We will discuss the HDP-HMM and its variants\, as well as an application to network delay time series clustering.\n\nReferences\n[1] Beal\, M. J.\, Ghahramani\, Z.\, &\; Rasmussen\, C. E. (2002). The infinite hidden Markov model. Advances in neural information processing systems\, 1\, 577-584.\nhttps://people.csail.mit.edu/jrennie/trg/papers/beal-ihmm-03.pdf\ n[2] Fox\, E. B.\, Sudderth\, E. B.\, Jordan\, M. I.\, &\; Willsky\, A. S. (2011). A sticky HDP-HMM with application to speaker diarization. The Annals of Applied Statistics\, 1020-1056.\nhttp://willsky.lids.mit.edu/publ_pdfs/204_pub_AAS.pdf CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:684@lincs.fr DTSTART;TZID=Europe/Paris:20220126T150000 DTEND;TZID=Europe/Paris:20220126T160000 DTSTAMP:20220202T093612Z URL:https://www.lincs.fr/events/a-stochastic-matching-between-graph-theory -and-linear-algebra/ SUMMARY:A stochastic matching between graph theory and linear algebra DESCRIPTION:Stochastic dynamic matching has numerous applications\, ranging from \;supply-chain management to kidney exchange programs. In a matching \;problem\, different classes arrive according to independent Poisson \;processes. Unmatched items are stored in a queue\, and two items can be \;matched if their classes are neighbors in a (simple) compatibility \;graph. We analyze the efficiency of matching policies in terms of \;system stability and of matching rates between different classes. Our \;results\, which rely on the observation of the conservation equation \;between departures and arrivals\, are threefold. We first relate the \;way the conservation equation maps arrival and departure vectors\, the \;structure of the compatibility graph\, and the existence of a stable \;policy. This allows us to derive a necessary and sufficient stability \;condition that is verifiable in polynomial time. Secondly\, we describe \;the convex polytope of non-negative solutions of the conservation \;equation. When this polytope is reduced to a single point\, we give a \;closed-form expression of the solution\; in general\, we characterize \;the vertices of this polytope using again the graph structure. Lastly\, \;we show that greedy policies cannot\, in general\, achieve every point \;in the polytope. In contrast\, non-greedy policies can at least reach \;any point of the interior of this polytope\, and can also reach its \;boundary if a specific condition on its vertices is checked.\n \;\nThis is a joint work with Céline Comte and Ana Bušic. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:666@lincs.fr DTSTART;TZID=Europe/Paris:20220119T150000 DTEND;TZID=Europe/Paris:20220119T160000 DTSTAMP:20220125T051804Z URL:https://www.lincs.fr/events/accountable-distributed-computing/ SUMMARY:Accountable distributed computing DESCRIPTION:There are two major ways to deal with failures in distributed computing: fault-tolerance and accountability. Fault-tolerance intends to anticipate failures by investing into replication and synchronization\, so that the system’s correctness is not affected by faulty components. In contrast\, accountability enables detecting failures a posteriori and raising undeniable evidences against faulty components.\n\nIn this talk\, we discuss how accountability can be achieved\, both in generic and application-specific ways. We also discuss how fault detection can be combined with reconfiguration\, opening an avenue towards "self-healing" systems that seamlessly replace faulty components with correct ones. CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:685@lincs.fr DTSTART;TZID=Europe/Paris:20220119T110000 DTEND;TZID=Europe/Paris:20220119T120000 DTSTAMP:20220121T094914Z URL:https://www.lincs.fr/events/developping-in-python/ SUMMARY:Developping in Python DESCRIPTION:When you develop a Python project\, it is highly recommended that you design it as a Python package\, which gives you access to a variety of powerful development tools. With Package Helper 2\, it is easy and fast to do it! Things will go this way:\n\n The file structure of your package is created in less than a minute with Cookiecutter.\n The PyCharm editor is configured to generate the documentation locally and run the unit tests.\n Your documentation includes a “coverage” page\, which displays what parts of the package are covered by the unit tests.\n Your project is hosted on GitHub\, which is configured to run the unit tests with several versions of Python and to automatically generate and publish the documentation.\n When desired\, GitHub publishes your package on PyPI\, so that any Python user can install it.\n\n\nTutorial: https://package-helper-2.readthedocs.io/en/latest/tutorial.html.\n\nProgres s Sheet: https://docs.google.com/spreadsheets/d/19dI-wMSOaWd_OSoBoOtZRMJY7AMrdRz3UIV -BpcABGI/edit?usp=sharing. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:683@lincs.fr DTSTART;TZID=Europe/Paris:20220112T110000 DTEND;TZID=Europe/Paris:20220112T120000 DTSTAMP:20220125T052754Z URL:https://www.lincs.fr/events/poisson-approximations-of-sums-of-bernoull i-random-variables/ SUMMARY:Poisson approximations of sums of Bernoulli random variables DESCRIPTION:Approximation by Poisson distributions or processes is of great interest in many applications including networks\, queueing theory and even neuroscience\, as the Poisson distribution arises as a natural limit distribution in many situations involving independent "rare" events. In this talk\, we propose to give an overview of classical methods of Poisson approximation of sums of Bernoulli random variables. We will first focus on Le Cam's result for the case of independent random variables and give a proof based on the coupling method. We will then focus on the case when the variables are not necessarily independent and present the classical Chen-Stein method. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:682@lincs.fr DTSTART;TZID=Europe/Paris:20211215T110000 DTEND;TZID=Europe/Paris:20211215T120000 DTSTAMP:20220121T095406Z URL:https://www.lincs.fr/events/testing-in-python-2/ SUMMARY:Testing in Python DESCRIPTION:Thanks to its dynamic nature\, it is extremely easy to prototype code with Python.\nHowever\, this also means that it is difficult to catch errors before executing the program.\nSoftware tests allow to automatically check the behavior of a program\, thus freeing time for the developer\, and increasing the confidence in the correctness of the program.\nIn this session we will discuss the test facilities provided by Python\, to write robust and self-documenting code.\n\nSlides\n\nProgress sheet\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:673@lincs.fr DTSTART;TZID=Europe/Paris:20211208T150000 DTEND;TZID=Europe/Paris:20211208T160000 DTSTAMP:20230203T100902Z URL:https://www.lincs.fr/events/meta-distributions-and-joint-geometric-mod eling-of-cellular-networks/ SUMMARY:Meta Distributions and Joint Geometric Modeling of Cellular Networks DESCRIPTION:In cellular networks\, there is a growing emphasis on the user experienced performance and ultra-reliable low-latency communications. This necessitates an analysis of the performance achieved by most users most of the time\, rather than a subset of users with peak performance.  To this end\, the meta distribution is introduced as an essential analytical tool in the framework of stochastic geometry. In the first part of the talk\, we discuss some analytical results about the meta distribution in cellular networks. Exploiting the independence between the small-scale fading and the large-scale path loss\, we derive the separability of the meta distribution for arbitrary fading in Poisson networks. We further look at the impact of fading statistics\, noise\, and the network geometry.In the second part\, we propose a joint spatial-propagation model for coverage-oriented cellular networks. This model ascribes the irregular deployment of base stations to an intelligent design by the operators and reverse-engineers the underlying cell-dependent shadowing from the shape and size of the Voronoi cells. CATEGORIES:Seminars LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:680@lincs.fr DTSTART;TZID=Europe/Paris:20211208T110000 DTEND;TZID=Europe/Paris:20211208T120000 DTSTAMP:20220121T094734Z URL:https://www.lincs.fr/events/mimo-performance-from-theory-to-practice/ SUMMARY:MIMO Performance: From Theory to Practice DESCRIPTION:In the past decades\, multiple antenna systems were widely employed in modern wireless network to improve the communication performance. For example\, iPhone XS is equipped with six antennas and Nokia 5G AirScale has up to sixty-four antennas. How multiple input multiple output (MIMO) technique boosts both the channel capacity and link reliability simultaneously? In this reading group sharing\, I will discuss the theoretical foundation of MIMO setup by Emre Telatar at the end of 20th century and a powerful statistical tool\, Wishart distribution\, to analyze MIMO performance. Then I will go through its development from early days point-to-point MIMO to today’s massive MIMO. We can discover how MIMO overcomes the challenges along the way of bringing theoretical analysis into current real applications.\nHere the presentation's slides. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:681@lincs.fr DTSTART;TZID=Europe/Paris:20211201T104500 DTEND;TZID=Europe/Paris:20211201T120000 DTSTAMP:20211201T152805Z URL:https://www.lincs.fr/events/mpls-in-internet-topologies/ SUMMARY:MPLS in Internet topologies DESCRIPTION:Dear all\, The Internet Measurement reading group will meet on Wednesday 1st.\n\nIn this session\, Matthieu Gouel (Sorbonne Université\, LIP6) will talk about MPLS in Internet topologies.\n\nI encourage you to join us at 10:45 for a virtual coffee break\, so that the talk begins at 11:00.\nhttps://telecom-paris.zoom.us/j/98157419805?pwd=eHNMNHZqSE1samt yUmVNRE1TZjRpdz09\n\nAbstract\n\n\nMPLS is now widely used by autonomous systems to carry IP packets through their network. In order to detect MPLS tunnels\, multiple active measurement techniques have been developed. \nIn this reading group we talk about how to detect MPLS tunnels and how it affects Internet topologies with the support of multiple papers.\n\nPaper list:\n\n Revealing MPLS Tunnels Obscured from Traceroute (Benoit Donnet et. al.)\n Unveiling the MPLS Structure on Internet Topology (Gabriel Davila Revelo et. al.)\n Through the Wormhole: Tracking Invisible MPLS Tunnels (Yves Vanaubel et. al.)\n TNT\, Watch me Explode: A Light in the Dark for Revealing MPLS Tunnels (Yves Vanaubel et. al.)\n\n CATEGORIES:Internet Measurement,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:679@lincs.fr DTSTART;TZID=Europe/Paris:20211124T110000 DTEND;TZID=Europe/Paris:20211124T120000 DTSTAMP:20211125T095545Z URL:https://www.lincs.fr/events/pycharm/ SUMMARY:PyCharm DESCRIPTION:While Python offers a useful command-line interface\, it is often more productive to rely on an IDE (Integrated Development Environment) for larger projects. In this session\, we will present PyCharm Community Edition\, a free and popular Python IDE. We will review its main features\, including:\n\n Project management\,\n Code completion\,\n Refactoring\,\n Debugging\,\n Keyboard shortcuts.\n\nPrerequisite: your computer with a working Python installation.\n\nSlides\n\nProgress sheet\n\n\n\n \;\n\n \; CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:671@lincs.fr DTSTART;TZID=Europe/Paris:20211117T150000 DTEND;TZID=Europe/Paris:20211117T160000 DTSTAMP:20211119T075038Z URL:https://www.lincs.fr/events/dynamic-secure-emulation/ SUMMARY:Dynamic Secure-Emulation DESCRIPTION:We present probabilistic dynamic I/O automata\, a framework to model dynamic probabilistic systems. Our work extends dynamic I/O Automata formalism from Attie &\; Lynch to  \;probabilistic setting. The original dynamic I/O Automata formalism included operators for parallel composition\, action hiding\, action renaming\, automaton creation\, and behavioral sub-typing by means of trace inclusion.  \;They can model mobility by using signature modification. They are also hierarchical: a dynamically changing system of interacting automata is itself modeled as a single automaton.\nOur work extends to probabilistic settings all these features.  \;Furthermore\, we prove sufficient (weak) conditions to obtain the implementation monotonicity with respect to automata creation and destruction. Secondly\, we extends composable secure-emulation  \;from Canetti &\; al. to dynamic settings\, an important tool towards the formal verification of protocols combining  \;probabilistic distributed systems and cryptography in dynamic settings (e.g. blockchains\, secure distributed computation\, cybersecure distributed protocols etc). Here again\, we prove sufficient (weak) conditions to obtain the secure-emulation monotonicity with respect to automata creation and destruction. CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:677@lincs.fr DTSTART;TZID=Europe/Paris:20211117T110000 DTEND;TZID=Europe/Paris:20211117T120000 DTSTAMP:20211125T095132Z URL:https://www.lincs.fr/events/chaos-engineering/ SUMMARY:Chaos Engineering DESCRIPTION:"Chaos Engineering is the discipline of experimenting on a distributed system in order to build confidence in the system's capability to withstand turbulent conditions in production." (Principles of Chaos)\n\nIn this reading group's session we will discover what Chaos Engineering is and how it is used in systems in production through the book "Chaos Engineering" written by Rosenthal et al. from Netflix. We will explain the context of distributed system resiliency\, the principles of Chaos Engineering and the application of Chaos in practice.\n\nReference:\nCasey Rosenthal\, Lorin Hochstein\, Aaron Blohowiak\, Nora Jones\, Ali Basiri\, Chaos Engineering\, O'Reilly Media\, Inc.\, August 2017\, http://www.oreilly.com/webops-perf/free/chaos-engineering.csp.\n\nPresentat ion materials:\n\nPDF of the presentation: link to the slides.\n\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:676@lincs.fr DTSTART;TZID=Europe/Paris:20211110T104500 DTEND;TZID=Europe/Paris:20211110T120000 DTSTAMP:20211110T112245Z URL:https://www.lincs.fr/events/hloc-hints-based-geolocation-leveraging-mu ltiple-measurement-frameworks/ SUMMARY:HLOC: Hints-based geolocation leveraging multiple measurement frameworks DESCRIPTION:Dear all\, The Internet Measurement reading group will meet on Wednesday 10th.\n\nIn this session\, Maxime Mouchet (Sorbonne Université\, LIP6) will present HLOC: Hints-based geolocation leveraging multiple measurement frameworks  (Quirin Scheitle et al.\, TMA 2017).\n\nI encourage you to join us at 10:45 for a virtual coffee break\, so that the talk begins at 11:00.\nhttps://telecom-paris.zoom.us/j/98157419805?pwd=eHNMNHZqSE1samt yUmVNRE1TZjRpdz09\n\nSlides\n\nAbstract\nGeographically locating an IP address is of interest for many purposes. There are two major ways to obtain the location of an IP address: querying commercial databases or conducting latency measurements. For structural Internet nodes\, such as routers\, commercial databases are limited by low accuracy\, while current measurement-based approaches overwhelm users with setup overhead and scalability issues. In this work we present our system HLOC\, aiming to combine the ease of database use with the accuracy of latency measurements. We evaluate HLOC on a comprehensive router data set of 1.4M IPv4 and 183k IPv6 routers. HLOC first extracts location hints from rDNS names\, and then conducts multi-tier latency measurements. Configuration complexity is minimized by using publicly available large-scale measurement frameworks such as RIPE Atlas. Using this measurement\, we can confirm or disprove the location hints found in domain names. We publicly release HLOC's ready-to-use source code\, enabling researchers to easily increase geolocation accuracy with minimum overhead. CATEGORIES:Internet Measurement,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:672@lincs.fr DTSTART;TZID=Europe/Paris:20211109T100000 DTEND;TZID=Europe/Paris:20211109T130000 DTSTAMP:20211104T144509Z URL:https://www.lincs.fr/events/phd-thesis-defense-stochastic-matching-mod els-and-their-applications-to-demand-supply-balancing/ SUMMARY:PhD thesis defense "Stochastic matching models and their applications to demand-supply balancing" DESCRIPTION:The recent growth of the collaborative economy with peer-to-peer networks created the need for interfaces that put in relation different types of populations. Applications such as ride sharing\, house renting\, job search\, dating websites and so on\, link people together based on various preferences or compatibilities. This motivates the development of new algorithms that optimize those associations\, also called matchings. Matching models have been studied at great length in the literature when parts of the population is static. However\, when customers arrive randomly over time\, the problem is much more challenging and many questions remain open. This thesis tackles the matter through the lens of control in stochastic matching models.\nThese models are formalized as follows. Items of different classes arrive to the system according to a given probability distribution. Upon arrival\, each item is matched with another compatible item according to a matching policy and both items leave the system immediately. If there are no compatible items\, the new arrivals join the queues of unmatched items of the same class. Compatibilities between item classes are defined by a connected graph\, where nodes represent the classes of items and the edges the compatibilities between item classes. Unmatched items induce a holding cost at each time step and we model this problem as a Markov Decision Process.\nIn particular\, we study the Bipartite Matching Model which considers bipartite compatibility graphs and arrivals by pair. We are interested in finding the optimal control for the discounted and average cost problems. For the N-shaped compatibility graph\, we fully characterize the optimal matching policy. We also identify optimal matchings for more general bipartite graphs under additional assumptions on the costs.\nWe also analyze the performance of the General Matching Model\, where new items arrive one by one with a non-bipartite compatibility graph\, under the First Come First Matched policy. We show that such a model may exhibit a non intuitive behavior: increasing the matching flexibility by adding new edges in the compatibility graph may lead\, when the system is close to the stability condition\, to a larger average population at the steady state.\nFinally\, we use Reinforcement Learning to find the optimal threshold-type policy for Bipartite Matching models. We develop an Actor-Critic algorithm composed of a Temporal Difference critic and a Policy Gradient actor that includes this threshold type structure and learns the optimal threshold within this set of policies.\n \;\nKeywords: Stochastic matching models\, Markov decision processes\, Optimal control\, Braess paradox\, Reinforcement learning\n \;\nHere the link to attend: \;https://global.gotomeeting.com/join/212030933 CATEGORIES:PhD Defense LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:668@lincs.fr DTSTART;TZID=Europe/Paris:20211103T110000 DTEND;TZID=Europe/Paris:20211103T120000 DTSTAMP:20211104T150300Z URL:https://www.lincs.fr/events/developing-with-style-the-pythonic-way/ SUMMARY:Developing With Style: The Pythonic Way DESCRIPTION:Beautiful is better than ugly…\n\nIn this session we will use modern coding-style to improve the readability\, the performance and the correctness of Python code. We will also see from interactive examples some pitfalls that beginners (and less beginners) often fall and how to avoid them.\n\nPrerequisite: your computer with a working Python installation.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:657@lincs.fr DTSTART;TZID=Europe/Paris:20211027T150000 DTEND;TZID=Europe/Paris:20211027T160000 DTSTAMP:20211029T090116Z URL:https://www.lincs.fr/events/joint-channel-coding/ SUMMARY:Joint Channel Coding of Consecutive Messages with Heterogeneous Decoding Deadlines in the Finite Blocklength Regime DESCRIPTION:One of the pillars of 5G is ultra-reliable low latency communications (URLLC)\, where the goal is to transmit typically small quantities of data with a very low probability of error and strict decoding deadlines. With applications ranging from autonomous driving to remote surgery\, a number of channel coding schemes have been proposed including short LDPC and polar codes. A standard assumption in the design of ultra-reliable low-latency communication systems is that the duration between message arrivals is larger than the number of channel uses before the decoding deadline. Nevertheless\, this assumption fails when messages rapidly arrive and reliability constraints require that the number of channel uses exceeds the time between arrivals. In this talk\, we study channel coding in this setting by jointly encoding messages as they arrive while decoding the messages separately\, allowing for heterogeneous decoding deadlines. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:669@lincs.fr DTSTART;TZID=Europe/Paris:20211027T110000 DTEND;TZID=Europe/Paris:20211027T120000 DTSTAMP:20211104T145747Z URL:https://www.lincs.fr/events/stability-conditions-for-a-discrete-time-d ecentralised-medium-access-algorithm/ SUMMARY:Stability Conditions for a Discrete-Time Decentralised Medium Access Algorithm DESCRIPTION:We will present the paper: Shneer\, S.\, &\; Stolyar\, A. (2018). Stability conditions for a discrete-time decentralised medium access algorithm. The Annals of Applied Probability\, 28(6)\, 3600-3628.\n\nWe consider a stochastic queueing system modelling the behaviour of a wireless network with nodes employing a discrete-time version of the standard decentralised medium access algorithm. The system is unsaturated – each node receives an exogenous flow of packets at the rate ? packets per time slot. Each packet takes one slot to transmit\, but neighbouring nodes cannot transmit simultaneously. The algorithm we study is standard in that: a node with empty queue does not compete for medium access\; the access procedure by a node does not depend on its queue length\, as long as it is non-zero. Two system topologies are considered\, with nodes arranged in a circle and in a line. We prove that\, for either topology\, the system is stochastically stable under condition λ\; <\; 2/5. This result is intuitive for the circle topology as the throughput each node receives in a saturated system (with infinite queues) is equal to the so-called parking constant\, which is larger than 2/5. (This fact\, however\, does not help to prove our result.) The result is not intuitive at all for the line topology as in a saturated system some nodes receive a throughput lower than 2/5.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:667@lincs.fr DTSTART;TZID=Europe/Paris:20211021T170000 DTEND;TZID=Europe/Paris:20211021T180000 DTSTAMP:20211026T084749Z URL:https://www.lincs.fr/events/big-thought-time-talk-by-nokia-fast-distri buted-optimization-with-asynchrony-and-time-delays/ SUMMARY:"Big Thought Time Talk" by Nokia: “Fast Distributed Optimization with Asynchrony and Time Delays” DESCRIPTION:The training of models over distributed data calls for distributed optimization schemes. This has motivated research on distributed convex optimization\, leading to the identification of lower bounds on convergence speed\, and distributed optimization algorithms with convergence speed potentially matching these lower bounds\, for a variety of settings.\n\n\nIn this talk we focus on the important setting of asynchronous operation\, for which we propose optimization algorithms with optimal speed. We next consider systems with heterogeneous communication and computation delays\, for which we propose fast asynchronous algorithms adapted to these heterogeneous delays.\n\nBio:\nLaurent Massoulié is research director at Inria\, head of the Microsoft Research – Inria Joint Centre\, and professor at the Applied Maths Centre of Ecole Polytechnique. His research interests are in machine learning\, probabilistic modelling and algorithms for networks. He has held research scientist positions at: France Telecom\, Microsoft Research\, Thomson-Technicolor\, where he headed the Paris Research Lab. He obtained best paper awards at IEEE INFOCOM 1999\, ACM SIGMETRICS 2005\, ACM CoNEXT 2007\, NeurIPS 2018\, was elected "Technicolor Fellow" in 2011\, received the  \;"Grand Prix Scientifique" of the Del Duca Foundation delivered by the French Academy of Science in 2017\, and is a Fellow of the LINCS Laboratory.\n\n\n\nLINCS hosted this talk in its premises at 23 avenue d'Italie. \;\n\n \;\n**The talk was organised by Nokia in the framework of its "Big Thought Time Talk" series. All institutional parteners of the LINCS\, including Nokia and Inria\, have indeed long-standing partnership in solving future network challenges as well as the role of machines in automating and augmenting human existence. CATEGORIES:Seminars,Youtube LOCATION:LINCS + Teams\, 23 avenue d'Italie\, Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Teams:geo:0,0 END:VEVENT BEGIN:VEVENT UID:663@lincs.fr DTSTART;TZID=Europe/Paris:20211020T140000 DTEND;TZID=Europe/Paris:20211020T150000 DTSTAMP:20211021T083812Z URL:https://www.lincs.fr/events/on-velocity-based-association-policies-for -multi-tier-5g-wireless-networks/ SUMMARY:On Velocity-based Association Policies for Multi-tier 5G Wireless Networks DESCRIPTION:Mobility is a key challenge for beam management in 5G cellular networks due to the overhead incurred at beam switching and base station (BS) handover events. This paper focuses on a network that has a multi-tier structure with two types of BSs operating in the same frequency bands\, namely macro BSs that are sparser but with higher transmit power\, and micro BSs that are denser and with lower transmit power. We propose a downlink user association policy which is a function of the user mobility. Typically\, high mobility users should associate with macro BSs so as to incur less beam switching overhead\, whereas low mobility ones should be associated with micro BSs. The main contribution of the paper is a formalization of the optimal threshold association policy\, when the optimality is understood with respect to the effective Shannon rate. The analysis is based on stochastic geometry and on an exact representation of the effective Shannon rate of the typical user in this beamforming multi-tier context. Two models are discussed. The simplest one focuses on a single-user optimization problem. We also discuss a more realistic model with bandwidth sharing between all users in the cell. Finally\, we identify the mobility and user-density patterns where the velocity-based threshold association policy outperforms the classical best mean power association policy. In a last part\, we will explore on a generalization of such policies by adding a velocity-biased threshold for the two tiers in the network and discuss preliminary results for this optimization problem.\n\n** This talk is based on a paper accepted at Globecom 2021.\nHere the SLIDES of this talk CATEGORIES:Seminars,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:664@lincs.fr DTSTART;TZID=Europe/Paris:20211020T104500 DTEND;TZID=Europe/Paris:20211020T120000 DTSTAMP:20211103T130630Z URL:https://www.lincs.fr/events/pcap-tools-for-practical-traffic-monitorin g-in-lan/ SUMMARY:PCAP tools for practical traffic monitoring in LAN DESCRIPTION:Pcap (Packet CAPture) is an API for network monitoring in network\, essentially in LANs (Ethernet\, WiFi). It is mainly use for passive monitoring (packet capture) but it can also be used for active monitoring (packet injection). There are implementations for Linux (libpcap)\, Apple (libpcap) and Windows (WinPcap\, Npcap and Win10Pcap) systems. Pcap is used by tcpdump\, tshark and Wireshark software\, but you can make your own software using it. In this session of Internet Measurement Reading Group\, we will present how it works\, how it can be used with Node.js (cap and pcap modules) and Python (Scapy)\, with some application uses cases. For the applications use cases\, we will explain how we used Pcap for IoT device type identification and how we are using Pcap in our current IoT Network Monitoring project. \n\n\n\n \;\n\nReferences\n\nPcap:\nhttps://www.tcpdump.org/\npcap file format: https://wiki.wireshark.org/Development/LibpcapFileFormat\n\n\nNode.js modules:\n- node_pcap (pcap): https://www.npmjs.com/package/pcap\n- cap: https://www.npmjs.com/package/cap\n\n\nPython module:\n- scapy: https://scapy.readthedocs.io/en/latest/\n\n\nApplication example:\nNesrine Ammar\, Ludovic Noirie\, Sébastien Tixeuil\, "Autonomous IoT Device Identification Prototype\," best demo paper at Network Traffic Measurement and Analysis Conference 2019\, Jun 2019\, Paris\nhttps://dx.doi.org/10.23919/TMA.2019.8784517\n\nPresentation materials: Jupyter notebook used during the presentation\n\n\nZipped folder with Jupyter notebook and attached files: link to archive.\nHTML version of the Jupyter notebook: link to the html version of the notebook.\n CATEGORIES:Internet Measurement,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:659@lincs.fr DTSTART;TZID=Europe/Paris:20211013T140000 DTEND;TZID=Europe/Paris:20211013T150000 DTSTAMP:20211013T161703Z URL:https://www.lincs.fr/events/discv5-service-discovery-for-the-ethereum- p2p-network/ SUMMARY:Discv5 - service discovery for the Ethereum P2P network DESCRIPTION:Ethereum is one of the largest permissionless\, open-source\nblockchains supporting Turing-complete scripting via smart contracts.\nEthereum runs a Peer-to-Peer (P2P) network based on Kademlia\n \;Distributed Hash Table (DHT) to exchange pending transactions and\nmined blocks. Apart from supporting blockchain data exchange\, the\nEthereum P2P network is used by other applications. This includes\nmultiple Ethereum testnets (Rinkeby\, Ropsten)\, decentralized\napplication (iExec\, Swarm\, Whisper) or alternative cryptocurrencies\n(Pirl\, Musicoin). In this talk\, we present Discv5 - a new service\ndiscovery protocol designed with the Ethereum foundation allowing\napplication-specific peers to find each other in an open\,\npermissionless setup.\n\nBio: Michal Król is a lecturer in Cyber Security at City\, University of\nLondon. He did his PhD at the University Grenoble Alpes in France and\nspent several years as a research associate at University College\nLondon\, University of California\, Los Angeles and UCLouvain in Belgium.\nHis research research interest include blockchains\, distributed systems\nand privacy-preserving communication. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:662@lincs.fr DTSTART;TZID=Europe/Paris:20211013T110000 DTEND;TZID=Europe/Paris:20211013T120000 DTSTAMP:20211015T134216Z URL:https://www.lincs.fr/events/python-101/ SUMMARY:Python 101 DESCRIPTION:We will see how to install a complete Python environment:\n\n Python distribution (Anaconda)\,\n Python IDEs (Jupyter Notebook / JupyterLab / PyCharm).\n\nWe will go through the installation process\, make our first "Hello World"\, and introduce various useful features\, like NB extensions\, PyCharm projects\, or keyboard shortcuts.\n\nThis opening tutorial is intended for people with no or low experience of Python that want to dive in.\n\nPrerequisite: your computer.\n\nRecommendation: to save time and bandwidth\, you may want to download the following in advance:\n\n Anaconda distribution\, from https://www.anaconda.com/products/individual (3.8 version for your system\; this should be the default proposal).\n Pycharm community edition\, from https://www.jetbrains.com/pycharm/download.\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:660@lincs.fr DTSTART;TZID=Europe/Paris:20211006T110000 DTEND;TZID=Europe/Paris:20211006T120000 DTSTAMP:20211007T054830Z URL:https://www.lincs.fr/events/random-line-and-hyperplane-processes/ SUMMARY:Random Line and Hyperplane Processes DESCRIPTION:We will talk about:\n\n Stationarity\n The Poisson case.\n Associated random measures.\n Associated tessellations.\n The Crofton cell.\n Mass transport.\n Applications.\n\n\nReference: Random Measures\, Point Processes\, and Stochastic Geometry.\nFrançois Baccelli\, Bartł\;omiej Bł\;aszczyszyn and Mohamed Karray\, 2020 preprint. https://hal.inria.fr/hal-02460214. CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:658@lincs.fr DTSTART;TZID=Europe/Paris:20210921T140000 DTEND;TZID=Europe/Paris:20210921T170000 DTSTAMP:20210921T104819Z URL:https://www.lincs.fr/events/longitudinal-large-scale-and-unbiased-inte rnet-measurements/ SUMMARY:PhD thesis defense "Longitudinal\, large scale and unbiased Internet Measurements" DESCRIPTION:Today\, a world without the Internet is unimaginable. By interconnecting billions of people worldwide and by offering an uncountable number of services\, it is now fully embedded in the modern society. Yet\, despite technology evolution and development\, its pervasiveness and heterogeneity still raise new challenges\, such as security concerns\, monitoring of the users' Quality of Experience (QoE)\, care for transparency and fairness. Accordingly\, the goal of this thesis is to shed new light on some of the challenges emerged in recent years. In particular\, we provide an in-depth analysis of some of the most prominent aspects of modern Internet. A particular emphasis is given on the World Wide Web\, which among all\, is undoubtedly one of the most popular Internet applications\, and a specific regard to its interaction with machine learning. The first part of this work studies the Quality of Experience of users' browsing the Web\, with measurements led both in the wild and in controlled environments. Our contributions follow with an original analysis of both the subjective user feedback and the objective QoE metrics\, showing how hard it is to build accurate supervised data-driven models capable to predict the user satisfaction\, along with an in-depth discussion of the multi-modal nature of the subjective user opinions.In the second part of this work\, we analyze and discuss the fairness of state-of-the-art transformer-based language models\, which are pre-trained on Web-based corpora and which are typically used to solve a wide variety of Natural Language Processing (NLP) tasks. Here\, we question whether the sheer size and heterogeneity of the Web guarantee diversity in the models. The core of our contributions rests in the measure of the bias embedded in the models\, that we discuss under different angles. Finally\, the last part of this dissertation addresses the classification of objects generated by machines through some of the simplest state-of-the-art supervised machine learning algorithms. Through a minimally intrusive\, robust and lightweight framework\, we show that the different behaviors of a field of the IP packet\, the IP identification (IP-ID)\, could be easily classified with few features having high discriminative power. We finally apply our technique to an Internet-wide census and provide an updated view of the adoption of the different implementations in the Internet.\n\n \;\nJury composition:\nIsabelle CHRISMENT\, Professor\, LORIA Campus Scientifique (President\, Reviewer)\nPedro CASAS\, Senior Scientist\, AIT Austrian Institute Of Technology (Reviewer)\nChadi BARAKAT\, Senior Researcher\, INRIA (Examinator)\nTobias HOßFELD\, Professor\, University of Würzburg(Examinator)\nMarco MELLIA\, Professor\, Politecnico di Torino (Examinator)\nPhilippe OWEZARSKI\, Director of Research\, LAAS-CNRS (Examinator)\n \;\nMauro SOZIO\, Professeur\, Télécom Paris (PhD Supervisor)\nDario ROSSI\, Chief Expert\, Huawei Technologies France (PhD Co-Supervisor)\n \;\nTo watch the defense:\nhttps://telecom-paris.zoom.us/j/94526858841?pwd=Y3Yzbjg4UTVzMFhIU HFwNG5wNmR4QT09 \; \;\n\nID de réunion : 945 2685 8841 \;\nCode secret :  \;340704\n CATEGORIES:PhD Defense LOCATION:Zoom + Amphi 4 chez Télécom-Paris\, 19 Place Marguerite Perey\, Palaiseau\, 91120\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 Place Marguerite Perey\, Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + Amphi 4 chez Télécom-Paris:geo:0,0 END:VEVENT BEGIN:VEVENT UID:656@lincs.fr DTSTART;TZID=Europe/Paris:20210915T140000 DTEND;TZID=Europe/Paris:20210915T150000 DTSTAMP:20210916T105918Z URL:https://www.lincs.fr/events/higher-order-spectral-clustering-for-geome tric-graphs/ SUMMARY:Higher-Order Spectral Clustering for Geometric Graphs DESCRIPTION:This work is devoted to clustering geometric graphs. It appears that the standard spectral clustering is often not effective for geometric graphs. We present an effective generalization\, which we call higher-order spectral clustering. It resembles in concept the classical spectral clustering method but uses for partitioning the eigenvector associated with a higher-order eigenvalue. We establish the weak consistency of this algorithm for a wide class of geometric graphs which we call Soft Geometric Block Model. A small adjustment of the algorithm provides strong consistency. We also show that our method is effective in numerical experiments even for graphs of modest size.\n \;\nThis is a joint work with A. Bobu and M. Dreveton\, done in the framework of Inria - Nokia Bell Labs and recently appeared in JFAA\, 27:22\, 2021.\nhttps://link.springer.com/article/10.1007/s00041-021-09825-2\n \ ;\n**Here the link to the presentation's slides: HOSC_LINCSPresent CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:655@lincs.fr DTSTART;TZID=Europe/Paris:20210708T140000 DTEND;TZID=Europe/Paris:20210708T170000 DTSTAMP:20210713T073708Z URL:https://www.lincs.fr/events/phd-thesis-defense-alarm-prediction-in-net works-via-space-time-pattern-matching-and-machine-learning/ SUMMARY:PhD thesis defense "Alarm prediction in networks via space-time pattern matching and machine learning" DESCRIPTION:Nowadays\, telecommunication networks occupy a predominant place in our world. Indeed\, they allow to share worldwide a huge amount of information. Networks are however complex systems\, both in size and technological diversity. Therefore\, it makes their management and repair more difficult. In order to limit the negative impact of such failures\, some tools have to be developed to detect a failure whenever as soons as it occurs\, analyse its root causes to solve it efficiently\, or even predict this failure to prevent it rather than cure \;it. In this thesis\, we mainly focus on these last two problems. To do so\, we use files\, called alarm logs\, storing all the alarms issued by the system. However\, these files are generally noisy and verbose: an operator managing a network needs tools able to extract and handle in an interpretable manner the causal relationships within a log. First\, we build online a structure\, called DIG-DAG\, that stores all the potential causal relationships involving the events of a log. We then propose a query system to exploit this structure. Finally\, we apply this approach in the \;context of root cause analysis. Second\, we discuss a generative approach for times \;series prediction. In particular\, we compare two well-known models for this task: recurrent neural nets on the one hand\, hidden Markov models on the other hand. Indeed\, in their respective communities\, these two models are state of the art. Here\, we compare analytically their expressivity by encompassing them into a probabilistic model\, called GUM. CATEGORIES:PhD Defense,Youtube LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:635@lincs.fr DTSTART;TZID=Europe/Paris:20210707T140000 DTEND;TZID=Europe/Paris:20210707T150000 DTSTAMP:20210708T113303Z URL:https://www.lincs.fr/events/maliciously-secure-consensus-from-succinct -arguments-and-short-transparent-threshold-signatures/ SUMMARY:"Maliciously secure consensus from succinct arguments\, and short transparent threshold signatures" DESCRIPTION:We consider consensus protocols\, for application to state machine replication\, in the model of Castro-Liskov-Dolev-Lynch-Stockmeyer (partial synchrony\, black box leader election\, malicious corruptions). These protocols enable n players to output the same value\, such that the output satisfies some publicly verifiable validity condition.\n\nEfforts since "PBFT" (Castro-Liskov '99)\, aim at reducing the communication complexity. A breakthrough was achieved by Hotstuff (Podc'19)\, implemented in Facebook's Diem. It has complexity quasi linear in n the number of players\, but at the price of extra latency.\n\nWe show how to overcome this limitation. First\, with an explicit elementary construction in O(n log(n))\, with a small constant overhead. Then\, from the use of succinct noninteractive arguments of knowledge.\n\nIf time allows\, we will explain the simplest: an argument of knowledge of k  \;BLS signatures on the same message m\, out of n public keys. This provides the first threshold signature with logarithmic size without trusted setup.\n\n \;\n\n \; CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:650@lincs.fr DTSTART;TZID=Europe/Paris:20210630T140000 DTEND;TZID=Europe/Paris:20210630T150000 DTSTAMP:20210701T142928Z URL:https://www.lincs.fr/events/talk-by-diego-perino/ SUMMARY:Experience in research and deployment of AI-based techniques for “networks” DESCRIPTION:In the talk we will first present Telefonica Research\, a team \;of researchers in Machine Learning/Deep Learning\, Human Computer Interaction\, Security/Privacy and Networks/Systems and highlight potential collaboration opportunities. The aim of the team is to carry research studies on mid to long-term related to several technological areas of interest to the Telefónica Group following an open research model and generating impact through technology transfers. \;We will then focus on one of the key area we are working on that is Artificial Intelligence applied to “networks”. Indeed\, Artificial Intelligence (AI) is recognized as a main driver for future telco industry business and digital transformation. It will lead towards increasingly autonomous and intelligent networks\, will improve customer experience\, and generate significant economic impact.\nHowever\, despite this relevance and two decades of research in applying AI techniques to networks\, there is still a limited applicability of AI technologies to actual production environments.\nIn this talk we will present our experience in research and deployment of AI-based techniques in a large technology company. We will overview several use cases including fixed and mobile networks\, platforms\, network access\, end user devices where we have developed novel machine learning and deep learning algorithms. We then zoom into two use cases where AI can bring significant benefits\, namely advanced network operations in rural areas mobile network deployments and in an international roaming platform. Finally\, we will discuss lessons learned during this process and the relevant research and innovation directions. \;\n\nBio\nDiego Perino \;is  \;the Director of \;Telefonica Research \;and lead a team of researchers in Machine Learning/Deep Learning\, HCI\, Privacy/Security\, Networks and Systems. He also recently led ARIANA\, a Telefonica Innovation startup project leveraging Artificial Intelligence for Automatic Network Actions. \; \;Previously he worked at Bell Labs (Paris\, France) from September 2009 to June 2016 and six months at NICTA (Sydney\, Australia) in 2016 as visiting researcher. He received his Ph.D. in Computer Science from the Paris Diderot-Paris 7 university in 2009: the thesis was a collaboration between Orange Labs and INRIA through a CIFRE contract. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:654@lincs.fr DTSTART;TZID=Europe/Paris:20210630T110000 DTEND;TZID=Europe/Paris:20210630T120000 DTSTAMP:20210915T121712Z URL:https://www.lincs.fr/events/algorithms-for-generating-random-permutati ons/ SUMMARY:Algorithms for generating random permutations DESCRIPTION:Systems such as masscan\, yarrp and diamond-miner send in the order of a million packets/s in order to discover open ports and packet paths on the Internet. To avoid overloading the network and trigger rate-limiting or intrusion detection systems\, the probes must be distributed evenly across the network. Standard methods for generating random permutations\, such as the Fisher-Yates shuffle\, usually require to store the whole permutation in memory\, which is prohibitive when the number of probes to send is large (>1B typically). In this talk we will discuss methods to generate random permutations\, and in particular the Generalized-Feistel Cipher [1] which can generate permutations on arbitrary domains\, on-the-fly and in constant memory.\n\n[1] Black\, John\, and Phillip Rogaway. “Ciphers with arbitrary finite domains.” /Cryptographers’ track at the RSA conference/. Springer\, Berlin\, Heidelberg\, 2002.\n\n CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:653@lincs.fr DTSTART;TZID=Europe/Paris:20210623T134500 DTEND;TZID=Europe/Paris:20210623T150000 DTSTAMP:20210624T113937Z URL:https://www.lincs.fr/events/reverse-traceroute/ SUMMARY:Reverse Traceroute DESCRIPTION:Dear all\, The Internet Measurement reading group will meet again on June 23rd.\nWe will exceptionally meet at 13:45 instead of our regular time of 10:45. In this session Kevin Vermeulen (Columbia University) will present « Reverse Traceroute » (E. Katz-Bassett et al.\, NSDI 2010).\nI encourage you to join us at 13:45 for a virtual coffee break\, so that the talk begins at 14:00.\n\nAbstract\nTraceroute is the most widely used Internet diagnostic tool today. Network operators use it to help identify routing failures\, poor performance\, and router misconfigurations. Researchers use it to map the Internet\, predict performance\, geolocate routers\, and classify the performance of ISPs. However\, traceroute has a fundamental limitation that affects all these applications: it does not provide reverse path information. Although various public traceroute servers across the Internet provide some visibility\, no general method exists for determining a re- verse path from an arbitrary destination.\nIn this paper\, we address this longstanding limitation by building a reverse traceroute system. Our system provides the same information as traceroute\, but for the reverse path\, and it works in the same case as traceroute\, when the user may lack control of the destination. We use a variety of measurement techniques to incrementally piece together the path from the destination back to the source.\n\nSpeaker\n\n\n\n\nKevin is currently a postdoc at Columbia University working with Professsor Ethan Katz-Bassett. His research focuses on building networked systems for a better understanding of the Internet.\n\n\nBest\,\nMaxime\n\n—Participer à la réunion Zoomhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9FQlAzTUlkdzFyMmlmWS9 Ld1lMQT09\nID de réunion : 971 2016 7222Code secret : 895458\n\n CATEGORIES:Internet Measurement,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:645@lincs.fr DTSTART;TZID=Europe/Paris:20210622T163500 DTEND;TZID=Europe/Paris:20210622T172000 DTSTAMP:20210614T105714Z URL:https://www.lincs.fr/events/edge-classification-offloading-under-token -bucket-constraints/ SUMMARY:Edge Classification: Offloading under Token Bucket Constraints DESCRIPTION:We consider an edge-computing setting where machine learning-based algorithms are used for real-time classification of inputs acquired by devices\, e.g.\, cameras. \; Computational resources on the devices are constrained\, and therefore only capable of running machine learning models of limited accuracy. A subset of inputs can be offloaded to the edge for processing by a more accurate but resource-intensive machine learning model. Both models process inputs with low-latency\, but offloading incurs additional network and compute delays. To manage these delays and meet application deadlines\, a token bucket constrains transmissions from the device. We first introduce a Markov Decision Process-based framework to make offload decisions under such constraints when the input process is i.i.d. Decisions are based on the local model's confidence and the token bucket state\, with the goal of minimizing a specified error measure for the application. We then extend the approach to configurations involving multiple devices connected to the same access switch to realize the benefits of a shared token bucket. Next we explore an approach based on deep Q-networks (DQN) to handle more complex input and classification processes\, and demonstrate its ability to learn such features and effectively incorporate them into policy decisions. \; We evaluate and analyze the policies derived using our framework on the standard ImageNet image classification benchmark. 1\, 2\n\n This is joint work with Ayan Chakrabarti\, Chenyang Lu\, Jiaming Qiu\, Ruiqi Wang\, and Jiangnan Liu\n Part of this work will be presented at the 2021 ACM/IEEE SEC conference\n\n \;\nhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9F QlAzTUlkdzFyMmlmWS9Ld1lMQT09\n- ID de réunion : 971 2016 7222- Code secret : 895458 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:639@lincs.fr DTSTART;TZID=Europe/Paris:20210622T154000 DTEND;TZID=Europe/Paris:20210622T162500 DTSTAMP:20210618T071013Z URL:https://www.lincs.fr/events/enabling-intelligent-services-via-function -virtualization-at-the-network-edge/ SUMMARY:Enabling intelligent services via function virtualization at the network edge DESCRIPTION:The proliferation of novel mobile applications and the associated AI services necessitates a fresh view on the architecture\, algorithms and services at the network edge in order to meet stringent performance requirements. Some recent work addressing these challenges is presented. In order to meet the requirement for low-latency\, the execution of computing tasks moves form the cloud to the network edge\, closer to the end-users. The joint optimization of service placement and request routing in dense mobile edge computing networks is considered. Multidimensional constraints are introduced to capture the storage requirements of the vast amounts of data needed. An algorithm that achieves close-to-optimal performance using a randomized rounding technique is presented. Recent advances in network virtualization and programmability enable realization of services as chains\, where flows can be steered through a pre-defined sequence of functions deployed at different network locations. The optimal deployment of such service chains where storage is a stringent constraint in addition to computation and bandwidth is considered and an approximation algorithm with provable performance guarantees is proposed and evaluated. Finally the problem of traffic flow classification as it arises in firewalls and intrusion detection applications is presented. An approach for realizing such functions based on a novel two-stage deep learning method for attack detection is presented. Leveraging the high level of data plane programmability in modern network hardware\, the realization of these mechanisms at the network edge is demonstrated. \;\n\n \;\nhttps://telecom-paris.zoom.us/j/9712016722 2?pwd=NS9FQlAzTUlkdzFyMmlmWS9Ld1lMQT09\n- ID de réunion : 971 2016 7222- Code secret : 895458 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:643@lincs.fr DTSTART;TZID=Europe/Paris:20210622T142500 DTEND;TZID=Europe/Paris:20210622T151000 DTSTAMP:20210614T105620Z URL:https://www.lincs.fr/events/machine-learning-for-network-management/ SUMMARY:Machine Learning for Network Management DESCRIPTION:Machine Learning has been applied to a wide range of networking topics. Network management provides ample examples\, often of the type of combinatorial optimizations. In the talk\, we look at two examples. One example comes from the context of network softwarization\, where we investigate how machine learning approaches can help with scaling and placing virtual network functions\, as well as routing traffic between them. The second example comes from wireless sensor networks with acoustic applications in mind\, where we need to balance acoustic sensing quality with wireless network quality and use these two metrics to move mobile microphones into good locations.\n\n \;\nhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9F QlAzTUlkdzFyMmlmWS9Ld1lMQT09\n- ID de réunion : 971 2016 7222- Code secret : 895458 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:642@lincs.fr DTSTART;TZID=Europe/Paris:20210622T134500 DTEND;TZID=Europe/Paris:20210622T141500 DTSTAMP:20210614T084707Z URL:https://www.lincs.fr/events/internet-of-things-lincs/ SUMMARY:Internet of Things @ LINCS DESCRIPTION:In this presentation\, we will present the main research activities of LINCS concerning the Internet of Things (IoT) in recent years: the management of \;IoT \;devices in home/enterprise networks\, Wireless Body Area Networks technologies\, remote connectivity for Bluetooth\, data aggregation in \;IoT \;networks\, networks of robots. \;\n\n \;\n\nhttps://telecom-paris.zoom.us/j/94880732137?pw d=L0MzV3BDend4VXFNcjc5OVBCaUNHdz09\n\n– ID de réunion : 948 8073 2137\n– Code secret : 705442 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:647@lincs.fr DTSTART;TZID=Europe/Paris:20210622T104500 DTEND;TZID=Europe/Paris:20210622T121500 DTSTAMP:20210618T122406Z URL:https://www.lincs.fr/events/lincs-supervised-members-elevator-pitches- poster-session-day-2/ SUMMARY:LINCS supervised members elevator pitches + poster session (day 2) DESCRIPTION:Michel Davydov (PhD - Inria) \;  \;  \;  \;  \;  \;  \;\nPoisson hypothesis for replica-mean-field networks\nPhenomena as diverse as neural computations\, opinion dynamics or flow control on the internet can be modeled as punctuate interactions between agents in a network. Unfortunately\, most relevant dynamics involve complex graphs of interactions for which an exact computational treatment is impossible. To circumvent this difficulty\, the replica-mean-field approach focuses on randomly interacting replicas of the networks of interest. In contrast with classical mean-fields\, interaction couplings do not scale with the number of neurons and preserve both the geometry of the network and the finite-size correlations. In the limit of an infinite number of replicas\, these networks become analytically tractable under the so-called Poisson Hypothesis\, which postulates that replicas become asymptotically independent and arrivals to a given neuron become Poisson distributed. This hypothesis is often conjectured or numerically validated but not proven. We show the validity of the Poisson Hypothesis for large classes of processes in both discrete and continuous time.\nBharath Roy Choudhury (PhD - Inria) \;  \;  \;  \;  \;  \;  \;  \;\nLocal limits of vertex-shifts on random rooted networks\nWhile navigating on a network\, it is desirable to follow a rule that does not require knowledge of the whole network and yet can guide towards the target. In this study\, we consider deterministic navigation rules that depend only on the local neighbourhoods of the origin ( also called the root). These rules are examples of vertex-shifts\, a collection of maps defined on vertices of network that respect the network structure. The underlined network on which a vertex-shift is defined could be random. We choose a class of random graphs with high spatial homogeneity called unimodular graphs and study the asymptotic behaviour of vertex-shifts on them. We show that under some conditions on the vertex-shifts\, the limiting behaviour can be expressed in relation to the distribution of the underlined unimodular random graph.\n \;\nVictor Vermes (intern - inria)\nDynamic matching on hypergraphs\nMatching systems systems have a wide range of applications\, to collaborative \;economy (matching people in car sharing systems) or healthcare systems (matching organ donors and organ recipient). I study the extension of such systems to hypergraphical structures (rather than grpahical)\, where more than two items can get matched together. At each time step\, a single item arrives according to a fixed probability distribution\, and compatible items can be matched according \;to a matching policy. I compare different matching policies (such as "First in\, First out" or "Match the longest")\, and study the stability of such policies.\n\n \;\nRazanne Abu-Aisheh (PhD - inria+NBLF) \;  \;  \;\nAtlas: Exploration and Mapping with a Sparce Swarm of Networked Robots\nExploration and mapping of unknown environments is an essential application of swarm robotics\, especially in critical missions such as hazard detection\, search and rescue and surveillance. These missions share the need to reach full coverage of the explorable space and build a complete map of the environment rapidly.\n\nExisting exploration and mapping algorithms tend to either be inefficient\, or rely on having a dense swarm of robots. Hence\, we developed Atlas\, an exploration and mapping algorithm for sparse swarms of robots\, which completes a full exploration within set time limits even in the extreme case of a single robot. We also studied how communication impacts swarm exploration tasks and designed and implemented a communication protocol that enables efficient\, reliable and packet loss tolerant exploration and mapping in various network conditions. We developed our own simulator to experiment on and test our algorithms and protocols with. In future works we will be \;adding further inaccuracies to Atlas to utilize the understanding of these inaccuracies to increase the efficiency of the algorithm.\n\n \;\nSayeh Khaniha (phd - inria) \;\nPerfect sampling of the null recurrent Markov Chain in the Doeblin graph\nAny irreducible\, aperiodic\, and positive recurrent Markov Chain has a unique stationary distribution. One classical problem related to this MC is to produce a perfect sample from its stationary distribution. There is a known algorithm coupling from the past (CFTP)\, introduced by Propp and Wilson for perfect sampling when the MC is aperiodic\, irreducible and the state space is finite. This algorithm is based on a random graph called Doeblin graph. When the MC is null recurrent\, it does not have stationary distribution. So we can not speak about perfect sampling in the classical sense. In the null recurrent MC\, we have a stationary measure instead. We introduce a random set as a perfect sample of stationary measure\, in this case\, using the Doeblin graph and its properties. And study the constructability of this perfect sample in some cases.\n\n \;\nFlavia Salutari (Phd - tp)\nLongitudinal\, large-scale and unbiased \;Internet measurements\nToday\, a world without the Internet is unimaginable. By interconnecting billions of people worldwide and by offering an uncountable number of services\, it is now fully embedded in the modern society. Yet\, despite technology evolution and development\, its pervasiveness and heterogeneity still raise new challenges\, such as security concerns\, monitoring of the users’ Quality of Experience (QoE)\, care for transparency and fairness.\n\nAccordingly\, the goal of this work is to shed new light on some of the challenges emerged in recent years. In particular\, we provide an in-depth analysis of some of the most prominent aspects of modern Internet. A particular emphasis is given on the World Wide Web\, which among all\, is undoubtedly one of the most popular Internet applications\, and a specific regard to its interaction with machine learning. \;\n\nFirst\, we study the Quality of Experience of users’ browsing the Web\, with measurements led both in the wild and in controlled environments. Then\, we analyze and discuss the fairness of state-of-the-art transformer-based language models\, which are pre-trained on Web-based corpora and which are typically used to solve a wide variety of Natural Language Processing (NLP) tasks. Here\, we question whether the sheer size and heterogeneity of the Web guarantee diversity in the models. Finally\, we address the classification of objects generated by machines through some of the simplest state-of-the-art supervised machine learning algorithms. \;\n \;\nGabriele Castellano (postdoc - inria) \;  \;  \;  \; \;\nTowards Inference Delivery Networks: Distributing Inference Tasks with Optimality \;Guarantees\nThis research introduces the idea of inference delivery networks (IDN)\, networks of computing nodes that coordinate to satisfy inference requests achieving the best trade-off between latency and accuracy. IDNs bridge the dichotomy between device and cloud execution by integrating inference delivery at the various tiers of the infrastructure continuum (access\, edge\, regional data center\, cloud).\nWe propose a distributed dynamic policy for ML model allocation in an IDN by which each node periodically updates its local set of inference models based on requests observed during the recent past plus limited information exchange with its neighbor nodes. Our policy offers strong performance guarantees in an adversarial setting and shows improvements over greedy heuristics with similar complexity in \;realistic scenarios.\n \;\nAyoub Ben Ameur (phd - TSP) \;\nCache Allocation in Multi-Tenant Edge Computing via online Reinforcement Learning\nEdge Computing (EC) consists in deploying computational resources (CPU\, memory\, storage) into the edge of the network (base stations\, central offices\, access points)\, thus constituting a “cloud at the edge”. Most of the related work examines the performance of a single generic service running in the Edge. In our vision\, instead\, EC is a multi-tenant environment: the resource owner\, i.e.\, the Network Operator (NO)\, virtualizes the resources and let third party Service Providers (SPs - tenants) run their services\, which can be diverse and with heterogeneous requirements. The NO allocates the available limited resources to SPs\, in order to satisfy their requirements and to optimize a global utility function. Due to confidentiality guarantees\, the NO cannot observe the traffic and the data of SPs\, which are encrypted. This makes allocation decisions challenging\, since they have to be taken just based on observed monitoring information. In this work\, we concentrate on one specific resource\, i.e.\, cache space\, and we decide how to partition it among several SPs in order to minimize the upstream traffic. Our goal is to optimize cache allocation using purely  \;data-driven\, model-free Reinforcement Learning (RL). Differently from most applications of RL\, in which RL is trained offline in simulations\, we apply it in an online fashion: we train RL while adapting it to optimize the edge cache allocation\, on a hot-and-running system. We thus observe the improvement of RL decisions based on the feedback (online measurement of upstream traffic) determined by the user request flows.  \;Starting from a simple Q-learning algorithm\, we highlight the impact of several learning techniques\, e.g. ?-Stretched Exponential Decay and Experience Replay\, in order to improve the performance of our algorithm.\n \;\nBerat Senel (phd - sorbonne) \;  \;  \;  \; \;\nEdgeNet: A multi-tenant\, multi-provider\, globally distributed Kubernetes cluster\nEdgeNet (https://www.edge-net.org/) is a distributed Kubernetes cluster with nodes all across the world. This cluster is publicly available to researchers who wish to perform experiments in networking and distributed systems. Anyone can contribute a node to the cluster\, from any machine on the Internet. EdgeNet’s multi-tenant and multi-provider design has been built around a set of Kubernetes operators that manage tenants\, teams and users. Experimenters can schedule workloads based on nodes’ geographical locations using EdgeNet’s SelectiveDeployment custom resource. Those who wish to contribute an EdgeNet node can do so within minutes via a single-line copy-and-paste call to an Ansible script.\n \;\nIlia Shilov (phd - inria)\nAlgorithmic Game and Distributed Learning for Peer-to-Peer Energy Trading\nWe propose different designs for the decentralized markets taking into account \;the local-global \;market interactions \;and propose mathematical approaches to analyze them. We focus on problems with coupled constraints\, thus we rely on the Generalized Nash Equilibrium and Variational Equilibrium concepts. We formulated risk neutral and risk-averse models\, further extending the former one to include the randomized reports to investigate strategic information sharing. Our current work focuses on network-aware peer-to-peer energy trading (inclusion of OPF\, distribution grid constraints).\n\n \;\nLéo Laugier (PhD - TP)\nCivil Rephrases Of Toxic Texts With Self-Supervised Transformers \;\nAbstract : Platforms that support online commentary\, from social networks to news sites\, are increasingly leveraging machine learning to assist their moderation efforts. But this process does not typically provide feedback to the author that would help them contribute according to the community guidelines. This is prohibitively time-consuming for human moderators to do\, and computational approaches are still nascent. This work focuses on models that can help suggest rephrasings of toxic comments in a more civil manner. Inspired by recent progress in unpaired sequence-to-sequence tasks\, a self-supervised learning model is introduced\, called CAE-T5. CAE-T5 employs a pre-trained text-to-text transformer\, which is fine tuned with a denoising and cyclic auto-encoder loss. Experimenting with the largest toxicity detection dataset to date (Civil Comments) our model generates sentences that are more fluent and better at preserving the initial content compared to earlier text style transfer systems which we compare with using several scoring systems and human evaluation.\n\n \;\n\nhttps://telecom-paris.zoom.us/j/94880732137?pwd=L 0MzV3BDend4VXFNcjc5OVBCaUNHdz09\n\n– ID de réunion : 948 8073 2137\n– Code secret : 705442 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:641@lincs.fr DTSTART;TZID=Europe/Paris:20210622T091500 DTEND;TZID=Europe/Paris:20210622T101500 DTSTAMP:20210622T083156Z URL:https://www.lincs.fr/events/lincs-members-scientific-highlights-day-2/ SUMMARY:LINCS members scientific highlights (day 2) DESCRIPTION:Petr Kuznetsov (Télécom-Paris)\nA sledgehammer to crack a nut: why blockchain is not (always) a good idea\nAbstract: In this short talk\, we are going to discuss two\, somewhat provocative\, claims. First\, cryptocurrency\, the most popular application of the blockchain technology can be implemented in a much simpler and efficient way. Second\, the permissionless setting with mutual distrust\, assumed by conventional blockchain implementations\, is way too pessimistic in most cases. We then show how the two observations can help in designing efficient and robust replicated \; services.\n\n \;\nFabien Mathieu (NBLF)\nOnce upon a time... in LINCS!\nThe notions of ``scientific community'' and ``research field'' are central elements for researchers and the articles they publish. We propose to explore the evolution of the LINCS community since its creation\, based on the articles listed in DBLP and the LINCS members\, using the Gismo navigation engine and specially developed extensions. Our results allow to better understand the evolution of the community.\n\n \;\nTimur Friedman (Sorbonne)\nDiamond-Miner: Comprehensive Discovery of the Internet's Topology Diamonds\nDespite the well-known existence of load-balanced forwarding paths in the Internet\, current active topology Internet-wide mapping efforts are multipath agnostic — largely because of the probing volume and time required for existing multipath discovery techniques. This paper introduces D-Miner\, a system that marries previous work on high-speed probing with multipath discovery to make Internet-wide topology mapping\, inclusive of load-balanced paths\, feasible. We deploy D-Miner and collect multiple IPv4 interface-level topology snapshots\, where we find >\;64% more edges\, and significantly more complex topologies relative to existing systems. We further scrutinize topological changes between snapshots and attribute forwarding differences not to routing or policy changes\, but to load balancer "remapping" events. We precisely categorize remapping events and find that they are a much more frequent contributor of path changes than previously recognized. By making D-Miner and our collected Internet-wide topologies publicly available\, we hope to help facilitate better understanding of the Internet's true structure and resilience.\n\n \;\nMaxime Raynal (NBLF)\nString alignment and clustering at the pattern level\nEdit distances\, such as the Longest Common Subsequence (LCS) distance\, or the Levenshtein distance\, are widely used to compare strings. Their use-cases include system logs clustering and automatic log parsing\, fuzzy string search\, as well as DNA sequences comparison and alignment. All the existing edit distances on strings compare them at the character level\; this does not allow to compare the underlying structure of two strings\, only the character which compose them.\n\n \;\n\nhttps://telecom-paris.zoom.us/j/94880732137?pwd=L0MzV3B Dend4VXFNcjc5OVBCaUNHdz09\n\n– ID de réunion : 948 8073 2137\n– Code secret : 705442 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:640@lincs.fr DTSTART;TZID=Europe/Paris:20210621T170500 DTEND;TZID=Europe/Paris:20210621T175000 DTSTAMP:20210614T105556Z URL:https://www.lincs.fr/events/from-artifacts-to-systems-to-people/ SUMMARY:From artifacts to systems to people: evolving directions in computing research and education DESCRIPTION:Computing is now “old enough” as a discipline that we can already detect broad trends in research directions. \; We discuss these trends\, with an emphasis on both current and future directions in computing research\, which we see reflected locally (at my own university\, UMass Amherst) nationally and internationally. \; We’ll discuss recent national computing research and education programmatics and trends\, and the role of computing in the larger R&\;D enterprise.\n\n \;\nhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9 FQlAzTUlkdzFyMmlmWS9Ld1lMQT09\n- ID de réunion : 971 2016 7222- Code secret : 895458 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:644@lincs.fr DTSTART;TZID=Europe/Paris:20210621T161000 DTEND;TZID=Europe/Paris:20210621T165500 DTSTAMP:20210618T071125Z URL:https://www.lincs.fr/events/talk-by-prof-kumar/ SUMMARY:Security of Cyberphysical Systems DESCRIPTION:The coming decades may see the large scale deployment of networked cyber–physical systems to address global needs in areas such as energy\, water\, health care\, and transportation. However\, as recent events have shown\, such systems are vulnerable to cyber attacks. We present a general technique\, called "dynamic watermarking\," for detecting any sort of malicious activity in networked systems of sensors and actuators. We present results of tests on automobiles both in a lab setting\, and on a test track\, a lab process control system\, a lab model of a helicopter\, a lab version of a solar-powered distribution system\, and a simulation study of defense against an attack on the power system.\n\n[Joint work with Bharadwaj Satchidanandan\, Jaewon Kim\, Woo Hyun Ko\, Tong Huang\, Lantian Shangguan\, Kenny Chour\, Gopal Kamath\, Jorge Ramos\, Le\, Swaminathan Gopalswamy\, Le Xie\, and Prasad Enjeti].\n\n \;\nhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9FQl AzTUlkdzFyMmlmWS9Ld1lMQT09\n- ID de réunion : 971 2016 7222- Code secret : 895458 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:638@lincs.fr DTSTART;TZID=Europe/Paris:20210621T151500 DTEND;TZID=Europe/Paris:20210621T160000 DTSTAMP:20210614T105501Z URL:https://www.lincs.fr/events/queuing-models-of-radio-access-networks-of fering-streaming-and-elastic-services/ SUMMARY:Queuing Models of Radio Access Networks Offering Streaming and Elastic Services DESCRIPTION:We consider radio access networks (RANs) offering streaming and elastic services. The RAN is modeled with tools from queuing theory\, and we examine the cases in which the system performance can be derived with low complexity. In addition\, we provide numerical results for common cell configurations\, showing that some of the emerging behaviors can be unexpected\, and provide insight into the effective deployment of small cells.\n\n \;\nhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9FQlAz TUlkdzFyMmlmWS9Ld1lMQT09\n- ID de réunion : 971 2016 7222- Code secret : 895458 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:646@lincs.fr DTSTART;TZID=Europe/Paris:20210621T131500 DTEND;TZID=Europe/Paris:20210621T144500 DTSTAMP:20210616T135914Z URL:https://www.lincs.fr/events/lincs-supervised-members-elevator-pitches- poster-session-day-1/ SUMMARY:LINCS supervised members elevator pitches + poster session (day 1) DESCRIPTION:Matthieu Gouel (PhD - Sorbonne) \;  \;\nZeph &\; Iris Map the Internet - A resilient reinforcement learning approach to distributed IP route tracing\nWe describe a new state-of-the-art system for distributed tracing at the IP level of the routes that packets take through the IPv4 internet. Our Zeph algorithm coordinates route tracing efforts across agents at multiple vantage \;points\, assigning to each agent a number of /24 destination prefixes in proportion to its probing budget and chosen according to a reinforcement learning heuristic that aims to maximize the number of multipath links \;discovered. Zeph runs on top of Iris\, our fault tolerant system for orchestrating internet measurements across distributed agents of heterogeneous probing capacities. Iris is built around third party free open source software \;and modern containerization technology\, thereby presenting a new model for assembling a resilient and maintainable internet measurement architecture. Zeph\, deployed on 18 Iris agents\, is capable of discovering in 10 cycles \;of 1 day each 2.10M nodes and 13.98M edges\, as compared to 2.71M nodes and 6.34M edges over the same amount of time by the 110 agents of a currently deployed reference measurement system\, Archipelago.\n \;\nAbhishek Kumar Mishra (PhD - Inria) \;  \;  \;  \;  \;  \;  \;\nNemFi - Record-and-replay for WiFi\nWe present \;NemFi: a trace-driven WiFi emulator. \;NemFi is a record-and-replay tool that can capture traces representing real WiFi conditions\, and later replay these traces to reproduce the same conditions. We demonstrate that the state-of-the-art cellular emulator cannot emulate WiFi conditions. We identify the key properties that need to be addressed to enable accurate WiFi record-and-replay\; namely: WiFi packet losses\, medium-access control\, and frame-aggregation. We therefore extend and re-design the existing cellular network emulator to incorporate these properties to support WiFi record-and-replay. We evaluate the performance of \;NemFi \;against repeated experimentation across different WiFi conditions and for three different types of applications: speed-test\, file download\, and video streaming. Our experimental results demonstrate that \;NemFi \;achieves accurate record-and-replay as we obtain 97 percent similar application performance using \;NemFi versus repeated experimentation in similar settings.\n \;\nAnh Nguyen (PhD - TP)\nCellular Traffic Type Recognition and Prediction\n4G and 5G cellular traffic pattern recognition and prediction are key objectives for network optimization. They also are becoming of fundamental importance for the next-generation cellular network. Recognizing mobile traffic patterns and proactively knowing the user behaviors allow the operator to optimize the resource allocation. On the other hand\, it is a complex problem due to the diverse set of applications behind the traffic. Most traffic prediction problems focus on capturing the dynamic of traffic and enhancing the performance. In this paper\, we design a deep learning model for traffic pattern recognition and prediction of the type of arrival packet using Long Short-Term Memory (LSTM) neural networks. The mobile traffic information is collected from the Downlink Control Information (DCI) using the Amarisoft software. The learning phase of the model relies on a well-known traffic pattern simulated on Amarisoft 4G and 5G testbed.\n\n \;\nPierre Popineau \; (PhD - Inria) \;  \;  \;  \;  \;\nStochastic geometry and wireless networks\nGeometry plays a key component in the study of wireless networks. In order to conduct both stationary and dynamical analysis of wireless network\, stochastic geometry has proven to be a versatile tool that provides a framework to study complex\, layered networks\, following the latest norms in 5G communication norms\n\n \;\nYibo Quan (PhD - TP) \;  \;  \;  \;  \;\nSpatio-Temporal Wireless D2D Network With Beamforming\nWe consider a dynamic device-to-device (D2D) communication model where transmitters and receivers adopt beamforming (BF). A continuous spatio-temporal model for the wireless network is analyzed\, which combines a spatial point process and a dynamic birth-death process .\nWe model BF by using a uniform linear array (ULA) and derive an analytical stability condition of such a network. We show that the critical arrival rate increases with the number of antennas at the transmitter and the receiver.\n\n \;\nDeepa Jagyasi (engineer - TP) \;  \;\nA Moving User Beam-Predictor for mmW Heterogeneous Networks \; \; \;\nThis study demonstrates an efficient machine learning (ML)-aided moving user beam predictor for millimeter wave (mmW) base stations (BSs) while leveraging the sub-6GHz BSs channel information in a heterogeneous network setting. Heterogeneous network architecture wherein multiple small-cell mmW BSs coexist with legacy sub-6GHZ macro-cells is considered as a promising technique for the next-generation cellular networks\, since it benefits in achieving improved reliability\, enhanced coverage and huge unlicensed communication bandwidth while reducing overall infrastructural cost. However\, identifying the optimal mmW BS and best beam to serve the user equipment (UE) is a time-taking challenging task and introduces unacceptable latency. Furthermore\, the dynamic movement of users and obstacles increases the overall complexity of the problem. In this paper\, we propose a novel deep recurrent neural network (RNN)-based method for BS and beam prediction while accommodating user movement in the presence of multiple static and dynamic obstacles. To achieve this task\, we propose a two-step process. At first\, we design a DNN which consider the basic components from the Channel State Information (CSI) of the sub-6GHz network along with the 3D feature map as input and predicts the best mmW BS and beam for the current time slot. Later the predicted results of the first step along with the 3D feature map are passed through the designed RNN to obtain the predictions of best mmW BS and beam for next-slot on-wards to multiple future time-slots. The main contributions of the paper are\; a) the proposed system is designed for a highly mobile user environment which accounts for the static and dynamic blockages\, b) prediction for the best BS and beam are obtained for the current time slot along with multiple time-slots ahead\, c) we develop a static 3D feature map encapsulating the environment information for better learning\, and\, d) the system is designed without any external sensor and user-location information as input feature. The performance of the method is evaluated over multiple metrics and is compared with the conventional exhaustive search method. The proposed method demonstrates better performance than exhaustive search in terms of latency with at least 85% accuracy. \;\n \;\nCamila Fernandez (PhD - Sorbonne+NBLF) \;  \;  \;  \;  \;\nTime-to-event Analysis\nTime-to-event analysis is a branch of statistics that looks for modeling the time remaining until a certain critical event occurs. One of the main interests of time-to-event analysis is right censoring\, it comes naturally from the fact that not necessary all the samples have reached the event time which makes the problem more difficult and a different challenge from the typical regression problem. I will show in this presentation an experimental comparison between different types of time-to-event analysis methods through the implementation of two different scores.\n \;\nArmand Boschin (PhD - TP) \;  \;  \;  \;  \;  \;  \;  \;\nRelation Prediction by Knowledge Graph Embedding\nWe address the issue of relation prediction in a knowledge graph (KG). For instance\, we would like to complete the triple (Berlin\, *\, Germany) with the relation capital of\, assuming this fact is not in the KG. While existing KG embedding models can be used for this task\, their performance is not satisfactory. In this paper\, we propose two methods that greatly improve the performance of these models: first\, a new neg- ative sampling method that balances the roles of entities and relations during training\; second\, a method to select candidate relations linking two entities using the rdf:type edges of these entities. We obtain accu- racy scores as high as 94% on the popular FB15k237 dataset and 75% on WDV5\, an extraction of Wikidata. This performance is all the more remarkable that it is obtained with TransE\, the simplest model for KG embedding. As an application of our approach\, we show how to enrich Wikidata by the semantification of Wikipedia\, i.e.\, by predicting the relations associated with hyperlinks between pages of Wikipedia.\n \;\nEva Bouba (Intern - Inria) \;  \;  \;\nWind Farm Optimization Using Reinforcement Learning\nAfter an introduction on what wind farm optimization and reinforcement learning are\, I will present how the latter can be applied to wind farm optimization and the main challenges this poses\n \;\nPierre Civit (PhD - Sorbonne) \;  \;  \;  \;\nDynamic Composable Secure Emulation\nWe present probabilistic dynamic I/O automata\, a framework to model dynamic probabilistic systems. Our work extends dynamic I/O Automata formalism (Attie &\; Lynch) \; to \; probabilistic setting. The original dynamic I/O Automata formalism included operators for parallel composition\, action hiding\, action renaming\, automaton creation\, and behavioral sub-typing by means of trace inclusion. \; They can model mobility by using signature modification. They are also hierarchical: a dynamically changing system of interacting automata is itself modeled as a single automaton.\n\nOur work extends to probabilistic settings all these features.  \;Furthermore\, we prove necessary and sufficient conditions to obtain the implementation monotonicity with respect to automata creation and destruction. Our work lays down the premises for extending composable secure-emulation \; (Canetti\, Lynch &\; al.) to dynamic settings\, an important tool towards the formal verification of protocols combining \; probabilistic distributed systems and cryptography in dynamic settings (e.g. blockchains\, secure distributed computation\, cybersecure distributed protocols etc).\n \;\nThomas Le Corre (Intern - Inria)\nKullback-Leibler optimal control\nThe gradual increase in the electricity mix of the part of renewable intermittent resources is making the production / consumption adjustment at any time more difficult. It is therefore necessary to face this challenge in order to move towards smart grids. This is why an idea is emerging which consists in using flexibilities of some agents in order to absorb the excess or lack of electricity\, when needed.\n\nWe place ourselves here from the point of view of a "central planner" who receives a signal corresponding to the electrical production and tries to optimize the consumption of a large number of agents. We want to minimize the Kullback-Leibler distance to the nominal behaviour\, in order to conserve a good quality of service\, while trying to fit the global consumption to the signal.\n\n \;\nAndrian Putina (PhD - TP) \;\nRandom Histogram Forest for Unsupervised Anomaly Detection\nRoughly speaking\, anomaly detection consists of identifying instances whose features significantly deviate from the rest of input data. It is one of the most widely studied problems in unsupervised machine learning\, boasting applications in network intrusion detection\, healthcare and many others. Several methods have been developed in recent years\, however\, a satisfactory solution is still missing to the best of our knowledge. We present Random Histogram Forest an effective approach for unsupervised anomaly detection. Our approach is probabilistic\, which has been proved to be effective in identifying anomalies. Moreover\, it employs the fourth central moment (aka kurtosis)\, so as to identify potential anomalous instances. We conduct an extensive experimental evaluation on 38 datasets including all benchmarks for anomaly detection\, as well as the most successful algorithms for unsupervised anomaly detection\, to the best of our knowledge. We evaluate all the approaches in terms of the average precision of the area under the precision-recall curve (AP). Our evaluation shows that our approach significantly outperforms all other approaches in terms of AP while boasting linear running time.\n\n \;\n\nhttps://telecom-paris.zoom.us/j/94880732137?pwd=L0MzV3B Dend4VXFNcjc5OVBCaUNHdz09\n\n– ID de réunion : 948 8073 2137\n– Code secret : 705442 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:637@lincs.fr DTSTART;TZID=Europe/Paris:20210621T103000 DTEND;TZID=Europe/Paris:20210621T114500 DTSTAMP:20210614T084409Z URL:https://www.lincs.fr/events/lincs-members-scientific-highlights-day-1/ SUMMARY:LINCS members scientific highlights (day 1) DESCRIPTION:Quentin Lutz (Télécom-Paris)\nScikit-network: Graph Analysis in Python\nScikit-network is a Python package inspired by scikit-learn for the analysis of large graphs. Graphs are represented by their adjacency matrix in the sparse CSR format of SciPy. The package provides state-of-the-art algorithms for ranking\, clustering\, classifying\, embedding and visualizing the nodes of a graph. High performance is achieved through a mix of fast matrix-vector products (using SciPy)\, compiled code (using Cython) and parallel processing. The package is distributed under the BSD license\, with dependencies limited to NumPy and SciPy. It is compatible with Python 3.7 and newer. Source code\, documentation and installation instructions are available online.\n\n \;\nAna Busic (Inria)\nZap Q-learning with Nonlinear Function Approximation\nZap Q-learning is a recent class of reinforcement learning algorithms\,\nmotivated primarily as a means to accelerate convergence. Stability\ntheory has been absent outside of two restrictive classes: the tabular\nsetting\, and optimal stopping. This paper introduces a new framework for\nanalysis of a more general class of Zap stochastic approximation\nalgorithms. Based on this general theory\, it is shown that Zap\nQ-learning converges\, even when the function approximation architecture\nis nonlinear.\n\nBased on a joint work with Shuhang Chen\, Adithya M. Devraj\, Fan Lu\, and\nSean Meyn.\n\n \;\nMaria potop-butucaru (Sorbonne)\ngaming the decentralized finance Potop-Butucaru\nDecentralized finance opens a new research field: reliable distributed economical systems that is a cross research between classical distributed systems and mathematical models for economical systems. Blockchain technology is today at the core of decentralized finance. Differently from the classical distributed systems\, blockchain technology faces complex faults and behaviors including rational. Interestingly\, when rational behaviors are combined with classical faults (e.g. Byzantine behaviors) established results in distributed computing need to be revisited. This talk reports several results related to robustness of distributed abstractions  \; used in blockchain technologies to Byzantine and rational behaviors analyzed through the lens of game theory.\n \;\nFrançois Durand (NBLF)\nVoting rules for the aggregation of algorithms\nMany problems\, for example in decision-making\, cannot be solved in an exact way and use heuristics which assign scores to the various possible choices. These heuristics can be numerous and more or less correlated: for example\, by varying the hyperparameters of an algorithm\, we can generate a whole family of heuristics that are strongly correlated but of variable quality. Rather than looking for the best heuristic\, we propose to aggregate the scores in a smart way that is inspired by voting theory. Our solution\, which uses correlations between heuristics\, is more efficient than trivial aggregation and more robust than an approach based on maximum likelihood.\n\n \;\nKalpana Singh (SystemX)\nBitcoin wallet security using non-interactive threshold ECDSA\nAbstract In this talk\, we will study the risen need of threshold ECDSA for Cryptocurrencies security. As with the financial transactions\, the intent is for the digital signature to uniquely identify and verify authorization of the approving party\, to prevent forgery by unauthorized parties\, and to be associated with a specific transaction. Cryptocurrencies achieve these objectives by using cryptographic keys to generate an Elliptic Curve Digital Signature Algorithm (ECDSA) signature which authorize transactions. Protecting these cryptographic keys is paramount to protecting the wallet and the wallet holder’s associated digital assets. To achieve this objective\, threshold ECDSA has been studied in the cryptocurrency’s security.\n\n \;\n\nhttps://telecom-paris.zoom.us/j/94880732137?pwd=L0M zV3BDend4VXFNcjc5OVBCaUNHdz09\n\n– ID de réunion : 948 8073 2137\n– Code secret : 705442 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:636@lincs.fr DTSTART;TZID=Europe/Paris:20210621T093000 DTEND;TZID=Europe/Paris:20210621T100000 DTSTAMP:20210614T084310Z URL:https://www.lincs.fr/events/communication-network-researchlincs/ SUMMARY:Communication Network Research @ LINCS DESCRIPTION:I will review recent contributions of members of LINCS to the field of cellular communication networks. This will cover topics ranging from the development of new stochastic geometry tools for these networks\, to research conducted on core 5G issues like beam management or bandwidth part\, to research on specific domains like vehicular networks or non-terrestrial networks.\n\n \;\n\nhttps://telecom-paris.zoom.us/j/94880732137?pwd=L0M zV3BDend4VXFNcjc5OVBCaUNHdz09\n\n– ID de réunion : 948 8073 2137\n– Code secret : 705442 CATEGORIES:LINCS Workshop,Workshop LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:589@lincs.fr DTSTART;TZID=Europe/Paris;VALUE=DATE:20210621 DTEND;TZID=Europe/Paris;VALUE=DATE:20210623 DTSTAMP:20210708T123532Z URL:https://www.lincs.fr/events/2021-workshop-with-lincs-scientific-commit tee/ SUMMARY:2021 Workshop with LINCS Scientific Committee DESCRIPTION:\n\n\n\n\n\n\n\n \;\n\nLINCS organizes a rich two-day event with talks by its international Scientific Committee.\nMonday 21st (Paris time)\n15.15 - 16.00 Invited talk by Professor Marco Ajmone-Marsan (PoliTecnico di torino) on “Queuing Models of Radio Access Networks Offering Streaming and Elastic Services” \; \; \; \; \; \; \; \; \;\ nWe consider radio access networks (RANs) offering streaming and elastic services. The RAN is modeled with tools from queuing theory\, and we examine the cases in which the system performance can be derived with low complexity. In addition\, we provide numerical results for common cell configurations\, showing that some of the emerging behaviors can be unexpected\, and provide insight into the effective deployment of small cells.\n16.10 -16.55 Invited talk by Professor P.R. Kumar (Texas A&\;M University) on “Security of Cyberphysical Systems”\nThe coming decades may see the large scale deployment of networked cyber-physical systems to address global needs in areas such as energy\, water\, health care\, and transportation. However\, as recent events have shown\, such systems are vulnerable to cyber attacks. We present a general technique\, called "dynamic watermarking\," for detecting any sort of malicious activity in networked systems of sensors and actuators. We present results of tests on automobiles both in a lab setting\, and on a test track\, a lab process control system\, a lab model of a helicopter\, a lab version of a solar-powered distribution system\, and a simulation study of defense against an attack on the power system.\n[Joint work with Bharadwaj Satchidanandan\, Jaewon Kim\, Woo Hyun Ko\, Tong Huang\, Lantian Shangguan\, Kenny Chour\, Gopal Kamath\, Jorge Ramos\, Le\, Swaminathan Gopalswamy\, Le Xie\, and Prasad Enjeti].\n17.05 - 17.50 Invited talk by Professor Jim Kurose (University of Massachusetts) on “From artifacts to systems to people: evolving directions in computing research and education”\nComputing is now “old enough” as a discipline that we can already detect broad trends in research directions. \; We discuss these trends\, with an emphasis on both current and future directions in computing research\, which we see reflected locally (at my own university\, UMass Amherst) nationally and internationally. \; We’ll discuss recent national computing research and education programmatics and trends\, and the role of computing in the larger R&\;D enterprise.\n\nTuesday 22nd (Paris time)\n\n\n\n14.25 - 15.10 Invited talk by Professor Holger Karl (Universität Paderborn) on “Machine Learning for Network Management” \; \; \; \; \; \; \;\n\n\n Machine Learning has been applied to a wide range of networking topics. Network management provides ample examples\, often of the type of combinatorial optimizations. In the talk\, we look at two examples. One example comes from the context of network softwarization\, where we investigate how machine learning approaches can help with scaling and placing virtual network functions\, as well as routing traffic between them. The second example comes from wireless sensor networks with acoustic applications in mind\, where we need to balance acoustic sensing quality with wireless network quality and use these two metrics to move mobile microphones into good locations. \n\n\n15.40 - 16.25 Invited talk by Professor Leandros Tassiulas (Yale University) on “Enabling intelligent services via function virtualization at the network edge”\nThe proliferation of novel mobile applications and the associated AI services necessitates a fresh view on the architecture\, algorithms and services at the network edge in order to meet stringent performance requirements. Some recent work addressing these challenges is presented. In order to meet the requirement for low-latency\, the execution of computing tasks moves form the cloud to the network edge\, closer to the end-users. The joint optimization of service placement and request routing in dense mobile edge computing networks is considered. Multidimensional constraints are introduced to capture the storage requirements of the vast amounts of data needed. An algorithm that achieves close-to-optimal performance using a randomized rounding technique is presented. Recent advances in network virtualization and programmability enable realization of services as chains\, where flows can be steered through a pre-defined sequence of functions deployed at different network locations. The optimal deployment of such service chains where storage is a stringent constraint in addition to computation and bandwidth is considered and an approximation algorithm with provable performance guarantees is proposed and evaluated. Finally the problem of traffic flow classification as it arises in firewalls and intrusion detection applications is presented. An approach for realizing such functions based on a novel two-stage deep learning method for attack detection is presented. Leveraging the high level of data plane programmability in modern network hardware\, the realization of these mechanisms at the network edge is demonstrated. \;\n\n\n\n16.35 - 17.20 Invited talk by Professor Roch Guerin (Washington University in Saint Louis) on “Edge Classification: Offloading under Token Bucket Constraints” \; \; \; \; \; \; \; \;\n\n\ n We consider an edge-computing setting where machine learning-based algorithms are used for real-time classification of inputs acquired by devices\, e.g.\, cameras. \; Computational resources on the devices are constrained\, and therefore only capable of running machine learning models of limited accuracy. A subset of inputs can be offloaded to the edge for processing by a more accurate but resource-intensive machine learning model. Both models process inputs with low-latency\, but offloading incurs additional network and compute delays. To manage these delays and meet application deadlines\, a token bucket constrains transmissions from the device. We first introduce a Markov Decision Process-based framework to make offload decisions under such constraints when the input process is i.i.d. Decisions are based on the local model's confidence and the token bucket state\, with the goal of minimizing a specified error measure for the application. We then extend the approach to configurations involving multiple devices connected to the same access switch to realize the benefits of a shared token bucket. Next we explore an approach based on deep Q-networks (DQN) to handle more complex input and classification processes\, and demonstrate its ability to learn such features and effectively incorporate them into policy decisions. \; We evaluate and analyze the policies derived using our framework on the standard ImageNet image classification benchmark.1\,2\n\n\n 1. This is joint work with Ayan Chakrabarti\, Chenyang Lu\, Jiaming Qiu\, Ruiqi Wang\, and Jiangnan Liu 2. Part of this work will be presented at the 2021 ACM/IEEE SEC conference\n\n\n\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:652@lincs.fr DTSTART;TZID=Europe/Paris:20210618T130000 DTEND;TZID=Europe/Paris:20210618T140000 DTSTAMP:20210624T094542Z URL:https://www.lincs.fr/events/git-101-how-to-use-git-in-an-idiomatic-way / SUMMARY:Git 101 - How to use git in an idiomatic way DESCRIPTION:Git is a very popular version control software. While being very flexible\, it is quite easy to get lost in the command and use it in a very un-optimal way. In this presentation\, we will show visualization software for git\, how to avoid anti patterns in git and more generally have a better time collaborating with git. Bring all your git questions with you :).\n\nUseful links:\n- http://git-school.github.io/visualizing-git/\,\n- https://learngitbranching.js.org/.\n\nSlides CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:634@lincs.fr DTSTART;TZID=Europe/Paris:20210616T140000 DTEND;TZID=Europe/Paris:20210616T150000 DTSTAMP:20210617T112306Z URL:https://www.lincs.fr/events/r-swap-relay-based-atomic-cross-chain-swap -protocol/ SUMMARY:R-SWAP: Relay based atomic cross-chain swap protocol DESCRIPTION:In this presentation\, we consider the problem of cross-chain transactions where parties that do not trust each other safely exchange digital assets across blockchains. Open blockchains models are decentralized ledgers that keep records of transac- tions. They are comparable with distributed account books. While they have proven their potential as a store of value\, exchanging assets across several blockchains remains a challenge. We propose a new protocol\, R-SWAP\, for cross-chain swaps that outperforms existing solutions. Our protocol is built on top of two abstractions: relays and adapters that we formalize for the first time. Furthermore\, we prove the correctness of R-SWAP and analytically evaluate its performances\, in terms of cost and latency. Moreover\, we evaluate the performances of R-SWAP in two case studies showing the generality of our approach: atomic swaps between Ethereum and Bitcoin (two popular permissionless blockchains) and atomic swaps between Ethereum and Tendermint (one permissionless and one permis- sioned blockchain). CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:649@lincs.fr DTSTART;TZID=Europe/Paris:20210609T140000 DTEND;TZID=Europe/Paris:20210609T150000 DTSTAMP:20210614T121126Z URL:https://www.lincs.fr/events/replica-mean-field-limits-for-intensity-ba sed-neural-networks/ SUMMARY:Replica-mean-field limits for intensity-based neural networks DESCRIPTION:Computational neuroscience features a variety of stochastic network models where both the input and the output of each neuron are point processes. In these models\, each neuron has a state which evolves as an integral with respect to its input point processes and which resets when the neuron spikes. In intensity-based neural networks\, the spikes of a given neuron have a stochastic intensity which is a linear function of the neuron state. Spiking events define the output point processes of the neuron. These\, together with the geometry of the network connections\, define in turn the input point processes of other neurons.\n\nDue to the inherent complexity of such intensity-based neural models\, relating the spiking activity of a network to its structure currently requires simplifying assumptions\, such as considering models in the thermodynamic mean-field limit. In this limit\, an infinite number of neurons interact via vanishingly small interactions\, thereby erasing the finite size geometry of interactions.\n\nTo better capture the geometry in question\, this paper analyzes the activity of intensity-based neural networks in the replica-mean-field limit regime. Such systems are made of infinitely many replicas which have the same basic structure as that of the finite network of interest and interact through randomized connections.\n\nThe main contribution is an analytical characterization of the stationary dynamics of intensity-based neural networks excitatory synapses in this replica-mean-field limit. Specifically\, the stationary dynamics of these limiting networks is functionally characterized via ordinary or partial differential equations derived from the Poisson Hypothesis of stochastic network theory. This functional characterization is reduced to a system of self-consistency equations specifying the stationary neuronal spiking rates. The approach combines the rate-conservation principle of Palm calculus\, analytical considerations from generating-function methods\, and propagation of chaos techniques.\n\nSuch limits can be used for first-order models\, whereby elementary replica constituents are single neurons with independent Poisson inputs\, and in second-order models\, where these constituents are pairs of neurons with exact pairwise interactions. In both cases\, these replica-mean-field networks provide tractable versions that retain important features of the finite network structure of interest.\n\nJoint work with T. Taillefumier. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:648@lincs.fr DTSTART;TZID=Europe/Paris:20210609T110000 DTEND;TZID=Europe/Paris:20210609T120000 DTSTAMP:20210624T094619Z URL:https://www.lincs.fr/events/around-the-poisson-voronoi-tessellation/ SUMMARY:Around the Poisson-Voronoi tessellation DESCRIPTION:Poisson point processes are one of the most common point processes studied in stochastic geometry. Adding a Voronoi tessellation to a Poisson point process leads to the Poisson-Voronoi tessellation\, which is commonly used to study wireless networks. In this talk\, we will study some useful and interesting results revolving around the Poisson-Voronoi tessellations and some applications.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:623@lincs.fr DTSTART;TZID=Europe/Paris:20210602T140000 DTEND;TZID=Europe/Paris:20210602T150000 DTSTAMP:20210603T073451Z URL:https://www.lincs.fr/events/phds-presentations-n-3/ SUMMARY:PhDs presentations n° 3 DESCRIPTION:Seminar by:\n\n* Razanne Abu-aisheh (PhD\, Inria+NBLF)\n\n* Gabriele Castellano (Postdoc\, Inria)\n\n* Camila Fernandez (PhD\, Sorbonne+NBLF) CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:633@lincs.fr DTSTART;TZID=Europe/Paris:20210602T104500 DTEND;TZID=Europe/Paris:20210602T120000 DTSTAMP:20210616T144311Z URL:https://www.lincs.fr/events/isp-probing-reduction-with-anaximander/ SUMMARY:ISP Probing Reduction with Anaximander DESCRIPTION:Dear all\, The Internet Measurement reading group will meet again on June 2nd. In this session Emeline Maréchal (ULiège) will present « ISP Probing Reduction with Anaximander ».\nI encourage you to join us at 10:45 for a virtual coffee break\, so that the talk begins at 11:00.\n\nDans cette présentation\, je vais parler de découverte de topologie\, et plus particulièrement de découverte de la topologie intra-domaine d’un AS en particulier.Rocketfuel est toujours considéré comme l’état de l’art pour se focaliser sur un AS d’intérêt. Seulement\, il date d’il y a 20 ans. Et le plus étonnant\, c’est que depuis Rocketfuel\, il n’y a pas eu de nouvelles tentatives pour cartographier des ASes.Je vais donc commencer par montrer les limites de RocketFuel dans l’Internet d’aujourd’hui\, ce qui nous permettra de voir en quoi il n’est plus adapté de nos jours.Je continuerai ensuite en vous présentant Anaximander\, notre nouvel outil\, qui est capable de diriger ses sondes vers l’AS d’intérêt\, tout en réduisant un maximum le nombre de sondes envoyées\, afin d’obtenir les cartes intra-domaines les plus précises possibles.Je présenterai nos différentes stratégies\, depuis le design de notre liste initiale de sondes\, jusqu’à nos différentes techniques de réduction\, basées sur l’analyse des tables de routage. Anaximander offre aussi la possibilité de contrôler le dilemme entre maximiser la couverture de l’AS et minimiser le nombre de sondes envoyées.\n \;\n\nEmeline Marechal received her MS degree in Computer Engineering from the Université de Liège (Belgium) in 2019. She is currently a Ph.D. student at the Montefiore Institute at the Université  de Liège. Her research interests are in network measurements\, including traffic and topology measurements\, and measurement applied to security.\n\n \;\n\n\nBest\,\nMaxime\n\n\n\n—Participer à la réunion Zoomhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9FQlAzTUlkdzFyMmlmWS9 Ld1lMQT09\nID de réunion : 971 2016 7222Code secret : 895458\n\n CATEGORIES:Internet Measurement,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:619@lincs.fr DTSTART;TZID=Europe/Paris:20210526T140000 DTEND;TZID=Europe/Paris:20210526T150000 DTSTAMP:20210603T073546Z URL:https://www.lincs.fr/events/talk-by-ilia-shilov/ SUMMARY:"Risk-Averse Equilibrium Analysis and Privacy Impact on Generalized Nash Equilibrium in Peer-to-Peer Electricity Market" DESCRIPTION:We consider a network of prosumers trading electricity under (i) a centralized market design\, seen as the benchmark\, formulated as an optimization problem\, and (ii) a peer-to-peer market design\, formulated as a generalized Nash equilibrium problem. \;High renewable energy penetration requires that the market properly handles uncertainty. To that purpose\, we introduce coherent risk measures in the prosumers’ utility functions\, reflecting heterogeneity in their risk attitudes. In this risk augmented setting\, we formulate risk neutral and risk-averse models for (i)\, (ii). We characterize risk-neutral and risk-averse market equilibrium\, relying on generalized Nash equilibrium and variational equilibrium as solution concepts. To hedge their risk towards uncertainty and complete the market\, prosumers can trade financial contracts. We provide closed form characterizations of the risk-adjusted probabilities and the prices for the financial contracts trading under different market regimes. \;Privacy being one crucial feature of peer-to-peer markets\, \;we \;extend \;the risk-neutral model of the \;peer-to-peer electricity market \;by formulating it as a \;noncooperative communication game\, where the agents determine their randomized reports to share with the other market players\, while anticipating the form of the peer-to-peer market equilibrium. We characterize the equilibrium of the game\, prove the uniqueness of the Variational Equilibria and provide a closed form expression of the privacy price. \;On a three node toy network and the IEEE 14-bus network\, we provide numerical analysis of the impact of risk heterogeneity\, financial contracts and privacy inclusion on the prosumers’ expected costs. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:632@lincs.fr DTSTART;TZID=Europe/Paris:20210526T110000 DTEND;TZID=Europe/Paris:20210526T120000 DTSTAMP:20210624T093705Z URL:https://www.lincs.fr/events/asynchronous-programming-in-python/ SUMMARY:Asynchronous programming in Python DESCRIPTION:By default\, in most programming languages\, input/output operations are blocking: the execution flow of the program is stopped while waiting for external data from the disk or the network.\nThis is wasteful as these operations can take up to multiple seconds\, and during this time the CPU is free for running other tasks.\nAsynchronous I/O is a set of techniques to enable non-blocking I/O operations and achieve greater concurrency levels in I/O bound programs such as web servers.\nIn this session\, we will introduce asynchronous programming in Python by using the built-in asyncio library.\n\nSlides (pdf)\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:614@lincs.fr DTSTART;TZID=Europe/Paris:20210519T140000 DTEND;TZID=Europe/Paris:20210519T150000 DTSTAMP:20210520T073147Z URL:https://www.lincs.fr/events/talk-by-francesca-bassi/ SUMMARY:Radio and compute resource allocation in C-RAN DESCRIPTION:The principal tenet of C-RAN is the softwarization of the base-band signal processing\, which enables the sharing of compute resources among multiple radio heads. Resource allocation in C-RAN is constrained by the hard deadline within which the computation in the shared resource pool needs to happen to preserve the functionality of the system.\n \;\nWhen the aggregate demand of compute resources in the pool exceeds the capacity\, a fraction of the radio packets is lost. A natural choice for the allocation policy is to minimize the loss rate. An alternative strategy is to maximize the PHY layer througput. Both strategies may be pursued by framing the allocation of compute resources as an optimization problem.\n \;\nIn order to select the best strategy it is useful to consider the impact of the choice on upper layers. We consider the performance at the MAC layer\, after the HARQ process has taken place. Each packet lost due to lack of compute resources triggers an HARQ request of retransmission. If the loss happens on the last allowed transmission\, all the radio resources (present and past) spent for the message go to waste. This consideration suggests that a policy of allocation of the compute resources accounting for the retransmission age of the frame may increase the performance. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:631@lincs.fr DTSTART;TZID=Europe/Paris:20210519T110000 DTEND;TZID=Europe/Paris:20210519T120000 DTSTAMP:20210624T094601Z URL:https://www.lincs.fr/events/existence-of-fixed-points-for-the-gi-1-que ue/ SUMMARY:Existence of fixed points for the ./GI/1 queue DESCRIPTION:We present the work of Mairesse and Prabakhar on the existence of fixed points for infinite tandems of queues with i.i.d. service times. We will first introduce the formalism of queueing maps in a general setting\, before presenting the main results on both existence and uniqueness of fixed points for these queueing maps. We will also discuss the range of means of service times for which such fixed points exist.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:630@lincs.fr DTSTART;TZID=Europe/Paris:20210512T104500 DTEND;TZID=Europe/Paris:20210512T120000 DTSTAMP:20210624T114015Z URL:https://www.lincs.fr/events/networking-on-the-move/ SUMMARY:Networking on the Move DESCRIPTION:Dear all\, \nThe Internet Measurement reading group will meet again on May 12th.\n\nIn this session we will discuss Internet aboard trains\, planes and in space.\nWe will discuss the technologies\, their performance and the challenges for Internet measurements.\n\nI encourage you to join us at 10:45 for a virtual coffee break\, so that the talk begins at 11:00.\n\n\n\n\n\n—\n\n\nParticiper à la réunion Zoomhttps://telecom-paris.zoom.us/j/97120167222?pwd=NS9FQlAzTUlkdzFyMmlmWS9 Ld1lMQT09ID de réunion : 971 2016 7222Code secret : 895458\n\n\n\n\n CATEGORIES:Internet Measurement,Youtube END:VEVENT BEGIN:VEVENT UID:622@lincs.fr DTSTART;TZID=Europe/Paris:20210505T140000 DTEND;TZID=Europe/Paris:20210505T150000 DTSTAMP:20210520T072932Z URL:https://www.lincs.fr/events/phds-presentations-2/ SUMMARY:PhDs presentations n° 2 on "Network Theory + Wireless (5g & V2X)" DESCRIPTION:Seminar by:\n\n Stefano Iellamo (Engineer TP) = Wireless Networks\n Yibo Quan (PhD TP) = Wireless Networks\n Maxime Raynal (PhD Nokia) = Graphs\, machine learning\, algorithmics\n Bharath Roy Choudhury (PhD Inria) = Network Theory\n Michael Davidov (PhD Inria) = Network Theory\n Sayeh Khaniha (PhD Inria) = Network Theory\n Pierre Popineau (PhD Inria) = Network Theory\n CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:629@lincs.fr DTSTART;TZID=Europe/Paris:20210505T110000 DTEND;TZID=Europe/Paris:20210505T120000 DTSTAMP:20210518T080637Z URL:https://www.lincs.fr/events/python-profiling/ SUMMARY:Python profiling DESCRIPTION:This session will be devoted to a non-exhaustive view of profiling techniques that can be useful in Python. While profiling is absolutely no substitute for the algorithmic complexity analysis\, it is a quick\, easy\, and seductive path to find out the real bottlenecks of your code and get rid of them.\n\nHyperlinks mentionned in the chat during the session:\n\n IPython magics: https://ipython.readthedocs.io/en/stable/interactive/magics.html\,\n Python 3-cprofile (Lincs intranet): https://wiki.inria.fr/lincs/Python3-cprofile.\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:625@lincs.fr DTSTART;TZID=Europe/Paris:20210428T140000 DTEND;TZID=Europe/Paris:20210428T150000 DTSTAMP:20210429T073822Z URL:https://www.lincs.fr/events/seminar-talk-by-theodoros-giannakas/ SUMMARY:SOBA: Session optimal MDP-based network friendly recommendations DESCRIPTION:Caching content over CDNs or at the network edge has been solidified as a means to improve network cost and offer better streaming experience to users. Furthermore\, nudging the users towards low-cost content has recently gained momentum as a strategy to boost network performance. We focus on the problem of optimal policy design for Network Friendly Recommendations (NFR). We depart from recent modeling attempts\, and propose a Markov Decision Process (MDP) formulation. MDPs offer a unified framework that can model a user with random session length. As it turns out\, many state-of-the-art approaches can be cast as subcases of our MDP formulation. Moreover\, the approach offers flexibility to model users who are reactive to the quality of the received recommendations. In terms of performance\, for users consuming an arbitrary number of contents in sequence\, we show theoretically and using extensive validation over real traces that the MDP approach outperforms myopic algorithms both in session cost as well as in offered recommendation quality. Finally\, even compared to optimal state-of-art algorithms targeting specific subcases\, our MDP framework is significantly more efficient\, speeding the execution time by a factor of 10\, and enjoying better scaling with the content catalog and recommendation batch sizes. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:628@lincs.fr DTSTART;TZID=Europe/Paris:20210428T110000 DTEND;TZID=Europe/Paris:20210428T120000 DTSTAMP:20210429T120250Z URL:https://www.lincs.fr/events/exponential-families/ SUMMARY:Exponential families DESCRIPTION:Exponential families are parametric sets of probability distributions that arise in many applications. These include well-known univariate distributions (such as the binomial\, Poisson\, geometric\, exponential\, and normal distributions)\, but also multi-variate distributions like probabilistic graphical models and stationary distributions of several queueing models. In this presentation\, we will first recall the definition of exponential families and motivate their study. In a second time\, we will present a generic method for approximating the normalization constant of these distributions\, as the exact calculation of this constant is practically infeasible in high dimension.\n\nReferences:\n\n M. J. Wainwright and M. I. Jordan. Graphical Models\, Exponential Families\, and Variational Inference. Foundations and Trends® in Machine Learning 1.1 (2008)\, https://people.eecs.berkeley.edu/~wainwrig/Papers/WaiJor08_FTML.pdf. Chapters 1\, 2\, and 3 and Appendix A.\n S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press (2004)\, https://web.stanford.edu/~boyd/cvxbook/bv_cvxbook.pdf. Section 3.3.\n Wikipedia pages Exponential family\, Maximum-entropy probability distribution\, Principle of maximum entropy\, Lagrange multiplier\, Convex conjugate.\n\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:616@lincs.fr DTSTART;TZID=Europe/Paris:20210421T140000 DTEND;TZID=Europe/Paris:20210421T150000 DTSTAMP:20210423T065428Z URL:https://www.lincs.fr/events/seminar-talk-by-p-jacquet-and-d-milioris/ SUMMARY:Pattern Matching\, text generation and sequence complexity DESCRIPTION:Pattern matching is a powerful tool used on many kinds of data as long as they stand on a linear support such as texts or other sequences. It can also be extended to regular supports standing in any Euclidian space. It constitutes the engine of the most powerful compression algorithms on texts and also the foundation of many universal predictors over time sequences. Recently pattern matching has been applied in short text classification under the name “Joint Complexity” in a perspective of Accelerated Artificial Intelligence. One of the interesting aspects of pattern matching is that it is based on extremely strong foundations in information theory and in the asymptotic analysis of algorithms. In particular when the source of sequence is well defined and parametrized. We will investigate the special case of Markov source models and show how they are “good enough” to model natural language texts. We will present some small games which illustrate this fact\, in parallel with the description of deeper theoretical results. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:627@lincs.fr DTSTART;TZID=Europe/Paris:20210421T104500 DTEND;TZID=Europe/Paris:20210421T120000 DTSTAMP:20210421T102019Z URL:https://www.lincs.fr/events/reduce-reuse-recycle-repurposing-existing- measurements-to-identify-stale-traceroutes/ SUMMARY:Reduce\, Reuse\, Recycle: Repurposing Existing Measurements to Identify Stale Traceroutes DESCRIPTION:Dear all\, \nThe Internet Measurement reading group will meet again on April 21st.\nWe will talk about the following paper : Reduce\, Reuse\, Recycle: Repurposing Existing Measurements to Identify Stale Traceroutes (Giotsas et al\, IMC 2020).\n\nI encourage you to join us at 10:45 for a virtual coffee break\, so that the talk begins at 11:00.\n\nAbstract:\n\n\n\n\nMany systems rely on traceroutes to monitor or characterize the Internet. The quality of the systems’ inferences depends on the completeness and freshness of the traceroutes\, but the refreshing of traceroutes is constrained by limited resources at vantage points. Previous approaches predict which traceroutes are likely out-of-date in order to allocate measurements\, or monitor BGP feeds for changes that overlap traceroutes. Both approaches miss many path changes for reasons including the difficulty in predicting changes and the coarse granularity of BGP paths.\nThis paper presents techniques to identify out-of-date traceroutes without issuing any measurements\, even if a change is not visible at BGP granularity. We base our techniques on two observations. First\, although BGP updates encode routes at AS granularity\, routers issue updates when they change intra-domain routes or peering points within the same AS path. Second\, route changes correlate across paths\, and many publicly available traceroutes exist. Our techniques maintain an atlas of traceroutes by monitoring BGP updates and publicly available traceroutes for signals to mark overlapping atlas traceroutes as stale. We focus our analysis of traceroute path changes at the granularity of border router IPs which provides an abstraction finer than AS or PoP-level but is not affected by the periodicity of intra-domain load balancers. Our evaluation indicates that 80% of the traceroutes that our techniques signal as stale have indeed changed\, even though the AS hops remained the same. Our techniques combine to identify 79% of all border IP changes\, without issuing a single online measurement.\n\n—\n\n\nParticiper à la réunion Zoom\nhttps://telecom-paris.zoom.us/j/94270583366?pwd=cGVqdGg4WEZZSldscGpvT TMvbEJOdz09\n\nID de réunion : 942 7058 3366\nCode secret : 821734\n\n\n\n\n CATEGORIES:Internet Measurement,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:615@lincs.fr DTSTART;TZID=Europe/Paris:20210407T140000 DTEND;TZID=Europe/Paris:20210407T150000 DTSTAMP:20210413T064639Z URL:https://www.lincs.fr/events/phds-presentations/ SUMMARY:PhDs presentations n° 1 on Network Metrology\, Blockchain\, Computational Social Choice DESCRIPTION:Seminar by:\n\n- Maxime Mouchet (Postdoc UPMC) = Network Metrology\n\n- Matthieu Gouel (PhD UPMC) = Network Metrology\n\n- Pierre Civit (PhD UPMC) = Blockchain\n\n- Simona Ramos (PhD NBLF) = Blockchain\n\n- Abhimanyu Rawat (PhD NBLF) = Blockchain\n\n- Théo Delemazure (Intern NBLF) = Computational Social Choice CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:624@lincs.fr DTSTART;TZID=Europe/Paris:20210407T110000 DTEND;TZID=Europe/Paris:20210407T120000 DTSTAMP:20210414T054518Z URL:https://www.lincs.fr/events/design-of-algorithms-for-the-production-of -training-data/ SUMMARY:Design of algorithms for the production of training data DESCRIPTION:There is a well-known saying in the supervised machine learning community: "garbage in\, garbage out". The performance of a supervised learning algorithm depends critically on the quantity and quality of training data. This training data is obtained from raw data through data labeling performed by human experts. The growing use of machine learning tools makes the design of efficient data labeling algorithms more relevant than ever.\n\nWe will present progress made in collaboration with Maya Stein (University of Chile) and Alexander Scott (Oxford University) on a problem proposed by Maria Laura Maag (Nokia). It corresponds to the reconstruction of a set partition using as few queries as possible\, each query asking whether two elements belong to the same block. We characterize the optimal algorithms and analyze the optimal distribution of the number of queries.\n\nSlides (Quentin)\n\nSlides (Élie) CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:606@lincs.fr DTSTART;TZID=Europe/Paris:20210331T140000 DTEND;TZID=Europe/Paris:20210331T150000 DTSTAMP:20210401T125932Z URL:https://www.lincs.fr/events/reconfigurable-intelligent-surfaces-for-wi reless-communications/ SUMMARY:Reconfigurable Intelligent Surfaces for Wireless Communications DESCRIPTION:Reconfigurable intelligent surfaces (RISs) have recently emerged as the new wireless communication research frontier with the goal of realizing metamaterial-coated smart and reconfigurable radio propagation environments via passive and tunable signal transformations. Featured by orders of magnitude lower hardware and energy cost than traditional active antenna-arrays and yet superior performance\, RISs are the new driving technology for future wireless networks\, especially for enabling them to migrate to higher frequency bands. RISs have the inherent potential of fundamentally transforming the current wireless network with active nodes solely into a new hybrid network comprising active and passive components co-working in an intelligent way\, so as to achieve a sustainable capacity growth with a low and affordable cost and power consumption. Therefore\, RISs have the potential to change how wireless networks are currently designed\, usher in that hoped-for wireless future\, and are regarded as an enabling technology for realizing the emerging concept of metamaterial-assisted smart radio environments (SREs). RIS-assisted SREs are a multidisciplinary research endeavor but are not well-understood. In this talk\, I will introduce the state of the art\, the research challenges\, and some recent research results at the crossroad of wireless communications\, electromagnetics\, physics\, and metamaterials. Source: arXiv:2004.09352 (IEEE JSAC\, Nov. 2020).\nBio\nMarco Di Renzo received the Laurea (cum laude) and Ph.D. degrees in electrical engineering from the University of L'Aquila\, Italy\, in 2003 and 2007\, respectively\, and the Habilitation à Diriger des Recherches (Doctor of Science) degree from University Paris-Sud\, France\, in 2013. Since 2010\, he has been with the French National Center for Scientific Research (CNRS)\, where he is a CNRS Research Director in the Laboratory of Signals and Systems (L2S) of Paris-Saclay University – CNRS and CentraleSupelec\, Paris\, France. In Paris-Saclay University\, he serves as the Coordinator of the Communications and Networks Research Area of the Laboratory of Excellence DigiCosme\, and as a member of the Admission and Evaluation Committee of the Ph.D. School on Information and Communication Technologies. Currently\, he serves as the Editor-in-Chief of IEEE Communications Letters\, and is a Distinguished Lecturer of the IEEE Vehicular Technology Society and IEEE Communications Society. Also\, he serves as the Founding Chair of the Special Interest Group on Reconfigurable Intelligent Surfaces of the Wireless Technical Committee of the IEEE Communications Society. He is a Highly Cited Researcher (Clarivate Analytics\, Web of Science)\, a Fellow of the IEEE\, and a Fellow of the IET. In 2019\, he was a recipient of a Nokia Foundation Visiting Professorship for conducting research on metamaterial-assisted wireless communications at Aalto University\, Finland. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:621@lincs.fr DTSTART;TZID=Europe/Paris:20210331T104500 DTEND;TZID=Europe/Paris:20210331T120000 DTSTAMP:20210418T142336Z URL:https://www.lincs.fr/events/internet-measurement-working-group-classif ication-of-load-balancing-in-the-internet/ SUMMARY:Classification of Load Balancing in the Internet DESCRIPTION:Dear all\, \n\nNext Wednesday (31/03/2021) will take place the first Internet Measurement reading group !\nWe will talk about the following paper : Classification of Load Balancing in the Internet (https://homepages.dcc.ufmg.br/~cunha/papers/almeida20infocom-mca.pdf).\n\n I encourage you to join us at 10:45 for a virtual coffee break\, so that the talk begins at 11:00.\n\nAbstract:\n\n\n\n\nRecent advances in programmable data planes\, software-defined networking\, and the adoption of IPv6 support novel\, more complex load balancing strategies. We introduce the Multipath Classification Algorithm (MCA)\, a probing algorithm that extends traceroute to identify and classify load balancing in Internet routes. MCA extends existing formalism and techniques to consider that load balancers may use arbitrary combinations of bits in the packet header for load balancing. We propose optimizations to reduce probing cost that are applicable to MCA and existing load balancing measurement techniques. Through large-scale measurement campaigns\, we characterize and study the evolution of load balancing on the IPv4 and IPv6 Internet with multiple transport protocols. Our results show that load balancing is more prevalent and that load balancing strategies are more mature than previous characterizations have found.\n\n--\nSujet : Zoom meeting invitation - Internet Measurement Reading Group\nHeure : 31 mars 2021 10:45 AM Paris\n\nParticiper à la réunion Zoom\nhttps://us02web.zoom.us/j/87021371877?pwd=bEpuRDNFZHZkL3dIeUhuU01zbjZ ZUT09\n\nID de réunion : 870 2137 1877\nCode secret : fC2xPW\n\n\n CATEGORIES:Internet Measurement,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:609@lincs.fr DTSTART;TZID=Europe/Paris:20210324T140000 DTEND;TZID=Europe/Paris:20210324T150000 DTSTAMP:20210330T093644Z URL:https://www.lincs.fr/events/dnn-based-beam-selection-in-mmw-heterogene ous-networks/ SUMMARY:DNN Based Beam Selection in mmW Heterogeneous Networks DESCRIPTION:In this work\, we consider a heterogeneous cellular network wherein multiple small cell millimeter wave (mmW) base stations (BSs) coexist with legacy sub-6GHz macro BSs. In the mmW band\, small cells use multiple narrow beams to ensure sufficient coverage and User Equipments (UEs) have to select the best small cell and the best beam in order to access the network. This process usually based on exhaustive search may introduce unacceptable latency. In order to address this issue\, we rely on the sub-6GHz macro BS support and propose a deep neural network (DNN) architecture that utilizes basic components from the Channel State Information (CSI) of sub-6GHz network as input features. The output of the DNN is the mmW BS and beam selection that can provide the best communication performance. In the set of features\, we avoid using the UE location\, which may not be readily available for every device. We formulate a mmW BS selection and beam selection problem as a classification and regression problem respectively and propose a joint solution using a branched neural network. The numerical comparison with the conventional exhaustive search results shows that the proposed design demonstrate better performance than exhaustive search in terms of latency with at least 85% accuracy. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:618@lincs.fr DTSTART;TZID=Europe/Paris:20210324T110000 DTEND;TZID=Europe/Paris:20210324T120000 DTSTAMP:20210326T140728Z URL:https://www.lincs.fr/events/python-threads-101-python-sockets-102/ SUMMARY:Python Threads 101 + Python Sockets 102 DESCRIPTION:The threading library permits programs to execute several things at the same time on the same machine. This talk will review the basics of the Python threading library to write concurrent applications\, and how it can be used to build responsive network applications.\n\nThe notebooks use for the presentation are available at https://github.com/tixeuil/lincs-python-workshop CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:607@lincs.fr DTSTART;TZID=Europe/Paris:20210317T140000 DTEND;TZID=Europe/Paris:20210317T150000 DTSTAMP:20210209T082613Z URL:https://www.lincs.fr/events/collective-brainstorming-for-the-organizat ion-of-the-june-ws-with-the-lincs-co-sci/ SUMMARY:Collective brainstorming for the organization of the June WS with the LINCS Co.Sci. DESCRIPTION:This time\, during our usual seminar time-slot\, the whole LINCS community is encouraged to participate in a remote collective brainstorming to elaborate on the organizational structure of the workshop that will take place in June (21st\, 22nd) with the LINCS \;Scientific Committee. 7 out of 9 members already confirmed their participation. \;\n \;\nThe session will be coordinated by Sébastin Tixeuil who's the member of the LINCS \;Executif Committee \;in charge for the scientific organization of the 2021 June workshop. \;\n \;\nYou'll find here embedded a scheme of previous workshops organized with the LINCS Co.Sci. As you'll see\, variations have been limited\, but this year we'll have to take into account that 1) Compared to the past\, more Co.Sci. members will present their works. 2) It will probably take place remotely via Zoom\, thus its format should adapt to this new situation (which sets limits\, but also open up new possibilities!). CATEGORIES:Seminars LOCATION:LINCS + Zoom\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS + Zoom:geo:0,0 END:VEVENT BEGIN:VEVENT UID:617@lincs.fr DTSTART;TZID=Europe/Paris:20210317T110000 DTEND;TZID=Europe/Paris:20210317T120000 DTSTAMP:20210317T145136Z URL:https://www.lincs.fr/events/ensemble-methods/ SUMMARY:Ensemble methods DESCRIPTION:Ensemble methods are popular machine learning techniques that combine the predictions of multiple agents to improve their accuracy and robustness. We will introduce these methods\, with a focus on two algorithms\, random forest and XGBoost.\n\nSlides\n\n\n\n CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:612@lincs.fr DTSTART;TZID=Europe/Paris:20210310T140000 DTEND;TZID=Europe/Paris:20210310T150000 DTSTAMP:20210311T113801Z URL:https://www.lincs.fr/events/talk-by-paolo-zappala/ SUMMARY:Formalizing the analysis of blockchains robustness through game theory DESCRIPTION:Blockchains systems evolve in complex environments that mix classical patterns of faults with selfish\, rational or irrational behaviours typical of economic systems. During the presentation we discuss a new game theoretical framework that formally characterizes the robustness of blockchains systems in terms of resilience to rational deviations and immunity to Byzantine behaviors. We apply the model to known blockchain protocols\, including Bitcoin\, and we identify the upper and lower bounds of their robustness indices. CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:601@lincs.fr DTSTART;TZID=Europe/Paris:20210303T140000 DTEND;TZID=Europe/Paris:20210303T150000 DTSTAMP:20210316T090242Z URL:https://www.lincs.fr/events/2nd-seminar-talk-by-professor-ravi-mazumda r-university-of-waterloo-2/ SUMMARY:FCLTs for Determining the Performance in Finite Systems of Servers with Randomized Load Balancing DESCRIPTION:Here the abstract and bibliography provided by Professor Mazumdar for his talk: \;http://www.lincs.fr/wp-content/uploads/2021/01/FCLT_MFE.pdf&nbs p\; CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:613@lincs.fr DTSTART;TZID=Europe/Paris:20210303T110000 DTEND;TZID=Europe/Paris:20210303T120000 DTSTAMP:20210406T075907Z URL:https://www.lincs.fr/events/container-overview/ SUMMARY:Container Overview DESCRIPTION:Containers are one of the fundamentals of cloud native application development. Popularized by Docker and now widely adopted by the cloud computing industry\, containers paved the way for a immutable style of application deployment. In this presentation\, we will go over some of the fundamentals about containers: What are they? What problems do they solve? How can I get started with them today? What benefits do containers bring in the long run? What is container orchestration?\n\nIf you have questions about containers that you always had in the back of your mind\, be sure to bring them over! \n\nRémy Léone (LINCS alumni) is a Cloud Developer Advocate at Scaleway and contributor to Kubernetes documentation French localization.\n\nSlides CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:599@lincs.fr DTSTART;TZID=Europe/Paris:20210224T140000 DTEND;TZID=Europe/Paris:20210224T150000 DTSTAMP:20210225T071528Z URL:https://www.lincs.fr/events/seminar-by-professor-jukka-suomela-aalto-u niversity/ SUMMARY:Can we automate our own work — or show that it is hard? DESCRIPTION:Computer scientists seek to understand what can be automated\, but what do we know about automating our own work? Can we outsource our own research questions to computers? In this talk I will discuss this question from the perspective of the theory of distributed computing. I will present not only recent examples of human-computer-collaborations that have resulted in major breakthroughs in our understanding of distributed computing\, but I will also explore the fundamental limits of such approaches.\nBio\nJukka Suomela (https://jukkasuomela.fi/) is Associate Professor in the Department of Computer Science at Aalto University\, Finland. His work focuses on the theoretical foundations of distributed and parallel computing\, with particular emphasis on the concept of locality. He was the PC chair of DISC 2019 and SIROCCO 2016 and one of the local chairs of ALGO 2018\, he has served in the EATCS council\, and he is currently the vice chair of the DISC steering committee. He has received the FOCS 2019 best paper award and DISC 2012 and 2017 best paper awards\, as well as a number of teaching awards.\n\n \;\n\nHere's the Zoom link to attend the seminar talk: https://telecom-paris.zoom.us/j/94270583366?pwd=cGVqdGg4WEZZSldscGpvTTMvbEJ Odz09\n\n ID de réunion : 942 7058 3366\n Code secret : 821734\n CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:611@lincs.fr DTSTART;TZID=Europe/Paris:20210224T110000 DTEND;TZID=Europe/Paris:20210224T120000 DTSTAMP:20210302T153359Z URL:https://www.lincs.fr/events/a-mathematical-theory-of-communication-dis crete-noisy-systems-2/ SUMMARY:A Mathematical Theory of Communication: Discrete Noisy Systems (2) DESCRIPTION:In 1948 Shannon published the article that defines modern information theory. For this reading group\, we will briefly remind the first part of the article about noiseless system\, then we will present the second part of the article\, which is concerned with transmission errors. We will in particular see how the trade-off between compression and robustness can be explained very simply with the notion of entropy introduced by Shannon.\n\nThe video of the first part is available here: https://www.lincs.fr/events/a-mathematical-theory-of-communication-discrete -noisy-systems/.\n\n\n CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:602@lincs.fr DTSTART;TZID=Europe/Paris:20210217T140000 DTEND;TZID=Europe/Paris:20210217T150000 DTSTAMP:20210222T070535Z URL:https://www.lincs.fr/events/seminar-talk-by-professor-catherine-rosenb erg-waterloo-university/ SUMMARY:The impact of multi-user massive MIMO on resource allocation in 5G cellular networks DESCRIPTION:One of the very important technologies for 5G is multi-user massive MIMO. It has the potential to deliver excellent performance if used well. However\, it is a very complex technology that changes the way we operate networks.\n \;\nOur presentation contains three parts. In the first part\, we explain how resource allocation (RA) is performed in a multi-user massive MIMO system and present our latest results on the relative importance of different RA processes and assumptions. In the second part\, we discuss preliminary results on how sharing between operators can be managed in a Neutral Host setting when multi-user massive MIMO is used. Finally\, in the third part\, we briefly discuss how multi-user massive MIMO enables 5G Fixed Wireless Access that can be used to bridge the digital divide in rural areas.\n \;\nThe work was done in collaboration with Prof. P. Mitran\, Y. Zhang\, A. Hussein\, and A. Lappalainen. It was sponsored by NSERC\, Cisco and Rogers.\n \;\nBIO\n \;\nCatherine Rosenberg is a Professor in Electrical and Computer Engineering at the University of Waterloo since 2004. Since June 2010\, she holds the Canada Research Chair in the Future Internet. She was elected an IEEE Fellow for contributions to resource management in wireless and satellite networks on 2011 and was elected a Fellow of the Canadian Academy of Engineering in 2013. In April 2018\, she became the Cisco Research Chair in 5G Systems.\n\nHere\, Prof. Rosenberg webpage for further infos about her academic and research path: https://uwaterloo.ca/scholar/cath\n\nZoom link to attend the seminar talk: https://telecom-paris.zoom.us/j/94270583366?pwd=cGVqdGg4WEZZSldscGpvTTMvbEJ Odz09\n\nID de réunion : 942 7058 3366\nCode secret : 821734 CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:610@lincs.fr DTSTART;TZID=Europe/Paris:20210217T110000 DTEND;TZID=Europe/Paris:20210217T120000 DTSTAMP:20210302T072739Z URL:https://www.lincs.fr/events/a-mathematical-theory-of-communication-dis crete-noisy-systems/ SUMMARY:A Mathematical Theory of Communication: Discrete Noisy Systems (1) DESCRIPTION:In 1948 Shannon published the article that defines modern information theory. For this reading group\, we will briefly remind the first part of the article about noiseless system\, then we will present the second part of the article\, which is concerned with transmission errors. We will in particular see how the trade-off between compression and robustness can be explained very simply with the notion of entropy introduced by Shannon.\n\n CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:597@lincs.fr DTSTART;TZID=Europe/Paris:20210210T140000 DTEND;TZID=Europe/Paris:20210210T150000 DTSTAMP:20210211T083844Z URL:https://www.lincs.fr/events/seminar-professor-mazumdar/ SUMMARY:Real-time Bidding in First and Second Price Auctions with Temporal and Targeting Constraints DESCRIPTION:Please\, find here the abstract and bibliography provided by Professor Mazumdar for his talk: http://www.lincs.fr/wp-content/uploads/2021/01/Bidding_LINCS_Jan2021.pdf\n\ nHere\, Professor Mazumdar's webpage with info on his academic path: https://ece.uwaterloo.ca/~mazum/\n\n* * * * * * *\n\nThe Zoom link to attend the event is: \;https://telecom-paris.zoom.us/j/94270583366?pwd=cGVqdGg4WEZZSldsc GpvTTMvbEJOdz09 \;\n\n ID de réunion : 942 7058 3366 \;\n Code secret : 821734\n CATEGORIES:Seminars,Youtube LOCATION:Zoom + LINCS\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Zoom + LINCS:geo:0,0 END:VEVENT BEGIN:VEVENT UID:608@lincs.fr DTSTART;TZID=Europe/Paris:20210210T110000 DTEND;TZID=Europe/Paris:20210210T120000 DTSTAMP:20210216T132747Z URL:https://www.lincs.fr/events/fastcore/ SUMMARY:Fastcore DESCRIPTION:According to its website\, fastcore is a set of "Python goodies to make your coding faster\, easier\, and more maintainable".\n\n"Fastcore [adds] to Python features inspired by other languages we've loved\, like multiple dispatch from Julia\, mixins from Ruby\, and currying\, binding\, and more from Haskell. It also adds some "missing features" and clean up some rough edges in the Python standard library\, such as simplifying parallel processing\, and bringing ideas from NumPy over to Python's list type."\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:604@lincs.fr DTSTART;TZID=Europe/Paris:20210203T110000 DTEND;TZID=Europe/Paris:20210203T120000 DTSTAMP:20210216T132945Z URL:https://www.lincs.fr/events/edit-distances-string-alignments-and-dynam ic-programming/ SUMMARY:Edit distances\, string alignments and dynamic programming DESCRIPTION:Edit distances quantify how dissimilar two strings are by counting the minimum number of edit operation (insertion\, deletion\, etc) to transform one string into the other. They are used in computer science (approximate string matching\, file comparison\, ...)\, in bioinformatic (nucleic acid sequence alignment...)\, etc. This presentation presents the main edit distances (Longest Common Subsequence\, Levenshtein\, Hamming\, ...)\, and shows how to compute them using dynamic programming.\n\nThis presentation was prepared in collaboration with Maxime Raynal (Nokia Bell Labs France).\n\nSlides. CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:605@lincs.fr DTSTART;TZID=Europe/Paris:20210127T110000 DTEND;TZID=Europe/Paris:20210127T120000 DTSTAMP:20210216T133017Z URL:https://www.lincs.fr/events/presentation-of-huggingface-transformers-l ibrary-for-natural-language-processing/ SUMMARY:Presentation of Huggingface Transformers library for Natural Language Processing DESCRIPTION:Transformers architectures have been dominating the benchmarks of most Natural Language Processing tasks for the past 3 years with new models popping up every week\, making it difficult to keep up with the state-of-the-art when trying to decide which model to use for a real world scenario. The French/American startup Huggingface is helping a lot to unify the efforts to make these new models available and I will present a part of these efforts and an example demonstrating how easy it now is to use and test various models of their transformers library.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:594@lincs.fr DTSTART;TZID=Europe/Paris:20210120T140000 DTEND;TZID=Europe/Paris:20210120T150000 DTSTAMP:20210120T151135Z URL:https://www.lincs.fr/events/secure-and-robust-mimo-transceiver-for-mul ticast-mission-critical-communications/ SUMMARY:"Secure and Robust MIMO Transceiver for Multicast Mission Critical Communications" DESCRIPTION:Mission-critical communications (MCC) involve all communications between people in charge of the safety of the civil society. MCC have unique requirements that include improved reliability\, security and group communication support. In this paper\, we propose a secure and robust Multiple-Input-Multiple-Output (MIMO) transceiver\, designed for multiple Base Stations supporting multicast MCC in presence of multiple eavesdroppers. We formulate minimization problems with the Sum-Mean-Square-Error (SMSE) at legitimate users as an objective function\, and a lower bound for the MSE at eavesdroppers as a constraint. Security is achieved thanks to physical layer security mechanisms\, namely MIMO beamforming and Artificial Noise (AN). Reliability is achieved by designing a system which is robust to Channel State Information errors. They can be of known distribution or norm-bounded. In the former case\, a coordinate descent algorithm is proposed to solve the problem. In the latter case\, we propose a worst-case based iterative algorithm. Numerical results at physical layer and system level reveal the crucial role of robust designs for reliable MCC. We show the interest of both robust design and AN to improve the security gap. We show that full BS cooperation is preferred for highly secured and reliable MCC but dynamic clustering allows to trade-off security and reliability against capacity.\n\nHere's the streaming link: https://telecom-paris.zoom.us/j/94054078947?pwd=VFhyTjIyRWZVYkNzVXp4OXV4c2t TUT09\n\n ID de réunion : 940 5407 8947\n Code secret : 363501\n CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:603@lincs.fr DTSTART;TZID=Europe/Paris:20210120T110000 DTEND;TZID=Europe/Paris:20210120T120000 DTSTAMP:20210120T124025Z URL:https://www.lincs.fr/events/a-tutorial-on-bayesian-optimization-with-g aussian-processes/ SUMMARY:A tutorial on Bayesian optimization with Gaussian processes DESCRIPTION:Bayesian optimization proves to be useful when our goal is to i) optimize an unknown function\, that we can learn by sampling ii) our sample budget is (very) limited iii) we can afford (potentially) heavy computations in between two consecutive samples.\n\nSlides will be largely inspired by https://arxiv.org/abs/2012.08469. CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:578@lincs.fr DTSTART;TZID=Europe/Paris:20210113T140000 DTEND;TZID=Europe/Paris:20210113T150000 DTSTAMP:20210113T144647Z URL:https://www.lincs.fr/events/seminar-talk-by-stefan-schmid/ SUMMARY:"Self-Adjusting Networks: From Metrics to Algorithms" DESCRIPTION:In this talk I will present the vision of self-adjusting networks: communication networks whose physical topology adapts to the traffic pattern it serves\, in a demand-aware manner. This vision is reminiscent of biased and self-adjusting datastructures\, such as Mehlhorn trees and splay trees. Self-adjusting networks are enabled by emerging reconfigurable optical technologies. I will show that the benefit of self-adjusting networks depends on the amount of "structure" there is in the demand\, and present an information-theoretical approach to measure the complexity of traffic traces and derive entropy-based metrics accordingly. I will also present optimal offline and online algorithms to design self-adjusting networks whose performance matches the derived metrics asymptotically.\n\nThe talk is primarily based on the following papers:\n\nReNets: Statically-Optimal Demand-Aware Networks\nChen Avin and \;Stefan \;Schmid.\nSIAM Symposium on Algorithmic Principles of Computer Systems (APOCS)\, Alexandria\, Virgina\, USA\, January 2021.\nhttps://www.univie.ac.at/ct/stefan/apocs21renets.pdf\n\nOn the Complexity of Traffic Traces and Implications\nChen Avin\, Manya Ghobadi\, Chen Griner\, and \;Stefan \;Schmid.\nACM SIGMETRICS\, Boston\, Massachusetts\, USA\, June 2020.\nhttps://www.univie.ac.at/ct/stefan/sigmetrics20complexity.pdf\n\nDem and-Aware Network Designs of Bounded Degree\nChen Avin\, Kaushik Mondal\, and \;Stefan \;Schmid.\nDistributed Computing (DIST)\, Springer\, 2020.\nhttps://www.univie.ac.at/ct/stefan/dist20journal.pdf\n\nSplayNet: Towards Locally Self-Adjusting Networks\nStefan \;Schmid\, Chen Avin\, Christian Scheideler\, Michael Borokhovich\, Bernhard Haeupler\, and Zvi Lotker.\nIEEE/ACM Transactions on Networking (TON)\, Volume 24\, Issue 3\, 2016.\nhttps://www.univie.ac.at/ct/stefan/ton15splay.pdf\n\nFor more details\, see the project website:\nhttps://self-adjusting.net/\n\n* * * * * * * * * * * * * * * * * * * * *\n\nHere’s the streaming link: https://telecom-paris.zoom.us/j/94054078947?pwd=VFhyTjIyRWZVYkNzVXp4OXV4c2t TUT09\n\n ID de réunion : 940 5407 8947\n Code secret : 363501\n CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:598@lincs.fr DTSTART;TZID=Europe/Paris:20210113T110000 DTEND;TZID=Europe/Paris:20210113T120000 DTSTAMP:20210118T152849Z URL:https://www.lincs.fr/events/takeaways-of-building-a-research-oriented- system/ SUMMARY:Takeaways of building a research-oriented system DESCRIPTION:Building a modern\, scalable and fault-tolerant system in Python has never been so easy and enjoyable. Here is some takeaways of building such system in for research operations.\n\nSlides CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:596@lincs.fr DTSTART;TZID=Europe/Paris:20210106T110000 DTEND;TZID=Europe/Paris:20210106T120000 DTSTAMP:20210113T145957Z URL:https://www.lincs.fr/events/multi-winner-voting-rules/ SUMMARY:Multi-winner voting rules DESCRIPTION:Multi-winner voting rules aggregate the opinions of several agents and yield a set of several options. We will give an overview of the classic rules of the literature\, and show that different rules pursue different objectives: excellence\, proportionality or diversity.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:595@lincs.fr DTSTART;TZID=Europe/Paris:20201221T140000 DTEND;TZID=Europe/Paris:20201221T170000 DTSTAMP:20201214T122320Z URL:https://www.lincs.fr/events/thesis-defense-tractable-reliable-communic ation-in-compromised-networks/ SUMMARY:Thesis defense "Tractable Reliable Communication in Compromised Networks" DESCRIPTION:Reliable communication is a fundamental primitive in distributed systems prone to Byzantine (i.e. arbitrary\, and possibly malicious) failures to guarantee integrity\, delivery\, and authorship of messages exchanged between processes. Its practical adoption strongly depends on the system assumptions. Several solutions have been proposed so far in the literature implementing such a primitive\, but some lack in scalability and/or demands topological network conditions computationally hard to be verified.\nThis thesis aims to investigate and address some of the open problems and challenges implementing such a communication primitive. Specifically\, we analyze how a reliable communication primitive can be implemented in 1) a static distributed system where a subset of processes is compromised\, 2) a dynamic distributed system where part of the processes is Byzantine faulty\, and 3) a static distributed system where every process can be compromised and recover.\nWe define several more efficient protocols and we characterize alternative network conditions guaranteeing their correctness.\n\nThis is a joint thesis with Sapienza Università di Roma\, Rome.\n\nYou can access the videoconference through the following link\nhttps://uniroma1.zoom.us/j/82300863370?pwd=REZuRWZGNU5MbnN2b0E4anVrcH RyUT09\n\nID Zoom conference: 823 0086 3370\nPasscode: 658626\n\nThe member of the jury are:\n\n M. Pierre Sens (LIP6\, Sorbonne Université) - President\n M. Luca Becchetti (DIAG\, Sapienza Università di Roma) - Examiner\n Mme. Maria Potop-Butucaru (LIP6\, Sorbonne Université) - Examiner\n M. Andrea Vitaletti (DIAG\, Sapienza Università di Roma) - Examiner\n M. Xavier Défago (Tokyo Institute of Technology\, Tokyo) - Reviewer\n M. Roy Friedman (Technion - Israel Institute of Technology\, Isreael) - Reviewer\n Mme. Silvia Bonomi (DIAG\, Sapienza Università di Roma) – Thesis co-director\n M. Sébastien Tixeuil (LIP6\, Sorbonne Université) – Thesis co-director\n\nThe presentation will be in English. CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:593@lincs.fr DTSTART;TZID=Europe/Paris:20201217T140000 DTEND;TZID=Europe/Paris:20201217T170000 DTSTAMP:20201214T073511Z URL:https://www.lincs.fr/events/thesis-defense-deep-learning-techniques-fo r-graph-embedding-at-different-scales/ SUMMARY:Thesis defense "Deep learning techniques for graph embedding at different scales" DESCRIPTION:In many scientific fields\, studied data have an underlying graph or manifold structure such as communication networks (whether social or technical)\, knowledge graphs or molecules. A graph is composed of nodes\, also called vertices\, con- nected together by edges. Recently\, deep learning algorithms have become state-of-the-art models in many fields and in particular in natural language processing and image analysis. It led the way to a great line of studies to generalize deep learning models to graphs. In particular\, several formulations of convolutional neural networks were proposed and research is carried to develop new layers and network architectures to graphs. Those models aim at solving different tasks such as node classification\, link prediction or graph classification. In this work\, we study node\, subgraph or graph embeddings produced by graph neural networks. These embeddings at different scales encode hierarchical represen- tations of graphs. Based on these embedding techniques\, we propose new deep learning architectures to tackle node classification or graph classification tasks. We study several applications of these new techniques. For example\, we study the problem of having a graph embedding invariant by node permutation and the interpretability of graph neural networks.\n\nHere's the details to follow it on GoToMeeting:\n\nParticipez à ma réunion depuis votre ordinateur\, tablette ou smartphone. \;https://global.gotomeeting.com/join/962144589 \;Vous pouvez aussi appeler à l'aide de votre téléphone. \;États-Unis: \;+1 (872) 240-3311 \;Code d'accès: \;962-144-589 \;Rejoignez la réunion depuis une salle ou un système de vidéoconférence. \;Composez ou tapez : 67.217.95.2 ou \;inroomlink.goto.com \;ID réunion: 962 144 589 \;Ou appelez directement: \;962144589@67.217.95.2 \;ou 67.217.95.2##962144589 \;Vous n'utilisez pas encore GoToMeeting \;? Téléchargez l’application dès maintenant et soyez prêt pour votre première réunion \;: \;https://global.gotomeeting.com/install/962144589\n&n bsp\;\n \; CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:587@lincs.fr DTSTART;TZID=Europe/Paris:20201216T140000 DTEND;TZID=Europe/Paris:20201216T150000 DTSTAMP:20201126T130123Z URL:https://www.lincs.fr/events/special-meeting-for-a-new-tool-for-lincs-r esearchprojects/ SUMMARY:Special meeting: new tool for LINCS research&projects DESCRIPTION:The LINCS community is encouraged to participate in an exceptional Wednesday \;meeting with Fabien Mathieu to check\, discuss and exchange about a new tool to share infos about our lab research topics and ongoing projects.\n \;\nThis operational meeting is important and we wish it will be widely attended! CATEGORIES:Seminars,Workshop END:VEVENT BEGIN:VEVENT UID:592@lincs.fr DTSTART;TZID=Europe/Paris:20201216T110000 DTEND;TZID=Europe/Paris:20201216T120000 DTSTAMP:20210113T144343Z URL:https://www.lincs.fr/events/python-sockets-101/ SUMMARY:Python Sockets 101 DESCRIPTION:The socket library permits programs that execute on various machines over a network to communicate. This talk will review the basics of the Python socket library to write distributed applications. CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:591@lincs.fr DTSTART;TZID=Europe/Paris:20201214T150000 DTEND;TZID=Europe/Paris:20201214T180000 DTSTAMP:20201209T074913Z URL:https://www.lincs.fr/events/thesis-defense-mechanisms-and-architecture s-to-encourage-the-massive-and-efficient-use-of-local-renewable-energy/ SUMMARY:Thesis defense "Mechanisms and architectures to encourage the massive and efficient use of local renewable energy" DESCRIPTION:To meet carbon reduction goals in Europe but worldwide too\, a large number of renewable distributed energy resources (DER) still need to be deployed.\nAiming at mobilizing private capital\, several plans have been developed to put end-customers at the heart of the energy transition\, hoping to accelerate the adoption of green energy by increasing its attractiveness and profitability.\nSome of the proposed models include the creation of local energy markets where households can sell their energy to their neighbors at a higher price than what the government would be willing to pay (but lower than what other customers normally pay)\, shared investment models in which consumers own a carbon-free power plant such as a wind turbine or a solar farm and they obtain dividends from its production to collective auto-consumption models in which several families are ‘hidden’ behind the same smart meter\, allowing them to optimize their aggregated consumption profile and therefore maximizing the value of their DER.\n\nOne of the main objectives of the thesis is to understand these different incentives as they will play a crucial role in tackling climate change if correctly implemented. To do so\, we design a framework for ‘local energy trading’ that encompasses a large number of incentives.\nIn the context of local energy trading\, we study the interactions of prosumers (consumers with generation capabilities) located in the same Low Voltage network\, possibly behind the same feeder. These prosumers will still be connected to the main power grid and they will have the option\, as they do today\, to buy and sell to/from their utility company at a fixed price (a flat rate or a Time-of-Use\, for example). For these agents to fully benefit from the advantages of local energy trading\, we shall assume that they own appliances (such as batteries) that\, without changing their perceived energy demand\, can enable them to change their net energy demand as seen from outside their homes. Modeling prosumers as rational utility maximizers\, they will schedule their battery to decrease the cost associated with their net energy demand (as their perceived demand remains unchanged).\n\nIn the first part of the thesis\, we investigate competitive models in which prosumers sell their surplus to their neighbors via a local energy market. We analyze different strategies that players could use to participate in these markets and their impact on the normal operation of the power grid and the Distribution System Operator. In this regard\, it is shown that sequential markets can pose a problem to the system and a new market mechanism that exploits domain knowledge is proposed to increase the efficiency of the local trades.\n\nIn the second part of the thesis\, we delve into incentives that can be implemented through cooperation. In this regard\, we use cooperative game theory to model the shared investment into energy storage and photovoltaic panels (PV) by a group of prosumers. For the studied model we show that a stable solution (in the core of the game) exists in which all participants cooperate and we provide an efficient algorithm to find it. Furthermore\, we also show that cooperation is stable for participants that already own batteries and PVs but prefer to operate them in coordination to increase their value\, effectively implementing collective auto-consumption.\nFinally\, we demonstrate how to integrate both models: the shared investment and the cooperative control of existing resources into a single cooperative framework which also enjoys the existence of stable outcomes. For this later model\, we propose to decouple the return over investments (ROI) obtained between the ROI produced by the investment in hardware and the ROI obtained by cooperation itself. By doing so\, we can offer the former profit to external investors to raise the required capital (although nothing forbids the member of the coalition to contribute) and the latter to the actual consumers.\n\nHere's the streaming link to follow: https://telecom-paris.zoom.us/j/99499019699?pwd=anB2STVlWWZ2YnUzZ015bEh1dU5 CUT09\n\n- ID de réunion : 994 9901 9699\n- Code secret : 371226 CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:579@lincs.fr DTSTART;TZID=Europe/Paris:20201210T140000 DTEND;TZID=Europe/Paris:20201210T170000 DTSTAMP:20201208T082447Z URL:https://www.lincs.fr/events/thesis-defense-random-walk-on-simplicial-c omplexes/ SUMMARY:Thesis defense "Random walk on simplicial complexes" DESCRIPTION:The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs. This notion contains information on the topology of these structures. Even for a graph\, the consideration of associated simplicial complexes can provide information on its shape. Whereas the Laplacian of a graph has a simple probabilistic interpretation as the generator of a continuous time Markov chain on the graph\, things are not so direct when considering simplicial complexes. In the first part of this thesis\, we define a new Markov chain on simplicial complexes. For a given degree k of simplices\, the state space is not the k-simplices as in previous papers about this subject but rather the set of k-chains or k-cochains. This new framework is the natural generalization on the canonical Markov chains on graphs. We show that the generator of our Markov chain is related to the upper Laplacian defined in the context of algebraic topology for discrete structure. We establish several key properties of this new process. We show that when the simplicial complexes under scrutiny are a sequence of ever refining triangulation of the flat torus\, the Markov chains tend to a differential form valued continuous process.\n \;\nIn the second part of this thesis\, we explore some applications of the random walk\, i.e.\, random walk based hole detection and simplicial complexes kernels. For the random walk based hole detection\, we introduce an algorithm to make simulations carried for the cycle-valued random walk (k = 1) on a simplicial complex with holes. Since the state space of the cycle-valued random walk consists of all the states in the same homology group\, the paths with minimal lengths are supposed to be the holes of the simplicial complex\, which is the idea of the algorithm. In the case where we do not know the boundary of the simplicial complex\, we need to find the initial state which is in the same homology group as the holes and has an integer value. Thus we calculate the initial states and propose another algorithm to make simulations of integer weighted random walk. Simulation results show that we can always detect the holes of simplicial complexes with boundary (initial state) known\, and approximately with initial state unknown. \;For the simplicial complexes kernels\, we extend the definition of random walk based graph kernels in order to measure the similarity between two simplicial complexes. The definition is based on this idea: given a pair of simplicial complexes\, we perform our random walks on both\, and count the number of matching walks. The more matching walks\, the more similar these two simplicial complexes are. In order to count the number of matching walks\, we perform a random walk on the direct product simplicial complex of these two simplicial complexes. We compute the probability of the random walk whose length is k\, and sum them for all k. The result is the kernel of these two simplicial complexes. In order to reduce computational complexity\, we rewrite the sum formula to the inverse of a matrix\, and use conjugate gradient methods instead of direct computation. Simulation results show that graph kernels are related to the number of vertices and their connectivity\, while simplicial complexes kernels put emphasis on homology properties.\n \;\nHere's the streaming link:\n\nhttps://telecom-paris.zoom.us/j/99001968945pwd=MjFiakw4Q3hQaU5hbGZ 2U2ZsSWxEUT09\nID de réunion : 990 0196 8945\nCode secret : 766753\n\n CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:576@lincs.fr DTSTART;TZID=Europe/Paris:20201209T140000 DTEND;TZID=Europe/Paris:20201209T150000 DTSTAMP:20201210T100227Z URL:https://www.lincs.fr/events/on-the-deployability-of-augmented-reality- using-embedded-edge-devices/ SUMMARY:"On the deployability of Augmented Reality Using Embedded Edge Devices" DESCRIPTION:\nEdge Computing exploits computational capabilities deployed at the very edge of the network to support applications with low latency requirements. Such capabilities can reside in small embedded devices that integrate dedicated hardware -- e.g.\, a GPU -- in a low cost package. But these devices have limited computing capabilities compared to standard server grade equipment.\nWhen deploying an Edge Computing based application\, understanding whether the available hardware can meet target requirements is key in meeting the expected performance.\n \;\nIn this paper\, we study the feasibility of deploying Augmented Reality applications using Embedded Edge Devices (EEDs). We compare such deployment approach to one exploiting a standard dedicated server grade machine. Starting from an empirical evaluation of the capabilities of these devices\, we propose a simple theoretical model to compare the performance of the two approaches. We\nthen validate such model with NS-3 simulations and study their feasibility. Our results show that there is no one-fits-all solution. If we need to deploy high responsiveness applications\, we need a centralized server grade architecture and we can in any case only support very few users. The centralized architecture fails to serve a larger number of users\, even when low to mid responsiveness is required. In this case\, we need to resort instead to a distributed deployment based on EEDs.\n \;\n\nAuthors: Ayoub BEN AMEUR\, Andrea ARALDO\, Francesco BRONZINO CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:590@lincs.fr DTSTART;TZID=Europe/Paris:20201209T110000 DTEND;TZID=Europe/Paris:20201209T120000 DTSTAMP:20210118T153019Z URL:https://www.lincs.fr/events/voting-in-networks/ SUMMARY:Voting in Networks DESCRIPTION:In this talk\, we are investigating a selection of problems related to the process of voting on a (social) network. Among other problems\, I am going to present the notion of liquid democracy and how it can be used on a network to elect a representative and approve/disapprove propositions.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:572@lincs.fr DTSTART;TZID=Europe/Paris:20201208T140000 DTEND;TZID=Europe/Paris:20201208T170000 DTSTAMP:20201208T071905Z URL:https://www.lincs.fr/events/thesis-defense-speed-of-convergence-of-dif fusion-approximations/ SUMMARY:Thesis defense "Speed of convergence of diffusion approximations" DESCRIPTION:In many fields of interest\, Markov processes are a primary modelisation tool for random processes. Unfortunately it is often necessary to use very large or even infinite dimension state spaces\, making the exact analysis of the various characteristics of interest (stability\, stationary law\, hitting times of certain domains\, etc.) of the process difficult or even impossible . For quite a time\, thanks in particular to martingale theory\, it has been possible to make use of approximations by brownian diffusions. This enables an approximate analysis of the initial problem.\nThe main drawback of this approach is that it does not measure the error made in this approximation. The purpose is to dévelop a theory of error calculation for diffusion approximations .\nFor some time\, the developement of the Stein-Malliavin method has enabled to get some precision over speed of convergence in classical theorems such as the Donsker theorem (functionnal convergence \; of a random walk towards the Brownian motion) \; or in the generalisation of the Binomial Poisson approximation path by path.\nIn this work we intend to extend the development of this theory for Markovian processes such as those than can be found in queueing theory\, in epidemiology or in other fields of application.\nStarting from the representation of Markov processes as Poisson measures\, we extend the method developped by Laurent Decreusefond and Laure Coutin to assess the speed of convergence in diffusion approximations . To do so\, we extend the Stein-Malliavin method to vectors of \; processes rather than a single process. The limit is a gaussian process changed in time. The Stein Malliavin method being mainly developped to calculate \; convergence towards the standard Brownian motion\, it is adapted to the problem of convergence towards a time changend process using linear approximation methods. We therefore make use of Gaussian analysis to assess the dependency between the various time periods and to functionnal analysis to elect the right probabilistic spaces.\nHere's the streaming link:\nhttps://telecom-paris.zoom.us/j/93338351493?pwd=YjFRYStvVUR3YlBYWVJ1 anBHYmNiQT09\n \;\nID de réunion \;: 933 3835 1493\nCode secret \;: 226860 CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:586@lincs.fr DTSTART;TZID=Europe/Paris:20201207T140000 DTEND;TZID=Europe/Paris:20201207T170000 DTSTAMP:20201204T092009Z URL:https://www.lincs.fr/events/thesis-defense-contributions-to-the-repres entation-of-multivariate-time-series-and-graphs/ SUMMARY:Thesis defense "Contributions to the representation of multivariate time series and graphs" DESCRIPTION:Machine learning (ML) algorithms are designed to learn models that have the ability to take decisions or make predictions from data\, in a large panel of tasks like classification of images or monitoring of mechanical systems. In general\, the learned models are statistical approximations of the true/optimal unknown decision models. The efficiency of a learning algorithm depends on an equilibrium between model richness\, complexity of the data distribution and complexity of the task to solve from data. Nevertheless\, for computational convenience\, the statistical decision models often adopt simplifying assumptions about the data (e.g. linear separability\, independence of the observed variables\, etc.). However\, when data distribution is complex (e.g. high-dimensional with nonlinear interactions between observed variables)\, the simplifying assumptions can be counterproductive. In this situation\, a solution is to feed the model with an alternative representation of the data. The objective of data representation is to separate the relevant information with respect to the task to solve from the noise\, in particular if the relevant information is hidden (latent)\, in order to help the statistical model. Until recently and the rise of modern ML\, many standard representations consisted in an expert-based handcrafted preprocessing of data. Recently\, a branch of ML called deep learning (DL) completely shifted the paradigm. DL uses neural networks (NNs)\, a family of powerful parametric functions\, as learning data representation pipelines. These recent advances outperformed most of the handcrafted data in many domains.\n\nIn this thesis\, we are interested in learning representations of multivariate time series (MTS) and graphs. MTS and graphs are particular objects that do not directly match standard requirements of ML algorithms. They can have variable size and non-trivial alignment\, such that comparing two MTS or two graphs with standard metrics is generally not relevant. Hence\, particular representations are required for their analysis using ML approaches. The contributions of this thesis consist of practical and theoretical results presenting new MTS and graphs representation learning frameworks.\n\nTwo MTS representation learning frameworks are dedicated to the ageing detection of mechanical systems. First\, we propose a model-based MTS representation learning framework called Sequence-to-graph (Seq2Graph). Seq2Graph assumes that the data we observe has been generated by a model whose graphical representation is a causality graph. It then represents\, using an appropriate neural network\, the sample on this graph. From this representation\, when it is appropriate\, we can find interesting information about the state of the studied mechanical system. Second\, we propose a generic trend detection method called Contrastive Trend Estimation (CTE). CTE learns to classify pairs of samples with respect to the monotony of the trend between them. We show that using this method\, under few assumptions\, we identify the true state underlying the studied mechanical system\, up-to monotone scalar transform.\n\nTwo graph representation learning frameworks are dedicated to the classification of graphs. First\, we propose to see graphs as sequences of nodes and create a framework based on recurrent neural networks to represent and classify them. Second\, we analyze a simple baseline feature for graph classification: the Laplacian spectrum. We show that this feature matches minimal requirements to classify graphs when all the meaningful information is contained in the structure of the graphs.\n\nHere's the streaming link: https://safran-group.webex.com/safran-group-fr/j.php?MTID=mfda124766b7a93fc 255f3da5a14ab4ec CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:566@lincs.fr DTSTART;TZID=Europe/Paris:20201202T160000 DTEND;TZID=Europe/Paris:20201202T190000 DTSTAMP:20201130T072857Z URL:https://www.lincs.fr/events/transport-of-critical-services-over-unlice nsed-spectrum-in-5g-networks/ SUMMARY:Thesis defense "Transport of critical services over unlicensed spectrum in 5G networks" DESCRIPTION:Critical services in 5G networks\, denoted by Ultra-Reliable Low-Latency Communication (URLLC)\, allow the existence of many promising applications such as factory automation\, remote surgery and autonomous vehicles. However\, URLLC has unprecedented stringent requirements in terms of reliability and latency\, on the order of 99\,999% and 1ms\, respectively.\nOne of the most important aspects of URLLC transport is the time-frequency trade-off\, where restrictions in the time domain require a large frequency bandwidth to guarantee the target reliability. Using licensed spectrum\, as in previous generations\, entails a huge cost for operators who buy\, at very high price\, the license to use certain channels. The cost and scarcity of licensed spectrum calls then for the usage of unlicensed spectrum that is cheaper and available at higher quantities.\nIn this thesis\, we study the transport of critical services over unlicensed spectrum. We design new medium access schemes for URLLC to meet its requirements\, by using additional licensed resources or by increasing the transmission power of URLLC while competing with other services.\nStreaming link to attend: https://youtu.be/SrLAEyn_R6Y CATEGORIES:PhD Defense,Seminars END:VEVENT BEGIN:VEVENT UID:588@lincs.fr DTSTART;TZID=Europe/Paris:20201202T104500 DTEND;TZID=Europe/Paris:20201202T121500 DTSTAMP:20201209T113815Z URL:https://www.lincs.fr/events/pyinstaller-vis-js-network/ SUMMARY:Pyinstaller / Vis.js Network DESCRIPTION:Two independent tools will be presented for this session.\n\nPyinstaller is a tool that converts Python code in standalone executable. The goal is not to speed up things\, but to have portable code to run on a computer without installing additional software.\n\nVis.js network is the javascript library that was used to display the Lincs graph (https://www.lincs.fr/research/lincs-graph/). It's a relatively simple way to display a json graph.\n\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:574@lincs.fr DTSTART;TZID=Europe/Paris:20201125T140000 DTEND;TZID=Europe/Paris:20201125T150000 DTSTAMP:20201125T154039Z URL:https://www.lincs.fr/events/talk-by-a-member-of-lincs-scientific-commi ttee-on-the-use-of-small-solar-panels/ SUMMARY:Talk by a member of LINCS Scientific Committee "On the Use of Small Solar Panels and Small Batteries to Reduce the RAN Carbon Footprint" DESCRIPTION:The limited power requirements of new generations of base stations make the use of renewable energy sources\, solar in particular\, extremely attractive for mobile network operators. Exploiting solar energy implies a reduction of the network operation cost as well as of the carbon footprint of radio access networks. However\, previous research works indicate that the area of the solar panels that are necessary to power a standard macro base station (BS) is large\, making the solar panel deployment problematic\, especially within urban areas. In this paper we use a modeling approach based on Markov reward processes to investigate the possibility of combining a connection to the power grid with small area solar panels and small batteries to run a macro base station. By so doing\, it is possible to exploit a significant fraction of renewable energy to run a radio access network\, while also reducing the cost incurred by the network operator to power its base stations. We assume that energy is drawn from the power grid only when needed to keep the BS operational\, or during the night\, which corresponds to the period with lowest electricity price. The proposed energy management policies have advantages in terms of both cost and carbon footprint. Our results show that solar panels of the order of 1-2 kW peak\, i.e.\, with a surface of about 5-10 square meters\, combined with limited capacity energy storage (of the order of 1-5 kWh\, corresponding to about 1-2 car batteries) and a smart energy management policy\, can lead to an effective exploitation of renewable energy.\nBio \;  \;\nMarco Ajmone Marsan is full professor at the Electronics and Telecommunications Department of the Politecnico di Torino in Italy\, and part-time research professor at IMDEA Networks Institute in Leganes\, Spain. He obtained degrees in EE from the Politecnico di Torino and the University of California\, Los Angeles (UCLA). He received a honorary doctoral degree from the Budapest University of Technology and Economics. Since 1974 he has been at Politecnico di Torino\, in the different roles of an academic career\, with an interruption from 1987 to 1990\, when he was a full professor at the Computer Science Department of the University of Milan. Marco Ajmone Marsan has been doing research in the fields of digital transmission\, distributed systems and networking. He was a member of the editorial board and of the steering committee of the “ACM/IEEE Transactions on Networking”. He is a member of the editorial boards of the journals “Computer Networks”and “Performance Evaluation”of Elsevier\, and of the “ACM Transactions on Modeling and Performance Evaluation of Computer Systems”. He served in the organizing committee of several leading networking conferences\, and he was general chair of INFOCOM 2013. Marco Ajmone Marsan is a Fellow of the IEEE\, a member of the Academy of Sciences of Torino\, and a member of Academia Europaea. CATEGORIES:Seminars,Youtube LOCATION:Teams + LINCS Seminar Rooms\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Teams + LINCS Seminar Rooms:geo:0,0 END:VEVENT BEGIN:VEVENT UID:585@lincs.fr DTSTART;TZID=Europe/Paris:20201125T110000 DTEND;TZID=Europe/Paris:20201125T120000 DTSTAMP:20210118T153142Z URL:https://www.lincs.fr/events/an-introduction-to-mean-field-theory/ SUMMARY:An introduction to mean field theory DESCRIPTION:When working with interacting particle systems\, mean-field models provide a link between models on a microscopic scale describing the behavior of the system and simplified models on a macroscopic scale describing the statistical distribution of the particles. In this talk\, we will introduce and discuss some main theoretical concepts associated with mean field models\, in particular Sznitman's propagation of chaos results and coupling techniques.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:584@lincs.fr DTSTART;TZID=Europe/Paris:20201120T093000 DTEND;TZID=Europe/Paris:20201120T123000 DTSTAMP:20201113T084351Z URL:https://www.lincs.fr/events/mini-workshop-i-a-appliquee/ SUMMARY:Mini Workshop I.A. appliquée DESCRIPTION: CATEGORIES:Workshop END:VEVENT BEGIN:VEVENT UID:583@lincs.fr DTSTART;TZID=Europe/Paris:20201119T093000 DTEND;TZID=Europe/Paris:20201119T123000 DTSTAMP:20201113T084201Z URL:https://www.lincs.fr/events/mini-workshop-5g-et-ses-application-inclua nt-v2x/ SUMMARY:Mini Workshop 5G et ses application (incluant V2X) DESCRIPTION: CATEGORIES:Workshop END:VEVENT BEGIN:VEVENT UID:573@lincs.fr DTSTART;TZID=Europe/Paris:20201118T140000 DTEND;TZID=Europe/Paris:20201118T150000 DTSTAMP:20201118T140553Z URL:https://www.lincs.fr/events/talk-by-a-member-of-lincs-scientific-commi ttee-distributing-service-execution/ SUMMARY:Talk by a member of LINCS Scientific Committee "Distributing service execution" DESCRIPTION:Services often consists of independent components that can be executed independently (so-called microservices) and they often deal with very large user populations. This setup presents various opportunities\, e.g.\, reducing latency or overheads\, by executing service instances close to the user. This talk will look at several algorithmic and engineering problems in this context\, for both backhaul networks and wired networks.\nBio\nHolger Karl received his PhD in 1999 from Humboldt University Berlin\; afterwards\, he joined Technical University Berlin. Since 2004\, he is Professor for Computer Networks at Paderborn University. His main research interests are wireless communication and architectures for the Future Internet. Recently\, he has focused mostly on SDN and NFV.\n\n \;\n\nTeams link to the seminar: \; https://teams.microsoft.com/l/meetup-join/19%3a9d61b1d307fe451ebb27c5e6d70b 244a%40thread.tacv2/1605540304584?context=%7b%22Tid%22%3a%225d471751-9675-4 28d-917b-70f44f9630b0%22%2c%22Oid%22%3a%22d64605ca-67ce-4b7d-ab88-bc16f4e17 6ec%22%7d CATEGORIES:Seminars,Youtube LOCATION:Teams + LINCS Seminar Rooms\, 23 avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Teams + LINCS Seminar Rooms:geo:0,0 END:VEVENT BEGIN:VEVENT UID:580@lincs.fr DTSTART;TZID=Europe/Paris:20201118T104500 DTEND;TZID=Europe/Paris:20201118T121500 DTSTAMP:20201118T144359Z URL:https://www.lincs.fr/events/simpy-package-tutorial/ SUMMARY:SimPy Package tutorial DESCRIPTION:SimPy is a python package for discrete event simulations based on python’s standard generators. This tutorial will demonstrate how you can use SimPy to implement event-discrete simulations and which features SimPy offers to help you doing that. We will also go through an example for queueing network systems.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:582@lincs.fr DTSTART;TZID=Europe/Paris:20201116T093000 DTEND;TZID=Europe/Paris:20201116T123000 DTSTAMP:20201113T084500Z URL:https://www.lincs.fr/events/mini-workshop-blockchain-lincssystemx/ SUMMARY:Mini Workshop BlockChain DESCRIPTION: CATEGORIES:Workshop END:VEVENT BEGIN:VEVENT UID:581@lincs.fr DTSTART;TZID=Europe/Paris:20201113T093000 DTEND;TZID=Europe/Paris:20201113T123000 DTSTAMP:20201113T084430Z URL:https://www.lincs.fr/events/mini-workshop-iot-lincssystemx/ SUMMARY:Mini Workshop IoT DESCRIPTION: CATEGORIES:Workshop END:VEVENT BEGIN:VEVENT UID:577@lincs.fr DTSTART;TZID=Europe/Paris:20201104T104500 DTEND;TZID=Europe/Paris:20201104T121500 DTSTAMP:20201110T103844Z URL:https://www.lincs.fr/events/fluid-limits-a-useful-tool-to-study-the-st ability-of-queuing-networks/ SUMMARY:Fluid limits : a useful tool to study the stability of queuing networks DESCRIPTION:Introduced by Rybko and Stolyar in 1992\, fluid-scaling and fluid limits offer a systematic way to study the stability or instability of queuing networks over a vast range of queuing disciplines and queuing networks. In this talk\, I am going to present some of the main results associated with fluid limits and illustrate how we can use them with a simple M/G/1 queuing network.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:575@lincs.fr DTSTART;TZID=Europe/Paris:20201028T110000 DTEND;TZID=Europe/Paris:20201028T120000 DTSTAMP:20201102T080104Z URL:https://www.lincs.fr/events/what-problems-does-cloud-solve-non-bs-intr oduction-by-a-former-academic/ SUMMARY:What problems does cloud solve? Non BS introduction by a former academic. DESCRIPTION:Cloud computing in addition to being a large industry can also seem daunting to understand. In this introduction\, we will present in a very didactic manner what problems cloud computing is solving. In addition to a general introduction\, I will also present several tools that can be applied in the context of the everyday work of a scientist / PhD student. This course can help you get a better grasp of the different products and problems tackled by cloud computing and how is it relevant for you. Bring all your infrastructure questions with you! If you have questions about how large scale cloud infrastructure work this is the time to have them solved.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:569@lincs.fr DTSTART;TZID=Europe/Paris:20201023T090000 DTEND;TZID=Europe/Paris:20201023T170000 DTSTAMP:20201023T061311Z URL:https://www.lincs.fr/events/all-day-workshop-lincs-systemx/ SUMMARY:All-day Workshop LINCS-SystemX DESCRIPTION:A one-day collaborative workshop gathering researchers from LINCS and engineers from SystemX who will share their ongoing research to consolidate joint R&\;D activities\, to create synergies in the framework of new inspiring projects on networks\, blockchain\, V2X\, cloud and AI.\nProgram\n09h00-09h30: Welcome. Introduction by LINCS and SystemX managements\n\nDigital Security and \; Blockchain:\n\n \n\n 09h30-09h50: R&\;D topics on Blockchain. Maria Potop-Butucaru (Lincs)\n 09h50-10h10: Blockchain@SystemX. Khalifa Toumi (SystemX)\n 10h10-10h30: Cryptography@SystemX. Kalpana Singh (SystemX)\n 10h30-10h50: Q&\;A and collaborations\n\n\n\nApplied AI and IoT:\n\n \n\n 11h00-11h20: Scikit-Network@Lincs. Thomas Bonald (Lincs)\n 11h20-12h00: Applied AI and IoT@Lincs. Ludovic Noirie (Lincs)\n 12h00-12h20: AI@SystemX. Hatem Hajri (SystemX)\n 12h20-12h45: Q&\;A and collaborations\n\n\n\n12h45-14h00: Lunch break\n\nV2X &\; 5G:\n\n \n\n 14h00- 14h30: Presentation of the project 5G-OpenRoad. Joëlle Gauthier (Systematic)\n 14h30-14h45: Q&\;A and collaborations on 5G-OpenRoad\n 14h45-15h30: V2X@Lincs and 5G@LINCS. François Baccelli (Lincs)\n 15h30- 16h10: V2X@SystemX and 5G@SystemX. Ines Benjemaa and Francesca Bassi (SystemX)\n 16h10-16h30: Q&\;A and collaborations\n\n\n\n\n \n\n 16h30-17h00: Smart Grid @LINCS. Daniel Kofman (Lincs)\n\n\n\n17h00-17:15: Wrap-up and collaborations\n\nConclusion of workshop n° 1 CATEGORIES:Other Worshops,Workshop END:VEVENT BEGIN:VEVENT UID:562@lincs.fr DTSTART;TZID=Europe/Paris:20201021T140000 DTEND;TZID=Europe/Paris:20201021T150000 DTSTAMP:20201023T092127Z URL:https://www.lincs.fr/events/seminar-presentation-by-a-new-lincs-associ ate-member-3/ SUMMARY:Seminar Presentation by a new LINCS associate member "Multi-Tenant Resource Allocation at the Network Edge" DESCRIPTION:Edge Computing (EC) is a network paradigm in which computational resources\, e.g.\, CPU\, memory\, are distributed in the access networks\, close to the final users. Network elements at the edge\, e.g.\, base stations\, road side units\, access points\, become intelligent and can be used by multiple third party Service Providers (SPs) to run (a part of) their application at the edge. Such applications can be heterogeneous\, ranging from video-streaming to augmented reality\, to services needed to autonomous driving.\n\nIn order to enable this\, the Network Operator (NO)\, owning the physical infrastructure\, needs to virtualize edge resources and allocate them to the SPs\, which represent the tenants.\n\nUnlike Cloud Computing\, EC resources are scarce and contention arises between SPs. Therefore\, the NO needs to carefully allocate virtual resources among them\, in order to increase its utility\, e.g.\, reduction in bandwidth consumption\, user QoE. Such allocation is challenging\, since SPs must be kept isolated\, i.e.\, data and computation of each SP must be inaccessible to other SPs and to the NO. In other words\, SPs are black boxes for the NO\, which still must be able to properly allocate resources among them.\n\nA. Araldo will present some solutions to the problem of Multi-Tenant Resource Allocation in EC\, described above\, based on two approaches: explicit information exchange between SPs and NO or data-driven allocation algorithms\, as reinforcement learning and stochastic perturbation.\n\nFinally\, A. Araldo will present some preliminary results related to the performance of large scale augmented reality applications implemented via a distributed system of Edge AI boards\, which are small and cheap embedded devices equipped with GPU\, able to run deep neural networks. CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:561@lincs.fr DTSTART;TZID=Europe/Paris:20201014T140000 DTEND;TZID=Europe/Paris:20201014T150000 DTSTAMP:20201023T091649Z URL:https://www.lincs.fr/events/seminar-presentation-by-a-new-lincs-associ ate-member-2/ SUMMARY:Seminar Presentation by a new LINCS associate member "Performance Benchmarking of State-of-the-Art Software Switches for NFV" DESCRIPTION:With the goal of replacing proprietary hardware appliances with Virtual Network Functions (VNFs) implemented in software\, Network Function Virtualization (NFV) has gained popularity in the past few years. Software switches are widely employed to route traffic between VNFs and physical Network Interface Cards (NICs). It is thus of paramount importance to compare the performance of different switch designs and architectures. In this paper\, we propose a methodology to compare fairly and comprehensively the performance of software switches. We first explore the design spaces of 7 state-of-the-art software switches and then compare their performance under four representative test scenarios. Each scenario corresponds to a specific case of routing NFV traffic between NICs and/or VNFs. In our experiments\, we evaluate the throughput and latency between VNFs in two of the most popular virtualization environments\, namely virtual machines (VMs) and containers. Our experimental results show that no single software switch prevails in all scenarios. It is\, therefore\, crucial to choose the most suitable solution for the given use case. At the same time\, the presented results and analysis provide a more in-depth insight into the design tradeoffs and identify potential performance bottlenecks that could inspire new designs. CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:570@lincs.fr DTSTART;TZID=Europe/Paris:20201014T110000 DTEND;TZID=Europe/Paris:20201014T120000 DTSTAMP:20201026T084500Z URL:https://www.lincs.fr/events/iterators-a-simple-tool-to-browse-objects- in-python/ SUMMARY:Iterators: A Simple Tool to Browse Objects in Python DESCRIPTION:Iterators are simple tools to browse objects in Python. They define a unique interface called iteration protocol\, that enables to decorrelate the objects that contain the data from the object that iterates on data. All standard Python functions to browse objects like 'for'\, 'while'\, etc. are based on iterators. In this presentation\, I will formally present iterators\, and in particular explain why they are interesting and useful. I will also introduce useful concepts and modules related to iterators: list comprehension\, generative expressions and functions\, itertools.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:568@lincs.fr DTSTART;TZID=Europe/Paris:20201012T140000 DTEND;TZID=Europe/Paris:20201012T170000 DTSTAMP:20201012T070111Z URL:https://www.lincs.fr/events/thesis-defense-fablabs-a-global-and-growin g-network-of-collaborative-organizations-an-analysis-of-intra-and-inter-or ganizational-coordination-modes/ SUMMARY:Thesis defense "FabLabs\, a global and growing network of collaborative organizations: an analysis of intra and inter-organizational coordination modes" DESCRIPTION:This thesis contributes to the understanding of the organizational phenomenon of FabLabs\, which aims to democratize personal digital manufacturing and promote knowledge sharing. To this end\, we investigate the modes of coordination that have emerged in this global network of local collaborative organizations\, whose number has grown rapidly and continuously since 2005. Our work addresses both the intra-organizational level (a FabLab as an organization) and the inter-organizational level (the FabLab network as a whole).\nIt builds on the literature relative to the modes of coordination in communities of knowledge\, and in particular communities of practice\, in the context of collective management of common goods \;as well as in inter-organizational networks. We have adopted a comprehensive approach based on a participatory observation posture. Our work is based on three case studies (one on the FabLab Artilect and two on the Global FabLab Network) and sheds light on the modes of coordination \;within and between FabLabs\, \;with two main contributions.\nWe show that the principles shared in a collaborative network can be structuring for organizational configurations that are otherwise diverse. Also\, we highlight that in the observed context\, two processes of structural fragmentation appear at both the intra and inter-organizational levels. The first process operates according to a core-periphery logic. The second process results in the formation of thematic and\, in some cases\, geographical proximity sub-groups. Our work suggests that these processes can help preserve collaborative dynamics despite the growth of the organization when "bridge members" are each active in both the core and one of the subgroups.\n \;\nTo participate in visio-conference\nMeeting linc \; \;: \;https://telecom-paris.zoom.us/j/93062897097?pwd=d W56a240b3ZPbi8yelJ4cmpyaTRQdz09 \;\nID: 930 6289 7097\nPw : 824751 CATEGORIES:PhD Defense LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:564@lincs.fr DTSTART;TZID=Europe/Paris:20201008T150000 DTEND;TZID=Europe/Paris:20201008T180000 DTSTAMP:20201001T101702Z URL:https://www.lincs.fr/events/thesis-defense-governing-the-commons-in-bl ockchains/ SUMMARY:Thesis Defense "Governing the Commons in Blockchains" DESCRIPTION:Blockchains are one of most appealing technologies over the last years\,\nboth for scientists and for the general public. Blockchains are\ndistributed ledgers that aim to offer transparency\, integrity and many\nmore advantages over their centralised counterparts. Blockchains were\n“revealed” and became popular thanks to the creation and raise of the\ncryptocurrency Bitcoin. Over the years\, blockchain technologies become\nmore and more popular with an exceptional peak in 2017. Blockchains are\nbecoming mainstream technologies\, as there is an observatory for\nblockchains established by the European Commission\, blockchain forums in\nmany countries\, blockchain start-ups are flourishing\, scientific\nconferences are discussing the topic\, and even some scientific\nconferences are now specifically dedicated to the technology\, etc.\nThe blockchain technology promises\, thanks to its integrity and\ntransparency properties to be useful and interesting in various domains\,\nand not only for financial systems. However\, many questions and doubts\nfloat around it. Is it environmentally viable? Is the technology even\nensuring its promises? Can they be used in real life settings\, etc.\nIn this thesis\, using the lens of distributed systems\, we study and\ndefined the properties of committee-based blockchains and their\nfairness\; that definition allows formalising and helping correct one of\nthe most used blockchain of that class. Furthermore\, adding lenses from\ngame theory\, we propose a methodology to analyse the rational behaviours\nof participants in a blockchains system. Using that methodology\, we\nshow\, under different mechanism of rewards\, the necessary conditions\nneeded to ensure the blockchain properties.\n\nParticiper à la réunion Zoom\nhttps://us02web.zoom.us/j/81819553516?pwd=RDU4SVA1d3BTNGc2eHM1emNxSUF Odz09\n\nID de réunion \;: 818 1955 3516\nCode secret \;: 2020/10/08 CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:565@lincs.fr DTSTART;TZID=Europe/Paris:20201007T140000 DTEND;TZID=Europe/Paris:20201007T150000 DTSTAMP:20201008T075919Z URL:https://www.lincs.fr/events/seminar/ SUMMARY:"CoronaSurveys: Using Indirect Reporting to Estimate the Incidence of Epidemics" DESCRIPTION:The world is suffering from a pandemic called COVID-19\, caused by the SARS-CoV-2 virus. National governments have problems evaluating the reach of the epidemic\, due to having limited resources and tests at their disposal. This problem is especially acute in low and middle-income countries (LMICs). Hence\, any simple\, cheap and flexible means of evaluating the incidence and evolution of the epidemic in a \;given country with a reasonable level of accuracy is useful.\nIn this talk\, I will present the CoronaSurveys project (https://coronasurveys.org/). CoronaSurveys uses a technique based on (anonymous) surveys in which participants report on the health status of their contacts. This indirect reporting technique\, known in the \;literature as network scale-up method\, preserves the privacy of the participants and their contacts\, and collects information from a larger fraction of the population (as compared to individual surveys). The CoronaSurveys project has been collecting reports for the COVID-19 \;pandemic since March 2020. Results obtained by CoronaSurveys show the power and flexibility of the approach\, suggesting that it could be an inexpensive and powerful tool to track the COVID-19 pandemic. This makes it especially interesting and useful for LMICs.\nBio\nDr. Antonio Fernández Anta is a Research Professor at IMDEA Networks.\nPreviously he was a Full Professor at the Universidad Rey Juan Carlos \;(URJC) and was on the Faculty of the Universidad Politécnica de Madrid \;(UPM)\, where he received an award for his research productivity. He \;was a postdoc at MIT from 1995 to 1997\, and spent sabbatical years at \;Bell Labs Murray Hill and MIT Media Lab. He has been awarded the \;Premio Nacional de Informática "Aritmel" in 2019 and is a Mercator \;Fellow of the SFB MAKI in Germany since 2018. He has more than 25 \;years of research experience\, and more than 200 scientific \;publications. He was the Chair of the Steering Committee of DISC and \;has served in the TPC of numerous conferences and workshops. He \;received his M.Sc. and Ph.D. from the University of SW Louisiana in \;1992 and 1994\, respectively. He completed his undergraduate studies at \;the UPM\, having received awards at the university and national level \;for his academic performance. He is a Senior Member of ACM and IEEE. CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:567@lincs.fr DTSTART;TZID=Europe/Paris:20201007T110000 DTEND;TZID=Europe/Paris:20201007T120000 DTSTAMP:20201012T064355Z URL:https://www.lincs.fr/events/zap-stochastic-approximation-and-reinforce ment-learning/ SUMMARY:Zap Stochastic Approximation and Reinforcement Learning DESCRIPTION:Many reinforcement learning problems can be seen from the point of view of stochastic approximation. Unfortunately\, classic stochastic approximation algorithms\, such as Robbins-Monro\, may have an infinite asymptotic variance. The class of "zap" algorithms aim at solving that problem. We then examine the application of zap algorithms to reinforcement learning\, with the example of zap Q-learning.\n\nSlides CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:558@lincs.fr DTSTART;TZID=Europe/Paris:20200923T140000 DTEND;TZID=Europe/Paris:20200923T150000 DTSTAMP:20200925T133657Z URL:https://www.lincs.fr/events/seminar-presentation-by-a-new-lincs-associ ate-member-on-the-inference-of-high-speed-networks-behavior-via-machine-le arning/ SUMMARY:Seminar Presentation by a new LINCS associate member "On the inference of high-speed networks’ behavior via Machine Learning" DESCRIPTION:Network Function Virtualization (NFV) is a novel trend in IT networks which advocates replacing hardware middleboxes with equivalent pieces of code executed on general-purpose servers.\nThis on-going process of network softwarization can help network operators to reduce the operational and management costs of their network infrastructures.\nAlongside the benefits from the operator's perspective\, new strategies to provide the network's resources to users are arising.\nFollowing the principle of "everything as a service"\, multiple tenants can access the required resources -- typically CPUs\, NICs\, or RAM -- according to a Service-Level Agreement (SLA). This provides the opportunity for network managers to continuously monitor the network's behavior\, collect a huge amount of network data that can be used\, in conjunction with machine learning algorithms\, to solve several problems (from resource allocation\, to intrusion detection/prevention).\nUnfortunately\, there is no free lunch\, and current machine learning techniques require a huge amount of computational resources: in the case of softwarized networks\, allocating the computational resources requires a tradeoff between the network communication's capabilities (i.e.\, the "speed") and the quality of the ML algorithm (i.e.\, the "intelligence").\nIn this talk\, I will present a network inference problem\, which consists in identifying the global behavior of a high-level network function executed on top of a commodity server\, by accessing low-level information represented by the server's CPU utilization.\nThe focus of this presentation will be on the performance (accuracy) of the ML algorithm utilized to make the prediction\, and on the impact of such an algorithm on the overall network performance.\nI will finally identify the most promising approaches to be able to deploy machine learning algorithms together with real-world high-speed network applications. CATEGORIES:Machine Learning,Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:563@lincs.fr DTSTART;TZID=Europe/Paris:20200923T110000 DTEND;TZID=Europe/Paris:20200923T120000 DTSTAMP:20200925T123736Z URL:https://www.lincs.fr/events/dictionaries/ SUMMARY:Dictionaries DESCRIPTION:In this second session about collections\, I will talk about dictionaries and their main subclasses: OrderedDict\, defaultdict\, Counter and ChainMap.\n\n CATEGORIES:Tools, Tips and Tricks,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:554@lincs.fr DTSTART;TZID=Europe/Paris:20200922T090000 DTEND;TZID=Europe/Paris:20200922T130000 DTSTAMP:20200910T120214Z URL:https://www.lincs.fr/events/thesis-defense-algorithmic-and-software-co ntributions-to-graphmining/ SUMMARY:Thesis defense: "Algorithmic and Software Contributions to Graph Mining" DESCRIPTION:Since the introduction of Google’s Page Rank method for Web searches in the late 1990s\, graph algorithms have been part of our daily lives. In the mid 2000s\, the arrival of social networks has amplified this phenomenon\, creating new use-cases for these algorithms. Relationships between entities can be of multiple types: user-user symmetric relationships for Facebook or LinkedIn\, follower-followee asymmetric ones for Twitter or even user-content bipartite ones for Netflix\, Deezer or Amazon. They all come with their own challenges and the applications are numerous: centrality calculus for influence measurement\, node clustering for knowledge discovery\, node classification for recommendation or embedding for link prediction\, to name a few. In the meantime\, the context in which graph algorithms are applied has rapidly become more constrained. On the one hand\, the increasing size of the datasets with millions of entities\, and sometimes billions of relationships\, bounds the asymptotic complexity of the algorithms for industrial applications. On the other hand\, as these algorithms affect our daily lives\, there is a growing demand for explanability and fairness in the domain of artificial intelligence in general. Graph mining is no exception. For example\, the European Union has published a set of ethics guidelines for trustworthy AI. This calls for further analysis of the current models and even new ones. This thesis provides specific answers via a novel analysis of not only standard\, but also extensions\, variants\, and original graph algorithms. Scalability is taken into account every step of the way. Following what the Scikit-learn project does for standard machine learning\, we deem it important to make these algorithms available to as many people as possible and participate in graph mining popularization. Therefore\, we have developed an open-source software\, Scikit-network\, which implements and documents the algorithms in a simple and efficient way. With this tool\, we cover several areas of graph mining such as graph embedding\, clustering\, and semi-supervised node classification.\n\nParticiper à la réunion Zoom\nhttps://telecom-paris.zoom.us/j/99270581285?pwd=VUR5Z3gxN2tqamhJc0xnO XZYcWxUQT09\n\nID de réunion : 992 7058 1285\nCode secret : 143438 CATEGORIES:PhD Defense LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:557@lincs.fr DTSTART;TZID=Europe/Paris:20200916T140000 DTEND;TZID=Europe/Paris:20200916T150000 DTSTAMP:20200925T133829Z URL:https://www.lincs.fr/events/francois-baccelli-nash-equilibrium-structu re-of-a-class-of-spatial-competition-games/ SUMMARY:Seminar presentation "Nash equilibrium structure of a class of spatial competition games" DESCRIPTION:We study an N-player game where a pure action of each player is to\nselect a non-negative function on a Polish space supporting a finite\ndiffuse measure\, subject to a finite constraint on the integral of the\nfunction. This function is used to define the intensity of a Poisson\npoint process on the Polish space. The processes are independent over\nthe players\, and the value to a player is the measure of the union of\nits open Voronoi cells in the superposition point process. Under\nrandomized strategies\, the process of points of a player is thus a Cox\nprocess\, and the nature of competition between the players is akin to\nthat in Hotelling competition games. We characterize when such a game\nadmits Nash equilibria and prove that when a Nash equilibrium exists\, it\nis unique and comprised of pure strategies that are proportional in the\nsame proportions as the total intensities. We give examples of such\ngames where Nash equilibria do not exist.\n\nThis is a joint work with Venkat Anantharam\, UC Berkeley\, EECS. CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:559@lincs.fr DTSTART;TZID=Europe/Paris:20200916T110000 DTEND;TZID=Europe/Paris:20200916T120000 DTSTAMP:20200925T121041Z URL:https://www.lincs.fr/events/collections-in-python/ SUMMARY:Collections in Python DESCRIPTION:I will talk about collections in Python.\n\n Sets: set\, frozenset.\n Sequences: tuple\, named tuples\, list\, deque (we will just mention str and bytes).\n Mappings: dict\, defaultdict\, OrderedDict\, Counter\, ChainMap.\n\n\nI will assume at least a basic knowledge of set\, tuple\, list and dict.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group END:VEVENT BEGIN:VEVENT UID:556@lincs.fr DTSTART;TZID=Europe/Paris:20200914T140000 DTEND;TZID=Europe/Paris:20200914T170000 DTSTAMP:20200910T135958Z URL:https://www.lincs.fr/events/thesis-defense-malliavin-calculus-and-diri chlet-structures-for-independent-random-variables/ SUMMARY:Thesis defense : "Malliavin calculus and Dirichlet structures for independent random variables" DESCRIPTION:In a pioneer work from 1976\, Paul Malliavin lays the foundations for an infinite-dimensional stochastic calculus of variations. Initially developed on the Wiener space\, the Malliavin calculus was later extended to other families of processes such as Poisson\, Rademacher or Lévy processes. It seems possible to identify a terminology common to all these formalisms\; this lies on the notions of Malliavin operators (gradient\, divergence\, Laplacian / Ornstein-Uhlenbeck operator) and the fundamental relation between the gradient operator and the divergence (defined as the adjoint of the gradient): the integration by parts formula.\nWe develop in this thesis a Malliavin calculus for two classes of discrete processes: the sequences of independent random variables (not necessarily identically distributed) and the compound geometric processes. These constructions were motivated by several applications\; two of them will be developed during the presentation.\nThe first one deals with the estimation of distances between two probability laws using Stein's method. One of the step of this method is performed using advantageously Malliavin integration by parts formula. In order to use it to get convergence results for functionals of independent random variables\, we equip any countable product of probability spaces with a discrete Dirichlet-Malliavin structure built on a family of Malliavin operators (gradient discrete\, divergence\, operator number)\, an integration by parts formula\, and the forms of Dirichlet naturally induced in this context. In this framework\, we establish a Normal and Gamma approximation criteria by functionals of independent random variables in terms of Malliavin operators.\nThe motivation for the second work was to use our tools to deal with portfolio management problems in a discrete financial market model. It turned out to be impossible to state an hedging formula within our precedent formalism. We replace thus the initial model with a ternary model\, underlied by a compound geometric process for which we develop a pseudo-decomposition chaotic and define Malliavin operators. By plugging this formalism to portfolio optimization\, we show that the minimizing quadratic risk strategy can be expressed in terms of the newly introduced Malliavin operators.\n\nZoom link:\n\n[ \;https://telecom-paris.zoom.us/j/93395747795?pwd=VzBYRmE0T0 taVXFnZTU1WVBPRXV5UT09 \;| \;https://telecom-paris.zoom.us/j/933957 47795?pwd=VzBYRmE0T0taVXFnZTU1WVBPRXV5UT09 \;]\n\nID de réunion : 933 9574 7795\nCode secret : 887763 CATEGORIES:PhD Defense LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:552@lincs.fr DTSTART;TZID=Europe/Paris:20200909T140000 DTEND;TZID=Europe/Paris:20200909T150000 DTSTAMP:20200925T134615Z URL:https://www.lincs.fr/events/interns-talks-1-monitoring-as-a-service-fo r-iot-networks-and-2-structured-and-interactive-summarization-provisional- title/ SUMMARY:Interns' talks: (1) Monitoring as a service for IoT networks and (2) Structured and interactive summarization DESCRIPTION:Two interns from LINCS will present their works at this LINCS seminar:\n\n1) Pooneh Mokariasl (Nokia Bell Labs / Sorbonne Université): Monitoring as a service for IoT networks\n\n2) Mélanie Cambus (Nokia Bell Labs / Université de Versailles): Structured and interactive summarization CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:555@lincs.fr DTSTART;TZID=Europe/Paris:20200909T110000 DTEND;TZID=Europe/Paris:20200909T120000 DTSTAMP:20200915T074319Z URL:https://www.lincs.fr/events/quantum-internet/ SUMMARY:Quantum Internet DESCRIPTION:IRTF is the research part of the IETF\, producing Internet Drafts and Requests For Comments on topics that are still in the research phase. The Quantum Internet Research Group was proposed end of 2018 and officially approved in March 2020 to work on the emerging quantum communication technologies in the Internet context. There are currently two Internet Drafts that are working documents in QIRG:\n\n \n\n Architectural Principles for a Quantum Internet\;\n Applications and Use Cases for the Quantum Internet.\n\n\n\nDuring this session of the Network Theory Working Group at LINCS\, I will describe the content of these two Internet Drafts. You will understand:\n\n \n\n \n\n \n\n What Quantum Internet is: a distributed system to make entangled pairs of qubits between end-points of the network\;\n To what Quantum Internet is useful: to extend the distance of the currently available Quantum Key Distribution systems (quantum cryptography) and to allow futuristic quantum clouds (distributed quantum computing).\n\n\n\n\n\n\n\nKnowing quantum mechanics by "popular science" only is enough to follow this session!\n\nSlides: http://www.lincs.fr/wp-content/uploads/2020/09/20200909_Quantum_Internet_LN .pdf CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:551@lincs.fr DTSTART;TZID=Europe/Paris:20200715T110000 DTEND;TZID=Europe/Paris:20200715T120000 DTSTAMP:20200715T120718Z URL:https://www.lincs.fr/events/contact-process-on-point-processes-part-ii / SUMMARY:Contact process on point processes\, part II DESCRIPTION:I will first review some results on the contact process on graphs.\nI will then describe ongoing research on this type of dynamics on random\npoint processes.\nTwo instances of point processes will be discussed\, static and with random\nmotion.\n\nWarning: Sound quality is bad the first minute\, but fine for the rest of the talk. CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:550@lincs.fr DTSTART;TZID=Europe/Paris:20200701T110000 DTEND;TZID=Europe/Paris:20200701T120000 DTSTAMP:20200701T092849Z URL:https://www.lincs.fr/events/clean-code-from-robert-martin/ SUMMARY:"Clean Code" from Robert Martin DESCRIPTION:What is the difference between "good" and "bad" code? What gain is there to expect from turning to clean code? I know how to code and have good notions of algorithmic (publication in computer algebra and teaching in master). But something was clearly missing\, since my projects\, after reaching around 300 lines of code\, would become heavy to develop et hard to evolve.\n\nFollowing the advice of a coder friend\, I read the book "Clean Code" from Robert Martin. My coding skill have since improved and\, even more important\, I find joy again into coding even for my longest projects. In this short presentation\, I will cover the first few chapters of the book: code readability\, single responsibility principle for classes and functions\, comments\, tests.\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:549@lincs.fr DTSTART;TZID=Europe/Paris:20200625T140000 DTEND;TZID=Europe/Paris:20200625T160000 DTSTAMP:20200625T110926Z URL:https://www.lincs.fr/events/models-and-solutions-of-strategic-resource -allocation-problems-approximate-equilibrium-and-online-learning-in-blotto -games/ SUMMARY:Models and Solutions of Strategic Resource Allocation Problems: Approximate Equilibrium and Online Learning in Blotto Games DESCRIPTION:In this thesis\, we investigate resource allocation games\, broadly defined as resource allocation problems involving interactions between competitive decision makers. We primarily focus on the Colonel Blotto game (CB game). In the CB game\, two competitive players\, each having a fixed budget\, simultaneously distribute their resources toward n battlefields. Each player evaluates each battlefield with a certain value. In each battlefield\, the player who has the higher allocation wins and gains the corresponding value. Each player's payoff is her aggregate gains from all the battlefields. \n\nFirst\, we model several variants of the CB game and their extensions as one-shot complete-information games and analyze players' strategic behaviors. Our first main contribution is a class of approximate equilibria in these games for which we prove that the approximation error can be well-controlled. Second\, we model resource allocation games with combinatorial structures as online learning problems to study situations involving sequential plays and incomplete information. We make a connection between these games and online shortest path problems (OSP). Our second main contribution is a set of novel regret-minimization algorithms for OSP under several feedback settings that provide significant improvements in regret guarantees and running time in comparison with existing solutions. CATEGORIES:PhD Defense END:VEVENT BEGIN:VEVENT UID:548@lincs.fr DTSTART;TZID=Europe/Paris:20200624T110000 DTEND;TZID=Europe/Paris:20200624T120000 DTSTAMP:20200706T130855Z URL:https://www.lincs.fr/events/contact-process-on-point-processes/ SUMMARY:Contact process on point processes\, part I DESCRIPTION:I will first review some results on the contact process on graphs.\nI will then describe ongoing research on this type of dynamics on random\npoint processes.\nTwo instances of point processes will be discussed\, static and with random\nmotion. CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:547@lincs.fr DTSTART;TZID=Europe/Paris:20200617T140000 DTEND;TZID=Europe/Paris:20200617T150000 DTSTAMP:20200617T155744Z URL:https://www.lincs.fr/events/characterizing-the-expressive-power-of-inv ariant-and-equivariant-graph-neural-networks/ SUMMARY:Characterizing the Expressive Power of Invariant and Equivariant Graph Neural Networks DESCRIPTION:Various classes of Graph Neural Networks (GNN) have been proposed and shown to be successful in a wide range of applications with graph structured data. In this work\, we propose a theoretical framework able to compare the expressive power of these GNN architectures. The current universality theorems only apply to intractable classes of GNNs. Here\, we prove the first approximation guarantees for practical GNNs\, paving the way for a better understanding of their generalization. Our theoretical results are proved for invariant GNNs computing a graph embedding (permutation of the nodes of the input graph does not affect the output) and equivariant GNNs computing node embeddings (permutation of the input permutes the output). We show that Folklore Graph Neural Networks (FGNN)\, which are tensor based GNNs augmented with matrix multiplication are the most expressive architectures proposed so far for a given tensor order. We illustrate our results on the Quadratic Assignment Problem (a NP-Hard combinatorial problem) by showing that FGNNs are able to learn how to solve the problem\, leading to much better average performances than existing algorithms (based on spectral\, SDP or other GNNs architectures). On a practical side\, we also implement masked tensors to handle batches of graphs of varying sizes.\n\nThis is a joint work with Waiss Azizian (ENS).\n\nUse of Teams meetings for this seminar: contact ludovic.noirie{AT}nokia-bell-labs{DOT}com to get the Teams link CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:546@lincs.fr DTSTART;TZID=Europe/Paris:20200617T110000 DTEND;TZID=Europe/Paris:20200617T120000 DTSTAMP:20200617T102459Z URL:https://www.lincs.fr/events/introduction-to-pygame/ SUMMARY:Introduction to Pygame DESCRIPTION:Pygame is a Python package that wraps the SDL library. SDL (Simple DirectMedia Layer) is a cross-platform development library written in C\, designed to provide access to multimedia: 2D graphics\, audio\, keyboard\, mouse and joystick. Pygame can be used to design games but not only: anything that makes use of a graphical interface\, sound\, etc\; and in particular\, it can be used for demos. I will present and comment on several simple code examples that introduce the main modules of Pygame\, dealing with display\, images\, sprites\, text\, events\, time\, sound\, keyboard and mouse.\n\nGithub repo\, with slides and code examples: https://github.com/francois-durand/pygame_presentation.\n\nDirect link to slides.\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:544@lincs.fr DTSTART;TZID=Europe/Paris:20200610T140000 DTEND;TZID=Europe/Paris:20200610T150000 DTSTAMP:20200610T154034Z URL:https://www.lincs.fr/events/gismo-a-generic-information-search-with-a- mind-of-its-own/ SUMMARY:Gismo: a Generic Information Search... with a Mind of its Own! DESCRIPTION:Searching for documents is a task that everyone faces on a regular basis\, especially when looking for a relevant Internet page\, an e-mail\, or a document on an Intranet. An effective search relies on a precise and well-organized search engine.\nThe majority of current techniques combine a keyword search with structural information (ontologies\, relationships between elements) in order to order the documents in a corpus by relevance.\nIn this talk\, we present a new light navigation engine called Gismo (Generic Information Search with a Mind of its Own). Gismo exploits only the textual content of documents and does not require ontology\, metadata\, or pre-learning. It is thus possible to use it on any corpus without making assumptions about the type of documents or their language. The model chosen and the algorithms used allow Gismo to be extremely fast even on large corpora. Finally\, Gismo allows you to find\, sort and organize documents by theme and relevance\, making it a navigation engine and not a simple search engine.\n\nGismo is available as an open-source Python module.\n\nPresentation slides (PDF)\n\n CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:545@lincs.fr DTSTART;TZID=Europe/Paris:20200610T110000 DTEND;TZID=Europe/Paris:20200610T120000 DTSTAMP:20200610T153607Z URL:https://www.lincs.fr/events/a-mathematical-theory-of-communication-dis crete-noiseless-systems/ SUMMARY:A Mathematical Theory of Communication: Discrete Noiseless Systems DESCRIPTION:In 1948 Shannon published the article that defines modern information theory. For this reading group\, we will present the first part of the article\, which is concerned with discrete lossless systems like the telegraph. We will present the way in which Shannon defines and gives the intuition of concepts like the capacity of a communication channel\, entropy\, the Markovian model of a language\, and much more...\n\n CATEGORIES:Network Theory,Working Group,Youtube END:VEVENT BEGIN:VEVENT UID:543@lincs.fr DTSTART;TZID=Europe/Paris:20200603T140000 DTEND;TZID=Europe/Paris:20200603T150000 DTSTAMP:20200603T193302Z URL:https://www.lincs.fr/events/iot-network-control-and-management/ SUMMARY:IoT Network Control and Management DESCRIPTION:Internet of Things (IoT) devices are increasingly present in our lives. This plethora of devices creates a need to manage them easily\, transparently and quickly from anywhere\, especially when unskilled people are involved\, as is the case in private IoT networks such as home\, office and corporate LANs. During this LINCS seminar conference\, you will learn about the research carried out in the Nokia Bell Labs on the control and management of these private IoT networks. We have designed an SDN / cloud platform to facilitate the use of IoT devices. We have developed a solution based on supervised machine learning to identify the types of connected devices. We are currently working on a generic and easy to use IoT network monitoring solution.\n\nUse of Teams meetings for this seminar: contact ludovic.noirie{AT}nokia-bell-labs{DOT}com to get the Teams link\n\nSlides CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:541@lincs.fr DTSTART;TZID=Europe/Paris:20200603T110000 DTEND;TZID=Europe/Paris:20200603T120000 DTSTAMP:20200603T092126Z URL:https://www.lincs.fr/events/input-output-and-the-internet-part-ii/ SUMMARY:Input\, Output\, and the Internet: Part II DESCRIPTION:Python offers a lot of tools to easily deal with local and Internet files. We will present a selection of these tools illustrated with nice examples.\n\nThis will be presented in two parts.\n\n Part I: Local Files\n\n pathlib: the pythonic way to manipulate files\;\n gzip / zipfile: compress transparently\;\n tempfile / io: no more mess to clean.\n\n\n Part II: Internet\n\n requests: retrieve Internet files\;\n BeautifulSoup: parse HTML like a charm\;\n Selenium: when everything else fails.\n\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:542@lincs.fr DTSTART;TZID=Europe/Paris:20200527T150000 DTEND;TZID=Europe/Paris:20200527T160000 DTSTAMP:20200529T131706Z URL:https://www.lincs.fr/events/beam-management-in-5g/ SUMMARY:Beam management in 5G DESCRIPTION:Beam management is central in the operation of dense 5G cellular networks. Focusing the energy radiated to mobile terminals (MTs) by increasing the number of beams per cell increases signal power and decreases interference\, and has hence the potential to bring major improvements on area spectral efficiency (ASE). This benefit\, however\, comes with unavoidable overheads that increase with the number of beams and the MT speed. This paper proposes a first system-level stochastic geometry model encompassing major aspects of the beam management problem: frequencies\, antennas\, and propagation\; physical layer\, wireless links\, and coding\; network geometry\, interference\, and resource sharing\; sensing\, signaling\, and mobility management. This model leads to a simple analytical expression for the effective ASE that the typical user gets in this context. This in turn allows one to find\, for a wide variety of 5G network scenarios including millimeter wave (mmWave) and sub-6 GHz\, the number of beams per cell that offers the best global trade-off between these benefits and costs. We finally provide numerical results that discuss the effects of different systemic trade-offs and performances of mmWave and sub-6 GHz 5G deployments.\n\nThe talk will also highlight the interplay between pure and standardization-oriented research and the lessons learned through the collaboration.\n\nThis is a collaborative work done at LINCS between Sanket Kalamkar and Francois Baccelli from Inria\, and Fuad Abinader\, Andrea Marcano and Luis Guilherme Uzeda Garcia from Nokia Bell Labs. CATEGORIES:Seminars,Youtube END:VEVENT BEGIN:VEVENT UID:539@lincs.fr DTSTART;TZID=Europe/Paris:20200527T110000 DTEND;TZID=Europe/Paris:20200527T120000 DTSTAMP:20200527T122537Z URL:https://www.lincs.fr/events/support-vector-networks/ SUMMARY:Support-vector networks DESCRIPTION:Cortes\, C.\, Vapnik\, V. Support-vector networks. Mach Learn 20\, 273–297 (1995). https://doi.org/10.1007/BF00994018 .\n\nAbstract of the paper:\n\n"The support-vector network is a new leaming machine for two-group classification problems. The machine conceptually implements the following idea: input vectors are non-linearly mapped to a very high- dimension feature space. In this feature space a linear decision surface is constructed. Special properties of the decision surface ensures high generalization ability of the learning machine. The idea behind the support-vector network was previously implemented for the restricted case where the training data can be separated without errors. We here extend this result to non-separable training data. High generalization ability of support-vector networks utilizing polynomial input transformations is demonstrated. We also compare the performance of the support-vector network to various classical learning algorithms that all took part in a benchmark study of Optical Character Recognition."\n\nTalk material available here: https://github.com/yokaiAG/DataNets-Course\n\n CATEGORIES:Network Theory,Working Group,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:540@lincs.fr DTSTART;TZID=Europe/Paris:20200520T110000 DTEND;TZID=Europe/Paris:20200520T120000 DTSTAMP:20200521T132330Z URL:https://www.lincs.fr/events/input-output-and-the-internet-part-i/ SUMMARY:Input\, Output\, and the Internet: Part I DESCRIPTION:Python offers a lot of tools to easily deal with local and Internet files. We will present a selection of these tools illustrated with nice examples.\n\nThis will be presented in two parts.\n\n Part I: Local Files\n\n pathlib: the pythonic way to manipulate files\;\n gzip / zipfile: compress transparently\;\n tempfile / io: no more mess to clean.\n\n\n Part II: Internet\n\n requests: retrieve Internet files\;\n BeautifulSoup: parse HTML like a charm\;\n Selenium: when everything else fails.\n\n\n\n\n CATEGORIES:Tools, Tips and Tricks,Working Group,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:518@lincs.fr DTSTART;TZID=Europe/Paris:20200312T140000 DTEND;TZID=Europe/Paris:20200312T160000 DTSTAMP:20200312T165614Z URL:https://www.lincs.fr/events/thesis-defense-resource-allocation-and-opt imization-for-the-non-orthogonal-multiple-access/ SUMMARY:Thesis Defense : Resource allocation and optimization for the non-orthogonal multiple access DESCRIPTION:Non-orthogonal multiple access (NOMA) is a promising technology to increase the spectral efficiency and enable massive connectivity in future wireless networks. In contrast to orthogonal schemes\, such as OFDMA\, NOMA can serve multiple users on the same frequency and time resource by superposing their signal in the power domain. One of the key challenges for radio resource management (RRM) in NOMA systems is to solve the joint subcarrier and power allocation (JSPA) problem.\nIn this thesis\, we present a novel optimization framework to study a general class of JSPA problems. This framework employs a generic objective function which can be used to represent the popular weighted sum-rate (WSR)\, proportional fairness\, harmonic mean and max-min fairness utilities. Our work also integrates various realistic constraints. We prove under this framework that JSPA is NP-hard to solve in general. In addition\, we study its computational complexity and approximability in various special cases\, for different objective functions and constraints.\nIn this framework\, we first consider the WSR maximization problem subject to cellular power constraint. We propose three new algorithms: Opt-JSPA computes an optimal solution with lower complexity than current optimal schemes in the literature. It can be used as an optimal benchmark in simulations. However\, its pseudo-polynomial time complexity remains impractical for real-world systems with low latency requirements. To further reduce the complexity\, we propose a fully polynomial-time approximation scheme called Ɛ\;-JSPA\, which allows tight trade-offs between performance guarantee and complexity. To the best of our knowledge\, Ɛ\;-JSPA is the first polynomial-time approximation scheme proposed for this problem. Finally\, Grad-JSPA is a heuristic based on gradient descent. Numerical results show that it achieves near-optimal WSR with much lower complexity than existing optimal methods.\nAs a second application of our framework\, we study individual power constraints. Power control is solved optimally by gradient descent methods. Then\, we develop three heuristics: DGA\, DPGA and DIWA\, which solve the JSPA problem for centralized and distributed settings. Their performance and computational complexity are compared through simulations.\n\nKeywords : NOMA\, SIC\, resource allocation\, convex and combinatorial optimization\n\nTitre : Allocation des ressources et optimisation pour l’accès multiple non-orthogonal CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:533@lincs.fr DTSTART;TZID=Europe/Paris:20200311T140000 DTEND;TZID=Europe/Paris:20200311T150000 DTSTAMP:20200312T095101Z URL:https://www.lincs.fr/events/comparing-the-modelling-powers-of-rnn-and- hmm/ SUMMARY:Comparing the modelling powers of RNN and HMM DESCRIPTION:Recurrent Neural Networks (RNN) and Hidden \;Markov Models (HMM) are popular models for processing sequential data and have found many applications such as speech recognition\, time series prediction or machine translation. Although both models have been extended in several ways (eg. Long Short Term Memory and Gated Recurrent Unit architectures\, Variational RNN\, partially observed Markov models)\, their theoretical understanding remains partially open. In this context\, our approach consists in classifying both models from an information geometry point of view. More precisely\, both\nmodels can be used for modeling the distribution of a sequence of random observations from a set of latent variables\; however\, in RNN the latent variable is deterministically deduced from the current observation and the previous latent variable\, while in HMM the set of (random) latent variables is a Markov chain. In this paper\, we first embed these two generative models into a generative unified model (GUM). We next consider the subclass of GUM models which yield a stationary Gaussian observations probability distribution function (pdf). Such pdf are characterized by their covariance sequence\; we show that the GUM model can produce any stationary Gaussian distribution with geometrical covariance structure. We finally discuss about the modeling power of the HMM and RNN submodels\, via their associated observations pdf: some observations pdf can be modeled by a RNN\, but not by an HMM\, and vice versa\; some can be produced by both structures\, up to a reparameterization. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:538@lincs.fr DTSTART;TZID=Europe/Paris:20200311T110000 DTEND;TZID=Europe/Paris:20200311T120000 DTSTAMP:20200601T084549Z URL:https://www.lincs.fr/events/introduction-to-pytorch/ SUMMARY:Introduction to PyTorch DESCRIPTION:Join us on for an introduction to PyTorch! Learn how to use it for machine learning purposes\, and why it is useful for deep learning research.\n\nPyTorch is a Python based scientific computing package targeted as a replacement for NumPy that leverages the power of GPUs. It is also used as a deep learning research platform that provides maximum flexibility and speed for developping neural networks architectures and training models through automatic differentation.\n\nSlides\n\nNotebook: https://colab.research.google.com/drive/16fHimaBw8zp9zp9AktOLE6BC7GLAUi90#s crollTo=_y251XyQ-V0D . CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:532@lincs.fr DTSTART;TZID=Europe/Paris:20200306T100000 DTEND;TZID=Europe/Paris:20200306T120000 DTSTAMP:20200306T131336Z URL:https://www.lincs.fr/events/autonomous-iot-device-type-identification/ SUMMARY:Thesis Defense : Autonomous IoT device type identification DESCRIPTION:With the proliferation of smart devices\, more and more people buy IP devices and home appliances to benefit from new services\, allowing them to control their home anywhere\, anytime and to remain informed about.\nThe number of services enabled by the \;IoT devices is quickly increasing\, and so is the diversity of types of such devices: cameras\, sensors\, smart phones\, tablets\, speakers coming from several vendors and with different models. Devices and \;IoT service management systems in a home network needs to find out which \;IoT devices are connected to the network. A device management system for all kind of devices being connected to the home network is necessary. In this thesis\, we propose a methodology based on the analysis of network protocol messages to extract relevant information about the devices in order to identify their type. Then\, we proposed an other identification methodology based on Machine Learning algorithms. Our classification approach is based on the combination of textual features extracted from packets payload and statistical network communication features. We evaluate our proposal and show that it outperforms the state of the art in this field with an\naccuracy equal to 0.98.\n\nEn Français:\n------------\nIdentification du type d’objet connecté de façon autonome\n\nAvec la prolifération des objets connectés\, de plus en plus de personnes achètent des objets et des électroménagers connectés pour bénéficier de nouveaux services\, leur permettant de contrôler leur maison n'importe où\, à tout moment et de rester informés. Le nombre de services activés par les objets IoT augmente rapidement\, tout comme la diversité des types de ces objets: caméras\, capteurs\, téléphones intelligents\, tablettes\, haut-parleurs provenant de plusieurs fournisseurs et avec différents modèles. Les objets et les systèmes de gestion des services IoT \;d'un réseau domestique doivent savoir quels objets \;IoT sont connectés au réseau. Un système de gestion d’objets pour tous les types dans un réseau domestique est nécessaire. Dans cette thèse\, nous proposons une méthodologie basée sur l'analyse des messages de protocole réseau pour extraire des informations pertinentes sur les dispositifs afin d'identifier leur type. Ensuite\, nous avons proposé une autre méthodologie d'identification basée sur des algorithmes de Machine Learning. Notre approche de classification est basée sur la combinaison de fonctionnalités textuelles extraites de la charge utile des paquets et des caractéristiques de communication du réseau statistique. Nous évaluons notre solution et montrons qu'elle surpasse les solutions mentionnées dans l'état de l'art de la thèse avec une précision égale à 0\,98. CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:534@lincs.fr DTSTART;TZID=Europe/Paris:20200304T140000 DTEND;TZID=Europe/Paris:20200304T150000 DTSTAMP:20200305T090052Z URL:https://www.lincs.fr/events/log-analysis-via-space-time-pattern-matchi ng/ SUMMARY:Log Analysis via Space-time Pattern Matching DESCRIPTION:The increasing number of machines and technologies involved in existing infrastructures and networks hardens their management. Even if many monitoring solutions help to detect a faulty behavior\, having a clear understanding of its causes is not always straightforward\, especially if relevant information is scattered over logs issued by different software or hardware components. This paper proposes a new methodology inspired from pattern matching and able to find alarm correlations with or without prior knowledge about the monitored system.  \;The proposed data structure can store every observed pattern of correlated alarms by processing logs online. It can be queried to extract the patterns of alarms leading to an arbitrary failure. This paper comes with three main contributions. First\, we propose a framework able to represent alarm logs according to spatio-temporal dependencies.  \;Second\, we design a new scalable data structure\, able to store every observed pattern of alarms\, and validate it by simulation on real and artificial datasets. Third\, we show how to exploit this data structure for fault diagnosis. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:536@lincs.fr DTSTART;TZID=Europe/Paris:20200304T110000 DTEND;TZID=Europe/Paris:20200304T120000 DTSTAMP:20200303T085743Z URL:https://www.lincs.fr/events/rare-geometries-revealing-rare-categories- via-dimension-driven-statistics/ SUMMARY:Rare geometries: revealing rare categories via dimension-driven statistics DESCRIPTION:In many situations\, classes of data points of primary interest also happen to be those that are least numerous. A well-known example is detection of fraudulent transactions among the collection of all financial transactions\, the vast majority of which are legitimate. These types of problems fall under the label of ‘rare-category detection. There are two challenging aspects of these problems. The first is a general lack of labeled examples of the rare class and the second is the potential non-separability of the rare class from the majority (in terms of available features). Statistics related to the geometry of the rare class (such as its intrinsic dimension) can be significantly different from those for the majority class\, reflecting the different dynamics driving variation in the different classes. In this paper we present a new supervised learning algorithm that uses a dimension-driven statistic\, called the kappa-profile\, to determine whether unlabeled points belong to a rare class. Our algorithm requires very few labeled examples and is invariant with respect to translation so that it performs equivalently on both separable and non-separable classes.\n\nReference: Rare geometries: revealing rare categories via dimension-driven statistics\, Henry Kvinge\, Elin Farnell\, Jingya Li\, Yujia Chen\, 2019. CATEGORIES:Network Theory,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:537@lincs.fr DTSTART;TZID=Europe/Paris:20200226T160000 DTEND;TZID=Europe/Paris:20200226T161000 DTSTAMP:20200306T084859Z URL:https://www.lincs.fr/events/converting-python-plots-to-tikz-with-tikzp lotlib/ SUMMARY:Converting Python plots to tikz with tikzplotlib DESCRIPTION:Short presentation of tikzplotlib.\n\nExample. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:531@lincs.fr DTSTART;TZID=Europe/Paris:20200226T150000 DTEND;TZID=Europe/Paris:20200226T160000 DTSTAMP:20200306T084353Z URL:https://www.lincs.fr/events/abstract-classes-in-python/ SUMMARY:Abstract Classes in Python DESCRIPTION:An abstract class can be considered as a blueprint for other classes. It allows you to create a set of methods that must be created within any child classes built from your abstract class.  Abstract class provides default functionality for the subclasses. By defining an abstract base class\, you can define a common Application Program Interface(API) for a set of subclasses. This capability is especially useful in situations where a third-party is going to provide implementations\, such as with plugins in an application. It can also help you when working on a large team or with a large code-base where keeping all classes in your head at the same time is difficult or not possible.\n\nThe notebook. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:525@lincs.fr DTSTART;TZID=Europe/Paris:20200226T140000 DTEND;TZID=Europe/Paris:20200226T150000 DTSTAMP:20200228T135113Z URL:https://www.lincs.fr/events/beam-based-operations-in-5g/ SUMMARY:Beam Based Operations in 5G NR Rel-15 DESCRIPTION:Deploying cellular networks in millimeter wave (mmWave) frequencies require coping with rapid channel variations and severe free-space pathloss and atmospheric absorption. In order to make use of the large portions of novel spectrum available at mmWave frequencies\, highly-directional antennas generating radio beams (beamforming) are used at base station and mobile terminal side. This presentation presents the novel mechanisms introduced with 5G New Radio (NR) air interface for allowing the use of beamforming both for control and data channels\, including (a) synchronization and initial access\, and (b) beam management procedures.\nBio:\nFuad Abinader has pursued his BSc in Computer Science and MSc in Informatics at UFAM (Brazil)\, in 2002 and 2006\, respectively\, and his PhD in Telecommunications at UFRN (Brazil) in 2015. His professional career started in 2002\, and he has been working with research and development in Telecommunications since 2007\, having published numerous papers and patents in the field. He's currently working at Nokia Bell Labs Paris as a Research Engineer\, and he's involved in the standardization of 5G NR at 3GPP. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:520@lincs.fr DTSTART;TZID=Europe/Paris:20200219T140000 DTEND;TZID=Europe/Paris:20200219T150000 DTSTAMP:20200225T094322Z URL:https://www.lincs.fr/events/collaboration-and-innovation-in-an-interna tional-science-and-engineering-competition/ SUMMARY:Collaboration and Innovation in an International Science and Engineering Competition DESCRIPTION:In this talk\, we will present our recent work investigating criteria of performance and success of teams in a scientific context using a quantitative approach. We leverage electronic laboratory notebooks edited on wiki websites by over 2\,000 teams of students participating to the international Genetically Engineered Machines (iGEM) synthetic biology competition over 10 years to uncover what features of team work best predict short term quality (medals\, prizes) and long term impact (how the biological parts that teams engineer are re-used by other teams). Using insights from the wiki commits (~1\,000 per team)\, we unravel universal aspects of team dynamics and team collaborative patterns underlying iGEM team work. Finally\, by studying teams that\nparticipated multiple times we exhibit mechanisms of collective learning underlying performance improvement. We will finish the talk by introducing our ongoing ‘IGEM TIES’ project conducted at the CRI Paris\, where we are mapping temporal\, high-resolution team interaction networks using a bluetooth app.\n\nBio: https://marcsantolini.com/about/ CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:530@lincs.fr DTSTART;TZID=Europe/Paris:20200219T110000 DTEND;TZID=Europe/Paris:20200219T120000 DTSTAMP:20200306T092920Z URL:https://www.lincs.fr/events/asymptotics-for-euclidean-minimal-spanning -trees-on-random-points/ SUMMARY:Asymptotics for Euclidean minimal spanning trees on random points DESCRIPTION:I will present the main ideas of the paper "Asymptotics for Euclidean minimal spanning trees on random points" by David Aldous and J. Michael Steele. In this paper\, the authors define Euclidean minimal spanning forest on a Poisson point process using a greedy algorithm. They compute the expectation of functionals on this minimal spanning forest such as the degree of a vertex\, the sum of the d-th power of edge lengths incident at a vertex (where d is the dimension of the Euclidean space on which Poisson point lie). Their computations are based on the approximation of the Poisson point process with a scaled and shifted uniform i.i.d. random points on the unit cube. The conjectures posed by the authors in this paper were partially resolved later and stimulated further research.\n\nThe slides. CATEGORIES:Network Theory,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:528@lincs.fr DTSTART;TZID=Europe/Paris:20200212T140000 DTEND;TZID=Europe/Paris:20200212T150000 DTSTAMP:20200212T151433Z URL:https://www.lincs.fr/events/insights-from-heterogeneous-random-walks/ SUMMARY:Insights from heterogeneous random walks: from theory to applications DESCRIPTION:First I will introduce our model\, heterogeneous continuous time random walk (HCTRW) model as a versatile analytical formalism for studying and modeling diffusion processes in heterogeneous structures\, such as porous or disordered media\, multiscale or crowded environments\, weighted graphs or networks.\nAfter some theoretical results about this random walk model\, diffusive dynamics and the spectral properties of the generalized transition matrix. In particular\, we will talk about important property\, the distribution of the first passage times changes due to local and global heterogeneities of the medium. The HCTRW formalism offers a unified mathematical language to address various diffusion-reaction problems\, with numerous applications in material sciences\, physics\, chemistry\, biology\, and social sciences. We will also discuss some possible applications for mobility and epidemiological models.\nBio:\nI have been working in theoretical physics\, mathematics\, data analysis\, computer science and applications to biology\, climatology\, social science\, epidemiology and education. During my Phd I was working in Humboldt University and Potsdam Climate Institute in Marie-Curie project on developing network methods for big data analysis >\;here<\;\, then I did several postdocs in Ecole Polytechnique working on transport in crowded environments (here) After I got fellowship at CRI to work on mobilit\, epidemiological models and data analysis methods applied to metascience and health data. Some publications are here on Google Scholar.\n\nCurrently I am researcher in Bell labs in Data Analytics team. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:529@lincs.fr DTSTART;TZID=Europe/Paris:20200212T110000 DTEND;TZID=Europe/Paris:20200212T120000 DTSTAMP:20200211T151556Z URL:https://www.lincs.fr/events/crawling-the-web-with-scrapy/ SUMMARY:Crawling the web with Scrapy DESCRIPTION:Scrapy is a Python-based tool for the collection of data from webpages which can be used either within Python code or in a stand-alone fashion (with very little knowledge of Python syntax). We will present the basics of Scrapy and its limitations on a few examples.\n\nSlides\n\nNotebook CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:527@lincs.fr DTSTART;TZID=Europe/Paris:20200205T140000 DTEND;TZID=Europe/Paris:20200205T150000 DTSTAMP:20200207T092619Z URL:https://www.lincs.fr/events/nsdi-preview-diamond-miner-comprehensive-d iscovery-of-the-internets-topology-diamonds/ SUMMARY:Diamond-Miner: Comprehensive Discovery of the Internet’s Topology Diamonds DESCRIPTION:(NSDI preview)\nDespite the well-known existence of load-balanced forwarding \;paths in the Internet\, current Internet-wide active topology \;mapping efforts are multipath agnostic – largely because of \;the probing volume and time required of existing multipath \;discovery techniques. This paper introduces D-Miner\, a system \;that marries previous work on high-speed probing with \;multipath discovery to make Internet-wide topology mapping\, \;inclusive of load-balanced paths\, feasible.We deploy D-Miner \;and collect multiple IPv4 interface-level topology snapshots\, \;where we find >\; 64% more edges\, and significantly more \;complex and rich topologies\, than existing systems. We further \;scrutinize topological changes between snapshots and attribute \;forwarding differences not to routing or policy changes\, \;but to load balancer “remapping” events. We precisely categorize \;remapping events and find that they are a much larger \;and frequent contributor of path changes than previously recognized. \;By making D-Miner and our collected Internet-wide \;topologies publicly available\, we hope to help facilitate better \;understanding of the Internet’s true structure and resilience. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:526@lincs.fr DTSTART;TZID=Europe/Paris:20200205T110000 DTEND;TZID=Europe/Paris:20200205T120000 DTSTAMP:20200204T090817Z URL:https://www.lincs.fr/events/propagation-of-chaos-in-discrete-time-repl ica-mean-field-models/ SUMMARY:Propagation of chaos in discrete-time Replica Mean Field models DESCRIPTION:Replica mean-field (RMF) models have been introduced in various fields (biological neural networks\, telecommunication networks) to study limit behaviors in models whilst preserving the finite-size effects of interactions inside the considered networks. Replica-mean-field models are made of infinitely many replicas which interact according to the same basic structure as that of the finite network of interest.\nI will present the RMF structure in discrete time in a very general setting and show properties that arise at the limit in the number of replicas\, such as asymptotic independence between replicas and the asymptotic behavior of the arrivals process to a given replica. I will also present RMF models in continuous time which are of particular interest in computational neuroscience. CATEGORIES:Network Theory,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:517@lincs.fr DTSTART;TZID=Europe/Paris:20200130T140000 DTEND;TZID=Europe/Paris:20200130T160000 DTSTAMP:20200203T093906Z URL:https://www.lincs.fr/events/thesis-defense-6/ SUMMARY:Thesis Defense : Full-Duplex for Cellular Networks: A Stochastic Geometry Approach DESCRIPTION:English Version:\n\nFull-duplex (FD) is a principle in which a transceiver can receive and transmit on the same time-frequency radio resource. The principle was long held as impractical due to the high self-interference that arises when simultaneously transmitting and receiving in the same resource block. When assuming perfect self-interference cancellation\, FD can potentially double the spectral efficiency (SE) of a given point-to-point communication. In practice though\, it is not possible to achieve the aforementioned characteristic. Moreover\, under a cellular network context\, not only the self-interference limits the performance\, since additional co-channel interference is created by base stations (BSs) and users equipment (UEs). However\, even with the higher interference dowlinks (DLs) still obtain higher SE performances\, whereas uplinks (ULs) are generally critically degraded\, when compared to half-duplex (HD).\n\nWe focus our work in the study of alternatives that can help improve the impaired ULs in FD networks\, while still trying to profit from the gains experienced by DLs. In this regard\, we use stochastic geometry along the thesis as a means to characterize key performance indicators of cellular networks\, such as: coverage probability\, average SE and data rates. The thesis is divided into three major studies. Firstly\, we propose a duplex-switching policy which enables BSs to operate in FD- or HD- depending on the UL and DL conditions. Secondly\, we investigate the performance of hybrid HD/FD networks under a millimeter wave context. Finally\, we propose a novel algorithm based on non-orthogonal multiple-access (NOMA) and successive interference cancellation (SIC)\, which allows BSs to coordinate on their respective transmission schemes to reduce the BS-to-BS interference.\n\nWe demonstrate that the models presented in the thesis allow to balance the gains of one link over the other\; reducing the UL degradation\, while maintaining DL gains. In addition\, we show that scenarios in which equipment is able to perform beamforming are ideal for FD deployments\, since they directly reduce the co-channel interference.\n\nVersion Française:\n\nLe full-duplex (FD) est un principe selon lequel un appareil peut recevoir et émettre sur la même ressource radio temporaux-fréquentiel. Le principe a été longtemps considéré comme irréaliste en raison de la forte auto-interférence qui se produit lors de la transmission et la réception dans le même bloc de ressources. En supposant une annulation parfaite de l'auto-interférence (self-IC)\, il peut potentiellement doubler l'efficacité spectrale (SE) d'une communication point à point donnée. Dans la pratique\, il n'est toutefois pas possible d'obtenir la caractéristique susmentionnée. En outre\, dans le contexte d'un réseau cellulaire\, la performance du FD n'est pas limité seulement par l'efficacité du self-IC\, puisque des interférences supplémentaires sont créées par les stations de base (BS) et les équipements des utilisateurs (UEs). Toutefois\, même avec des niveaux des interférences plus élevés\, les liens en voie-descendantes (DLs) obtient ainsi de meilleures performances en termes de SE\, tandis que les liaisons montantes (UL) sont généralement gravement dégradées par rapport au half-duplex (HD).\n\nNous focalisons notre travail sur l'étude d'alternatives qui peuvent aider à améliorer les UL dégradés dans les réseaux basés sur FD\, tout en essayant de profiter des gains obtenus par les DLs. À cet égard\, nous utilisons la géométrie stochastique pour caractériser les indicateurs clés de performance des réseaux cellulaires\, tels que : probabilité de couverture\, SE moyenne et débit de données. La thèse est divisé en trois grandes études. Premièrement\, nous proposons une politique qui permet aux BSs de opérer en FD ou HD en fonction des conditions UL et DL. Deuxièmement\, nous étudions la performance des réseaux hybrides HD/FD dans un contexte d'ondes millimétriques. Finalement\, nous proposons un algorithme basé sur l'accès multiple non orthogonal (NOMA) et l'annulation d'interférences successives (SIC)\, qui permet aux stations de base de coordonner leurs schémas de transmission respectifs pour réduire les interférences BS vers BS.\n\nNous démontrons que les modèles présentés permettent d'équilibrer les gains d'une liaison par rapport à l'autre \; réduisant la dégradation de l'UL\, tout en maintenant les gains DL. En outre\, nous montrons que les scénarios dans lesquels les équipement sont capables de former des faisceaux sont idéaux pour les déploiements FD\, puisqu'ils réduisent directement l'intérference co-canal. CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:522@lincs.fr DTSTART;TZID=Europe/Paris:20200129T140000 DTEND;TZID=Europe/Paris:20200129T150000 DTSTAMP:20200203T093458Z URL:https://www.lincs.fr/events/bandwidth-part/ SUMMARY:BandWidth Part (BWP): A 5G feature for improving spectrum flexibility and power savings DESCRIPTION:Bandwidth Part (BWP) is a feature introduced in 3GPP Release 15 as part of the standard for 5G New Radio (NR). The introduction of BWPs was driven by two factors: spectrum usage flexibility and power saving for the user equipment (UE). Through spectrum flexibility the carrier bandwidth and numerology in which a UE operates can be dynamically configured\, thus allowing the network to simultaneously serve UEs with different service requirements (e.g.\, eMMB and mMTC). Furthermore\, such flexibility allows UEs to monitor a bandwidth narrower than the actual carrier bandwidth\, which allows for power saving. This talk focuses on the basic aspects of BWPs\, it's configuration\, and some of the already identified challenges that come with its implementation. For the latter\, simulation results are presented to better illustrate the advantages and disadvantages of using BWPs.\nBio:\nAndrea Marcano is currently working as a Research Engineer for Nokia Bell Labs France. She is part of a standardization research group focusing on radio interface architecture and protocols\, where her work centers on Radio Resource Management\; she has been working with BWPs since 2018. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:524@lincs.fr DTSTART;TZID=Europe/Paris:20200129T110000 DTEND;TZID=Europe/Paris:20200129T120000 DTSTAMP:20200122T153149Z URL:https://www.lincs.fr/events/testing-in-python/ SUMMARY:Testing in Python DESCRIPTION:Testing enables you to quickly detect when you break something in your code. Python has very convenient tools to do it\, such as Doctest and Pytest. We will also say a few words about Unittest\, Tox and Travis CI.\n\nSlides.\n\nGitHub Repo. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:523@lincs.fr DTSTART;TZID=Europe/Paris:20200122T110000 DTEND;TZID=Europe/Paris:20200122T120000 DTSTAMP:20200127T080001Z URL:https://www.lincs.fr/events/mutual-information-neural-estimation/ SUMMARY:Mutual Information Neural Estimation DESCRIPTION:Reference: Mutual Information Neural Estimation\, Belghazi et al. \, 2018.\n\nThe mutual information (MI) of two random variables is a measure of the mutual dependence between two variables. More specifically\, it quantifies the "amount of information" obtained about one random variable through observing the other random variable. Despite being a pivotal quantity across data science\, mutual information has historically been difficult to compute. Exact computation is only tractable for discrete variables\, or for a limited family of problems where the probability distributions are known. For more general problems\, this is not possible. Common approaches for MI estimation generally do not scale with dimensionality or sample size. I will present a method for estimating efficiently a strongly consistent lower bound of mutual information that can be used in numerous machine learning problems.\n\nSlides.\n\nNotebook. CATEGORIES:Network Theory,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:521@lincs.fr DTSTART;TZID=Europe/Paris:20200115T110000 DTEND;TZID=Europe/Paris:20200115T120000 DTSTAMP:20200115T125635Z URL:https://www.lincs.fr/events/reviewing-code-using-codecov/ SUMMARY:Reviewing code using Codecov DESCRIPTION:When developing a package\, it is often stressed that tests play a crucial role in ensuring that your code works as intended. However\, one may then wonder how to assert that—in turn—those very tests work as they should. With that perspective in mind\, we will go through the setup and use of Codecov\, a code reviewing service that boasts a wide range of supported languages (thus this Python academy is open to most programming orientations) and seamless setup with continuous integration tools.\n\nSlides: Reviewing_Code_Using_Codecov. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:519@lincs.fr DTSTART;TZID=Europe/Paris:20200108T110000 DTEND;TZID=Europe/Paris:20200108T120000 DTSTAMP:20200115T125519Z URL:https://www.lincs.fr/events/spatial-birth-and-death-wireless-networks/ SUMMARY:Spatial Birth-And-Death Wireless Networks DESCRIPTION:Reference: Spatial birth-and-death wireless networks\, F. Baccelli et A. Sankararaman.\n\nStochastic geometry can prove useful to model spatial stochastic systems. In this paper\, Baccelli and Sankararaman present a continuous space-time model for wireless networks taking into account stochastic interactions between users. The paper studies the stability region for the underlying Markov chain and produces an exact value for the cutoff arrival rate for the system. As an extension\, I will talk about  some natural extensions of the model I'm currently working on.\n\nSlides: Spatial_Birth-And-Death_Wireless_Networks. CATEGORIES:Network Theory,Working Group LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:515@lincs.fr DTSTART;TZID=Europe/Paris:20191218T140000 DTEND;TZID=Europe/Paris:20191218T150000 DTSTAMP:20200120T092150Z URL:https://www.lincs.fr/events/talk-by-marianna-belotti/ SUMMARY:Rewarding Miners: Bankruptcy games and Pooling Strategies DESCRIPTION:In the Bitcoin system\, mining is the procedure through which miners can gain money on regular basis by finding solutions to a mathematical crypto puzzle (full solution) which validates bitcoin transactions. In order to reduce the uncertainty of the remuneration over time\, miners cooperate and form pools. Each pool receives a reward which has to be split among pool's participants. The focus of this paper is to understand which is best method for a mining pool to redistribute the reward among cooperating miners using proper game theoretical models.\nThere exist\, in the literature and in practice\, several reward functions which allocate bitcoins inside pools such as: (i) the proportional rule\, (ii) the pay-per-share rule and (iii) an incentive compatible rule ensuring that miners report full solutions to the pool immediately and not with a delay. However\, this last rule encourages a harmful intra-pool behaviour (i.e. pool hopping) in bankruptcy situations (where the gained reward results insufficient to remunerate pool miners) that causes a loss in terms of pool's computational power.\nBy reinterpreting the allocating rules as outcomes of bankruptcy games (i.e.\, a type of cooperative games) we construct two new reward functions (i.e.\, the PPS-CEA and the PPS-CEL) and investigate their properties. The PPS-CEL rules results having a good inter-pool behavior discouraging pool hopping however\, concerning the intra-pool behavior it does not behave as well as the incentive compatible rule.\nWe provide then a suitable modification of the PPS-CEL that discourages pool hopping in bankruptcy situations while guaranteeing the incentive compatible property. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:516@lincs.fr DTSTART;TZID=Europe/Paris:20191218T110000 DTEND;TZID=Europe/Paris:20191218T120000 DTSTAMP:20191212T063939Z URL:https://www.lincs.fr/events/documenting-code-in-python/ SUMMARY:Documenting code in Python DESCRIPTION:We will cover the basics of docstrings and see how to generate documentation with Sphinx.\nEstimated duration: 30min. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:503@lincs.fr DTSTART;TZID=Europe/Paris:20191217T150000 DTEND;TZID=Europe/Paris:20191217T180000 DTSTAMP:20200123T074938Z URL:https://www.lincs.fr/events/thesis-defense-towards-a-scalable-and-prog rammable-incremental-deployment-of-icn-in-the-real-world/ SUMMARY:Thesis Defense : Towards a scalable and programmable incremental deployment of ICN in the real world DESCRIPTION:Information-Centric Networking (ICN) embraces a family of network architectures re-thinking Internet communication principles around named-data. After several years of research and the emergence of a few popular proposals\, the idea to replace TCP/IP with data-centric networking remains a subject of debate. ICN advantages have been advocated in the context of 5G networks for the support of highly mobile\, multi-access/source and latency minimal patterns of communications. However\, large-scale testing and insertion in operational networks are yet to happen\, likely due to the lack of a clear incremental deployment strategy. The aim of this thesis is to propose and evaluate effective solutions for deploying ICN.\nFirstly\, we propose Hybrid-ICN (hICN)\, an ICN integration inside IP (rather that over/under/ in place of) that has the ambition to trade-off no ICN architectural principles. By reusing existing packet formats\, hICN brings innovation inside the IP stack\, requiring minimal software upgrades and guaranteeing transparent interconnection with existing IP networks.\nSecondly\, the thesis focuses on the problem of deploying ICN at the network endpoints\, namely at the end host\, by designing a transport framework and a socket API that can be used in several ICN architectures such as NDN\, CCN and hICN. The framework fosters cutting-edge technologies aiming at providing performance and efficiency to applications. An extensive benchmarking at the end of the chapter will present the performance of the transport framework.\nSubsequently\, the benefits that hICN network and transport services can bring to applications will be assessed\, by considering two main use cases: HTTP and WebRTC. The former represents the de-facto protocol of the Web\, while the latter is a new emerging technology increasingly adopted for real time services.\nAt last\, the thesis proposes a solution for programmatically deploying\, configuring and managing ICN networks and applications: \; Virtualized ICN (vICN)\, a programmable unified framework for network configuration and management that uses recent progresses in resource isolation and virtualization techniques. It offers a single\, flexible and scalable platform to serve different purposes\, in particular the real deployments of ICN in existing IP networks. CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:495@lincs.fr DTSTART;TZID=Europe/Paris:20191206T140000 DTEND;TZID=Europe/Paris:20191206T160000 DTSTAMP:20191212T151401Z URL:https://www.lincs.fr/events/thesis-defense-4/ SUMMARY:Thesis Defense : Optimization and control of energy storage in smart grid DESCRIPTION:This thesis is motivated by the electric power system transformations due to more renewable integration and changing consumption patterns. Energy storage is one possible solution to facilitate a smooth transition\, ensuring the stability of the power system. In this thesis Li-Ion battery is used both at the level of individual consumers\, minimizing the cost of electricity by performing energy arbitrage under time-varying electricity price\, power factor correction\, peak demand shaving and energy backup\, and at the grid level for increasing reliability and stability of the power network by performing dynamic regulation and phase balancing. The cost of the batteries being still high\, the importance is also given to the health of the battery taking into account its degradation in optimization and control formulations. Several case studies using real data are conducted to evaluate the performance of the storage control and optimization algorithms. We observe that the ever-decreasing prices of batteries and the growing share of intermittent renewables will only increase the relevance of this work for future power networks. CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:514@lincs.fr DTSTART;TZID=Europe/Paris:20191204T103000 DTEND;TZID=Europe/Paris:20191204T120000 DTSTAMP:20191129T080124Z URL:https://www.lincs.fr/events/introduction-to-python-3/ SUMMARY:Introduction to Python (3) DESCRIPTION:We’ll cover basics of Python and design aspects.\n\nDo not hesitate to come even if you did not attend the first and second sessions.\n\nDownload the notebook. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:513@lincs.fr DTSTART;TZID=Europe/Paris:20191127T140000 DTEND;TZID=Europe/Paris:20191127T150000 DTSTAMP:20191129T133401Z URL:https://www.lincs.fr/events/random-walks-on-simplicial-complexes/ SUMMARY:Random walks on simplicial complexes DESCRIPTION:The Laplacian of a graph is a key object in the theory of graphs and can be viewed as the generator of a continuous time Markov chain on the graph.\nSimplicial complexes\, or hypergraphs\, are combinatorial objects which generalizes graphs for which there also exist a notion of Laplacian. We investigate the notion of random walk on such objects with the goal to find a link between this generalized Laplacian and the generator of the Markov process.\n\nLaurent Decreusefond is a Professor at Telecom Paris and have recently joined the LINCS lab. CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:512@lincs.fr DTSTART;TZID=Europe/Paris:20191127T103000 DTEND;TZID=Europe/Paris:20191127T120000 DTSTAMP:20191125T114721Z URL:https://www.lincs.fr/events/false-discovery-rate/ SUMMARY:False Discovery Rate DESCRIPTION:The false discovery rate (FDR) is a statistical approach used in multiple hypothesis testing to correct for multiple comparisons. It is typically used in high-throughput experiments in order to correct for random events that falsely appear significant. When testing a null hypothesis to determine whether an observed score is statistically significant\, a measure of confidence\, the p-value\, is calculated and compared to a confidence threshold ?. When k hypotheses are tested simultaneously with a confidence level ?\, the chances of occurrence of false positives (i.e.\, rejecting the null hypothesis when in fact it is true) is equal to 1 ? (1 ? ?)k\, which can lead to a high error rate in the experiment. Therefore\, a multiple testing correction\, such as the FDR\, is needed to adjust our statistical confidence measures based on the number of tests performed.\n\nReferences: False Discovery Rate (https://doi.org/10.1007/978-1-4419-9863-7_223)\, Computer Age Statistical Inference (By Bradley Efron\, Trevor Hastie). CATEGORIES:Network Theory,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:511@lincs.fr DTSTART;TZID=Europe/Paris:20191120T103000 DTEND;TZID=Europe/Paris:20191120T120000 DTSTAMP:20191125T141424Z URL:https://www.lincs.fr/events/introduction-to-python-2/ SUMMARY:Introduction to Python (2) DESCRIPTION:We’ll cover basics of Python and design aspects.\n\nDo not hesitate to come even if you did not attend the first session.\n\nDownload the notebook. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:510@lincs.fr DTSTART;TZID=Europe/Paris:20191113T140000 DTEND;TZID=Europe/Paris:20191113T140000 DTSTAMP:20191127T151716Z URL:https://www.lincs.fr/events/utility-maximising-properties-of-some-serv ice-rates-allocations-in-wireless-communication-networks/ SUMMARY:Utility-maximising properties of some service-rates allocations in wireless communication networks DESCRIPTION:We consider wireless communication networks where service rates of nodes depend the loads of their neighbours. We demonstrate that these rates are utility-maximising in a certain sense. Using this observation\, we prove stability of single-hop networks under natural assumptions. We also obtain bounds on some moments of the stationary workload.\n\nIn order to obtain these results\, we consider a framework of utility-optimising rate allocations which is much more general than the well-known $\\alpha$-fairness\, and prove general results on stability and bounds for some stationary workload distributions in networks with these rate allocations.\n\nWe also discuss stability of infinite networks.\n\nThis is a joint work with Sasha Stolyar (UIUC).\n\n \;\n\nVsevolod "Seva" Shneer is a professor at Heriot-Watt University (Edimburg\, Scotland) CATEGORIES:Seminars,Youtube LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:509@lincs.fr DTSTART;TZID=Europe/Paris:20191106T103000 DTEND;TZID=Europe/Paris:20191106T120000 DTSTAMP:20191029T111551Z URL:https://www.lincs.fr/events/exact-digraph-enumeration/ SUMMARY:Exact digraph enumeration DESCRIPTION:We present exact formulas for the number of digraphs in various interesting families: acyclic digraphs (dags)\, strongly connected digraphs\, digraphs with constraints on their strongly connected components. They are obtained through generating function manipulations and were first discovered by Wright\, Liskovets and Robinson. CATEGORIES:Network Theory,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:501@lincs.fr DTSTART;TZID=Europe/Paris:20191030T140000 DTEND;TZID=Europe/Paris:20191030T150000 DTSTAMP:20191104T084227Z URL:https://www.lincs.fr/events/talk-by-yackolley-amoussou-guenou/ SUMMARY:Rational vs Byzantine Players in Consensus-based Blockchains DESCRIPTION:\nIn this presentation\, we will analyse from the game theoretical point of view Byzantine Fault Tolerant (BFT) blockchains when processes exhibit rational or Byzantine behaviour. Our work models committee/consensus-based blockchains\, such as as a committee coordination game.We provide a game-theoretical methodology to analyse equilibrium interactions between Byzantine and rational committee members in BFT blockchains.Byzantine players seek to inflict maximum damage to the system\, while rational players best-respond to maximise their expected net gains.We then derive conditions under which consensus properties are satisfied or not in equilibrium.\n\n\n\nBio\n\n\n\nYackolley Amoussou-Guenou is a PhD student in LIP6\, the computer science lab of Sorbonne Université\, and in CEA List.He received his master degree from Université Paris-Diderot and his undergraduate degree from Université Paris-Est Créteil.His research focuses on distributed systems and blockchains\, and in particular on the application of game theory on blockchains.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:507@lincs.fr DTSTART;TZID=Europe/Paris:20191030T103000 DTEND;TZID=Europe/Paris:20191030T120000 DTSTAMP:20191125T141718Z URL:https://www.lincs.fr/events/parallel-computing-with-joblib-and-plottin g-with-seaborn/ SUMMARY:Parallel Computing with Joblib and Plotting with Seaborn DESCRIPTION:When in need of benchmarking an algorithm\, running said algorithm on a given - likely wide - range of parameters is usually required. In order to speed up this process\, parallel computing may be used. I will detail how Joblib enables such computations for CPU-only tasks with minimal overhead to the code.\n\nOnce those computations are over\, visualisation follows. To this end\, I will introduce Seaborn\, a PyPlot-based alternative to Matplotlib featuring refreshed visuals and enhanced interoperability with the Pandas package.\n\nDownload the files. CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:505@lincs.fr DTSTART;TZID=Europe/Paris:20191023T140000 DTEND;TZID=Europe/Paris:20191023T150000 DTSTAMP:20191029T143536Z URL:https://www.lincs.fr/events/cache-subsidies-for-an-optimal-memory-for- bandwidth-tradeoff-in-the-access-network/ SUMMARY:Cache Subsidies for an Optimal Memory for Bandwidth Tradeoff in the Access Network DESCRIPTION:\nAuthors:  \;Mahdieh Ahmadi\, James Roberts\, Emilio Leonardi\, and Ali Movaghar\n\n\n\nWhile the cost of the access network could be considerably reduced by the use of caching\,this is not currently happening because content providers (CPs)\, who alone have the detailed demand data required for optimal content placement\, have no natural incentive to use them to minimize access network operator (ANO) expenditure. We argue that ANOs should therefore provide such an incentive in the form of directsubsidies paid to the CPs in proportion to the realized savings. We apply coalition game theory to design the required subsidy framework and propose a distributed algorithm\, based on Lagrangian decomposition\, allowing ANOs and CPs to collectively realize the optimal memory for bandwidth tradeoff. The considered access network is a cache hierarchy with per-CP central office caches\, accessed by all ANOs\, at the apex\,and per-ANO dedicated bandwidth and storage resources at the lower levels\, including wireless base stations\, that must be shared by multiple CPs.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:508@lincs.fr DTSTART;TZID=Europe/Paris:20191023T103000 DTEND;TZID=Europe/Paris:20191023T120000 DTSTAMP:20191029T092915Z URL:https://www.lincs.fr/events/deep-q-learning-from-theory-to-practice/ SUMMARY:Deep Q-Learning: From Theory to Practice DESCRIPTION:After a brief presentation of Reinforcement Learning in general\, I give the theoretical bases for a particular reinforcement algorithm\, Q-Learning\, and its neural-network-powered version\, Deep Q-Learning. Then I show some difficulties that can be encountered during implementation and I suggest solutions to overcome them\, drawn from my personal experience.\n\nReference: the slides and videos from David Silver's online course on Reinforcement Learning (http://www0.cs.ucl.ac.uk/staff/d.silver/web/Teaching.html). CATEGORIES:Network Theory,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:500@lincs.fr DTSTART;TZID=Europe/Paris:20191016T140000 DTEND;TZID=Europe/Paris:20191016T143000 DTSTAMP:20191017T115430Z URL:https://www.lincs.fr/events/talk-by-deepa-jagyasi/ SUMMARY:Multi-cell MIMO Transceiver design for Mission-Critical Communication DESCRIPTION:\n Business and Mission critical communication (MCC) is a major communication paradigm that is used by public agencies\, e.g.\, during emergency situations\, or critical infrastructure companies\, e.g.\, airports\, transportation\, etc. MCC has very stringent requirements in terms of reliability\, coverage and should offer group communications.Coordinated Multimedia Multicast/Broadcast single frequency network (MBSFN) is considered as a potential technology for MCC as it benefits from increased coverage and inter-cell interference mitigation. In this paper\, we propose multi-input-multi-output (MIMO) multimedia MBSFN system design wherein each base station (BS) of a coordinated cluster multicasts a common message to all the users in a group. We use a greedy algorithm to dynamically form the cluster of synchronized BSs for optimal utilization of resources within an MBSFN. We assume the availability of perfect channel state information (CSI) knowledge and jointly obtain the optimal precoder and receive filters by minimizing the overall sum-mean-square-error (sum-MSE) constrained over the total transmit power. We further extend the proposed design to a robust case by considering the imperfections in available channel knowledge and obtain the transceiver matrices that are resilient to channel errors. We also present both the joint and robust system design for Single-Cell point-to-multipoint (SC-PTM) which is an alternative solution to MBSFN in MCC. Numerical results show the effectiveness of the proposed network architecture for future mission critical communication. Furthermore\, the comparison results show that the proposed robust design demonstrate better performance and is resilient to the presence of CSI errors.\n\n\n\nBio\n\n\n\n Deepa Jagyasi received the Bachelor of Engineering degree in electronics and telecommunication engineer from Pune University\, Pune\, India\, in 2010\, the Master of Engineering degree in electronics and communication engineering from Mumbai University\, Mumbai\, India\, in 2013 and the Ph.D degree from International Institute ofInformation Technology\, Hyderabad\, India in 2019. She is currently working as  \;post-doc at Département Informatique et Réseaux\, Telecom-Paristech\, Paris\, France.  \;Her research interests include robust transceiver-design\, millimeter-wave communications\, multiple-input-multiple-output precoding\, machine learning and physical layer security. \n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:506@lincs.fr DTSTART;TZID=Europe/Paris:20191016T103000 DTEND;TZID=Europe/Paris:20191016T120000 DTSTAMP:20191125T141859Z URL:https://www.lincs.fr/events/7121/ SUMMARY:Introduction to CherryPy DESCRIPTION:\nFor most daily research tasks\, a Jupyter Notebook is more than enough to do anything one wants. Yet\, there are situations where it can be useful to turn your Python programs into a Website:\n\n\n\n\nSharing results with someone that does not know Python or Notebooks\,\nPreparing a demo\,\nHaving a program in Computer A that starts and retrieve computation results from computer B.\n\n\n\n\nDuring this tutorial\, we'll show you how to easily deploy Python code on http by using CherryPy.\nDownload the files.\n CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:499@lincs.fr DTSTART;TZID=Europe/Paris:20191009T140000 DTEND;TZID=Europe/Paris:20191009T150000 DTSTAMP:20191010T115218Z URL:https://www.lincs.fr/events/talk-by-philippe-martins/ SUMMARY:OFDMA Dimensioning DESCRIPTION:\n This presentation will cover different models for the dimensioning of OFDMA air interfaces. In a first part\, models that rely on classical stochastic geometry results and on concentration inequalities\, will be introduced. The adopted approach is to obtain an upper bound of the outage probability in terms of Resource Blocks (RB) and to derive the number of RB required to provide a QoS target.The second part of the talk will deal with modeling of city maps via random tessellations (Crack STIT/PLT). This modeling provides a way to generate city maps as an outcome of a random tesselation.By using a ray launcher simulator on these maps\, it becomes possible to obtain coverage maps and SINR by simulation. The impact of the geometry of the city on the OFDMA dimensioning can then be investigated. \n\n\n\nBio\n\n\n\nPhilippe Martins is professor in the networking and computer science department\, at Telecom ParisTech since 2010. Before he held a position of associate professor in the same department since 2000. He obtained his PhD from Telecom ParisTech in 2000 (with honors) for his work on the design and performance evaluation of signaling protocols for B-ISDN networks. In 2000\, he started working on cellular networks. Since then\, his main research interests lie in performance evaluation\, planning\, algorithms and protocols design. He has published several papers on different international journals and conferences. He is an IEEE senior member since 2010 and is co-author of several books and chapter books on cellular systems. He worked in several national research projects (ANR\, RNRT\, URC competitivity cluster on cognitive radio\, FUI projects) and European research programs (ITEA). He investigated on 3G and 4G systems (scheduling\, radio resources management\, handover algorithms\, planning and dimensionning) in collaboration with several companies (Alcatel\, Nokia\, Orange\, SFR\, Bouygues Telecom\,TDF). He was also involved in standardization activites as a scientific consultant for companies such as EADS\, ESA and Airbus defence.In 2008/2008 (one year)\, 2010 (July-Aug) and 2011 (July-Aug)\, he was invited professor at NCRL (National mobile Communication Research Laboratory)\, in Nanjing. In December 2013 he became guest professor at SEU (South East University)\, Nanjing\, China. Since then\, he is regularly involved in common research cooperations with NCRL on IoT and 5G.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:502@lincs.fr DTSTART;TZID=Europe/Paris:20191009T103000 DTEND;TZID=Europe/Paris:20191009T120000 DTSTAMP:20191107T082842Z URL:https://www.lincs.fr/events/transformer-models-in-artificial-intellige nce-for-natural-language-processing/ SUMMARY:Transformer models in Artificial Intelligence for Natural Language Processing DESCRIPTION:\nWe'll explore recent Deep Learning models for Natural Language Processing based on the ("post-Recurrent Neural Network") \;Transformer \;architecture described in \;Attention Is All You Need \;(Vaswani \;et al.\, 2017). \;We'll understand the intuition behind this architecture and how it was applied to supervised Seq2Seq tasks. \;Then we'll see how Devlin \;et al. \;(2018) \;pre-trained a deep bidirectional transformer called \;BERT\, a model producing state-of-the-art results on several Natural Language Understanding tasks.If time permits\, we'll dig into derived models of transformer such as Open AI GPT-2 \;(Radford \;et al.\, \;2019). GPT-2 achieves \;astounding results in Natural Language Generation and has been reported as "the text generator performing too well to be released" in the press...\nSlides to the presentation\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:0,0 END:VEVENT BEGIN:VEVENT UID:498@lincs.fr DTSTART;TZID=Europe/Paris:20191002T103000 DTEND;TZID=Europe/Paris:20191002T120000 DTSTAMP:20191125T141945Z URL:https://www.lincs.fr/events/introduction-to-python/ SUMMARY:Introduction to Python DESCRIPTION:\nWe'll cover basics of Python and design aspects.\nDownload the notebook.\n CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:LINCS Meeting Room 26\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 26:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:497@lincs.fr DTSTART;TZID=Europe/Paris:20190925T150000 DTEND;TZID=Europe/Paris:20190925T163000 DTSTAMP:20190920T063408Z URL:https://www.lincs.fr/events/introduction-to-quantum-computing-2/ SUMMARY:Introduction to Quantum Computing (2) DESCRIPTION:\nWhen I was student\, I was interested in quantum optics: my first paper was about quantum non-linear optics. Quantum computing has become a new hype in telecommunication and computing. So I wanted to understand by myself how quantum computing works (thanks Wikipedia!). Starting with a reminder of quantum mechanics principles\, I will explain what is a "quantum computer"\, what are "qubits"\, "quantum registers"\, "quantum logical gates" and give some examples of "quantum algorithms" such as quantum "teleportation"\, Shor's algorithm for integer factorization and several other ones. I will also show how we can play with quantum computers (python libraries\, LaTeX packages\, web sites). In terms of knowledge requirement\, you just need to know a bit of linear algebra (calculation with square matrices on complex numbers) and accept the quantum physical rules as they are (maybe the most difficult aspect!): a quantum computer is just a system that processes unitary transformations on complex vectors (i.e.\, multiplications by unitary complex matrices)!\n\n\n\nThe material of the two sessions will be available at:\nhttp://www.ludovic-noirie.fr/sciences/quantum-computing/\n CATEGORIES:Network Theory LOCATION:LINCS Meeting Room 26\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 26:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:496@lincs.fr DTSTART;TZID=Europe/Paris:20190925T140000 DTEND;TZID=Europe/Paris:20190925T150000 DTSTAMP:20190930T103337Z URL:https://www.lincs.fr/events/distributed-reconfiguration-of-graph-probl ems/ SUMMARY:Distributed Reconfiguration of Graph Problems DESCRIPTION:\n In Graph Theory\, a reconfiguration problem is as following: given two solutions of a problem and a transition definition\, is there a path of acceptable solutions from the first to the second using a transition one after another? What is the length of the shortest reconfiguration path? What complexities are involved? For example\, a recoloration problem asks if we can go from a coloration to another\, by changing the color of a node at each transition (with the coloring still valid in the intermediate steps).In this talk\, the goal would be to consider distributed version of two reconfiguration problems: recoloring\, and reconfiguring independent sets. To parallelise the process\, we will accept to change the state of different nodes at once\, under certain hypothesis (for example\, we will recolor an independent set of nodes). The questions will be\, using the LOCAL model\, how much communication is needed (i.e. how much a node needs knowledge of its neighborhood) in order to produce a reconfiguration schedule of a given length.For the distributed recoloring (DISC 2019)\, we prove that the addition of colors for the intermediate steps is needed for some cases in order to have a solution. I will provide the analysis of trees\, where we want to go from a 3-coloring to another with the use of a 4th color. II will show that a constant schedule can be found after O(D+log* n) communications. For the reconfiguration of independent sets (ICALP 2019 Best Paper)\, we will present different transitions from the centralized settings\, to then justify the one we use. We prove that a constant schedule can be found after O(D +log* n) communications\, and a linear schedule can be found after a constant number of communications.\n\n\n\nThose works are the result of collaborations with Marthe Bonamy\, Keren Censor-Hillel\, Paul Ouvrard\, Jara Uitto and Jukka Suomela \n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:458@lincs.fr DTSTART;TZID=Europe/Paris:20190924T140000 DTEND;TZID=Europe/Paris:20190924T160000 DTSTAMP:20190930T065643Z URL:https://www.lincs.fr/events/thesis-defense-3/ SUMMARY:Thesis Defense : Resource management in computer clusters: algorithm design and performance analysis DESCRIPTION:\n\n\nThe growing demand for cloud-based services encourages operators to maximize resource efficiency within computer clusters. This motivates the development of new technologies that make resource management more flexible. However\, exploiting this flexibility to reduce the number of computers also requires efficient resource-management algorithms that have a predictable performance under stochastic demand. In this thesis\, we design and analyze such algorithms using the framework of queueing theory.\n\n\n\nOur abstraction of the problem is a multi-server queue with several customer classes. Servers have heterogeneous capacities and the customers of each class enter the queue according to an independent Poisson process. Each customer can be processed in parallel by several servers\, depending on compatibility constraints described by a bipartite graph between classes and servers\, and each server applies first-come-first-served policy to its compatible customers. We first prove that\, if the service requirements are independent and exponentially distributed with unit mean\, this simple policy yields the same average performance as balanced fairness\, an extension to processor-sharing known to be insensitive to the distribution of the service requirements. A more general form of this result\, relating order-independent queues to Whittle networks\, is also proved. Lastly\, we derive new formulas to compute performance metrics.\n\n\n\nThese theoretical results are then put into practice. We first propose a scheduling algorithm that extends the principle of round-robin to a cluster where each incoming job is assigned to a pool of computers by which it can subsequently be processed in parallel. Our second proposal is a load-balancing algorithm based on tokens for clusters where jobs have assignment constraints. Both algorithms are approximately insensitive to the job size distribution and adapt dynamically to demand. Their performance can be predicted by applying the formulas derived for the multi-server queue.\n\n\n\nRésumé :\n\n\n\nLa demande croissante pour les services de cloud computing encourage les opérateurs à optimiser l’utilisation des ressources dans les grappes d’ordinateurs. Cela motive le développement de nouvelles technologies qui rendent plus flexible la gestion des ressources. Cependant\, exploiter cette flexibilité pour réduire le nombre d’ordinateurs nécessite aussi des algorithmes de gestion des ressources efficaces et dont la performance est prédictible sous une demande stochastique. Dans cette thèse\, nous concevons et analysons de tels algorithmes en utilisant le formalisme de la théorie des files d’attente.\n\n\n\nNotre abstraction du problème est une file multi-serveur avec plusieurs classes de clients. Les capacités des serveurs sont hétérogènes et les clients de chaque classe entrent dans la file selon un processus de Poisson indépendant. Chaque client peut être traité en parallèle par plusieurs serveurs\, selon des contraintes de compatibilité décrites par un graphe biparti entre les classes et les serveurs\, et chaque serveur applique la politique premier arrivé\, premier servi aux clients qui lui sont affectés. Nous prouvons que\, si la demande de service de chaque client suit une loi exponentielle indépendante de moyenne unitaire\, alors la performance moyenne sous cette politique simple est la même que sous l’équité équilibrée\, une extension de processor-sharing connue pour son insensibilité à la loi de la demande de service. Une forme plus générale de ce résultat\, reliant les files order-independent aux réseaux de Whittle\, est aussi prouvée. Enfin\, nous développons de nouvelles formules pour calculer des métriques de performance.\n\n\n\nCes résultats théoriques sont ensuite mis en pratique. Nous commençons par proposer un algorithme d’ordonnancement qui étend le principe de round-robin à une grappe où chaque requête est affectée à un groupe d’ordinateurs par lesquels elle peut ensuite être traitée en parallèle. Notre seconde proposition est un algorithme de répartition de charge à base de jetons pour des grappes où les requêtes ont des contraintes d’affectation. Ces deux algorithmes sont approximativement insensibles à la loi de la taille des requêtes et s’adaptent dynamiquement à la demande. Leur performance peut être prédite en appliquant les formules obtenues pour la file multi-serveur.\n\n\n CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:493@lincs.fr DTSTART;TZID=Europe/Paris:20190919T140000 DTEND;TZID=Europe/Paris:20190919T150000 DTSTAMP:20190923T112429Z URL:https://www.lincs.fr/events/harnessing-the-difficulties-of-synchroniza tion/ SUMMARY:Harnessing the Difficulties of Synchronization DESCRIPTION:\n \n\n\n\nWe are well into the era of multi-core architectures and as the applications demands are still growing\, we soon expect to see the first many-cores which will feature many hundreds or thousands of cores.\nRefactoring software to introduce as much parallelism as possible is therefore of crucial importance in order to take advantage of the massively parallel nature of current and future multi-core and many-core machines. A major obstacle in this direction comes from the difficulty of achieving efficient synchronization and communication between threads that run concurrently. This lecture aims to alleviate this difficulty by presenting state-of-the-art synchronization mechanisms and highly-efficient fundamental concurrent data structures.\n\n\n\nBio\n\n\n\nPanagiota Fatourou is an Associate Professor of Computer Science at the University of Crete and at the Foundation of Research and Technology-Hellas (FORTH ICS)\, Greece. She has worked as a visiting Professor at EPFL in Switzerland\, as a full-time faculty member at the University of Ioannina in Greece\, and as a postdoc researcher at Max-Planck Institut fuer Informatik in Germany and at the University of Toronto in Canada. She is an elected member of the ACM Europe Council (currently serving as the treasurer) and an ACM Distinguished Speaker.\n\n\n\nShe has served as the editor of the Distributed Computing Column of the Bulletin of EATCS\, as the General Chair of ACM PODC 2013\, as the PC chair of OPODIS 2016 and SSS 2017 (distributed computing track)\, and as a member of the steering committees of PODC and OPODIS. She has participated in the PC of more than 35 conferences. She has been the coordinator of a Marie-Curie Initial Training Network and she has participated in many additional research and development projects mostly funded by the European Commission. Her research interests focuses on the theory of Parallel and Distributed Computing.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:469@lincs.fr DTSTART;TZID=Europe/Paris:20190918T140000 DTEND;TZID=Europe/Paris:20190918T150000 DTSTAMP:20190923T112451Z URL:https://www.lincs.fr/events/talk-by-lorenzo-maggi/ SUMMARY:Backtrack bandit algorithms for cloud computing DESCRIPTION:\nUnimodal functions arise whenever the expected value f(x) of the metric to be optimized has a single peak as a function of the available control variable x.\n\n\n\nThe exact shape of f is often not known in advance\, hence it can only be learned via sampling.\n\n\n\nFor this purpose\, we exploit the formalism of multi-armed bandits to design a learning algorithm that i) converges in probability to the optimal arm maximizing f and ii) does not require to know the learning horizon in advance\, i.e.\, it is “anytime”. Moreover\, it adapts naturally to the scenario where iii) prior knowledge on the location of the peak is available\, even if the prior is inaccurate.\n\n\n\nWe also present an efficient heuristic that can use explicitly the prior belief on the location of the optimal arm. We demonstrate the applicability of our approaches to a basic resource allocation problem for cloud computing\, where the orchestrator aims at adapting the resources allocated to a client to its unknown and dynamic requests.\n CATEGORIES:Seminars LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:494@lincs.fr DTSTART;TZID=Europe/Paris:20190918T103000 DTEND;TZID=Europe/Paris:20190918T120000 DTSTAMP:20190913T083939Z URL:https://www.lincs.fr/events/introduction-to-quantum-computing/ SUMMARY:Introduction to Quantum Computing DESCRIPTION:\nWhen I was student\, I was interested in quantum optics: my first paper was about quantum non-linear optics. Quantum computing has become a new hype in telecommunication and computing. So I wanted to understand by myself how quantum computing works (thanks Wikipedia!).Starting with a reminder of quantum mechanics principles\, I will explain what is a "quantum computer"\, what are "qubits"\, "quantum registers"\, "quantum logical gates" and give some examples of "quantum algorithms" such as quantum "teleportation"\, Shor's algorithm for integer factorization and several other ones.I will also show how we can play with quantum computers (python libraries\, LaTeX packages\, web sites).In terms of knowledge requirement\, you just need to know a bit of linear algebra (calculation with square matrices on complex numbers) and accept the quantum physical rules as they are (maybe the most difficult aspect!): a quantum computer is just a system that processes unitary transformations on complex vectors (i.e.\, multiplications by unitary complex matrices)!\n\n\n\nThe material of the two sessions will be available at:http://www.ludovic-noirie.fr/sciences/quantum-computing/\n CATEGORIES:Network Theory LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:470@lincs.fr DTSTART;TZID=Europe/Paris:20190904T140000 DTEND;TZID=Europe/Paris:20190904T150000 DTSTAMP:20190909T102717Z URL:https://www.lincs.fr/events/talk-by-giovanni-farina/ SUMMARY:Tractable reliable communication in static and dynamic compromised networks DESCRIPTION:\n\n\nMany solutions to fault tolerant distributed system problems\, such as state machine replication\, safe broadcast or agreement\, rely on reliable communication primitives which guarantee the correct messages exchange between processes even in case of failures.Although considering quite strong system assumptions (complete communication network\, digitally signed messages\, knowledge on communication network topology) a reliable communication service can be efficiently implemented\, especially under the message complexity point of view\, it may become intractable to provide under the weaker and more general assumption of an incomplete and unknown communication network.In this talk\, we review and improve the state-of-art solutions implementing reliable communication in multi-hop networks and we discuss their possible employment on dynamic networks.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:468@lincs.fr DTSTART;TZID=Europe/Paris:20190710T150000 DTEND;TZID=Europe/Paris:20190710T160000 DTSTAMP:20190715T110052Z URL:https://www.lincs.fr/events/talk-by-shirin-jalali/ SUMMARY:Towards theoretically-founded structure learning DESCRIPTION:\n Solving most inference tasks\, such as denoising and linear \;regression\, relies on exploiting the structure of the desired class of signals (e.g. images).  \;Traditionally\, such structures are discovered by \;domain experts after extensive studies.  \;This has to a great extent \;limited the discovery and application of complex structures that exist \;in many signals of interest. Learning-based methods that automatically \;recover the structure of the source from available training datasets \;provide a promising alternative solution.  \;However\, for \;continuous-valued signals\, learning the source distribution is extremely \;challenging\, and theoretically-founded computationally-feasible \;approaches are yet to be found.  \;In this talk\, I will discuss \;recently-proposed structure learning methods that\, instead of learning \;the full distribution of the source\, learn its key features that are \;relevant to solving inference problems.  \;As I will discuss\, this method\, \;while substantially reducing the computational complexity of the \;structure learning task\, leads to asymptotically optimal learning-based \;estimators.\n CATEGORIES:Seminars LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:462@lincs.fr DTSTART;TZID=Europe/Paris:20190710T140000 DTEND;TZID=Europe/Paris:20190710T150000 DTSTAMP:20190712T070440Z URL:https://www.lincs.fr/events/talk-by-ho-sui-wai/ SUMMARY:Channel Estimation in Visible Light Communications DESCRIPTION:\nIn visible light communications (VLC)\, LEDs are used for not only illumination but also communications. LEDs can further be used to support indoor positioning with high accuracy. Together with advantages such as high data rates\, free from radio frequency interference and energy efficiency\, VLC would be crucial for Internet-of-Things (IoT) applications as diverse as autonomous vehicles\, robotics &\; sensing and smart home &\; office. In the first part of this talk\, a brief overview of our visible light positioning systems for IoT applications will be given.\n\n\n\nIt is essential to obtain accurate estimates of the channel gains between receiver and multiple light sources in VLC networks. When there are multiple transmitters\, time-division multiple access (TDMA) is typically used in the channel estimation phase of radio frequency systems. However\, the estimation performance of TDMA-based schemes in VLC networks is substantially impacted by the maximum power constraint and desired average power constraint that are unique to visible light systems. Under these constraints\, this talk shows \;a fundamental lower bound on the total noise variance at the receiver. The necessary and sufficient conditions for the bound to hold with equality are derived. This talk also illustrates a one-to-one correspondence between a balanced incomplete block design and an optimal pilot design with minimal total noise variance. Methods for constructing pilot sequences\, which satisfy an arbitrary average power constraint\, are shown.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:457@lincs.fr DTSTART;TZID=Europe/Paris:20190703T140000 DTEND;TZID=Europe/Paris:20190703T150000 DTSTAMP:20190705T135530Z URL:https://www.lincs.fr/events/talk-by-wojciech-szpankowski/ SUMMARY:Structural and Temporal Information DESCRIPTION:\nShannon's information theory has served as a bedrock for advances in communication and storage systems over the past five decades. However\, this theory does not handle well higher order structures (e.g.\, graphs\, geometric structures)\, temporal aspects (e.g.\, real-time considerations)\, or semantics. We argue that these are essential aspects of data and information that underly a broad class of current and emerging data science applications.In this talk\, we present some recent results on structural and temporal information. We first show how to extract temporal information in dynamic networks (arrival of nodes) from its structure (unlabeled graphs).We then proceed to establish fundamental limits on information content for some data structures\, and present asymptotically optimal lossless compression algorithms achieving these limits for various graph models.\n\n\n\nBio\n\n\n\nWojciech Szpankowski is Saul Rosen Distinguished Professor of Computer Science at Purdue University where he teaches and conducts research in analysis of algorithms\, information theory\, analytic combinatorics\, network science\, random structures\, and stability problems of distributed systems.He held several Visiting Professor/Scholar positions\, including McGill University\, INRIA\, France\, Stanford\, Hewlett-Packard Labs\, Universite de Versailles\, University of Canterbury\, New Zealand\, Ecole Polytechnique\, France\, the Newton Institute\, Cambridge\, UK\, ETH\, Zurich\, and Gdansk University of Technology\, Poland.He delivered several plenary talks including at ISIT'11\, WITMSE'14\, CPM'15\, AofA16\, Knuth80'18\, and SODA'19. He has been on editorial boards on many journals including IEEE Trans. Information Theory\, TCS\, CPC\, and ACM Trans. on Algorithms.Szpankowski is a Fellow of IEEE\, and the Erskine Fellow.In 2010 he received the Humboldt Research Award and in 2015 the Inaugural Arden L. Bement Jr. Award.He published two books: "Average Case Analysis of Algorithms on Sequences"\, John Wiley &\; Sons\, 2001\, and "Analytic Pattern Matching: From DNA to Twitter"\, Cambridge\, 2015.In 2008 he launched the interdisciplinary Institute for Science of Information\, and in 2010 he became the Director of the NSF Science and Technology Center for Science of Information.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:466@lincs.fr DTSTART;TZID=Europe/Paris:20190626T150000 DTEND;TZID=Europe/Paris:20190626T160000 DTSTAMP:20190701T131047Z URL:https://www.lincs.fr/events/an-epidemiological-approach-to-security/ SUMMARY:Mirai and the Current State of IoT Security DESCRIPTION:\nThe Mirai botnet\, composed primarily of embedded and IoT devices\, took the Internet by storm in late 2016 when it overwhelmed and censored high-profile websites with the largest distributed denial-of-service (DDoS) attacks on public record. In this talk\, I'll present what actually happened based on a retrospective analysis by academic researchers\, the companies attacked\, and independent journalists\, as well discuss the current state of IoT deployment in homes. I'll cover how the botnet emerged\, what classes of devices were affected\, who the botnet attacked\, and how variants evolved and competed for vulnerable hosts. I'll also discuss the types of types of IoT devices we see deployed today and their security weaknesses that could lead to similar attacks in the future. I'll conclude with a discussion of the implications for the Internet community including IoT manufacturers\, network and site operators\, and policy makers. \n\n\n\nTags : Mirai and the Current State of IoT Security \, Zakir Durumeric\, Stanford University\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:456@lincs.fr DTSTART;TZID=Europe/Paris:20190626T140000 DTEND;TZID=Europe/Paris:20190626T150000 DTSTAMP:20190701T141611Z URL:https://www.lincs.fr/events/talk-by-kyle-jamieson/ SUMMARY:Leveraging Quantum Annealing for Large MIMO Processing in Centralized Radio Access Networks DESCRIPTION:\n\n\nConventional thinking treats the wireless channel as a given constraint\, so wireless networks to date center on the problem optimizing the communication endpoints. We instead explore whether it is possible to reconfigure the environment itself to facilitate wireless communication. In this work\, we instrument the environment with a large array of inexpensive antennas (LAIA) and design algorithms to configure them in real time. We design and deploy a 36-element passive array in a real indoor home environment. Experiments with this prototype show that\, by reconfiguring the wireless environment\, we can achieve a 24% TCP throughput improvement on average and a median improvement of 51.4% in Shannon capacity over the baseline single-antenna links. Over the baseline multi-antenna links\, LAIA achieves an improvement of 12.23% to 18.95% in Shannon capacity.\n\n\n\nUser demand for increasing amounts of wireless capacity continues to outpace supply\, and while 5G Massive MIMO wireless designs begin to address this\, even higher-performance systems now remain impractical largely only because their algorithms are extremely computationally demanding. The base station's computational capacity is thus becoming one of the key limiting factors on wireless capacity. I will discuss work in large MIMO centralized radio access network designs backed by quantum computation. We have implemented one such design\, QuAMax\, on the 2\,031 qubit D-Wave 2000Q quantum annealer\, the state-of-the-art in the field. Our experimental results evaluate that implementation on real and synthetic MIMO channel traces\, showing that 30 ?s of compute time on the 2000Q can enable 48 user\, 48 AP antenna BPSK communication at 20 dB SNR with a bit error rate of 1 ppm and a 1\,500 byte frame error rate of 0.01%.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:467@lincs.fr DTSTART;TZID=Europe/Paris:20190624T103000 DTEND;TZID=Europe/Paris:20190624T120000 DTSTAMP:20190619T111220Z URL:https://www.lincs.fr/events/introduction-to-the-k-nearest-neighbors-pr oblem/ SUMMARY:Introduction to the K-Nearest Neighbors problem DESCRIPTION:\nDefinition and motivation.Standard algorithms.A new approach. \n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I338 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I338 (3rd floor):geo:0,0 END:VEVENT BEGIN:VEVENT UID:464@lincs.fr DTSTART;TZID=Europe/Paris:20190619T150000 DTEND;TZID=Europe/Paris:20190619T160000 DTSTAMP:20220210T135715Z URL:https://www.lincs.fr/events/fine-grained-analysis-of-wireless-networks -spatial-outage-capacity-and-rate-control/ SUMMARY:Fine-grained analysis of wireless networks: Spatial outage capacity and rate control DESCRIPTION:\nModern wireless networks should be able to accommodate a high density of users. But serving more users usually generates higher interference which leads to more failed transmissions. This trade-off gives rise to a natural and fundamental question that surprisingly remained unanswered: What is the maximum density of concurrently active links that meet an outage (reliability) constraint? We answer this question by introducing a new notion of capacity\, termed spatial outage capacity (SOC). Using the mathematical tools from stochastic geometry\, we formulate and analyze the SOC based on the meta distribution framework which allows us to evaluate per-link reliability in a wireless network. We also prove the duality between the per-link reliability and the rate control\, where the latter offers a key advantage of guaranteeing target reliability for each link in the network.\n\n\n\nTags : Fine-grained analysis of wireless networks: Spatial outage capacityand rate control \, Sanket Kalamkar\, Inria\, ERC NEMO\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:461@lincs.fr DTSTART;TZID=Europe/Paris:20190619T140000 DTEND;TZID=Europe/Paris:20190619T150000 DTSTAMP:20190712T080802Z URL:https://www.lincs.fr/events/talk-by-derya-malak/ SUMMARY:Function Computation in Networks DESCRIPTION:\n This talk describes a new perspective on cloud/fog computing\, by distributing computation in order to handle the large volume of data with growing computational demand. Our goal is to devise coding techniques for functional compression in networks\, by employing the concepts of graph entropy\, common information\, and exploiting function surjectivity and role of a helper in encoding of functions. These techniques suit different applications such as caching\, classification\, federated learning\, quantization\, and compressed sensing. Our unified insights suggest to distribute computation by making use of underlying redundancy both in data and functions\, in order to recover a sparse representation\, or labeling.\n\n\n\n\n\n\n\nTags: Function Computation in Networks \, Derya Malak \, MIT \, \n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:465@lincs.fr DTSTART;TZID=Europe/Paris:20190617T103000 DTEND;TZID=Europe/Paris:20190617T120000 DTSTAMP:20190612T083944Z URL:https://www.lincs.fr/events/learning-regular-sets-from-queries-and-cou nterexamples/ SUMMARY:Learning regular sets from queries and counterexamples DESCRIPTION:\nThe problem of identifying an unknown regular set from examples of its members and nonmembers is addressed. It is assumed that the regular set is presented by a minimally adequate Teacher\, which can answer membership queries about the set and can also test a conjecture and indicate whether it is equal to the unknown set and provide a counterexample if not. (A counterexample is a string in the symmetric difference of the correct set and the conjectured set.) A learning algorithm L* is described that correctly learns any regular set from any minimally adequate Teacher in time polynomial in the number of states of the minimum dfa for the set and the maximum length of any counterexample provided by the Teacher. It is shown that in a stochastic setting the ability of the Teacher to test conjectures may be replaced by a random sampling oracle\, EX( ). A polynomial-time learning algorithm is shown for a particular problem of context-free language identification.\n\n\n\nReference: Learning regular sets from queries and counterexamples (Dana Angluin\, 1987)\n\n\n\n \n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:492@lincs.fr DTSTART;TZID=Europe/Paris:20190612T180000 DTEND;TZID=Europe/Paris:20190612T183000 DTSTAMP:20190806T140530Z URL:https://www.lincs.fr/events/stable-coin/ SUMMARY:Stable Coin DESCRIPTION:\nTags: Stable Coin \, Nadia Filali \, Caisse des dépôts \n\n\n\nSlides Marianna Belotti &\; Nadia Filali - Stable Coin\, Caisse des dépôtsDownload\n CATEGORIES:BlockChain Day,Workshop LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:491@lincs.fr DTSTART;TZID=Europe/Paris:20190612T174500 DTEND;TZID=Europe/Paris:20190612T180000 DTSTAMP:20190808T104815Z URL:https://www.lincs.fr/events/cooperative-games-for-atomic-crosschain-sw aps/ SUMMARY:Cooperative games for Atomic Crosschain Swaps DESCRIPTION:\nTags: Cooperative games for Atomic Crosschain Swaps \, Marianna Belotti \, CNAM \, Caisse des Dépots \, Sorbonne-Université \, Dauphine\n\n\n\nSlides Marianna Belotti - Cooperative games for Atomic Crosschain SwapsDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:490@lincs.fr DTSTART;TZID=Europe/Paris:20190612T173000 DTEND;TZID=Europe/Paris:20190612T174500 DTSTAMP:20190806T134227Z URL:https://www.lincs.fr/events/blockchains-and-applications-to-the-smart- grids/ SUMMARY:Blockchains and applications to the smart grids DESCRIPTION:\nTags : Blockchains and applications to the smart grids \, José Horta \, Telecom Paris &\; EDF \, BlockchainDay\n\n\n\nSlides Jose Horta - Blockchains and applications to the smart gridsDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:489@lincs.fr DTSTART;TZID=Europe/Paris:20190612T171500 DTEND;TZID=Europe/Paris:20190612T173000 DTSTAMP:20190806T133542Z URL:https://www.lincs.fr/events/polygraph-accountable-byzantine-agreement/ SUMMARY:Polygraph : Accountable Byzantine Agreement DESCRIPTION:\nPolygraph Accountable Byzantine Agreement \, Pierre Civit \, Nexeo \, BlockChainDay \n\n\n\nSlides Pierre Civit - PolygraphDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:488@lincs.fr DTSTART;TZID=Europe/Paris:20190612T170000 DTEND;TZID=Europe/Paris:20190612T171500 DTSTAMP:20190806T132434Z URL:https://www.lincs.fr/events/stakecube-combining-sharding-and-proof-of- stake-to-build-fork-free-secure-permissionless-distributed-ledgers/ SUMMARY:Stakecube: Combining Sharding and Proof-of-Stake to build Fork- free Secure Permissionless Distributed Ledgers DESCRIPTION:\nTags: Stakecube: Combining Sharding and Proof-of-Stake to build Fork- free Secure Permissionless Distributed Ledgers \, Antoine Durand \, IRT SystemX \, BlockchainDay\n\n\n\nSlides Antoine Durand - StakecubeDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:487@lincs.fr DTSTART;TZID=Europe/Paris:20190612T164500 DTEND;TZID=Europe/Paris:20190612T170000 DTSTAMP:20190806T131928Z URL:https://www.lincs.fr/events/non-cooperative-games-and-bft-based-blockc hains/ SUMMARY:Non cooperative games and BFT-based blockchains DESCRIPTION:\nNon cooperative games and BFT-based blockchains \, Yackolley Amoussou-Guenou \, Sorbonne-Université CEA \, BlockChainDay \n\n\n\nSlides Yackolley Amoussou-Guenou - Non cooperative games and BFT-based blockchainsDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:486@lincs.fr DTSTART;TZID=Europe/Paris:20190612T163000 DTEND;TZID=Europe/Paris:20190612T164500 DTSTAMP:20190806T131001Z URL:https://www.lincs.fr/events/g-iota-e-iota/ SUMMARY:G-IOTA & E-IOTA DESCRIPTION:\nTags: Bu Gewu \, Sorbonne Université \, Lip6 \, UPMC \, G-IOTA &\; E-IOTA \, BlockChain Day \n\n\n\nSlides Gewu Bu - G-IOTA &\; E-IOTADownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:485@lincs.fr DTSTART;TZID=Europe/Paris:20190612T160000 DTEND;TZID=Europe/Paris:20190612T163000 DTSTAMP:20190801T134029Z URL:https://www.lincs.fr/events/game-theoretical-analysis-of-competition-b etween-miners/ SUMMARY:Game theoretical analysis of competition between miners DESCRIPTION:\nTags: Game theoretical analysis of competition between miners\, Eitan Altman\, Inria\, BlockChain Day\n\n\n\nSlides Eitan Altman - Game theoretical analysis of competition between minersDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:484@lincs.fr DTSTART;TZID=Europe/Paris:20190612T153000 DTEND;TZID=Europe/Paris:20190612T160000 DTSTAMP:20190801T125401Z URL:https://www.lincs.fr/events/green-mining-toward-a-less-energetical-imp act-of-cryptocurrencies/ SUMMARY:Green Mining\, Toward a less energetical impact of cryptocurrencies DESCRIPTION:\nTags: Green Mining\, Toward a less energetical impact of cryptocurrencies\, Philippe Jacquet\, Nokia Bell Labs France\, BlockChain Day\n\n\n\nSlides Philippe Jacquet - Green Mining\, Toward a less energetical impact of cryptocurrenciesDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:483@lincs.fr DTSTART;TZID=Europe/Paris:20190612T150000 DTEND;TZID=Europe/Paris:20190612T153000 DTSTAMP:20190801T121305Z URL:https://www.lincs.fr/events/blockchain-communication-protocol/ SUMMARY:Blockchain Communication Protocol DESCRIPTION:\nTags: Antoine Herzog &\; Karim Ganem\, Blockchain Communication Protocol\, IOV\n\n\n\nSlides Antoine Herzog &\; Karim Ganem - Blockchain Communication ProtocolDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:482@lincs.fr DTSTART;TZID=Europe/Paris:20190612T143000 DTEND;TZID=Europe/Paris:20190612T150000 DTSTAMP:20190801T120732Z URL:https://www.lincs.fr/events/analysis-of-financial-transactions-with-li nk-streams/ SUMMARY:Analysis of financial transactions with link streams DESCRIPTION:\nTags: Analysis of financial transactions with link streams\, Matthieu Latapy\, Sorbonne Université\, UPMC\, Lip6\, BlockChainDay\n\n\n\nSlides Matthieu Latapy - Analysis of financial transactions with link streamsDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:481@lincs.fr DTSTART;TZID=Europe/Paris:20190612T140000 DTEND;TZID=Europe/Paris:20190612T143000 DTSTAMP:20190801T105735Z URL:https://www.lincs.fr/events/iota/ SUMMARY:IOTA DESCRIPTION:\nTags: IOTA\, Quentin Bramas\, Université de Strasbourg\, BlockChain Day\n\n\n\nSlides Quentin Bramas - IOTADownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:480@lincs.fr DTSTART;TZID=Europe/Paris:20190612T134500 DTEND;TZID=Europe/Paris:20190612T141500 DTSTAMP:20190801T103444Z URL:https://www.lincs.fr/events/lightning-networks/ SUMMARY:Lightning Networks DESCRIPTION:\nSlides Bastien Teinturier - Lightning NetworksDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:478@lincs.fr DTSTART;TZID=Europe/Paris:20190612T130000 DTEND;TZID=Europe/Paris:20190612T133000 DTSTAMP:20190801T103901Z URL:https://www.lincs.fr/events/sycomore/ SUMMARY:Sycomore DESCRIPTION:\nTag: Sycomore\, Emmanuelle Anceaume\, CNRS\, Irisa Rennes\, BlockChain Day\n\n\n\n Slides Emmanuelle Anceaume - SycomoreDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:476@lincs.fr DTSTART;TZID=Europe/Paris:20190612T120000 DTEND;TZID=Europe/Paris:20190612T123000 DTSTAMP:20190801T104322Z URL:https://www.lincs.fr/events/veolia-blockchain-projects/ SUMMARY:Veolia blockchain projects DESCRIPTION:\nVeolia blockchain projects\, Olivier Tridon\, Véolia\n\n\n\nSlides Olivier Tridon - Veolia blockchain projectsDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:477@lincs.fr DTSTART;TZID=Europe/Paris:20190612T120000 DTEND;TZID=Europe/Paris:20190712T123000 DTSTAMP:20190801T104411Z URL:https://www.lincs.fr/events/lifestyle-authentication/ SUMMARY:Lifestyle Authentication DESCRIPTION:\nTags : Lifestyle Authentification\, Rie Yamaguchi\, Tokyo University\, Université de Tokyo\, Blockchain Day\n\n\n\nSlides Rie Yamaguchi - Lifestyle AuthenticationDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:475@lincs.fr DTSTART;TZID=Europe/Paris:20190612T113000 DTEND;TZID=Europe/Paris:20190612T120000 DTSTAMP:20190801T105002Z URL:https://www.lincs.fr/events/multi-signatures-for-blockchains/ SUMMARY:Multi Signatures for Blockchains DESCRIPTION:\nTags: Multi Signatures for Blockchains\, Yannick Seurin\, ANSSI\, BlockChain Day\n\n\n\nSlides Yannick Seurin - Multi-Signatures for BlockchainsDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:473@lincs.fr DTSTART;TZID=Europe/Paris:20190612T103000 DTEND;TZID=Europe/Paris:20190612T110000 DTSTAMP:20190801T104631Z URL:https://www.lincs.fr/events/blockchain-abstract-data-type/ SUMMARY:Blockchain Abstract Data Type DESCRIPTION:\nTags : Blockchain Abstract Data Type\, Antonella de Pozzo\, CEA\n\n\n\nSlides Antonella del Pozzo - Abstract Data TypeDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:474@lincs.fr DTSTART;TZID=Europe/Paris:20190612T101500 DTEND;TZID=Europe/Paris:20190612T104500 DTSTAMP:20190801T104802Z URL:https://www.lincs.fr/events/the-consensus-number-of-a-cryptocurrency/ SUMMARY:The Consensus Number of a Cryptocurrency DESCRIPTION:\nTags : The Consensus Number of a Cryptocurrency\, Petr Kouznetsov\, Telecom Paris\, BlockChain Day\n\n\n\nSlides Petr Kouznetsov - The Consensus Number of a CryptocurrencyDownload\n CATEGORIES:BlockChain Day,Other Worshops,Workshop,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:472@lincs.fr DTSTART;TZID=Europe/Paris:20190612T100000 DTEND;TZID=Europe/Paris:20190612T103000 DTSTAMP:20190801T104917Z URL:https://www.lincs.fr/events/dissection-of-a-public-blockchain-in-banqu e-de-france/ SUMMARY:Dissection of a public Blockchain in Banque de France DESCRIPTION:\nTags: BlockChain Day\, Jean-Baptiste Baraton\, Banque de France\, Dissection of a public Blockchain in Banque de France\n CATEGORIES:BlockChain Day,Other Worshops,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:471@lincs.fr DTSTART;TZID=Europe/Paris:20190612T091500 DTEND;TZID=Europe/Paris:20190612T100000 DTSTAMP:20190719T110941Z URL:https://www.lincs.fr/events/cross-chain-deals-and-adversarial-commerce / SUMMARY:Cross chain Deals and Adversarial Commerce DESCRIPTION:\n\n CATEGORIES:BlockChain Day,Other Worshops,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:463@lincs.fr DTSTART;TZID=Europe/Paris:20190612T090000 DTEND;TZID=Europe/Paris:20190612T183000 DTSTAMP:20190808T105057Z URL:https://www.lincs.fr/events/blockchain-day/ SUMMARY:Blockchain Day DESCRIPTION:\nProgram\n\n\n\n9:00 Reception 9:15-9:20 Opening (Fabio + Maria) 9:20-10:00 Maurice Herlihy (Brown University) Cross-chain Deals and Adversarial Commerce 10:00-10:20 Jean-Baptiste Baraton (Banque de France) Dissection of a public blockchain in Banque de France 10:20-10:40 Petr Kouznetsov (Telecom Paris) The Consensus Number of a Cryptocurrency 10:40-11:00 Antonella del Pozzo (ex Sorbonne - CEA) Blockchain abstract data type 11:10-11:20 Coffee Break 11:20-11:40 11:40-12:00 Yannick Seurin (ANSSI) Crypto tools for Blockchains 12:00-12:20 Olivier Tridon (Veolia Nova) Veolia blockchain projects 12:20-12:40 Rie Yamaguchi (Tokyo University) Lifestyle Authentication 12:40-13:30 Lunch Buffet 13:30-13:50 Emmanuelle Anceaume (CNRS&\;Irisa Rennes) Sycomore 13:50-14:10 Bastien Teinturier (ACINQ) Lightning Networks 14:10-14:30 Quentin Bramas (Université de Strasbourg) IOTA 14:30-14:50 Matthieu Lattapy (CNRS/Lip6) Analysis of financial transactions with link streams 14:50-15:00 Coffee Break 15:00-15:20 Philippe Jacquet (Nokia Bell Labs) Green Mining: Toward a less energetical impact of cryptocurrencies 15:20-16:00 Antoine Herzog &\; Karim Ganem (IOV) BlockChain Communication Protocol 16:00-16:20 Eitan Altman (Inria) Game theoretical analysis of competition between miners 16:20-16:30 Break 16:30-16:45 Gewu Bu (SU/Lip6) G-IOTA &\; E-IOTA: Improvements of IOTA 16:45-17:00 Yackolley Amoussou-Guenou (SU&\;CEA Non cooperative games and BFT-based blockchains 17:00-17:15 Antoine Durand (IRT SystemX) Stakecube: Combining Sharding and Proof-of-Stake to build Fork-free Secure Permissionless Disistributed Ledgers 17:15-17:30 Pierre Civit (Nexeo) Polygraph 17:30-17:45 Jose Horta (Telecom Paris) Blockchain and Electrical Networks 17:45-18:00 Marianne Bellotti (CNAM&\;CDD&\;SU&\;Dauphine) Cooperative games for Atomic Crosschain Swaps 18:00-18:20 Nadia Filali (Caisse des dépôts) Stable Coin \n CATEGORIES:BlockChain Day,Other Worshops,Workshop LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:460@lincs.fr DTSTART;TZID=Europe/Paris:20190605T140000 DTEND;TZID=Europe/Paris:20190605T150000 DTSTAMP:20190620T120629Z URL:https://www.lincs.fr/events/transparent-remote-connectivity-to-short-r ange-iot-devices/ SUMMARY:Transparent remote connectivity to short-range IoT devices DESCRIPTION:\n Short-range wireless communication technologies such as Bluetooth or ZigBee represent an important part of the Internet of Things ecosystem.By design\, this category of smart devices has physically limited reachability inside their Wireless Personal Area Network (WPAN) and are not directly compatible with the TCP/IP stack.However\, users may need to access them from anywhere at any moment.To address this problem\, we design a new application-agnostic approach called RCM (Remote Connection Manager) enabling transparent communication between an application and out-of-range devices.It creates new IoT use cases by seamlessly mixing remote and local devices.We implemented an open-source prototype for Bluetooth Low Energy (BLE) technology on top of Linux and Android BLE stacks and demonstrated its efficiency through experiments performed on real devices. \n\n\n\nTags : Transparent remote connectivity to short-range IoT devices\, Natalya Rozhnova\, Nokia Bell Labs France\, IoT\, no video\n CATEGORIES:Seminars LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:455@lincs.fr DTSTART;TZID=Europe/Paris:20190529T140000 DTEND;TZID=Europe/Paris:20190529T150000 DTSTAMP:20190604T105550Z URL:https://www.lincs.fr/events/talk-by-ahmad-alammouri/ SUMMARY:Stability and Metastability of Traffic Dynamics in Uplink Random Access Networks DESCRIPTION:\n\n\nThis talk is about the characterization of the stability\, metastability\, and the stationary regime of traffic dynamics in a single-cell uplink wireless system. The traffic is represented in terms of spatial birth-death processes\, in which users arrive as a Poisson point process in time and space\, each with a file to transmit to the base station. The service rate of each user is based on its signal to interference plus noise ratio (SINR)\, where the interference is from other active users in the cell. Once the file is fully transmitted\, the user leaves the cell. We derive the necessary and sufficient condition for network stability\, which is independent of the specific path loss function as long as it satisfies mild boundedness conditions. A novel observation\, shown through mean-field analysis and simulations\, is that for a certain range of arrival rates\, the network appears stable for possibly a long time\, but can suddenly become unstable. This property is called metastability which is widely known in statistical physics but rarely observed in wireless communication. Finally\, using mean-field analysis\, we propose a heuristic characterization of the network steady-state regime when it exists\, and demonstrate that it is tight for the whole range of arrival rates. \;\n\n\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:459@lincs.fr DTSTART;TZID=Europe/Paris:20190520T103000 DTEND;TZID=Europe/Paris:20190520T120000 DTSTAMP:20190520T104331Z URL:https://www.lincs.fr/events/manipulating-and-analyzing-data-with-panda s/ SUMMARY:Manipulating and analyzing data with pandas DESCRIPTION:\n\n\nThe Python Data Analysis Library (pandas) provides data structures and tools for manipulating and analyzing data. It is built on top of NumPy\, the core package for numerical computations in the Scientific Computing Tools for Python (SciPy) ecosystem. The objective of this presentation is threefold: explain when one can benefit from using pandas\, describe its fundamental data structures\, and give an overview of the data analysis tools it provides.\n\n\n\nSlides :Download\n\n\n\nNotebook : https://gist.github.com/ccomte/41b78e562552db683b1d855629afc9e0.\n CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:452@lincs.fr DTSTART;TZID=Europe/Paris:20190515T140000 DTEND;TZID=Europe/Paris:20190515T150000 DTSTAMP:20190527T094700Z URL:https://www.lincs.fr/events/talk-by-nesrine-ammar/ SUMMARY:Real-time identification of IoT device types DESCRIPTION:\n\n\nIdentifying IoT devices types as they connect to the network enables better devices and services management. However\, real-time identification is very challenging in such heterogeneous environments. We present a real-time classification approach\, based on network features that are extracted both from network communication characteristics and from packets payload\, to discriminate device types. Our solution automatically identifies a newly connected device to the home network. Furthermore\, we evaluate the performance of our method using a representative and heterogeneous real IoT devices set.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:451@lincs.fr DTSTART;TZID=Europe/Paris:20190424T140000 DTEND;TZID=Europe/Paris:20190424T150000 DTSTAMP:20190510T131644Z URL:https://www.lincs.fr/events/talk-by-peter-marbach/ SUMMARY:Community Structures in Social (Information) Networks DESCRIPTION:\n Communities play an important role in social networks. However while there exists a large body of work that formally models and studies macroscopic properties of social networks such as the degree distribution and diameter\, less work is available on mathematical models for microscopic properties of communities in social networks. Creating such a model is the topic of this paper. Ideally this model should be simple enough to allow a formal analysis\, yet be expressive enough to provide insights into important microscopic properties of communities in social networks. For the talk we focus on a particular type of social networks\, to which we refer to as information networks\, where agents (individuals) share/exchange information. Sharing/exchanging of information is an important aspect of the social networks\, both for social networks that we form in our everyday lives\, as well as for online social networks such as for example Twitter. The model that we use to characterize information networks has three important components: 1) the space of content that is being produced and consumed in the\, 2) agent's interests and ability to produce content\, and 3) the utility that agents obtain for consuming and producing content. An interesting outcome of the analysis of this model is that albeit being very simple\, indeed seems to be able to provide interesting insights into the microscopic structure of information communities. For example\, the characterization of how content is being produced\, i.e. which content each agent in a community produces\, indeed matches what has been experimentally observed in real-life social networks. It also provides insight into how to design efficient community detection algorithm.\n\n\n\nBio: \; \n\n\n\nPeter \;Marbach \;was born in Lucerne\, Switzerland. He received the Eidg. Dipl. El.-Ing. (1993) from the ETH Zurich\, Switzerland\, the M.S. (1994) in electrical engineering from the Columbia University\, NY\, U.S.A\, and the Ph.D. (1998) in electrical engineering from the Massachusetts Institute of Technology (MIT)\, Cambridge\, Massachusetts\, U.S.A. He has been since 2000 with the Department of Computer Science of the University of Toronto. He has also been a visiting professor at Microsoft Research\, Cambridge\, UK\, at the Ecole Polytechnique Federal at Lausanne (EPFL)\, Switzerland\, and at the Ecole Normale Supérieure\, Paris\, France\, and a post-doctoral fellow at Cambridge University\, UK.His research interests are in the fields of communication networks\, in particular in the area of wireless networks\, peer-to-peer networks\, and social networks. \n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:450@lincs.fr DTSTART;TZID=Europe/Paris:20190417T140000 DTEND;TZID=Europe/Paris:20190417T150000 DTSTAMP:20190423T135836Z URL:https://www.lincs.fr/events/talk-by-gewu-bu/ SUMMARY:Communication Modeling in Wireless Body Area Networks (WBAN) DESCRIPTION:\n Wireless body area network has received a lot of attention in the medical monitoring domain because of its wireless convenience. Considering the safety of user\, the energy saving of WBAN devices\, the signals occlusion from human body and the effects of human mobility on the connection between sensors\, efficient and secure communication is still a challenge for intra WBAN communication. \;In this talk\, we will present the basic model of the WBAN system we studied and its performance analysis. From that\, we propose a Continuous-time Markov chain based model representing the broadcast communication in WBAN. This model allow us compute varying kinds of performances of WBAN system. In addition\, we expand WBAN system to a theoretical model\, and we studied efficient broadcasting with the help of Labelling scheme. \n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:453@lincs.fr DTSTART;TZID=Europe/Paris:20190417T103000 DTEND;TZID=Europe/Paris:20190417T113000 DTSTAMP:20190423T122734Z URL:https://www.lincs.fr/events/combatting-toxicity-in-on-line-conversatio ns/ SUMMARY:Combatting toxicity in on-line conversations DESCRIPTION:\nAbusive behaviour in online social media platforms \;(a.k.a. hate speech\, toxicity\, cyberbullying) \;has forced major companies to \;hire hundreds of moderators\, or even \;buy a whole company \;to deal with the problem. Toxicity detection (i.e.\, classify a post as toxic or not) has recently gained popularity\, with two very successful \;workshops \;being organized and an \;international challenge \;attracting thousands of systems. In previous work\, it was shown that Recurrent Neural Networks (RNNs) achieve state of the art performance for the task of automatic toxicity detection \;(Pavlopoulos et al. 2017a)\, while incorporating classification-specific attention mechanisms and user embeddings improved further the overall performance of the RNNs (Pavlopoulos et al. 2017b). \;Interestingly\, the classification-specific attention mechanism highlights suspicious words for free\, without including highlighted words in the training data (Pavlopoulos et al. 2017c). \;Despite this recent work\, toxicity detection systems suffer from two major shortcomings. First\, although most abusive posts appear within conversations (e.g.\, utterances\, posted as replies to other posted utterances)\, the structure of the conversation is currently ignored and systems are solely based on the text of each single post\, in isolation\, for their decisions. \;Second\, systems only detect abusive posts\; that is\, current technology does not help users modify their posts themselves to avoid being abusive. Such systems are primarily used to censor online conversations on a platform\, which often results in abusive users migrating to another platform (Chandrasekharan et al. 2018). \;Instead\, it has been argued\, in both academic (Zhang et al. 2018) \;and \;industrial \;circles that a more fruitful approach is to help users improve their posts in on-line conversations (e.g.\, by suggesting non-abusive rewrites). \;To address the first problem current research investigates a) the compilation of taxonomies of context-aware toxicity and b) the creation of datasets of toxic utterances (context aware). To address the second \;problem \;we investigate the creation of datasets with \;annotations on the word level to study deeper the various forms of toxicity and \;the difficulty of its rephrasing.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:454@lincs.fr DTSTART;TZID=Europe/Paris:20190415T103000 DTEND;TZID=Europe/Paris:20190415T120000 DTSTAMP:20191125T142811Z URL:https://www.lincs.fr/events/introduction-to-conda-and-jupyter-notebook s/ SUMMARY:Introduction to Conda and Jupyter notebooks DESCRIPTION:\nIn this tutorial\, we will see how to install the conda package manager and use it to create a Jupyter environment. We’ll then go through various aspects of the Jupyter notebooks among which: useful features\, notebook extensions\, fundamental keyboard shortcuts and use on distant machines (AWS or Hyperion).Prerequisite: your computer.\nLink to the notebook.\n CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:449@lincs.fr DTSTART;TZID=Europe/Paris:20190410T140000 DTEND;TZID=Europe/Paris:20190410T150000 DTSTAMP:20190418T134857Z URL:https://www.lincs.fr/events/hackathon-report-2/ SUMMARY:Hackathon Report DESCRIPTION:\nOn March 27th 2019\, students from LINCS hosted a Hackathon session on public data. The event gathered 20 participants from various institutions.\n\n\n\nIn this talk\, emceed by Celine Comte and Nathan de Lara\, participants will present their findings.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:445@lincs.fr DTSTART;TZID=Europe/Paris:20190408T090000 DTEND;TZID=Europe/Paris:20190408T180000 DTSTAMP:20190404T070047Z URL:https://www.lincs.fr/events/journee-dexpose-inria-imt-sur-les-reseaux- de-communication-radio/ SUMMARY:Journée d'exposé Inria-IMT sur les réseaux de communication radio DESCRIPTION:\n\n\n09:30-10:15  \; L. DecreusefondBreak10:30-11:15  \; B. BlaszczyszynBreak11:30-12:15  \; M. Coupechoux\n\n\n\n12:15-14:00  \;  \;  \; Lunch break\n\n\n\n14:00-14:45  \; S. KalamkarBreak15:00-15:45  \; P. MartinsBreak16:00-16:45  \; F. BaccelliDiscussion\n\n\n CATEGORIES:Other Worshops,Workshop LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:442@lincs.fr DTSTART;TZID=Europe/Paris:20190403T140000 DTEND;TZID=Europe/Paris:20190403T150000 DTSTAMP:20190418T135027Z URL:https://www.lincs.fr/events/talk-by-diego-kiedanski/ SUMMARY:The effect of ramp constraints on coalitional storage games DESCRIPTION:\n Energy storage systems (ESS) are envisaged as a solution to a vast number of problems in Smart Grids\, yet their prices are hindering a massive adoption at residential level. To facilitate such massive deployments\, we propose the shared investment in a battery among a group of consumers. This is achieved by modeling the investment problem using cooperative game theory. For an extensive class of relevant games\, we provide theoretical results guaranteeing the existence of a non-empty core\, i.e.\, a set of payoffs across consumers that are stable against the formation of sub-coalitions. \n\n\n\nTags: The effect of ramp constraints on coalitional storage games\, Diego Kiedanski\, Telecom ParisTech\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:448@lincs.fr DTSTART;TZID=Europe/Paris:20190403T103000 DTEND;TZID=Europe/Paris:20190403T120000 DTSTAMP:20190401T112314Z URL:https://www.lincs.fr/events/organizing-a-python-package-with-cookiecut ter/ SUMMARY:Organizing a Python Package with Cookiecutter DESCRIPTION:\nIn this tutorial\, we will see how to create and maintain a Python package\, especially relying on Cookiecutter\, by Audrey Roy Greenfeld\, and PyCharm. Even for those who do not plan to create packages in a near future\, this tutorial is useful to learn how to structure a Python project\, document it with Sphinx\, test it with doctest\, etc. Reference: https://my-toy-package.readthedocs.io/ . Prerequisite: your computer + a Python distribution (e.g. Anaconda) + PyCharm.\n CATEGORIES:Tools, Tips and Tricks,Working Group LOCATION:Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:444@lincs.fr DTSTART;TZID=Europe/Paris:20190401T103000 DTEND;TZID=Europe/Paris:20190401T120000 DTSTAMP:20190328T072351Z URL:https://www.lincs.fr/events/efficient-production-of-training-data-for- classification-supervised-learning/ SUMMARY:Efficient Production of Training Data for Classification Supervised Learning DESCRIPTION:\n\n\nSupervised learning relies on the existence of training data\, typically labeled by human experts. The size and quality of this data has a critical impact on the quality of the learned inferred function. But human experts are expensive. We consider the particular case of a classification problem. At each question\, an expert is given two elements and tells whether they belong to the same class\, with a small probability of error. We propose a scheme ensuring the quality of the final classification while minimizing the number of questions asked to the experts.\n\n\n CATEGORIES:Network Theory,Working Group LOCATION:LINCS Meeting Room 26\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 26:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:434@lincs.fr DTSTART;TZID=Europe/Paris:20190321T140000 DTEND;TZID=Europe/Paris:20190321T160000 DTSTAMP:20190418T071406Z URL:https://www.lincs.fr/events/thesis-defense/ SUMMARY:Thesis Defense : Smart grid-aware radio engineering in 5G mobile networks DESCRIPTION:\n The energy demand in mobile networks is increasing due to the emergence of new technologies and new services with higher requirements (data rates\, delays\, etc). In this context\, the Mobile Network Operator (MNO) has to provide more radio and processing resources in its network leading for higher financial costs. The MNO has no choice but to implement energy saving strategies in all the parts of its infrastructure and especially at the Radio Access Network (RAN).At the same time\, the electrical grid is getting smarter including new functionalities to balance supply and demand by varying the electricity prices\, allowing some aggregators to be part of the supply process and signing demand response agreements with its clients. In the context of reliable smart grid\, the MNO having thousands of evolved NodeB (eNB) spread over all the country\, has to play major role in the grid by acting as a prosumer able to sell electricity. In African Sub-Saharan countries however\, the grid may be not reliable or even non existent\, the MNO has no choice but to deploy a Virtual Power Plant (VPP) and rely partially or totally on it.In this thesis\, we study the interactions between the network operator and the grid either reliable or not in both developed and developing countries. We investigate both long term and short term optimal energy related management\, with the aim of minimising the operator's Total Cost of Ownership (TCO) for energy per base station which is the sum of its Capital Expenditure (CAPEX) and Operational Expenditure (OPEX) while satisfying the growing needs of its user traffic in the cell.The long term study enables us to make semestral based investment decisions for the battery and renewable energy sources dimensioning considering equipment performance degradation\, predictions on users traffic growth and electricity market evolution over a long period of time counted in years. \; \;In the case of being powered by a reliable smart grid\, the short term policy helps the operator to set on a daily basis\, an optimal battery management strategy by performing electricity arbitrage or trading that takes advantage of the electricity prices hourly fluctuations in order to minimize the MNO daily energy bill while respecting some rules on the usage of its equipments. \;In the case of a non reliable or off-grid environment\, the operator is powered by hybrid sources coupling storage\, diesel generators\, solar power and the grid if the latter is operational. Here\, we define a fixed order of priority on the use of these sources that extends the battery lifetime and maintain its performance. \n\n\n\nTags: Thesis Defense : Smart grid-aware radio engineering in 5G mobile networks\, Wael Labidi\, Telecom SudParis\, IMT\, Samovar\n CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:440@lincs.fr DTSTART;TZID=Europe/Paris:20190313T140000 DTEND;TZID=Europe/Paris:20190313T150000 DTSTAMP:20190319T120421Z URL:https://www.lincs.fr/events/talk-by-sergey-dovgal/ SUMMARY:Multiparametric Boltzmann sampling and applications DESCRIPTION:\nI will describe the problem of multiparametric generation (which is #P-complete) and a relaxation of this problem (multiparametric Boltzmann sampling) for which we construct a fully polynomial algorithm. Our algorithm relies on the convex optimisation techniques\, namely on the Exponential Conic Solver (ECOS) constructed in 2013 by Domahidi\, Chu and Boyd.The implementation of our algorithm is available on github. As a practical benchmark\, we perform the tuning of regular grammars with over 1k tuning parameters\, 19k states and 357k transitions in about 2 hours (the previously known algorithm was exponential in the number of parameters).In order to give impression of the numerous applications of multiparametric sampling\, I will present six different examples:I. Software testing and code generation using lambda calculus\;II. Non-uniform sparse random graphs\;III. Belief propagation in tree decomposition for RNA design (Ponty\, Will\, Hammer)\;IV. Bose-Einstein condensate in quantum harmonic oscillator represented by integer partitions\;V. Multiclass queuing networks (Buši? \, Bouillard\, Rovetta)\;VI. Combinatorial Learning problems and connection with Maximum Likelihood approach.The implementation of our algorithm can be found at https://github.com/maciej-bendkowski/boltzmann-brain\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:441@lincs.fr DTSTART;TZID=Europe/Paris:20190311T103000 DTEND;TZID=Europe/Paris:20190311T120000 DTSTAMP:20190305T075322Z URL:https://www.lincs.fr/events/an-information-theoretic-perspective-of-tf -idf-measures/ SUMMARY:An information-theoretic perspective of tf–idf measures. DESCRIPTION:\nReference: Aizawa\, Akiko. "An information-theoretic perspective of tf–idf measures." Information Processing &\; Management 39.1 (2003): 45-65. \n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:435@lincs.fr DTSTART;TZID=Europe/Paris:20190306T140000 DTEND;TZID=Europe/Paris:20190306T140000 DTSTAMP:20190308T135056Z URL:https://www.lincs.fr/events/a-simple-discrete-time-model-for-complex-n fv-accelerators/ SUMMARY:A simple discrete-time model for complex NFV accelerators DESCRIPTION:\n\n\nNetwork Functions Virtualization (NFV) is among the latest network revolutions\, bringing flexibility and avoiding network ossification. At the same time\, all-software NFV implementations on commodity hardware raise performance issues with respect to ASIC solutions. To address these issues\, numerous software acceleration frameworks for packet processing have appeared in the last few years. Common among these frameworks is the use of batching techniques. In this context\, packets are processed in groups as opposed to individually\, which is required at high-speed to minimize the framework overhead\, reduce interrupt pressure\, and leverage instruction-level cache hits. Whereas several system implementations have been proposed and experimentally benchmarked\, the scientific community has so far only to a limited extent attempted to model the system dynamics of modern NFV routers exploiting batching acceleration. We fill this gap by proposing a simple generic model for such batching-based mechanisms\, which allows a very detailed prediction of highly relevant performance indicators. These include the distribution of the processed batch size as well as queue size\, which can be used to identify loss-less operational regimes or quantify the packet loss probability in high-load scenarios. We contrast the model prediction with experimental results gathered in a high-speed testbed including an NFV router\, showing that the model not only correctly captures system performance under simple conditions\, but also in more realistic scenarios in which traffic is processed by a mixture of functions.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:430@lincs.fr DTSTART;TZID=Europe/Paris:20190227T140000 DTEND;TZID=Europe/Paris:20190227T150000 DTSTAMP:20190306T112656Z URL:https://www.lincs.fr/events/talk-by-guest-professor-panos-chrysanthis/ SUMMARY:Processing of Aggregations over Big Data Streams DESCRIPTION:\nOnline analytics and real-time data processing in most advanced IoT\, scientific\, business\, and defense applications\, rely heavily on the efficient execution of large numbers of Aggregate Continuous Queries (ACQs). ACQs continuously aggregate streaming data and periodically produce results such as max or average over a given window of the latest data. \; Low operational cost and timely processing are of paramount importance in these applications. To meet these requirements \;under fixed resources\, we have developed incremental evaluation algorithms as well as scheduling\, stream partitioning and load shedding techniques for window-based aggregations. \; In this talk\, we will first overview our aforementioned contributions and then focus on two recent ones\, (1) \;SlickDeque \;that optimizes the execution of multi-ACQs and (2) \;Concept-driven \;load shedding that adapts grouped aggregations to changing workloads.\n\n\n\nBio\n\n\n\nPanos K. Chrysanthis is a Professor of Computer Science and the founding director of the Advanced Data Management Technologies Laboratory in the School of Computing and Information at the University of Pittsburgh. \; He is also an Adjunct Professor at the Carnegie Mellon University and University of Cyprus. His research interests lie at the intersection of data management \;(Big Data\, Databases\, Data Streams &\; Sensor networks)\, distributed &\; mobile computing\, operating and real-time systems. \; He is a recipient of the NSF CAREER Award \;for his pioneer work on mobile data management\, \;and he is an ACM Distinguished Scientist and a Senior Member of IEEE. He is also a recipient of the University of Pittsburgh Provost Award for Excellence in Mentoring (doctoral students). He is currently the Special Issues Coordinator for the Distributed and Parallel Databases Journal and \;on the editorial board of several journals\, and has repeatedly served as a program committee chair and member in all major data management conferences. \;He earned his BS degree from the University of Athens\, Greece and his MS and PhD degrees from the University of Massachusetts at Amherst.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:439@lincs.fr DTSTART;TZID=Europe/Paris:20190225T103000 DTEND;TZID=Europe/Paris:20190225T120000 DTSTAMP:20190220T070301Z URL:https://www.lincs.fr/events/tropical-geometry-of-deep-neural-networks- continued/ SUMMARY:Tropical Geometry of Deep Neural Networks 🌴\; (continued) DESCRIPTION:\n\n\nReference: “Tropical geometry of deep neural networks” (Liwen Zhang\, Gregory Naitzat\, Lek-Heng Lim\, 2018)\n\n\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:436@lincs.fr DTSTART;TZID=Europe/Paris:20190221T140000 DTEND;TZID=Europe/Paris:20190221T150000 DTSTAMP:20190222T145906Z URL:https://www.lincs.fr/events/ending-the-era-of-information-overload-and -cognitive-fatigue/ SUMMARY:Ending the Era of Information Overload and Cognitive Fatigue DESCRIPTION:\nIn the post-digital era we face the risk of cognitive insufficiency in the attempt of dealing with the increasing exposure to large volume of data like chats\, emails\, multimedia\, etc. Today\, Big Data systems are still far from human level understand and so inadequate to rescue our cognitive needs. State-of-art Natural Language Processing systems are mostly successful in the understanding and linking of key entities and concepts to external knowledge repositories in specific domains. However\, a higher level understanding of unstructured data is required to unveil the shades of meanings for a deeper semantic interpretation.\n\n\n\nIn order to understand and interpret the growing volume of unstructured data\, we must go deeper to uncover the real meaning of content while doing it at scale and in real time. Towards this vision\, this talk will present advanced machine learning algorithms to understand unstructured multi-modal contents (e.g.\, social posts\, emails\, multimedia) at a deep semantic level. This research enables users to understand\, organize and absorb the ever-growing amount of information along with the different viewpoints therein. Our results are proved to be highly accurate with scalable training\, to work with real-time queries\, and to support fast dynamic updates. The output of this research is meant to change the way we interact\, learn\, teach - revolutionizing the way we communicate.\n\n\n\nBio\n\n\n\nAlessandra Sala is the Head of the Bell-Labs Analytics Research. In her prior appointment\, she was the technical manager for the Data Analytics and Operations Research \;group in Bell Labs Ireland. Before that\, she held a research associate position in the Department of Computer Science at University of California Santa Barbara. During this appointment\, she was a key contributor of several funded proposals from National Science Foundation in USA and her research was awarded with the Cisco Research Award in 2011. She focused her research on modeling massive graphs with an emphasis on mitigating privacy threats for Online Social Network users. Before that\, she worked for two years as post-doctoral fellow with the CurrentLab research group led by Prof. Ben Y.Zhao. Before UCSB\, she completed her Ph.D in Computer Science at University of Salerno\, Italy.\n\n\n\nHer research focus lies on distributed algorithms and complexity analysis with an emphasis on graph algorithms and privacy issues in large scale networks. In her previous research she has developed efficient distributed systems that support robust and flexible application level services such as scalable search\, flexible data dissemination\, and reliable anonymous communication.\n CATEGORIES:Seminars,Youtube LOCATION:Paris-Rennes-Nice Room (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes-Nice Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:438@lincs.fr DTSTART;TZID=Europe/Paris:20190220T140000 DTEND;TZID=Europe/Paris:20190220T150000 DTSTAMP:20191129T134040Z URL:https://www.lincs.fr/events/optimally-gathering-two-robots/ SUMMARY:Optimally Gathering Two Robots DESCRIPTION:\nWe present a self-stabilizing algorithm that ensures in finite time the gathering of two robots in the non-rigid ASYNC model. To circumvent established impossibility results\, we assume robots are equipped with 2-colors lights and are able to measure distances between one another. Aside from its light\, a robot has no memory of its past actions\, and its protocol is deterministic. Since\, in the same model\, gathering is impossible when lights have a single color\, our solution is optimal with respect to the number of used colors.\n CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:429@lincs.fr DTSTART;TZID=Europe/Paris:20190218T103000 DTEND;TZID=Europe/Paris:20190218T120000 DTSTAMP:20190211T113355Z URL:https://www.lincs.fr/events/tropical-geometry-of-deep-neural-networks/ SUMMARY:Tropical Geometry of Deep Neural Networks 🌴\; DESCRIPTION:\nReference: "Tropical geometry of deep neural networks" (Liwen Zhang\, Gregory Naitzat\, Lek-Heng Lim\, 2018) \n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:424@lincs.fr DTSTART;TZID=Europe/Paris:20190213T140000 DTEND;TZID=Europe/Paris:20190213T140000 DTSTAMP:20190215T153617Z URL:https://www.lincs.fr/events/human-behavior-is-low-dimensional/ SUMMARY:Human Behavior is Low Dimensional DESCRIPTION:\n\n\nEvery person is unique and complex.  \; But can we predict anything about how large groups of people will behave?  \;In the 1950s the writer Isaac Asimov imagined a field called “Psychohistory” that could mathematically describe the actions of large groups.  \; I will argue that in a certain way\, aspects of that vision are in wide use today.  \;To illustrate\, I will describe examples from my own work in which the “low dimensionality” of aggregate human behavior gives us leverage on a range of problems\, from predicting network traffic to detecting anomalous or malicious behavior in social networks.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:423@lincs.fr DTSTART;TZID=Europe/Paris:20190206T140000 DTEND;TZID=Europe/Paris:20190206T140000 DTSTAMP:20190213T122026Z URL:https://www.lincs.fr/events/talk-by-mauro-sozio/ SUMMARY:Fully Dynamic k-center Clustering DESCRIPTION:\nStatic and dynamic clustering algorithms are a fundamental \;tool in any machine learning library. Most of the efforts in developing \;dynamic machine learning and data mining algorithms have been focusing \;on the sliding window model (where at any given point in time only the \;most recent data items are retained) or more simplistic models. However\, \;in many real-world applications one might need to deal with arbitrary \;deletions and insertions. For example\, one might need to remove data \;items that are not necessarily the oldest ones\, because they have been \;flagged as containing inappropriate content or due to privacy concerns. \;Clustering trajectory data might also require to deal with more general \;update operations. We develop a (2+?)-approximation algorithm for the \;k-center clustering problem with "small" amortized cost under the fully \;dynamic adversarial model. In such a model\, points can be added or \;removed arbitrarily\, provided that the adversary does not have access to \;the random choices of our algorithm. The amortized cost of our algorithm \;is poly-logarithmic when the ratio between the maximum and minimum \;distance between any two points in input is bounded by a polynomial\, \;while k and epsilon are constant. Our theoretical results are \;complemented with an extensive experimental evaluation on dynamic data \;from Twitter\, Flickr\, as well as trajectory data\, demonstrating the \;effectiveness of our approach.\n\n\n\nThis talk will mainly present our work \;published at TheWebConf 2018 which was nominated for the best paper award.\n CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:428@lincs.fr DTSTART;TZID=Europe/Paris:20190204T103000 DTEND;TZID=Europe/Paris:20190204T120000 DTSTAMP:20190129T113125Z URL:https://www.lincs.fr/events/limit-distributions-and-laplaces-method/ SUMMARY:Limit distributions and Laplace's method DESCRIPTION:\nI will present some tools based on generating functions in order to study the limit distributions of some random variables. References:\n\n\n\n Analytic Combinatorics (Flajolet &\; Sedgewick)\, available online for free\, Asymptotic Methods in Analysis (de Bruijn). \n\n\n\n\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:426@lincs.fr DTSTART;TZID=Europe/Paris:20190130T140000 DTEND;TZID=Europe/Paris:20190130T140000 DTSTAMP:20190213T122339Z URL:https://www.lincs.fr/events/talk-by-makhlouf-hadji-2/ SUMMARY:Resource Allocation in Cloud Radio Access Networks: A Combinatorial Optimization Point of View DESCRIPTION:\n In this presentation\, we would like to focus on two well known NP-Hard problems and then provide a combinatorial optimization view \; before proposing new and efficient solutions. Thus\, we will focus on two main topics: constrained resource allocation and full coverage hole in C-RAN. \;The first topic consists in determining the best strategies to assign antennas (Remote Radio Head - RRH) demands to available edge data centers (pool of BaseBand Units - BBU) when jointly optimizing communication latency and resource consumption. The second topic addresses the full coverage hole problem in C-RAN when reducing existing interference. A deep Branch-and-Cut algorithm will be proposed and discussed. This approach is based on the description of new cutting planes to accelerate the convergence time even for large problem instances. \n CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:427@lincs.fr DTSTART;TZID=Europe/Paris:20190128T150000 DTEND;TZID=Europe/Paris:20190128T163000 DTSTAMP:20190204T134522Z URL:https://www.lincs.fr/events/algebra-for-quantum-information/ SUMMARY:Algebra for Quantum Information DESCRIPTION: CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:406@lincs.fr DTSTART;TZID=Europe/Paris:20190123T140000 DTEND;TZID=Europe/Paris:20190123T160000 DTSTAMP:20190213T122106Z URL:https://www.lincs.fr/events/soutenance-de-these/ SUMMARY:Thesis Defense : Auction-based Dynamic Resource Orchestration in Cloud-based Radio Access Networks DESCRIPTION:The paradigm of a Cloud-based RAN (C-RAN) is a key technology that combines the enabling solutions for the 5G requirements in terms of data rate\, scalability and cost savings. A C-RAN architecture is based on two key features namely\, Centralization\, wherein computational resources of base stations\, namely Base Band Units (BBUs)\, are pooled together in a central Cloud\, and Virtualization\, with the possibility that several Mobile Virtual Network Operators (MVNOs) share the radio resources and the BBU pool in order to reduce operational expenditure costs. In this thesis\, we develop a theoretical framework for dynamic resource management in the C-RAN and derive the fundamental performance limits as well as the trade offs among various system parameters.\n\nWe specifically propose 3 different resource allocation mechanisms that suit the C-RAN technology and help boost resource utilization efficiency. For each allocation mechanism\, we set an auction framework to help generate high revenues.\n\nWe design a two-level auction for the allocation of radio resources\, in a scenario with a central C-RAN operator\, a set of MVNOs and their subscribed users. We tackle the problem of calendaring for radio resource reservation in the C-RAN\, a natural context in which bandwidth calendaring can be applied owing to its centralized architecture. An auction-based framework is tailored so as to guarantee profit maximization and a market proof to manipulation. We address joint radio and processing allocation in the context of C-RAN as a combinatorial auction.\n\nOur approaches satisfy fundamental economic properties: truthfulness\, individual rationality and computational efficiency. Numerical results demonstrates the performance of our proposal in various network settings and show that our proposals can guarantee efficient outcomes.\n\nKeywords: C-RAN\, resource management\, auctions CATEGORIES:PhD Defense,Youtube LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:422@lincs.fr DTSTART;TZID=Europe/Paris:20190116T140000 DTEND;TZID=Europe/Paris:20190116T140000 DTSTAMP:20220210T135903Z URL:https://www.lincs.fr/events/internet-video-quality-inference-from-encr ypted-network-traffic/ SUMMARY:Internet Video Quality Inference from Encrypted Network Traffic DESCRIPTION:\n Accurately monitoring application performance is becoming more important for Internet Service Providers (ISPs)\, as users increasingly expect their networks to consistently deliver acceptable application quality. At the same time\, the rise of end-to-end encryption makes it difficult for network operators to determine video stream quality --- including metrics such as startup delay\, resolution\, rebuffering\, and resolution changes --directly from the traffic stream. In this talk we present general methods to infer streaming video quality metrics from encrypted traffic using lightweight features. Our evaluation shows that our models are not only as accurate as previous approaches\, but they also generalize across multiple popular video services\, including Netflix\, YouTube\, Amazon Instant Video\, and Twitch. The ability of our models to rely on lightweight features points to promising future possibilities for implementing such models at a variety of network locations along the end-to-end network path\, from the edge to the core.Stemming from the outcomes of this analysis\, in the second part of the talk we present Network Microscope\, a novel lightweight system running at the home getaway that analyzes traffic generated by DASH on-demand and live video streams. By first separating video flows from other sources of traffic by mapping DNS requests\, the system tracks traffic patterns to infer key video quality metrics such as average bitrate and re-buffering events. Moreover\, the system exploits novel algorithms that use simple probing techniques\, i.e. lightweight pings and traceroutes\, to take advantage of the home network vantage point to pinpoint where potential root causes hampering the streaming process might be located. \n\n\n\nBio\n\n\n\n\n\nFrancesco Bronzino is a Research Scientist in the Network Protocol and Systems Research department at Bell Labs Paris-Saclay. Francesco received his Ph.D. in Electrical and Computer Engineering from WINLAB (Wireless Information Network Lab) at Rutgers University\, working on designing and developing name-based services for future Internet and mobile network architectures. For his thesis work he was awarded the "Graduate Program Academic Achievement Award” from the department. Before joining Bell Labs\, Francesco spent two years as a Post-Doctoral research fellow in the MiMove group at Inria\, Paris\, where worked on developing network systems aimed at supporting and enhancing network services from home and access networks. Francesco's research interests broadly focus on the Internet infrastructure and the services that populate it\, with interest in understanding systems\, protocols and new technologies that can enhance service development and performance.\n\n\n\n\n\n\nhttps://youtu.be/9A8XSBQYIC0\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:419@lincs.fr DTSTART;TZID=Europe/Paris:20190107T103000 DTEND;TZID=Europe/Paris:20190107T120000 DTSTAMP:20190204T134556Z URL:https://www.lincs.fr/events/multi-armed-bandits-bayesian-vs-frequentis t-2/ SUMMARY:Multi-armed bandits: Bayesian vs frequentist (2) DESCRIPTION:Lorenzo Maggi will present two approaches of multi-armed bandits: Bayesian and frequentist\, based on the papers:\n\n  Tsitsiklis\, J. N. (1994). A short proof of the Gittins index theorem. The Annals of Applied Probability\, 194-199.\n J. C. Gittins\, Bandit Processes and Dynamic Allocation Indices\, Journal of the Royal Statistical Society (1979)\n\nLink to the slides: MAB - Bayesian_vs_Frequentist CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:413@lincs.fr DTSTART;TZID=Europe/Paris:20181219T100000 DTEND;TZID=Europe/Paris:20181219T100000 DTSTAMP:20190213T130151Z URL:https://www.lincs.fr/events/thesis-defense-2/ SUMMARY:Thesis Defense DESCRIPTION: CATEGORIES:PhD Defense LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:421@lincs.fr DTSTART;TZID=Europe/Paris:20181212T140000 DTEND;TZID=Europe/Paris:20181212T140000 DTSTAMP:20190116T145638Z URL:https://www.lincs.fr/events/protecting-encrypted-data-against-key-expo sure/ SUMMARY:Protecting encrypted data against key exposure DESCRIPTION:Hardening data protection using multiple methods rather than solely encryption is of paramount importance when considering continuous and powerful attacks to spy private and confidential information. Our research focuses on reinforcing data protection using a combination of data fragmentation\, encryption\, and dispersion. Each operation participates in the increasing of the protection level. We aim at minimizing the additional processing costs due to data fragmentation and dispersion. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:405@lincs.fr DTSTART;TZID=Europe/Paris:20181205T140000 DTEND;TZID=Europe/Paris:20181205T150000 DTSTAMP:20190213T125746Z URL:https://www.lincs.fr/events/ranking/ SUMMARY:Ranking online social users by their influence DESCRIPTION:TBA\n\n\n\nhttps://youtu.be/QA8ON74zvag\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:420@lincs.fr DTSTART;TZID=Europe/Paris:20181128T140000 DTEND;TZID=Europe/Paris:20181128T150000 DTSTAMP:20181205T094816Z URL:https://www.lincs.fr/events/too-many-sdn-rules-compress-them-using-min nie/ SUMMARY:Too Many SDN Rules\, Compress Them Using Minnie DESCRIPTION:Software Defined Networking (SDN) is gaining momentum with the support of major manufacturers. While it brings flexibility in the management of flows within the data center fabric\, this flexibility comes at the cost of smaller routing table capacities. Indeed\, the Ternary Content Addressable Memory (TCAM) needed by SDN devices has smaller capacities than CAMs used in legacy hardware. To solve this problem\, we investigated compression techniques to maximize the utility of SDN switches forwarding tables and created MINNIE. MINNIE dynamically compresses SDN rules without a noticeable impact on quality of service. We validate our solution\, with intensive simulations for well-known data center topologies\, to study its efficiency and compression ratio for a large number of forwarding rules. Our results indicate that MINNIE scales well\, being able to deal with around a million of different flows with less than 1000 forwarding entry per SDN switch\, requiring negligible computation time. To assess the operational viability of MINNIE in real networks\, we deployed it on a k = 4 fat-tree data center topology emulated testbed. We demonstrate on one hand\, that even with a small number of clients\, the limit in terms of number of rules is reached if no compression is performed\, increasing the delay of new incoming flows. MINNIE\, on the other hand\, reduces drastically the number of rules that need to be stored\, with no packet losses\, nor detectable extra delays if routing lookups are done in ASICs. Hence\, both simulations and experimental results suggest that MINNIE can be safely deployed in real networks\, providing compression ratios between 70% and 99%. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:418@lincs.fr DTSTART;TZID=Europe/Paris:20181126T103000 DTEND;TZID=Europe/Paris:20181126T120000 DTSTAMP:20181126T135356Z URL:https://www.lincs.fr/events/multi-armed-bandits-bayesian-vs-frequentis t/ SUMMARY:Multi-armed bandits: Bayesian vs frequentist DESCRIPTION:Lorenzo Maggi will present two approaches of multi-armed bandits: Bayesian and frequentist\, based on the papers:\n\n  Tsitsiklis\, J. N. (1994). A short proof of the Gittins index theorem. The Annals of Applied Probability\, 194-199.\n J. C. Gittins\, Bandit Processes and Dynamic Allocation Indices\, Journal of the Royal Statistical Society (1979)\n\nLink to the slides: MAB - Bayesian_vs_Frequentist CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I338 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I338 (3rd floor):geo:0,0 END:VEVENT BEGIN:VEVENT UID:409@lincs.fr DTSTART;TZID=Europe/Paris:20181121T160000 DTEND;TZID=Europe/Paris:20181121T160000 DTSTAMP:20190213T130210Z URL:https://www.lincs.fr/events/thesis-viva/ SUMMARY:Thesis Defense : Hyperfractals for the Modelling of Wireless Networks DESCRIPTION:We are on the verge of an industrial revolution that will make cities smarter\, industries more efficient and people’s life easier. Urban communication will place a critical role in this revolution yet due to their heterogeneity and the particularities of the urban environment\, the chosen models for representation can no longer be ones specific to cellular networks.\nThis thesis proposes a new model for wireless communications in urban setting by exploiting stochastic geometry and fractal geometry. It designs a model in two options\, the hyperfractal model for vehicles and the hyperfractal model for infrastructure. \; Throughout the thesis\, we derive tools that allow the manipulation of this model\, provide data fitting techniques and demonstrate its utility and ease of use through two applications in wireless metrics computation.\n\n\n\nhttps://youtu.be/eOp35QVnGKc\n\n CATEGORIES:PhD Defense,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:399@lincs.fr DTSTART;TZID=Europe/Paris:20181119T140000 DTEND;TZID=Europe/Paris:20181119T150000 DTSTAMP:20211125T121357Z URL:https://www.lincs.fr/events/tbc/ SUMMARY:Canopus: Scalable Consensus for Permissioned Blockchains DESCRIPTION:A critical problem with the consensus protocols underlying blockchains is that they do not scale well. As the number of participants trying to achieve consensus increases\, increasing network traffic from topology-oblivious broadcasts can quickly overwhelm the network\, or\, when using centralized consensus protocols\, overwhelm the central coordinator. Thus\, achieving strong consensus is typically restricted to a handful of participants\, or systems must resort to weaker forms of consensus\, such as those using proof of work. To address this problem\, we propose Canopus\, a highly-parallel consensus protocol that exploits modern data center network topology\, parallelism\, and consensus semantics to achieve scalability. Our key insight is to make network communication patterns topology-aware. In our prototype implementation\, Canopus achieves rates as high as 5m linearizable transactions/second over 27 nodes distributed across 7 datacenters. I will also discuss a recent extension\, Resilient Canopus\, that makes Canopus Byzantine Fault Tolerant.\n(Joint work with Sajjad Rizvi and Bernard Wong at the University of Waterloo)\n \; CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:414@lincs.fr DTSTART;TZID=Europe/Paris:20181114T140000 DTEND;TZID=Europe/Paris:20181114T140000 DTSTAMP:20190806T140759Z URL:https://www.lincs.fr/events/tbc-9/ SUMMARY:The Forward-Backward Embedding of Directed Graphs DESCRIPTION:We introduce a novel embedding of directed graphs derived from the singular value decomposition (SVD) of the normalized adjacency matrix. Specifically\, we show that\, after proper normalization of the singular vectors\, the distancesbetween vectors in the embedding space are proportional to the mean commute times between the corresponding nodes by a forward-backwardrandom walk in the graph\, which follows the edges alternately in forward and backward directions. In particular\, two nodes having many commonsuccessors in the graph tend to be represented by close vectors in the embedding space. More formally\, we prove that our representation of thegraph is equivalent to the spectral embedding of some co-citation graph\, where nodes are linked with respect to their common set of successors in the original graph. The interest of our approach is that it does not require to build this co-citation graph\, which is typically much denser than the original graph. Experiments on real datasets show the efficiency of the approach.\n\n\nSlides The_Forward_Backward_Embedding_of_Directed_Graphs__beamer_Download\n CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:416@lincs.fr DTSTART;TZID=Europe/Paris:20181112T103000 DTEND;TZID=Europe/Paris:20181112T120000 DTSTAMP:20181107T111538Z URL:https://www.lincs.fr/events/a-tutorial-on-hidden-markov-models/ SUMMARY:A tutorial on hidden Markov models DESCRIPTION:Achille Salaün will present a tutorial on Hidden Markov Models based on the reference:\n\n Lawrence R. Rabiner\, A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition\, 1989\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:404@lincs.fr DTSTART;TZID=Europe/Paris:20181107T140000 DTEND;TZID=Europe/Paris:20181107T150000 DTSTAMP:20181121T112912Z URL:https://www.lincs.fr/events/tbc-5/ SUMMARY:Some Recent Advances on the Application of Game Theory to Networking DESCRIPTION:In the first part of the talk we shall consider game theory as a tool for analyzing and predicting the evolution of the Internet topology. We study the structure and evolution of the Internet's Autonomous System (AS) interconnection topology as a game with heterogeneous players that incorporate reliability considerations. We also consider the case where utility (or monetary) transfers are allowed between the players. In this network formation game\, the utility of a player depends on the network structure\, e.g.\, the distances between nodes and the cost of links. We analyze static properties of the game\, such as the prices of anarchy and stability\, as well as the (novel) price of reliability\, and provide explicit results concerning the generated topologies. Furthermore\, we provide dynamical analysis of topological quantities\, demonstrate linear convergence rate and explain the prevalence of some “network motifs”\, i.e.\, sub-graphs that are expected to appear frequently in the network. Through real-world data\, we provide encouraging support to our predictions.\nResearch on the application of game theory in the context of networking has focused on non-cooperative games\, where the selfish agents cannot reach a binding agreement on the way they would share the infrastructure. Many approaches have been proposed for mitigating the typically inefficient operating points. However\, in a growing number of networking scenarios\, selfish agents are able to communicate and reach an agreement. Hence\, the degradation of performance should be considered at an operating point of a cooperative game\, e.g.\, the Nash bargaining solution\, core or nucleolus. In the second part of  \;the talk we shall describe a body of work that attempts to lay foundations for the application of cooperative game theory to fundamental problems in networking\, with a focus on routing. Depending on the scenario\, we will reach conclusions on how cooperation among agents affects their own performance as well as that of the system. We will discuss network design guidelines that follow from our findings.\nBio:\nAriel Orda is the Herman &\; Gertrude Gross Professor of Communications at the Technion. He received his BSc (summa cum laude)\, MSc and PhD at the Technion. He is an IEEE Fellow. During 1.1.2014-12.31.2017\, he served as the Dean of the Viterbi Faculty of Electrical Engineering at the Technion. His research interests include network routing\, the application of game theory to networking\, survivability\, QoS provisioning and wireless networks. He received several awards for research\, teaching\, and service. CATEGORIES:Seminars,Youtube LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:415@lincs.fr DTSTART;TZID=Europe/Paris:20181105T103000 DTEND;TZID=Europe/Paris:20181105T120000 DTSTAMP:20181105T115338Z URL:https://www.lincs.fr/events/belief-propagation-in-bayesian-networks/ SUMMARY:Belief Propagation in Bayesian Networks DESCRIPTION:Céline Comte will present Belief Propagation in Bayesian Networks based on the two references:\n\n J. Pearl\, Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach. 1982.\n J. Pearl\, Fusion\, propagation\, and structuring in belief networks. 1986.\n\nSlides : Network Theory - Belief propagation in Bayesian Networks CATEGORIES:Network Theory,Working Group LOCATION:Telecom ParisTech (Main Building)\, 46\, rue Barrault\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=46\, rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom ParisTech (Main Building):geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:410@lincs.fr DTSTART;TZID=Europe/Paris:20181024T140000 DTEND;TZID=Europe/Paris:20181024T150000 DTSTAMP:20181107T113013Z URL:https://www.lincs.fr/events/tbc-8/ SUMMARY:Two new methods for graph classification DESCRIPTION:Graph classification has recently received a lot of attention from various fields of machine learning e.g. kernel methods\, sequential modeling or graph embedding. We address the problem of graph classification based only on structural information. Most standard methods require either the pairwise comparisons of all graphs in the dataset or the extraction of ad-hoc features to perform classification. Those methods respectively raise scalability issues when the number of samples in the dataset is large\, and flexibility issues when discriminative information is characterized by exotic features. We propose two approaches for graph classification. First we propose a simple baseline algorithm that uses spectral information as graph representation. Second\, we propose a new sequential approach using recurrent neural networks to \;offer new possibilities for graph analysis in terms of scalability and feature learning. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:411@lincs.fr DTSTART;TZID=Europe/Paris:20181024T100000 DTEND;TZID=Europe/Paris:20181024T113000 DTSTAMP:20190513T084218Z URL:https://www.lincs.fr/events/some-architectural-considerations-for-algo rithms-in-python/ SUMMARY:Some Architectural Considerations for Algorithms in Python DESCRIPTION:In this talk\, we address a very common and practical question for the programmer: what should be the general architecture of our code? In particular\, when we plan to implement an algorithm\, should we write it as a function that takes arguments and parameters as input\, and gives its result as output? Or should we write a dedicated class? If so\, how should we organize this class? How to ensure compatibility\, easiness to implement and to maintain the code\, rapidity to implement new functionalities? How to design the architecture in order to facilitate the composition of several algorithms?\nAfter presenting the problem and its challenges\, we present an architecture inspired from the package Scikit-learn\, then a variant with a more functional-style flavor. Lastly\, we show how to use "properties" and especially "cached properties" to ensure a lazy evaluation while keeping the code very easy to write\, maintain and extend.\n \;\nThe notebook for the presentation is here https://gist.github.com/francois-durand/08590af1228ed5c62adb02cb9ef4b9f4. CATEGORIES:Seminars,Tools, Tips and Tricks,Youtube LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:408@lincs.fr DTSTART;TZID=Europe/Paris:20181017T140000 DTEND;TZID=Europe/Paris:20181017T150000 DTSTAMP:20181025T083647Z URL:https://www.lincs.fr/events/tbc-7/ SUMMARY:The Physics of Spectral Graph Embedding DESCRIPTION:Learning from data strutured as a graph usually requires to embed this graph in some vector space of low dimension. The most popular technique relies on the spectral decomposition of the Laplacian. The focus of this talk will be on the ``physics" of this spectral graph embedding\, in various fields like thermodynamics\, mechanics and electricity. These physical interpretations both suggest natural extensions to existing approaches and shed light on the crucial question of the choice of the Laplacian.\n\nPart of this work was presented at the Allerton conference:\nT. Bonald\, A. Hollocou\, M. Lelarge\, Weighted Spectral Embedding of Graphs\, Allerton conference\, 2018\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:400@lincs.fr DTSTART;TZID=Europe/Paris:20181010T140000 DTEND;TZID=Europe/Paris:20181010T150000 DTSTAMP:20181026T135253Z URL:https://www.lincs.fr/events/tbc-2/ SUMMARY:The Roaming Edge DESCRIPTION:Edge computing provides a new way to implement services with many unique advantages. While many edge computing solutions have been implemented within different network infrastructures\, in this talk\, we will explore the "roaming" edge of the Internet --- in vehicles -- where computing services are increasingly important\, and appropriate edge capabilities need to be rolled out. We will describe a few vehicular applications often with significant needs of audio-visual processing\, and describe an edge platform for vehicles to meet such goals. CATEGORIES:Seminars,Youtube LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:407@lincs.fr DTSTART;TZID=Europe/Paris:20181008T103000 DTEND;TZID=Europe/Paris:20181008T120000 DTSTAMP:20181004T125847Z URL:https://www.lincs.fr/events/finding-structure-with-randomness-probabil istic-algorithms-for-constructing-approximate-matrix-decompositions/ SUMMARY:Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions DESCRIPTION:Nathan de Lara will present the article \n\nHalko\, N.\, Martinsson\, P. G.\, & Tropp\, J. A. (2011).\nFinding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM review\, 53(2)\, 217-288.\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:403@lincs.fr DTSTART;TZID=Europe/Paris:20181003T140000 DTEND;TZID=Europe/Paris:20181003T150000 DTSTAMP:20181025T083752Z URL:https://www.lincs.fr/events/tbc-4/ SUMMARY:Of Kernels and Queues: when network calculus meets analytic combinatorics DESCRIPTION:Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However\, deriving accurate bounds for networks consisting of several queues or subject to non-independent traffic inputs is challenging. In this paper\, we investigate the relevance of the tools from analytic combinatorics\, especially the kernel method\, to tackle this problem. Applying the kernel method allows us to compute the generating functions of the queue state distributions in the stationary regime of the network. As a consequence\, error bounds with an arbitrary precision can be computed. In this preliminary work\, we focus on simple examples which are representative of the difficulties that the kernel method allows us to overcome.\n(Joint work with Anne Bouillard)\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:401@lincs.fr DTSTART;TZID=Europe/Paris:20180926T140000 DTEND;TZID=Europe/Paris:20180926T150000 DTSTAMP:20181025T084126Z URL:https://www.lincs.fr/events/tbc-3/ SUMMARY:Irrational Agents and the Power Grid DESCRIPTION:For decades power systems academics have proclaimed the need for real time prices to create a more efficient grid. The rationale is economics 101: proper price signals will lead to an efficient outcome. In this talk we argue that competitive equilibrium theory does support the real-time price paradigm\, provided we impose a particular model of rationality. However that this standard model of consumer utility does not match reality: the products of interest to the various "agents" are complex functions of time. The product of interest to a typical consumer is only loosely related to electric power -- the quantity associated with price signals.  \;There is good news: an efficient outcome is easy to describe\, and we have the control technology to achieve it. We need supporting market designs that respect dynamics and the enormous fixed costs that are inherent in power systems engineering\, recognizing that we need incentives on many time-scales. Most likely the needed economic theory will be based on an emerging theory of efficient and robust contract design.\n\nThe lecture will focus on the “efficient outcome”\, obtained through the distributed control approaches of Busic &\; Meyn.  \; It is hoped that the economic solutions will be identified in real-time by the end of the lecture!\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:402@lincs.fr DTSTART;TZID=Europe/Paris:20180924T103000 DTEND;TZID=Europe/Paris:20180924T120000 DTSTAMP:20241115T094709Z URL:https://www.lincs.fr/events/convex-optimization-and-duality/ SUMMARY:Convex Optimization and Duality DESCRIPTION:The talk is based on the Online Course Convex Optimization by Stephen Boyd\nand the Book Convex Optimization by Stephen Boyd and Lieven Vandenberghe.\n\nSlides\n\n \; CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:396@lincs.fr DTSTART;TZID=Europe/Paris:20180919T140000 DTEND;TZID=Europe/Paris:20180919T150000 DTSTAMP:20180924T065646Z URL:https://www.lincs.fr/events/regular-inference-on-artificial-neural-net works/ SUMMARY:Regular Inference on Artificial Neural Networks DESCRIPTION:This lecture explores the general problem of explaining the behavior of Artificial Neural Networks (ANN). The goal is to construct a representation which enhances human understanding of an ANN as a sequence classifier\, with the purpose of providing insight on the rationale behind the classification of a sequence as positive or negative\, but also to enable performing further analyses\, such as automata-theoretic formal verification. In particular\, a probabilistic algorithm for constructing a deterministic finite automaton which is approximately correct with respect to an artificial neural network is proposed. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:393@lincs.fr DTSTART;TZID=Europe/Paris:20180912T140000 DTEND;TZID=Europe/Paris:20180912T150000 DTSTAMP:20180921T104054Z URL:https://www.lincs.fr/events/asymptotic-optimal-control-of-markov-modul ated-restless-bandits/ SUMMARY:Asymptotic Optimal Control of Markov-Modulated Restless Bandits DESCRIPTION:In this talk we will discuss optimal control subject to changing conditions (a changing environment). This is an area that recently received a lot of attention as it arises in numerous situations in practice. Some applications being cloud computing systems with fluctuating arrival rates\, or the time-varying capacity as encountered in power-aware systems or wireless downlink channels. To study this\, we focus on a restless bandit model\, which has proved to be a powerful stochastic optimization framework to model scheduling of activities. This work is a first step to its optimal control when restless bandits are subject to changing conditions.\n\nWe consider the restless bandit problem in an asymptotic regime\, which is obtained by letting the population of bandits grow large\, and letting the environment change relatively fast. We present sufficient conditions for a policy to be asymptotically optimal and show that a set of priority policies satisfies these. Under an indexability assumption\, an averaged version of Whittle's index policy is proved to be inside this set of asymptotic optimal policies. The performance of the averaged Whittle's index policy is numerically evaluated for a multi-class scheduling problem. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:398@lincs.fr DTSTART;TZID=Europe/Paris:20180910T103000 DTEND;TZID=Europe/Paris:20180910T120000 DTSTAMP:20190513T084638Z URL:https://www.lincs.fr/events/jit-acceleration-in-python-introduction-to -numba/ SUMMARY:JiT acceleration in Python: introduction to Numba DESCRIPTION:This tutorial will explain how to easily turn slow Python into fast Python with the numba package. Speed up of X2000 will be demonstrated on hyperion\, Lincs' brand new machine. A notebook will be provided for those who want to try on their own machine. Quick guide to notebook installation:\n\nhttps://github.com/balouf/JupTricks/blob/master/NoteBookGu ide.ipynb\n\n CATEGORIES:Network Theory,Tools, Tips and Tricks,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:395@lincs.fr DTSTART;TZID=Europe/Paris:20180829T140000 DTEND;TZID=Europe/Paris:20180829T150000 DTSTAMP:20180822T105652Z URL:https://www.lincs.fr/events/protecting-privacy-in-dynamic-decision-mak ing/ SUMMARY:Protecting privacy in dynamic decision making DESCRIPTION:Motivated by the increasing ubiquity of large-scale data\ncollection infrastructures\, we investigate how to protect sensitive\ninformation in dynamic resource allocation problems. The central question\nis: how should one make resource allocation decisions such that these\ndecisions\, if observed and analyzed by an adversary\, do not inadvertently\nreveal private information of the decision maker? In this talk we will\nexamine two well known decision problems\, path planning and active learning\,\nand in each case provide tight information-theoretic upper and lower bounds\non the amount of additional resources required for a given level of privacy.\n\n \;\n\nBio: Kuang Xu was born in Suzhou\, China. He received the B.S. degree in\nElectrical Engineering (2009) from the University of Illinois at\nUrbana-Champaign\, Urbana\, Illinois\, USA\, and the Ph.D. degree in Electrical\nEngineering and Computer Science (2014) from the Massachusetts Institute of\nTechnology\, Cambridge\, Massachusetts\, USA. He was a postdoctoral fellow at\nthe Microsoft Research-Inria Joint Center in Paris\, France (2014-2015)\,\nhosted by Laurent Massoulié. His research interests lie in the fields of\napplied probability theory\, optimization\, and operations research\, seeking\nto understand fundamental properties and design principles of large-scale\nstochastic systems\, with applications in queueing networks\, healthcare\,\nprivacy and statistical learning theory. He has received several awards\nincluding a First Place in INFORMS George E. Nicholson Student Paper\nCompetition\, a Best Paper Award\, as well as a Kenneth C. Sevcik Outstanding\nStudent Paper Award from ACM SIGMETRICS. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:394@lincs.fr DTSTART;TZID=Europe/Paris:20180802T140000 DTEND;TZID=Europe/Paris:20180802T150000 DTSTAMP:20180920T082944Z URL:https://www.lincs.fr/events/on-network-connectivity-for-distributed-ma chine-learning/ SUMMARY:On Network Connectivity for Distributed Machine Learning DESCRIPTION:Abstract:\nMany learning problems are formulated as minimization of some loss function on a training set of examples. Distributed gradient methods on a cluster are often used to this purpose. In this talk we discuss how the variability of task execution times at cluster nodes affects the system throughput. In particular\, a simple but accurate model allows us to quantify how the time to solve the minimization problem depends on the network of information exchanges among the nodes. Interestingly\, we show that\, even when communication overhead may be neglected\, the clique is not necessarily the most effective topology\, as commonly assumed in previous works.\n\nBiography:\nGiovanni Neglia received a Ph.D. degree in Computer Science\, Electronics and Telecommunications from the University of Palermo\, Italy\, respectively in 2005. In 2005 he was a research scholar at the University of Massachusetts Amherst\, visiting  \;the Computer Networks Research Group. Since 2006 he works at Inria Sophia Antipolis\, France. He is associate editor for Elsevier Computer Communications journal and recipient of several best paper awards (ITC\, Greencomm\, NetSciCom\, VTC\, Valuetools\, Bionetics). His current research interests include cache networks and distributed optimization. CATEGORIES:Seminars LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:392@lincs.fr DTSTART;TZID=Europe/Paris:20180627T140000 DTEND;TZID=Europe/Paris:20180627T150000 DTSTAMP:20180613T072537Z URL:https://www.lincs.fr/events/tba-11/ SUMMARY:In the wild Sensing for Smarter Cities and Healthcare DESCRIPTION:Modern cities are alive with sensors\, such as smartphones\, wearables\, vehicles\, and cameras. Realizing our plans for smart environments of the future necessitates a radical transformation in the way these devices perceive and interact with our highly mobile environments. Smart city services are dependent on large-scale and low-cost data acquisition. To achieve this\, we rehash these city-wide devices in an attempt towards developing a mobility-aware multimodal sensing framework. Cities contain many moving objects and we show that being aware of this mobility enables efficient sensor reuse even when monitoring moving objects/people. Such a synergy has the potential to change the way our cities function\; from optimizing transportation to provisioning city services\, and further to legal and economic framework\, and regulations. My research leverages existing ubiquitous devices and expands their role to innovate new services\, ranging from large-scale video analytics to pedestrian safety. We innovate on smartphone sensors and fitness trackers for in-street detection. Through unobtrusive in-the-wild sensing we gauge pedestrian risk and enable city-scale pedestrian safety services. Infrastructure cameras\, often mounted for surveillance and traffic monitoring\, are among other prevalent devices in our cities that are underutilized. We devise mobility-aware scheduling for steerable infrastructure cameras to capture views for multiple concurrent analytics applications. We show how commonplace sensors can be used beyond their intended purpose. In building a framework involving widespread heterogeneous sensors and mobility-awareness\, we introduce new avenues for smart city analytics. We expand this vision of sensor reuse to healthcare technology to enable continuous monitoring of physical performance during workouts. We also explore novel sensors for early diagnosis of lung and eye disorders. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:363@lincs.fr DTSTART;TZID=Europe/Paris:20180619T000000 DTEND;TZID=Europe/Paris:20180620T000000 DTSTAMP:20180618T111513Z URL:https://www.lincs.fr/events/2018-lincs-workshop/ SUMMARY:2018 LINCS Workshop DESCRIPTION:Workshop\n\nLINCS and its Scientific Committee\n\nJune 19th and 20th\, 2018 \n\nLINCS  -  23 avenue d’Italie\, 4th floor – 75013 Paris\n\nAgenda\n\nJune 19th\n\n\n\nWelcome \n09:00 / 09:15\n\n\nOpening - Prof. Daniel Kofman\n09:15 / 09:30\n\n\nInvited talk from Scientific Committee-1 \n\nPricing and Bidding Strategies for Cloud Computing Spot Instances\n\nProf. Roch Guerin – Washington University\n09:30 / 10:15\n\n\nTalks from LINCS – 1:\n\nNovel market approach for locally balancing renewable energy production and flexible demand\n\nDr. Jose Horta (joint work TPT\, Nokia\, EDF)\n\n \n\nDeep Representation for Patient Visits from Electronic Health Records \n\nDr. Marc Lelarge - INRIA\n10:15 / 10:45\n\n\nCoffee break              \n10:45 / 11:15\n\n\nInvited talk from the Scientific Committee -2 \n\nElastic Corporate WAN as a Service over Public Clouds\n\nProf. Israel Cidon - Technion\n11:15 / 12:00\n\n\nTalks from LINCS – 2 \n\nHierarchical graph clustering through edge sampling\n\nProf. Thomas Bonald – (joint work TPT-IMT and INRIA)\n\n \n\nPerformance of Balanced Fairness in Resource Pools: A Recursive Approach\n\nDr. Fabien Mathieu – (joint work Nokia and TPT)\n12:00 / 12:30\n\n\nLunch\n12:30 / 14:15\n\n\nTalks from LINCS 3 – PhDs and PostDocs’ presentations: 3mn for presenting the thesis / work.\n14:15 / 16:00\n\n\nCoffee break \n16:00 / 16:30\n\n\nInvited talk from the Scientific Committee -3\n\nTitle TBC\n\nProf. Peter Druschel\n16:30 / 17:15\n\n\nInvited talk from the Scientific Committee -4\n\nDictionary Learning Based on Sparse Distribution Tomography\n\nProf. Patrick Thiran - EPFL\n17:15 / 18:00\n\n\nSocial Event (Diner)    \n\ndirections to social event                 \n19:30 / 22:00\n\n\n\n \;\n\n \;\n\n \;\n\n \n\nJune 20th\n\n\n\nWelcome\n09:00/ 09:30 \n\n\nInvited talk from the Scientific Committee -5 \n\nTitle TBC\n\nProf. Nick Bambos – Stanford University\n09:30 / 10:15\n\n\nCoffee break\n10:15 / 10:45\n\n\nTalks from LINCS -4 \n\nDigital assistance for IoT service recommendation to end-users\n\nDr. Ludovic Noirie (Joint Work Nokia - UMPC)\n\n \n\nMultilevel Multipath Paris Traceroute\n\nProf. Timur Friedman (Joint Work UPMC-INRIA)\n10:45 / 11:15\n\n\nPoster Session \n11:15 / 12:15\n\n\nLunch\n12:15 / 14:00\n\n\nTalks from LINCS -5 \n\nNarrowing the gap between QoS metrics and Web QoE using Above-the-Fold metrics\n\nDr. Diego Da Hora (Joint Work INRIA-TPT)\n\n \n\nBeyond Surveys and Social Media: Understanding Online News Consumption Habits from Usage Data\n\nDr. Zied Ben Houidi (Joint Work INRIA-Nokia)\n\n \n\nClickNF: a Modular Stack for Custom Network Functions\n\nDr. Massimo Gallo (Joint Work Nokia-TPT)\n14:00 / 14:45\n\n\nPoster Session\n14:45 / 15:45\n\n\nCoffee break     \n15:45 / 16:15\n\n\nInvited talk 1 - \n\nWi-Fi Goes to Town: Techniques for Rapid Picocell Switching for Extreme Mobility\n\nProf. Kyle Jamieson – Princeton University\n16:15 / 16:45\n\n\nInvited talk 2\n\nTitle TBC\n\nProf. Nick Feamster - Princeton University\n16:45 / 17:15\n\n\nInvited talk 3\n\nRobust Inference of Inter-AS Interconnections\n\nProf. Reza Rejaie –University of Oregon\n17:15 / 17:45\n\n\nConclusion and End of event\n17:45 / 18:00\n\n\nWrap-up\n\n-       Scientific Committee and Executive Committee\n18:15 / 18:45\n\n\n\n \; CATEGORIES:Seminars LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:389@lincs.fr DTSTART;TZID=Europe/Paris:20180607T140000 DTEND;TZID=Europe/Paris:20180607T140000 DTSTAMP:20181025T083527Z URL:https://www.lincs.fr/events/on-the-notion-of-dimension-of-unimodular-r andom-graphs/ SUMMARY:On the notion of Dimension of Unimodular Random Graphs DESCRIPTION:In this talk we will define notions of dimension on unimodular random\ngraphs. The key point in this definition is unimodularity which is used indispensably and distinguishes this view point from the previous notions \;which are defined in the literature. Other notions which are related to the notion of dimension such as volume growth are discussed which provide a toolset to calculate the dimension. Several examples of such graphs will be discussed in relation with the theory of point processes and that of unimodular graphs. Different methods for finding upper bounds and lower bounds on the \; dimension will also be presented and illustrated through these examples. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:390@lincs.fr DTSTART;TZID=Europe/Paris:20180606T140000 DTEND;TZID=Europe/Paris:20180606T150000 DTSTAMP:20180607T075207Z URL:https://www.lincs.fr/events/on-mapping-the-interconnections-in-todays- internet/ SUMMARY:On Mapping the Interconnections in Today’s Internet DESCRIPTION:Internet interconnections are the means by which networks exchange traffic between one another. These interconnections are typically established in facilities that have known geographic locations\, and are owned and operated by so-called colocation and interconnection service providers (e.g.\, Equinox\, CoreSite\, and EdgeConneX). These previously under-studied colocation facilities and the critical role they play in solving the notoriously difficult problem of obtaining a comprehensive view of the structure and evolution of the interconnections in today’s Internet are the focus of this talk.\n\nWe present mi2\, a new approach for mapping Internet interconnections inside a given colocation facility. We infer the existence of interconnections from localized traceroutes and use the Belief Propagation algorithm on a specially defined Markov Random Field graphical model to geolocate them to a target facility. We evaluate mi2 by applying it to a diverse set of US-based colocation facilities. In the process\, we compare our results against those obtained by two recently developed related techniques\, and discuss observed discrepancies that result from how the different techniques determine the ownership of (border) routers. We also report on drastic changes in today’s Internet interconnection ecosystem (e.g.\, new infrastructures in the form of cloud exchanges that offer new types of interconnections) and reflect upon their far-reaching implications for obtaining an accurate and comprehensive map of the Internet’s interconnections.\n\nThis is joint work with Reza Motamedi\, Bahador Yeganeh (University of Oregon)\, Balakrishnan Chandrasekaran (Technische Universität Berlin)\, Bruce M. Maggs (Duke University/Akamai Technologies) and Walter Willinger (NIKSUN\, Inc.) CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:388@lincs.fr DTSTART;TZID=Europe/Paris:20180523T140000 DTEND;TZID=Europe/Paris:20180523T150000 DTSTAMP:20180524T084950Z URL:https://www.lincs.fr/events/machine-learning-approaches-for-computer-v ision-applications/ SUMMARY:Machine Learning approaches for Computer Vision applications DESCRIPTION:Machine Learning\, as the most successful paradigm of Artificial Intelligence to date\, has shown its great potential in restructuring all aspects in our everyday life\, e.g. through decision making support\, autonomous agents/vehicles\, intelligent manufacturing and web-scale/social network analysis\, to name a few. In this talk\, I will give an overview of my recent work on kernel-based learning and neural networks as generic approaches for pattern classification. Applications related to Computer Vision problems will also be presented\, as well as extensions to time series data analysis.  \n\nSlides of the presentation CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:369@lincs.fr DTSTART;TZID=Europe/Paris:20180514T170000 DTEND;TZID=Europe/Paris:20180514T173000 DTSTAMP:20180515T061107Z URL:https://www.lincs.fr/events/online-influence-maximization/ SUMMARY:Online influence maximization DESCRIPTION:We will talk about the online influence maximization problem in social networks under the independent cascade model. Specifically\, we aim to learn the set of “best influencers" in a social network online with unknown influence probabilities while repeatedly interacting with the network. We address the challenges of (i) combinatorial action space\, since the number of feasible influencer sets grows exponentially with the maximum number of influencers\, and (ii) limited feedback\, since only the influenced portion of the network is observed. Under a stochastic semi-bandit feedback\, we propose and analyze IMLinUCB\, a computationally\nefficient UCB-based algorithm. Our bounds on the cumulative regret are polynomial in all quantities of interest\, achieve near-optimal dependence on the number of interactions and reflect the topology of the network and the activation probabilities of its edges\, thereby giving insights on the problem complexity. To the best of our knowledge\, these are the first such results. Our experiments show that in several representative graph topologies\, the regret of IMLinUCB scales as suggested by our upper bounds. IMLinUCB permits linear generalization and thus is both statistically and computationally suitable for large-scale problems. Our experiments also show that IMLinUCB with linear generalization can lead to low regret in real-world online influence maximization. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:368@lincs.fr DTSTART;TZID=Europe/Paris:20180514T163000 DTEND;TZID=Europe/Paris:20180514T170000 DTSTAMP:20180515T060848Z URL:https://www.lincs.fr/events/topic-detection-and-classification-in-twit ter/ SUMMARY:Topic detection and classification in Twitter DESCRIPTION:In this talk we introduce a novel information propagation method in Twitter\, while maintaining a low computational complexity. The proposed method first employs Joint Complexity\, which is defined as the cardinality of a set of all distinct factors of a given string represented by suffix trees\, to perform topic detection. Then based on the nature of the data\, we apply the theory of Compressive Sensing to perform topic classification by recovering an indicator vector\, while reducing significantly the amount of information from tweets. Based on the spatial correlation of tweets and the score matrices\, we apply a framework to complete matrices from a small number of random sample scores. We exploit datasets in various languages collected by using the Twitter streaming API and achieve better classification accuracy when compared with state-of-the-art methods. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:370@lincs.fr DTSTART;TZID=Europe/Paris:20180514T160000 DTEND;TZID=Europe/Paris:20180514T163000 DTSTAMP:20180515T060656Z URL:https://www.lincs.fr/events/on-finding-dense-subgraphs-and-events-in-s ocial-media/ SUMMARY:On finding dense subgraphs and events in social media DESCRIPTION:Social media contain information shared by hundreds of millions of users across the world and provide one of the richest dataset created by human activity. Social media distinguish themselves from traditional media as users can follow news channels\, but they can also be the ones reporting updates on events.\nIn our research\, we focus on the detection of disaster events\, such as earthquakes\, terrorist attacks\, mass shootings\, air strikes\, etc. We develop tools to extract a useful description of an event via a graph-based approach and we show that our algorithm can incorporate information from several sources\, such as both social and mainstream media.\nComplementary to our work on event detection\, we study several definitions of meaningful subgraphs in a graph. Density is a very good measure of importance and cohesiveness in graphs and dense subgraphs have been found to represent communities in social networks\, or to indicate the presence of real-world events in a graph-of-words. We investigate both semantic and structural properties of dense subgraphs and we develop algorithms that can successfully scale to real-world graphs. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:372@lincs.fr DTSTART;TZID=Europe/Paris:20180514T150000 DTEND;TZID=Europe/Paris:20180514T153000 DTSTAMP:20180515T060542Z URL:https://www.lincs.fr/events/hierarchical-clustering-objective-function s-and-algorithms/ SUMMARY:Hierarchical clustering: Objective functions and algorithms DESCRIPTION:Hierarchical clustering is a recursive partitioning of a dataset into clusters at an increasingly finer granularity. Motivated by the fact that most work on hierarchical clustering was based on providing algorithms\, rather than optimizing a specific objective\, Dasgupta framed similarity-based hierarchical clustering as a combinatorial optimization problem\, where a `good' hierarchical clustering is one that minimizes some cost function. He showed that this cost function has certain desirable properties.\nWe take an axiomatic approach to defining `good' objective functions for both similarity and dissimilarity-based hierarchical clustering. We characterize a set of “admissible” objective functions (that includes Dasgupta's one) that have the property that when the input admits a `natural' hierarchical clustering\, it has an optimal value.\nEquipped with a suitable objective function\, we analyze the performance of practical algorithms\, as well as develop better algorithms. For similarity-based hierarchical clustering\, Dasgupta showed that the divisive sparsest-cut approach achieves an O(log^{3/2} n)-approximation. We give a refined analysis of the algorithm and show that it in fact\nachieves an O(\\sqrt{log n})-approx. (Charikar and Chatziafratis independently proved that it is a O(\\sqrt{log n})-approx.). This improves upon the LP-based O(logn)-approx. of Roy and Pokutta. For dissimilarity-based hierarchical clustering\, we show that the classic average-linkage algorithm gives a factor 2 approx.\, and provide a simple and better algorithm that gives a factor 3/2 approx..\nFinally\, we consider `beyond-worst-case' scenario through a generalisation of the stochastic block model for hierarchical clustering. We show that Dasgupta's cost function has desirable properties for these inputs and we provide a simple 1 + o(1)-approximation in this setting.\n\nJoint work with Varun Kanade\, Frederik Mallmann-Trenn\, and Claire Mathieu. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:371@lincs.fr DTSTART;TZID=Europe/Paris:20180514T143000 DTEND;TZID=Europe/Paris:20180514T150000 DTSTAMP:20180515T060443Z URL:https://www.lincs.fr/events/on-graph-reconstruction-via-empirical-risk -minimization/ SUMMARY:On graph reconstruction via empirical risk minimization DESCRIPTION:The problem of predicting connections between a set of data points finds many applications\, in systems biology and social network analysis among others. We focus on the graph reconstruction problem\, where the prediction rule is obtained by minimizing the average error over all n(n-1)/2 possible pairs of the n nodes of a training graph. Our first contribution is to derive learning rates of order O(log n / n) for this problem\, significantly improving upon the slow rates of order O(1/?n) established in the seminal work of Biau &\; Bleakley (2006). Strikingly\, these fast rates are universal\, in contrast to similar results known for other statistical learning problems (e.g.\, classification\, density level set estimation\, ranking\, clustering) which require strong assumptions on the distribution of the data. Motivated by applications to large graphs\, our second contribution deals with the computational complexity of graph reconstruction. Specifically\, we investigate to which extent the learning rates can be preserved when replacing the empirical reconstruction risk by a computationally cheaper Monte-Carlo version\, obtained by sampling with replacement B <\;<\; n2 pairs of nodes. Finally\, we illustrate our theoretical results by numerical experiments on synthetic and real graphs. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:367@lincs.fr DTSTART;TZID=Europe/Paris:20180514T140000 DTEND;TZID=Europe/Paris:20180514T143000 DTSTAMP:20180515T060358Z URL:https://www.lincs.fr/events/building-and-exploiting-large-graphs-conne cting-images/ SUMMARY:Building and exploiting large graphs connecting images DESCRIPTION:In this talk\, I will present recent works on large-scale similarity search\, and show that it is possible to build a graph connecting up to one billion of images on a regular server\, assuming that a vector representation is provided for each image. In particular\, I will introduce a new method based on hierarchical navigable small words graph\, which explicitly exploits the graph structure in the encoding stage (compression) of each vector so that the indexing structure can fit into memory. I will then discuss applications involving large graphs\, including semi-supervised classification and unsupervised learning. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:374@lincs.fr DTSTART;TZID=Europe/Paris:20180514T120000 DTEND;TZID=Europe/Paris:20180514T123000 DTSTAMP:20180515T060249Z URL:https://www.lincs.fr/events/modularity-for-soft-graph-clustering/ SUMMARY:Modularity for soft-graph clustering DESCRIPTION:Clustering is a central problem in machine learning for which graph-based approaches have proven their efficiency. In this paper\, we study a relaxation of the modularity maximization problem\, well-known in the graph partitioning literature. A solution of this relaxation gives to each element of the dataset a probability to belong to a given cluster\, whereas a solution of the standard modularity problem is a simple partition. We introduce an efficient optimization algorithm to solve this relaxation\, that is both memory efficient and local\, and show that our method includes the Louvain algorithm\, a state-of-the-art technique to solve the traditional modularity problem. Experiments on both synthetic and real-world data show that our approach provides meaningful information on various types of data. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:373@lincs.fr DTSTART;TZID=Europe/Paris:20180514T113000 DTEND;TZID=Europe/Paris:20180514T120000 DTSTAMP:20180515T060116Z URL:https://www.lincs.fr/events/the-many-facets-of-community-detection/ SUMMARY:The many facets of community detection DESCRIPTION:In this talk\, I will present a collection of results focusing on the presence of inhomogeneities in networks: from the detection of dense clusters (community detection) to their impact on\ndynamical processes\, the definition of disassortative communities and the design of local metrics on networks. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:387@lincs.fr DTSTART;TZID=Europe/Paris:20180514T110000 DTEND;TZID=Europe/Paris:20180514T113000 DTSTAMP:20180515T055936Z URL:https://www.lincs.fr/events/collective-insurance-fraud-detection-via-n etwork-analysis/ SUMMARY:Collective insurance fraud detection via network analysis DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:379@lincs.fr DTSTART;TZID=Europe/Paris:20180514T100000 DTEND;TZID=Europe/Paris:20180514T103000 DTSTAMP:20180515T055809Z URL:https://www.lincs.fr/events/on-the-performance-of-a-canonical-labeling -for-matching-correlated-erdos-renyi-graphs/ SUMMARY:On the Performance of a Canonical Labeling for Matching Correlated Erdos-Renyi Graphs DESCRIPTION:Recent results have characterized the exact information-theoretic threshold for graph matching in correlated Erd?s-Rényi graphs. However\, very little is known about the existence of efficient algorithm to achieve graph matching without seeds. In this work\, we identify a region in which a straightforward and efficient canonical labeling algorithm\, initially introduced in the context of graph isomorphism\, succeeds in matching correlated Erd?s-Rényi graphs. The algorithm has two steps. In the first step\, all vertices are labeled by their degrees and a trivial minimum distance matching (i.e.\, simply sorting vertices according to their degrees) matches the a fixed number of highest degree vertices in the two graphs. Having identified this subset of vertices\, the remaining vertices are matched using a noisy variant of a bipartite matching algorithm.\n\nJoint work with Osman Dai\, Daniel Cullina and Negar Kiyavash CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:366@lincs.fr DTSTART;TZID=Europe/Paris:20180514T093000 DTEND;TZID=Europe/Paris:20180514T100000 DTSTAMP:20180515T055710Z URL:https://www.lincs.fr/events/analysis-of-temporal-interactions-with-lin k-streams/ SUMMARY:Analysis of temporal interactions with link streams DESCRIPTION:Money or data transfers\, contacts between individuals\, or product sales\, may all be modeled as temporal interactions. Studying the structure and dynamics of interactions is therefore crucial for many fundamental and applied questions (like event detection in traffic\, fraud fighting\, recommender systems\, network optimisation\, and the interplay between relations and interactions). Their structure is studied with graphs and networks (sets of nodes and links)\; their dynamics is studied with signals and time series (variations of a property over time)\; to study the dynamics of their structure\, one uses graph sequences. However\, these approaches poorly capture the both structural and temporal nature of interactions\, that calls for a dedicated formalism. I will present a generalization of graphs\, that we call link streams\, and that makes it possible to consistently handle both aspects. We thus obtain a language for the study of interactions over time\, similar to the one provided by graphs for the study of relations. CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:365@lincs.fr DTSTART;TZID=Europe/Paris:20180514T090000 DTEND;TZID=Europe/Paris:20180514T093000 DTSTAMP:20180515T055602Z URL:https://www.lincs.fr/events/multimodal-graph-clustering-for-music-reco mmendation/ SUMMARY:Multimodal graph clustering for music recommendation DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:359@lincs.fr DTSTART;TZID=Europe/Paris;VALUE=DATE:20180514 DTEND;TZID=Europe/Paris;VALUE=DATE:20180515 DTSTAMP:20180514T044607Z URL:https://www.lincs.fr/events/workshop-on-graph-learning/ SUMMARY:Workshop on Graph Learning DESCRIPTION:This workshop will bring together researchers from both industry and academia for presenting and discussing learning techniques from/with graphs\, from both theoretical and practical perspectives. \n\nThe program is available here. CATEGORIES:Seminars LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT Digital):geo:0,0 END:VEVENT BEGIN:VEVENT UID:431@lincs.fr DTSTART;TZID=Europe/Paris:20180416T140000 DTEND;TZID=Europe/Paris:20180416T140000 DTSTAMP:20190211T094058Z URL:https://www.lincs.fr/events/thesis-defense-innovative-paradigms-and-ar chitectures-for-future-distribution-electricity-networks-supporting-the-en ergy-transition/ SUMMARY:Thesis Defense : Innovative paradigms and architectures for future distribution electricity networks supporting the energy transition DESCRIPTION: CATEGORIES:PhD Defense LOCATION:LINCS / EIT Digital\, 23 avenue d'Italie\, 75013 Paris\, France X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS / EIT Digital:geo:0,0 END:VEVENT BEGIN:VEVENT UID:383@lincs.fr DTSTART;TZID=Europe/Paris:20180412T140000 DTEND;TZID=Europe/Paris:20180412T150000 DTSTAMP:20180621T112122Z URL:https://www.lincs.fr/events/tba-8/ SUMMARY:Network fingerprinting: TTL-based router signatures DESCRIPTION:Fingerprinting networking equipment has many potential applications and benefits in network management and security. More generally\, it is useful for the understanding of network structures and their behaviors. In this paper\, we describe a simple fingerprinting mechanism based on the initial TTL values used by routers to reply to various probing messages. We show that main classes obtained using this simple mechanism are meaningful to distinguish routers platforms. Besides\, it comes at a very low additional cost compared to standard active topology discovery measurements. As a proof of concept\, we apply our method to gain more insight on the behavior of MPLS routers and to\, thus\, more accurately quantify their visible/invisible deployment. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:384@lincs.fr DTSTART;TZID=Europe/Paris:20180411T140000 DTEND;TZID=Europe/Paris:20180411T150000 DTSTAMP:20180515T061200Z URL:https://www.lincs.fr/events/tba-9/ SUMMARY:Open Web Proxies: analysis\, threats and opportunities DESCRIPTION:Open web proxies promise anonymity and censorship circumvention at no cost. Several websites publish lists of free proxies organized by country\, anonymity level\, and performance. These lists index hundreds of thousand of hosts discovered via automated tools and crowd-sourcing. A complex free proxy ecosystem has been forming over the years\, of which very little is known. In this talk we shed light on this ecosystem via a distributed measurement platform that leverages both active and passive measurements. Active measurements are carried out by an infrastructure we name ProxyTorrent that discover free proxies\, assess their performance\, and detect potential malicious activities. Passive measurements relate to proxy performance and usage in the wild are accomplished by means of a Chrome plugin named Ciao. ProxyTorrent has been running since January 2017\, monitoring up to 200\,000 free proxies. Ciao was launched in March 2017 and has thus far served roughly 3\,000 users and generated 3 TB of traffic. Our analysis shows that less than 2% of the proxies announced on the Web indeed proxy traffic on behalf of users\; further\, only half of these proxies have decent performance and can be used reliably. Around 10% of the working proxies exhibit malicious behaviors\, e.g.\, ads injection and TLS interception\, and these proxies are also the ones providing the best performance. Through the analysis of more than 3 TB of proxied traffic\, we show that web browsing is the primary user activity. Geo-blocking avoidance is not a prominent use-case\, with the exception of proxies located in countries hosting popular geo-blocked content. In addition to those findings\, Open Web proxies\, and more generally open resources on the internet\, provide several opportunities. We will discuss few use cases we are addressing and focus on one of them\, i.e.  FreeLab: A Free Experimentation Platform. The key idea of FreeLab is that experiments run directly at its user machines\, while traffic is relayed by free vantage points in the Internet (web and SOCKS proxies\, and DNS resolvers). CATEGORIES:Seminars,Youtube LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:386@lincs.fr DTSTART;TZID=Europe/Paris:20180409T103000 DTEND;TZID=Europe/Paris:20180409T120000 DTSTAMP:20180403T123934Z URL:https://www.lincs.fr/events/the-cascade-correlation-learning-architect ure/ SUMMARY:The Cascade-Correlation Learning Architecture DESCRIPTION:Marc-Olivier Buob will present a paper of Scott E. Fahlman and Christian Lebiere about \n\nThe Cascade-Correlation Learning Architecture\, August 29\, 1991 CMU-CS-90-100\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:382@lincs.fr DTSTART;TZID=Europe/Paris:20180404T140000 DTEND;TZID=Europe/Paris:20180404T140000 DTSTAMP:20180405T073941Z URL:https://www.lincs.fr/events/tba-5/ SUMMARY:Vehicular networks in hyperfractal setup DESCRIPTION:Confinement of human settlement in areas limited in size is the foundation of the long-standing Central Place Theory which assumes the existence of regular spatial patterns in regional human organization. For example\, a department has rural areas\, with low density of population\, and urban areas\, with high density of population\, namely cities and towns. Similarly\, cities reflect a statistical self-similarity or hierarchy of clusters. Towns are split in neighborhoods\; each neighborhood is organized in quarters then blocks separated by streets. Blocks are made of buildings that are themselves split in apartments and so on. Vehicles and devices are deployed where human activities occur and therefore inherit the self-similarity of the environment where they are deployed.\nThis talk will present our macro level model for the topology of vehicular communication entities in cities by exploiting self-similarity. The model is called hyperfractal and presents two variations: the hyperfractal model for density of vehicles and the hyperfractal model for road-side units (RSU). The model exploits the self-similarity of the density map of the vehicular communications entities and avoids the extremes of regularity and randomness.\n Furthermore\, we introduce a method for computing the hyperfractal dimension on cities. Using this fitting procedure applied to open data sets\, we prove the validity of the model and show how it can be extended to cities that do not follow a regular hierarchical pattern.\nNext\, we study the information propagation speed of a broadcast in an urban delay tolerant network which is disconnected at all time\, i.e.\, where end-to-end multihop paths may not exist (requiring a store-carry-and-forward routing model). We prove bounds on the average broadcast time in a hyperfractal setup and show that the performance is due in part to an interesting self-similar phenomenon\, that we denote as information teleportation\, that arises as a consequence of the topology and allows an acceleration of the broadcast time. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:381@lincs.fr DTSTART;TZID=Europe/Paris:20180328T140000 DTEND;TZID=Europe/Paris:20180328T150000 DTSTAMP:20180314T080540Z URL:https://www.lincs.fr/events/user-centric-personal-data-analytics-on-th e-edge/ SUMMARY:User-Centric Personal Data Analytics on the Edge DESCRIPTION: Abstract: In this talk\, I present our ongoing work on utilising edge-computing to improve the scalability and privacy of user-centred analytics in the context of personal/IoT data. I present an architecture where devices and resources centred around the user\, collectively referred to as the edge\, can complement the cloud for providing privacy-aware\, yet accurate and efficient analytics. I then present the evaluations of the proposed framework for applying privacy-preserving deep learning techniques on a number of exemplar applications\, and discuss the broader implications of such approaches for future systems such as the Databox platform.\n \;\n Bio: Hamed is a Senior Lecturer (~Associate Professor) and the Deputy Director of Research in the Dyson School of Design Engineering\, and an Academic Fellow of the Data Science Institute\, at The Faculty of Engineering at Imperial College London. He is interested in User-Centered Systems\, IoT\, Applied Machine Learning\, and Data Security &\; Privacy. He enjoys designing and building systems that enable better use of our digital footprint\, while respecting users' privacy. He is also broadly interested in sensing applications and Human-Data Interaction.\n \;\nhttps://haddadi.github.io/ CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:385@lincs.fr DTSTART;TZID=Europe/Paris:20180326T103000 DTEND;TZID=Europe/Paris:20180326T120000 DTSTAMP:20180322T112756Z URL:https://www.lincs.fr/events/ergodic-control-and-polyhedral-approaches- to-pagerank-optimization/ SUMMARY:Ergodic control and polyhedral approaches to PageRank optimization DESCRIPTION:In this session of the reading group\, Anastasios Giovanidis will present the paper \n\nO. Fercoq\, M. Akian\, M. Bouhtou\, S. Gaubert. “Ergodic control and polyhedral approaches to PageRank optimization”\, \nIEEE Trans. on Automatic Control\, vol. 58\, no. 1\, Jan. 2013 CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:380@lincs.fr DTSTART;TZID=Europe/Paris:20180312T103000 DTEND;TZID=Europe/Paris:20180312T120000 DTSTAMP:20180306T082154Z URL:https://www.lincs.fr/events/knowledge-graph-embeddings/ SUMMARY:Knowledge graph embeddings DESCRIPTION:Nathan De Lara will introduce the knowledge graph embeddings\, based on the following references: \n\n Bordes\, A.\, Usunier\, N.\, Garcia-Duran\, A.\, Weston\, J.\, and Yakhnenko\, O. (2013). Translating embeddings for modeling multi-relational data. In Advances in neural information processing systems (pp. 2787-2795).\n Wang\, Z.\, Zhang\, J.\, Feng\, J.\, and Chen\, Z. (2014\, July). Knowledge Graph Embedding by Translating on Hyperplanes. In AAAI (Vol. 14\, pp. 1112-1119).\n Bordes\, A.\, Weston\, J.\, Collobert\, R.\, and Bengio\, Y. (2011\, August). Learning Structured Embeddings of Knowledge Bases. In AAAI (Vol. 6\, No. 1\, p. 6).\n Wang\, Q.\, Mao\, Z.\, Wang\, B.\, and Guo\, L. (2017). Knowledge graph embedding: A survey of approaches and applications. IEEE Transactions on Knowledge and Data Engineering\, 29(12)\, 2724-2743.\n\n\n\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:362@lincs.fr DTSTART;TZID=Europe/Paris:20180307T140000 DTEND;TZID=Europe/Paris:20180307T150000 DTSTAMP:20180308T075630Z URL:https://www.lincs.fr/events/a-sliding-resolution-algorithm-for-hierarc hical-graph-clustering/ SUMMARY:A Sliding-Resolution Algorithm for Hierarchical Graph Clustering DESCRIPTION:We propose a novel algorithm for the hierarchical clustering of graphs. The algorithm is a simple but key modification of the Louvain algorithm based on some sliding-resolution scheme. In particular\, the most relevant clusterings\, corresponding to different resolutions\, are identified. The algorithm is parameter-free\, fast and memory efficient. Numerical experiments on both synthetic and real datasets show the performance of the algorithm.\n\nJoint work with Thomas Bonald (Telecom ParisTech)\, Alexandre Hollocou (Inria)\, Alexis Galland (Inria) CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:378@lincs.fr DTSTART;TZID=Europe/Paris:20180226T103000 DTEND;TZID=Europe/Paris:20180226T120000 DTSTAMP:20180222T072615Z URL:https://www.lincs.fr/events/etude-des-sous-graphes-typiques-des-graphe s-aleatoires-par-la-combinatoire-analytique/ SUMMARY:Étude des sous-graphes typiques des graphes aléatoires par la combinatoire analytique DESCRIPTION:Orateur : Élie de Panafieu\n\nLa question qui guidera l'exposé est l'étude de la loi limite du\nnombre de triangles dans un graphes aléatoire à n sommet et m = O(n)\nsommets. C'est aussi un prétexte pour présenter quelques outils de\ncombinatoire analytique (manipulation de séries génératrices). Les\nrésultats présentés sont classiques et ont été démontrés par Erdös et\nRényi en 1960 par des techniques probabilistes (méthodes du premier et\ndu second moment). L'intérêt de la preuve analytique est sa robustesse\n: elle s'étend naturellement à des familles de graphes plus complexes\,\nnotamment aux graphes dont la distribution des degrés suit une loi de\npuissance ("power-law" ou "scale-free networks" selon les auteurs)\, et\nqui se rencontrent dans de nombreuses applications -- mais nous\nn'aurons sans doute pas le temps d'aborder ces extensions... CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:377@lincs.fr DTSTART;TZID=Europe/Paris:20180221T140000 DTEND;TZID=Europe/Paris:20180221T150000 DTSTAMP:20180305T124821Z URL:https://www.lincs.fr/events/insensitivity-of-the-hydrodynamic-limit-of -ps-under-randomized-sqd-algorithms/ SUMMARY:Insensitivity of the Hydrodynamic Limit of PS under Randomized SQ(d) Algorithms DESCRIPTION:In many applications such as cloud computing\, managing server farm resources etc. an incoming task or job has to be matched with an appropriate server in order to minimise the latency associated with the processing. Ideally the best choice would be to match a job to the fastest available server. However when there are thousands of servers requiring the information on all server tasks is an overkill.\nPioneered in the 1990’s the idea of randomised sampling of a few servers was proposed by Vve- denskaya and Dobrushin in Russia and Mitzmenmacher in the US and popularised as the “power of two” schemes which basically means that sampling two servers randomly and sending the job to the “better” server (i.e. with the shortest queue\, or most resources) provides most of the benefits of sampling all the servers.\n\nIn the talk I will discuss multi-server processor sharing models under power-of-d routing scheme when service time distributions are general with finite mean. Previous works on these models as- sume that the service times are exponentially distributed and insensitivity was suggested through simulations. Showing insensitivity to service time distributions has remained an open problem. The difficulty is that for general service times the underlying Markovian model is more complex. Indeed it can be viewed as a Markov process on Z+ × R?+ . Using a measure valued process approach we first derive the hydrodynamic limit or mean field equation (MFE) for the empirical measure. The MFE is now characterized by a pde whose stationary point coincides with the fixed point in the case with exponential service times. This establishes the insensitivity of the fixed point. The techniques developed in this paper are applicable to study mean field limits for Markov processes on general state spaces and insensitivity properties of other queueing models.\n\nThis is joint work with Thirupathiah Vasantam (UW) and Arpan Mukhopadhyay (EPFL). CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:364@lincs.fr DTSTART;TZID=Europe/Paris:20180214T140000 DTEND;TZID=Europe/Paris:20180214T150000 DTSTAMP:20180215T114840Z URL:https://www.lincs.fr/events/network-slicing-games-enabling-statistical -multiplexing-of-multi-tenant-spatial-loads/ SUMMARY:Network Slicing Games: Enabling Statistical Multiplexing of Multi-tenant Spatial Loads DESCRIPTION:Next generation wireless architectures are expected to enable slices of shared wireless infrastructure which are customized to specific mobile operators/services. Given infrastructure costs and the stochastic nature of mobile services' spatial loads\, it is highly desirable to achieve efficient statistical multiplexing amongst network slices. This talk will introduce a simple dynamic resource sharing policy which allocates a `share' of a pool of (distributed) resources to each slice-- Share Constrained Proportionally Fair (SCPF). We give a characterization of the achievable performance gains over static slicing\, showing higher gains when a slice's spatial load is more 'imbalanced' than\, and/or 'orthogonal' to\, the aggregate network load. Under SCPF\, traditional network dimensioning translates to a coupled share dimensioning problem\, addressing the existence of a feasible share allocation given slices' expected loads and performance requirements. We provide a solution to robust share dimensioning for SCPF-based network slicing. Slices may wish to unilaterally manage their users' performance via admission control which maximizes their carried loads subject to performance requirements. We show this can be modeled as a ``traffic shaping" game with an achievable Nash equilibrium. Under high loads the equilibrium is explicitly characterized\, as are the gains in the carried load under SCPF vs. static slicing. Detailed simulations of a wireless infrastructure supporting multiple slices with heterogeneous mobile loads show the fidelity of our models and range of validity of our high load equilibrium analysis.\n\nJoint work with Pablo Caballero\, Jiaxiao Zheng\, Albert Banchs\, Xavier Costa\, Seung Jun Baek CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:376@lincs.fr DTSTART;TZID=Europe/Paris:20180212T140000 DTEND;TZID=Europe/Paris:20180212T153000 DTSTAMP:20180216T160056Z URL:https://www.lincs.fr/events/sequence-to-sequence-learning/ SUMMARY:Sequence to sequence learning DESCRIPTION:For the next reading group\, Édouard Pineau will talk about sequence-to sequence learning\, based on the two following references:\n\n\n Sutskever Ilya\, Oriol Vinyals\, and Quoc V. Le. "Sequence to sequence learning with\nneural networks." Advances in neural information processing systems. (2014)\n Bahdanau Dzmitry\, Kyunghyun Cho\, and Yoshua Bengio. "Neural machine translation by\njointly learning to align and translate." arXiv preprint arXiv:1409.0473 (2014).\n\n\n\n\n\n\n\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:361@lincs.fr DTSTART;TZID=Europe/Paris:20180202T140000 DTEND;TZID=Europe/Paris:20180202T150000 DTSTAMP:20180129T121422Z URL:https://www.lincs.fr/events/apple-vs-samsung-a-mathematical-battle/ SUMMARY:Apple vs. Samsung: a Mathematical Battle DESCRIPTION:\n\n\nAbstract:\nApple and Samsung have been fighting patent battles around the world. Come learn about the mathematics at the heart of one of these battles\, the error correcting codes used in 3G communication. We will give a gentle introduction to coding theory\, explain why this caused a legal battle\, and we will conclude by describing why President Obama ultimately vetoed the ruling by the court (the first time a president had used that veto power in nearly 30 years!).\n\n\nBiography:\nJim Davis\, Professor of Mathematics at the University of Richmond since 1988\, does research in combinatorics and error correcting codes. He spent two years working for Hewlett-Packard and he has 15 patents stemming from that work. He has published more than 50 papers\, including several with undergraduates as coauthors (one of those also has Sihem Mesnager as coauthor). Outside of mathematics\, he is an avid squash and bridge player.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:360@lincs.fr DTSTART;TZID=Europe/Paris:20180131T140000 DTEND;TZID=Europe/Paris:20180131T150000 DTSTAMP:20180129T121251Z URL:https://www.lincs.fr/events/an-efficient-data-protection-architecture- based-on-fragmentation-and-encryption/ SUMMARY:An Efficient Data Protection Architecture Based on Fragmentation and Encryption DESCRIPTION:In this presentation\, a completely revisited secure data storage and transmission scheme ispresented. This new scheme is based on an agnostic selective encryption methods combinedwith fragmentation and dispersion. Discrete Wavelet Transform (DWT) is used as thepreprocessing method to determine the selection process before encryption and toguarantee the agnostic property of the protection. Also\, General Purpose Graphic ProcessingUnit (GPGPU) is deployed to allow performance to be very efficient compared with fullencryption algorithms. During the protection process\, the data is fragmented to be privatefragments with small storage space and public fragments with large storage space. Then thedispersion step will distribute the fragments to different storage environments aiming atutilizing the convenient and inexpensive cloud storage space while provide security for thedata. This design\, with practical experimentations on different hardware configurations\,provides strong level of protection and good performance at the same time plus flexiblestorage dispersion schemes. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:358@lincs.fr DTSTART;TZID=Europe/Paris:20180129T103000 DTEND;TZID=Europe/Paris:20180129T120000 DTSTAMP:20180124T071122Z URL:https://www.lincs.fr/events/queuing-or-not-queuing-in-large-systems/ SUMMARY:Queuing or not Queuing? (in large systems) DESCRIPTION:Fabien Mathieu will talk about\nQueuing or not Queuing? (in large systems)\, and will mainly use the following reference :\n\nLoad balancing in large-scale systems with multiple dispatchers (Mark van der Boor\, Sem Borst\, Johan van Leeuwaarden\, 2017) CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:354@lincs.fr DTSTART;TZID=Europe/Paris:20180124T140000 DTEND;TZID=Europe/Paris:20180124T160000 DTSTAMP:20180125T075056Z URL:https://www.lincs.fr/events/performance-of-balanced-fairness-in-resour ce-pools-a-recursive-approach/ SUMMARY:Performance of Balanced Fairness in Resource Pools: A Recursive Approach DESCRIPTION:Understanding the performance of a pool of servers is crucial for proper dimensioning. One of the main challenges is to take into account the complex interactions between servers that are pooled to process jobs. In particular\, a job can generally not be processed by any server of the cluster due to various constraints like data locality. In this paper\, we represent these constraints by some assignment graph between jobs and servers. We present a recursive approach to computing performance metrics like mean response times when the server capacities are shared according to balanced fairness. While the computational cost of these formulas can be exponential in the number of servers in the worst case\, we illustrate their practical interest by introducing broad classes of pool structures that can be exactly analyzed in polynomial time. This extends considerably the class of models for which explicit performance metrics are accessible.This is a joint work with Thomas Bonald and Fabien Mathieu. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:357@lincs.fr DTSTART;TZID=Europe/Paris:20180115T103000 DTEND;TZID=Europe/Paris:20180115T120000 DTSTAMP:20180109T072117Z URL:https://www.lincs.fr/events/empirical-evaluation-of-gated-recurrent-ne ural-networks-on-sequence-modeling/ SUMMARY:Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling DESCRIPTION:Achille Salaün will talk about Recurrent Neural Networks and present the paper\n\nEmpirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling by Chung\, Gulcehre\, Cho\, and Bengio (NIPS 2014). CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:353@lincs.fr DTSTART;TZID=Europe/Paris:20180103T140000 DTEND;TZID=Europe/Paris:20180103T160000 DTSTAMP:20171129T080532Z URL:https://www.lincs.fr/events/reinforcement-learning-for-efficient-acces s-control-with-m2mh2h-traffic-in-lte-a-networks/ SUMMARY:Reinforcement Learning for Efficient Access Control with M2M/H2H traffic in LTE-A networks DESCRIPTION:Although many advantages are expected from the provision of services for M2M communications in cellular networks such as extended coverage\, security\, robust management and lower deployment costs\, coexistence with a large number of M2M devices is still an important challenge\, in part due to the difficulty in allowing simultaneous access. Although the random access procedure in LTE-A is adequate for H2H communications\, it is necessary to optimize this mechanism when M2M communications are considered. One of the proposed methods in 3GPP is Access Class Barring (ACB)\, which is able to reduce the number of simultaneous users contending for access. However\, it is still not clear how to adapt its parameters in dynamic or bursty scenarios\, such as those that appear when M2M communications are introduced.We propose a dynamic mechanism for ACB based on reinforcement learning\, which aims to reduce the impact that M2M communications have over H2H communications\, while at the same time ensuring that the KPIs for all users are in acceptable levels. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:355@lincs.fr DTSTART;TZID=Europe/Paris:20171218T103000 DTEND;TZID=Europe/Paris:20171218T120000 DTSTAMP:20180124T072251Z URL:https://www.lincs.fr/events/analyzing-the-mg1-queue-with-a-branching-p rocess/ SUMMARY:Analyzing the M/G/1 queue with a branching process DESCRIPTION:For the next session of the reading group\, \n\nCéline Comte will talk about \nAnalyzing the M/G/1 queue with a branching process\, and will mainly use the following references:\n\n- Some Problems in the Theory of Queues\, D.G. Kendall\, 1951.\n- Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain\, D.G. Kendall\, 1953.\n\nSlides of the presentation CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:356@lincs.fr DTSTART;TZID=Europe/Paris:20171213T140000 DTEND;TZID=Europe/Paris:20171213T150000 DTSTAMP:20171214T091829Z URL:https://www.lincs.fr/events/random-fixed-points-limits-and-systemic-ri sk/ SUMMARY:Random Fixed Points\, Limits and Systemic risk DESCRIPTION:Abstract: We consider vector fixed point (FP) equations in large\ndimensional spaces involving random variables\, and study their\nrealization-wise solutions. We have an underlying directed random\ngraph\, that defines the connections between various components of the\nFP equations. Existence of an edge between nodes i\,j implies the i-th\nFP equation depends on the j-th component. We consider a special case\nwhere any component of the FP equation depends upon an appropriate\naggregate of that of the random ``neighbor'' components. We obtain\nfinite dimensional limit FP equations (in a much smaller dimensional\nspace)\, whose solutions approximate the solution of the random FP\nequations for almost all realizations\, in the asymptotic limit (number\nof components increase). Our techniques are different from the\ntraditional mean-field methods\, which deal with stochastic FP equations\nin the space of distributions to describe the stationary distributions\nof the systems. In contrast our focus is on realization-wise FP\nsolutions. We apply the results to study systemic risk in a large\nfinancial heterogeneous network with many small institutions and one\nbig institution\, and demonstrate some interesting phenomenon.\nBiography: Kavitha Veeraruna completed my PhD with Indian Institute of\nScience in 2007. I have done two postdocs\, one at TIFR Bangalore and\nthen with Prof. Eitan Altman at INRIA. Currently I am working as an\nAssistant Professor at IIT Bombay Mumbai. CATEGORIES:Seminars,Youtube LOCATION:Doctoral Training Center (EIT Digital)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Doctoral Training Center (EIT Digital):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:352@lincs.fr DTSTART;TZID=Europe/Paris:20171206T140000 DTEND;TZID=Europe/Paris:20171206T160000 DTSTAMP:20171211T134018Z URL:https://www.lincs.fr/events/the-real-fuss-with-quantum-mechanics/ SUMMARY:The real fuss with quantum mechanics DESCRIPTION:Many foundational issues in quantum mechanics frustrate the experts and keep them up at night. Unfortunately\, when these concepts reach the greater public\, they are often misrepresented and oversimplified. I want to share with you some bewildering tales of quantum mechanics\, unabridged\, straight from the source. In this talk: The measurement problem\, delayed-choice erasure\, interaction-free measurements\, non-locality\, non-contextuality. This is not the usual cat-in-the-box talk. Get ready for the real s**t! CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:351@lincs.fr DTSTART;TZID=Europe/Paris:20171129T140000 DTEND;TZID=Europe/Paris:20171129T150000 DTSTAMP:20171129T141257Z URL:https://www.lincs.fr/events/predicting-user-qoe-from-qos-metrics-for-i nternet-applications-2/ SUMMARY:Predicting user QoE from QoS metrics for internet applications DESCRIPTION:Predicting the user Quality-of-Experience (QoE) for an internet application is a highly desirable feature in a number of situations. However\, directly measuring user QoE is extremely challenging\, due to its subjective nature. One common approach is to measure Quality-of-Service (QoS) metrics and use it to predict user QoE. In this presentation\, we show our efforts into understanding and predicting user QoE. First\, we will discuss state-of-the-art quality assessment methodologies. Then\, we will present several approaches to model user QoE from QoS metrics. Finally\, we show a few examples where we model user QoE from QoS metrics. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:349@lincs.fr DTSTART;TZID=Europe/Paris:20171122T140000 DTEND;TZID=Europe/Paris:20171122T150000 DTSTAMP:20180115T144323Z URL:https://www.lincs.fr/events/optimal-flow-segmentation-in-sdn-with-memo ry-constraints-a-reinforcement-learning-approach/ SUMMARY:Optimal flow segmentation in SDN with memory constraints: a reinforcement learning approach DESCRIPTION:Datacenter flow routing relies on packet-in messages generated by switches and directed to the controller upon new flows arrivals. The SDN controller reacts to packet-in events by installing forwarding rules in the memory of all switches along an optimized path. Since flow arrival rates can peak to millions per second\, a relevant constraint is represented by the scarce amount of TCAM memory on switches. We assume that if a routing table is full\, a flow will be routed on a default\, sub-optimal path. A viable solution is to restrict the optimized traffic to critical flows: this corresponds to performing traffic segmentation\, prioritizing larger flows over smaller flows. However\, choosing the optimal threshold to discriminate optimized flows from non-optimized flows is not a trivial task. This work focuses on learning the optimal flow segmentation policy under memory constraints. We formulate this task as a Markov decision problem. Based on the structure of the optimal stationary policy\, we propose a reinforcement learning algorithm tailored to the problem at hand. We prove it is adaptive\, correct and has a polynomial time complexity. Finally\, numerical experiments characterize the performance of the algorithm.Joint work with Francesco de Pellegrini (Fondazione Bruno Kessler)\, Lorenzo Maggi (Huawei Algorithmic and Mathematical Sciences Lab\, Paris) CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:347@lincs.fr DTSTART;TZID=Europe/Paris:20171120T103000 DTEND;TZID=Europe/Paris:20171120T120000 DTSTAMP:20171113T070443Z URL:https://www.lincs.fr/events/non-negative-matrix-factorization/ SUMMARY:Non-negative matrix factorization DESCRIPTION:Thomas Bonald will talk about non-negative matrix factorization. CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:346@lincs.fr DTSTART;TZID=Europe/Paris:20171115T140000 DTEND;TZID=Europe/Paris:20171115T150000 DTSTAMP:20171110T083603Z URL:https://www.lincs.fr/events/optimal-joint-subcarrier-and-power-allocat ion-in-power-domain-noma-is-strongly-np-hard-complexity-analysis/ SUMMARY:Optimal Joint Subcarrier and Power Allocation in Power-Domain NOMA is Strongly NP-Hard: Complexity Analysis DESCRIPTION:Non-orthogonal multiple access (NOMA) is a promising radio access technology for 5G. It allows several users to transmit on the same frequency and time resource by performing power-domain multiplexing. At the receiver side\, successive interference cancellation (SIC) is applied to mitigate interference among the multiplexed signals. In this way\, NOMA can outperform orthogonal multiple access schemes used in conventional cellular networks in terms of spectral efficiency and allows more simultaneous users. We investigate the computational complexity of joint subcarrier and power allocation problems in multi-carrier NOMA systems. In this talk\, we will show that these problems are strongly NP-hard for a large class of objective functions\, namely the weighted generalized means of the individual data rates. This class covers the popular weighted sum-rate\, proportional fairness\, harmonic mean and max-min fairness utilities. This result implies that the optimal power and subcarrier allocation cannot be computed in polynomial time in the general case\, unless P = NP. Nevertheless\, we present some heuristics and show their performance through numerical results. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:345@lincs.fr DTSTART;TZID=Europe/Paris:20171106T103000 DTEND;TZID=Europe/Paris:20171106T120000 DTSTAMP:20171026T173413Z URL:https://www.lincs.fr/events/one-dimensional-non-deterministic-random-w alks/ SUMMARY:One-dimensional non-deterministic random walks DESCRIPTION:Élie de Panafieu will present some current work about one-dimensional\, non-deterministic\, random walks. CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:344@lincs.fr DTSTART;TZID=Europe/Paris:20171025T140000 DTEND;TZID=Europe/Paris:20171025T150000 DTSTAMP:20171025T200304Z URL:https://www.lincs.fr/events/will-productivity-growth-return-in-the-new -digital-era/ SUMMARY:Will productivity growth return in the new digital era? DESCRIPTION:It is increasingly acknowledged that we are on the verge of the next technological and industrial revolution\, driven by the digitization and interconnection of physical elements and infrastructure under the control of advanced intelligent systems. Therefore\, there will be a new era of automation that should result in enhanced productivity. However\, such productivity enhancements have been anticipated before\, e.g\, the revolution commonly known as the ‘information age’\, and have failed to materialize. Were the productivity increases observed following the earlier industrial revolutions a one-time aberration that will not be repeated in the new digital age? In this paper\, we attempt to address this question by a quantitative analysis of the prior productivity jumps and their physical technological origins\, and extend this analysis to the latent set of analogous digital technologies. This approach leverages a correlation we observe between the diffusion of key infrastructure technologies and productivity jumps. We use data from 1875 to 1985 from the US and data from 1950 to 2015 in China and India to demonstrate this non-linear correlation. Amongst the predictions of the model\, we see a possible productivity jump in the United States in the 2030s timeframe when the aggregate of the constituent digital technologies passes the tipping point of 50-60 percent penetration.\nJoint work with Marcus Weldon\, Sanjay Kamat\, Subra Prakash CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:343@lincs.fr DTSTART;TZID=Europe/Paris:20171023T103000 DTEND;TZID=Europe/Paris:20171023T120000 DTSTAMP:20171025T074815Z URL:https://www.lincs.fr/events/poisson-games/ SUMMARY:Poisson games DESCRIPTION:François Durand will present an introduction to Poisson games based on the two following articles:\n\n\n R. Myerson. Large Poisson Games. Journal of Economic Theory\, 94:7–45\, 2000.M\n R. Myerson and R.J. Weber. A Theory of Voting Equilibria. American Political Science Review\, 87:102–114\, 1993.\n\n\nSlides of the presentation\n\n\n\n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:342@lincs.fr DTSTART;TZID=Europe/Paris:20171011T140000 DTEND;TZID=Europe/Paris:20171011T150000 DTSTAMP:20171011T184717Z URL:https://www.lincs.fr/events/multi-area-interchange-scheduling-under-un certainty/ SUMMARY:Multi-Area Interchange Scheduling under Uncertainty DESCRIPTION:Large interconnected power systems are often operated by\nindependent system operators\, each having its own operating region\nwithin which internal resources are used economically. The operating\nregions are connected physically by tie lines that allow one operator\nto import from or export to its neighbors for better utilization of\noverall system resources.In this talk\, we present some recent results\non the optimal scheduling of interchange among independently operated\npower systems in the presence of uncertainty. Based on the idea of\nclassic coordinate descent method\, we propose an interface-by-interface\nscheduling algorithm which is compatible to the current industrial\npractice in the electric grid of U.S. and applied to synchronous and\nasynchronous scheduling schemes CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:340@lincs.fr DTSTART;TZID=Europe/Paris:20171004T140000 DTEND;TZID=Europe/Paris:20171004T150000 DTSTAMP:20171004T133230Z URL:https://www.lincs.fr/events/adaptive-video-streaming-towards-a-systema tic-comparison-of-icn-and-tcpip/ SUMMARY:Adaptive Video Streaming: Towards a systematic comparison of ICN and TCP/IP DESCRIPTION:Streaming of video contents over the Internet isexperiencing an unprecedented growth. While video permeatesevery application\, it also puts tremendous pressure in the network --to support users having heterogeneous accesses and expectinghigh quality of experience\, in a furthermore cost-effectivemanner. In this context\, Future Internet (FI) paradigms\, suchas Information Centric Networking (ICN)\, are particularly wellsuited to not only enhance video delivery at the client (as in theDASH approach)\, but to also naturally and seamlessly extendvideo support deeper in the network functions.In this talk\, we contrast ICN and TCP/IP with an experimentalapproach\, where we employ several state-of-the-artDASH controllers (PANDA\, AdapTech\, and BOLA) on an ICN vsTCP/IP network stack. Our campaign\, based on tools which wedeveloped and made available as open-source software\, includesmultiple clients (homogeneous vs heterogeneous mixture\, synchronousvs asynchronous arrivals)\, videos (up to 4K resolution)\,channels (e.g.\, DASH profiles\, emulated WiFi and LTE\, real3G/4G traces)\, and levels of integration with an ICN network(i.e.\, vanilla NDN\, wireless loss detection and recovery at theaccess point\, load balancing). Our results clearly illustrate\, aswell as quantitatively assess\, benefits of ICN-based streaming\,warning about potential pitfalls that are however easy to avoid. Overall\, our work constitutes a first milestonetowards a fair and complete assessment of fully fledged NDNvideo distribution systems\, and their comparison with state ofthe art CDN technologies implemented over a classic TCP/IPstack\, which is part of our ongoing work and that we briefly discuss. Part of this work will appear in IEEE Transactions on Multimedia\, October 2017 issue. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:322@lincs.fr DTSTART;TZID=Europe/Paris:20170927T140000 DTEND;TZID=Europe/Paris:20170927T150000 DTSTAMP:20171003T111720Z URL:https://www.lincs.fr/events/active-hypothesis-testing-learning-to-matc h-in-expert-systems/ SUMMARY:Active Hypothesis Testing: Learning to Match in Expert Systems DESCRIPTION:We study adaptive matching in expert systems\, as an instance of adaptive sequential hypothesis testing. Examples of such systems include Q&\;A platforms\, crowdsourcing\, image classification. Consider a system that receives tasks or jobs to be classified into one of a set of given types. The system has access to a set of workers\, or experts\, and the expertise of a worker is defined by the jobs he is able to classify and the error in his response. This active sequential hypothesis testing problem was first addressed by Chernoff in 1959\, whereby experts to be queried are selected according to how much information they provide. In this talk we will begin with an overview of past work on this topic\, then consider our model where we assume access to less fine-grained information about the expertise of workers. We propose a gradient-based algorithm\, show its optimality and through numerical results show that it outperforms the Chernoff-like algorithms. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:320@lincs.fr DTSTART;TZID=Europe/Paris:20170921T160000 DTEND;TZID=Europe/Paris:20170921T173000 DTSTAMP:20170920T055522Z URL:https://www.lincs.fr/events/why-deep-neural-networks/ SUMMARY:Why deep neural networks ? DESCRIPTION:Anne Bouillard will present the paper Why deep neural networks ?\, by Shiyu Liang and R. Srikant\, 2016. \n CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:323@lincs.fr DTSTART;TZID=Europe/Paris:20170920T140000 DTEND;TZID=Europe/Paris:20170920T151500 DTSTAMP:20170925T084426Z URL:https://www.lincs.fr/events/qoe-aware-service-and-network-management-f or-video-streaming/ SUMMARY:QoE-Aware Service and Network Management for Video Streaming DESCRIPTION:Today's consumer Internet traffic is transmitted on a best effort basis without taking into account any quality requirements. The backbone and the wireless access networks lack service guarantees for the predominant consumer Internet traffic\, with video streaming being responsible for 60% of the traffic share. As services rely on interconnected networks\, service performance and thus user satisfaction depend on network performance. Consequently\, it is of utmost importance to understand the relationships between user-perceived Quality of Experience (QoE)\, and network performance as described by Quality of Service (QoS) parameters.However\, in general the network does neither know which Internet applications it is carrying nor which quality requirements have to be met. To be able to meet the demands of applications and users in the network\, QoE-aware service and network management is proposed which requires an information exchange between applications and network. From a conceptual perspective\, this requires three basic research steps: modeling\, monitoring\, and optimization of QoE. The first part of this talk covers QoE management and monitoring approaches\, while the second part highlights concrete examples in order to demonstrate how QoE-aware network and service management may improve the user-perceived quality of video streaming. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:324@lincs.fr DTSTART;TZID=Europe/Paris:20170906T140000 DTEND;TZID=Europe/Paris:20170906T150000 DTSTAMP:20170925T085357Z URL:https://www.lincs.fr/events/learning-the-network-of-a-linear-dynamical -system-from-ambient-fluctuations/ SUMMARY:Learning the Network of a Linear Dynamical System from Ambient Fluctuations DESCRIPTION:Linear Dynamical Systems are used to model several evolving network processes in biology\, physical systems as well as financial networks. Estimation of the topology of a linear dynamical system is thus of interest for learning and control in diverse domains. This talk presents a useful framework for topology estimation for general linear dynamical networks (loopy or radial) using time-series measurements of nodal states. The learning framework utilizes multivariate Wiener filtering to unravel the interaction between fluctuations in states at different nodes and identifies operational edges by considering the phase response of the elements of the multivariate Wiener filter. The benefit derived by considering samples from ambient dynamics v/s steady state measurements will be described along with extensions\, discussion of sample and computational complexity and open questions. In particular\, we discuss one application related to topology estimation in power grids using samples of nodal voltage phase angles collected from the swing equations. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:314@lincs.fr DTSTART;TZID=Europe/Paris:20170712T140000 DTEND;TZID=Europe/Paris:20170712T150000 DTSTAMP:20170925T103916Z URL:https://www.lincs.fr/events/economic-models-for-wireless-sensor-networ k-based-services/ SUMMARY:Economic models for wireless sensor network-based services DESCRIPTION:The Internet of Things is one of the hottest topics being debated today across industries worldwide. Successful IoT deployment needs sustainable business models that are well understood. This seminar will present such business models\, its rationale and the analytical models used for their discussion. The proposals are drawn from the research conducted recently by the speaker.The business models are based on service providers that intermediate between wireless sensor networks that sense data and users that benefit from enhanced service build around the sensed data. Scenarios where the service provider operates without and with competition are modelled\, analyzed and discussed. The modelling and analysis tools are borrowed from microeconomics\, optimization and game theory.The seminar will present some scenarios and the models employed for the analysis of each one. Then it will proceed to present the analysis performed and\, finally\, it will discuss the results of the analysis. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:325@lincs.fr DTSTART;TZID=Europe/Paris:20170710T143000 DTEND;TZID=Europe/Paris:20170710T150000 DTSTAMP:20170925T103632Z URL:https://www.lincs.fr/events/incentive-mechanism-design-for-public-cryp tocurrencies/ SUMMARY:Incentive Mechanism Design for Public Cryptocurrencies DESCRIPTION:Presentation for the Working Group on BitCoin. CATEGORIES:Working Group,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:319@lincs.fr DTSTART;TZID=Europe/Paris:20170710T140000 DTEND;TZID=Europe/Paris:20170710T143000 DTSTAMP:20170925T103210Z URL:https://www.lincs.fr/events/fairness-in-block-chain-systems/ SUMMARY:Fairness in block-chain systems DESCRIPTION:Abstract: Formal security analyses for block-chains derived the famous\n"honest majority" assumption: the system well-behaves only if the\nmajority of the hashing power is in the hands of honest miners. This\nresult has been proven without taking into consideration economic\naspects related to miner's incentives and their rational behavior.\nOther works analyzed selfish mining with respect to incentives and\nconcluded that the majority assumption is not enough under certain\nconditions. All these studies make the implicit assumption that the\nhealth of the system is only in the hands of miners\, but what about if\nall the users leave the system. Since the system is composed of miners\nand users and since these two sets are disjoint in practice\, block\nchain's health strictly relates to the capacity of promoting honest\nparticipation both for miners and users. In this talk we explore the\nrelationship between participation and the notion of fairness. In\ngeneral terms\, fairness can be defined as the overall satisfaction of\njustified expectations of the participants. If a block-chain system is\nfair\, then its participants will tend to stay in the system\, otherwise\nthey may leave. We analyze user and miner strategies that are currently\npossible in BitCoin-like implementations\, and we show that existing\nblock-chain systems are not fair for their users. We finally discuss\nnew ways for improvement arguing that novel redistribution mechanisms\nare needed to promote participation of all nodes. CATEGORIES:Working Group,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:313@lincs.fr DTSTART;TZID=Europe/Paris:20170705T140000 DTEND;TZID=Europe/Paris:20170705T150000 DTSTAMP:20170705T133355Z URL:https://www.lincs.fr/events/tba-7/ SUMMARY:Global Measurements of Internet Censorship DESCRIPTION:\n\n\nAbstract:\nInternet users in many countries around the world are subject to various forms of censorship and information control. Despite its widespread nature\, however\, measuring Internet censorship on a global scale has remained an elusive goal. Internet censorship is known to vary across time and within regions (and Internet Service Providers) within a country. To capture these complex dynamics\, Internet censorship measurement must be both continuous and distributed across a large number of vantage points. To date\, gathering such information has required recruiting volunteers to perform measurements from within countries of interest\; this approach does not permit collection of continuous measurements\, and it also does not permit collection from a large number of measurement locations\; it may also put the people performing the measurements at risk. Over the past four years\, we have developed a collection of measurement techniques to surmount the limitations of these conventional approaches. In this talk\, I will describe three such techniques: (1) Encore\, a tool that performs cross-origin requests to measure Web filtering\; (2) Augur\, a tool that exploits side-channel information in the Internet Protocol (IP) to measure filtering using network-level access control lists\; and (3) a tool to measure DNS filtering using queries through open DNS resolvers. These three tools allow us—for the first time ever—to characterize Internet censorship continuously\, from hundreds of countries around the world\, at different layers of the network protocol stack. each of these techniques involves both technical and ethical challenges. I will describe some of the challenges that we faced in designing and implementing these tools\, how we tackled these challenges\, our experiences with measurements to date\, and our plans for the future. Long term\, our goal is to collaborate with social scientists to bring data to bear on a wide variety of questions concerning Internet censorship and information control\; I will conclude with an appeal to cross-disciplinary work in this area and some ideas for how computer scientists and social scientists might work together on some of these pressing questions going forward.This research is in collaboration with Sam Burnett\, Roya Ensafi\, Paul Pearce\, Ben Jones\, Frank Li\, and Vern Paxson.\n\n\nBiography:\nNick Feamster is a professor in the Computer Science Department at Princeton University and the Deputy Director of the Princeton University Center for Information Technology Policy (CITP). Before joining the faculty at Princeton\, he was a professor in the School of Computer Science at Georgia Tech. He received his Ph.D. in Computer science from MIT in 2005\, and his S.B. and M.Eng. degrees in Electrical Engineering and Computer Science from MIT in 2000 and 2001\, respectively. Nick’s research focuses on improving the security and performance of communications networks with systems that draw on advanced Internet measurement\, data analytics\, and machine learning. Nick is an ACM Fellow. Among other awards\, he received the Presidential Early Career Award for Scientists and Engineers (PECASE) for his contributions to cybersecurity\, the Technology Review 35 "Top Young Innovators Under 35" award\, and the ACM SIGCOMM Rising Star Award.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:327@lincs.fr DTSTART;TZID=Europe/Paris:20170628T140000 DTEND;TZID=Europe/Paris:20170628T150000 DTSTAMP:20170925T110432Z URL:https://www.lincs.fr/events/competitive-caching-of-contents-in-5g-edge -cloud-networks/ SUMMARY:Competitive Caching of Contents in 5G Edge Cloud Networks DESCRIPTION:The surge of mobile data traffic forces network operators to cope with capacity shortage. The deployment of small cells in 5G networks is meant to increase radio access capacity. Mobile edge computing technologies\, in turn\, can be used in order to manage dedicated cache space memory inside the radio access network\, thus reducing latency and backhaul traffic. Mobile network operators will be able to provision content providers with new caching services to enhance the quality of experience of their customers on the move. Cache memory in the mobile edge network will become a shared resource.We study a competitive caching scheme where contents are stored at given price set by the mobile network operator. We first formulate a resource allocation problem for a tagged content provider seeking to minimize the expected missed cache rate. The optimal caching policy is derived accounting for popularity and availability of contents\, the spatial distribution of small cells\, and the caching strategies of competing content providers. It is showed to induce a specific order on contents to be cached based on their popularity and availability.Next\, we study a game among content providers in the form of a generalized Kelly mechanism with bounded strategy sets and heterogeneous players. Existence and uniqueness of the Nash equilibrium are proved. Numerical results validate and characterize the performance of the system and the convergence to the Nash equilibrium. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:330@lincs.fr DTSTART;TZID=Europe/Paris:20170623T141500 DTEND;TZID=Europe/Paris:20170623T144500 DTSTAMP:20170927T193449Z URL:https://www.lincs.fr/events/kleinbergs-grid-unchained/ SUMMARY:Kleinberg's Grid Unchained DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:332@lincs.fr DTSTART;TZID=Europe/Paris:20170623T110000 DTEND;TZID=Europe/Paris:20170623T111500 DTSTAMP:20170927T194035Z URL:https://www.lincs.fr/events/toward-automated-recommendation-of-iot-ser vices/ SUMMARY:Toward automated recommendation of IoT services DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:328@lincs.fr DTSTART;TZID=Europe/Paris:20170623T104500 DTEND;TZID=Europe/Paris:20170623T110000 DTSTAMP:20170927T192558Z URL:https://www.lincs.fr/events/massively-parallel-feature-selection-for-b ig-dimensionality-data/ SUMMARY:Massively-Parallel Feature Selection for Big Dimensionality Data DESCRIPTION:Talk from the LINCS Workshop CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:338@lincs.fr DTSTART;TZID=Europe/Paris:20170623T093000 DTEND;TZID=Europe/Paris:20170623T101500 DTSTAMP:20170927T195550Z URL:https://www.lincs.fr/events/studying-large-networks-and-graphical-data -via-local-weak-limit-theory/ SUMMARY:Studying large networks and graphical data via local weak limit theory DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:334@lincs.fr DTSTART;TZID=Europe/Paris:20170622T173000 DTEND;TZID=Europe/Paris:20170622T181500 DTSTAMP:20170927T194637Z URL:https://www.lincs.fr/events/future-directions-in-wireless-networking/ SUMMARY:Future Directions in Wireless Networking DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:329@lincs.fr DTSTART;TZID=Europe/Paris:20170622T171500 DTEND;TZID=Europe/Paris:20170622T173000 DTSTAMP:20170927T193006Z URL:https://www.lincs.fr/events/stream-processing-for-monitoring-of-real-t ime-network-services/ SUMMARY:Stream processing for monitoring of real-time network services DESCRIPTION:Talk from the LINCS workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:331@lincs.fr DTSTART;TZID=Europe/Paris:20170622T170000 DTEND;TZID=Europe/Paris:20170622T171500 DTSTAMP:20170927T193805Z URL:https://www.lincs.fr/events/blockchains-and-incentives/ SUMMARY:Blockchains and incentives DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:333@lincs.fr DTSTART;TZID=Europe/Paris:20170622T163000 DTEND;TZID=Europe/Paris:20170622T170000 DTSTAMP:20170927T194306Z URL:https://www.lincs.fr/events/understanding-performance-of-large-cellula r-networks-data-and-models/ SUMMARY:Understanding Performance of Large Cellular Networks — Data and Models DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:339@lincs.fr DTSTART;TZID=Europe/Paris:20170622T143000 DTEND;TZID=Europe/Paris:20170622T160000 DTSTAMP:20170927T195840Z URL:https://www.lincs.fr/events/phds-and-postdocs-presentations/ SUMMARY:PhDs and PostDocs' Presentations DESCRIPTION:LINCS younglings present their work in a few minutes for the LINCS workshop CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:335@lincs.fr DTSTART;TZID=Europe/Paris:20170622T121500 DTEND;TZID=Europe/Paris:20170622T123000 DTSTAMP:20170927T194841Z URL:https://www.lincs.fr/events/adaptive-matching-in-expert-systems/ SUMMARY:Adaptive Matching in Expert Systems DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:337@lincs.fr DTSTART;TZID=Europe/Paris:20170622T101500 DTEND;TZID=Europe/Paris:20170622T104500 DTSTAMP:20170927T195326Z URL:https://www.lincs.fr/events/webrowse-a-passive-crowdsourced-content-di scovery-platform-for-communities-of-a-place/ SUMMARY:WeBrowse: a passive crowdsourced content discovery platform for communities of a place DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:336@lincs.fr DTSTART;TZID=Europe/Paris:20170622T093000 DTEND;TZID=Europe/Paris:20170622T101500 DTSTAMP:20170927T195057Z URL:https://www.lincs.fr/events/traveling-salesman-in-reverse-conditional- markov-entropy-for-mobility-trajectory-segmentation/ SUMMARY:Traveling Salesman in Reverse: Conditional Markov Entropy for Mobility Trajectory Segmentation DESCRIPTION:Talk from the LINCS Workshop. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:326@lincs.fr DTSTART;TZID=Europe/Paris:20170621T140000 DTEND;TZID=Europe/Paris:20170621T150000 DTSTAMP:20170925T104643Z URL:https://www.lincs.fr/events/perennial-and-personalized-sensing-through -wireless-energy/ SUMMARY:Perennial and Personalized Sensing through Wireless Energy DESCRIPTION:In a future where implanted and wearable sensors continuously report physiological data\, how to power such sensors without battery replacement and developing new communication methods that are safe for human tissues remain as unexplored frontier. This talk describes recent advances in designing systems and protocols for contactless wireless charging using using RF waves and the use of weak electrical currents for data transfer among body implants. It explores the fundamental tradeoffs that exist between achieving high data and recharging rates\, constructive mixing of radiated signals through beamforming\, MAC protocols that allow differential data/energy access\, and the promise of simultaneous transfer of data over energy. The talk shall also cover some latest results in charging sensors purely from ambient cellular signals in Boston city. On the implant side\, advances in channel modeling and topology placement strategies are discussed with experimental results on low-overhead data transfers from an embedded implant to an on-skin relay node. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:317@lincs.fr DTSTART;TZID=Europe/Paris:20170613T160000 DTEND;TZID=Europe/Paris:20170613T173000 DTSTAMP:20170608T053656Z URL:https://www.lincs.fr/events/mechanism-design/ SUMMARY:Mechanism Design DESCRIPTION:Continuation of last week's presentation CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:312@lincs.fr DTSTART;TZID=Europe/Paris:20170607T140000 DTEND;TZID=Europe/Paris:20170607T150000 DTSTAMP:20170607T152110Z URL:https://www.lincs.fr/events/tba-6/ SUMMARY:Distributed coordination of air-conditioning loads to provide demand-side flexibility to the power grid DESCRIPTION:As we move away from fossil fuels toward renewable energy\nsources such as solar and wind\, inexpensive energy storage technologies\nare required. This is so since renewable energy sources\, such as solar\nand wind\, are intermittent. An alternative to batteries --which are\nquite expensive-- is "smart loads". With appropriate intelligence\, the\npower consumption of air conditioning --and many other loads-- can be\nvaried around a baseline. This variation is analogous to the charging\nand discharging of a battery. Loads equipped with such intelligence\nhave the potential to provide a vast and inexpensive source of energy\nstorage. Two principal challenges in creating a reliable virtual\nbattery from millions of consumer loads include (1) maintaining\nconsumers' Quality of Service (QoS) within strict bounds\, and (2)\ncoordinating the actions of loads with minimal communication to ensure\naccurate reference tracking by the aggregate. This talk summarizes our\nwork in addressing these two challenges. In particular\, I will present\nin some detail a method for ensuring reliable coordination in the\npresence of uncertainty without inter-load communication\, which is a\nfrequently used method for coordination. In contrast\, our approach\nachieves reliable coordination by using a combination of one-way\nbroadcast from the grid operator\, and locally obtained frequency\nmeasurements at the loads that provide valuable global information.\nWeb CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:316@lincs.fr DTSTART;TZID=Europe/Paris:20170606T160000 DTEND;TZID=Europe/Paris:20170606T173000 DTSTAMP:20170606T071553Z URL:https://www.lincs.fr/events/introduction-to-mechanism-design/ SUMMARY:Introduction to mechanism design DESCRIPTION: CATEGORIES:Network Theory LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:315@lincs.fr DTSTART;TZID=Europe/Paris:20170529T140000 DTEND;TZID=Europe/Paris:20170529T150000 DTSTAMP:20170523T122107Z URL:https://www.lincs.fr/events/hybrid-energy-harvesting-wireless-systems/ SUMMARY:Hybrid Energy Harvesting Wireless Systems: Performance Evaluation and Insights DESCRIPTION:\n\n\nAbstract:\nEnergy harvesting (EH) is an attractive and green solution to the problem of limited lifetime of wireless sensor networks. Unlike a conventional node that dies once it runs out of energy\, an EH node harvests energy from the environment and replenishes its rechargeable battery. We investigate a new class of hybrid networks that comprise both EH and conventional nodes and differ from conventional and all-EH wireless sensor networks. We argue that the performance criteria that are used to evaluate conventional and all-EH networks are no longer suitable to evaluate this new class of networks. We propose two new and insightful performance criteria called k-outage duration and n-transmission duration to evaluate these networks. They overcome the pitfalls associated with defining lifetime\, which arise because the EH nodes never die but can occasionally run out of energy\, and capture the dynamic time evolution\, which occurs because the conventional nodes irreversibly drain their batteries. They also account for the inability of the nodes to transmit data due to insufficient battery energy and channel fading. We present computationally efficient novel bounds for evaluating these criteria and gain several insights about the behavior of these networks.\n\n\nBiography:\nNeelesh B. Mehta received his B. Tech degree in Electronics and Communications Engineering from the Indian Institute of Technology (IIT) Madras\, in 1996\, and M.S. and Ph.D. degrees in Electrical Engineering from the California Institute of Technology\, Pasadena\, USA\, in 1997 and 2001\, respectively. He is a Professor in the Department of Electrical Communication Engineering at the Indian Institute of Science (IISc)\, Bangalore. Prior to joining IISc in 2009\, he served as a research scientist in USA from 2001 to 2007 in companies such as AT&T Research Labs\, Broadcom Corporation\, and Mitsubishi Electric Research Labs (MERL). \nHis research focuses on wireless communications. He has worked on topics related to 3G\, 4G\, and 5G cellular communication standards\, energy harvesting and green wireless sensor networks\, cognitive radio\, cooperative communications\, multi-antenna technologies\, and multiple access protocols. He has published 60+ papers in IEEE journals\, 3 book chapters\, and 70+ conference papers. He is a co-inventor of 30+ issued US patents on these topics. \nHe served on the Board of Governors of the IEEE Communications Society from 2012-15. He is a Fellow of the Indian National Academy of Engineering (INAE) and the National Academy of Sciences India (NASI). He is a recipient of the Swarnajayanti Fellowship\, NASI-Scopus Young Scientist award\, Hari Om Ashram Prerit Vikram Sarabhai Research Award\, and the INAE Young Engineer award. He serves as an editor of the IEEE Transactions on Communications and as an Executive Editor of the IEEE Transactions on Wireless Communications.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:311@lincs.fr DTSTART;TZID=Europe/Paris:20170524T140000 DTEND;TZID=Europe/Paris:20170524T150000 DTSTAMP:20170523T074251Z URL:https://www.lincs.fr/events/what-can-be-achieved-in-energy-efficiency- for-cellular-wireless-communications/ SUMMARY:What Can be Achieved in Energy Efficiency for Cellular Wireless Communications DESCRIPTION:\n\n\nAbstract:\nConventional cellular wireless networks were designed with the purpose of providing high throughput for the user and high capacity for the service provider\, without any provisions of energy efficiency. As a result\, these networks have an enormous Carbon footprint. For example\, only in the United States\, the Carbon footprint of the cellular wireless industry is equal to that of about 3/4 million cars. In addition\, the cellular network is highly inefficient and therefore a large part of the energy dissipated is wasted.In this presentation\, we first analyze the energy dissipation in cellular wireless networks and point to sources of major inefficiency. We also discuss how much more mobile traffic is expected to increase so that this Carbon footprint will increase tremendously more. We then discuss potential sources of improvement at the physical layer as well as at higher layers of the communication protocol hierarchy. For the physical layer\, we discuss new modulation formats and new device technologies and what they may bring in terms of energy efficiency gain. At higher layers\, considering that most of the energy inefficiency in cellular wireless networks is at the base stations\, we discuss multi-tier networks and point to the potential of exploiting mobility patterns in order to use base station energy judiciously. We discuss link adaptation and point to why energy efficiency\, and not power efficiency should be pursued and what it means for the choice of link rates. We show how much gain is possible by energy-efficient link rate adaptation. We describe the gains due to the exploitation of nonuniform traffic in space\, relays and cooperation\, device-to-device communications\, multiple antenna technques\, and in particular coordinated multipoint and massive MIMO\, sleeping modes for the base stations\, the techniques of cell breathing and cell zooming\, the energy trap problem for the mobile terminals\, and the potential approaches for video that provide energy efficiency. We also review several survey papers and books published on this topic. By a consideration of the combination of all potential gains\, we conclude that an improvement in energy consumption in cellular wireless networks by orders of magnitude is possible. The lecture will present in detail where to concentrate research to achieve the largest gains.\n\n\nBiography:\nEnder Ayanoglu received the M.S. and Ph.D. degrees from Stanford University\, Stanford\, CA in 1982 and 1986\, respectively\, in electrical engineering. He was with the Communications Systems Research Laboratory\, part of AT&\;T Bell Laboratories\, Holmdel\, NJ until 1996\, and Bell Labs\, Lucent Technologies until 1999. From 1999 until 2002\, he was a Systems Architect at Cisco Systems\, Inc.\, San Jose\, CA. Since 2002\, he has been a Professor in the Department of Electrical Engineering and Computer Science\, University of California\, Irvine\, Irvine\, CA\, where he served as the Director of the Center for Pervasive Communications and Computing and held the Conexant-Broadcom Endowed Chair during 2002-2010. His past accomplishments include invention of the 56K modems\, characterization of wavelength conversion gain in Wavelength Division Multiplexed (WDM) systems\, and diversity coding\, a technique for link failure recovery in communication networks employing erasure coding in 1990\, prior to the publication of the first papers on network coding. During 2000-2001\, he served as the founding chair of the IEEE-ISTO Broadband Wireless Internet Forum (BWIF)\, an industry standards organization which developed and built a broadband wireless system employing Orthogonal Frequency Division Multiplexing (OFDM) and a Medium Access Control (MAC) algorithm that providesQuality-of-Service (QoS) guarantees. This system is the precursor of today’s Fourth Generation (4G) cellular wireless systems such as WiMAX\, LTE\, and LTEAdvanced. From 1993 until 2014 Dr. Ayanoglu was an Editor\, and since January 2014 is a Senior Editor of the IEEE Transactions on Communications. He served as the Editor-in-Chief of the IEEE Transactions onCommunications from 2004 to 2008. From 1990 to 2002\, he served on the Executive Committee of the IEEE Communications Society Communication Theory Committee\, and from 1999 to 2001\, was its Chair. Currently\, he is serving as the founding Editor-in-Chief of the IEEE Transactions on Green Communications and Networking. Dr. Ayanoglu is the recipient of the IEEE Communications Society Stephen O. Rice Prize Paper Award in 1995 and the IEEE Communications Society Best Tutorial Paper Award in 1997. He has been an IEEE Fellow since 1998.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:309@lincs.fr DTSTART;TZID=Europe/Paris:20170523T160000 DTEND;TZID=Europe/Paris:20170523T170000 DTSTAMP:20170512T074918Z URL:https://www.lincs.fr/events/ukkonen-algorithm-and-co/ SUMMARY:Ukkonen algorithm and Co DESCRIPTION: CATEGORIES:Network Theory,Working Group LOCATION:Telecom Paristech\, I304 (3rd floor)\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom Paristech\, I304 (3rd floor):geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:308@lincs.fr DTSTART;TZID=Europe/Paris:20170517T150000 DTEND;TZID=Europe/Paris:20170517T160000 DTSTAMP:20170512T074811Z URL:https://www.lincs.fr/events/high-capacity-wireless-networks-architectu res-through-collaboration-and-intelligent-information-storage/ SUMMARY:High capacity wireless networks architectures through collaboration and intelligent information storage DESCRIPTION:\n\n\nAbstract:\nA significant portion of today's network traffic is due to recurring downloads of popular content (e.g.\, movies\, video clips and daily news). It has been observed that replicating the latter in caches installed at the network edge -close to the users- can drastically reduces network bandwidth usage and improve content access delay. The key technical issues in emergent caching architectures relate to the following questions: where to install caches\, what content and for how long to cache\, and how to manage the routing of content within the network. In this talk\, an overview of caching is provided\, starting with generic architectures that can be applied to different networking environments\, and moving to emerging architectures that enable caching in wireless networks (e.g.\, at cellular base stations and WiFi access points). Novel challenges arise in the latter due to the inadequacy of wireless resources and their broadcast nature\, the frequent hand-offs between different cells for mobile users\, as well as the specific requirements of different types of user applications\, such as video streaming. We will present our recent results on innovative caching approaches that (i) harvest idle user-owned cache space and bandwidth\, (ii) leverage the broadcast nature of the wireless medium to serve concurrent requests for content (iii) exploit the regularity of user mobility patterns\, and (iv) apply advanced video encoding techniques to support multiple video qualities (e.g.\, screen sizes\, frame rates\, or signal-to-noise ratio (SNR) qualities). These are cutting-edge approaches that can achieve significant performance and cost-reduction benefits over the state-of-the-art methods.\n\n\nBiography:\nLeandros Tassiulas is the John C. Malone Professor of Electrical Engineering at Yale University. His research interests are in the field of computer and communication networks with emphasis on fundamental mathematical models and algorithms of complex networks\, architectures and protocols of wireless systems\, sensor networks\, novel internet architectures and experimental platforms for network research. His most notable contributions include the max-weight scheduling algorithm and the back-pressure network control policy\, opportunistic scheduling in wireless\, the maximum lifetime approach for wireless network energy management\, and the consideration of joint access control and antenna transmission management in multiple antenna wireless systems. Dr. Tassiulas is a Fellow of IEEE (2007). His research has been recognized by several awards including the IEEE Koji Kobayashi computer and communications award 2016\, the inaugural INFOCOM 2007 Achievement Award "for fundamental contributions to resource allocation in communication networks\," the INFOCOM 1994 best paper award\, a National Science Foundation (NSF) Research Initiation Award (1992)\, an NSF CAREER Award (1995)\, an Office of Naval Research Young Investigator Award (1997) and a Bodossaki Foundation award (1999). He holds a Ph.D. in Electrical Engineering from the University of Maryland\, College Park (1991). He has held faculty positions at Polytechnic University\, New York\, University of Maryland\, College Park\, and University of Thessaly\, Greece.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:301@lincs.fr DTSTART;TZID=Europe/Paris:20170517T140000 DTEND;TZID=Europe/Paris:20170517T150000 DTSTAMP:20170405T083326Z URL:https://www.lincs.fr/events/burstable-instances-in-the-public-cloud/ SUMMARY:Burstable Instances in the Public Cloud DESCRIPTION:Amazon EC2 and Google Compute Engine (GCE) have recently introduced a new class of virtual machines called "burstable" instances that are cheaper than even the smallest traditional/regular instances. These lower prices come with reduced average capacity and increased variance. Using measurements from both EC2 and GCE\, we identify key idiosyncrasies of resource capacity dynamism for burstable instances that set them apart from other instance types. Most importantly\, certain resources for these instances appear to be regulated by deterministic\, though in one case unorthodox\, token bucket like mechanisms. We find widely different types of disclosures by providers of the parameters governing these regulation mechanisms: full disclosure (e.g.\, CPU capacity for EC2 t2 instances)\, partial disclosure (e.g.\, CPU capacity and remote disk IO bandwidth for GCE shared-core instances)\, or no disclosure (network bandwidth for EC2 t2 instances). A tenant modeling these variations as random phenomena (as some recent work suggests) might make sub-optimal procurement and operation decisions. We present modeling techniques for a tenant to infer the properties of these regulation mechanisms via simple offline measurements. We also present two case studies of how certain memcached workloads might benefit from our modeling when operating on EC2 by: (i) temporal multiplexing of multiple burstable instances to achieve the CPU or network bandwidth (and thereby throughput) equivalent of a more expensive regular EC2 instance\, and (ii) augmenting cheap but low availability in-memory storage offered by spot instances with backup of popular content on burstable instances. Work in collaboration with Cheng Wang\, Bhuvan Urgaonkar and Neda Nasiriani CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:300@lincs.fr DTSTART;TZID=Europe/Paris:20170510T140000 DTEND;TZID=Europe/Paris:20170510T150000 DTSTAMP:20170512T120510Z URL:https://www.lincs.fr/events/communication-protocols-in-wireless-body-a rea-networks-wban/ SUMMARY:Communication Protocols in Wireless Body Area Networks (WBAN) DESCRIPTION:The rapid advances in sensors and ultra-low power wireless communication has enabled a new generation of wireless sensor networks: Wireless Body Area Networks (WBAN). WBAN is a recent challenging area in the health monitoring domain. There are several concerns in this area ranging from energy efficient communication to designing delays efficient protocols that support nodes dynamic induced by human body mobility. WBAN is a promising technology and shall be increasingly necessary for monitoring\, diagnosing and treating populations.In this work we are interested in WBAN where sensors are placed on the body. In this type of networks sensors performances are tremendously influenced by the human body mobility. Thus\, we investigate different communication primitives using a realistic human body mobility and channel models issued from a recent research on biomedical and health informatics. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:307@lincs.fr DTSTART;TZID=Europe/Paris:20170509T160000 DTEND;TZID=Europe/Paris:20170509T173000 DTSTAMP:20170505T150857Z URL:https://www.lincs.fr/events/cloud-ran-for-mobile-networks-a-technology -overview/ SUMMARY:Cloud RAN for Mobile Networks—A Technology Overview DESCRIPTION:Cloud Radio Access Network (C-RAN) is a novel mobile network architecture which can address a number of challenges the operators face while trying to support growing end user’s needs. The main idea behind C-RAN is to pool the Baseband Units (BBUs) from multiple base stations into centralized BBU Pool for statistical multiplexing gain\, while shifting the burden to the high-speed wireline transmission of In-phase and Quadrature (IQ) data. C-RAN enables energy efficient network operation and possible cost savings on baseband resources. Furthermore\, it improves network capacity by performing load balancing and cooperative processing of signals originating from several base stations. CATEGORIES:Network Theory LOCATION:Telecom ParisTech (Main Building)\, 46\, rue Barrault\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=46\, rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom ParisTech (Main Building):geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:299@lincs.fr DTSTART;TZID=Europe/Paris:20170503T140000 DTEND;TZID=Europe/Paris:20170503T150000 DTSTAMP:20170609T074802Z URL:https://www.lincs.fr/events/5g-network-architecture-and-the-future-mob ile-internet/ SUMMARY:5G Network Architecture and the Future Mobile Internet DESCRIPTION:\n\n\nAbstract:\nThis talk provides a discussion of one of the central design challenges associated with next-generation 5G wireless systems - that of effectively converging 3GPP-based mobile networks with the global Internet. Although the trend towards "flat" IP-based architectures for cellular networks is well under way with LTE\, significant architectural evolution will be needed to achieve the goal of supporting the needs of mobile devices and applications as "first-class" services on the Internet. Several emerging mobility service scenarios including hetnet/small cell\, multi-network access\, mobile cloud\, IoT (Internet-of-Things) and V2V (vehicle-to-vehicle) are examined and related network service requirements such as user mobility\, disruption tolerance\, multi-homing\, content/service addressability and context-aware delivery are identified. Drawing from our experience with the ongoing NSF-sponsored MobilityFirst future Internet architecture project\, we outline a named-object protocol solution based on the GUID (Globally Unique Identifier) Service Layer which enables a clean separation of naming and addressing\, and provides intrinsic support for a wide variety of mobility services. The talk concludes with a brief outline of the MobilityFirst proof-of-concept prototype currently being deployed on the GENI meso-scale networking testbed.\n\n\nBiography:\nDipankar Raychaudhuri is Distinguished Professor\, Electrical &\; Computer Engineering and Director\, WINLAB (Wireless Information Network Lab) at Rutgers University. As WINLAB's Director\, he is responsible for an internationally recognized industry-university research center specializing in wireless technology. He is also PI for several large U.S. National Science Foundation funded projects including the ORBIT wireless testbed and the MobilityFirst future Internet architecture.Dr. Raychaudhuri has previously held corporate R&\;D positions including: Chief Scientist\, Iospan Wireless (2000-01)\, AGM &\; Dept Head\, NEC Laboratories (1993-99) and Head\, Broadband Communications\, Sarnoff Corp (1990-92). He obtained the B.Tech (Hons) from IIT Kharagpur in 1976 and the M.S. and Ph.D degrees from SUNY\, Stony Brook in 1978\, 79. He is a Fellow of the IEEE.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:306@lincs.fr DTSTART;TZID=Europe/Paris:20170427T100000 DTEND;TZID=Europe/Paris:20170427T120000 DTSTAMP:20170512T120546Z URL:https://www.lincs.fr/events/scikit-learn-demo-session/ SUMMARY:scikit learn demo session DESCRIPTION:The next talk in the ML workgroup will be given by Olivier Grisel on scikit learn as a demo session.\n\nIt also possible to attend without a laptop and just follow what Olivier will present on the video projector.\n\nAttendees who want to follow the demo in a hands on fashion\, should install anaconda https://www.continuum.io/downloads\n\nMake sure you can start a jupyter notebook and execute a cell with the following python statements:\nimport numpy as np \nimport matplotlib.pyplot as plt\nimport sklearn\nprint(sklearn.__version__)\nYou can also git clone the following repository: https://github.com/ogrisel/notebooksThere will be an update by Olivier Grisel the week of April 27\, so be sure to update at the last minute! CATEGORIES:Machine Learning,Working Group,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:304@lincs.fr DTSTART;TZID=Europe/Paris:20170426T140000 DTEND;TZID=Europe/Paris:20170426T150000 DTSTAMP:20170411T114406Z URL:https://www.lincs.fr/events/high-performance-modeling-and-simulation-o f-computer-networks/ SUMMARY:High-Performance Modeling and Simulation of Computer Networks DESCRIPTION:Abstract:\n\nModeling and simulation (M&\;S) plays an important role in the design analysis and performance evaluation of complex systems. Many of these systems\, such as computer networks\, involve a large number of interrelated components and processes. Complex behaviors emerge as these components and processes inter-operate across multiple scales at various granularities. M&\;S must be able to provide sufficiently accurate results while coping with the scale and complexity.\n\nMy talk will focus on two novel techniques in high-performance network modeling and simulation. The first is a GPU-assisted hybrid network traffic modeling method. The hybrid approach offloads the computationally intensive bulk traffic calculations to the background onto GPU\, while leaving detailed simulation of network transactions in the foreground on CPU. Our experiments show that the CPU-GPU hybrid approach can achieve significant performance improvement over the CPU-only approach.\n\nThe second technique is a distributed network emulation method based on simulation symbiosis. Mininet is a container-based emulation environment that can study networks consisted of virtual hosts and OpenFlow-enabled virtual switches on Linux. It is well-known\, however\, that experiments using Mininet may lose fidelity for large-scale networks and heavy traffic load. The proposed symbiotic approach uses an abstract network model to coordinate distributed Mininet instances with superimposed traffic to represent large-scale network scenarios.\n\nShort Bio:\n\nDr. Jason Liu is currently an Associate Professor at the School of Computing and Information Sciences\, Florida International University (FIU). He received a B.A. degree from Beijing University of Technology in China in 1993\, an M.S. degree from College of William and Mary in 2000\, and a Ph.D. degree in from Dartmouth College in 2003. He was also a postdoctoral researcher at University of Illinois\, Urbana-Champaign in 2003-2004 and also an Assistant Professor at Colorado School of Mines during 2004-2007. His research focuses on parallel simulation and performance modeling of computer systems and communication networks.  He served both as General Chair and Program Chair for several conferences\, and  is currently on the steering committee of SIGSIM-PADS\, and on the editorial board of ACM Transactions on Modeling and Computer Simulation (TOMACS) and SIMULATION\, Simulation Transactions of the Society for Modeling and Simulation International.  He is an NSF CAREER awardee (2006) and an ACM Distinguished Scientist (2014). His research has been funded by various US federal agencies\, including NSF\, DOE\, DOD\, and DHS. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:305@lincs.fr DTSTART;TZID=Europe/Paris:20170419T140000 DTEND;TZID=Europe/Paris:20170419T150000 DTSTAMP:20170420T062446Z URL:https://www.lincs.fr/events/load-balancing-in-heterogeneous-networks-b ased-ondistributed-learning-in-near-potential-games-2/ SUMMARY:Load Balancing in Heterogeneous Networks Based onDistributed Learning in Near-Potential Games DESCRIPTION:We present a novel approach for distributed load balancing in\nheterogeneous networks that use cell range expansion (CRE) for user\nassociation and almost blank subframe (ABS) for interference\nmanagement. First\, we formulate the problem as a minimisation of an\nalphaâfairness objective function with load and outage constraints.\nDepending on alpha\, different objectives in terms of network\nperformance or fairness can be achieved. Next\, we model the\ninteractions among the base stations for load balancing as a\nnear-potential game\, in which the potential function is the\nalphaâfairness function. The optimal pure Nash equilibrium (PNE) of the\ngame is found by using distributed learning algorithms. We propose\nlog-linear and binary log-linear learning algorithms for complete and\npartial information settings\, respectively. We give a detailed proof of\nconvergence of learning algorithms for a near-potential game. We\nprovide sufficient conditions under which the learning algorithms\nconverge to the optimal PNE. By running extensive simulations\, we show\nthat the proposed algorithms converge within few hundreds of\niterations. The convergence speed in the case of partial information\nsetting is comparable to that of the complete information setting.\nFinally\, we show that outage can be controlled and a better load\nbalancing can be achieved by introducing ABS.Joint work with Pierre\nCoucheney\, and Marceau Coupechoux\, in IEEE Transactions on Wireless\nCommunications (Vol. 15\, No. 7\, 2016). CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:298@lincs.fr DTSTART;TZID=Europe/Paris:20170419T140000 DTEND;TZID=Europe/Paris:20170419T150000 DTSTAMP:20170405T082930Z URL:https://www.lincs.fr/events/load-balancing-in-heterogeneous-networks-b ased-ondistributed-learning-in-near-potential-games/ SUMMARY:Load Balancing in Heterogeneous Networks Based onDistributed Learning in Near-Potential Games DESCRIPTION:We present a novel approach for distributed load balancing in heterogeneous networks that use cell range expansion (CRE) for user association and almost blank subframe (ABS) for interference management. First\, we formulate the problem as a minimisation of an alpha−fairness objective function with load and outage constraints. Depending on alpha\, different objectives in terms of network performance or fairness can be achieved. Next\, we model the interactions among the base stations for load balancing as a near-potential game\, in which the potential function is the alpha−fairness function. The optimal pure Nash equilibrium (PNE) of the game is found by using distributed learning algorithms. We propose log-linear and binary log-linear learning algorithms for complete and partial information settings\, respectively. We give a detailed proof of convergence of learning algorithms for a near-potential game. We provide sufficient conditions under which the learning algorithms converge to the optimal PNE. By running extensive simulations\, we show that the proposed algorithms converge within few hundreds of iterations. The convergence speed in the case of partial information setting is comparable to that of the complete information setting. Finally\, we show that outage can be controlled and a better load balancing can be achieved by introducing ABS.Joint work with Pierre Coucheney\, and Marceau Coupechoux\, in IEEE Transactions on Wireless Communications (Vol. 15\, No. 7\, 2016). CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:303@lincs.fr DTSTART;TZID=Europe/Paris:20170418T160000 DTEND;TZID=Europe/Paris:20170418T170000 DTSTAMP:20170419T124919Z URL:https://www.lincs.fr/events/random-walks-on-graphs/ SUMMARY:Random walks on graphs DESCRIPTION:A sample of the results of Lovasz' paper\n CATEGORIES:Network Theory LOCATION:Telecom ParisTech (Main Building)\, 46\, rue Barrault\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=46\, rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom ParisTech (Main Building):geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:161@lincs.fr DTSTART;TZID=Europe/Paris:20170412T140000 DTEND;TZID=Europe/Paris:20170412T150000 DTSTAMP:20170314T052225Z URL:https://www.lincs.fr/events/wireless-node-cooperation-with-resource-av ailability-constraints/ SUMMARY:Wireless Node Cooperation with Resource Availability Constraints DESCRIPTION:Base station cooperation is a promising scheme to improve network performance for next generation cellular networks. Up to this point research has focused on station grouping criteria based solely on geographic proximity. However\, for the cooperation to be meaningful\, each station participating in a group should have sufficient available resources to share with others. In this work we consider an alternative grouping criterion based on a distance that considers both geographic proximity and available resources of the stations. When the network is modelled by a Poisson Point Process\, we derive analytical formulas on the proportion of cooperative pairs or single stations\, and the expected sum interference from each of the groups. The results illustrate that cooperation gains strongly depend on the distribution of available resources over the network. Joint work with Anastasios Giovanidis\, Philippe Martins\, Laurent Decreusefond\, to appear at SpaSWiN 2017. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:296@lincs.fr DTSTART;TZID=Europe/Paris:20170405T140000 DTEND;TZID=Europe/Paris:20170405T150000 DTSTAMP:20170405T130414Z URL:https://www.lincs.fr/events/stateful-programmable-data-planes/ SUMMARY:Stateful programmable data planes DESCRIPTION:\n\n\nAbstract:\nIn Software Defined Networking (SDN) the control plane is physically separate from the forwarding plane. Control software programs the forwarding plane (e.g.\, switches and routers) using an open interface\, such as OpenFlow. SDN envisions smart centralized controllers governing the forwarding behaviour of dumb low-cost switches.Even if this approach presents several benefits (scalability\, vendor independence\, easiness of deployment etc.) it is often limited by the continuous intervention of the logically centralized controller (de facto complex distributed systems) to take decisions just based on local states (versus network-wide knowledge)\, which could be in principle directly handled at wire speed inside the device itself. Stateful dataplane processing is recently emerged as a enabling technology to supersede this limitation and to deploy virtual network functions at wire-speed.This talk will present Open Packet Processor (OPP)\, a stateful programmable dataplane abstraction that extend the OpenFlow match-action model adding the concept of a per-flow content that is used to represent the history of each flow travelling into the switch. OPP extracts a (configurable) flow-key from the incoming packet and update the flow content (and the associated forwarding decision) using some OpenFlow-like rules that define an Extended Finite State Machine (EFSM). The EFSM reads the current state\, the value of the flow-registers and the content of the packet and decide the next state\, update the flow-register values and set the action to apply to the packet.The talk will show an high-speed hardware implementation of a OPP based switch realized on an FPGA board with 4x10 GbE ports and some use cases that leverage the features of the OPP abstraction. A comparison with the most relevant work in the field of stateful dataplane processing will be presented and compared with the OPP abstraction. Finally the talk will discuss the OPP limitations and extensions.\n\n\nBiography:\nSalvatore Pontarelli received the master Degree at university of Bologna in 2000. In 2003 takes its PhD degree in microelectronics and telecommunications from the University of Rome Tor Vergata. Currently\, he works as Researcher at CNIT (Italian Consortium of telecommunication)\, in the research unit of University of Rome Tor Vergata. In the past Dott. Pontarelli has worked with the National Research Council (CNR)\, the Department of Electronic Engineering of University of Rome Tor Vergata\, the Italian Space Agency (ASI)\, the University of Bristol.He also works as consultant for various Italian and International companies for design of hardware for high speed networking. He participates in several national and EU funded research program (ESA\, FP7 and H2020). In 2011 he was recipient of a CISCO research Award for the study on the combined use of Bloom filters and Ternary CAM. His main research activities are hash based structures for networking applications\, use of FPGA for high speed network monitoring\, hardware design of software defined network devices\, stateful programmable data planes.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:295@lincs.fr DTSTART;TZID=Europe/Paris:20170404T160000 DTEND;TZID=Europe/Paris:20170404T173000 DTSTAMP:20170405T113052Z URL:https://www.lincs.fr/events/stable-matchings-roommates-marriage-and-ki dneys/ SUMMARY:Stable matchings: roommates\, marriage and kidneys DESCRIPTION:Fabien Mathieu will present Stable matchings: roommates\, marriage and kidneys\n\n\nStarting point to learn about stable matchings: Mariages stables (Dominique Dumont) CATEGORIES:Network Theory LOCATION:Telecom ParisTech (Main Building)\, 46\, rue Barrault\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=46\, rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom ParisTech (Main Building):geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:159@lincs.fr DTSTART;TZID=Europe/Paris:20170329T140000 DTEND;TZID=Europe/Paris:20170329T150000 DTSTAMP:20170329T133148Z URL:https://www.lincs.fr/events/sensing-spatial-structures-in-online-socia l-networks/ SUMMARY:Sensing spatial structures in online social networks DESCRIPTION:More details coming soon CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:175@lincs.fr DTSTART;TZID=Europe/Paris:20170328T140000 DTEND;TZID=Europe/Paris:20170328T160000 DTSTAMP:20170325T183345Z URL:https://www.lincs.fr/events/research-overflow-pre-kickoff/ SUMMARY:Research Overflow: pre-KickOff DESCRIPTION:An early\, informal meeting\, to discuss the whereabouts of the Research Overflow working group.\n\nTentative ordre du jour\n\n Link with the Lincs Upgrade Yourself Academy: train in the art of writing articles and reviews\n\n Only pointers to biblio?\n Give a few courses? ([FM] a few ideas: Correctness/Impact/Flow classification\, learn from the best)\n Shepherded reviews: group reviews / senior+Phd review?\n\n\n Design of a Research Overflow approach\n List of Lincs scientific research that could be made using RO as a possible use case\n Parsing the early bibliography.\n CATEGORIES:Research Overflow LOCATION:Salle 26\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Salle 26:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:168@lincs.fr DTSTART;TZID=Europe/Paris:20170321T160000 DTEND;TZID=Europe/Paris:20170321T160000 DTSTAMP:20170324T134244Z URL:https://www.lincs.fr/events/application-of-the-mellin-transform-to-suf fix-trees-and-tries/ SUMMARY:Application of the Mellin transform to suffix trees and tries DESCRIPTION:Anne Bouillard will present\n\nAverage size of a suffix tree for Markov sources\, Jacquet\, Szpankowaki\, 2016\n CATEGORIES:Network Theory LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:162@lincs.fr DTSTART;TZID=Europe/Paris:20170315T113000 DTEND;TZID=Europe/Paris:20170315T114500 DTSTAMP:20170316T134747Z URL:https://www.lincs.fr/events/researchoverflow/ SUMMARY:ResearchOverflow DESCRIPTION:Research is broken. We can rebuild it. We have the technology. CATEGORIES:Previews,Youtube LOCATION:Meudon\, Best Western Meudon\, Meudon\, France GEO:48.7954497;2.2192007999999532 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Best Western Meudon\, Meudon\, France;X-APPLE-RADIUS=100;X-TITLE=Meudon:geo:48.7954497,2.2192007999999532 END:VEVENT BEGIN:VEVENT UID:171@lincs.fr DTSTART;TZID=Europe/Paris:20170313T160000 DTEND;TZID=Europe/Paris:20170313T180000 DTSTAMP:20170329T160016Z URL:https://www.lincs.fr/events/meeting-iot-03/ SUMMARY:Meeting IoT #03 DESCRIPTION:3 short presentations:\n\n Overview of a survey about IoT (Nesrine Ammar)\;\n Presentation about Wireless Body Area Networks (Gewu Bu)\;\n Presentation of issues on transparency and privacy in IoT (Vassilis Christophides).\n CATEGORIES:IoT WG LOCATION:LINCS room 26\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS room 26:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:9@lincs.fr DTSTART;TZID=Europe/Paris:20170308T140000 DTEND;TZID=Europe/Paris:20170308T150000 DTSTAMP:20170329T121241Z URL:https://www.lincs.fr/events/modeling-and-performance-analysis-of-wi-fi -networks-coexisting-with-lte-u/ SUMMARY:Wi-Fi Direct-based Device-to-Device Communications for Dense Wireless Networks DESCRIPTION:Wi-Fi Direct is a popular wireless technology which is integrated in most of today's smartphones and tablets. This technology allows a set of devices to dynamically negotiate and select a group owner which plays the role of access point. We demonstrate that Wi-Fi Direct-based Device-to-Device (D2D) communications can be used to offload Wi-Fi access points in a dense wireless network. Clustering\, power control and transmission scheduling techniques are applied to optimize the network performances and reduce the file download time up to 30%. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:173@lincs.fr DTSTART;TZID=Europe/Paris:20170307T160000 DTEND;TZID=Europe/Paris:20170307T173000 DTSTAMP:20170324T134700Z URL:https://www.lincs.fr/events/mellin-transform-and-asymptotics-harmonic- sums/ SUMMARY:Mellin transform and asymptotics: harmonic sums DESCRIPTION:Anne Bouillard will present\n\nMellin transform and asymptotics: harmonic sums\, Flajolet\, Gourdon and Dumas\, 1995 CATEGORIES:Network Theory LOCATION:Telecom ParisTech (Main Building)\, 46\, rue Barrault\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=46\, rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom ParisTech (Main Building):geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:294@lincs.fr DTSTART;TZID=Europe/Paris:20170306T133000 DTEND;TZID=Europe/Paris:20170306T150000 DTSTAMP:20190918T085149Z URL:https://www.lincs.fr/events/bits-of-machine-learning-part-2/ SUMMARY:Bits of Machine Learning\, Part 2 DESCRIPTION:A second introduction to Machine Learning. CATEGORIES:Machine Learning,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:293@lincs.fr DTSTART;TZID=Europe/Paris:20170303T133000 DTEND;TZID=Europe/Paris:20170303T150000 DTSTAMP:20190918T085231Z URL:https://www.lincs.fr/events/bits-of-machine-learning-part-1/ SUMMARY:Bits of Machine Learning\, Part 1 DESCRIPTION:A first introduction to Machine Learning. CATEGORIES:Machine Learning,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:8@lincs.fr DTSTART;TZID=Europe/Paris:20170303T110000 DTEND;TZID=Europe/Paris:20170303T120000 DTSTAMP:20170313T161958Z URL:https://www.lincs.fr/events/joint-cyber-insurance-and-security-as-a-se rvice-provisioning-in-cloud-computing/ SUMMARY:Joint Cyber Insurance and Security-as-a-Service Provisioning in Cloud Computing DESCRIPTION:\n\n\nAbstract:\nAs computing services are increasingly cloud-based\, corporations are investing in cloud-based security measures. The Security-as-a-Service (SECaaS) paradigm allows customers to outsource security to the cloud\, through the payment of a subscription fee. However\, no security system is bulletproof\, and even one successful attack can result in the loss of data and revenue worth millions of dollars. To guard against this eventuality\, customers may also purchase cyber insurance to receive recompense in the case of loss. To achieve cost effectiveness\, it is necessary to balance provisioning of security and insurance\, even when future costs and risks are uncertain. This presentation introduces a stochastic optimization model to optimally provision security and insurance services in the cloud. Since the model is a mixed integer problem\, we also introduce a partial Lagrange multiplier algorithm that takes advantage of the total unimodularity property to find the solution in polynomial time. We show the effectiveness of these techniques using numerical results based on real attack data to demonstrate a realistic testing environment\, and find that security and insurance are interdependent.\n\n\nBiography:\nDusit Niyato is currently an associate professor in the School of Computer Science and Engineering\, at the Nanyang Technological University\, Singapore. He received B.E. from King Mongkuk’s Institute of Technology Ladkrabang (KMITL)\, Thailand in 1999 and Ph.D. in Electrical and Computer Engineering from the University of Manitoba\, Canada in 2008. He has published more than 300 technical papers in the area of wireless and mobile networking and authored the books "Resource Management in Multi-Tier Cellular Wireless Networks"\, "Game Theory in Wireless and Communication Networks: Theory\, Models\, and Applications" and "Dynamic Spectrum Access and Management in Cognitive Radio Networks". He won the Best Young Researcher Award of IEEE Communications Society (ComSoc) Asia Pacific (AP) and The 2011 IEEE Communications Society Fred W. Ellersick Prize Paper Award. He is a distinguished lecturer of the IEEE Communications Society. His works have received more than 13\,000 citations (Google Scholar).Currently\, he serves as an area editor of IEEE Transactions on Wireless Communications (Radio Management and Multiple Access)\, an associate editor of IEEE Transactions on Communications\, an editor of IEEE Communications Surveys and Tutorials (COMST)\, and IEEE Transactions on Cognitive Communications and Networking (TCCN). He was a guest editor of IEEE Journal on Selected Areas on Communications\, special issue on Cognitive Radio Networking &\; Communications\, and Recent Advances in Heterogeneous Cellular Networks. He is a Fellow of IEEE.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:7@lincs.fr DTSTART;TZID=Europe/Paris:20170301T140000 DTEND;TZID=Europe/Paris:20170301T150000 DTSTAMP:20170329T132242Z URL:https://www.lincs.fr/events/named-object-based-services-in-the-future- internet-architecture/ SUMMARY:Named-Object Based Services in the Future Internet Architecture DESCRIPTION:After many years of constant evolution\, the Internet has approached a historic inflection point where mobile platforms\, applications and services are poised to replace the fixed-host/server model that has dominated the Internet since its inception. Driven by the strikingly different Internet population of mobile devices and services\, new fundamental communication abstractions are required and the current IP based Internet fails to meet their requirement in a satisfying fashion. Starting from these key considerations\, this talk aims to introduce the audience to a new approach to networking\, that centers around the central architectural concept of Named-Object based networking and the power that lies behind it. Looking at the different architectures presented over the years\, a set of new fundamental abstractions are defined\, providing a comprehensive analysis of their properties and how they could be met. This study leads to the presentation of the MobilityFirst architecture in which the "narrow waist" of the protocol stack is based on Named-Objects which enable a broad range of capabilities in the network.As an example of the potential of the Named-Object abstraction\, an analysis of how advanced cloud services can be supported in the proposed architecture is presented. In particular\, the concept of naming is extended to natively support virtual network identifiers. It is shown that the virtual network capability can be designed by introducing the concept of a "Virtual Network Identifier (VNID)" which is managed as a Named-Object. Further\, the design supports the concept of Application Specific Routing (ASR) which enables network routing decisions to be made with awareness of application parameters such as cloud server workload. Experimental results show that the new framework provides a clean and simple logic for defining and managing virtual networks while limiting the performance impact produced by the additional overhead generated by running such system. Moreover\, using a prototype of the architecture deployed on a nation-wide testbed\, the potential of ASR is demonstrated in a cloud service scenario. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:170@lincs.fr DTSTART;TZID=Europe/Paris:20170227T160000 DTEND;TZID=Europe/Paris:20170227T180000 DTSTAMP:20170322T152651Z URL:https://www.lincs.fr/events/meeting-iot-02/ SUMMARY:Meeting IoT #02 DESCRIPTION:Consolidation of the future activities of the working group. CATEGORIES:IoT WG LOCATION:LINCS room 26\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS room 26:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:6@lincs.fr DTSTART;TZID=Europe/Paris:20170222T140000 DTEND;TZID=Europe/Paris:20170222T150000 DTSTAMP:20170329T133112Z URL:https://www.lincs.fr/events/more-info-coming/ SUMMARY:Insensitivity of Loss Systems under Randomized SQ(d) Algorithms DESCRIPTION:\n\n\nAbstract:\nIn many applications such as cloud computing\, managing server farm resources etc. an incoming task or job has to be matched with an appropriate server in order to minimise the latency associated with the processing. Ideally the best choice would be to match a job to the fastest available server. However when there are thousands of servers obtaining the information on server tasks is expensive. Pioneered in the 1990's the idea of randomised sampling of a few servers was proposed by Vvedenskaya and Dobrushin in Russia and Mitzmenmacher in the US and popularised as the "power of two" schemes which basically means that sampling two servers randomly and sending the job to the "better" server (i.e. with the shortest queue\, or most resources) provides most of the benefits of sampling all the servers.In the talk I will discuss multi-server loss models under power-of-d routing scheme when service time distributions are general with finite mean. Previous works on these models assume that the service times are exponentially distributed and insensitivity was suggested through simulations. Showing insensitivity to service time distributions has remained an open problem. We address this problem by considering service time distributions as Mixed-Erlang distributions that are dense in the class of general distributions on (0\, infty). We derive the mean field equations (MFE) of the empirical distributions for the system and establish the existence and uniqueness of the fixed point of the MFE. Furthermore we show that the fixed point of the MFE corresponds to the fixed point obtained from the MFE corresponding to a system with exponential service times showing that the fixed point is insensitive to the distribution. We provide numerical evidence of the global asymptotic stability of the fixed point\, which would then imply that the fixed point is indeed the stationary distribution. We conclude with a brief discussion of the case of the MFE with general service times showing that the MFE is now characterized by a pde whose stationary point coincides with the fixed point in the case with exponential service times.The techniques developed in this paper are applicable to study mean field limits for Markov processes on general state spaces and insensitivity properties of other queueing models.\n\n\nBiography:\nThe speaker was educated at the Indian Institute of Technology\, Bombay (B.Tech\, 1977)\, Imperial College\, London (MSc\, DIC\, 1978) and obtained his PhD under A. V. Balakrishnan at UCLA in 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. Prior to this he was Professor of ECE at PurdueUniversity\, West Lafayette\, USA. He is a D.J. Gandhi Distinguished Visiting Professor at the Indian Institute of Technology\, Bombay. He is a Fellow of the IEEE and the Royal Statistical Society. He is a recipient of the Best Paper Awards at INFOCOM 2006\, the International Teletraffic Congress 2015\, Performance 2015\, and was runner-up for the Best Paper Award at INFOCOM 1998.His research interests are in modeling\, control\, and performance analysis of both wireline and wirelessnetworks\, and in applied probability and stochastic analysis with applications to queueing\, filtering\, and optimization.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:174@lincs.fr DTSTART;TZID=Europe/Paris:20170221T160000 DTEND;TZID=Europe/Paris:20170221T173000 DTSTAMP:20170324T135244Z URL:https://www.lincs.fr/events/the-formal-theory-of-birth-and-death-proce sses-lattice-path-combinatorics-and-continuous-fractions/ SUMMARY:The formal Theory of Birth-and-death processes\, lattice path combinatorics and continuous fractions DESCRIPTION:Céline Comte and Élie de Panafieu will present\n\nThe formal Theory of Birth-and-death processes\, lattice path combinatorics and continuous fractions\, Flajolet and Guillemin\, 2000 CATEGORIES:Network Theory LOCATION:Telecom ParisTech (Main Building)\, 46\, rue Barrault\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=46\, rue Barrault\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=Telecom ParisTech (Main Building):geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:169@lincs.fr DTSTART;TZID=Europe/Paris:20170220T160000 DTEND;TZID=Europe/Paris:20170220T180000 DTSTAMP:20170322T152220Z URL:https://www.lincs.fr/events/meeting-iot-01/ SUMMARY:Meeting IoT #01 DESCRIPTION:Kick-off meeting. Initial discussions about interests of people in IoT and about objective of this group at LINCS CATEGORIES:IoT WG LOCATION:LINCS room 26\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS room 26:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:5@lincs.fr DTSTART;TZID=Europe/Paris:20170215T140000 DTEND;TZID=Europe/Paris:20170215T150000 DTSTAMP:20170313T161957Z URL:https://www.lincs.fr/events/real-option-game-theoretic-framework-for-i nvestment-decisions-in-mobile-tv/ SUMMARY:Real option game theoretic framework for investment decisions in mobile TV DESCRIPTION:We present a strategic investment framework for mobile TV delivery by two potential operators: broadcaster (DVB) and cellular (MNO)\, in the presence of demand and operating cost uncertainties. We consider two settings: a cooperative one where the two operators run a convergent hybrid network\, and a competitive one in which each operator builds its own network\, if it decides to enter the market. We define a real option game theoretic framework and propose a new bi-level dynamic programming algorithm that solves the optimal profit maximization problem and yields the optimal investment decisions of both players. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:4@lincs.fr DTSTART;TZID=Europe/Paris:20170208T140000 DTEND;TZID=Europe/Paris:20170208T150000 DTSTAMP:20170329T121506Z URL:https://www.lincs.fr/events/tbd-8/ SUMMARY:Data Protection by Means of Fragmentation DESCRIPTION:\n\n\nAlthough symmetric ciphers may provide strong computational security\, a key leakage makes the encrypted data vulnerable. In a distributed storage environment\, reinforcement of data protection consists of dispersing data over multiple servers in a way that no information can be obtained from data fragments until a defined threshold of them has been collected. A secure fragmentation is usually enabled by secret sharing\, information dispersal algorithms or data shredding. However\, these solutions suffer from various limitations\, like additional storage requirement or performance burden. Therefore\, we introduce a novel flexible keyless fragmentation scheme\, balancing memory use and performance with security. It could be applied in many different contexts\, such as dispersal of outsourced data over one or multiple clouds or in resource-restrained environments like sensor networks.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:3@lincs.fr DTSTART;TZID=Europe/Paris:20170203T100000 DTEND;TZID=Europe/Paris:20170203T110000 DTSTAMP:20170313T161956Z URL:https://www.lincs.fr/events/qoe-management-for-internet-applications-t echnologies-and-challenges/ SUMMARY:QoE Management for Internet Applications: Technologies and Challenges DESCRIPTION:\n\n\nAbstract:\nThe talk starts by presenting the current approaches for a QoE-aware service management in the Internet\, i.e.\, application oriented or network management\, which are mostly characterized by the tools available by the stakeholders implementing the process and also by their own interests. Then\, the current limits and issues of these approaches are highlighted\, together with the current directions of development in the field. These are mostly characterized by a strong evolution towards the virtualization of the services through the introduction of the SDN and NFV paradigms. These allow for a more flexible management of the services with a better control of the QoE and for a potential stronger cooperation among the different actors involved in the service provisioning chain.\n\n\nBiography:\nLuigi Atzori (SM'09) is Associate Professor at the Department of Electrical and Electronic Engineering at the University of Cagliari (Italy)\, where he leads the laboratory of Multimedia and Communications with around 15 affiliates (http://mclab.diee.unica.it). L. Atzori research interests are in multimedia communications and computer networking (wireless and wireline)\, with emphasis on multimedia QoE\, multimedia streaming\, NGN service management\, service management in wireless sensor networks\, architecture and services in the Internet of Things. He is the coordinator of the Marie Curie Initial Training Network on QoE for multimedia services (http://qoenet-itn.eu)\, which involves ten European Institutions in Europe and one in South Korea. He has been the editor for the ACM/Springer Wireless Networks Journal and guest editor for many journals\, including the IEEE Communications Magazine\, the Springer Monet and the Elsevier Signal Processing: Image Communications Journals. He is member of the steering committee for the IEEE Trans. on Multimedia\, member of the editorial board of the IEEE IoT\, the Elsevier Ad Hoc Networks and the Elsevier Digital Communications and Networks journals. He served as a technical program chair for various international conferences and workshops. He served as a reviewer and panelist for many funding agencies\, including H2020\, FP7\, Cost and Italian MIUR.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:2@lincs.fr DTSTART;TZID=Europe/Paris:20170201T150000 DTEND;TZID=Europe/Paris:20170201T160000 DTSTAMP:20170313T161956Z URL:https://www.lincs.fr/events/the-futebol-project-experimentation-on-the -opticalwireless-network-frontier/ SUMMARY:The FUTEBOL project - experimentation on the optical/wireless network frontier DESCRIPTION:This talk will present the FUTEBOL project\, which is a joint EU-Brazilproject focused on the creation of experimental testbeds. Theproject’s goal is to allow the access to advanced experimentalfacilities in Europe and Brazil for research and education across thewireless and optical domains. To accomplish this\, we will develop aconverged control framework to support optical/wirelessexperimentation on the federated research infrastructure from allassociated partners/institutions. Further\, industry-driven use caseswill be demonstrated using this testbed to produce advances inresearch at the optical/wireless boundary. The talk will provide anoverview of the project\, presenting the proposed testbeds as well asthe experiments that we will perform to showcase the importance ofoptical/wireless integration on today’s networks. Those use casesinvolve topics such as C-RAN and radio over fiber and low latencynetworking for real-time applications on IoT and immersive services. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:1@lincs.fr DTSTART;TZID=Europe/Paris:20170201T140000 DTEND;TZID=Europe/Paris:20170201T150000 DTSTAMP:20170313T161955Z URL:https://www.lincs.fr/events/peering-an-as-for-us/ SUMMARY:PEERING: An AS for Us DESCRIPTION:PEERING is a testbed that provides safe and easy access for researchers to the Internet's BGP routing system\, enabling and inspiring transformational research. Traditionally\, the barriers to conduct Internet routing experiments hindered progress. Most research on interdomain routing is either based on passive observation of existing routes\, which cannot capture how the Internet will respond to changes in protocols or policies\, or based on simulations\, whose fidelity is restricted by known limitations in our understanding of Internet topology and policy. To move beyond these limited experimental approaches\, the PEERING testbed connects (via BGP) with real networks at universities and Internet exchange points around the world. Instead of being observers of the Internet ecosystem\, researchers become participants\, running experiments that announce/select routes and send/receive traffic directly with these networks. In this talk\, we present an introduction to the testbed and a sample of the research it has enabled. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:28@lincs.fr DTSTART;TZID=Europe/Paris:20170125T140000 DTEND;TZID=Europe/Paris:20170125T150000 DTSTAMP:20170313T170807Z URL:https://www.lincs.fr/events/towards-a-networking-characteristica-unive rsalis/ SUMMARY:Towards a Networking ``Characteristica Universalis'\;'\; DESCRIPTION:Most unwritten languages today have no known grammar\, and are rather governed by "unspoken rules". Similarly\, we think that the young discipline of networking is still a practice that lacks a deep understanding of the rules that govern it. This situation results in a loss of time and efforts. First\, since the rules are unspoken\, they are not systematically reused. Second\, since there is no grammar\, it is impossible to assert if a sentence is correct. Comparing two networking approaches or solutions is sometimes a synonym of endless religious debates. Drawing the proper conclusion from this claim\, we advocate that networking research should spend more efforts on better understanding its rules as a first step to automatically reuse them. To illustrate our claim\, we focus in this work on one broad family of networking connectivity problems. We show how different instances of this problem\, which were solved in parallel with no explicit knowledge reuse\, can be derived from a small set of facts and rules implemented in a knowledge-based system. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:29@lincs.fr DTSTART;TZID=Europe/Paris:20170118T140000 DTEND;TZID=Europe/Paris:20170118T150000 DTSTAMP:20170313T170808Z URL:https://www.lincs.fr/events/summarizing-performance-samples-with-extre ma-rather-than-averages-a-lesson-from-practitioners/ SUMMARY:Summarizing Performance Samples with Extrema rather than Averages: A Lesson from Practitioners DESCRIPTION:The notion of performance seems crucial to many fields of science and engineering. Some scientists are concerned with the performance of algorithms or computing hardware\, others evaluate the performance of communication channels\, of materials\, of chemicals\, psychologists investigate the performances of experimental participants\, etc. Yet\, rather surprisingly\, the performance notion is generally used without any explicit definition. I propose this: a performance is a quantitative behavioral measure that an agent deliberately tries to either minimize or maximize. The scope of the performance concept seems impressively large: the agent whose behavioral performance is being scored may be a human\, a coalition of humans (e.g.\, an enterprise\, an academic institution)\, or even a human product (e.g.\, a chemical\, an algorithm\, a market share).Performance measures are random variables of a very special sort: their distributions are strongly skewed as a direct consequence of the extremization (minimization or maximization) pressure that constitutes their defining characteristic. Mainstream statistics takes it for granted that any distribution needs to be summarized by means of some representative central-tendency indicator (e.g.\, an arithmetic mean\, a median)\, and so the asymmetry of performance distributions has been traditionally considered an unfortunate complication. In fact I will argue that when it comes to statistics of performance\, averages become essentially irrelevant. The point is easy to make with the example of spirometry testing: practitioners of spirometry never compute an average\, they retain the best measure of respiratory performance (i.e.\, the sample max) and flatly discard all other measures. And they are quite right to do so\, as a simple model will help explain. The important general lesson to be learned from spirometry is that the better a sample measure of performance\, the more valid as an estimate of the capacity of performance---the theoretical upper limit whose estimation is in fact the goal of most performance testing in experimental science. One likely reason why experimenters of many fields have recourse to the measurement of performances is because non-extremized behavior tends to be random\, whereas performance capacities can abide by quantitative laws. This is easy to illustrate with empirical data from human experimental psychology (Hick's law\, George Miller's magic number\, Fitts' law). An experimenter myself\, I can only conclude with a question to statisticians: i.e.\, don’t we need a brand new sort of statistics to fully acknowledge and accommodate the rather special nature of all these performance measures that these days we encounter everywhere\, not just in virtually every sector of society but also in many field of scientific research CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:30@lincs.fr DTSTART;TZID=Europe/Paris:20170111T140000 DTEND;TZID=Europe/Paris:20170111T150000 DTSTAMP:20170313T170808Z URL:https://www.lincs.fr/events/the-many-faces-of-fault-tolerant-and-byzan tine-tolerant-distributed-computing/ SUMMARY:The many faces of fault-tolerant and Byzantine tolerant distributed computing DESCRIPTION:The tolerance to faults and Byzantine behaviors has a long tradition in distributed computing. Now\, more than ever\, fault-tolerant and Byzantine tolerant distributed computing finds its application in various emergent areas raging from sensor networks to distributed storage and blockchains. This talk presents recent results on how distributed computing deals with various incarnations of faults and Byzantine behaviors with case studies taken from body area networks\, mobile robots networks\, distributed storage and blockchains. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:32@lincs.fr DTSTART;TZID=Europe/Paris:20161214T140000 DTEND;TZID=Europe/Paris:20161214T150000 DTSTAMP:20170313T170809Z URL:https://www.lincs.fr/events/modeling-and-algorithms-for-iot-service-ch aracterization-and-recommendation/ SUMMARY:Modeling and algorithms for IoT service characterization and recommendation DESCRIPTION:Connected devices\, as key constituent elements of the Internet of Things (IoT)\, are flooding our real world environment. This digital wave paves the way for a major technological breakthrough called to deeply change our daily lives. Nevertheless\, some strong issues remain to be addressed. The most dominant one relates to our ability to leverage the whole IoT service space and\, more specifically\, to our ability to compose IoT services from multiple connected devices by cleverly selecting them with the required software functions\, whatever our technical skills. In such a challenging context\, we first propose a rich and flexible abstraction framework relying on Attributed Typed Graphs\, which enables to represent how known IoT services are composed from different perspectives. Then\, capitalizing on this modeling tool and focusing on the way IoT services interact with the physical environment\, lightweight service signatures are computed by using a physical-interfaced-based algorithm in order to characterize IoT services. Finally\, we discuss how leveraging the computed signatures can allow for autonomously recommending IoT services to end-users. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:33@lincs.fr DTSTART;TZID=Europe/Paris:20161207T140000 DTEND;TZID=Europe/Paris:20161207T150000 DTSTAMP:20170313T170809Z URL:https://www.lincs.fr/events/irt-systemx-le-programme-internet-de-confi ance-et-le-projet-cloud-et-virtualisation/ SUMMARY:IRT SystemX: le programme "\;Internet de Confiance"\; et le projet "\;Cloud et virtualisation"\; DESCRIPTION:Presentation du programme IRT SystemX qui comprend les thématiques Cybersécurité et évolutionsdes architectures réseaux. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:27@lincs.fr DTSTART;TZID=Europe/Paris:20161206T140000 DTEND;TZID=Europe/Paris:20161206T150000 DTSTAMP:20170313T170807Z URL:https://www.lincs.fr/events/granger-causality-networks-causal-inferenc e-for-time-series-data/ SUMMARY:Granger Causality Networks: Causal Inference for Time Series Data DESCRIPTION:Identifying causal (rather than merely\ncorrelative)relationships in physical systems is a difficult task\,\nparticularly ifit is not feasible to perform controlled experiments.\nGranger'snotion of causality was developed first in economics beginning\nin the1960s and can be used to form a network of "plausible\ncausalrelations" given only the opportunity to observe the system.\nThismethod is applied\, for example\, in neuro-imaging to\nidentifyrelationships amongst brain regions\, and in biostatistics to\nexploregene regulatory networks. In this talk\, we provide an overview\nof thenotion of Granger Causality\, some methods for learning\nGrangerCausality Networks in practice\, and our current directions\nforresearch. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:31@lincs.fr DTSTART;TZID=Europe/Paris:20161201T110000 DTEND;TZID=Europe/Paris:20161201T120000 DTSTAMP:20170313T170808Z URL:https://www.lincs.fr/events/a-bilevel-model-of-facility-location-that- involves-%e2%80%a8competition-selfish-users-and-queues/ SUMMARY:A BILEVEL MODEL OF FACILITY LOCATION THAT INVOLVES 
COMPETITION\, SELFISH USERS AND QUEUES DESCRIPTION:In a competitive setting\, we consider the problem faced by a firm that makes decisions concerning both the location and service levels of its facilities\, taking into account that users patronize the facility that maximizes their individual utility\, expressed as the sum of travel time\, queueing delay\, and a random term. This situation can be modelled as a mathematical program with equilibrium constraints that involves discrete and continuous variables\, as well as linear and nonlinear functions. This program is reformulated as a standard bilevel program that can be approximated\, through the linearization of the nonlinear functions involved\, as a mixed integer linear program that yields ‘quasi-optimal' solutions. Since this approach does not scale well\, we have in parallel developed heuristic procedures that exploit the very structure of the problem. Based on theoretical and computation results pertaining to this application\, we will discuss further developments in the area of nonlinear facility location. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:34@lincs.fr DTSTART;TZID=Europe/Paris:20161130T140000 DTEND;TZID=Europe/Paris:20161130T150000 DTSTAMP:20170313T170810Z URL:https://www.lincs.fr/events/variable-neighborhood-prediction-of-tempor al-collective-profiles-in-web-services-usage/ SUMMARY:Variable neighborhood prediction of temporal collective profiles in web services usage DESCRIPTION:Temporal collective profiles generated by mobile network users can be used to predict network usage\, which in turn can be used to improve the performance of the network to meet user demands. This presentation will talk about a prediction method of temporal collective profiles which is suitable for online network management. Using weighted graph representation\, the target sample is observed during a given period to determine a set of neighboring profiles that are considered to behave similarly enough. The prediction of the target profile is based on the weighted average of its neighbors\, where the optimal number of neighbors are selected through a form of variable neighborhood search. This method is applied to two datasets\, one provided by a mobile network service provider and the other from a Wi-Fi service provider. The proposed prediction method can conveniently characterize user behavior via graph representation\, while outperforming existing prediction methods. Also\, unlike existing methods that utilize categorization\, it has a low computational complexity\, which makes it suitable for online network analysis. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:36@lincs.fr DTSTART;TZID=Europe/Paris:20161123T140000 DTEND;TZID=Europe/Paris:20161123T150000 DTSTAMP:20170313T170810Z URL:https://www.lincs.fr/events/pinpointing-delay-and-forwarding-anomalies -using-large-scale-traceroute-measurements/ SUMMARY:Pinpointing Delay and Forwarding Anomalies Using Large-Scale Traceroute Measurements DESCRIPTION:\n\n\nUnderstanding network health is essential to improving Internet reliability. For instance\, detecting disruptions in peer and provider networks identifies fixable connectivity problems. Currently this task is time consuming as it involves a fair amount of manual observation because operators have little visibility into other networks.Here we leverage existing public RIPE Atlas measurement data to monitor and analyze network conditions\; creating no new measurements. We demonstrate a set of complementary methods to detect network disruptions using traceroute measurements. A novel method of detecting changes in delay is used to identify congested links\, and a packet forwarding model is employed to predict traffic paths and to identify faulty routers and links in cases of packet loss. In addition\, aggregating results from each method allows us to easily monitor a network and identify coordinated reports manifesting significant network disruptions\, reducing uninteresting alarms.Our contributions consist of a statistical approach to providing robust estimation or Internet delays and the study of hundreds of thousands link delays. We present three cases demonstrating that the proposed methods detect real disruptions and provide valuable insights\, as well as surprising findings\, on the location and impact of identified events.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:37@lincs.fr DTSTART;TZID=Europe/Paris:20161116T140000 DTEND;TZID=Europe/Paris:20161116T150000 DTSTAMP:20170313T170811Z URL:https://www.lincs.fr/events/walkscan-improving-pagerank-for-local-comm unity-detection/ SUMMARY:WalkSCAN: Improving PageRank for local community detection DESCRIPTION:Community detection is a fundamental problem in the field of graph mining. The objective is to find densely connected clusters of nodes\, so-called communities\, possibly overlapping. While most existing algorithms work on the entire graph\, it is often irrelevant in practice to cluster all nodes. A more practically interesting problem is to detect the community to which a given set of nodes\, the so-called "seed nodes"\, belong. Moreover\, the exploration of the whole network is generally computationally expensive\, if not impossible\, and algorithms that only take into account the local structure of the graph around seed nodes provide a big advantage. For these reasons\, there is a growing interest in the problem of "local" community detection\, also known as "seed set expansion". We solve this problem through a low-dimensional embedding of the graph based on random walks starting from the seed nodes. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:35@lincs.fr DTSTART;TZID=Europe/Paris:20161108T140000 DTEND;TZID=Europe/Paris:20161108T150000 DTSTAMP:20170313T170810Z URL:https://www.lincs.fr/events/prototyping-iot-cloud-services-over-multis ite-edge-clouds-based-on-affordable-smartx-k-clusters/ SUMMARY:Prototyping IoT-Cloud Services over Multisite Edge Clouds based on Affordable SmartX K-Clusters DESCRIPTION:Recently we are in the middle of structural changes toward software-defined ICT infrastructure\, which attempts to transform the existing silo-based infrastructure into futuristic composable one by integrating IoT-based smart/mobile things\, SDN-coordinated interconnect edges\, and NFV-assisted and software-driven cloud core. This end-user-driven infrastructure transform can be supported by diverse open-source community projects (e.g.\, Linux Foundation's OVS/OpenSwitch/ONOS/CORD/ODL/OPNFV/Open-O/...\, Facebook-initiated OCP\, and others). Aligning with this upcoming transition\, in this talk\, the prototyping experience of OF@KOREN &\; OF@TEIN SmartX playgrounds will be shared by focusing on the hyper-convergent SmartX Boxes. Then\, for multisite edge clouds\, the on-going design trials of affordable SmartX K-Cluster will be explained. Finally\, by leveraging DevOps-based automation\, preliminary prototyping for IoT-Cloud services will be discussed by taking an example service scenario for smart energy. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:38@lincs.fr DTSTART;TZID=Europe/Paris:20161102T140000 DTEND;TZID=Europe/Paris:20161102T150000 DTSTAMP:20170313T170811Z URL:https://www.lincs.fr/events/liberte-sans-fraternite-est-la-mort-de-leg alite-pour-video-dans-linternetnetwork-layer-qoe-fairness-for-encrypted-ad aptive-video-streams/ SUMMARY:Liberté\, sans fraternité\, est la mort de l'\;égalité pour video dans l'\;Internet(Network-layer QoE-fairness for Encrypted Adaptive Video Streams) DESCRIPTION:Netflix\, YouTube\, and the like\, are now the dominant sources of traffic on the Internet. Recent studies observe that competing adaptive video streams generate flows that lead to instability\, under-utilization\, and unfairness behind bottleneck links. Additional measurements suggest there may also be a negative impact on users' perceived quality of experience as a consequence. Intuitively\, application-generated issues should be resolved at the application layer. In this presentation I shall demonstrate that fairness\, by any definition\, can only be solved in the network. Moreover\, that in an increasingly HTTP-S world\, some form of client interaction is required. In support\, a new network-layer 'QoE-fairness' metric will be be introduced that reflects user experience. Experiments using our open-source implementation in the home environment reinforce the network-layer as the right place to attack the general problem. For further reference see: [1]http://dl.ifip.org/db/conf/networking/networking2015/1570066341.pdf [2] https://dl.acm.org/citation.cfmLinks:back to the list item\, list top or summary top CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:39@lincs.fr DTSTART;TZID=Europe/Paris:20161026T140000 DTEND;TZID=Europe/Paris:20161026T150000 DTSTAMP:20220210T140857Z URL:https://www.lincs.fr/events/maximum-coloring-of-random-geometric-graph s/ SUMMARY:Maximum Coloring of Random Geometric Graphs DESCRIPTION:We have examined maximum vertex coloring of random geometric graphs\, in an arbitrary but fixed dimension\, with a constant number of colors\, in a recent work with S.~Borst. Since this problem is neither scale-invariant nor smooth\, the usual methodology to obtain limit laws cannot be applied. We therefore leverage different concepts based on subadditivity to establish convergence laws for the maximum number of vertices that can be colored. For the constants that appear in these results\, we have provided the exact value in dimension one\, and upper and lower bounds in higher dimensions.In an ongoing work with B. Blaszczyszy\, we study the distributional properties of maximum vertex coloring of random geometric graphs. Moreover\, we intend to generalize the study over weakly-$mu$-sub-Poisson processes. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:40@lincs.fr DTSTART;TZID=Europe/Paris:20161019T140000 DTEND;TZID=Europe/Paris:20161019T150000 DTSTAMP:20190513T084522Z URL:https://www.lincs.fr/events/hands-on-series-jupyter-notebook/ SUMMARY:Hands-on series: Jupyter Notebook DESCRIPTION:The Jupyter Notebook is a web application that allows you to create and share documents that contain live code\, equations\, visualizations and explanatory text. Uses include: data cleaning and transformation\, numerical simulation\, statistical modeling\, machine learning and much more. In this hands-on talk\, we will learn how to use a notebook\, how to use plugins (as well\nas a set of useful ones)\, and how to make online-presentations.\n\nAdditional resources available on GitHub. CATEGORIES:Seminars,Tools, Tips and Tricks,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:41@lincs.fr DTSTART;TZID=Europe/Paris:20161012T140000 DTEND;TZID=Europe/Paris:20161012T150000 DTSTAMP:20170313T170813Z URL:https://www.lincs.fr/events/caching-games-between-content-providers-an d-internet-service-providers/ SUMMARY:Caching Games between Content Providers and Internet Service Providers DESCRIPTION:We consider a scenario where an Internet Service Provider (ISP) serves users that choose digital content among M Content Providers (CP). In the status quo\, these users pay both access fees to the ISP and content fees to each chosen CP\; however\, neither the ISP nor the CPs share their profit. We revisit this model by introducing a different business model where the ISP and the CP may have motivation to collaborate in the framework of caching. The key idea is that the ISP deploys a cache for a CP provided that they share both the deployment cost and the additional profit that arises due to caching. Under the prism of coalitional games\, our contributions include the application of the Shapley value for a fair splitting of the profit\, the stability analysis of the coalition and the derivation of closed-form formulas for the optimal caching policy.Our model captures not only the case of non-overlapping contents among the CPs\, but also the more challenging case of overlapping contents\; for the latter case\, a non-cooperative game among the CPs is introduced and analyzed to capture the negative externality on the demand of a particular CP when caches for other CPs are deployed.\n\nJoint work with S. Elayoubi\, E. Altman\, and Y. Hayel to be presented at the 10th EAI International Conference on Performance Evaluation Methodologies and Tools (Valuetools 2016). The full version of the paper has been selected to be published in a special issue of the Elsevier journal of Performance Evaluation (PEVA). CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:42@lincs.fr DTSTART;TZID=Europe/Paris:20161005T140000 DTEND;TZID=Europe/Paris:20161005T150000 DTSTAMP:20170313T170813Z URL:https://www.lincs.fr/events/generalized-threshold-based-epidemics-in-r andom-graphs-the-power-of-extreme-values/ SUMMARY:Generalized Threshold-Based Epidemics in Random Graphs: the Power of Extreme Values DESCRIPTION:Bootstrap percolation is a well-known activation process in a graph\,in which a node becomes active when it has at least $r$ active neighbors.Such process\, originally studied on regular structures\, has been recentlyinvestigated also in the context of random graphs\, where it can serve as a simplemodel for a wide variety of cascades\, such as thespreading of ideas\, trends\, viral contents\, etc. over large social networks.In particular\, it has been shown that in $G(n\,p)$ the final active setcan exhibit a phase transition for a sub-linear number of seeds.In this paper\, we propose a unique framework to study similarsub-linear phase transitions for a much broader class of graph modelsand epidemic processes. Specifically\, we consider i) a generalized versionof bootstrap percolation in $G(n\,p)$ with random activation thresholdsand random node-to-node influences\; ii) different random graph models\,including graphs with given degree sequence and graphs withcommunity structure (block model). The common thread of our work is toshow the surprising sensitivity of the critical seed set sizeto extreme values of distributions\, which makes some systems dramaticallyvulnerable to large-scale outbreaks. We validate our results running simulation onboth synthetic and real graphs.\n\nJoint work with M. Garetto and G. Torrisi\, appeared at ACM SIGMETRIC 2016. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:43@lincs.fr DTSTART;TZID=Europe/Paris:20161003T110000 DTEND;TZID=Europe/Paris:20161003T120000 DTSTAMP:20170313T170813Z URL:https://www.lincs.fr/events/data-and-algorithmic-bias-in-the-web-amphi -jade-barrault/ SUMMARY:Data and Algorithmic Bias in the Web - Amphi Jade (Barrault) DESCRIPTION:\n\n\nAbstract:\nThe Web is the largest public big data repository that humankind hascreated. In this overwhelming data ocean\, we need to be aware of thequality and\, in particular\, of the biases that exist in this data. Inthe Web\, biases also come from redundancy and spam\, as well as fromalgorithms that we design to improve the user experience. This problemis further exacerbated by biases that are added by these algorithms\,specially in the context of search and recommendation systems. Theyinclude selection and presentation bias in many forms\, interaction bias\,social bias\, etc. We give several examples and their relation to sparsityand privacy\, stressing the importance of the user context to avoid thesebiases.\n\n\nBiography:\nRicardo Baeza-Yates areas of expertise are web search and data mining\,information retrieval\, data science and algorithms. He is CTO of NTENT\, a semantic search technology company. Before he was VP of Research at Yahoo Labs\, based in Barcelona\, Spain\, and later in Sunnyvale\, California\, from January 2006 to February 2016. He also is part time Professor at DTIC of the Universitat Pompeu Fabra\, in Barcelona\, Spain\, as well as at DCC of Universidad de Chile in Santiago. Until 2004 he was Professor and founding director of the Center for Web Research at the later place. He obtained a Ph.D. in CS from the University of Waterloo\, Canada\, in 1989. He is co-author of the best-seller Modern Information Retrieval textbook published by Addison-Wesley in 2011 (2nd ed)\, that won the ASIST 2012 Book of the Year award. From 2002 to 2004 he was elected to the board of governors of the IEEE Computer Society and in 2012 he was elected for the ACM Council. Since 2010 is a founding member of the Chilean Academy of Engineering. In 2009 he was named ACM Fellow and in 2011 IEEE Fellow\, among other awards and distinctions.\n\n\n CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:44@lincs.fr DTSTART;TZID=Europe/Paris:20160928T140000 DTEND;TZID=Europe/Paris:20160928T150000 DTSTAMP:20170313T170814Z URL:https://www.lincs.fr/events/n-backtracking-spectrum-of-degree-correcte d-stochastic-block-models/ SUMMARY:n-Backtracking Spectrum of Degree-Corrected Stochastic Block Models DESCRIPTION:Motivated by community detection\, we characterise the spectrum of the non-backtracking matrix $B$ in the Degree-Corrected Stochastic Block Model.Specifically\, we consider a random graph on $n$ vertices partitioned into two equal-sized clusters. The vertices have i.i.d. weights $ phi_u _u=1^n$ with second moment $PHItwo$. The intra-cluster connection probability for vertices $u$ and $v$ is $ phi_u phi_v a/b$ and the inter-cluster connection probability is $phi_u phi_v b/n$. We show that with high probability\, the following holds: The leading eigenvalue of the non-backtracking matrix $B$ is asymptotic to $rho = (a+b)/2 PHItwo$. The second eigenvalue is asymptotic to $mu_2 = (a+b)/2 PHItwo$ when $mu_2^2 >\; rho$\, but asymptotically bounded by $sqrtrho$ when $mu_2^2 leq rho$. All the remaining eigenvalues are asymptotically bounded by $sqrtrho$. As a result\, a clustering positively-correlated with the true communities can be obtained based on the second eigenvector of $B$ in the regime where $mu_2^2 >\; rho.$In a previous work we obtained that detection is impossible when $mu_2^2 <\; rho\,$ meaning that there occurs a phase-transition in the sparse regime of the Degree-Corrected Stochastic Block Model. As a corollary\, we obtain that Degree-Corrected Erdos-Renyi graphs asymptotically satisfy the graph Riemann hypothesis\, a quasi-Ramanujan property.A by-product of our proof is a weak law of large numbers for local-functionals on Degree-Corrected Stochastic Block Models\, which could be of independent interest. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:45@lincs.fr DTSTART;TZID=Europe/Paris:20160907T143000 DTEND;TZID=Europe/Paris:20160907T150000 DTSTAMP:20170313T170814Z URL:https://www.lincs.fr/events/network-function-virtualization-techno-eco nomics/ SUMMARY:Network Function Virtualization\; Techno-Economics DESCRIPTION:Network Function Virtualization (NFV) is an emerging approach\nthat has received attention from both academia and industry as a way to\nimprove flexibility\, efficiency\, and manageability of networks. NFV\nenables new ways to operate networks and to provide composite network\nservices\, opening the path toward new business models. As in cloud\ncomputing with the Infrastructure as a Service model\, clients will be\noffered the capability to provision and instantiate Virtual Network\nFunctions (VNF) on the NFV infrastructure of the network operators. In\nthis paper\, we consider the case where leftover VNF capacities are\noffered for bid. This approach is particularly interesting for clients\nto punctually provision resources to absorb peak or unpredictable\ndemands and for operators to increase their revenues. We propose a game\ntheoretic approach and make use of Multi-Unit Combinatorial Auctions to\nselect the winning clients and the price they pay. Such a formulation\nallows clients to express their VNF requests according to their\nspecific objectives. We solve this problem with a greedy heuristic and\nprove that this approximation of economic efficiency is the closest\nattainable in polynomial time and provides a payment system that\nmotivates bidders to submit their true valuations. Simulation results\nshow that the proposed heuristic achieves a market valuation close to\nthe optimal (less than 10 % deviation) and guarantees that an important\npart of this valuation is paid as revenue to the operator. Joint work\nwith Jean-Louis Rougier\, Luigi Iannone\, Mathieu Bouet and Vania Conan\,\nto appear at ITC28 [21]https://itc28.org/ CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:46@lincs.fr DTSTART;TZID=Europe/Paris:20160907T140000 DTEND;TZID=Europe/Paris:20160907T143000 DTSTAMP:20170313T170815Z URL:https://www.lincs.fr/events/dynamic-cache-partitioning-for-encrypted-c ontent-delivery/ SUMMARY:Dynamic Cache Partitioning for Encrypted Content Delivery DESCRIPTION:In-network caching is an appealing solution to cope with the\nincreasing bandwidth demand of video\, audio and data transfer over the\nInternet. Nonetheless\, an increasing share of content delivery services\nadopt encryption through HTTPS\, which is not compatible with\ntraditional ISP-managed approaches like transparent and proxy caching.\nThis raises the need for solutions involving both Internet Service\nProviders (ISP) and Content Providers (CP): by design\, the solution\nshould preserve business-critical CP information (e.g.\, content\npopularity\, user preferences) on the one hand\, while allowing for a\ndeeper integration of caches in the ISP architecture (e.g.\, in 5G\nfemto-cells) on the other hand. In this paper we address this issue by\nconsidering a content-oblivious ISP-operated cache. The ISP allocates\nthe cache storage to various content providers so as to maximize the\nbandwidth savings provided by the cache: the main novelty lies in the\nfact that\, to protect business-critical information\, ISPs only need to\nmeasure the aggregated miss rates of the individual CPs. We propose a\ncache allocation algorithm based on a perturbed stochastic subgradient\nmethod\, and prove that the algorithm converges to the allocation that\nmaximizes the overall cache hit rate. We use extensive simulations to\nvalidate the algorithm and to assess its convergence rate under\nstationary and non-stationary content popularities. Our results (i)\ntestify the feasibility of content-oblivious caches and (ii) show that\nthe proposed algorithm can achieve within 15% from the global optimum\nin our evaluation. Joint work with Gyorgy Dan and Dario Rossi\, to\nappear at ITC28 [17]https://itc28.org/ CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:48@lincs.fr DTSTART;TZID=Europe/Paris:20160713T150000 DTEND;TZID=Europe/Paris:20160713T160000 DTSTAMP:20170313T170914Z URL:https://www.lincs.fr/events/data-driven-design-and-simulation-of-futur e-mobile-networks-with-applications-in-vehicular-networks-transportation-m obile-health/ SUMMARY:Data-Driven Design and Simulation of Future Mobile Networks (with applications in Vehicular Networks\, Transportation\, Mobile Health) DESCRIPTION:The future of social networking is in the mobile world. Future network services are expected to center around human activity and behavior. Wireless networks (including ad hoc\, sensor networks and DTNs) are expected to grow significantly and accommodate higher levels of mobility and interaction. In such a highly dynamic environment\, networks need to adapt efficiently (performance-wise) and gracefully (correctness and functionality-wise) to growth and dynamics in many dimensions\, including behavioral and mobility patterns\, on-line activity and load. Understanding and realistically modeling this multi-dimensional space is essential to the design and evaluation of efficient protocols and services of the future Internet. This level of understanding to drive the modeling and protocol design shall be developed using data-driven paradigm. The design philosophy for the proposed paradigm is unique in that it begins by intensive analysis of measurements from the target contexts\, which then drive the modeling\, protocol and service design through a systematic framework\, called TRACE. Components of TRACE include: 1. Tracing and monitoring of behavior\, 2. Representing and Analyzing the data\, 3. Characterizing behavioral profiles using data mining and clustering techniques\, and finally 4. Employing the understanding and insight attained into developing realistic models of mobile user behavior\, and designing efficient protocols and services for future mobile societies.Tracing at a large scale represents the next frontier for sensor networks (sensing the human society). Our latest progress in that field (MobiLib) shall be presented\, along with data mining and machine learning tools to meaningfully analyze the data. Several challenges will be presented and novel use of clustering algorithms will be provided. Major contributions to modeling of human mobility\; the time variant community model\, TVC and Community Mobility (COBRA) will also be discussed. In addition\, a novel framework for measuring vehicular mobility at planet scale\, using thousands of webcams around the world\, shall be presented.Insights developed through analysis\, mining and modeling will be utilized to introduce and design a novel communication paradigm\, called profile-cast\, to support new classes of service for interest-aware routing and dissemination of information\, queries and resource discovery\, trust and participatory sensing (crowd sourcing) in future mobile networks. Unlike conventional - unicast\, multicast or directory based - paradigms\, the proposed paradigm infers user interest using implicit behavioral profiling via self-monitoring and mining techniques. In order to capture interest\, a spatio-temporal representation is introduced to capture users behavioral-space. Users can identify similarity of interest based on their position in such space. The proposed profile-cast paradigm will act as enabler to new classes of service\, ranging from mobile social networking\, and navigation of mobile societies and spaces\, to computational health care\, mhealth (mobile health)\, emergency management and education\, among others. The ideas of similarity-based support groups will be specifically highlighted for potential applications in disease-self management\, collaborative education\, and emergency response.\n\nBiography:\n\nDr. Ahmed Helmy is a Professor and Graduate Director at the Computer and Information Science and Engineering (CISE) Department at the University of Florida (UF). He received his Ph.D. in Computer Science 1999 from the University of Southern California (USC)\, M.Sc. in Electrical Engineering (EE) 1995 from USC\, M.Sc. in Engineering Mathematics in 1994 and B.Sc. in Electronics and Communications Engineering 1992 from Cairo University\, Egypt. He was a key researcher in the Network Simulator NS-2 and Protocol-Independent Multicast (PIM) projects at USC/ISI from 1995 to 1999. Before joining UF in 2006\, he was on the Electrical Engineering-Systems Department faculty at USC starting Fall 1999\, where he founded and directed the Wireless and Sensor Networks Labs. In 2002\, he received the NSF CAREER Award for his research on resource discovery and mobility modeling in large-scale wireless networks (MARS). In 2000 he received the Zumberge Award\, and in 2002 he received the best paper award from the IEEE/IFIP MMNS Conference. In 2003 he was the Electrical Engineering nominee for the USC Engineering Jr. Faculty Research Award\, and a nominee for the Sloan Fellowship. In 2004 and 2005 he got the best faculty merit ranking at the Electrical Engineering department at USC. He was a winner in the ACM MobiCom 2007\, a finalist in 2008 SRC competitions\, a 2nd place winner in ACM MobiCom WiNTECH demo competition 2010\, and a finalist/runner-up in the 2012 ACM MobiCom SRC competition. In '13 he won the best paper award from ACM SIGSPATIAL IWCTS. In 2014 he won the Epilepsy Foundation award for innovation\, and the ACM MobiCom Mobile App Competition (1st place) and startup pitch competition (2nd place). In 2015 he won the Internet Technical Committee (ITC) best paper award by for seven IEEE ComSoc conferences/symposia of 2013. He is leading (or has led) several NSF funded projects including MARS\, STRESS\, ACQUIRE\, AWARE and MobiBench. His research interests include design\, analysis and measurement of wireless ad hoc\, sensor and mobile social networks\, mobility modeling\, multicast protocols\, IP mobility and network simulation. He has published over 150 journal articles\, conference papers and posters\, book chapters\, IETF RFCs and Internet drafts. His research is (or has been) supported by grants from NSF\, KACST\, Aalto University\, USC\, Intel\, Cisco\, DARPA\, NASA\, Nortel\, HP\, Pratt &\; Whitney\, Siemens and SGI. He has over 12\,200 citations with H-index=48 (Google Scholar). Dr. Helmy is an editor of the IEEE Transactions on Mobile Computing (TMC)\, an area editor of the Ad hoc Networks Journal - ElSevier (since 2004)\, and an area editor of the IEEE Computer (since 2010). He was the finance chair of ACM MobiCom '13\, co-chair of ACM MobiSys HotPlanet '12\, program co-chair for ACM MSWiM 2011\, and ACM MobiCom CHANTS workshop 2011\, co-chair of AdhocNets 2011\, honorary program chair of IEEE/ACM IWCMC 2011\, general chair of IWCMC 2010\, vice-chair of IEEE MASS 2010\, plenary panel chair of IEEE Globecom 2010\, co-chair of IEEE Infocom Global Internet (GI) workshop 2008\, and IFIP/IEEE MMNS 2006\, vice-chair for IEEE ICPADS 2006\, IEEE HiPC 2007\, and local &\; poster chair for IEEE ICNP 2008 and 2009. He is ACM SIGMOBILE workshop coordination chair (for MobiCom\, Mobihoc\, Mobisys\, Sensys) (since 2006). He has served on numerous committees of IEEE and ACM conferences on networks. He is a senior member of the IEEE and an ACM Distinguished Scientist. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:47@lincs.fr DTSTART;TZID=Europe/Paris:20160713T140000 DTEND;TZID=Europe/Paris:20160713T150000 DTSTAMP:20170313T170913Z URL:https://www.lincs.fr/events/the-effects-of-mobility-on-the-hit-perform ance-of-cached-d2d-networks/ SUMMARY:The Effects of Mobility on the Hit Performance of Cached D2D Networks DESCRIPTION:\n\n\nIn this talk we will deal with problems arising in device-to-device (D2D) wireless networks\, where user devices also have the ability to cache content. In such networks\, users are mobile and communication links can be spontaneously activated and dropped depending on the users' relative position. Receivers request files from transmitters\, these files having a certain popularity and file-size distribution. In our work a new performance metric is introduced\, namely the Service Success Probability\, which captures the specificities of D2D networks. For the Poisson Point Process case for node distribution and the $mathrmSNR$ coverage model\, explicit expressions are derived. Simulations support the analytical results and explain the influence of mobility and file-size distribution on the system performance\, while providing intuition on how to appropriately cache content on mobile storage space. Of particular interest is the investigation on how different file-size distributions (Exponential\, Uniform\, or Heavy-Tailed) influence the performance.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:50@lincs.fr DTSTART;TZID=Europe/Paris:20160706T140000 DTEND;TZID=Europe/Paris:20160706T150000 DTSTAMP:20170313T170915Z URL:https://www.lincs.fr/events/mining-usage-patterns-in-residential-intra net-of-things/ SUMMARY:Mining usage patterns in residential intranet of things DESCRIPTION:Ubiquitous smart technologies gradually transform modern homes into Intranet of Things\, where a multitude of connected devices allow for novel home automation services (e.g.\, energy or bandwidth savings\, comfort enhancement\, etc.). Optimizing and enriching the Quality of Experience (QoE) of residential users emerges as a critical differentiator for Internet and Communication Service providers (ISPs and CSPs\, respectively) and heavily relies on the analysis of various kinds of data (connectivity\, performance\,usage) gathered from home networks. In this paper\, we are interested in new Machine-to-Machine data analysis techniques that go beyond binary association rule mining for traditional market basket analysis considered by previous works\, to analyze individual device logs of home gateways. Based on multidimensional patterns mining framework\, we extract complex device co-usage patterns of 201 residential broadband users of an ISP\, subscribed to a triple-play service. Such fine-grained device usage patternsprovide valuable insights for emerging use cases such as an adaptive usage of home devices\, and also ``things'' recommendation. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:49@lincs.fr DTSTART;TZID=Europe/Paris:20160629T140000 DTEND;TZID=Europe/Paris:20160629T150000 DTSTAMP:20170313T170914Z URL:https://www.lincs.fr/events/a-minimax-optimal-algorithm-for-crowdsourc ing/ SUMMARY:A Minimax Optimal Algorithm for Crowdsourcing DESCRIPTION:We consider the problem of accurately estimating the reliability of workers based on noisy labels they provide\, which is a fundamental question in crowdsourcing. We propose a novel lower bound on the minimax estimation error which applies to any estimation procedure. We further propose Triangular Estimation (TE)\, an algorithm for estimating the reliability of workers. TE has low complexity\, may be implemented in a streaming setting when labels are provided by workers in real time\, and does not rely on an iterative procedure. We further prove that TE is minimax optimal and matches our lower bound. We conclude by assessing the performance of TE and other state-of-the-art algorithms on both synthetic and real-world data sets.Joint work with Thomas Bonald (Telecom ParisTech) CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:51@lincs.fr DTSTART;TZID=Europe/Paris:20160518T140000 DTEND;TZID=Europe/Paris:20160518T150000 DTSTAMP:20170313T170915Z URL:https://www.lincs.fr/events/more-details-to-come/ SUMMARY:Finding Very Damaging Needles in Very Large Haystacks DESCRIPTION:\n\n\nAbstract:\nMany of the most costly security compromises that enterprises suffer manifest as tiny trickles of behavior hidden within an ocean of other site activity. This talk exams design patterns applicable to developing robust detectors for particular forms of such activity. The themes include research pitfalls\, the crucial need to leverage domain knowledge in an apt fashion\, and why machine learning is very difficult to effectively apply for such detection.\n\n\nBiography:\nVern Paxson is a Professor of Electrical Engineering and Computer Sciences at UC Berkeley. He also leads the Networking and Security Group at the International Computer Science Institute in Berkeley\, and has an appointment as a Staff Scientist at the Lawrence Berkeley National Laboratory. His research focuses heavily on measurement-based analysis of network activity and Internet attacks. He works extensively on high performance network monitoring\, detection algorithms\, cybercrime\, and countering censorship.In 2006 he was inducted as a Fellow of the Association for Computing Machinery (ACM). In 2011 he received ACM's SIGCOMM Award\, which recognizes lifetime contribution to the field of communication networks\, "for his seminal contributions to the fields of Internet measurement and Internet security\, and for distinguished leadership and service to the Internet community." His measurement work has also been recognized by ACM's Grace Murray Hopper Award and by the 2015 IEEE Internet Award. In 2013 he co-founded Broala\, a startup that provides commercial-grade support and products for the "Bro" network monitoring system that he created and has advanced through his research for many years.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:53@lincs.fr DTSTART;TZID=Europe/Paris:20160511T140000 DTEND;TZID=Europe/Paris:20160511T150000 DTSTAMP:20170313T170916Z URL:https://www.lincs.fr/events/3830/ SUMMARY:Networks of multi-server queues with parallel processing DESCRIPTION:\n\n\nWe consider a network of multi-server queues wherein each job can be processed in parallel by any subset of servers within a pre-defined set that depends on its class. Each server is allocated in FCFS order at each queue. Jobs arrive according to Poisson processes\, have independent exponential service requirements and are routed independently at random. We prove that the network state has a product-form stationary distribution\, in the open\, closed and mixed cases. From a practical perspective\, we propose an algorithm on this basis to allocate the resources of a computer cluster.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:52@lincs.fr DTSTART;TZID=Europe/Paris:20160420T140000 DTEND;TZID=Europe/Paris:20160420T150000 DTSTAMP:20170313T170916Z URL:https://www.lincs.fr/events/where-are-the-anycasters/ SUMMARY:Where are the anycasters DESCRIPTION:Use of anycast IP addresses has increased in the last few years: once relegated to DNS root and top-level domain servers\, anycast is now commonly used to assist distribution of general purpose content by CDN providers. Yet\, most anycast discovery methodologies rely so far on DNS\, which limits their usefulness to this particular service. This raises the need for protocol agnostic methodologies\, that should additionally be as lightweight as possible in order to scale up anycast service discovery.Our anycast discovery method allows for exhaustive and accurate enumeration and city-level geolocation of anycast replicas\, with the constraints of only leverages a handful of latency measurements from a set of known probes. The method exploits an iterative workflow to enumerate (optimization problem) and geolocate (classification problem) anycast instances. The method is so lightweight and protocol agnostic that we were able to perform several censuses of the whole IPv4 Internet\, recollecting all anycast deployments. Finally\, we carry on a passive study of anycast traffic to refine the picture of services currently served over IP anycast. All our code\, dataset and further information are available athttp://www.enst.fr/~drossi/anycast CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:56@lincs.fr DTSTART;TZID=Europe/Paris:20160418T150000 DTEND;TZID=Europe/Paris:20160418T160000 DTSTAMP:20170313T170917Z URL:https://www.lincs.fr/events/data-cleaning-in-the-big-data-era/ SUMMARY:Data Cleaning in the Big Data era @ Barrault (Amphi Rubis) DESCRIPTION:\n\n\nAbstract:\nIn the “big data” era\, data is often dirty in nature because of several reasons\, such as typos\, missing values\, and duplicates. The intrinsic problem with dirty data is that it can lead to poor results in analytic tasks. Therefore\, data cleaning is an unavoidable task in data preparation to have reliable data for final applications\, such as querying and mining. Unfortunately\, data cleaning is hard in practice and it requires a great amount of manual work. Several systems have been proposed to increase automation and scalability in the process. They rely on a formal\, declarative approach based on first order logic: users provide high-level specifications of their tasks\, and the systems compute optimal solutions without human intervention on the generated code. However\, traditional ‘top-down’ cleaning approaches quickly become unpractical when dealing with the complexity and variety found in big data.In this talk\, we first describe recent results in tackling data cleaning with a declarative approach. We then discuss how this experience has pushed several groups to propose new systems that recognize the central role of the users in cleaning big data.\n\n\nBiography:\nPaolo Papotti is an Assistant Professor of Computer Science in the School of Computing\, Informatics\, and Decision Systems Engineering (CIDSE) at Arizona State University. He got his Ph.D. in Computer Science at Universita’ degli Studi Roma Tre (2007\, Italy) and before joining ASU he had been a senior scientist at Qatar Computing Research Institute. His research is focused on systems that assist users in complex\, necessary tasks and that scale to large datasets with efficient algorithms and distributed platforms. His work has been recognized with two “Best of the Conference” citations (SIGMOD 2009\, VLDB 2015) and with a best demo award at SIGMOD 2015. He is group leader for SIGMOD 2016 and associate editor for the ACM Journal of Data and Information Quality (JDIQ).\n\n\n\n \; CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:54@lincs.fr DTSTART;TZID=Europe/Paris:20160418T120000 DTEND;TZID=Europe/Paris:20160418T130000 DTSTAMP:20170313T170917Z URL:https://www.lincs.fr/events/webstrates-shareable-dynamic-media/ SUMMARY:Webstrates : Shareable Dynamic Media DESCRIPTION:I present our ACM UIST'15 Best Paper Award-winning research on Webstrates: Shareable Dynamic Media. In this work\, we revisit Alan Kay's early vision of dynamic media\, which blur the distinction between document and application. We introduce shareable dynamic media\, which are malleable by users\, who may appropriate them in idiosyncratic ways\; shareable among users\, who can collaborate on multiple aspects of the media\; and distributable across diverse devices and platforms. We present Webstrates\, an environment for exploring shareable dynamic media. Webstrates augment web technology with real-time sharing. They turn web pages into substrates\, i.e. software entities that act as applications or documents depending upon use. We illustrate Webstrates with two implemented case studies: users collaboratively author an article with functionally and visually different editors that they can personalize and extend at run-time\; and they orchestrate its presentation and audience participation with multiple devices.\n\nThis talk will take place at Telecom Paristech rue Barrault\,(Room TBD)\n CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:57@lincs.fr DTSTART;TZID=Europe/Paris:20160413T140000 DTEND;TZID=Europe/Paris:20160413T150000 DTSTAMP:20170313T170918Z URL:https://www.lincs.fr/events/a-study-of-the-impact-of-dns-resolvers-on- cdn-performance-using-a-causal-approach/ SUMMARY:A Study of the Impact of DNS Resolvers on CDN Performance Using a Causal Approach DESCRIPTION:Resources such as Web pages or videos that are published in the Internet are referred to by their Uniform Resource Locator (URL). If a user accesses a resource via its URL\, the host name part of the URL needs to be translated into a routable IP address. This translation is performed by the Domain Name System service (DNS). DNS also plays an important role when Content Distribution Networks (CDNs) are used to host replicas of popular objects on multiple servers that are located in geographically different areasA CDN makes use of the DNS service to infer client location and direct the client request to optimal server. While most Internet Service Providers (ISPs) offer a DNS service to their customers\, clients may instead use a public DNS service. The choice of the DNS service can impact the performance of clients when retrieving a resource from a given CDN. In this paper we study the impact on download performance for clients using either the DNS service of their ISP or the public DNS service provided by Google DNS. We adopt a causal approach that exposes the structural dependencies of the different parameters impacted by the DNS service used and we show how to model these dependencies with a Bayesian network. The Bayesian network allows us to explain and quantify the performance benefits seen by clients when using the DNS service of their ISP. We also discuss how the further improve client performance. Joint work with Hadrien Hours\, Patrick Loiseau\, Alessandro Finamore and Marco Mellia CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:64@lincs.fr DTSTART;TZID=Europe/Paris:20160330T140000 DTEND;TZID=Europe/Paris:20160330T143000 DTSTAMP:20170313T170921Z URL:https://www.lincs.fr/events/tbd-7/ SUMMARY:Passive Wi-Fi link Capacity Estimation on Commodity Access Points DESCRIPTION:Wi-Fi is the preferred way of accessing the internet for many devices at home\, but it is vulnerable to performance problems due to sharing an unlicensed medium. In this work\, we propose a method to estimate the link capacity of a Wi-Fi link\, using physical layer metrics that can be passively sampled on commodity access points. We build a model that predicts the maximum UDP throughput a device can sustain\, extending previous models that do not consider IEEE 802.1n optimizations such as frame aggregation. We validate our method through controlled experiments in an anechoic chamber and artificially create different link quality conditions. We estimate the link capacity using our method and compare it to the state of the art. Over 95% of the link capacity predictions present errors below 5% when using our method with reference data. We show how the link capacity estimation enables Wi-Fi diagnosis in two case studies where we predict the available bandwidth under microwave interference and in an office environment. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:59@lincs.fr DTSTART;TZID=Europe/Paris:20160330T140000 DTEND;TZID=Europe/Paris:20160330T150000 DTSTAMP:20170313T170919Z URL:https://www.lincs.fr/events/dynamic-resource-allocation-for-c-ran-syst ems-2/ SUMMARY:Dynamic Resource Allocation for C-RAN systems DESCRIPTION:\n\n\nAbstract:\nCloud-Radio Access Network (C-RAN) is a new emerging technology that holds alluring promises for Mobile network operators regarding capital and operation cost savings. However\, many challenges still remain before full commercial deployment of C-RAN solutions. Dynamic resource allocation algorithms are needed to cope with significantly fluctuating traffic loads. Those algorithms must target not only a better quality of service delivery for users\, but also less power consumption and better interference management\, with the possibility to turn off RRHs that are not transmitting. To this end\, we propose a dynamic two-stage design for downlink OFDMA resource allocation and BBU-RRH assignment in C-RAN. Simulation results show that our proposal achieves not only a high satisfaction rate for mobile users\, but also minimal power consumption and significant BBUs savings\, compared to state-of-the-art schemes.\n\n\nBiography:\nYazid L​yazidi received his Diploma in Computer Science and Telecommunications Engineering from INPT\, Rabat\, Morocco\, in 2014 and the M.S. degree in Advanced Wireless Systems from École supérieure d'électricité SUPELEC\, Gif sur Yvette\, France the same year. He is now a PhD candidate in LIP6\, University Pierre and Marie Curie\, Paris\, under the advisory of Prof. Rami Langar and Dr. Nadjib AITSAADI. His research topics include energy minimization and resource management in Cloud RAN.\n\n\n\n \; CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:55@lincs.fr DTSTART;TZID=Europe/Paris:20160325T110000 DTEND;TZID=Europe/Paris:20160325T120000 DTSTAMP:20170313T170917Z URL:https://www.lincs.fr/events/power-control-for-non-orthogonal-multiple- access-in-5g-cellular-systems/ SUMMARY:Power Control for Non-Orthogonal Multiple Access in 5G Cellular Systems DESCRIPTION:\n\n\nAbstract:\nNon-orthogonal multiple access (NOMA) is a promising candidate for wireless access in 5G cellular systems\, and has recently received considerable attentions from both academia and industry. In a NOMA system\, multiple users share the same carrier frequency at the same time\, and their messages are decoded via successive interference cancellation (SIC). While the idea of SIC was proposed a long time ago\, it is now regarded as a practical solution to wireless networks. For SIC to work properly\, the signal-to-interference ratio of each user needs to be high enough for successful decoding and subsequent cancellation. To meet such a requirement\, transmitter power control becomes indispensable. This talk focuses on power control for inter-cell interference management in NOMA systems. The classical power control results based on Perron-Frobenius theory of non-negative matrices will be reviewed\, and how they can be applied to multi-cell NOMA systems will be presented. For practical application to 5G systems\, it is desirable to have distributed algorithms for power control\, which will also be discussed.\n\n\nBiography:\nDr. Chi Wan Sung is an Associate Professor in the Department of Electronic Engineering at City University of Hong Kong. He received the BEng\, MPhil\, and PhD degrees in information engineering from the Chinese University of Hong Kong in 1993\, 1995\, and 1998\, respectively. He has served as editor for the ETRI journal and for the Transactions on Emerging Telecommunications Technologies. His research interests include power control and resource allocation\, cooperative communications\, network coding\, and distributed storage systems.\n\n\n\n \; CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:58@lincs.fr DTSTART;TZID=Europe/Paris:20160323T140000 DTEND;TZID=Europe/Paris:20160323T150000 DTSTAMP:20170313T170918Z URL:https://www.lincs.fr/events/ibgp2-a-scalable-ibgp-redistribution-mecha nism-leading-to-optimal-routing/ SUMMARY:iBGP2: a scalable iBGP redistribution mechanism leading to optimal routing DESCRIPTION:The Internet is made of almost 50\,000 ASes exchanging routing informationthanks to BGP. Inside each AS\, information is redistributed via iBGP sessions.This allows each router to map a destination exterior to the AS with a givenegress point. The main redistribution mechanisms used today\, (iBGP full mesh\, RouteReflectors and BGP confederations)\, either guarantee selection of the bestegress point or enhance scalability\, but not both. In this paper\, we propose a new wayto perform iBGP redistribution in an AS based on its IGP topology\, conciliatingoptimality in route selection and scalability. Our contribution is threefold.First\, we demonstrate the tractability of our approach and its benefits.Second\, we provide an open-source implementation of our mechanism based onQuagga. Third\, we illustrate the feasibility of our approach throughsimulations performed under ns-3 and compare its performance with full meshand Route Reflection. Joint work with Anthony Lambert (Orange Labs) Steve Uhlig (Queen Mary University of London)\, to appear at IEEE INFOCOM 2016\, CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:60@lincs.fr DTSTART;TZID=Europe/Paris:20160309T140000 DTEND;TZID=Europe/Paris:20160309T150000 DTSTAMP:20170313T170919Z URL:https://www.lincs.fr/events/bandwidth-calendaring-a-new-sdn-service/ SUMMARY:Bandwidth calendaring: a new SDN service DESCRIPTION:\n\n\nAbstract:\nSoftware Defined Networking paves the way for new services that enable better utilization of network resources. Bandwidth Calendaring (BWC) is a typical such example that exploits knowledge about future traffic\, to optimally pack the arising demands over the network. We consider a generic BWC instance\, where a network operator has to accommodate at minimum cost demands of predetermined\, but time-varying\, bandwidth requirements that can be scheduled within a specific time window. By exploiting the structure of the problem\, we propose low complexity methods for the decomposition of the original Mixed integer problem into simpler ones. Our numerical results reveal that the proposed solution approach is near-optimal and outperforms standard methods based on linear programming relaxations and randomized rounding by more than 20%.\n\n\nBiography:\nLazaros Gkatzikis (S’09–M’13) obtained the Ph.D. degree in computer engineering and communications from the University of Thessaly\, Volos\, Greece. Currently\, he is a Research Staff Member at Huawei France Research Center\, Paris\, France. In the fall of 2011\, he was a Research Intern at the Technicolor Paris Research Laboratory. He has been a Postdoctoral Researcher in the team of Prof. L. Tassiulas in Volos\, Greece (2013) and at the KTH Royal Institute of Technology\, Stockholm\, Sweden (2014) working with Associate Prof. C. Fischione. His research interests include network optimization\, mechanism design\, and network performance analysis.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:61@lincs.fr DTSTART;TZID=Europe/Paris:20160302T140000 DTEND;TZID=Europe/Paris:20160302T150000 DTSTAMP:20170313T170919Z URL:https://www.lincs.fr/events/an-opportunistic-blanking-subframe-obs-sol ution-for-5g-networks/ SUMMARY:An Opportunistic Blanking SubFrame (OBS) solution for 5G networks DESCRIPTION:\n\n\nAbstract:\nTelco operators view network densification as a viable solution for the challenging goals set for the next generation cellular networks. Among other goals\, network densification would help accomodating the always increasing mobile demand or would allow to considerably reduce connection latency. Nevertheless\, along with network densification\, many issues arise. For example\, sever inter-cell interference (ICI) may considerably limit network capacity if coordination among base stations is not used. To tackle such a problem\, we focus on the well-known Almost Blank Sub-Frame (ABS or ABSF) solution. With ABSF\, in order to reduce interference\, not all the base stations are allowed to transmit at the same time. In this talk\, we question the ability of ABSF of improving both aggregate system throughput and transmission efficiency and we show how ABSF may purse some other different objectives. In contrast\, we show that a better way of improving system throughput is enabling Device-to-Device communications among UEs and opportunistic forwarding. Therefore\, we propose a novel mechanism (OBS) that exploits and coordinates simultaneously ABSF and opportunistic forwarding to improve system throughput and user fairness. Our approach has been validated against state of the art approaches through an extensive simulation campaign\, even using real data from a network operator.\n\n\n\n \; CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:62@lincs.fr DTSTART;TZID=Europe/Paris:20160226T140000 DTEND;TZID=Europe/Paris:20160226T150000 DTSTAMP:20170313T170920Z URL:https://www.lincs.fr/events/on-the-whittle-index-for-restless-multi-ar med-hidden-markov-bandits/ SUMMARY:On the Whittle Index for Restless Multi-armed Hidden Markov Bandits DESCRIPTION:\n\n\nAbstract:\nWe consider a restless multi-armed bandit in which each armcan be in one two states. When an arm is sampled\, the state of the armis not available to the sampler. Instead\, a binary signal with a knownrandomness that depends on the state of the arm is made available. Nosignal is displayed if the arm is not sampled. An arm-dependent reward isaccrued from each sampling. In each time step\, each arm changes stateaccording to known transition probabilities which in turn depend onwhether the arm is sampled or not sampled. Since the state of the arm isnever visible and has to be inferred from the current belief and apossible binary signal\, we call this the hidden Markov bandit. Ourinterest is in a policy to select the arm(s) in each time step thatmaximises the infinite horizon discounted reward. Specifically\, we seekthe use of Whittle’s index in selecting the arms.We first analyze the single-armed bandit and show that it admits anapproximate threshold-type optimal policy when the ‘no-sample’ actionis subsidised. Next\, we show that this also satisfies an approximate-indexability property. Numerical examples support the analytical results\n\n\n\n \; CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:65@lincs.fr DTSTART;TZID=Europe/Paris:20160224T150000 DTEND;TZID=Europe/Paris:20160224T160000 DTSTAMP:20170313T170921Z URL:https://www.lincs.fr/events/lattice-network-codes-based-on-barnes-wall -lattices/ SUMMARY:Lattice network codes based on Barnes-Wall lattices DESCRIPTION:\n\n\nAbstract:\nLattice network coding is employed in physical-layer network coding\, with applications to two-way relay networks and multiple-access channels. The receiver wants to compute a linear combination of the source symbols\, which are drawn from a finite alphabet equipped with some algebraic structure. In this talk\, we construct lattice network codes from lattices such as the E8 lattice and the Barnes-Wall lattice\, which have the best known packing density and shaping gain in dimension 8 and 16\, respectively. Simulation results demonstrate that there is a significant performance gain in comparison to the baseline lattice network code with hyper-cube shaping.\n\n\nBiography:\nKenneth Shum received the B.Eng. degree in Information Engineering from the Chinese University of Hong Kong in 1993\, and the M.S. and Ph.D. degree in Electrical Engineering from University of Southern California in 1995 and 2000 respectively. He is now a research fellow in the Institute of Network Coding\, CUHK. His research interests include information theory\, coding theory and cooperative communication in wireless network. He is also a member of Composers and Authors Socity of Hong Kong (CASH) and has Erdos number 2.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:63@lincs.fr DTSTART;TZID=Europe/Paris:20160224T140000 DTEND;TZID=Europe/Paris:20160224T150000 DTSTAMP:20170313T170920Z URL:https://www.lincs.fr/events/logic-based-integrative-causal-discovery-w ith-business-applications/ SUMMARY:Logic-Based Integrative Causal Discovery with Business Applications DESCRIPTION: \;\n\n\n\n\nComputational Causal Discovery aims to induce causal models\,causal networks\, and causal relations from observational data withoutperforming or by performing only few interventions (perbutations\,manipulations) of a system. While predictive analytics create models thatpredict customer behavior for example\, causal analytics create models thatdictate how to affect customer behavior. A recent approach to causaldiscovery\, which we call logic-based integrative causal discovery\, will bepresented. This approach is more robust to statistical errors\, makes morerealistic and less restrictive assumptions (e.g.\, admits latent confoundingfactors and selection bias in the data) and accepts and reasons withmultiple heterogeneous datasets that are obtained under different samplingcriteria\, different experimental conditions (perbubations\, interventions)\,and measuring different quantities (variables). The approach significantlyextends causal discovery based on Bayesian Networks\, the simplest causalmodel available\, and is much more suitable for real business or scientificdata analysis.\n\n \;\n\n\n\nProf. Ioannis Tsamardinos is Associate Professor at the ComputerScience Department of University of Crete and co-founder of Gnosis DataAnalysis IKE. Prof. Tsamardinos has over 70 publications in internationaljournals\, conferences\, and books. He has participated in several national\,EU\, and US funded research projects. Distinctions with colleagues andstudents include the best performance in one of the four tasks in therecent First Causality Challenge Competition\, ISMB 2005 Best Poster Winner\,a Gold Medal in the Student Paper Competition in MEDINFO 2004\, theOutstanding Student Paper Award in AIPS 2000\, the NASA Group AchievementAward for participation in the Remote Agent team and others. He is aregular reviewer for some of the leading Machine Learning journals andconferences. Statistics on recognition of work include more than 4500citations\, and h-index of 28 (as estimated by the Publish or Perish tool).Prof. Tsamardinos has recently been awarded the European and Greek nationalgrants of excellence\, the ERC Consolidator and the ARISTEIA II grantsrespectively (the equivalent of the NSF Young Investigator Award). Prof.Tsamardinos has pioneered the integrative causal analysis and thelogic-based approach to causal discovery. The ERC grant in particularregards the development of novel integrative causal discovery methods andtheir application to biological mass cytometry data.\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:66@lincs.fr DTSTART;TZID=Europe/Paris:20160210T140000 DTEND;TZID=Europe/Paris:20160210T160000 DTSTAMP:20170313T170936Z URL:https://www.lincs.fr/events/thats-the-end-of-the-web-as-we-know-it/ SUMMARY:That'\;s the end of the Web as we know it DESCRIPTION:HTTP is one crucial element of nowadays Internet\, almost to the point of being nowadays that ``thin waits'' that used to be identified with the IP protocol not so long ago. Yet HTTP is changing\, with recent proposals such as SPDY\, HTTP2 and QUIC\, that aims at addressing some of the long-standing shortcoming of the HTTP/1 protocol family. In this talk\, we will be exposing ongoing work to assess the impact that HTTP evolution is expected to have on the quality of user experience (QoE)\, based on experiments where we collect feedback (i.e.\, Mean Opinion Scores) from a panel of users on real webpages\, as well as define and automatically collect QoE metrics on the same experiments. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:68@lincs.fr DTSTART;TZID=Europe/Paris:20160203T140000 DTEND;TZID=Europe/Paris:20160203T160000 DTSTAMP:20170313T170937Z URL:https://www.lincs.fr/events/centralized-content-delivery-infrastructur e-exploiting-resource-pools-performance-models-and-asymptotics/ SUMMARY:Centralized Content Delivery Infrastructure Exploiting Resource Pools: Performance Models and Asymptotics DESCRIPTION:We consider a centralized content delivery infrastructure where a large number of storage-intensive files are replicated across several collocated servers. To achieve scalable delays in file downloads under stochastic loads\, we allow multiple servers to work together as a pooled resource to meet individual download requests. In such systems important questions include: How and where to replicate files\; How significant are the gains of resource pooling over policies which use single server per request\; What are the tradeoffs among conflicting metrics such as delays\, reliability and recovery costs\, and power\; How robust is performance to heterogeneity and choice of fairness criterion\; etc.In this talk we provide a simple performance model for large systems towards addressing these basic questions. For large systems where the overall system load is proportional to the number of servers\, we establish scaling laws among delays\, system load\, number of file replicas\, demand heterogeneity\, power\, and network capacity. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:67@lincs.fr DTSTART;TZID=Europe/Paris:20160127T140000 DTEND;TZID=Europe/Paris:20160127T160000 DTSTAMP:20170313T170936Z URL:https://www.lincs.fr/events/model-graft-accurate-scalable-and-flexible -analysis-of-cache-networks/ SUMMARY:Model-Graft: Accurate\, Scalable and Flexible Analysis of Cache Networks DESCRIPTION:Large scale deployments of general cache networks\, such as Content Delivery Networks or Information Centric Networking architectures\, arise new challenges regarding their performance prediction and network planning. Analytical models and MonteCarlo approaches are already available to the scientific community. However\, complex interactions between replacement\, replication\, and routing on arbitrary topologies make these approaches hardly configurable. Additionally\, huge content catalogs and large networks sizes add non trivial scalability problems\, making their solution computationally demanding. We propose a new technique for the performance evaluation of large scale caching systems that intelligently integrates elements of stochastic analysis within a MonteCarlo approach. Our method leverages the intuition that the behavior of realistic networks of caches\, being them LRU or even more complex caches\, can be well represented by means of much simpler Time-To-Live (TTL)- based caches. This TTL can be either set with the guidance of a simple yet accurate stochastic model (e.g.\, the characteristic time of the Che approximation)\, or can be provided as very rough guesses\, that are iteratively corrected by a feedback loop to ensure convergence. Through a thorough validation campaign\, we show that the synergy between modeling and MonteCarlo approaches has noticeable potentials both in accurately predicting steady state performance metrics within 2% accuracy\, while significantly scaling down simulation time and memory requirements of large scale scenarios by to two orders of magnitude. Furthermore\, we demonstrate the flexibility and efficiency of our hybrid approach in simplifying fine-grained analyses of dynamic scenarios. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:69@lincs.fr DTSTART;TZID=Europe/Paris:20160120T140000 DTEND;TZID=Europe/Paris:20160120T160000 DTSTAMP:20211125T121524Z URL:https://www.lincs.fr/events/virtualization-techniques-in-the-design-of -5g-networks/ SUMMARY:Virtualization techniques in the design of 5G networks DESCRIPTION:We describe in this talk the new possibilities offered by virtualization techniques in the design of 5G networks. We precisely introduce a convergent gateway realizing fixed/mobile convergence. Such a functional element is based on modules instantiated on virtual machines (or dockers)\, each module implementing specific tasks for convergence. A convergent gateway can be instantiated by a network operating system (GlobalOS) in charge of managing the network. One important component of GlobalOS is the orchestration of resources. We introduce some algorithms for resource orchestration in the framework of GlobalOS. We finally focus on the specific case of virtualized base band unit (BBU) functions. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:70@lincs.fr DTSTART;TZID=Europe/Paris:20151216T140000 DTEND;TZID=Europe/Paris:20151216T150000 DTSTAMP:20170313T170938Z URL:https://www.lincs.fr/events/dynamic-control-of-stochastic-and-fluid-re source-sharing-systems/ SUMMARY:Dynamic control of stochastic and fluid resource-sharing systems DESCRIPTION:We study the dynamic control of resource-sharing systems that arise in various domains: e.g. inventory management\, healthcare and communication networks. We aim at efficiently allocating the available resources among competing projects according to a certain performance criteria. These type of problems have a stochastic nature and may be very complex to solve. We therefore focus on developing well-performing heuristics. Firstly\, we consider the framework of Restless Bandit Problems\, which is a general class of dynamic stochastic optimization problems. Relaxing the sample-path constraint in the optimization problem enables to define an index-based heuristic for the original constrained model\, the so-called Whittle index policy. We derive a closed-form expression for the Whittle index as a function of the steady-state probabilities for the case in which bandits (projects) evolve in a birth-and-death fashion. This expression requires several technical conditions to be verified\, and in addition\, it can only be computed explicitly in specific cases. In the particular case of a multi-class abandonment queue\, we further prove that the Whittle index policy is asymptotically optimal in the light-traffic and heavy-traffic regimes. Secondly\, we derive heuristics by approximating the stochastic resource-sharing systems with deterministic fluid models. We first formulate a fluid version of the relaxed optimization problem\, and we develop a fluid index policy. The fluid index can always be computed explicitly and hence overcomes the technical issues that arise when calculating the Whittle index. We apply the Whittle index and the fluid index policies to several systems: e.g. power-aware server-farms\, opportunistic scheduling in wireless systems\, and make-to-stock problems with perishable items. We show numerically that both index policies are nearly optimal. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:71@lincs.fr DTSTART;TZID=Europe/Paris:20151202T140000 DTEND;TZID=Europe/Paris:20151202T143000 DTSTAMP:20170313T170938Z URL:https://www.lincs.fr/events/an-overview-of-scheduling-resources-in-a-p ublic-cloud-2/ SUMMARY:Finding dense subgraphs and interesting events in social networks DESCRIPTION:Algorithms for finding dense subgraphs are an important subroutine in many data mining tasks\, in particular\, community and event detection in social networks. Huge amount of data is produced daily by Facebook and Twitter users\, calling for efficient algorithms being able to handle large amount of data evolving over time. In this talk\, we shall present algorithms for efficiently finding dense subgraphs in an evolving graph and discuss some preliminary results on how they can be used for automatically finding interesting events in social networks. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:73@lincs.fr DTSTART;TZID=Europe/Paris:20151125T140000 DTEND;TZID=Europe/Paris:20151125T150000 DTSTAMP:20170313T170939Z URL:https://www.lincs.fr/events/an-overview-of-scheduling-resources-in-a-p ublic-cloud/ SUMMARY:An overview of scheduling resources in a public cloud DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:72@lincs.fr DTSTART;TZID=Europe/Paris:20151118T140000 DTEND;TZID=Europe/Paris:20151118T150000 DTSTAMP:20170313T170939Z URL:https://www.lincs.fr/events/crowdsurf-empowering-transparency-in-the-w eb/ SUMMARY:CrowdSurf: Empowering Transparency in the Web DESCRIPTION:Abstract: Individuals lack proper means to supervise the services they contact and the information they exchange when surfing the web. Thissecurity task has become challenging due to the complexity of the modern web\, of the data delivering technology\, and even to the adoption of encryption\, which\, while improving privacy\, makes in-network services ineffective. The implications are serious\, from a person contacting undesired services or unwillingly exposing private information\, to a company being unable to control the flow of its information to the outside world.To empower transparency and the capability of taking informed choices in the web\, we propose CROWDSURF\, a system for comprehensive and collaborative auditing of data exchanged with Internet services. Similarly to crowdsourced efforts\, we enable users to contribute in building awareness\, supported by the semi-automatic analysis of data offered by a cloud-based system. The result is the creation of âsuggestionsâ that individuals can transform in enforceable ârulesâ to customize their web browsing policy. CROWDSURF provides the core infrastructure to let individuals and enterprises regain visibility and control on their web activity. Preliminary results obtained executing a prototype implementation demonstrate the feasibility and potential of CROWDSURF. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:74@lincs.fr DTSTART;TZID=Europe/Paris:20151028T140000 DTEND;TZID=Europe/Paris:20151028T150000 DTSTAMP:20170313T170939Z URL:https://www.lincs.fr/events/trimming-sparse-random-graphs-bounds-algor ithms-and-experiments/ SUMMARY:Trimming Sparse Random Graphs: Bounds\, Algorithms\, and Experiments DESCRIPTION:\n\n\nAbstract:\nViral spread on large graphs has many real-life applications such asmalware propagation in computer networks and rumor (or misinformation)spread in Twitter-like online social networks. Although viral spreadon large graphs has been intensively analyzed on classical models suchas Susceptible-Infectious-Recovered\, there still exits a deficit ofeffective methods in practice to contain epidemic spread once itpasses a critical threshold. Concretely\, we consider a random edgeweighted graph $G$ on a fixed degree sequence\, where edge weights arei.i.d. non-negative random variables. Given a budget $B>\;0$\, theproblem is to find a subset of edges $E' subset E(G)$ whose sum ofthe edge weights is at most $B$ and the number of nodes in the largestcomponent of the remaining graph $(V(G)\,E(G)setminus E')$ isminimized. We prove bounds on the edge budget: (i) a lower bound on$B$\, necessary to break the original graph $G$ into components of atmost constant size $Theta(1)$\; (ii) an upper bound on $B$\, sufficientsuch that for any choice of removal edges $E'$\, with high probabilitythere exist a component of size linear in the number of nodes$Theta(|V(G)|)$. Our bounds depend on the weight of the maximumspanning forest. We furthermore propose and numerically estimateheuristic-based approaches to decompose $G$. Joint work with Mike Molloy and Guanhua Yan\n\n\nBiography:\nMilan Bradonjic is a researcher at Bell Labs\, Murray Hill\, USA. Priorto that\, he was as a postdoctoral research fellow in the AppliedMathematics and Plasma Physics Group\, and Center for NonlinearStudies\, at Los Alamos National Laboratory. He obtained his Ph.D. atthe University of California\, Los Angeles and Dipl. Eng. at theUniversity of Belgrade. His research focuses on random graph theory\,and the limiting behavior and percolation of random discretestructures.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:172@lincs.fr DTSTART;TZID=Europe/Paris:20151022T110000 DTEND;TZID=Europe/Paris:20151022T120000 DTSTAMP:20170322T161344Z URL:https://www.lincs.fr/events/multi-resource-fairness-objectives-algorit hms-and-performance/ SUMMARY:Multi-Resource Fairness: Objectives\, Algorithms and Performance DESCRIPTION:Presentation of their paper "Multi-Resource Fairness: Objectives\, Algorithms and Performance": http://dl.acm.org/citation.cfm?doid=2745844.2745869 CATEGORIES:SDN NFV WG LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:75@lincs.fr DTSTART;TZID=Europe/Paris:20151014T140000 DTEND;TZID=Europe/Paris:20151014T150000 DTSTAMP:20170313T170940Z URL:https://www.lincs.fr/events/modeling-and-performance-evaluation-of-res ource-allocation-problems-in-tv-white-space-and-nfv-based-networks/ SUMMARY:Modeling and Performance Evaluation of Resource Allocation Problems in TV White Space and NFV-based Networks DESCRIPTION:In this talk\, we focus on the resource allocation problems in communication networks. More specifically\, we will first consider a TV White Space (TVWS) network and introduce a distributed dynamic spectrum management mechanism\, which allows TV bands (unlicensed) devices to choose\, in a dynamic/mobile TVWS scenario\, the available TV channels maximizing their data rates. Then\, in the second part of the talk\, we will present some resource orchestration mechanisms for congestion mitigation in Network Function Virtualization (NFV)-based networks. The congestion mitigation issue will be investigated and modeled using mixed integer-linear programming tools. Finally\, we will conclude the talk by presenting some open problems and the most promising research directions. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:77@lincs.fr DTSTART;TZID=Europe/Paris:20151007T140000 DTEND;TZID=Europe/Paris:20151007T150000 DTSTAMP:20170313T170941Z URL:https://www.lincs.fr/events/optimal-investment-in-social-signals/ SUMMARY:Optimal Investment in Social Signals. DESCRIPTION:\n\n\nAbstract:\nThis study is an attempt to determine how much individuals should invest in communication in a social context. Two simple models of social relationships are considered\, depending on the symmetry or asymmetry of links. In both models\, individuals emit costly signals to advertise their “qualities” as potential friends (e.g. by posting relevant messages). The study shows that costly communication can be a profitable strategy\, and not only for the most successful individuals. It also reveals interesting phenomena\, such as the collective limitation of signaling investment in the high intensity range. These models may be relevant to several aspects of social communication\, in everyday life and on virtual social networks.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:76@lincs.fr DTSTART;TZID=Europe/Paris:20150930T140000 DTEND;TZID=Europe/Paris:20150930T150000 DTSTAMP:20170313T170940Z URL:https://www.lincs.fr/events/tba-4/ SUMMARY:Advanced Demand Response Solutions for Capacity Markets DESCRIPTION:The Internet of Things (IoT) paradigm brings an opportunity for advanced Demand Response (DR) solutions. Indeed\, it enables visibility and control on the various appliances that may consume\, store or generate energy within a home. It has been shown that a centralized control on the appliances of a setof households leads to efficient DR mechanisms\; unfortunately\, such solutions raise privacy and scalability issues. In this talk we propose an IoT-based DR approach that deals with these issues. Specifically\, we propose and analyze a scalable two levels control system where a centralized controller allocates power to each house on one side and\, each household implements an IoTbasedDR local solution on the other side. A limited feedback to the centralized controller allows to enhance the performance with little impact on privacy. The solution is proposed for thegeneral framework of capacity markets. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:78@lincs.fr DTSTART;TZID=Europe/Paris:20150923T140000 DTEND;TZID=Europe/Paris:20150923T150000 DTSTAMP:20170313T170941Z URL:https://www.lincs.fr/events/big-data-integration/ SUMMARY:Big Data Integration DESCRIPTION:\n\n\n\n\n\n\nAbstract:\nThe Big Data era is upon us: data is being generated\, collected and analyzed at an unprecedented scale\, and data-driven decision making is sweeping through all aspects of society. Since the value of data explodes when it can be linked and fused with other data\, addressing the big data integration (BDI) challenge is critical to realizing the promise of Big Data. BDI differs from traditional data integration in many dimensions: (i) the number of data sources\, even for a single domain\, has grown to be in the tens of thousands\, (ii) many of the data sources are very dynamic\, as a huge amount of newly collected data are continuously made available\, (iii) the data sources are extremely heterogeneous in their structure\, with considerable variety even for substantially similar entities\, and (iv) the data sources are of widely differing qualities\, with significant differences in the coverage\, accuracy and timeliness of data provided. This talk explores the progress that has been made by the data integration community in addressing these novel challenges faced by big data integration\, and identifies a range of open problems for the community\n\n\nBiography:\nDivesh Srivastava is the head of Database Research at AT&\;T Labs-Research. He is an ACM fellow\, on the board of trustees of the VLDB Endowment\, the managing editor of the Proceedings of the VLDB Endowment (PVLDB) and an associate editor of the ACM Transactions on Database Systems (TODS). His research interests and publications span a variety of topics in data management.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:80@lincs.fr DTSTART;TZID=Europe/Paris:20150916T140000 DTEND;TZID=Europe/Paris:20150916T150000 DTSTAMP:20220210T124433Z URL:https://www.lincs.fr/events/towards-a-software-defined-network-operati ng-system-for-the-iot/ SUMMARY:Towards a Software-Defined Network Operating System for the IoT DESCRIPTION:\n\n\nAbstract:\nThe heterogeneity characterizing the Internet of Things (IoT) landscape can be addressed by leveraging network operating systems (NOS)s. Current NOS solutions have been developed for traditional infrastructured networks: they do not take the specific features of fundamental IoT components such as wireless sensor and actor networks into account. In this talk an innovative integrated network operating system for the IoT which is obtained as the evolution of theOpen Network Operating System (ONOS) will be presented. This has been appropriately extended to enhance the recently proposed SDN-WISE platform for supporting SDN in wireless sensor networks and let it interact with standard OpenFlow (OF) switches. The proposed integrated system has been prototyped and tested.\n\n\nBiography:\nGiacomo Morabito was born in Messina\, Sicily (Italy) on March 16\, 1972. He received the laurea degree in Electrical Engineering and the PhD inElectrical\, Computer and Telecommunications Engineering from the Istituto di Informatica e Telecomunicazioni\, University of Catania \, Catania (Italy)\, in 1996 and 2000\, respectively. From November 1999 to April 2001\, he was with the Broadband and Wireless Networking Laboratory of the Georgia Institute of Technology as a Research Engineer. Since April 2001 he is with the Dipartimento di Ingegneria Informatica e delle Telecomunicazioni of the University of Catania where he is currently Associate Professor. His research interests focus on analysis and solutions for wireless networks.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:79@lincs.fr DTSTART;TZID=Europe/Paris:20150909T140000 DTEND;TZID=Europe/Paris:20150909T150000 DTSTAMP:20220208T135436Z URL:https://www.lincs.fr/events/least-recently-used-caches-under-the-shotn oise-model/ SUMMARY:Least Recently Used caches under the ShotNoise Model DESCRIPTION:\n\n\nTalk:\nLeast Recently Used caches under the ShotNoise Model\n\n\nAbstract:\nIn this paper we develop an analytical framework\, based on the Che approximationfor the analysis of Least Recently Used (LRU) caches operating under the Shot Noise requests Model (SNM).The SNM was recently proposed to better capture the main characteristics of today Video on Demand (Vod) traffic.In this context\, the Che approximation is derived as the application of a mean field principle to the cache eviction time. We investigate the validity of this approximation through an asymptotic analysisof the cache eviction time. Particularly\, we provide a large deviation principle and a central limit theorem for the cache eviction time\, as the cache size grows large. Furthermore\, we obtain a non-asymptotic analytical upper bound on the error entailed by Che's approximation of the hit probability. This work appeared at IEEE INFOCOM'15\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:81@lincs.fr DTSTART;TZID=Europe/Paris:20150907T090000 DTEND;TZID=Europe/Paris:20150907T180000 DTSTAMP:20170313T170942Z URL:https://www.lincs.fr/events/modeling-optimization-and-control-in-wirel ess-networks/ SUMMARY:Modeling\, optimization and control in wireless networks DESCRIPTION:We are organizing a Seminar on modeling\, optimization and control in wireless networks\, notably 5G\, on September 7\, 2015\, in Telecom ParisTech\, rue Barrault\, Paris 13eme\, Amphi B312. This seminar is a joint action between RT2 and ANR projects Idefix et Netlearn.\n\nThe program includes plenary talks as well as Poster sessions.\n\nConfirmed speakers include\n\nMarceau Coupechoux\, Telecom ParisTech\nSalah-Eddine Elayoubi\, Orange Labs\nXavier Lagrange\, Telecom Bretagne\nOlivier Marcé\, Alcatel-Lucent\nLoutfi Nuaymi\, Telecom Bretagne\nThrasyvoulos Spyropoulos\, Eurecom\nWe are soliciting submissions for Posters\, until September 1\, 2015. Poster proposals can be sent to patrick (dot) loiseau (at) eurecom (dot) fr\n\nAttendance is free of charge but\, for logistic purposes\, we kindly invite prospective attendees to write an email to tijani(dot)chahed(at)telecom-sudparis(dot)eu\n\nWe look forward to seeing you on September 7 in Paris CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:83@lincs.fr DTSTART;TZID=Europe/Paris:20150715T140000 DTEND;TZID=Europe/Paris:20150715T150000 DTSTAMP:20170313T170943Z URL:https://www.lincs.fr/events/learning-to-rank-regret-lower-bounds-and-e fficient-algorithms/ SUMMARY:Learning to Rank: Regret Lower Bounds and Efficient Algorithms DESCRIPTION:Algorithms for learning to rank Web documents\, display ads\, or other types of items constitute a fundamental component of search engines and more generally of online services. In such systems\, when a user makes a request or visits a web page\, an ordered list of items (e.g. documents or ads) is displayed\; the user scans this list in order\, and clicks on the first relevant item if any. When the user clicks on an item\, the reward collected by the system typically decreases with the position of the item in the displayed list. The main challenge in the design of sequential list selection algorithms stems from the fact that the probabilities with which the user clicks on the various items are unknown and need to be learned. We formulate the design of such algorithms as a stochastic bandit optimization problem. This problem differs from the classical bandit framework: (1) the type of feedback received by the system depends on the actual relevance of the various items in the displayed list (if the user clicks on the last item\, we know that none of the previous items in the list are relevant)\; (2) there are inherent correlations between the average relevance of the items (e.g. the user may be interested in a specific topic only). We assume that items are categorized according to their topic and that users are clustered\, so that users of the same cluster are interested in the same topic. We investigate several scenarios depending on the available side-information on the user before selecting the displayed list: (a) we first treat the case where the topic the user is interested in is known when she places a request\; (b) we then study the case where the user cluster is known but the mapping between user clusters and topics is unknown. For both scenarios\, we derive regret lower bounds and devise algorithms that approach these fundamental limits. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:86@lincs.fr DTSTART;TZID=Europe/Paris:20150708T140000 DTEND;TZID=Europe/Paris:20150708T150000 DTSTAMP:20170313T171041Z URL:https://www.lincs.fr/events/being-greedy-is-good-approximating-the-fdm a-capacity/ SUMMARY:Being Greedy is Good : Approximating the FDMA Capacity DESCRIPTION:\n\n\nAbstract:\nWe 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.\n\n\nBiography:\nRahul 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 Communication and Networking\, and recipient of Indian National Science Academy's young scientist award for the year 2013 and Indian National Academy of Engineering's young engineer award for the year 2013.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:82@lincs.fr DTSTART;TZID=Europe/Paris:20150707T140000 DTEND;TZID=Europe/Paris:20150707T150000 DTSTAMP:20170313T170943Z URL:https://www.lincs.fr/events/approximations-for-stochastic-graph-rewrit ing/ SUMMARY:Approximations for stochastic graph rewriting DESCRIPTION:We present a method to compute approximate descriptions of a class of stochastic systems. For the method to apply\, the system must be presented as a Markov chain on a state space consisting in graphs or graph-like objects\, and jumps must be described by transformations which follow a finite set of local rules. The method is a form of static analysis. The output is a system of coupled ordinary differential equations (ODE) which tracks the mean evolution of the number of (typically small) subgraphs. In some cases\, these ODEs form an exact and finite description of these mean numbers. But even when the ODE description is only an approximation\, it can often reveal interesting properties of the original system. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:93@lincs.fr DTSTART;TZID=Europe/Paris:20150701T140000 DTEND;TZID=Europe/Paris:20150701T150000 DTSTAMP:20170313T171044Z URL:https://www.lincs.fr/events/online-network-optimization-with-sdn/ SUMMARY:Online network optimization with SDN DESCRIPTION:\n\n\nAbstract:\nSoftware-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.\n\n\nBiography:\nDr. 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.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:85@lincs.fr DTSTART;TZID=Europe/Paris:20150701T110000 DTEND;TZID=Europe/Paris:20150701T120000 DTSTAMP:20170313T171040Z URL:https://www.lincs.fr/events/new-mac-protocol-multiple-packet-reception -and-smart-wireless/ SUMMARY:New MAC Protocol\, Multiple Packet Reception and Smart Wireless DESCRIPTION: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. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:84@lincs.fr DTSTART;TZID=Europe/Paris:20150625T140000 DTEND;TZID=Europe/Paris:20150625T150000 DTSTAMP:20170313T170944Z URL:https://www.lincs.fr/events/identity-based-network-architecture/ SUMMARY:Identity based network architecture DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:90@lincs.fr DTSTART;TZID=Europe/Paris:20150624T140000 DTEND;TZID=Europe/Paris:20150624T150000 DTSTAMP:20170313T171042Z URL:https://www.lincs.fr/events/posting-behavior-in-social-networks-and-co ntent-active-filtering/ SUMMARY:Posting behavior in Social Networks and Content Active Filtering DESCRIPTION:\n\n\nAbstract:\nIn this talk\, first we describe a model of the posting behavior in Social Networks in topics which have negative externalities\, and the second objective of it is to provide a content active filtering control such that the content diversity increase. By negative externalities\, we mean that when the quantity of posted contents about some topic increases the popularity of posted contents decreases. We introduce a dynamical model to describe the posting behavior of users taking into account these externalities. Our model is based on stochastic approximations and sufficient conditions are provided to ensure its convergence to a unique rest point. We provide a close form of this rest point. Content Active Filtering (CAF) are actions taken by the administrator of the Social Network in order to promote some objectives related to the quantity of contents posted in various topics. As objective of the CAF we shall consider maximizing the diversity of posted contents.\n\n\nBiography:\nAlexandre Reiffers is a third year PHD student at INRIA and LIA. His supervisors are Eitan Altman and Yezekael Hayel. His current research interests include routing games\, bi-level problem and differential games\; all applied to Social Networks and Internet Economics.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:87@lincs.fr DTSTART;TZID=Europe/Paris:20150624T110000 DTEND;TZID=Europe/Paris:20150624T120000 DTSTAMP:20170313T171041Z URL:https://www.lincs.fr/events/rethinking-competitive-ratio-two-case-stud ies/ SUMMARY:Rethinking Competitive-Ratio: Two Case Studies DESCRIPTION:\n\n\nAbstract:\nCompetitive ratio is traditionally defined by asking the question: “How much service can a policy deliver with a fixed amount of resource”. This definition requires applications to adapt to their perceived service. However\, many emerging applications\, such as multimedia and safety-critical applications\, have strict service requirements. In order to accommodate these applications\, we redefine competitive ratio by asking: “How much resource does a policy need to provide a fixed degree of service.” By studying two different applications\, we demonstrate that answering the second question reveals some surprising results.\n\n\nBiography:\nI-Hong Hou is an assistant professor in the ECE Department of the Texas A&\;M University. He received his Ph.D. from the Computer Science Department of the University of Illinois at Urbana-Champaign. His research interests include wireless networks\, wireless sensor networks\, and real-time systems. He received the C.W. Gear Outstanding Graduate Student Award from the University of Illinois at Urbana-Champaign\, and the Silver Prize in the Asian Pacific Mathematics Olympiad.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:97@lincs.fr DTSTART;TZID=Europe/Paris:20150617T140000 DTEND;TZID=Europe/Paris:20150617T150000 DTSTAMP:20170313T171045Z URL:https://www.lincs.fr/events/tba-3/ SUMMARY:Small Cells for 5G: Fundamentals and Recent Theory DESCRIPTION:\n\n\nAbstract:\nWith 4G cellular technologies now beginning to be deployed widely around the world\, the fifth generation (5G) mobile and wireless communication technologies are emerging into research fields. New services\, applications and devices will drive requirements on data rate\, ubiquity of data services\, latency\, cost\, and reliability and further drive data traffic growth. Networks\, services\, and devices will be more heterogeneous and the need to connect billions of devices to the network will emerge. To meet the above challenges\, small cell networks will be crucial to meet the requirements in terms of spectral efficiency and energy efficiency. In this talk\, we will discuss some of our recent work in small cell networks that can potentially help us to meet such challenges.\n\n\nBiography:\nTony Q.S. Quek received the B.E. and M.E. degrees in Electrical and Electronics Engineering from Tokyo Institute of Technology\, Tokyo\, Japan\, respectively. At Massachusetts Institute of Technology (MIT)\, Cambridge\, MA\, he earned the Ph.D. in Electrical Engineering and Computer Science. Currently\, he is an Assistant Professor with the Singapore University of Technology and Design (SUTD). He is also a Scientist with the Institute for Infocomm Research. His current research topics include sensor networks\, heterogeneous networks\, smart grid\, green communications\, wireless security\, big data processing\, compressed sensing\, IoT\, and cognitive radio.Dr. Quek has been actively involved in organizing and chairing sessions\, and has served as a TPC member in a numerous international conferences. He served as the Co-Chair of the Communication Theory Symposium for IEEE ICC in 2015\, the PHY &\; Fundamentals Track for IEEE WCNC in 2015\, the PHY &\; Fundamentals Track for IEEE EuCNC in 2015\, the Communications Track for IEEE ATC in 2015\, and the Communication and Control Theory Symposium for IEEE ICCC in 2015. He is currently an Executive Editorial Committee Member for the IEEE Transactions on Wireless Communications\, an Editor for the IEEE Transactions on Communications and the IEEE Wireless Communications Letters. He was Guest Editor for the IEEE Signal Processing Magazine (Special Issue on Signal Processing for the 5G Revolution) in November 2014 and the IEEE Wireless Communications Magazine (Special Issue on Heterogeneous Cloud Radio Access Networks) in June 2015.Dr. Quek received the 2008 Philip Yeo Prize for Outstanding Achievement in Research\, the IEEE Globecom 2010 Best Paper Award\, the 2011 CAS Fellowship for Young International Scientists\, the 2012 IEEE William R. Bennett Prize\, the IEEE SPAWC 2013 Best Student Paper Award\, and the IEEE WCSP 2014 Best Paper Award.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:88@lincs.fr DTSTART;TZID=Europe/Paris:20150617T110000 DTEND;TZID=Europe/Paris:20150617T120000 DTSTAMP:20170313T171041Z URL:https://www.lincs.fr/events/the-capacity-of-wireless-networks-for-emer ging-applications/ SUMMARY:The Capacity of Wireless Networks for Emerging Applications DESCRIPTION:\n\n\nAbstract:\nFuture wireless traffic is going to be dominated by emerging applications such as VoIP\, video conferencing\, video/audio streaming\, etc. These applications have their unique traffic patterns\, performance metrics\, and service requirements. Traditional network performance metrics\, such as throughput\, delay\, and delay jitter\, can no longer provide a precise characterization for these emerging applications. In this talk\, we discuss two different kinds of emerging applications. We introduce an analytical framework to model these applications and practical characteristics of wireless channels. We derive the capacity regions of wireless networks for serving these applications\, and develop tractable scheduling policies for achieving the capacity regions.\n\n\nBiography:\nI-Hong Hou is an assistant professor in the ECE Department of the Texas A&\;M University. He received his Ph.D. from the Computer Science Department of the University of Illinois at Urbana-Champaign. His research interests include wireless networks\, wireless sensor networks\, and real-time systems. He received the C.W. Gear Outstanding Graduate Student Award from the University of Illinois at Urbana-Champaign\, and the Silver Prize in the Asian Pacific Mathematics Olympiad.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:91@lincs.fr DTSTART;TZID=Europe/Paris:20150610T140000 DTEND;TZID=Europe/Paris:20150610T143000 DTSTAMP:20170313T171043Z URL:https://www.lincs.fr/events/a-novel-spectral-algorithm-for-the-identif ication-of-overlapping-communities/ SUMMARY:A novel spectral algorithm for the identification of overlapping communities DESCRIPTION:Spectral algorithms are popular methods for finding a partition of a network into groups of nodes that are densely connected\, called communities. However\, the structure of many real world networks is better explained by a set of overlapping communities than by a partition. In this talk\, I will present combinatorial spectral clustering (CSC)\, a simple spectral algorithm designed to identify overlapping communities. The algorithm is motivated by a random graph model called stochastic blockmodel with overlap (SBMO)\, under which it is proved to be consistent. Joint work with Thomas Bonald and Marc Lelarge. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:95@lincs.fr DTSTART;TZID=Europe/Paris:20150603T140000 DTEND;TZID=Europe/Paris:20150603T150000 DTSTAMP:20170313T171044Z URL:https://www.lincs.fr/events/tbd-6/ SUMMARY:Timelines Analysis and competition over popularity\, influence and visibility in social networks. DESCRIPTION:The major social networks use timelines to display content that a user receives from those sources that he follows. A content that arrives at a timeline is placed at the top of the list and each other content is pushed down by one step. If the timeline is finite (as in twitter) then this causes the last element in the timeline to be pushed out. Moreover\, the lower the content is on the timeline the smaller its influence is. In this talk we shall first present analysis of the timeline process and of the probability to be visible on the timeline. We shall further describe the influence process of content which takes into account not only the location on the timeline but also aging of content. We shall then study the impact of the burstiness of the arrival of contents on the timeline process. We shall finally introduce game theoretical models to describe the competition over popularity and over visibility of content in the timeline. We shall study two specific game theoretic problems. The first is a timing game: when is it best to send a content. The second is a resource allocation game for optimal control of the flow of content.The work describes ongoing collaborative work with many woauthors: Alexandre Reiffers\, Nahum Shimkin\, Anurag Kumar\, Yezekael Hayel and others. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:89@lincs.fr DTSTART;TZID=Europe/Paris:20150603T100000 DTEND;TZID=Europe/Paris:20150603T110000 DTSTAMP:20170313T171042Z URL:https://www.lincs.fr/events/compressive-sensing-opportunistic-network- coding-and-repetition-mac-for-connected-cars/ SUMMARY:Compressive Sensing\, Opportunistic Network Coding and Repetition MAC for Connected Cars DESCRIPTION:\n\n\nAbstract:\nRecently we are witnessing the emergence of situation-aware vehicles\, equipped with plurality of sensors that can help driver with vehicle control and maneuvering. Cars that can park themselves\, provide lane-departure warning\, and monitor the driver alertness are marketed with affordable prices. The sensing and processing power of cars are increasing\, enabling various safety-enhancing features\, such as blind-spot warning\, adaptive headlights\, adaptive cruise control\, and so on. In this talk\, we will discuss the next steps for autonomous vehicles. In particular\, we will project the path forward by transitioning from autonomous cars to cognitive and intelligent vehicles. Future cars will be enabled with car-to-car and car-to-infrastructure communication capabilities. We will review such enhancement and will focus on two recent research directives that will make future cars intelligent. The two enablers are compressive sensing and network coding. We will show that cooperative compressive sensing can reduce the wireless channel congestion\, which is the main challenge in dense vehicular networks. To discuss the communications aspects of vehicular networks\, we will introduce a repetition-based medium access control method using positive orthogonal codes\, and then propose an opportunistic network-coding scheme to enhance the reliability of communication. We will finally discuss some open research issues.\n\n\nBiography:\nShahrokh Valaee is with the Edward S. Rogers Sr. Department of Electrical and Computer Engineering\, University of Toronto\, where he is a Professor and the Associate Chair for Undergraduate Studies. He is the Founder and the Director of the Wireless and Internet Research Laboratory (WIRLab) at the University of Toronto. Professor Valaee recently served as the TPC Co-Chair of ICT 2015. He was the Track Chair of the IEEE Wireless Communications and Networking Conference (WCNC) 2014\, the TPC Co-Chair and the Local Organization Chair of IEEE Personal Mobile Indoor Radio Communication (PIMRC) Symposium 2011\, and the Co-Chair for Wireless Communications Symposium of IEEE GLOBECOM 2006. From December 2010 to December 2012\, he was the Associate Editor of the IEEE Signal Processing Letters. Currently\, he serves as an Editor of IEEE Transactions on Wireless Communications. Since Feb 2015 he has been an Editor of the Elsevier Journal of Computer and System Science. Professor Valaee is a Fellow of the Engineering Institute of Canada.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:96@lincs.fr DTSTART;TZID=Europe/Paris:20150527T140000 DTEND;TZID=Europe/Paris:20150527T150000 DTSTAMP:20170313T171045Z URL:https://www.lincs.fr/events/tbd-5/ SUMMARY:Learning WiFi Performance DESCRIPTION:Accurate prediction of wireless network performance is important when performing link adaptation or resource allocation. However\, the complexity of interference interactions at MAC and PHY layers\, as well as the vast variety of possible wireless configurations make it notoriously hard to design explicit performance models.In this work\, we advocate an approach of ``learning by observation''\, where we use machine learning techniques to learn implicit performance models\, from a limited number of real-world measurements. While our model does not use information on the WiFi mechanism itself\, our results show that the accuracy of performance prediction is significantly improved as compared to measurement-seeded models based on SINR. To demonstrate that learned models can be useful in practice\, we build a new algorithm that uses such a model as an oracle to jointly allocate spectrum and transmit power. Our algorithm is utility-optimal\, distributed\, and it produces efficient allocations that significantly improve performance and fairness.Joint work with Julien Herzen (EPFL) and Henrik Lundgren (Technicolor) CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:92@lincs.fr DTSTART;TZID=Europe/Paris:20150527T110000 DTEND;TZID=Europe/Paris:20150527T110000 DTSTAMP:20170313T171043Z URL:https://www.lincs.fr/events/sampling-node-pairs-in-large-graphs/ SUMMARY:Sampling Node Pairs in Large Graphs DESCRIPTION:\n\n\nAbstract:\nCharacterizing user pair relationships is important for applications such as friend recommendation and interest targeting in online social networks (OSNs). Due to the large scale nature of such networks\, it is infeasible to enumerate all user pairs and so sampling is necessarily used. In this talk I focus on this problem from two perspectives\, from an OSN service provider with access to the complete network and from a suspicious BBN summer intern with limited access to the network. Characterizing pair relationships poses a great challenge to an OSN provider even when it possesses the complete topology. The reason is that when sampling techniques\, e.g.\, uniform vertex sampling (UVS) are naively applied\, they can introduce large biases\, in particular\, for estimating similarity distribution statistics of user pairs such as network homophily. Estimating statistics of user pairs is more challenging in the absence of the complete topology information\, since an unbiased sampling technique such as UVS is usually not allowed\, and exploring the OSN topology is expensive. To address these challenges\, we present unbiased sampling methods to characterize user pair properties based on UVS and random walks (RWs) respectively. We evaluate our methods to show their accuracy and efficiency. Finally\, we apply our methods to several OSNs and characterize the homophily present in each.\n\n\nBiography:\nDon Towsley holds a B.A. in Physics (1971) and a Ph.D. in Computer Science (1975) from University of Texas. He is currently a Distinguished Professor at the University of Massachusetts in the Department of Computer Science. He has held visiting positions at numerous universities and research labs including University of Paris VI\, IBM Research\, AT&\;T Research\, Microsoft Research\, and INRIA. His research interests include networks and performance evaluation.He currently serves as Co-Editor-in-Chief of the new ACM Transactions on Modeling and Performance Evaluation of Computing Systems (ToMPECS). He served as Editor-in-Chief of the IEEE/ACM Transactions on Networking and as an associate editor of numerous journals. He has served as Program Co-chair of INFOCOM 2009\, Performance’02\, and the joint 1992 ACM SIGMETRICS/Performance Conference as well as General Chair of COMSNETS 2012. He is a member of ACM and IEEE.He has received numerous IEEE and ACM awards including the 2007 IEEE Koji Kobayashi Award and several achievement award. He has also received numerous best paper awards including the IEEE Communications Society 1998 William Bennett Paper Award\, several test of time awards and conference best paper awards. Last\, he has been elected Fellow of both the ACM and IEEE.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:94@lincs.fr DTSTART;TZID=Europe/Paris:20150522T103000 DTEND;TZID=Europe/Paris:20150522T113000 DTSTAMP:20170313T171044Z URL:https://www.lincs.fr/events/the-power-of-online-learning-in-stochastic -network-optimization/ SUMMARY:The Power of Online Learning in Stochastic Network Optimization DESCRIPTION:\n\n\nAbstract:\nWe investigate the power of online learning in stochastic network optimization with unknown system statistics a priori. We are interested in understanding how information and learning can be efficiently incorporated into system control techniques\, and what are the fundamental benefits of doing so. We propose two Online Learning-Aided Control techniques\, OLAC and OLAC2\, that explicitly utilize the past system information in current system control via a learning procedure called dual learning. We prove strong performance guarantees of the proposed algorithms: OLAC and OLAC2 achieve the near-optimal O(epsilon)\, O([log(1/epsilon)^2)]$ utility-delay tradeoff and OLAC2 possesses an $O(epsilon^-2/3)$ convergence time. OLAC and OLAC2 are probably the first algorithms that simultaneously possess explicit near-optimal delay guarantee and sub-linear convergence time. Simulation results also confirm the superior performance of the proposed algorithms in practice. To the best of our knowledge\, our attempt is the first to explicitly incorporate online learning into stochastic network optimization and to demonstrate its power in both theory and practice.\n\n\nBiography:\nDr. Longbo Huang received his Ph.D. from the EE department at the University of Southern California in August 2011. He was then a postdoctoral researcher in the EECS department at UC Berkeley from July 2011 to August 2012. Since then he has been an assistant professor at the Institute for Interdisciplinary Information Sciences (IIIS) at Tsinghua University. Dr. Huang was a visiting scholar at the LIDS lab at MIT in summer 2012 and 2014\, at the EECS department at UC Berkeley in summer 2013\, and at Bell-labs France in April 2013. He was also a visiting professor at the Institute of Network Coding at CUHK in winter 2012. Dr. Huang was selected into China'sYouth 1000-talent program in 2013. Dr. Huang's research interests lie in the areas of stochastic learning and optimization for networked systems\, delay-efficient network control\, mobile networks\, data center networking\, energy management and smart grid.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:98@lincs.fr DTSTART;TZID=Europe/Paris:20150520T140000 DTEND;TZID=Europe/Paris:20150520T150000 DTSTAMP:20170313T171046Z URL:https://www.lincs.fr/events/understanding-online-video-users-a-key-to- the-future-of-the-internet/ SUMMARY:Understanding Online Video Users: A Key to the Future of the Internet DESCRIPTION:\n\n\nOnline video is the killer application of the Internet. It is predicted that more than 85% of the consumer traffic on the Internet will be video-related by 2016. Yet\, the future economic viability of online videos rest squarely on our ability to understand how viewers interact with video content. For instance: (i) If a video fails to start up quickly\, would the viewer abandon (ii) If a video freezes in the middle\, would the viewer watch fewer minutes (iii) If a video fails to load\, is the viewer less likely to return to the same site (iv) if a video plays at higher quality\, will the viewer watch more minutes\, etc.In this talk\, we outline scientific answers to these and other such questions\, establishing a causal link between video performance and viewer behavior. One of the largest such studies\, our work analyzes the video viewing habits of over 65 million viewers who in aggregate watched almost 367 million videos. To go beyond correlation and to establish causality\, we develop a novel technique based on Quasi-Experimental Designs (QEDs). While QEDs are well known in the medical and social sciences\, our work represents its first use in network performance research and is of independent interest. Our work also a played key role in the recent net neutrality debate in assessing the likely impact of a "fast-lane" on the Internet.This talk is of general interest and is accessible to a broad audience\n\n\nRamesh K. Sitaraman is a professor of computer science at the University of Massachusetts at Amherst and is Akamai’s chief consulting scientist. His research focuses on all aspects of Internet-scale distributed systems\, including algorithms\, architectures\, performance\, energy efficiency\, user behavior\, and economics. As a principal architect\, he helped create the Akamai’s distributed delivery networks and was an Akamai Fellow. He is best known for his role in pioneering the first major content delivery networks (CDNs) that currently deliver a significant fraction of the world’s web content\, streaming videos\, and online applications. He received a PhD in Computer Science from Princeton University and a B. Tech from the Indian Institute of Technology\, Madras.\n\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:103@lincs.fr DTSTART;TZID=Europe/Paris:20150415T140000 DTEND;TZID=Europe/Paris:20150415T150000 DTSTAMP:20170313T171200Z URL:https://www.lincs.fr/events/analyzing-interference-static-cellular-coo peration-using-nearest-neighbour-model/ SUMMARY:Analyzing Interference from Static Cellular Cooperation using the Nearest Neighbour Model DESCRIPTION:The problem of base station cooperation has recently been set within the framework of Stochastic Geometry. Existing works consider that a user dynamically chooses the set of stations that cooperate for his/her service. However\, this assumption often does not hold. Cooperation groups could be predefined and static\, with nodes connected by fixed infrastructure. To analyse such a potential network\, in this work we propose a grouping method based on proximity. It is a variation of the so called Nearest Neighbour Model. We restrict ourselves to the simplest case where only singles and pairs of base stations are allowed to be formed. For this\, two new point processes are defined from the dependent thinning of a Poisson Point Process\, one for the singles and one for the pairs. Structural characteristics for the two are provided\, including their density\, Voronoi surface\, nearest neighbour\, empty space and J-function. We further make use of these results to analyse their interference fields and give explicit formulas to their expected value and their Laplace transform. The results constitute a novel toolbox towards the performance evaluation of networks with static cooperation. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:99@lincs.fr DTSTART;TZID=Europe/Paris:20150415T140000 DTEND;TZID=Europe/Paris:20150415T150000 DTSTAMP:20170313T171046Z URL:https://www.lincs.fr/events/a-flow-level-performance-model-for-mobile- networks-carrying-adaptive-streaming-traffic/ SUMMARY:A Flow-Level Performance Model for Mobile Networks Carrying Adaptive Streaming Traffic DESCRIPTION:As the adaptive streaming technology becomes the mainstream solution for online video service and 4G broadband service becomes very accessible\, for mobile service providers\, having a performance model integrating adaptive streaming and elastic traffic becomes a necessity. We aim to build an adaptive streaming model by using flow-dynamics and to examine the streaming performance. Our model takes both the codec limitation and integration of elastic data into account\, which assist the operators to understand the trade-offs among different metrics such as deficit rate\, mean codec rate and mean elastic throughput when different configurations and prioritization factors are chosen. The simulation results obtained with the real statistics of Orange mobile network demonstrated the maximum traffic intensity under certain QoS constraints and its corresponding optimal prioritization factor. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:100@lincs.fr DTSTART;TZID=Europe/Paris:20150408T140000 DTEND;TZID=Europe/Paris:20150408T150000 DTSTAMP:20170313T171047Z URL:https://www.lincs.fr/events/basic-regenerating-codes-for-distributed-s torage-systems/ SUMMARY:BASIC regenerating codes for distributed storage systems DESCRIPTION:Reliability in disk arrays is provisioned by storing the data with redundancy. For example\, in RAID-6\, we protect the data from being lost by introducing parity-check disks\, so that any failure of two disks can be restored. In a large-scale distributed storage system\, disk failures and repairs are common day-to-day event\, and incur excessive amount of traffic for the recovery of failed disks. A class of codes\, called regenerating codes\, was introduced by Dimakis et al. for the purpose of reducing the required repair traffic. Like Reed-Solomon codes\, most of the existing regenerating codes rely on the arithmetic of finite fields. The computational complexity of encoding and decoding may render the system impracticable if the size of the finite field is large. In this talk\, we discuss a construction of regenerating codes called Binary Addition and Shift Implementable Convolutional (BASIC) codes\, in which finite field additions and multiplications are replaced by bit-wise exclusive OR and bit-wise shifting. The advantage of regenerating code is thereby attained with lower computational cost. This is a joint work with Minghua Chen\, Hanxu Hou and Hui Li. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:101@lincs.fr DTSTART;TZID=Europe/Paris:20150401T140000 DTEND;TZID=Europe/Paris:20150401T150000 DTSTAMP:20170313T171047Z URL:https://www.lincs.fr/events/optimal-geographic-caching-in-cellular-net works-2/ SUMMARY:Optimal Geographic Caching in Cellular Networks DESCRIPTION:We consider the problem of an optimal geographic placement of content in wireless cellular networks modelled by Poisson point processes. Specifically\, for the typical user requesting some particular content and whose popularity follows a given law (e.g. Zipf)\, we calculate the probability of finding the content cached in one of the base stations. Wireless coverage follows the usual signal-to-interference-and noise ratio (SINR) model\, or some variants of it. We formulate and solve the problem of an optimal randomized content placement policy\, to maximize the user's hit probability. The result dictates that it is not always optimal to follow the standard policy "cache the most popular content\, everywhere". In fact\, our numerical results regarding three different coverage scenarios\, show that the optimal policy significantly increases the chances of hit under high-coverage regime\, i.e.\, when the probabilities of coverage by more than just one station are high enough. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:104@lincs.fr DTSTART;TZID=Europe/Paris:20150325T140000 DTEND;TZID=Europe/Paris:20150325T150000 DTSTAMP:20170313T171201Z URL:https://www.lincs.fr/events/synchronous-view-loosely-time-triggered-ar chitectures/ SUMMARY:A Synchronous View of Loosely Time-Triggered Architectures DESCRIPTION:\n\n\nAbstract:\nLoosely Time-Triggered Architectures (LTTAs) are a proposal forconstructing distributing embedded control systems. They build onquasi-periodic systems\, where computing units execute almostperiodically\, by adding a thin layer of middleware that facilitatesthe deployment of synchronous applications.In this paper\, we show how the deployment of a synchronous applicationon a quasi-periodic architecture can be modeled using a synchronousformalism. Then we detail two LTTA protocols\, Back-PressureLTTA reminiscent of elastic circuits\, and a new class ofTime-Based LTTA. Finally\, we compare the LTTA approach to clocksynchronization protocols which are becoming more an more commonnowadays. Joint work with Albert Benveniste (INRIA)\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:102@lincs.fr DTSTART;TZID=Europe/Paris:20150318T140000 DTEND;TZID=Europe/Paris:20150318T150000 DTSTAMP:20170313T171048Z URL:https://www.lincs.fr/events/vanet-services-and-mobile-vehicle-clouds/ SUMMARY:VANET Services and Mobile Vehicle Clouds DESCRIPTION:\n\n\nAbstract:\nNew vehicle applications have recently emerged in several areas ranging from navigation safety to location aware content distribution\, urban surveillance and intelligent transport. A new impulse is given by autonomous vehicle with plenty of sensors\, memory and processing power. The richness of on board resources and the diversity of applications sets the Vehicular ad Hoc Network (VANET) apart from conventional MANETs and does introduce new challenges in the services they can provide. A representative service scenario is urban sensing: vehicles monitor the environment\, classify the events\, e.g.\, license plates\, chemical readings etc\, and support forensic service requests from Authorities. This notion of service suggests that the VANET can be viewed as a Mobile Computing Cloud (MCC) where vehicles interact and collaborate to sense the environment\, process the data\, V2V propagate the results and share resources to provide mobile services. This talk will revisit VANET applications and services in light of the Mobile Cloud model. It will then propose a Vehicular Cloud platform and will address the cooperation with Edge Cloud and Internet Cloud.\n\n\nBiography:\nDr. Mario Gerla is a Professor in the Computer Science Dept at UCLA. He holds an Engineering degree from Politecnico di Milano\, Italy and the Ph.D. degree from UCLA. He became IEEE Fellow in 2002. At UCLA\, he was part of the team that developed the early ARPANET protocols under the guidance of Prof. Leonard Kleinrock. He joined the UCLA Faculty in 1976. At UCLA he has designed network protocols including ad hoc wireless clustering\, multicast (ODMRP and CODECast) and Internet transport (TCP Westwood). He has lead the ONR MINUTEMAN project\, designing the next generation scalable airborne Internet for tactical and homeland defense scenarios. He is now leading several advanced wireless network projects under Industry and Government funding. His team is developing a Vehicular Testbed for safe navigation\, content distribution\, urban sensing and intelligent transport. Parallel research activities are wireless medical monitoring using smart phones and cognitive radios in urban environments.He has served as a Technical Program Committee member of many international conferences\, and is active in the organization of conferences and workshops\, including MedHocNet and WONS. He serves on the IEEE TON Scientific Advisory Board. He was recently recognized with the annual MILCOM Technical Contribution Award for 2011 and the IEEE Ad Hoc and Sensor Network Society Achievement Award in 2011.\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:107@lincs.fr DTSTART;TZID=Europe/Paris:20150311T140000 DTEND;TZID=Europe/Paris:20150311T150000 DTSTAMP:20170313T171202Z URL:https://www.lincs.fr/events/game-theoretic-statistics-learning-data-ge nerated-strategic-agents/ SUMMARY:Game-theoretic statistics: Learning from data generated by strategic agents DESCRIPTION:Statistical learning methods developed in the last decades have proved very useful for many applications. However\, most algorithms were developed under the assumption that the data is independent from the algorithm. This is no longer true in applications where data is generated or provided by (human) strategic agents. As more and more modern applications indeed learn from data provided by external parties\, it becomes increasingly crucial to account for the data-provider's incentives in order to design well-performing learning algorithms in practice.In this talk\, we use game theory to model explicitly the economic incentives of the learner and of the agents generating data. We show how\, by analyzing the game\, it is possible to design learning algorithms that work better because they account for the agents' incentives. Specifically\, we illustrate this in two examples with applications in security and privacy: (i) Classification of malicious behavior: In this example\, a defender runs a classification algorithm to detect malicious behavior while an attacker chooses his attack strategy to balance the utility of the attack and the probability of being detected. We obtain analytic results that show how to optimally perform the classification given the attacker's utility. (ii) Linear regression from agents-provided data: In this example\, we study the case of an analyst who tries to infer a model through linear regression from data provided by individuals who add noise to protect their privacy (this technique is called "local privacy"). We again derive results on optimal linear regression and on the price of anarchy of the system that provide methods to better learn from privacy-conscious users by incentivizing them to provide higher-quality data. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:105@lincs.fr DTSTART;TZID=Europe/Paris:20150311T110000 DTEND;TZID=Europe/Paris:20150311T120000 DTSTAMP:20170313T171201Z URL:https://www.lincs.fr/events/design-integrated-forwarding-andcaching-po licies-named-data-networking/ SUMMARY:On the Design of Integrated Forwarding and Caching Policies in Named-Data Networking DESCRIPTION:\n\n\nAbstract:\nCurrent IP-based networks are unable to fully exploit the capabilities ofthe increasing number of multi-homed mobile terminals. We argue thatNamed-Data Networking (NDN) can fill the gap. First\, we elaborate on therequirements for NDN packet forwarding to multi-homed mobile terminalsand categorize forwarding strategies according to their ability to fulfill theserequirements. Further\, we describe the initial design of an advanced multi-path forwarding strategy that is derived from performance insights gainedby a CCNx implementation. Secondly\, we investigate the performance of aLRU cache replacement policy in the related tree structure. We start withthe performance approximation of Che et al. and assume Zipf-distributedfrequencies of object requests that constitute associated Poisson streams.Then we derive new explicit formulae regarding the hit and miss ratios in thiscascade of LRU caches. Considering adaptive or cooperative cache policies insuch an access network with multi-homed mobile clients\, the sketched resultsprovide a basis for an integrated design of efficient forwarding schemes withoptimal cache placement.\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:106@lincs.fr DTSTART;TZID=Europe/Paris:20150304T140000 DTEND;TZID=Europe/Paris:20150304T150000 DTSTAMP:20170313T171202Z URL:https://www.lincs.fr/events/cirrus-cloud-project-opportunistic-mobile- cloud-computing/ SUMMARY:The Cirrus Cloud Project: Opportunistic Mobile Cloud Computing DESCRIPTION:Mobile devices are increasingly being relied on for tasks that go beyond simple connectivity and demand more complex processing. In cases where such processing exceeds a device’s capability\, remote cloud resources can be used to off-load the “heavy lifting” needed by mobile computation tasks. The Cirrus Cloud project focuses on the design and analysis of techniques that enable the provision of cloud computation services to mobile devices. The project is distinguished by 1) its consideration of specific challenges of the wireless and mobile environment and 2) its focus on leveraging the computational capability of a variety of entities present in a mobile device’s environment in an opportunistic manner. In this talk we will first give an overview of the Cirrus Cloud project and its aims. We will then discuss two specific directions of work that represent two points on a spectrum of mobile cloud computing scenarios. In the first we design and evaluate the COSMOS system which enables mobile computation requirements to map seamlessly to traditional cloud computing services. In the second we consider how clusters of mobile devices may be configured as a powerful compute resource. We will conclude with a discussion of our plans for future research.\n\n \;\n\n\n\nBiography:\nMostafa Ammar is a Regents' Professor with the School of Computer Science at the Georgia Institute of Technology. He has been with Georgia Tech since 1985. Dr. Ammar received the S.B. and S.M. degrees from the Massachusetts Institute of Technology in 1978 and 1980\, respectively and the Ph.D. degree from the University of Waterloo\, Ontario\, Canada in 1985. Dr. Ammar's research interests are in network architectures\, protocols and services. He has contributions in the areas of multicast communication and services\, multimedia streaming\, content distribution networks\, network simulation\, disruption-tolerant networks\, virtual network design\, and most recently in mobile cloud computing. He has published extensively in these areas. To date\, 33 PhD students have completed their degrees under his supervision\; many have gone on to distinguished careers in academia and industry. Dr. Ammar has served the research community in multiple roles. Most notably\, he served as the Editor-in-Chief of the IEEE/ACM Transactions on Networking (ToN) from 1999 to 2003\, and he was the co-TPC Chair for the IEEE ICNP 1997\, ACM CoNEXT 2006 and ACM SIGMETRICS 2007 conferences. His awards include the IBM Faculty Partnership Award (1996)\, Best Paper Award at the 7th WWW conference (1998)\, the Georgia Tech Outstanding Doctoral Thesis Advisor Award (2006)\, the Outstanding Service Award from the IEEE Technical Committee on Computer Communications (2010)\, and the ACM Mobihoc Best Paper Award (2012). Dr. Ammar was elected Fellow of the IEEE in 2002 and Fellow of the ACM in 2003.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:108@lincs.fr DTSTART;TZID=Europe/Paris:20150225T140000 DTEND;TZID=Europe/Paris:20150225T150000 DTSTAMP:20170313T171202Z URL:https://www.lincs.fr/events/hitchhikers-guide-ontology/ SUMMARY:A Hitchhiker'\;s guide to ontology DESCRIPTION:In this talk\, I will present our recent work in the area ofknowledge bases. It covers 4 areas of research around ontologies andknowledge bases: The first area is the construction of the YAGOknowledge base. YAGO is now mulitlingual\, and has grown into a largerproject at the Max Planck Institute for Informatics and TélécomParisTech. The second area is the alignment of knowledge bases. Thisincludes the alignment of classes\, instances\, and relations acrossknowledge bases. The third area is rule mining. Our project findssemantic correlations in the form of Horn rules in the knowledge base.I will also talk about watermarking approaches to trace the provenanceof ontological data. Finally\, I will show applications of theknowledge base for mining news corpora. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:109@lincs.fr DTSTART;TZID=Europe/Paris:20150211T143000 DTEND;TZID=Europe/Paris:20150211T150000 DTSTAMP:20170313T171203Z URL:https://www.lincs.fr/events/perfect-sampling-closed-queueing-networks/ SUMMARY:Perfect sampling for closed queueing networks DESCRIPTION:We investigate coupling from the past (CFTP) algorithmsfor closed queueing networks. The stationary distribution has a productform only in a very limited number of particular cases when queue capacityis finite\, and numerical algorithms are intractable due to the cardinalityof the state space. Moreover\, closed networks do not exhibit any mono-tonic property enabling ecient CFTP. We derive a bounding chain forthe CFTP algorithm for closed queueing networks. This bounding chainis based on a compact representation of sets of states that enables exactsampling from the stationary distribution without considering all initialconditions in the CFTP. The coupling time of the bounding chain is al-most surely finite\, and numerical experiments show that it is close to thecoupling time of the exact chain. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:110@lincs.fr DTSTART;TZID=Europe/Paris:20150211T140000 DTEND;TZID=Europe/Paris:20150211T143000 DTSTAMP:20170313T171203Z URL:https://www.lincs.fr/events/exploiting-user-movement-position-detectio n/ SUMMARY:Exploiting User Movement for Position Detection DESCRIPTION:The major issue of indoor localization system is the trade-off between implementation cost and accuracy. A low-cost system which demands only few hardware devices could save the cost but often it turns out to be less reliable. Aiming at improving classical triangulation method that requires several reference points\, this paper proposes a new method\, called Two-Step Movement (2SM)\, which requires only one reference point (RP) by exploiting useful information given by the position change of a mobile terminal (MT)\, or the user movement. This method can minimize the number of reference points required in a localization system or navigation service and reduce system implementation cost. Analytical result shows that the user position can be thus derived and given in simple closed-form expression. Finally\, simulation is conducted to demonstrate its effectiveness under noisy environment. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:111@lincs.fr DTSTART;TZID=Europe/Paris:20150204T153000 DTEND;TZID=Europe/Paris:20150204T163000 DTSTAMP:20170313T171204Z URL:https://www.lincs.fr/events/optimal-content-prefetching-cloud-assisted -content-delivery/ SUMMARY:Optimal content prefetching for cloud assisted content delivery DESCRIPTION:Motivated by improved models for content workload prediction\, in this paper we consider the problem of dynamic content allocation for a hybrid content delivery system that combines cloud-based storage with low cost dedicated servers that have limited storage and unmetered upload bandwidth. We formulate the problem of allocating contents to the dedicated storage as a finite horizon dynamic decision problem\, and show that a discrete time decision problem is a good approximation forpiecewise stationary workloads. We provide an exact solution to the discrete time decision problem in the form of a mixed integer linear programming problem\, propose computationally feasible approximations\, and give bounds on their approximation ratios. Finally\, we evaluate the algorithms using synthetic and measured traces from a commercial music on-demand service and give insight into their performance as a function of the workload characteristics. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:112@lincs.fr DTSTART;TZID=Europe/Paris:20150121T140000 DTEND;TZID=Europe/Paris:20150121T150000 DTSTAMP:20170313T171204Z URL:https://www.lincs.fr/events/new-perspective-distributed-scheduling-wir eless-multihop-networks/ SUMMARY:A New Perspective on Distributed Scheduling in Wireless Multihop Networks DESCRIPTION:One vision for wireless networks has been the creation of wireless multihop networks that are formed and operate in a fully decentralized manner using cheap commodity hardware. One of the main challenges to achieve this vision is the design of scheduling protocols for data transmissions that are throughput and delay optimal\, and can be implemented in a fully distributed manner.In the talk\, we present results that provide a new perspective on the design of distributed scheduling algorithms. In particular\, our results suggest that it is possible to create protocols that throughput and delay order-optimal\, and can be implemented in a fully distributed manner. We will first discuss the intuition behind the performance limitations of traditional distributed scheduling protocols\, and present the main idea behind our approach. We will then provide a more detail discussion of our results as well as future work.An interesting aspect of the work is that the underlying mathematical models and results may be of independent interest and might be applicable to more general combinatorial optimization problem. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:114@lincs.fr DTSTART;TZID=Europe/Paris:20150114T140000 DTEND;TZID=Europe/Paris:20150114T150000 DTSTAMP:20170313T171205Z URL:https://www.lincs.fr/events/platforms-applications-big-fast-data-analy tics/ SUMMARY:Platforms and Applications for "\;Big and Fast"\; Data Analytics DESCRIPTION:Recently there has been a significant interest in building big data systems that can handle not only "big data" but also "fast data" for analytics. Our work is strongly motivated by recent real-world case studies that point to the need for a general\, unified data processing framework to support analytical queries with different latency requirements. Towards this goal\, our project is designed to transform the popular MapReduce computation model\, originally proposed for batch processing\, into distributed (near) real-time processing. In this talk\, I start by examining the widely used Hadoop system and presenting a thorough analysis to understand the causes of high latency in Hadoop. I then present a number of necessary architectural changes\, as well as new resource configuration and optimization techniques to meet user-specified latency requirements while maximizing throughput. Experiments using typical workloads in click stream analysis and twitter feed analysis show that our techniques reduce the latency from tens or hundreds of seconds in Hadoop to sub-second in our system\, with 2x-7x increase in throughput. Our system also outperforms state-of-the-art distributed stream systems\, Twitter Storm and Spark Streaming\, by a wide margin. Finally\, I will show some initial results and challenges of supporting big and fast data analytics in the emerging domain of genomics.\n\nBiography: Yanlei Diao is Associate Professor of Computer Science at the University of Massachusetts Amherst. Her research interests are in information architectures and data management systems\, with a focus on big data analytics\, data streams\, uncertain data management\, and RFID and sensor data management. She received her PhD in Computer Science from the University of California\, Berkeley in 2005\, her M.S. in Computer Science from the Hong Kong University of Science and Technology in 2000\, and her B.S. in Computer Science from Fudan University in 1998. Yanlei Diao was a recipient of the 2013 CRA-W Borg Early Career Award (one female computer scientist selected each year)\, IBM Scalable Innovation Faculty Award\, and NSF Career Award\, and she was a finalist of the Microsoft Research New Faculty Award. She spoke at the Distinguished Faculty Lecture Series at the University of Texas at Austin. Her PhD dissertation "Query Processing for Large-Scale XML Message Brokering" won the 2006 ACM-SIGMOD Dissertation Award Honorable Mention. She is currently Editor-in-Chief of the ACM SIGMOD Record\, Associate Editor of ACM TODS\, Area Chair of SIGMOD 2015\, and member of the SIGMOD Executive Committee and SIGMOD Software Systems Award Committee. In the past\, she has served as Associate Editor of PVLDB\, organizing committee member of SIGMOD\, CIDR\, DMSN\, and the New England Database Summit\, as well as on the program committees of many international conferences and workshops. Her research has been strongly supported by industry with awards from Google\, IBM\, Cisco\, NEC labs\, and the Advanced Cybersecurity Center. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:113@lincs.fr DTSTART;TZID=Europe/Paris:20150107T140000 DTEND;TZID=Europe/Paris:20150107T150000 DTSTAMP:20170313T171205Z URL:https://www.lincs.fr/events/cooperation-lte-emergent-dvb-technologies- efficient-delivery-mobile-tv/ SUMMARY:Cooperation between LTE and emergent DVB technologies for an efficient delivery of mobile TV DESCRIPTION:The broadcast/cellular cooperation for a common delivery of Mobile TV is at the heart of the emerging mobile broadcast technologies\, namely the mobile extension of the second generation digital video broadcasting for terrestrial reception (DVB-T2Lite) and its follower DVB-Next Generation Handheld (DVB-NGH). These broadcasttechnologies aim to cooperate with the Long Term Evolution (LTE)\, as the latter is intended to be the bearer of Mobile TV thanks to its enhanced-Multimedia Broadcastand Multicast Service feature (e-MBMS).Even though the 3GPP/DVB cooperation is not a new topic and was investigate dwith the introduction of the previous DVB technology\, known as DVB-Handheld(DVB-H)\, most of the works addressing this issue considered a common service area covered by both DVB and cellular systems and focused solely on the impact of such cooperation in terms of capacity gains brought by 3GPP and error repair gains brought by DVB. This strategy was judged to be expensive since a new and very dense DVB network was needed. In order to overcome this problem and decrease as much as possible the need for a new broadcast network\, we propose in this thesis a hybrid DVB/LTEnetwork with a coverage extension strategy\, where the LTE system\, planned for almost a universal coverage\, is used to deliver Mobile TV in areas not covered by recent DVB-T2 Lite (or eventually DVB-NGH) network. In this context\, we explore twomain issues:1. Mobile TV services have to share LTE resources with other higher priority services such as voice traffic. The dynamicity of the latter will impact the Quality of Service (QoS) of Mobile TV. We propose a new QoS-based planning1for the hybrid DVB/LTE so as to guarantee an acceptable watching experience without over-dimensioning the LTE system. We derive using Markov chain analysis and hitting time theory\, several QoS metrics pertaining to mobile TV performance\, such as interruption frequency and duration.2. A new business model which clarifies the relationships between the different factors of the ecosystem namely DVB and LTE operators as well as the TVchannel providers and constructs the service area from an economic point of view is needed. In fact\, the absence of a clear and viable economic model that resolves the monetary conflicts between cellular and broadcast operators was one of the main drawbacks behind the failure of the first attempt of mobile TVd elivery by cooperating UMTS/DVB-H. We develop in this thesis a profit sharing strategy for the cooperative network\, using coalition game concept Shapley value and Nash equilibrium for a self-enforcing strategy. We further develop anew framework using real option theory coupled with coalition games for investment decision in mobile TV networks (whether an operator should enter the mobile TV market and\, if yes\, when to do so) and show how operators canin corporate the uncertainties related to demand and network operation costs.We propose a bi-level dynamic programming algorithm to solve numerically the developed real option game. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:115@lincs.fr DTSTART;TZID=Europe/Paris:20141217T140000 DTEND;TZID=Europe/Paris:20141217T150000 DTSTAMP:20170313T171205Z URL:https://www.lincs.fr/events/cloud-2020-emergence-micro-datacenter-mobi le-computing/ SUMMARY:Cloud 2020: The Emergence of Micro Datacenter for Mobile Computing DESCRIPTION:Resource poverty is a fundamental constraint that severely limits the types of applications that can be run on mobile devices. This constraint is not just a temporary limitation of current technology but is intrinsic to mobility. In this talk\, I will put forth a vision of the cloud that breaks free of this fundamental constraint. In this vision\, mobile users seamlessly utilize nearby computers to obtain the resource benefits of cloud computing without incurring WAN delays and jitter. Rather than relying on a distant cloud the client connects and uses a nearby micro datacenter (mDC). Crisp interactive response for immersive applications that augment human cognition are then easier to achieve. While much engineering and research remains\, the concepts and ideas introduced open the door to a new world of disaggregated computing in which seamless cognitive assistance for users can be delivered at any time and any place.\n\nVictor Bahl is a Principal Researcher and the Director of the Mobility &\; Networking Research (MNR) group in Microsoft Research. MNR's mission is to invent &\; research technologies that make Microsoft's networks\, services\, and devices indispensable to the world. In addition to shepherding brilliant researchers\, Victor helps shape Microsoft's long-term vision related to networking technologies by advising the CEO and senior executive team\, and by executing on this vision through research\, technology transfers\, and associated policy engagements with governments and industries around the world. He and his group have had far-reaching impact on the research community\, government policy\, and Microsoft products through numerous significant publications and technology transfers. His personal research spans a variety of topics in mobile &\; cloud computing\, wireless systems &\; services\, and datacenter &\; enterprise networking. Over his career he has built many highly cited seminal systems\, published prolifically in top conferences and journals\, authored 115 patents\, given over three dozen keynote talks\, won numerous prestigious awards and honors including ACM SIGMOBILE's Lifetime Achievement Award and IEEE Outstanding Leadership and Professional Service Award. Victor received his PhD from the University of Massachusetts Amherst in 1997. He is a Fellow of the ACM\, IEEE and AAAS. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:116@lincs.fr DTSTART;TZID=Europe/Paris:20141210T140000 DTEND;TZID=Europe/Paris:20141210T150000 DTSTAMP:20170313T171206Z URL:https://www.lincs.fr/events/case-mobile-phone-content-pre-staging/ SUMMARY:Is there a case for mobile phone content pre-staging DESCRIPTION:\n\n\n\nContent caching is a fundamental building block of the Internet. Caches are widely deployed at network edges to improve performance for end-users\, and to reduce load on web servers and the backbone network. Considering mobile 3G/4G networks\, however\, the bottleneck is at the access link\, where bandwidth is shared among all mobile terminals. Assuch\, per-user capacity cannot grow to cope with the traffic demand. Unfortunately\, caching policies would not reduce the load on the wireless link which would have to carry multiple copies of the same object that is being downloaded by multiple mobile terminals sharing the same access link.In this paper we investigate if it is worth to push the caching paradigm even farther. We hypothesize a system in which mobile terminals implement a local cache\, where popular content can be pushed/pre-staged. This exploits the peculiar broadcast capability of the wireless channels to replicate content "for free" on all terminals\, saving the cost of transmitting multiple copies of those popular objects. Relying on a large data set collected from a European mobile carrier\, we analyse the content popularity characteristics of mobile traffic\, and quantify the benefit that the push-to-mobile system would produce. We found that content pre-staging\, by proactively and periodically broadcasting "bundles" of popular objects to devices\, allows to both greatly i) improve users' performance and ii) reduce up to 20% (40%) the downloaded volume (number of requests) in optimistic scenarios with a bundle of 100 MB. However\, some technical constraints and content characteristics could question the actual gain such system would reach in practice..\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:118@lincs.fr DTSTART;TZID=Europe/Paris:20141210T140000 DTEND;TZID=Europe/Paris:20141210T150000 DTSTAMP:20220208T132622Z URL:https://www.lincs.fr/events/cost-s-https/ SUMMARY:The Cost of the "\;S"\; in HTTPS DESCRIPTION:Increased user concern over security and privacy on the Internet has led towidespread adoption of HTTPS\, the secure version of HTTP. HTTPS authenticatesthe communicating end points and provides confidentiality for the ensuingcommunication. However\, as with any security solution\, it does not come forfree. HTTPS may introduce overhead in terms of infrastructure costs\,communication latency\, data usage\, and energy consumption. Moreover\, given theopaqueness of the encrypted communication\, any in-network value added servicesrequiring visibility into application layer content\, such as caches and virusscanners\, become ineffective.This paper attempts to shed some light on these costs. First\, taking advantageof datasets collected from large ISPs\, we examine the accelerating adoption ofHTTPS over the last three years. Second\, we quantify the direct and indirectcosts of this evolution. Our results show that\, indeed\, security does not comefor free. This work thus aims to stimulate discussion on technologies that canmitigate the costs of HTTPS while still protecting the user's privacy. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:117@lincs.fr DTSTART;TZID=Europe/Paris:20141203T140000 DTEND;TZID=Europe/Paris:20141203T150000 DTSTAMP:20170313T171206Z URL:https://www.lincs.fr/events/evaluating-user-perceived-performance-ftth -access-networks/ SUMMARY:Evaluating user-perceived performance in FTTH access networks DESCRIPTION:We evaluate the performance perceived by end-users connected to a backhaul link that aggregates the traffic of multiple access areas. We model\, at flowlevel\, the way a finite population of users with heterogeneous access rates and traffic demands shares the capacity of thiscommon backhaul link. We then evaluate several practically interesting use cases\, focusing particularly on the performance of users subscribing to recent FTTH offers in which the user access rates are in the same order of magnitude as the backhaul link capacity. We show that\, despite such high access rates\, reasonable performance can be achieved as long as the total offered traffic iswell below the backhaul link capacity. The obtained performance results are used to derive simple dimensioning guidelines. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:119@lincs.fr DTSTART;TZID=Europe/Paris:20141119T140000 DTEND;TZID=Europe/Paris:20141119T150000 DTSTAMP:20170313T171207Z URL:https://www.lincs.fr/events/3259/ SUMMARY:Catalog Dynamics: Impact of Content Publishing and Perishing on the Performance of a LRU Cache DESCRIPTION:\n\n\n:\nThe Internet heavily relies on Content Distribution Networks and transparent caches to cope with the ever-increasing traffic demand of users. Content\, however\, is essentially versatile: once published at a given time\, its popularity vanishes over time. All requests for a given document are then concentrated between the publishing time and an effective perishing time. In this paper\, we propose a new model for the arrival of content requests\, which takes into account the dynamical nature of the content catalog. Based on two large traffic traces collected on the Orange network\, we use the semi-experimental method and determine invariants of the content request process. This allows us to define a simple mathematical model for content requests\; by extending the so-called Che approximation\, we then compute the performance of a LRU cache fed with such a request process\, expressed by its hit ratio. We numerically validate the good accuracy of our model by comparison to trace-based simulation. Joint work with Felipe Olmos\, Alain Simonian and Yannick Carlinet\n\n\n\n \; CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:122@lincs.fr DTSTART;TZID=Europe/Paris:20141112T140000 DTEND;TZID=Europe/Paris:20141112T143000 DTSTAMP:20220210T150326Z URL:https://www.lincs.fr/events/controlling-adaptive-video-streaming-syste ms-one-knob-enough/ SUMMARY:Controlling Adaptive Video Streaming Systems: One Knob is Enough DESCRIPTION:The video part of Internet traffic is booming due to the ever increasing availability of video content from sitessuch as YouTube (video sharing)\, Netflix (movie on demand)\, Livestream(live streaming).Adaptive video streaming systems dynamically change the video contentbitrate and resolution to match thenetwork available bandwidth and user screen resolution.The mainstream approach employed by adaptive streaming systems\, employed byNetflix and Youtube\, is touse two controllers: one is the stream-switching algorithm that selects thevideo level\, the other regulates theplayout buffer length to a set-point.In this talk we show that such an approach is affected by a fundamentaldrawback: the video flows are not able to get thebest possible video quality when competing with TCP flow. We then design anadaptive video streaming system which fixesthis issue by only using one controller. An experimental evaluation showsthe benefits of the proposed control system. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:123@lincs.fr DTSTART;TZID=Europe/Paris:20141105T140000 DTEND;TZID=Europe/Paris:20141105T150000 DTSTAMP:20170313T171219Z URL:https://www.lincs.fr/events/unimodal-bandits-without-smoothness/ SUMMARY:Unimodal Bandits without Smoothness DESCRIPTION:\n\n\n Abstract:\nIn this talk we present new results on the stochastic bandit problems with a continuum set of arms and where the expected reward is a continuous and unimodal function of the arm. Our setting for instance includes the problem considered in (Cope\, 2009) and (Yu\, 2011). No assumption beyond unimodality is made regarding the smoothness and the structure of the expected reward function. Our first result is an impossiblity result: without knowledge of the smoothness of the reward function\, there exists no stochastic equivalent to Kiefer's golden section search (Kiefer\, 1953). Further\, we propose Stochastic Pentachotomy (SP)\, an algorithm for which we derive finite-time regret upper bounds. In particular\, we show that\, for any expected reward function $mu$ that behaves as $mu(x)=mu(x^star)-C|x-x^star|^xi$ locally around its maximizer $x^star$ for some $xi\, C>\;0$\, the SP algorithm is order-optimal\, i.e.\, its regret scales as $O(sqrtTlog(T))$ when the time horizon $T$ grows large. This regret scaling is achieved without the knowledge of $xi$ and $C$. Our algorithm is based on asymptotically optimal sequential statistical tests used to successively prune an interval that contains the best arm with high probability. To our knowledge\, the SP algorithm constitutes the first sequential arm selection rule that achieves a regret scaling as $O(sqrtT)$ up to a logarithmic factor for non-smooth expected reward functions\, as well as for smooth functions with unknown smoothness. This is a joint work with Alexandre Proutière available at : http://arxiv.org/abs/1406.7447\n\n\nBiography:\nBio: Richard Combes received the Engineering degree from Telecom ParisTech (2008)\, the Master's degree in mathematics from university of Paris VII (2009) and the Ph.D. degree in mathematics from university of Paris VI (2012). He was a visiting scientist in INRIA (2012) and a post-doc in KTH (2013). He is currently an Assistant Professor in Supélec. He received the best paper award at CNSM 2011. His current research interests include communication networks\, stochastic systems and their control and machine learning.\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:120@lincs.fr DTSTART;TZID=Europe/Paris:20141029T140000 DTEND;TZID=Europe/Paris:20141029T143000 DTSTAMP:20170313T171208Z URL:https://www.lincs.fr/events/spatial-reuse-large-random-wireless-networ ks/ SUMMARY:On the spatial reuse on large random wireless networks DESCRIPTION:In this work we analyze the estimation of the spatial reuse of a wirelessnetwork equiped witha Medium Access Control (MAC) mechanism based on 802.11's DistributedCoordination Function (DCF). Moreover we assume that the RTS/CTS handshakeis enabled in order to avoid the hidden node problem.Our analysis is based on the definition of Parking Process over a randomgraph (the interference graph of the network) for which only mildassumptions over the distribution of the nodes's degree are assumed. Then alarge graph limit when the number of nodes goes to infinity is proved whichresults in a system of differential equations representing the evolutionof the nodes'degree. From the solution of this system we can calculate thespatial reuse (or equivalently the jamming constant associated to theparking process).Joint work of Paola Bermolen\, Matthieu Jonckheere\, Federico Larroca andPascal Moyal CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:121@lincs.fr DTSTART;TZID=Europe/Paris:20141022T140000 DTEND;TZID=Europe/Paris:20141022T143000 DTSTAMP:20170313T171218Z URL:https://www.lincs.fr/events/tba-2/ SUMMARY:Simplicial homology and wireless networks DESCRIPTION:\n\n\n\nSimplicial complex representation gives a mathematical description ofthe topology of a wireless sensor network\, i.e.\, its connectivity andcoverage. In these networks\, sensors are randomly deployed in bulk inorder to ensure perfect connectivity and coverage. We propose analgorithm to discover which sensors are to be switched off\, withoutmodification of the topology\, in order to reduce energy consumption.Our reduction algorithm can be applied to any type of simplicialcomplex and reaches an optimal solution.In a second part\, we consider a damaged wireless network\, presentingcoverage holes or disconnected components\, wepropose a disaster recovery algorithm repairing the network. Itprovides the list of locations where to put new nodes topatch the coverage holes and mend the disconnected components. Inorder to do this we first consider the simplicial complexrepresentation of the network\, then the algorithm adds supplementarynodes in excessive number\, and afterwards runs the reduction algorithmin order to reach a unimprovable result. We use a determinantal pointprocess for the addition of nodes: the Ginibre point process which hasinherent repulsion between vertices.\n\n\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:125@lincs.fr DTSTART;TZID=Europe/Paris:20141015T140000 DTEND;TZID=Europe/Paris:20141015T150000 DTSTAMP:20170313T171220Z URL:https://www.lincs.fr/events/caesar-content-router-high-speed-forwardin g-content-names/ SUMMARY:Caesar: a content router for high-speed forwarding on content names. DESCRIPTION:Today\, Internet users are mostly interested to consume content\, information and services independently from the servers where these are located.Information Centric Networking (ICN) is a recent networking vein which proposes to enrich the network layer with name-based forwarding\, a novel communication primitive centered around content identifiers rather than their location.Despite several name-based forwarding strategies have been proposed\, few have attempted to build a content router. Our work fills such gap by designing and prototyping Caesar\, a content router for high-speed forwarding on content names.Caesar has several innovative features: (i) a longest prefix matching algorithm that efficiently supports\ncontent names\, (ii) an incremental design which allows for easy integration with existing network equipments\, (iii) support for packet processing offload to graphics processing units (GPUs)\, and (iv) a forwarding engine distributed across multiple line cards. We build Caesar as a small scale router\, and show that it sustains up to 10 Gbps links and over 10 million content prefixes.In addition\, GPU offload further speeds up the forwarding rate by an order of magnitude\, while distributed forwarding augments the amount of content prefixes served linearly with the number of line cards\, with a small penalty in terms of packet processing latency.The full design of a content router also includes a Pending Interest Table and a Content Store. The former is a data-structure used to store pending requests not served yet\, while the latter is a packet-level cache used to temporary store forwarded data to serve future requests.We will discuss current and future work on the integration of Pending Interest Table and Content Store in our content router. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:124@lincs.fr DTSTART;TZID=Europe/Paris:20141008T143000 DTEND;TZID=Europe/Paris:20141008T150000 DTSTAMP:20170313T171220Z URL:https://www.lincs.fr/events/analyzing-cacheable-traffic-isp-access-net works-micro-cdn-applications-via-content-centric-networking/ SUMMARY:Analyzing Cacheable Traffic in ISP Access Networks for Micro CDN Applications via Content-Centric Networking DESCRIPTION:Web content coming from outside the ISP is today skyrocketing\, causing significant additional infrastructure costs to network operators. The reduced marginal revenues left to ISPs\, whose business is almost entirely based on declining flat rate subscriptions\, call for significant innovation within the network infrastructure\, to support new service delivery.In this paper\, we suggest the use of micro CDNs in ISP access and back-haul networks to reduce redundant web traffic within the ISP infrastructure while improving user's QoS.With micro CDN we refer to a content delivery system composed of (i) a high speed caching substrate\, (ii) a content based routing protocol and (iii) a set of data transfer mechanisms made available by content-centric networking.The contribution of this paper is twofold. First\, we extensively analyze more than one month of web traffic via continuous monitoring between the access and back-haul network of Orange in France. Second\, we characterize key properties of monitored traffic\, such as content popularity and request cacheability\, to infer potential traffic reduction enabled by the introduction of micro CDNs.Based on these findings\, we then perform micro CDN dimensioning in terms of memory requirements and provide guidelines on design choices. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:126@lincs.fr DTSTART;TZID=Europe/Paris:20141008T140000 DTEND;TZID=Europe/Paris:20141008T143000 DTSTAMP:20170313T171221Z URL:https://www.lincs.fr/events/droid-adapting-individual-mobility-pays-mo bile-data-offloading/ SUMMARY:DROiD: Adapting to Individual Mobility Pays Off in Mobile Data Offloading DESCRIPTION:Cellular operators count on the potentials of offloading techniques to relieve their overloaded data channels. Beyond standard access point-based offloading strategies\, a promising alternative is to exploit opportunistic direct communication links between mobile devices. Nevertheless\, achieving efficient device-to-device offloading is challenging\, as communication opportunities are\, by nature\, dependent on individual mobility patterns. We propose\, design\, and evaluate DROiD (Derivative Re-injection to Offload Data)\, an original method to finely control the distribution of popular contents throughout a mobile network. The idea is to use the infrastructure resources as seldom as possible. To this end\, DROiD injects copies through the infrastructure only when needed: (i) at the beginning\, in order to trigger the dissemination\, (ii) if the evolution of the opportunistic dissemination is below some expected pace\, and (iii) when the delivery delay is about to expire\, in order to guarantee 100% diffusion. Our strategy is particularly effective in highly dynamic scenarios\, where sudden creation and dissolution of clusters of mobile nodes prevent contents to diffuse properly. We assess the performance of DROiD by simulating a traffic information service on a realistic large-scale vehicular dataset composed of more than 10\,000 nodes.DROiD substantially outperforms other offloading strategies\, saving more than 50% of the infrastructure traffic even in the case of tight delivery delay constraints. DROiD allows terminal-to-terminal offloading of data with very short maximum reception delay\, in the order of minutes\, which is a realistic bound for cellular user acceptance. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:127@lincs.fr DTSTART;TZID=Europe/Paris:20140918T140000 DTEND;TZID=Europe/Paris:20140918T150000 DTSTAMP:20170313T171221Z URL:https://www.lincs.fr/events/maintenance-et-evolution-des-logiciels/ SUMMARY:Maintenance et Evolution des logiciels DESCRIPTION:Rue Barrault\, Amphi Opale CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:128@lincs.fr DTSTART;TZID=Europe/Paris:20140917T140000 DTEND;TZID=Europe/Paris:20140917T150000 DTSTAMP:20170313T171222Z URL:https://www.lincs.fr/events/unified-approach-performanceanalysis-cachi ng-systems/ SUMMARY:A unified approach to the performanceanalysis of caching systems DESCRIPTION:We propose a unified methodology to analyse the performance of caches (both isolated and interconnected)\, byextending and generalizing a decoupling technique originally knownas Che's approximation\, which provides very accurate results at low computational cost.We consider several caching policies\, taking into account the effects of temporal locality. In the case of interconnected caches\, our approach allows us to do better than the Poisson approximation commonly adopted in prior work. Our results\,validated against simulations and trace-driven experiments\, provide interesting insights into the performance of caching systems.\n\nJoint work with Valentina Martina and Michele Garetto\, appeared at IEEE INFOCOM'14 CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:129@lincs.fr DTSTART;TZID=Europe/Paris:20140910T140000 DTEND;TZID=Europe/Paris:20140910T150000 DTSTAMP:20170313T171222Z URL:https://www.lincs.fr/events/energy-management-demand-cloud/ SUMMARY:Energy management of demand in the cloud DESCRIPTION:We formulate optimization problems to study how data centers might modulate their power demands for cost-effective operation taking into account various complexities exhibited by real-world electricity pricing schemes. For computational tractability reasons\, we work with a fluid model for power demands which we imagine can be modulated using two abstract knobs of demand dropping and demand delaying (each with its associated penalties or costs). We consider both stochastically known and completely unknown inputs\, which are likely to capture different data center scenarios. Using empirical evaluation with both real-world and synthetic power demands and real-world prices\, we demonstrate the efficacy of our techniques.\n\nWork in collaboration with B. Urgaonkar\, G. Kesidis\, U. Shanbhag\, Q. Wang\, A. Sivasbramaniam CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:130@lincs.fr DTSTART;TZID=Europe/Paris:20140716T140000 DTEND;TZID=Europe/Paris:20140716T150000 DTSTAMP:20170313T171222Z URL:https://www.lincs.fr/events/semantic-based-iot-service-discovery-mecha nism-dynamic-environments/ SUMMARY:Semantic-based IoT service discovery mechanism for dynamic environments DESCRIPTION:The adoption of Service Oriented Architecture (SOA) and semantic Web technologies in the Internet of Things (IoT) enables to enhance the interoperability of devices by abstracting their capabilities as services and to enrich their descriptions with machine-interpretable semantics. This facilitates the discovery and composition of IoT services. The increasing number of IoT services\, their dynamicity and geographical distribution require mechanisms to enable scalable and efficient discovery. We propose\, in this paper\, a semantic based IoT service discovery system that supports and adapts to the dynamicity of IoT services. The discovery is distributed over a hierarchy of semantic gateways. Within a semantic gateway\, we implement mechanisms to dynamically organize its content over time\, in order to minimize the discovery cost. Results show that our approach enables to maintain a scalable and efficient discoveryand limits the number of updates sent to a neighboring gateway. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:132@lincs.fr DTSTART;TZID=Europe/Paris:20140709T000000 DTEND;TZID=Europe/Paris:20140709T000000 DTSTAMP:20170313T171223Z URL:https://www.lincs.fr/events/tout-ce-que-vous-aimerez-avoir-su-sur-la-5 g-quand-elle-existera-2/ SUMMARY:Tout ce que vous aimerez avoir su sur la 5G quand elle existera DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:131@lincs.fr DTSTART;TZID=Europe/Paris:20140704T150000 DTEND;TZID=Europe/Paris:20140704T160000 DTSTAMP:20170313T171223Z URL:https://www.lincs.fr/events/organic-computing-adaptivity-self-organiza tion-runtime-rue-barrault-room-e200/ SUMMARY:Organic Computing: Adaptivity and Self-organization at Runtime @ rue Barrault room E200 DESCRIPTION:Organic Computing has emerged almost 10 years ago as a challenging vision for future in-formation processing systems\, based on the insight that already in the near future we will be surrounded by large collections of autonomous systems equipped with sensors and actuators to be aware of their environment\, to communicate freely\, and to organize themselves. The presence of networks of intelligent systems in our environment opens fascinating application areas but\, at the same time\, bears the problem of their controllability. Hence\, we have to construct these systems - which we increasingly depend on - as robust\, safe\, flexible\, and trustworthy as possible. In order to achieve these goals\, our technical systems will have to act more independently\, flexibly\, and autonomously\, i.e. they will have to exhibit life-like properties. We call those systems organic. Hence\, an Organic Computing System is a technical system\, which adapts dynamically to the current conditions of its environment. It will be self-organizing\, self-configuring\, self-healing\, self-protecting\, self-explaining\, and context-aware.First steps towards adaptive and self-organizing computer systems have already been undertaken. Adaptivity\, reconfigurability\, emergence of new properties\, and self-organisation are topics in a variety of research projects. From 2005 until 2011 the German Science Foundation (DFG) has funded a priority research program on Organic Computing. It has addressed fundamental challenges in the design of complex computing systems\; its ojective was a deeper understanding of emergent global behaviour in self-organising systems and the design of specific concepts and tools to support the construction of Organic Computing systems for technical applications.This presentation will briefly recapitulate the basic motivation for Organic Computing\, explain key concepts\, and illustrate these concepts with some project examples. We will then look into possible future directions of OC research concentrating on (1) Online optimization and (2) Social Organic Computing.\n\nBiography: Christian Müller-Schloer studied EE at the Technical University of Munich and received the Diploma degree in 1975\, the Ph. D. in semiconductor physics in 1977. In the same year he joined Siemens Corporate Technology where he worked in a variety of research fields\, among them CAD for communication systems\, cryptography\, simulation accelerators and RISC architectures.From 1980 until 1982 he was a member of the Siemens research labs in Princeton\, NJ\, U.S.A. In 1991 he was appointed full professor of computer architecture and operating systems at the University of Hannover. His institute\, later renamed to Institute of Systems Engineering\n\n \; CATEGORIES:Seminars END:VEVENT BEGIN:VEVENT UID:158@lincs.fr DTSTART;TZID=Europe/Paris:20140702T140000 DTEND;TZID=Europe/Paris:20140702T150000 DTSTAMP:20170313T171307Z URL:https://www.lincs.fr/events/tba/ SUMMARY:Approximately Synchronous Distributed Systems DESCRIPTION:Applications hosted within the datacenter often rely on distributed services such as Zookeeper\, Chubby\, and Spanner for fault-tolerant storage\, distributed coordination\, and transaction support.  These systems provide consistency and availability in the presence of limited failures by relying on sophisticated distributed algorithms such as state machine replication.  Unfortunately\, these distributed algorithms are expensive\, accrue additional latency\, suffer from bottlenecks\, and are difficult to optimize.  This state of affairs is due to the fact that distributed systems are traditionally designed independently from the underlying network and supporting protocols\, making worst-case assumptions (e.g.\, complete asynchrony) about its behavior.\n\nWhile this is reasonable for wide-area networks\, many distributed applications are however deployed in datacenters\, where the network is more reliable\, predictable\, and extensible.  Our position is that codesigning networks and distributed systems in order to operate under an "approximately synchronous" execution model can have substantial benefits in datacenter settings.  We will illustrate this using two case studies in this talk: Speculative Paxos -- a distributed coordination service for datacenters that relies on the network to exhibit approximately synchronous behavior in the normal case\, while still remaining correct if the network exhibits weaker properties\, and Optimistic Replicated Two-Phase Commit (OR-2PC) -- a new distributed transaction protocol that uses a new optimistic ordering technique\, based on loosely synchronized clocks in order to improve both throughput and latency. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:133@lincs.fr DTSTART;TZID=Europe/Paris:20140625T150000 DTEND;TZID=Europe/Paris:20140625T160000 DTSTAMP:20170313T171224Z URL:https://www.lincs.fr/events/randomness-everlasting-security-undetectab ility/ SUMMARY:Randomness\, Everlasting Security\, and Undetectability DESCRIPTION:Security and privacy are fundamental concerns in today's world. These concerns have become particularly prominent with Snowden's revelationsof the presence of the NSA in our daily lives. These revelations have shown that traditional cryptographic techniques do not provide as was expected. This has called into question how security and privacy can be provided. In this talk we investigate how randomness in the environment can be used to provide everlasting security and undetectability(privacy) in wireless communications. In the first part of the talk we describe a practical way to harness this randomness to provide and improve the security of wireless communications. We introduce the notion of "dynamic secrets"\, information shared by two parties\, Alice and Bob\, engaged in communication and not available to an adversary\, Eve. The basic idea is to dynamically generate a series of secrets from randomness present in the in wireless environment. These dynamic secrets exhibit interesting security properties and offer a robust alternative to cryptographic security protocols. We present a simple algorithm for generating these secrets and using them to ensure secrecy.In some situations\, Alice and Bob may want not only to secure their communications but to keep it private. In the second part of our talk we focus on the use of randomness to conceal the communications. Here the challenge is for Alice to communicate with Bob without an adversary\, Willie the warden\, ever realizing that the communication is taking place. Specifically\, we establish that Alice can send O(t) bits (and no more) to Bob in time t over a variety of wireless and optical channels. Moreover\, we report experimental results that corroborate the theory. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:134@lincs.fr DTSTART;TZID=Europe/Paris:20140625T140000 DTEND;TZID=Europe/Paris:20140625T150000 DTSTAMP:20170313T171224Z URL:https://www.lincs.fr/events/art-packet-format-design/ SUMMARY:The art of packet format design DESCRIPTION:TBA CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:135@lincs.fr DTSTART;TZID=Europe/Paris:20140619T140000 DTEND;TZID=Europe/Paris:20140619T150000 DTSTAMP:20170313T171225Z URL:https://www.lincs.fr/events/incentive-mechanisms-user-provided-network s/ SUMMARY:Incentive Mechanisms for User-provided Networks DESCRIPTION:The increasing mobile data demand and the proliferation of advanced handheld devices place the user-provided networks (UPNs) at a conspicuous position in next-generation network architectures. There has been growing consensus that UPNs can play a crucial role both in self-organizing and in operator-controlled wireless networks\, as they enable the exploitation of the diverse communication needs and resources of different users. Today\, many innovative startups such as Open Garden\, M-87\, and Karma\, as well as major network operators such as Deutsche Telekom\, Telefonica\, Comcast\, and China Mobile Hong Kong\, propose or even implement such models. However\, in UPNs both the availability and the demand for Internet access rely on user-owned network equipment. Therefore\, the success of this type of networks depends on the participation of users. In this talk\, we analyze the design challenges of incentive mechanisms for encouraging user engagement in user-provided networks. Motivated by recently launched business models\, we focus on mobile UPNs where the energy consumption and data usage costs are critical\, and have a large impact on users' decisions both for requesting and offering UPN services. We outline two novel incentive schemes that have been recently proposed for such UPNs\, and discuss the open issues that must be further addressed.\n\nBiography: George Iosifidis holds an Engineering Degree in Telecommunications (Greek Air Force Academy\, 2000)\, a M.Sc. and a Ph.D. degree in communication networks (University of Thessaly\, 2007 and 2012). Currently\, he is a post-doc researcher at CERTH/ITI and University of Thessaly\, Volos. His research interests lie at the nexus of network optimization and network economics\, with emphasis on spectrum economics\, autonomous networks\, small cell networks\, user-centric networks and mobile data offloading. More information can be found at www.georgeiosifidis.net CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:156@lincs.fr DTSTART;TZID=Europe/Paris:20140507T140000 DTEND;TZID=Europe/Paris:20140507T150000 DTSTAMP:20170313T171307Z URL:https://www.lincs.fr/events/relay-aided-communications-networking-powe r-line-vehicular-system/ SUMMARY:Relay aided Communications Networking for Power Line and Vehicular System DESCRIPTION:We consider a smart grid based power-line communications network (PCN) which serves stations that represent subscriber devices and/or power company employed sensor nodes. The network is managed by a control (gateway) station that is attached to a power line and acts to supervise and control the sharing of the PCN medium by stations attached to the line. The gateway receives periodic updates from the stations\, and collects data flows that are triggered by those stations that become active due to occurrence of exception events.We design and study a cross-layer adaptive-rate networking mechanism that enables active stations to efficiently transport their message flows to the gateway. Our approach is based on the selection of certain stations to act as relay nodes (RNs)\, during certain transmission time phases. A scheduling protocol is derived\, and its parameters optimized\, in a manner that properly regulates transmissions by active stations and by relay nodes\, in aiming to achieve high spatial reuse levels that induce high throughput rates while maintaining low message delays and low nodal energy consumption levels.As a second topic\, we will outline our latest results involving our new Vehicular Backbone Network (VBN) method for the design of a Vehicular Ad hoc Network (VANET). We derive an effective configuration of the network to attain high throughput and low delay performance behavior for multicasting message flows issued by a road side unit. The integration of such operation with cellular and WiFi systems is also invoked.\n\nBiography: Izhak Rubin received the B.Sc. and M.Sc. from the Technion - Israel Institute of Technology\, Haifa\, Israel\, and the Ph.D. degree from Princeton University\, Princeton\, NJ\, all in Electrical Engineering. Since 1970\, he has been on the faculty of the UCLA School of Engineering and Applied Science where he is currently a Distinguished Professor in the Electrical Engineering Department. Dr. Rubin has had extensive research\, publications\, consulting\, and industrial experience in the design and analysis of commercial and military computer communications and telecommunications systems and networks. Such design and analysis projects include network systems employed by the FAA for air traffic control\, terrestrial and satellite based mobile wireless networks\, high speed multimedia telecommunications networks\, advanced cellular cross-layer operations\, mobile backbone ad hoc wireless networks\, mechanisms to assure network resiliency and automatic failover operations. At UCLA\, he is leading a research group in the areas of telecommunications and computer communications networks. He serves as co-director of the UCLA Public Safety Network Systems Laboratory.During 1979-1980\, he served as Acting Chief Scientist of the Xerox Telecommunications Network. He served as co-chairman of the 1981 IEEE International Symposium on Information Theory\; as program chairman of the 1984 NSF-UCLA workshop on Personal Communications\; as program chairman for the 1987 IEEE INFOCOM conference\; and as program co-chair of the IEEE 1993 workshop on Local and Metropolitan Area networks\, as program co-chair of the 2002 first UCLA/ONR Symposium on Autonomous Intelligent Networked Systems (AINS)\, and has organized many other conferences and workshops. He has served as an editor of the IEEE Transactions on Communications\, Wireless Networks journal\, Optical Networks magazine\, IEEE JSAC issue on MAC techniques\, Communications Systems journal\, Photonic Networks Communications journal\, and has contributed chapters to texts and encyclopedia on telecommunications systems and networks. Dr. Rubin is a Life Fellow of IEEE. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:136@lincs.fr DTSTART;TZID=Europe/Paris:20140617T103000 DTEND;TZID=Europe/Paris:20140617T114500 DTSTAMP:20170313T171225Z URL:https://www.lincs.fr/events/modelling-system-behaviour-subject-changin g-conditions/ SUMMARY:Modelling system behaviour subject to changing conditions DESCRIPTION:Quantitative evaluation plays a key role in the design of a broad range of systems\, where functional and non-functional properties have to be carefully analysed in order to meet the requirements. In this talk\, an analytical framework that enables the study of a class of phenomena where different working conditions alternate by changing the stochastic behaviour of the observed system but still preserving the continuity of the quantities to investigate is presented. The proposed solution technique is based on phase type distributions and on an ad-hoc fitting algorithm.\nIt allows to derive important metrics able to characterize the transient behaviour of the system and it is shown the impact of such a feature on the evaluated metrics with respect more simplistic (and classical) assumptions. On the other hand\, the solution technique allows to extend the semantic of some modelling formalism\, such as Petri nets\, to represent new timing classes. Different cross-domain examples are provided to show the usefulness and wide applicability of the framework.\n\n \;\n\nhttp://mdslab.unime.it/specialvispeople.php?id=7 CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:155@lincs.fr DTSTART;TZID=Europe/Paris:20140514T140000 DTEND;TZID=Europe/Paris:20140514T150000 DTSTAMP:20170313T171307Z URL:https://www.lincs.fr/events/application-queuing-theory-traffic-enginee ring/ SUMMARY:Application of queuing theory to traffic engineering DESCRIPTION:Traffic engineering refers to the set of techniques used to dimension links and route traffic in IP networks. It relies most often on simplistic traffic models where packets arrive according to a Poisson process at each router\, independently of the experienced delays and losses. In this talk\, we revisit traffic engineering methods in the light of more realistic traffic models where data transfers are viewed as fluid flows sharing links in an elastic way\, mimicking the congestion control algorithms of TCP. The corresponding queuing system is no longer a set of independent FIFO queues but a set of coupled processor-sharing queues. We show that minimizing the mean delay in this system tends to balance load more equally in the network. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:153@lincs.fr DTSTART;TZID=Europe/Paris:20140408T100000 DTEND;TZID=Europe/Paris:20140408T110000 DTSTAMP:20170313T171308Z URL:https://www.lincs.fr/events/towards-detecting-influential-individuals- social-networks/ SUMMARY:Towards Detecting Influential Individuals in Social Networks DESCRIPTION:I discuss the problem of detecting influential individuals in social networks. Viral marketing campaigns seek to recruit a small number of influential individuals who are able to cover the largest target audience. Most of the literature assumes the network is known\, but usually there is no information about the topology. I present models where topology is usually unknown at first\, but gradually it is discovered thanks to the local information provided by the recruited members. I show preliminary results (simulations) obtained by the analysis of algorithms based on different levels of local information. (Joint work with Alonso Silva)\n\nBio: Patricio Reyes holds a B.Sc. in Mathematics (2000) and a M.Sc. in Mathematical Engineering (2003) from the University of Chile. He got his Ph.D. in Computer Science (2009) working at the French National Institute for Research in Computer Science and  Control\, INRIA. He has worked as an associate researcher at CMM\, the  Chilean Centre for Mathematical Modelling (research unit of CNRS\, France) and the Mine Planning Lab at the University of Chile. At present\, he is a postdoctoral visitor in the Department of Statistics at Universidad Carlos III de Madrid since 2012. His main research interests are: social network analysis\; data-gathering  algorithms in networks\; routing &\; scheduling in wireless mesh networks\; mine planning. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:154@lincs.fr DTSTART;TZID=Europe/Paris:20140410T150000 DTEND;TZID=Europe/Paris:20140410T160000 DTSTAMP:20170313T171308Z URL:https://www.lincs.fr/events/shannon-infinity/ SUMMARY:From Shannon to Infinity DESCRIPTION:Abstract: TBA\nBiography: Janos Korner has been a Professor in Computer Science at "Sapienza" University of Rome since 1993. He obtained his Degree in Mathematics in 1970. From 1970 to 1992 he worked at the Mathematical Institute of the Hungarian Academy of Sciences. During these years he had two periods of leave: from 1981 to 1983 working at Bell Laboratories\, Murray Hill\, NJ\, and for the academic year 1987-88 working at ENST\, Paris\, France. He is an Associate Editor of IEEE Trans. Information Theory. In 2010 he was elected to the Hungarian Academy of Sciences as an External Member. He received the Claude Shannon Award of the IEEE Information Theory Society for 2014. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:137@lincs.fr DTSTART;TZID=Europe/Paris:20140606T140000 DTEND;TZID=Europe/Paris:20140606T144500 DTSTAMP:20170313T171225Z URL:https://www.lincs.fr/events/invited-talk-sc-4-gossip-voting/ SUMMARY:Invited talk from the SC-4 A From Gossip to Voting DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:140@lincs.fr DTSTART;TZID=Europe/Paris:20140606T113000 DTEND;TZID=Europe/Paris:20140606T121500 DTSTAMP:20170313T171240Z URL:https://www.lincs.fr/events/talks-lincs-5-short-presentations-papers-r epresentative-phds-research-work/ SUMMARY:Short presentations of papers representative of PhDs’ research work DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:138@lincs.fr DTSTART;TZID=Europe/Paris:20140606T113000 DTEND;TZID=Europe/Paris:20140606T121500 DTSTAMP:20170313T171239Z URL:https://www.lincs.fr/events/short-presentations-papers-representative- phds-research-work/ SUMMARY:Short presentations of papers representative of PhDs’ research work DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:139@lincs.fr DTSTART;TZID=Europe/Paris:20140606T113000 DTEND;TZID=Europe/Paris:20140606T121500 DTSTAMP:20170313T171240Z URL:https://www.lincs.fr/events/talks-lincs-5-short-presentations-papers-r epresentative-phds-research-work-2/ SUMMARY:Short presentations of papers representative of PhDs’ research work DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:141@lincs.fr DTSTART;TZID=Europe/Paris:20140606T104500 DTEND;TZID=Europe/Paris:20140606T113000 DTSTAMP:20170313T171241Z URL:https://www.lincs.fr/events/passive-content-curation-based-http-logs/ SUMMARY:Passive Content Curation Based on HTTP Logs DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:142@lincs.fr DTSTART;TZID=Europe/Paris:20140606T104500 DTEND;TZID=Europe/Paris:20140606T113000 DTSTAMP:20170313T171241Z URL:https://www.lincs.fr/events/network-database/ SUMMARY:The Network is a Database DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:143@lincs.fr DTSTART;TZID=Europe/Paris:20140606T104500 DTEND;TZID=Europe/Paris:20140606T113000 DTSTAMP:20170313T171241Z URL:https://www.lincs.fr/events/talk-lincs-4-3-short-talks-new-covered-top ics-enhanced-cluster-computing-performance-proportional-fairness/ SUMMARY:Talk from LINCS -4 (3 short talks on new covered topics) Enhanced Cluster Computing Performance through Proportional Fairness DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:144@lincs.fr DTSTART;TZID=Europe/Paris:20140606T093000 DTEND;TZID=Europe/Paris:20140606T101500 DTSTAMP:20170313T171242Z URL:https://www.lincs.fr/events/invited-talk-sc-3-overcoming-challenges-ne twork-technology-adoption/ SUMMARY:Invited talk from the SC-3 Overcoming the Challenges of Network Technology Adoption DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:145@lincs.fr DTSTART;TZID=Europe/Paris:20140605T173000 DTEND;TZID=Europe/Paris:20140605T183000 DTSTAMP:20170313T171242Z URL:https://www.lincs.fr/events/overview-recent-results-network-theory-foc us-dense-wireless-network-modeling-analysis/ SUMMARY:An overview of recent results on network theory\, with a focus on dense wireless network modeling and analysis DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:146@lincs.fr DTSTART;TZID=Europe/Paris:20140605T163000 DTEND;TZID=Europe/Paris:20140605T173000 DTSTAMP:20170313T171243Z URL:https://www.lincs.fr/events/industry-panel-trends-ict-role-research/ SUMMARY:Industry Panel: Trends in ICT and the role of research DESCRIPTION:Israel Cidon – Sookasa\, Vania Conan – Thales\, Dohy Hong – Samsung\, Robert Plana – Alstom\, Krishan Subnani – Alcatel-Lucent\, Dirk Trossen - Interdigital\, Claire Waast-Richard – EDF. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:147@lincs.fr DTSTART;TZID=Europe/Paris:20140605T121500 DTEND;TZID=Europe/Paris:20140605T123000 DTSTAMP:20170313T171243Z URL:https://www.lincs.fr/events/lingering-issues-distributed-scheduling/ SUMMARY:Lingering issues in distributed scheduling DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:148@lincs.fr DTSTART;TZID=Europe/Paris:20140605T120000 DTEND;TZID=Europe/Paris:20140605T121500 DTSTAMP:20170313T171243Z URL:https://www.lincs.fr/events/ndn-support-advanced-applications-vehicula r-networks/ SUMMARY:NDN for the support of advanced applications in vehicular Networks DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:149@lincs.fr DTSTART;TZID=Europe/Paris:20140423T140000 DTEND;TZID=Europe/Paris:20140423T150000 DTSTAMP:20170313T171309Z URL:https://www.lincs.fr/events/thoughts-locid-separation/ SUMMARY:Some Thoughts on Loc/ID Separation DESCRIPTION:Locator(Loc)/identifier(ID) Separation(LIS) was conceived to mitigate the explosion of the DFZ routing table. To be literally exact\, every host would be given a Loc in addition to an ID. The talk asserts that provision of Locs in this fashion does not help combat the problem at all\; it would only inherit the same fate with the current IP address.What would really help would be use of two-tier Locs\, with one set local to a site and another globally relevant. That is to day\, use of local addressing(Loc) would be the only exit. Some LIS proposals like ILNP and LISP achieve this by their own tricky definition of Locs. The talk asserts what they really implement is adoption of local addressing\, rather than LIS.In LISP\, EID(endpoint ID) is also used for routing within a site\, thus is semantically overloaded in the same way as IP address is. This also implies semantic overloading isn't the real problem from the start\, thus there'd be no rationale for LIS. Semantic overloading (for both identification and location) of an address is rather an intrinsic nature of networking. What people really need is local addressing.If time permits\, the talk also would suggest use of ISIS to make the best use of EID in LISP.\n\nBiography: DY is a professor of CNU(Chungnam National University) in South Corea\, in the department of Information Communications Engineering\, since 1983. He got a bachelor degree from SNU(Seoul National University) and a MS and a PhD degree\, both from KAIST(Korea Advanced Institute of Science and Technology)\, before joining CNU. He's been working on various fields of networking\, with recent focus on Future Internet. He's also been active in standardization and REN(research and educational networking) activities\, and is current Chair of ISO/IEC JTC 1/SC 6\, where OSI once was made\, and Chair of APAN(Asia-Pacific Advanced Network)\, a non-profit consortium similar to Internet 2 (US) and Terena (EU). CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:150@lincs.fr DTSTART;TZID=Europe/Paris:20140430T140000 DTEND;TZID=Europe/Paris:20140430T150000 DTSTAMP:20170313T171308Z URL:https://www.lincs.fr/events/tandem-jackson-networks-asymmetric-inclusi on-processes-catalan-numbers/ SUMMARY:Tandem Jackson Networks\, Asymmetric Inclusion Processes and Catalan Numbers DESCRIPTION:The Tandem Jackson Networkis a system of n sites (queues)in series\, where single particles (customers\, jobs\, packets\, etc.) move\, one by one anduni-directionally\,from one site to the next until they leave the system. (Think\, for example\, on aproduction line\, or on a line in a cafeteria).When each site is a M/M/1 queue\, the Tandem Jackson Network is famous for its product-form solution of the multi-dimensional Probability Generating Function of the site occupancies. In contrast\, the Asymmetric Inclusion Process (ASIP) is a series of n Markovian queues (sites)\, each with unbounded capacity\, but with unlimited-size batch service. That is\, when service is completed at site k\, all particles present there move simultaneously to sitek+1\,and form a cluster with the particles present in the latter site. We analyze the ASIP and show that its multi-dimensional Probability Generating Function(PGF) does notposses a product-form solution. We then present a method to calculate this PGF. We further show that homogeneous systems are optimal and derive limit laws (when the number of sites becomes large) for various variables (e.g. busy period\, draining time\, etc.). Considering the occupancies of the sites (queue sizes) we show that occupation probabilities in the ASIP obey a discrete two-dimensional boundary value problem. Solving this problem we find explicit expressions for the probability that site k is occupied by m particles (m=0\,1\,2\,..).Catalan's numbersare shown to naturally arise in the context of these occupation probabilities. This is a joint work with ShlomiReuveni and Iddo Eiazar. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:151@lincs.fr DTSTART;TZID=Europe/Paris:20140605T093000 DTEND;TZID=Europe/Paris:20140605T101500 DTSTAMP:20220208T133215Z URL:https://www.lincs.fr/events/invited-talk-sc-1-evaluating-mobility-next -generation-network-architectures/ SUMMARY:Invited talk from SC-1 Evaluating Mobility in Next-generation Network Architectures DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:152@lincs.fr DTSTART;TZID=Europe/Paris:20140409T140000 DTEND;TZID=Europe/Paris:20140409T150000 DTSTAMP:20170313T171308Z URL:https://www.lincs.fr/events/case-reliable-software-transactional-netwo rking/ SUMMARY:The Case for Reliable Software Transactional Networking DESCRIPTION:Software-defined networking (SDN) is a novel paradigm that outsources the control of packet-forwarding switches to a set of software controllers. The most fundamental task of these controllers is the correct implementation of the network policy\, i.e.\, the intended network behavior. In essence\, such a policy specifies the rules by which packets must be forwarded across the network. We initiate the study of the SDN control plane as a distributed system.We introduce a formal model describing the interaction between the data plane and a distributed control plane (consisting of a collection of fault-prone controllers). Then we formulate the problem of consistent composition of concurrent network policy updates. The composition is enabled via a transactional interface with all-or-nothing semantics\, which allows us to reason about possibilities and impossibilities in controller synchronization. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:157@lincs.fr DTSTART;TZID=Europe/Paris:20140605T084500 DTEND;TZID=Europe/Paris:20140606T193000 DTSTAMP:20170313T171306Z URL:https://www.lincs.fr/events/2014-lincs-workshop/ SUMMARY:2014 LINCS Workshop DESCRIPTION:Workshop LINCS - agenda 2014-2\n\nWorkshop\nLINCS and its Scientific Committee\nJune 5th and 6th\, 2014\nLINCS - 23 avenue d’Italie\, 4th floor – 75013 Paris\n\nAgenda\nJune 5th\nWelcome 8:45 / 09:00\n\nPresentation of the LINCS – summary of recent achievements Prof. Daniel Kofman 9:00 / 09:30\nInvited talk from SC-1 Evaluating Mobility in Next-generation Network\nArchitectures\, Prof. Jim Kurose\, University of Massachusetts 9:30 / 10:15\nTalk from LINCS – 1: An overview of recent results on Information-centric networking with a focus on traffic control and caching\, Luca Muscariello/Diego Perino/Dario Rossi 10:15 / 10:45\n\nCoffee break 10:45 / 11:15\n\nInvited talk from the SC-2 The Road for Enabling Consumer Cloud Services at the Enterprise - Prof. Israel Cidon\, Technion 11:15 / 12:00\nTalks from LINCS – 2 (2 short talks on new covered topics)\nNDN for the support of advanced applications in vehicular Networks\, Dr Giovanni Pau\nLingering issuesin distributed scheduling\, Florian Simatos 12:00 / 12:30\n\nLunch 12:30 / 14:00\n\nPoster Session by PhD students 14:00 / 16:00\n\nCoffee break 16:00 / 16:30\n\nIndustry Panel: Trends in ICT and the role of research\nIsrael Cidon – Sookasa\, Vania Conan – Thales\, Dohy Hong – Samsung\, Robert Plana – Alstom\, Krishan Sabnani – Alcatel-Lucent\, Dirk Trossen - Interdigital\, Claire Waast-Richard – EDF. 16:30 / 17:30\nTalk from LINCS -3\nAn overview of recent results on network theory\, with a focus on dense wireless network modeling and analysis - Marc Lelarge 17:30 / 18:00\n\nSocial Event (Diner) 19:30 / 22:00\n\n \;\n\n \;\n\nJune 6th\nWelcome 09:00/ 09:30\n\nInvited talk from the SC-3 Overcoming the Challenges of Network Technology Adoption\, Prof. Roch Guerin\, Washington University Saint-Louis 09:30 / 10:15\n\nCoffee break 10:15 / 10:45\n\nTalk from LINCS -4 (3 short talks on new covered topics)\nEnhanced Cluster Computing Performance through Proportional Fairness\, Jim Roberts\nThe Network is a Database\, Jordan Augé/Marc-Olivier Buob\nPassive Content Curation Based on HTTP Logs\, Zied Ben-Houidi 10:45 / 11:30\nTalk from LINCS 5 – Awarded PhD paper 11:30 / 12:00\n\nLunch 12:00 / 14:00\n\nInvited talk from the SC-4 A From Gossip to Voting – Prof. Patrick Thiran\, EPFL 14:00 / 14:45\n\nDiscussions:\n- graduate students’ experience at LINCS\n- graduate students’ exchange with the Scientific Committee 14:45 / 15:15\nCoffee break 15:15 / 15:45\n\nIn parallel:\n- Meeting of the Scientific Committee\n- Poster session (to continue the discussion on the posters presented on June 5th) 16:00 / 17:30\nThe view of the Scientific Committee 17:30 / 18:00\n\nConclusion and End of event 18:00 / 18:15\nWrap-up\n- Scientific Committee and Executive Committee 18:15 / 19:15\n\n \; CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:291@lincs.fr DTSTART;TZID=Europe/Paris:20140402T140000 DTEND;TZID=Europe/Paris:20140402T150000 DTSTAMP:20170328T135947Z URL:https://www.lincs.fr/events/characterizing-bufferbloat-end-hosts/ SUMMARY:Characterizing bufferbloat from end-hosts DESCRIPTION:While\, on routers and gateways\, buffers on forwarding devices are required to handle bursty Internet traffic\, overly large or badly sized buffers can interact with TCP in undesirable ways. This phenomenon is well understood and is often called bufferbloat. Although a number of previous studies have shown that buffering (particularly\, in home) can delay packets by as much as a few seconds in the worst case\, there is less empirical evidence of tangible impacts on end-users. In this paper\, we develop a modified algorithm that can detect bufferbloat at individual end-hosts based on passive observations of traffic. We then apply this algorithm on packet traces collected at 55 end- hosts\, and across different network environments. Our results show that 45 out of the 55 users we study experience bufferbloat at least once\, 40% of these users experience bufferbloat more than once per hour. In 90% of cases\, buffering more than doubles RTTs\, but RTTs during bufferbloat are rarely over one second. We also show that web and interactive applications\, which are particularly sensitive to delay\, are the applications most often affected by bufferbloat. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:292@lincs.fr DTSTART;TZID=Europe/Paris:20140402T140000 DTEND;TZID=Europe/Paris:20140402T150000 DTSTAMP:20170328T140005Z URL:https://www.lincs.fr/events/gold-mining-river-internet-content-traffic / SUMMARY:Gold mining in a River of Internet Content Traffic DESCRIPTION:With the advent of Over-The-Top content providers(OTTs)\, Internet Service Providers (ISPs) saw their portfolio of services shrink to the low margin role of data transporters. In order to counter this effect\, some ISPs started to follow big OTTslike Facebook and Google in trying to turn their data into avaluable asset. In this paper\, we explore the questions of whatmeaningful information can be extracted from network data\, andwhat interesting insights it can provide. To this end\, we tacklethe first challenge of detecting user-URLs\, i.e.\, those links thatwere clicked by users as opposed to those objects automaticallydownloaded by browsers and applications. We devise algorithmsto pinpoint such URLs\, and validate them on manually collected ground truth traces. We then apply them on a three-day long traffic trace spanning more than 19\,000 residential users that generated around 190 million HTTP transactions. We find that only 1.6% of these observed URLs were actually clicked by users. As a first application for our methods\, we answer the questionof which platforms participate most in promoting the Internetcontent. Surprisingly\, we find that\, despite its notoriety\, only 11%of the user URL visits are coming from Google Search. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:290@lincs.fr DTSTART;TZID=Europe/Paris:20140326T140000 DTEND;TZID=Europe/Paris:20140326T150000 DTSTAMP:20170328T135938Z URL:https://www.lincs.fr/events/making-mobile-access-networks-green-resear ch-standardization/ SUMMARY:Making mobile access networks green: from research to standardization DESCRIPTION:Energy efficiency in mobile networks is gaining in importance from both environmental and business points of view. In particular\, site sleep mode techniques are being introduced along with self organizing procedures that enable a dynamic activation/deactivation of sites without compromising Quality of Service (QoS). As the research is progressively broadening towards increased energy efficiency\, green concepts are being introduced in standardization. For instance\, 3GPP and ETSI are introducing energy efficiency enablers within their mobile networks standards. This talk gives an overview on the latest theoretical advances in optimal control for energy efficiency in mobile networks and the related standardization activities. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:289@lincs.fr DTSTART;TZID=Europe/Paris:20140320T140000 DTEND;TZID=Europe/Paris:20140320T150000 DTSTAMP:20170328T135920Z URL:https://www.lincs.fr/events/opportunistic-channel-selection-cognitive- radios-imperfect-observations-limited-memory-repeated-game-model/ SUMMARY:Opportunistic Channel Selection by Cognitive Radios Under Imperfect Observations and Limited Memory: A Repeated Game Model DESCRIPTION:To help mitigate the critical stress on spectrum resources spurred by the more powerful and the more capable smart devices\, a recent presidential advisory committee report and also a FCC report recommend the use of spectrum sharing technologies. One such technology addressed in these reports is cognitive radio (CR)\, in which a network entity is able to adapt intelligently to the environment through observation\, exploration and learning. In this talk\, we discuss the problem of coexistence\, competition and  fairness among autonomous cognitive Radios (CRs) in multiple potentially available channels that may be non-homogeneous in terms of  primary user (PU) occupancy. Moreover\, the real spectrum occupancy data collected at RWTH Aachen confirms  that the spectrum resources are in general non-homogeneous in terms of PU occupancy.   We present a model in which a CR that is able to adapt to the environment through observation and exploration is limited in two ways. First\, as in practical CR networks\, CRs have imperfect observations (such as due to sensing and channel errors) of their environment. Second\, CRs have imperfect memory due to limitations in computational capabilities. For efficient opportunistic channel selection\, we discuss efficient strategies and utilize the framework of repeated games (with imperfect observations and memory) to analyze their stability in the presence of selfish deviations. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:288@lincs.fr DTSTART;TZID=Europe/Paris:20140319T140000 DTEND;TZID=Europe/Paris:20140319T143000 DTSTAMP:20211125T121831Z URL:https://www.lincs.fr/events/quantun-information/ SUMMARY:Quantun Information DESCRIPTION:Information is something encoded in physical systems's properties. Hence the study of information and computation is linked to the underlying physical processes. Quantum Information is the study of information encoded in the state of quantum system. Quantum phenomena such as the superposition principle and entanglement give rise to a other approach and opportunities in all the sub-fields of Information Theory. The goal of this seminar\, by giving some basic concepts of quantum information\, is to give a very naive approach which will permit to the audiance  to have an overview of the Quantum Information field. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:287@lincs.fr DTSTART;TZID=Europe/Paris:20140312T140000 DTEND;TZID=Europe/Paris:20140312T150000 DTSTAMP:20170328T135903Z URL:https://www.lincs.fr/events/network-fingerprinting-ttl-based-router-si gnatures/ SUMMARY:Network Fingerprinting: TTL-Based Router Signatures DESCRIPTION:Fingerprinting networking equipment has many potential applications and benefits in network management and security. More generally\, it is useful for the understanding of network structures and their behaviors. In this paper\, we describe a simple fingerprinting mechanism based on the initial TTL values used by routers to reply to various probing messages. We show that main classes obtained using this simple mechanism are meaningful to distinguish routers platforms. Besides\, it comes at a very low additional cost compared to standardactive topology discovery measurements. As a proof of concept\, we apply our method to gain more insight on the behavior of MPLS routers and to\, thus\, more accurately quantify their visible/invisible deployment. This work has been published in IMC 2013. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:286@lincs.fr DTSTART;TZID=Europe/Paris:20140305T140000 DTEND;TZID=Europe/Paris:20140305T150000 DTSTAMP:20170328T135846Z URL:https://www.lincs.fr/events/resiliency-french-internet/ SUMMARY:On the resiliency of the French Internet DESCRIPTION:This presentation focuses on the resiliency of the French Internet\, studied from thepoint of view of network interconnectivity. We define a model for representing theBGP-level topology of the Internet which takes into account the businessrelationships between ASes\, and implement an algorithm to construct such a map from publicly available routing information.The portion of the Internet responsible for the connectivity of French ASes is thenestablished\, and the risk of disconnection is assessed. To this end\, we identify asset of critical ASes whose suppression would disconnect other ASes from the Internet. Finally\, we give some insight as to how the model could be expanded and thedifficulties this would introduce. We also give an example of how a BGP-level map ofthe Internet can be used to actively monitor the network. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:285@lincs.fr DTSTART;TZID=Europe/Paris:20140226T143000 DTEND;TZID=Europe/Paris:20140226T150000 DTSTAMP:20170328T135835Z URL:https://www.lincs.fr/events/tbd-2/ SUMMARY:Impact of the electronic architecture of optical slot switching nodes on latency in ring networks DESCRIPTION:An optical slot switching node network called POADM (packet optical add-drop multiplexers) has formerly been proposed as a flexible solution for metropolitan ring networks to carry data traffic with a sub-wavelength switching granularity and with a good energy efficiency\, which is enabledby optical transparency. In this paper\, for the first time we propose several architectures for the electronic side of optical slot switching nodes to increase flexibility through the addition of electronic switches\, working either at client packet granularity or at slot granularity\; such electronic switches can be located at either transmitter\, receiver\, or both sides of a node\, thereby decreasing traffic latency\, at the expense of increased node cost and/or energy consumption. This paper focuses on the latency aspect. We investigate the impact of a timer that can be used to upper bound the slots insertion time on the medium. We also propose\, for the first time\, a queuing model for optical slot switching ring and assess and compare the latency of these node architectures analytically using queuing theory\, and with simulations. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:284@lincs.fr DTSTART;TZID=Europe/Paris:20140226T140000 DTEND;TZID=Europe/Paris:20140226T143000 DTSTAMP:20170328T135822Z URL:https://www.lincs.fr/events/tbd-4/ SUMMARY:Energy-Aware Computing with Application Processors DESCRIPTION:Energy aware computing is as ubiquitous as ubiquitous computing itself. The user experience and up-time of hand-held devices are affected directly by the squander of battery resources. We will focus on embedded systems\, e.g.\, smartphones\, or tables\, and highlight the most prominent sources of power consumption in application processors. The temperature dependency of the power consumption is also discussed. This implies the importance of thermal models for passively cooled devices\, used by DVFS controllers\, process schedulers\, and thermal management units. Passively cooled devices show substantially different thermal behavior compared to actively cooled devices. Our latest developments on this topic are briefly presented. Furthermore\, common energy optimization techniques\, both software and hardware based\, are discussed. The referenced material covers practical\, industrial and academic solutions to the energy optimization problem. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:283@lincs.fr DTSTART;TZID=Europe/Paris:20140220T140000 DTEND;TZID=Europe/Paris:20140220T160000 DTSTAMP:20170328T135813Z URL:https://www.lincs.fr/events/recovering-causality-information-time-seri es-data/ SUMMARY:On Recovering Causality Information from Time Series Data DESCRIPTION:Suppose we have N time series available where one time-series could be causally dependent on others. For example\, such dependence can be found in economic data or weather data. The goal is to recover the directed causality graph that links these time series. As is well known causality and correlation are not the same and thus one of the important questions is how to address this issue. There are several frameworks such as directed information\, the notion of Granger causality\, etc. However working with directed information requires too much a priori knowledge about the structure of the time series that is unavailable.\n\nIn this talk I will show how the notion of Granger causality can be tied to Wiener filtering that allows us to recover a directed random graph whose edges are represented by the innovations filters. This approach as well as the directed information approach assuming Gaussianity however are not very practical and so a pairwise approach is taken. This suffers from over estimation of directed edges of the causality graph. To address this issue we show how it is possible to consider a sparse problem based on a mixed L1 - H1 norm that leads to an approach for selecting edges characterized by complex polynomials. This results in a convex optimization problem. We show that such an approach provides satisfactory results on synthetic examples and uncovers interesting causal dependencies when used on real time series data.\n\nJoint work with S. Datta Gupta (University of Waterloo\, Canada). CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:282@lincs.fr DTSTART;TZID=Europe/Paris:20140219T140000 DTEND;TZID=Europe/Paris:20140219T150000 DTSTAMP:20170328T135804Z URL:https://www.lincs.fr/events/optimal-cache-allocation-content-centric-n etworking/ SUMMARY:Optimal cache allocation for content-centric networking DESCRIPTION:Content-Centric Networking (CCN) is a promis-ing framework for evolving the current network architecture\,advocating ubiquitous in-network caching to enhance contentdelivery. Consequently\, in CCN\, each router has storage spaceto cache frequently requested content. In this work\, we focuson the cache allocation problem: namely\, how to distribute thecache capacity across routers under a constrained total storage budget for the network. We formulate this problem as a content placement problem and obtain the exact optimal solution by a two-step method. Through simulations\, we use this algorithm to investigate the factors that affect the optimal cache allocation in CCN\, such as the network topology and the popularity ofcontent. We find that a highly heterogeneous topology tends toput most of the capacity over a few central nodes. On the otherhand\, heterogeneous content popularity has the opposite effect\, by spreading capacity across far more nodes. Using our findings\, wemake observations on how network operators could best deployCCN caches capacity CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:281@lincs.fr DTSTART;TZID=Europe/Paris:20140205T140000 DTEND;TZID=Europe/Paris:20140205T150000 DTSTAMP:20170328T135746Z URL:https://www.lincs.fr/events/fair-flows-fair-network-attractive-trustwo rthy-far-just-adequate/ SUMMARY:Be fair to flows: a fair network is attractive and trustworthy and far more than just adequate DESCRIPTION:The subject of active queue management is again highly topical with the recent creation of a new IETF working group. Regained interest has arisen notably from the observed failings of traditional approaches to congestion control in environments as diverse as the data center interconnect and the home network subject to "bufferbloat". In this context it is opportune to remake the case for implementing per-flow fair queueing as the standard packet scheduling algorithm in router buffers. Though flow fairness as the basis of congestion control was proposed by Nagle as early as 1985 and feasibility was demonstrated at least 15 years ago in Bell Labs work on PacketStar\, the networking research community has largely remained focused on designing new TCP versions and AQM algorithms as if the FIFO buffer were an unavoidable technological constraint. We show how per-flow fairness realizes implicit service differentiation and greatly facilitates network engineering with the notion of "fair networks" appearing as a natural parallel to that of "loss networks". Accounting for the stochastic nature of traffic\, simple fairness is generally seen to be preferable\nto weighted fairness or size-based priority scheduling while longest queue drop is likely the only AQM required.\n\nBiography: Jim Roberts very recently joined the French research institute IRT-SystemX to work on a project on Cloud computing and network architecture. He was previously with Inria from September 2009 after spending more than thirty years with France Telecom research labs. He received a degree in Mathematics from the University of Surrey in 1970 and a doctorate in computer science in 1987 from the University of Paris VI. His research is centered on the performance evaluation and\ndesign of traffic controls for communication networks. In a long career\, he has published around 100 papers\, chaired several program committees and been associate editor for a number of journals. He gave the Keynote at Infocom 2013. He is a Fellow of the Société des électriciens et électroniciens (SEE) and recipient of the Arne Jensen lifetime achievement award from the International Teletraffic Congress (ITC). CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:280@lincs.fr DTSTART;TZID=Europe/Paris:20140129T140000 DTEND;TZID=Europe/Paris:20140129T150000 DTSTAMP:20170328T135738Z URL:https://www.lincs.fr/events/announced/ SUMMARY:Protecting Privacy While Providing Utility in Published Network Mobility Traces Using Differential Privacy DESCRIPTION:Those who design\, develop and deploy computer and networked systems\, have a vital interest in how these systems perform in "real-world" scenarios. But real-world conditions and data sets are often hard to come by-companies treat scenario data as a confidential asset and public institutions are reluctant to release data for fear of compromising individual privacy. This challenge is particularly acute in mobile wireless networks\, where many have noted the need for realistic mobility and wireless network datasets. But assuring privacy is difficult. Several well-known examples have shown how anonymized data sets can be combined with other data to compromise individuals' personal privacy. The relatively recent model of differential privacy (DP) provides an alternate approach to measuring and controlling the disclosure of personal information\, adding sufficient random "noise" (in a precisely quantifiable manner) to any output computed from a sensitive collection of data\, so that a precise statistical privacy condition is met. In this talk we outline ongoing research to produce trajectory traces\, and results derived from trajectory traces\, for public release from original "real-world" mobility traces (e.g.\, from our 802.11 campus network) while providing both well-defined differential privacy guarantees and demonstrably high accuracy when these publicly-released data sets are used for a number of common network and protocol design and analysis tasks. We describe a DP technique using a constrained trajectory-prefix representationof the original data\, using known network topology and human mobility constraints\, to determinethe underlying representation of the original data and judiciously allocate random noise needed tosatisfy DP constraints. We will also discuss alternative representations of mobility data that we conjecture will provide better accuracy for specific analysis tasks\, and discuss the tradeoff between generality/specificity and accuracy.This is a "work in-progress" talk\, so ideas are still being "baked" and comments/discussion are particularly welcome. This is joint research with Gerome Miklau and Jennie Steshenko at the University of Massachusetts Amherst\n\nBiography: Jim Kurose is a Distinguished Professor of Computer Science at the University of Massachusetts Amherst. His research interests include network protocols and architecture\, network measurement\, sensor networks\, multimedia communication\, and modeling and performance evaluation. He has served as Editor-in-Chief of the IEEE Transactions on Communications and was the founding Editor-in-Chief of the IEEE/ACM Transactions on Networking. He has been active in the program committees forIEEE Infocom\, ACM SIGCOMM\, ACM SIGMETRICS and ACM Internet Measurement conferences for a number of years\, and has served as Technical Program Co-Chair for these conferences.He has received a number of research and teaching awards including the IEEE Infocom Award\, the ACM Sigcomm Test of Time Award and the IEEE Taylor Booth Education Medal. With Keith Ross\, he is the co-author of the textbook\, Computer Networking\, a top down approach (6th edition).He has been a visiting researcher at Technicolor's Paris Research Lab and at the LINCS (where is also a member of the LINCS Scientific Advisory Board) in 2012. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:279@lincs.fr DTSTART;TZID=Europe/Paris:20140122T140000 DTEND;TZID=Europe/Paris:20140122T150000 DTSTAMP:20170328T135728Z URL:https://www.lincs.fr/events/cobra-lean-intra-domain-routing-ndn/ SUMMARY:COBRA: Lean Intra-domain Routing in NDN DESCRIPTION:Named Data Networking (NDN) is an emerging In-formation Centric Networking architecture based on hierarchicalcontent names\, in-network caching mechanisms\, receiver-driven operations\, and content-level security schema. NDN networkingprimitives and routing are based on content names and thereforeefficient content discovery of permanent as well as temporarilyavailable cached copies is a key problem to address. This paper ex-amines current NDN approaches and proposes a fully distributed\,content-driven\, bloom filter-based intra-domain routing algorithm(COBRA)\, which outperforms previous solutions in this area.COBRA creates routes based on paths used previously for contentretrieval\, and maintains routing information up-to-date with outthe need for extensive signaling between nodes. We evaluate COBRA using simulation and compare its performance with other established routing strategies over the European research network GEANT topology as an example of a ndnSIM core network. Our results illustrate that COBRA can significantly reduce overhead with respect to flood-based routing while ensuring hit distancesof the same\norder as when using Dijkstra's algorithm.joint work with L.A. Grieco\, G. Boggia\, and K. Pentikousis\, appering in the Procedings of IEEE Consumer Communications &\; Networking Conf. (CCNC)\, 2014 CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:278@lincs.fr DTSTART;TZID=Europe/Paris:20140115T140000 DTEND;TZID=Europe/Paris:20140115T150000 DTSTAMP:20170328T135720Z URL:https://www.lincs.fr/events/community-detection-stochastic-block-model s-via-spectral-methods/ SUMMARY:Community detection in stochastic block models via spectral methods DESCRIPTION:Community detection consists in identification of groups of similar items within a population. In the context of online social networks\, it isa useful primitive for recommending either contacts or news items tousers. We will consider a particular generative probabilistic model forthe observations\, namely the so-called stochastic block model\, andgeneralizations thereof. We will describe spectral transformations andassociated clustering schemes for partitioning objects into distinctgroups. Exploiting results on the spectrum of random graphs\, we willestablish consistency of these approaches under suitable assumptions\,namely presence of a sufficiently strong signal in the observed data. Wewill also discuss open questions on phase transitions for clusterdetectability in such models when the signal becomes weak. In particularwe will introduce a novel spectral method which provably allows detectionof communities down to a critical threshold\, thereby settling an openconjecture of Decelle\, Krzakala\, Moore and Zdeborová. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:277@lincs.fr DTSTART;TZID=Europe/Paris:20140108T140000 DTEND;TZID=Europe/Paris:20140108T150000 DTSTAMP:20211125T121914Z URL:https://www.lincs.fr/events/presentation-du-ppp-5g/ SUMMARY:Presentation du PPP 5G DESCRIPTION:Brigitte CARDINAEL Head of Cooperative Research France Telecom Orange\n\nBrigitte Cardinael graduated from INT in 1987. She joined Matra Communication in 1987\,where she was involved during 6 years in the research and development for GSM. Then she joined France Telecom Research and Development (FTRD) in 1993 where she worked first on mobile satellite component in context of IMT-2000. After France Telecom investment in Globalstar she was the coordinator of Globalstar activities at FTR&\;D from 1995 to 1999. Shejoined in 2002 the management team of the R&\;D Division on Mobile Services and Radio Systems as Innovation and Strategy manager. She was also in charge from 2001 till 2005 of coordinating Beyond 3G activities which includes France Telecom involvement in FP6 (Winner\, E2R\, Ambient Network\, Daidalos\, SPICE\, MAGNET and 4MORE) and in international bodies (WWRF\, SDRF\, IEEE\, 3GPP\, IETF\,...). She is since January 2006 headof cooperative research at France Telecom R&\;D. She has been eMobility Vice Chairman in 2006 and 2007. She is chairing the ETNO R&\;D group and the eMobility Testing Facilities WG. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:276@lincs.fr DTSTART;TZID=Europe/Paris:20131211T140000 DTEND;TZID=Europe/Paris:20131211T150000 DTSTAMP:20170328T135659Z URL:https://www.lincs.fr/events/combating-internet-attacks-via-infiltratio n/ SUMMARY:Combating Internet Attacks Via Infiltration DESCRIPTION:Far and away the most energetic driver of modern Internet attacks is the ability of attackers to financially profit from their assaults. Many of these undertakings however require attackers to operate at a scale that necessitates interacting with unknown parties - rendering their activities vulnerable to *infiltration* by defenders. This talk will sketch research that has leveraged such infiltration to striking effect.\n\n \;\n\nVern Edward Paxson is a Professor of Computer Science at the University of California\, Berkeley. He also works as an Internet researcher based at the International Computer Science Institute in Berkeley\, California. His interests range from transport protocols to intrusion detection and worms. He is an active member of the Internet Engineering Task Force (IETF) community and served as the chair of the IRTF from 2001 until 2005. From 1998 to 1999 he served on the IESG as Transport Area Director of the IETF.\n\nIn 2006 Paxson was inducted as a Fellow of the Association for Computing Machinery (ACM). The ACM's Special Interest Group on Data Communications (SIGCOMM) gave Paxson its 2011 award\, "for his seminal contributions to the fields of Internet measurement and Internet security\, and for distinguished leadership and service to the Internet community." The annual SIGCOMM Award recognizes lifetime contribution to the field of communication networks.[1]\n\nPaxson is also the original author of the flex lexical analyzer and the Bro intrusion detection system. Backscatter is a term coined by Vern Paxson to describe Internet background noise resulting from a DDoS attack using multiple spoofed addresses\n\nhttp://www.icir.org/vern/\n\n \; CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:275@lincs.fr DTSTART;TZID=Europe/Paris:20131210T140000 DTEND;TZID=Europe/Paris:20131210T150000 DTSTAMP:20211125T121940Z URL:https://www.lincs.fr/events/convergence-speed-asymptotic-consensus-alg orithms/ SUMMARY:Convergence Speed of Asymptotic Consensus Algorithms DESCRIPTION:Asymptotic consensus is a phenomenon observed in bird flocking\, firefly synchronization\, opinion spreading\, or synchronization of coupled oscillators. Algorithms that achieve asymptotic consensus are used in systems like sensor networks\, dynamic load balancing protocols\, robot formation protocols\, or rendezvous in space.\n\nThese algorithms have a simple form: At every step of the algorithm\, each agent forms an average of values observed from neighboring agents. These algorithms guarantee asymptotic consensus among agents even under very light conditions on the (dynamic) communication topology and the weights used in the calculation of the averages.\n\nEquivalently\, asymptotic consensus can be seen as convergence of not necessarily reversible and not necessarily time-homogeneous Markov chains to their limiting distributions.\n\nThis talk introduces asymptotic consensus and presents new upper bounds on its convergence speed\, generalizing recent results by Cao et al.\, Oshevsky and Tsitsiklis\, and Chazelle. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:274@lincs.fr DTSTART;TZID=Europe/Paris:20131204T140000 DTEND;TZID=Europe/Paris:20131204T150000 DTSTAMP:20170328T135625Z URL:https://www.lincs.fr/events/understanding-dynamic-behaviour-google-con gestion/ SUMMARY:Understanding the Dynamic Behaviour of the Google Congestion DESCRIPTION:This is a joint with G. Carlucci and S. Mascolo\, and will be presented at Packet Video Workshop\, San Jose\, CA\, USA\, December 2013. Real-time communication over the Internet is of ever increasing importance due the diffusion of portable devices\, such as smart phones or tablets\, with enough processing capacity to support video conferencing applications. The RTC Webworking group has been established with the goal of standardizing a set of protocols for inter-operable real-time communication among Web browsers. In this paper we focus on the Google Congestion Control (GCC)\, recently proposed in such WG\, which is based on a loss-based algorithm run at the sender and a delay-based algorithm executed at the receiver. In a recent work we have shown that a TCP flow can starve a GCC flow. In this work we show that this issue is due to a threshold mechanism employed by the delay-based controller. By carrying out an extensive experimental evaluation in a controlled testbed\, we have found that\, when the threshold is small\, the delay-based algorithm prevails over the loss-based algorithm\, which contains queuing delays and losses. However\, a small threshold may lead to starvation of the GCC flow when sharing the bottleneck with a loss-based TCP flow. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:273@lincs.fr DTSTART;TZID=Europe/Paris:20131127T140000 DTEND;TZID=Europe/Paris:20131127T150000 DTSTAMP:20170328T135617Z URL:https://www.lincs.fr/events/adaptive-internet-governance-innovation-ec osystem-2/ SUMMARY:Adaptive Internet Governance: Innovation in the Ecosystem DESCRIPTION:Abstract: The years following the United Nation's World Summit on the\nInformation Society (WSIS) have seen much technological change related\nto the Internet as well as significant innovation related to the\ndiscussion of Internet policy issues. Reporting on an institutional\ninnovation in the Internet governance ecosystem\, the research to be\ndiscussed examines the approximately eight-year-old Internet\nGovernance Forum\, highlights the growing roles of civil society\nincluding academics and technical experts\, and tracks especially\nrecent tensions among ecosystem actors. It also highlights the\necosystem's evolution and the roles of Multistakeholderism. Finally\,\nit analyzes recent developments and identifies future directions.\nBiography: Nanette S. Levinson is Associate Professor of International\nRelations\, School of International Service\, American University and\nAcademic Director of the SIS- Sciences-Po Exchange. She is a past\nChair of the Global Internet Governance Academic Network (GigaNet) and\nEditor of the International Communication Section in Robert Denemark\,\nEditor\,The International Studies Compendium Project. Oxford:\nWiley-Blackwell. From 1988-2005 she served as Associate Dean of the\nSchool of International Service.Recipient of awards including those\nfor outstanding teaching\, program development\, academic affairs\nadministration\, multicultural affairs and honors programming\, she has\ndesigned co-curricular collaborative learning opportunities including\nthe Freshman Service Experience and the Graduate Portal Program.\nAdditionally\, she has crafted and implemented research-based training\nprograms for the private and public sectors. In 2011\, the Ashoka\nFoundation presented her with an "Award for Outstanding Contributions\nto Social Entrepreneurship Education" and included her peer-reviewed\nsyllabus in its list and publication of the top ten syllabi in the\nfield. Her research and teaching focus on knowledge transfer\, culture\,\nand innovation in a range of settings including cross-national\nalliances\; internet and global governance\; cross-national\, virtual\ncollaboration\; and social entrepreneurship. Also included is work\ncentering on interorganizational learning and institutional change\nwith special focus on new media and technology policy issues in the\ndeveloping world. Prof. Levinson's writings appear online and in\njournals ranging from Information Technologies and International\nDevelopment to International Studies Perspectives. She received her\nbachelor's\, masters and doctoral degrees from Harvard University. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:272@lincs.fr DTSTART;TZID=Europe/Paris:20131127T110000 DTEND;TZID=Europe/Paris:20131127T120000 DTSTAMP:20170328T135604Z URL:https://www.lincs.fr/events/providing-incentives-wireless-peer-peer-ne tworks/ SUMMARY:Providing Incentives for Wireless Peer-to-Peer Networks DESCRIPTION:Wireless Peer-to-Peer (P2P) systems allow mobile users to obtain data\nfrom nearby peers instead of the far away base station. It has the\nbenefits of reducing power consumption\, increasing capacity\, etc. An\nimportant challenge for P2P networks is to incentivize users to\ncontribute by sharing the data that others need. Due to the\nbroadcasting nature of wireless transmissions\, existing solutions for\nwireline P2P networks cannot be applied. In this talk\, we present two\nnon-monetary protocols for wireless P2P networks. We assume that each\nmobile user aims to increase its download rate and to decrease its\ntransmission rate. We propose a fully distributed protocol where\nmobile users determine which one to transmit through random backoff.\nWe derive a closed-form formulation for the Nash Equilibrium\, and\npropose a distributed mechanism under which strategies of mobile users\nconverge to the Nash Equilibrium. Next\, we consider systems where a\ncentralized broker schedules transmissions for all mobile users. We\npropose a scheduling policy for the broker\, and demonstrate that the\npolicy is truthful in the sense that all mobile users maximize their\nown utilities by reporting their true values to the broker.\n\nBrief biography:\n\nI-Hong Hou received the B.S. in Electrical Engineering from National\nTaiwan University in 2004\, and his M.S. and Ph.D. in Computer Science\nfrom University of Illinois\, Urbana-Champaign in 2008 and 2011\,\nrespectively. He is currently an Assistant Professor at the\nDepartment of Electrical and Computer Engineering of the Texas A&\;M\nUniversity. His research interests include wireless networks\, wireless\nsensor networks\, real-time systems\, distributed systems\, and vehicular\nad hoc networks. URL: http://cesg.tamu.edu/faculty/ihong-hou/ CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:271@lincs.fr DTSTART;TZID=Europe/Paris:20131126T140000 DTEND;TZID=Europe/Paris:20131126T150000 DTSTAMP:20170328T133937Z URL:https://www.lincs.fr/events/feature-selection-neuro-dynamic-programmin g/ SUMMARY:Feature Selection for Neuro-Dynamic Programming DESCRIPTION:Neuro-Dynamic Programming encompasses techniques from both reinforcement learning and approximate dynamic programming. Feature selection refers to the choice of basis that defines the function class that is required in the application of these techniques. This talk reviews two popular approaches to neuro-dynamic programming\, TD-learning and Q-learning. The main goal of this work is to demonstrate how insight from idealized models can be used as a guide for feature selection for these algorithms. Several approaches are surveyed\, including fluid and diffusion models\, and the application of idealized models arising from mean-field game approximations. The theory is illustrated with several examples. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:270@lincs.fr DTSTART;TZID=Europe/Paris:20131113T140000 DTEND;TZID=Europe/Paris:20131113T143000 DTSTAMP:20170328T133911Z URL:https://www.lincs.fr/events/reliable-scalable-account-correlation-acro ss-large-social-networks/ SUMMARY:Reliable and Scalable Account Correlation Across Large Social Networks DESCRIPTION:There is lot of interest and concern\, both in research and industry\, about the potential for correlating user accounts across\nmultiple online social networking sites. In this paper\, we focus on the challenge of designing account correlation schemes that achieve\nhigh reliability\, i.e.\, low error rates\, in matching accounts\, even when applied in large-scale networks with hundreds of millions of user\naccounts. We begin by identifying four important properties â Availability\, Consistency\, non-Impersonability\, and Discriminability\n(ACID) â that features used for matching accounts need to satisfy inorder to achieve reliable and scalable account correlation. Even\nthough public attributes like name\, location\, profile photo\, and friends do not satisfy all the ACID properties\, we show how it is\npossible to leverage multiple attributes to build SCALABLE- LINKER\, a reliable and scalable account correlator. We evaluate the performance\nof SCALABLE-LINKER in correlating accounts from Twitter and Facebook\, two of the largest real-world social networks. Our tests using ground\ntruth data about correlated accounts\, show that while SCALABLE-LINKER can correlate as high as 89% of accounts (true positive rate) with\nless than 1% false positive rate\, when evaluated over small thousand node subsets of Facebook accounts\, the true positive rate drops to 21%\n(keeping the 1% false positive rate)\, when the evaluation scale to include all the more than billion Facebook accounts. Our findings\nreflect the potential as well as the limits of reliably correlating accounts at scale using only public attributes of accounts. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:269@lincs.fr DTSTART;TZID=Europe/Paris:20131106T140000 DTEND;TZID=Europe/Paris:20131106T150000 DTSTAMP:20190121T153916Z URL:https://www.lincs.fr/events/detecteurs-de-defaillances/ SUMMARY:Détecteurs de défaillances DESCRIPTION:\n\n\nLes détecteurs de défaillances ont été introduit par Chandra et Toueg en 1996 et ont été l'objet d'une recherche active depuis cette date. On présentera les détecteurs de défaillances\, les notions de réduction et de plus faible détecteur de défaillances pour résoudre un problème en présence de panne. On fera ensuite un état de l'art sur les résultats obtenus ainsi que sur les implémentations des détecteurs de défaillances. \n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:160@lincs.fr DTSTART;TZID=Europe/Paris:20131023T140000 DTEND;TZID=Europe/Paris:20131023T143000 DTSTAMP:20190121T155218Z URL:https://www.lincs.fr/events/adaptive-traffic-light-control-using-wirel ess-sensor-network/ SUMMARY:Adaptive traffic light control using a wireless sensor network DESCRIPTION:We consider the problem of controlling traffic lights in an\nurban environment composed of multiple adjacent intersections by using\nan intelligent transportation system to reduce congestion and delays.\nTraditionally\, each intersection is managed statically: the order and\ndurations of the green lights are pre-determined and do not adapt\ndynamically to the traffic conditions. Detectors are sometimes used to\ncount vehicles on each lane of an intersection but the data they\nreport is generally used only to select between a few static sequences\nand timings setups. Here\, we detail and study TAPIOCA\, a distribuTed\nand AdaPtIve intersectiOns Control Algorithm that decides of a traffic\nlight schedule. After a review of relevant related works\, we first\nexpose and evaluate the TAPIOCA algorithm\, using the SUMO simulator\nand the TAPAS Cologne dataset. We then study the use of a hierarchical\nwireless sensor network deployed at intersections and the consequences\nof losses and delays it induces on TAPIOCA. Last but not least\, we\npropose a prediction mechanism that alleviates these issues and show\,\nusing co-simulation between SUMO and OMNeT++\, that such interpolation\nmechanisms are effectively able to replace missing or outdated data.\nBiography: Sébastien Faye obtained a master degree in computer\nscience from the university of Picardie Jules Verne (Amiens\, France)\nin 2011. He is currently a PhD student at the Computer Science and\nNetworking Department (INFRES) of Telecom ParisTech (Paris\, France).\nHis research interests include Intelligent Transportation Systems and\nsensor networks. CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:268@lincs.fr DTSTART;TZID=Europe/Paris:20131015T113000 DTEND;TZID=Europe/Paris:20131015T123000 DTSTAMP:20190122T092132Z URL:https://www.lincs.fr/events/ravi-r-mazumdar-randomized-load-balancing- large-processor-sharing-systems/ SUMMARY:Randomized Load Balancing in Large Processor Sharing Systems DESCRIPTION:Processor sharing models occur in a wide variety of situations. They are good models forbandwidth sharing as well as being solutions to NUM for logarithmic utilities. In addition theypossess the desirable stochastic property of the stationary distribution being insensitive to the service time distribution. In this talk I will discuss new advances in understanding and characterizingthe behavior of randomized routing to PS servers that are heterogeneous in terms of their servercapacities.In particular\, starting with the identical server case we will rst discuss the so-called Power-of-two rule where by a combination of routing to the least occupied server amongst two randomlychosen servers results in a very low server occupancy and a so-called propagation of chaos orasymptotic independence. Using these insights we analyze the case of heterogeneous servers wherethe server capacity can be one of M. We provide a complete characterization of the stationarydistribution and prove that the limiting system is insensitive. We then consider a modied criterionbased on routing to the server with lower Lagrange costs. We compare these dynamic routingstrategies with an optimal static state independent scheme. We show that the dynamic schemesare much better in terms of average delay with the Lagrange cost based being the best.The techniques are based on a mean eld analysis and an ansatz based on propagation of chaos.Joint work with Arpan Mukhopadhyay (Waterloo). CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:267@lincs.fr DTSTART;TZID=Europe/Paris:20131009T140000 DTEND;TZID=Europe/Paris:20131009T150000 DTSTAMP:20190122T092037Z URL:https://www.lincs.fr/events/jordi-domingo-pascual-locatorid-split-anal ysis-of-the-caching-system/ SUMMARY:Locator/ID split: Analysis of the caching system DESCRIPTION:Abstract: Locator/Identifier splitting is a paradigm proposed to helpInternet scalability. At the same time\, the separation of the locatorand the identifier name spaces allows for a more flexible management of traffic engineering\, mobility and multi.homing. A mapping system is require for the binding of locators and identifiers. This mapping is helped by the use of a cache where ongoing associations are kept. The management and dimensioning of this cache is a critical aspect of this new architecture for its future deployment. We present a model for the caching system and and evaluation of its behaviour using real traffic traces.The talk will present the recent research work on LOC/ID splitting architectures.\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:265@lincs.fr DTSTART;TZID=Europe/Paris:20130918T140000 DTEND;TZID=Europe/Paris:20130918T153000 DTSTAMP:20190122T091942Z URL:https://www.lincs.fr/events/riad-mazloum-violation-of-interdomain-rout ing-assumptions/ SUMMARY:Violation of interdomain routing assumptions DESCRIPTION:We challenge a set of common assumptions that are frequently used tomodel interdomain routing in the Internet. We draw assumptions from thescientific literature and confront them with routing decisions that areactually taken by ASes\, as seen in BGP feeds. We show that the assumptions aretoo simple to model real-world Internet routing policies. We also show thatASes frequently route in ways that are inconsistent with simple economicmodels of AS relationships. Our results should introduce a note of cautioninto future work that makes these assumptions and should prompt attempts tofind more accurate models. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:266@lincs.fr DTSTART;TZID=Europe/Paris:20130918T140000 DTEND;TZID=Europe/Paris:20130918T153000 DTSTAMP:20220210T140949Z URL:https://www.lincs.fr/events/tolerating-byzantine-failures-in-sparse-ne tworks/ SUMMARY:Tolerating Byzantine failures in sparse networks DESCRIPTION:As network grow larger and larger\, they become more likely to fail locally. Indeed\, the nodes may be subject to attacks\, failures\, memory corruption... In order to encompass all possible types of failures\, we consider the more general model of failure: the Byzantine model\, where the failing nodes have an arbitrary malicious behavior. In other words\, tolerating Byzantine nodes implies to ensure that there exists no strategy (however unlikely it may be) for the Byzantine nodes to destabilize the network.We thus consider the probleme of reliably broadcasting a message in a multihop network that is subject to Byzantine failures. Solutions exist\, but require a highly-connected network. In this talk\, we present our recent solutions for Byzantine-resilient broadcast in sparse networks\, where each node has a very limited number of neighbors. A typical example is the grid\, where each node has at most 4 neighbors. We thus show the tradeo-ff between connectivity and reliability. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:264@lincs.fr DTSTART;TZID=Europe/Paris:20130904T140000 DTEND;TZID=Europe/Paris:20130904T150000 DTSTAMP:20190122T091425Z URL:https://www.lincs.fr/events/locatorid-split-analysis-of-the-caching-sy stem/ SUMMARY:Locator/ID split: Analysis of the caching system DESCRIPTION:Locator/Identifier splitting is a paradigm proposed to help Internet scalability. At the same time\, the separation of the locator and the identifier name spaces allows for a more flexible management of traffic engineering\, mobility and multi.homing. A mapping system is require for the binding of locators and identifiers. This mapping is helped by the use of a cache where ongoing associations are kept. The management and dimensioning of this cache is a critical aspect of this new architecture for its future deployment. We present a model for the caching system and and evaluation of its behaviour using real traffic traces. The talk will present the recent research work on\nLOC/ID splitting architectures. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:263@lincs.fr DTSTART;TZID=Europe/Paris:20130828T140000 DTEND;TZID=Europe/Paris:20130828T150000 DTSTAMP:20190122T091853Z URL:https://www.lincs.fr/events/peeking-behind-the-nat-an-empirical-study- of-home-networks/ SUMMARY:Peeking Behind the NAT: An Empirical Study of Home Networks DESCRIPTION:We present the first empirical study of home network availability\, infrastructure\, and usage\, using data collected from home networks around the world. In each home\, we de- ploy a router with custom firmware to collect information about the availability of home broadband network connectivity\, the home network infrastructure (including the wireless connectivity in each home network and the number of devices connected to the network)\, and how people in each home network use the network. Outages are more frequent and longer in developing countries sometimes due to the network\, and in other cases because they simply turn their home router off. We also find that some portions of the wire- less spectrum are extremely crowded\, that diurnal patterns are more pronounced during the week\, and that most traffic in home networks is exchanged over a few connections to a small number of domains. Our study is both a preliminary view into many home networks and an illustration of how measurements from a home router can yield significant information about home networks.\nThis is joint work with Mi Seon Park\, Srikanth Sundaresan\, Sam Burnett\, Hyojoon Kim\, Nick Feamster. It will appear at IMC 2013.\n\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:262@lincs.fr DTSTART;TZID=Europe/Paris:20130717T140000 DTEND;TZID=Europe/Paris:20130717T150000 DTSTAMP:20190122T083353Z URL:https://www.lincs.fr/events/pomdp-approach-for-pilot-allocation-and-re ceive-antenna-selection/ SUMMARY:POMDP Approach for Pilot Allocation and Receive Antenna Selection DESCRIPTION:This talk considers antenna selection (AS) at a receiver equipped with multiple antenna elements but only a single radio frequency chain for packet reception. As information about the channel state is acquired using training symbols (pilots)\, the receiver makes its AS decisions based on noisy channel estimates. Additional information that can be exploited for AS includes the time-correlation of the wireless channel and the results of the link-layer error checks upon receiving the data packets. In this scenario\, the task of the receiver is to sequentially select (a) the pilot symbol allocation\, i.e.\, how to distribute the available pilot symbols among the antenna elements\, for channel estimation on each of the receive antennas\; and (b) the antenna to be\nused for data packet reception. The goal is to maximize the expected throughput\, based on the past history of allocation and selection decisions\, and the corresponding noisy channel estimates and error check results. Since the channel state is only partially observed through the noisy pilots and the error checks\, the joint problem of pilot allocation and AS is modeled as a partially observed Markov decision process (POMDP). The solution to the POMDP yields the policy that maximizes the long-term expected throughput. Using the Finite State Markov Chain (FSMC) model for the wireless channel\, the performance of the POMDP solution is compared with that of other existing schemes\, and it is illustrated through numerical evaluation that the POMDP solution significantly outperforms them. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:261@lincs.fr DTSTART;TZID=Europe/Paris:20130710T140000 DTEND;TZID=Europe/Paris:20130710T150000 DTSTAMP:20190122T082322Z URL:https://www.lincs.fr/events/tbd-3/ SUMMARY:Toward an Enhanced Internet Architecture: the Locator/Identifier Separation Protocol (LISP) DESCRIPTION:The Locator/ID Separation Protocol (LISP)\, proposed by Ciscoand currently under standardization at the IETF (Internet Engineering Task Force)\, is an instantiation of the paradigm separating locators and identifiers. LISP improves Internetu2019s scalability\, also providing additional benefits (e.g.\, support for multi- homing\, traffic engineering\, mobility\, etc.) and having good incremental deployability properties. The talk will overview the principles of LISP\, its use in context different from Internet scalability\, and some of the ongoing work in Telecom ParisTech.\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:260@lincs.fr DTSTART;TZID=Europe/Paris:20130704T110000 DTEND;TZID=Europe/Paris:20130704T120000 DTSTAMP:20190122T085944Z URL:https://www.lincs.fr/events/point-map-palm-measures/ SUMMARY:Point-Map Palm Measures DESCRIPTION:\nIn this talk\, we speak about a framework for studying point-map invariant measures. A compatible point-map on the set of counting measures is a mapping on discrete multi-subsets of Rd: to each point of the discrete set\, it associates another point of the same set\, carrying the multiplicity\; compatibility means that the image of a point depends only on the support of the counting measure (the counting measure after removing the multiplicities) "seen from" (i.e. shifted to) this point.\nIt is a well known fact in the literature that whenever a compatible point-map is bijective on all simple counting measures\, the Palm version of any stationary simple point process is left invariant by the action of such a compatible and bijective point-map.\nWe focus on the case of a not necessarily bijective point-map f. Its goal is to associate\, to any stationary point process \, a companion point process with an almost sure mass at zero and with a law which is invariant under the action of f. We introduce the notion of Point-map Palm (or here f-Palm) version of the point process \, which satises the desired invariance property when it exists and we give sucient conditions for it to exist.\n\nJoint work with F. Baccelli.\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:259@lincs.fr DTSTART;TZID=Europe/Paris:20130703T143000 DTEND;TZID=Europe/Paris:20130703T150000 DTSTAMP:20220210T141114Z URL:https://www.lincs.fr/events/optimizing-qos-in-wireless-sensor-networks -using-a-caching-platform/ SUMMARY:Optimizing QoS in Wireless Sensor Networks Using a Caching Platform DESCRIPTION:\nThis \;paper addresses monitoring and surveillance applications using \;Wireless \;Sensors Networks (WSN). In this context\, several remote clients are \;interested \;in receiving the information collected by the nodes in a \;WSN. \;As WSN devices are most of the time constrained in energy and \;processing\, \;we present a caching architecture that will help reducing \;unnecessary \;communications and adapting the network to application \;needs.Our aim here is to cache information in order to improve the overall \;network lifetime\, \;while meeting equirements of external application in terms \;information freshness. \;We first describe and evaluate the performance of our \;caching system within the \;framework of a Constrained Application Protocol \;(CoAP) proxy. \;We then extend this work by showing how the cache could be \;enriched and exploited with \;cross-layer data. \;Based on information from \;routing packets and estimation updates of nodes power consumption\, \;we derive \;an optimization strategy which allows to meet requirements on the freshness \;of \;the cached values.\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:258@lincs.fr DTSTART;TZID=Europe/Paris:20130703T140000 DTEND;TZID=Europe/Paris:20130703T143000 DTSTAMP:20220210T141213Z URL:https://www.lincs.fr/events/efficient-ip-level-network-topology-captur e/ SUMMARY:Efficient IP-level network topology capture DESCRIPTION:Large-scale \;distributed traceroute-based measurement systems are used to obtain the topology \;of the Internet at the IP-level and can be used to monitor and understand the \;behaviour of the network. However\, existing approaches to measuring the public \;IPv4 network space often require several days to obtain a full graph\, which is \;too slow to capture much of the network's dynamics. This paper presents a new \;network topology capture algorithm\, NTC\, which aims to better capture network \;dynamics through accelerated probing\, reducing the probing load while \;maintaining good coverage. There are two novel aspects to our approach: it \;focuses on obtaining the network graph rather than a full set of individual \;traces\, and it uses past probing results in a new\, adaptive\, way to guide future \;probing. We study the performance of our algorithm on real traces and \;demonstrate outstanding improved performance compared to existing work. More \;info at http://ntc.top-hat.info/index.html.\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:257@lincs.fr DTSTART;TZID=Europe/Paris:20130619T110000 DTEND;TZID=Europe/Paris:20130619T120000 DTSTAMP:20220210T141312Z URL:https://www.lincs.fr/events/nash-equilibrium-structure-of-a-class-of-b locking-games-arising-in-network-security/ SUMMARY:Nash equilibrium structure of a class of blocking games arising in network security DESCRIPTION:We study a game-theoretic model for security/availability in a networking context. To perform some desired task\, a defender needs to choose a subset from a set of resources. To perturb the task\, an attacker picks a resource to attack.We model this scenario as a 2-player game and are interested in describing its set of Nash equilibrium. The games we study have a particular structure\, for which we can use the theory of blocking pairs of polyhedral\, pioneered by Fulkerson\, to arrive a reasonably satisfactory understanding of the Nash equilibrium. The subsets of resources that support Nash equilibrium strategies of the attacker\,called "vulnerability sets"\, are of particular interest\, and we identify them in several specific games of this type. An example of a game of this sort is when the set of resources is the set of edges of a connected graph\,the defender chooses as its subset the edges of a spanning tree\,and the attacker chooses an edge to attack with the aim of breaking the spanning tree.\n(joint work with Assane Gueye\, Aron Laszka\, and Jean Walrand) CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:256@lincs.fr DTSTART;TZID=Europe/Paris:20130613T111500 DTEND;TZID=Europe/Paris:20130613T123000 DTSTAMP:20170328T133557Z URL:https://www.lincs.fr/events/traffic-redundancy-elimination-cellular-sy stems-clouds/ SUMMARY:Traffic redundancy elimination for cellular systems and clouds DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:255@lincs.fr DTSTART;TZID=Europe/Paris:20130613T103000 DTEND;TZID=Europe/Paris:20130613T113000 DTSTAMP:20170328T133545Z URL:https://www.lincs.fr/events/integration-name-based-functionality-high- speed-network-equipment/ SUMMARY:On the integration of name-based functionality in high-speed network equipment DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:254@lincs.fr DTSTART;TZID=Europe/Paris:20130612T140000 DTEND;TZID=Europe/Paris:20130612T150000 DTSTAMP:20211125T122015Z URL:https://www.lincs.fr/events/integer-programming-models-for-transmissio n-scheduling-in-wireless-networks-2/ SUMMARY:Integer programming models for transmission scheduling in wireless networks DESCRIPTION:In the presentation\, we will discuss exact integer programming models for transmission scheduling in wireless networks based on the notion of compatible set. A compatible set is defined as a subset of radio links that can transmit simultaneously with acceptable interference. The issue is to find a set of compatible sets that\, when properly interlaced in the transmission slots\, will maximize a traffic objective. We will present integer programming formulations of the underlying optimization problem and discuss their computational effectiveness.\n\nBiography: Michal Pioro is a professor and Head of the Computer Networks and Switching Division at the Institute of Telecommunications\, Warsaw University of Technology\, Poland. At the same time he is a professor at Lund University\, Sweden. He received a Ph.D. degree in telecommunications in 1979\, and a D.Sc. degree (habilitation) in 1990\, both from the Warsaw University of Technology. In 2002 he received a Polish State Professorship. His research interests concentrate on modeling\, optimization and performance evaluation of telecommunication networks and systems. He is an author of four books and more than 150 technical papers presented in the telecommunication journals and conference proceedings. He has led many research projects for telecom industry in the field of network modeling\, design\, and performance analysis. He is deeply involved in international research projects including the FP7\, Celtic and COST  projects. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:253@lincs.fr DTSTART;TZID=Europe/Paris:20130604T110000 DTEND;TZID=Europe/Paris:20130604T120000 DTSTAMP:20190122T082033Z URL:https://www.lincs.fr/events/from-gossip-to-distributed-optimization-an d-back-again/ SUMMARY:From Gossip to Distributed Optimization (and back again) DESCRIPTION:\n\nConsensus in a network is a fundamental\, thoroughly\, studied problem. It is well known that the main obstacles to it are unreliability and asynchronism as stated by the celebrated "FLP impossibility result". However under smoother assumptions\, several works in the past decade have shown that consensus can be reached using very simple algorithms known as Gossip. Interestingly enough\, these gossip algorithms turned out essential in the more complex setting of distributed optimization wherethe sought consensus has to solve an optimization problem.\n\n\n\n\nThe first part of this talk will introduce the main concepts and tools: distributed algorithms\, gossip\, distributed optimization. In a second part of the talk\, I will discuss how to rely on distributed optimization to build more robust gossip schemes.\n\n\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:252@lincs.fr DTSTART;TZID=Europe/Paris:20130522T140000 DTEND;TZID=Europe/Paris:20130522T150000 DTSTAMP:20170328T132903Z URL:https://www.lincs.fr/events/smooth-a-simple-and-realistic-way-to-model -human-mobility/ SUMMARY:SMOOTH: A Simple and Realistic Way to Model Human Mobility DESCRIPTION:Simulation is the research tool of choice for a majority of the mobile ad hoc network (MANET) community\; however\, while the use of simulation has increased\, the credibility of the simulation results as decreased. Since mobility patterns can significantly affect the performance of a protocol\, choosing a realistic mobility model is one\nimportant aspect to consider in the development of a credible MANET simulation scenario.In addition to being realistic\, a mobility model should be easy to understand and use. Unfortunately\, most of the simple mobility models proposed thus far are not realistic and most of the realistic mobility models proposed thus far are not simple to use. In this seminar\, I will present SMOOTH\, a new mobility model that is realistic (e.g.\, SMOOTH is based on several known features of human movement) and is simple to use (e.g.\, SMOOTH does not have any complex input parameters). In addition to presenting SMOOTH\, I will show results that validate SMOOTH imitates human movement patterns present in real mobility traces collected from a range of diverse scenarios and I will compare SMOOTH with other mobility models that have been\ndeveloped on similar mobility traces. Lastly\, I will discuss tools that my group has created to aid the development of more rigorous simulation studies. While this work focuses on the MANET field\, the takeaway message in regards to credible simulation is applicable to other computing fields.\nBiography: Tracy Camp is a Full Professor of Computer Science in the Department of Electrical Engineering and Computer Science at the Colorado School of Mines. She is the Founder and Director of the Toilers ([23]http://toilers.mines.edu)\, an active ad hoc networks research group. Her current research interests include the credibility\nof ad hoc network simulation studies and the use of wireless sensor networks in geosystems. Dr. Camp has received over 20 grants from the National Science Foundation\, including a prestigious NSF CAREER award. In total\, her projects have received over $20 million dollars in external funding. This funding has produced 12 software packages that have been requested from (and shared with) more than 3000 researchers in 86 countries (as of October 2012). Dr. Camp has published over\n80 refereed articles and 12 invited articles\, and these articles have been cited almost 4\,000 times (per Microsoft Academic Search) and over 7\,000 times (per Google Scholar) as of December 2012.Dr. Camp is an ACM Fellow\, an ACM Distinguished Lecturer\, and an IEEE Senior Member. She has enjoyed being a Fulbright Scholar in New Zealand (in 2006)\, a Distinguished Visitor at the University of Bonn in Germany (in 2010)\, and a keynote presenter at several venues\, e.g.\, at the 7th International Conference on Intelligent Sensors\, Sensor Networks and Information Processing (ISSNIP 2011) in Adelaide\, Australia\, and the 3rd International Conference on Simulation Tools and Techniques (SIMUTools 2010) in Malaga\, Spain. In December 2007\, Dr. Camp received the Board of Trustees Outstanding Faculty Award at the Colorado School of Mines\; this award was only given five times between 1998-2007. She shares her life with Max (born in 2000)\, Emma (born in 2003)\, her husband (Glen)\, and three pets (two cats and a dog). The four humans are vegetarians who tremendously enjoy living in the foothills of the Rockies. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:251@lincs.fr DTSTART;TZID=Europe/Paris:20130514T140000 DTEND;TZID=Europe/Paris:20130514T150000 DTSTAMP:20190122T081645Z URL:https://www.lincs.fr/events/design-of-a-survivable-vpn-topology-over-a service-provider-network/ SUMMARY:Design of a Survivable VPN Topology over a Service Provider Network DESCRIPTION:Survivability in IP-over-WDM networks has already been extensively discussed in a series of studies. Up to date\,most of the studies assume single-hop working routing of trafficrequests. In this paper\, we study the multi layer survivable designof a virtual topology in the context of multiple-hop workingrouting for IP layer traffic requests. The design problem iscomposed of two problems which are simultaneously solved:( i ) Finding the most efficient or economical multi-hop routingof the IP traffic flows with different bandwidth granularitiesover the virtual topology\, which involves some traffic grooming\,( ii ) Ensuring that the virtual topology is survivable throughout an appropriate mapping of the virtual links over the physicaltopology\, if such a mapping exists.In order to solve such a complex multi layer resilient networkdesign problem\, we propose a column generation ILP model. Itallows exploiting the natural decomposition of the problem andhelps devising a scalable solution scheme.We conducted numerical experiments on a German networkwith 50 nodes and 88 physical links. Not only we could solve muchlarger data instances than those published in the literature\, butalso observe than multi-hop routing allows a saving of up to 10%of the number of lightpaths\, depending on the traffic load.\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:250@lincs.fr DTSTART;TZID=Europe/Paris:20130503T103000 DTEND;TZID=Europe/Paris:20130503T113000 DTSTAMP:20170328T132836Z URL:https://www.lincs.fr/events/2142/ SUMMARY:CLIPS: Infrastructure-free Collaborative Indoor Positioning Scheme DESCRIPTION:Indoor localization has attracted much attentionrecently due to its potential for realizing indoor location-awareapplication services. This talk considers a time-criticalscenario with a team of soldiers or first responders conductingemergency mission operations in a large building in whichinfrastructure-based localization is not feasible (e.g.\, due tomanagement/installation costs\, power outage\, terrorist attacks). In this talk\, I will present a collaborative\nindoor positioning scheme called CLIPS that requires no preexisting indoorinfrastructure. Assuming that each user has a received signalstrength map for the area in reference\, an application can compare and select a set of feasible positions\,when the device receives actual signal strength values at runtime. Then\, dead reckoning is performed to remove invalidcandidate coordinates eventually leaving only the correct onewhich can be shared\namongst the team. The evaluation resultsfrom an Android-based testbed show that CLIPS converges toan accurate set of coordinates much faster\nthan existing non-collaborativeschemes (more than 50% improvement under theconsidered scenarios).\n\n \;\n\nBiography: Dr. Uichin Lee is an assistant professor in the Department of Knowledge Service Engineering at KAIST\, Korea. He received his Ph.D. degree in Computer Science from UCLA in 2008. Before joining KAIST\, he worked for Alcatel-Lucent Bell Labs at Holmdel as a member\nof technical staff. His research interests include mobile/pervasive computing and social computing systems. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:249@lincs.fr DTSTART;TZID=Europe/Paris:20130430T140000 DTEND;TZID=Europe/Paris:20130430T150000 DTSTAMP:20170328T132815Z URL:https://www.lincs.fr/events/2141/ SUMMARY:Control of the grid in 2020\, and how economics can help us DESCRIPTION:In this talk we survey control issues in the grid\, and how the introduction of renewables brings new and interesting control problems. We also explain the need for economic theory to guide the formulation of contracts for resources needed for reliable real-time control. Control of the grid takes place on many time-scales\, and is analogous to many other control problems\, such as confronted in aviation. There is decision making on times scales of days\, weeks\, or months\; much like the planning that takes place for ticket sales for a commercial airline. Hourly decision making of energy supply is\nanalogous to the chatter between pilot and air traffic controller to re-adjust a route in response to an approaching thunderstorm. Then\, there is regulation of the grid on time-scales of seconds to minutes\; consider the second-by-second movement of the ailerons on the wings of an airplane\, in response to disturbances from wind and rain hitting the moving plane. There are also transient control problems: The recovery of the grid following one generator outage is much like the take-off or landing of an airplane. It is important to keep these analogies in mind so that we can have an informed discussion about how to manage the volatility introduced to the grid through renewable energy sources such as wind and solar. The new\ncontrol problems in the grid will be solved by engineers\, as we have solved many similar control problems.\n\nBiography: Sean Meyn received the B.A. degree in mathematics from the University of California\, Los Angeles (UCLA)\, in 1982 and the Ph.D. degree in electrical engineering from McGill University\, Canada\, in 1987 (with Prof. P. Caines\, McGill University). He is now Professor and Robert C. Pittman Eminent Scholar Chair in the Department of Electrical and Computer Engineering at the University of Florida\, and director of the Laboratory for Cognition &\; Control. His research interests include stochastic processes\, optimization\, and information theory\, with applications to power systems. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:248@lincs.fr DTSTART;TZID=Europe/Paris:20130424T140000 DTEND;TZID=Europe/Paris:20130424T150000 DTSTAMP:20190122T081813Z URL:https://www.lincs.fr/events/real-time-monitoring-of-physical-phenomena -and-their-dynamics-with-quality-guarantees-via-wireless-sensor-networks/ SUMMARY:Real-time Monitoring of Physical Phenomena and their Dynamics with Quality Guarantees via Wireless Sensor Networks DESCRIPTION:Wireless sensor networks (WSN) are a powerful type of instrument with thepotential of remotely observing the physical world at high resolution and scale.However\,\nto be an efficacious tool WSN monitoring systems must provideguarantees on the quality of the observations and mechanisms for real-timedata analysis. These problems are made challenging by the WSN limited resourcesand the high volume of sensor data. In this talk I will address both challenges and illustrate two monitoring solutions\, which are built on top of statistical models andoffer dynamic trade-offs between resource efficiency and quality of service.More precisely\, I will present an energy-efficient system\, called SAF\, for answeringon-line queries with quality guarantees\, detecting at real-time anomalies\, and clustering similar nodes. The system relies on a class of simple time series models built at sensors\, which are cheap to learn and dynamically adapt to variations in thedata distribution to accurately predict sensor values and improve resource utilization.SAF also provides an integrated fault detection system and a hierarchical scheme to improve scalability in case of large-scale WSN.SAF limited capabilities to face complex dynamics and data instability are overcome by the SmartEnv real-time monitoring system. It remarkably improves SAF and previouswork for providing probabilistic guarantees on the service quality even in case of sensormalfunctioning\, data instability and temporal communication disruption\, and for automatically analyzing sensor data (e.g.\, trends\, temporal-spatial correlations). SmartEnv is also ableto analyze anomalies\, thus distinguishing between sensor malfunctioning and unexpectedvariations in the phenomenon.I will conclude my talk with an outline of some SmartEnv applications and\nfuture work\,particularly in the context of smart cities/grids.\n\nBiography: Daniela Tulone holds a Ph.D. in Computer Science from University of Pisajointly with MIT\, a M.S. in Computer Science from NYU\, and a B.S. and M.S. degree in Mathematics from University of Catania. She has worked in academia and research labs(e.g.\,Bell-Labs\,MIT\, AT&\;T Labs\, NYU\, University of Pisa\, C.N.R.)\, in R&\;D\nindustry\,and recently at the Joint Research Center of the European Commission.Her interests include wireless sensor networks\, algorithms\, secure distributed systems\, thedesign of dynamic trade-offs\, smart grids\, data analysis\, and whatever involves a blendof theory and applications CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:167@lincs.fr DTSTART;TZID=Europe/Paris:20130423T140000 DTEND;TZID=Europe/Paris:20130423T150000 DTSTAMP:20190122T080424Z URL:https://www.lincs.fr/events/a-benes-packet-network/ SUMMARY:A Benes Packet Network DESCRIPTION:Benes networks are constructed with simple switch modules and have many advantages\, including small latency and requiring only an almost linear number of switch modules. As circuit-switches\, Benes networks are rearrangeably non-blocking\, which implies that they are full-throughput as packet switches\, with suitable routing. Routing in Benes networks can be done by time-sharing permutations. However\, this approach requires centralized control of the switch modules and statistical knowledge of the traffic arrivals. We propose a backpressure-based routing scheme for Benes networks\, combined with end-to-end congestion control. This approach achieves the maximal utility of the network and requires only four queues per module\,\nindependently of the size of the network.\nBiography: Longbo Huang is currently an assistant professor in the Institute for Interdisciplinary Information Sciences (IIIS) at Tsinghua University\, Beijing\, China. He received his Ph. D. degree from the Electrical Engineering department at the University of Southern California in August 2011\, and worked as a postdoctoral researcher in the Electrical Engineering and Computer Sciences department at the University of California at Berkeley from July 2011 to August 2012. He was also a visiting professor at the Institute of Network Coding at the Chinese University of Hong Kong from December\n2012 to February 2013. Prior to his Ph.D.\, Longbo received his B.E. degree from Sun Yat-sen (Zhongshan) University\, Guangzhou\, China\, and his M.S. degree from Columbia University\, New York City\, both in EE. His research interests are in the areas of Stochastic Network Optimization\, Data Center Networking\, Smart Grid\, Processing Networks and Queueing Theory. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:247@lincs.fr DTSTART;TZID=Europe/Paris:20130417T140000 DTEND;TZID=Europe/Paris:20130417T150000 DTSTAMP:20170328T132750Z URL:https://www.lincs.fr/events/2105/ SUMMARY:Controlling Electric Loads to Manage Energy Imbalances in Power DESCRIPTION:Increasing the share of energy produced by wind turbines\, solar photovoltaics\, and solar thermal power plants helps society address many key energy challenges including climate change\, environmental degradation\, and energy security. However\, these renewable energy resources present new challenges\, notably that their\npower production is intermittent u2013 they produce when the wind is blowing and the sun is shining\, not necessarily when we need it.\n\nIn this talk\, I will describe how distributed flexible resources such as commercial buildings\, residential electric loads\, and distributed storage units can support high penetrations of intermittent renewables and provide other services that make the grid run more efficiently and make power less expensive. As an example\, I will show how one can use Markov models and linear/nonlinear filtering techniques to centrally control aggregations of air conditioners to provide power system services with high accuracy\, but low requirements for sensing and communications. Importantly\, the approach ensures that control actions are non-disruptive to the consumer. I find that\, depending on the performance required\, loads may not need to provide state information to the central controller in real time or at all\, which keeps installation and operation costs low. Additionally\, I will discuss a number of practical issues including estimates of the resource size and revenue potential. Finally\, I will describe several new research directions including modeling load aggregations as uncertain reserves for day-ahead power system planning and real-time security.\n\nBiography: Johanna Mathieu is a postdoctoral researcher in the Power Systems Laboratory at ETH Zurich\,Switzerland. In May 2012 she received her PhD in mechanical engineering from the University of California at Berkeley. She has a BS from MIT in ocean engineering and an MS from UC Berkeley in mechanical engineering. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:246@lincs.fr DTSTART;TZID=Europe/Paris:20130415T140000 DTEND;TZID=Europe/Paris:20130415T150000 DTSTAMP:20190122T074651Z URL:https://www.lincs.fr/events/ndn-reaching-3-results-and-challenges-a-pe rsonal/ SUMMARY:NDN Reaching 3: Results and Challenges -- A Personal Perspective DESCRIPTION:In this talk I plan to do a quick walk-through for part of the works we have done over the last 2.5 years. More specifically I will discuss what we have learned in packet forwarding area and a new perspective on the relation between routing and forwarding planes (or control and data planes\, as they are called today). I will also describe a few new applications we have developed over NDN and what we have learned in the process. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:245@lincs.fr DTSTART;TZID=Europe/Paris:20130410T140000 DTEND;TZID=Europe/Paris:20130410T150000 DTSTAMP:20190122T074548Z URL:https://www.lincs.fr/events/robust-mobile-wireless-networking/ SUMMARY:Robust Mobile Wireless Networking DESCRIPTION:Cellular wireless networks are expanded to support ultra high speed multimedia applications and incorporate the use of next generation energy efficient micro base stations in supporting much higher density of mobile stations. The operations of neighborhood base station nodes are coordinated in a cross-layer manner to mitigate interference\, adapt to traffic rate fluctuations and autonomously react to failure events. In turn\, mobile ad hoc networking mechanisms are investigated for multitude of applications\, when the involved networking systems do not make use of a permanent\nbackbone infrastructure. Hybrid architectures include systems that require dynamically adaptive multi hop access to backbone systems\, and such\nthat demand resilient access and rapid adaptations to communications system degradations. Applications are planned for hybrid systems that\ninclude vehicular networks that combine the use of multi hop ad hoc routing techniques\, WiFi\, cellular wireless access technologies\, and cloud computing architectures. We will review our recent research developments and studies of such network systems\, selecting from the following topics:\n\n1. For cellular wireless networks : adaptive rate/power scheduling for multicasting and unicasting\; micro base station aided resilient failover.\; heterogeneous operations under the use of micro and macro base station layouts\; design of resilient public safety network systems.\n\n2. Vehicular ad hoc networks (VANETs): Location aware multicast packet distributions to highway vehicles using inter-vehicular wireless networking protocols.\n\n3. Mobile ad hoc networks: mobile backbone networking (MBN).\n\nBiography:\n\nIzhak Rubin received the B.Sc. and M.Sc. from the Technion\, Israel\, and the Ph.D. degree from Princeton University\, Princeton\, NJ\, USA\, in Electrical Engineering. Since 1970\, he has been on the faculty of the UCLA School of Engineering and Applied Science where he is currently a Distinguished Professor in the Electrical Engineering Department. Dr. Rubin has had extensive research\, publications\, consulting\, and industrial experience in the design and analysis of commercial and military computer communications and telecommunications systems and networks. Recent R&\;D projects include network design\, simulation\, management\, and planning tools for network modeling and analysis\, multi-task resource allocation\, unmanned vehicle aided multi-tier ad hoc wireless communications networks\; cross-layer adaptive power\, rate and routing for mobile wireless cellular and ad hoc networks. He serves as co-director of the UCLA Public Safety Network Systems Laboratory. During 1979-1980\, he served as Acting\nChief Scientist of the Xerox Telecommunications Network. He served as co-chairman of the 1981 IEEE International Symposium on Information\nTheory\; as program chairman of the 1984 NSF-UCLA workshop on Personal Communications\; as program chairman for the 1987 IEEE INFOCOM\nconference\; and as program co-chair of the IEEE 1993 workshop on Local and Metropolitan Area networks. Dr. Rubin is a Life Fellow of IEE.\nHe has served as an editor of the IEEE Transactions on Communications\, Wireless Networks journal\, Optical Networks magazine\, IEEE JSAC issue\non MAC techniques\, Communications Systems journal\, Photonic Networks Communications journal\, and has contributed chapters to texts and encyclopedia on telecommunications systems and networks. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:244@lincs.fr DTSTART;TZID=Europe/Paris:20130329T140000 DTEND;TZID=Europe/Paris:20130329T150000 DTSTAMP:20190122T074203Z URL:https://www.lincs.fr/events/optimization-of-decentralized-partially-ob servable-systems-in-cognitive-radio-networks/ SUMMARY:Optimization of Decentralized Partially Observable Systems in Cognitive Radio Networks DESCRIPTION:We consider a non-cooperative Dynamic Spectrum Access (DSA) game where Secondary Users (SUs) access opportunistically the spectrum licensed for Primary Users (PUs). As SUs spend energy for sensing licensed channels\, they may choose to be inactive during a given time slot in order to save energy. Then\, there exists a tradeoff\nbetween large packet delay\, partially due to collisions between SUs\, and high-energy consumption spent for sensing the occupation of licensed channels. To overcome this problem\, we take into account packet delay and energy consumption into our framework. Due to the partial spectrum sensing\, we use a Partial Observable Stochastic Game (POSG) formalism\, and we analyze the existence and some properties of the Nash equilibrium using a Linear Program (LP). We identify a paradox:\nwhen licensed channels are more occupied by PUs\, this may improve the spectrum utilization by SUs. Based on this observation\, we propose a Stackelberg formulation of our problem where the network manager may increase the occupation of licensed channels in order to improve the SUs average throughput. We prove the existence of a Stackelberg equilibrium and we provide some simulations that validate our theoretical findings.\n\n \;\n\n \; CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:243@lincs.fr DTSTART;TZID=Europe/Paris:20130320T140000 DTEND;TZID=Europe/Paris:20130320T150000 DTSTAMP:20170328T132648Z URL:https://www.lincs.fr/events/capturing-the-sinr-in-cellular-networks-wi th-poisson-processes/ SUMMARY:Capturing the SINR in cellular networks with Poisson processes DESCRIPTION:The steady rise of user-traffic in wireless cellular networks has resulted in the need for developing robust and accurate models of various performance metrics. A key metric of these networks is the signal-to-interference-and-noise-ratio (SINR) experienced by a typical user. For tractability\, often the positions of base stations in such networks are modelled by Poisson point processes whereas actual deployments often more resemble lattices (e.g. hexagonal). Strikingly\, under log-normal shadowing it has been observed that the SINR experienced by a typical user is more accurate in a Poisson model than a hexagonal model. In this talk we seek to explain this interesting observation by way of a convergence result. Furthermore\, we present numerically tractable\, explicit integral expressions for the distribution of SINR of a cellular network modelled by Poisson process. Our model incorporates a power-law path-loss model with arbitrarily distributed shadowing. The results are valid in the whole domain of SINR and\, unlike previous methods\, do not require the inversion of Laplace transforms.Based on joint work in collaboration with B. Blaszczyszyn and M.K. Karray. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:242@lincs.fr DTSTART;TZID=Europe/Paris:20130319T150000 DTEND;TZID=Europe/Paris:20130319T160000 DTSTAMP:20170328T132635Z URL:https://www.lincs.fr/events/lingering-issues-in-distributed-scheduling / SUMMARY:Lingering issues in distributed scheduling DESCRIPTION:Le prochain séminaire DYOGEN\n\n\n\nRecent advances have resulted in queue-based algorithms for medium access control which operate in a distributed fashion\, and yet achieve the optimal throughput performance of centralized scheduling algorithms. However\, fundamental performance bounds reveal that the "cautious" activation rules involved in establishing throughput optimality tend to produce extremely large delays\, typically growing exponentially in 1/(1-r)\, with r the load of the system\, in contrast to the usual linear growth.\nMotivated by that issue\, I will discuss in this talk the extent to which more "aggressive" schemes can improve the delay performance. In the simplest possible scenario\, I will show how aggressive activation rules induce a lingering effect\, where individual nodes retain possession of a shared resource for excessive lengths of time even while a majority of other nodes idle. Using central limit theorem type arguments\, it can be proved that the idleness induced by the lingering effect may cause the delays to grow with 1/(1-r) at a quadratic rate.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:241@lincs.fr DTSTART;TZID=Europe/Paris:20130313T140000 DTEND;TZID=Europe/Paris:20130313T150000 DTSTAMP:20170328T132012Z URL:https://www.lincs.fr/events/fluid-limit-approximations-of-bandwidth-sh aring-networks-withrate-constraints/ SUMMARY:Fluid limit approximations of bandwidth-sharing networks withrate constraints DESCRIPTION:Bandwidth-sharing networks\, as introduced by Massoulie &\; Roberts (1998)\, model the dynamic interaction among an evolving population of elastic flows that compete for several links. The main area of application of such models is telecommunications media\, e.g. Internet congestion control. With policies based on optimization procedures\, bandwidth-sharing networks are of interest both from a Queueing Theory and Operations Research perspective.In this work\, we focus on the regime when link capacities and arrival rates are of a large order of magnitude compared to transfer rates of individual flows\, which is standard in practice. Bandwidth-sharing networks are rather complicated systems (we operate with measure-valued processes to study them)\, and under general structural and stochastic assumptions they resist exact analysis. So we resort to fluid limit approximations. Under general assumptions\, we derive the fluid limit for the network evolution in the entire time horizon (extending the corresponding result by Reed and Zwart\n(2010) for Markovian assumptions). Also\, for a wide class of networks\, we develop polynomial-time computable fixed-point approximations for their\nstationary distributions. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:240@lincs.fr DTSTART;TZID=Europe/Paris:20130306T140000 DTEND;TZID=Europe/Paris:20130306T150000 DTSTAMP:20190122T073555Z URL:https://www.lincs.fr/events/v-ndn-vehicular-named-data/ SUMMARY:V-NDN: Vehicular Named Data DESCRIPTION:In near future\, a car will be equipped with a variety sensors and wireless interfaces such as 3G/LTE\, WiMAX\, WiFi\, or DSRC/WAVE. Our vision is to enable vehicles to communicate with each other and with the infrastructure over any and all physical communication channels\, as soon as any channel comes into existence and as long as it is available. Although over the years many research papers have been published for automotive research\, in reality by and large today's vehicles are connected only through cellular networks to centralized servers. Automotive research such as ad-hoc networking and delay tolerant networking are still far from completion and less likely to deploy. We believe the root cause of this insoluble problem in networking vehicles is IP's communication model\, where IP creates its own name space\, the IP address space\, assigns IP addresses to every communicating end point\, and then encapsulates each piece of application data into an IP packet. This whole process\ninsulates applications from data delivery layer. Taking the named-data networking (NDN) as the starting point\, we are developing V-NDN\, a\nsingle framework to realize our vision. NDN identifies named data as the focal point in communication. Utilizing the fact that all data communications\nhappen within established application context\, and that nodes running the same applications decide what data they want to get\, NDN lets individual\nnodes to request the desired data using application data names directly. Data names are from applications\, they identify data directly\; they exist once\napplications are running\, independent from time-varying connectivity in an ad hoc environment. This enable data to exist in the absence of connectivity\, and to be exchanged over any physical connectivity once it comes into existence.We have designed and developed V-NDN and demonstrated that our design indeed allowed vehicles to utilize all available channels to communicate\; they can effectively communicate with\ncentralized servers as well as with each other to exchange application data in completely ad hoc manner. In this talk we will go over the design\nchoices and the preliminary results from our deployment. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:239@lincs.fr DTSTART;TZID=Europe/Paris:20130305T140000 DTEND;TZID=Europe/Paris:20130305T160000 DTSTAMP:20170328T131951Z URL:https://www.lincs.fr/events/algorithms-on-evolving-graphs/ SUMMARY:Algorithms on evolving graphs. DESCRIPTION: \;\nAlgorithms on evolving graphs. Aris Anagnostopoulos\, Ravi Kumar\, Mohammad Mahdian\, Eli Upfal\, and Fabio Vandin. In Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS '12). ACM\, New York\, NY\, USA\, 149-160.\nSorting and selection on dynamic data. Aris Anagnostopoulos\, Ravi Kumar\, Mohammad Mahdian\, Eli Upfal\, Theoretical Computer Science\, Volume 412\, Issue 24\, 27 May 2011\, Pages 2564-2576. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:238@lincs.fr DTSTART;TZID=Europe/Paris:20130227T140000 DTEND;TZID=Europe/Paris:20130227T140000 DTSTAMP:20170328T131940Z URL:https://www.lincs.fr/events/on-the-design-of-architectures-and-algorit hms-to-support-content-oriented-functionalities-in-high-speed-network-equi pments/ SUMMARY:On the design of architectures and algorithms to support content-oriented functionalities in high speed network equipments DESCRIPTION:The integration of content oriented functionalities in network equipments is of critical importance for the deployment of future content delivery infrastructures. However\, as todayu2019s high-speed network equipments are mostly designed to carry traffic from one location of the network to another by means of IP address information\, this integration imposes severe changes to hardware and software technologies. In this talk we focus on system design and evaluation of the basic building blocks enabling content-oriented communication primitives in network equipments. Specifically\, we present challenges and solutions to realize name-based forwarding\, packet-level storage management and content-based temporary state at high speed. Finally\, we briefly introduce our on-going work on the implementation of our solutions on high-speed hardware and software platforms\, and on the evolution of our designs to support enhanced content-oriented mechanisms. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:237@lincs.fr DTSTART;TZID=Europe/Paris:20130213T140000 DTEND;TZID=Europe/Paris:20130213T150000 DTSTAMP:20170328T131933Z URL:https://www.lincs.fr/events/universality-and-phase-transition-in-compr essed-sensing/ SUMMARY:Universality and Phase Transition in Compressed Sensing. DESCRIPTION:Abstract: I will start with an introduction on compressed sensing. Then I will talk about approximate message passing algorithms and their connection to the universality of a certain phase transition arising in polytope geometry and compressed sensing. Joint work with M. Bayati and A. Montanari (Stanford) CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:236@lincs.fr DTSTART;TZID=Europe/Paris:20130206T140000 DTEND;TZID=Europe/Paris:20130206T150000 DTSTAMP:20170328T131926Z URL:https://www.lincs.fr/events/ipv6-migration-and-carrier-grade-nat-cgn/ SUMMARY:IPv6 Migration and Carrier-Grade NAT (CGN) DESCRIPTION:Abstract:\nIPv4 address exhaustion triggered two parallel efforts: the migration to IPv6\, and the deployment of IPv4 service continuity technologies\, for the most part based on Carrier-Grade NAT. This talk will provide a broad overview of the current situation with IPv6 migration\, will explain what the major actors are currently doing\, and will try to provide some insight about the future. In particular\, CGN and its impacts will be examined. Related standardization efforts will be discussed as well.\n\nBiography: Simon Perreault is a network engineering consultant with Viagénie\, a Canadian firm. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:235@lincs.fr DTSTART;TZID=Europe/Paris:20130130T140000 DTEND;TZID=Europe/Paris:20130130T150000 DTSTAMP:20170328T131916Z URL:https://www.lincs.fr/events/a-pricing-mechanism-and-revenue-sharing-in -network-service-providers-alliances/ SUMMARY:A Pricing Mechanism and Revenue Sharing in Network Service Providers Alliances DESCRIPTION:\n\n\nDate:\n30/01/2013\,  14h - 15h\n\n\nRoom:\nLINCS\, salle de conseil\n\n\nSpeaker:\nIsabel Amigo (Telecom Bretagne)\n\n\nTalk:\nA Pricing Mechanism and Revenue Sharing in Network Service Providers Alliances\n\n\nAbstract:\nNetwork Service Providers alliances are envisioned to emerge in the near future as a means of selling end-to-end quality assured services through interdomain networks. Several aspects of such a community must be discussed in order to assure its economical and technical viability.  Within the economic ones\, pricing and revenue sharing are key aspects on which all alliance's members must agree. In this context\, we present a framework where services are sold via first-price auctions and incomes are formulated as the solution of  a Network Utility Maximization problem. Then\, we discuss the revenue sharing problem in such context\, express the desirable properties of a revenue sharing method\, argue why the existing methods are not suitable\, and propose a family of solutions.\n\n\nBiography:\nIsabel Amigo was born in January 23th\, 1984 in Montevideo\, Uruguay. Since 2007 she holds a degree in Electrical Engineering from Universidad de la República\, Uruguay. Since 2006 she is a Research and Teaching assistant at the Electrical Engineering department of the School of Engineering\, Universidad de la República\, Uruguay. In late 2007 she joins the technical team of the National  digital inclusion plan Plan Ceibal \, where she is later on in charge of the Projects department and the Research and Development area. On March 2010 she leaves Plan Ceibal in order to pursue a PhD thesis. She is currently a PhD candidate at Telecom Bretagne (France) and Universidad de la República (Uruguay)\, in a co-advised program\, under the advisory of Prof. Sandrine Vaton and Prof. Pablo Belzarena.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:234@lincs.fr DTSTART;TZID=Europe/Paris:20130116T140000 DTEND;TZID=Europe/Paris:20130116T150000 DTSTAMP:20170328T131423Z URL:https://www.lincs.fr/events/french-internet-resilience/ SUMMARY:French Internet resilience DESCRIPTION:\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nAbstract:The French Network and Information Security Agency (FNISA) and theFrench Network Information Center (AFNIC) have recently published adetailed report on the French Internet resilience. This documentis based on measures performed for two key protocols for the Internet :Border Gateway Protocol (BGP) and Domain Name System (DNS).In order to evaluate the resilience of BGP\, several indicators have beenused:(i) the correct declaration of routing information to regional informationregistries which is necessary to check messages received by routers\;(ii) the connectivity between operators in order to evaluate the risk ofa full disconnection\;(iii) the frequency of prefix hijacking by which an operator announces orrelays illegitimate routing information.In order to estimate this indicators\, the FNISA has analyzed all BGPmessages of four major French network operators over a period of 11 months.Concerning the DNS protocol\, the considered indicators are:(i) the distribution of name servers among countries and operators\;(ii) the number of unpatched servers still vulnerable to the Kaminskyvulnerability\;(iii) the deployment of protocols such as IPv6 and DNS Security Extensions(DNSSEC).Measures have been performed in two ways: active measures on DNS serversof .fr domains and passive measures by observing the traffic onauthoritative servers of .fr administrated by AFNIC.The aim of this talk is to present the results of this first report andto introduce the new indicators and results which have been obtainedsince then. In the same time\, we will introduced several opentheoritical problems linked to this study.\n\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:233@lincs.fr DTSTART;TZID=Europe/Paris:20121219T140000 DTEND;TZID=Europe/Paris:20121219T150000 DTSTAMP:20170328T131416Z URL:https://www.lincs.fr/events/tbd/ SUMMARY:Better routing with hyperbolic geometry DESCRIPTION:\n\n\nDate:\n19/12/2012\,  LINCS Salle de Conseil\n\n\nRoom:\n14h-15h\n\n\nSpeaker:\nMarc Crovella (Boston University)\n\n\nTalk:\n\n\n\n\n\n\n\nAbstract:\nIn the constant search for simple and efficient routing algorithms\,a particularly attractive approach is greedy routing:  every nodeis assigned a coordinate\, and routing consists of simply forwarding tothe neighbor closest to the destination.   Unfortunately\, in our(Euclidean) world\, this strategy is prone to failure.   In this talkI will describe how a small change -- working in Hyperbolic space insteadof Euclidean space -- allows one to guarantee that greedy routing is alwayssuccessful.I will review the properties of hyperbolic space for this problem\, andthen describe how to use it for provably successful greedy routing on a staticgraphs.Next I will describe how to extend this approach to growing graphs.Finally\,I will discuss strategies to make this sort of routing efficient -- that\,toensure that paths through the network are short.This is joint work with Andrej Cvetkovski\n\n\n\n\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:232@lincs.fr DTSTART;TZID=Europe/Paris:20121205T140000 DTEND;TZID=Europe/Paris:20121205T150000 DTSTAMP:20170328T131406Z URL:https://www.lincs.fr/events/1402/ SUMMARY:Next Steps towards IP-optical Service Convergence: A Network Management Perspective DESCRIPTION:\n\n\nDespite the steady and significant increase in Internet traffic\, today's Internet topologies are stable\, reliable\, and - underutilized. This is mainly due to the proven ISP practice to overprovision IP links\, - often up to seventy percent\, thus allowing for accommodation of unpredictable flows\, while keeping the network stable and resilient against attacks and failures. Even with major benefits\, the practice of overprovision leads to high capital and operational expenses\, as well as higher energy consumption. At first glance\, dynamic optical circuits can address the downsides: optical circuits can be setup to bypass any congested or faulty IP links and are one of the "greenest" technologies. However\, the two networks -- optical and Internet\, have evolved as two fundamentally different and separately managed systems\, and cannot easily operate in harmony. In this talk\, I will discuss why past approaches to deploy dynamic optical circuits have not been widely adopted for IP routing\, - from the point of view of network management\, and present our research ideas on how Internet can effectively use optical circuits. I will talk about the importance of new systems research and present new directions in theoretical studies in this field\, and also give a practical outlook from our EU Project ONE (http://www.ict-one.eu).\n\n\nBiography:\nAdmela Jukan received the M.Sc. degree in Information Technologies from the Politecnico di Milano\, Italy\, and the Dr. techn. degree (cum laude) in Electrical and Computer Engineering from the Technische Universität Wien\, Austria. She received her Dipl. -Ing. degree from the Fakultet Elektrotehnike i Racunarstva (FER)\, in Zagreb\, Croatia.She is Chair Professor of Communication Networks in Electrical and Computer Engineering Department at the Technische Universität Braunschweig in Germany. Prior to coming to TU Braunschweig\, she was research faculty at the Institut National de la Recherche Scientifique (INRS)\, University of Illinois at Urbana Champaign (UIUC) and Georgia Tech (GaTech). In 1999 and 2000\, she was a visiting scientist at Bell Labs\, Holmdel\, NJ. From 2002-2004\, she served as Program Director in Computer and Networks System Research at the National Science Foundation (NSF) in Arlington\, VA.  Dr. Jukan serves as Associate Technical Editor for IEEE Communications Magazine and IEEE Network. She is a co-Editor in Chief of the Elsevier Journal on Optical Switching and Networking (OSN). She is an elected Vice Chair of the IEEE Optical Network Technical Committee\, ONTC (Chair in 2014).  She currently coordinates a collaborative EU project ONE\, focusing on network management convergence of optical networks and the Internet. She is recipient of an Award of Excellence for the BMBF/CELTIC project "100Gb Ethernet" and was also awarded the IBM Innovation Award for applications of parallel computing for rich digital media distribution over optical networks.\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:231@lincs.fr DTSTART;TZID=Europe/Paris:20121128T140000 DTEND;TZID=Europe/Paris:20121128T150000 DTSTAMP:20170328T131358Z URL:https://www.lincs.fr/events/a-network-centric-point-of-view-on-smart-g rids/ SUMMARY:A network-centric point of view on Smart Grids DESCRIPTION:\n\n\nDate:\n28/11/2012\,  LINCS Salle de Conseil\n\n\nRoom:\n14h-15h\n\n\nSpeaker:\nAlexander Pelov (Telecom Bretagne)\n\n\nTalk:\nA network-centric point of view on Smart Grids\n\n\nAbstract:\nThe Smart Grid is the evolution of this complex network\, with one of the major factors being the integration of Machine-to-Machine type communications in every element of this network. This talk will concentrate on presenting the ongoing and future projects related to Smart Grids in Telecom Bretagne\, such as networking protocols for Home Area Networks (HAN) and Neighborhood Area Networks (NAN).\n\n\nBiography:\nAlexander Pelov is an Associate Professor of Computer Networks in the "Networking\, Multimedia and Security" department at the Graduate Engineering School Telecom Bretagne\, France. His research focuses on networking protocols for Machine-to-Machine communications\, energy efficiency in wireless networks\, and protocols and algorithms for Smart Grid applications\, most notably related to Smart Meters\, sub-metering and Electrical Vehicles. He received his M.Sc. (2005) from the University of Provence\, France and Ph.D. (2009) from the University of Strasbourg\, France\, both in Computer Science.\n\n\n CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:230@lincs.fr DTSTART;TZID=Europe/Paris:20121121T140000 DTEND;TZID=Europe/Paris:20121121T150000 DTSTAMP:20190124T111826Z URL:https://www.lincs.fr/events/iterative-power-packing-for-distributed-mu ltiple-access-in-wireless-networks/ SUMMARY:Iterative Power Packing for Distributed Multiple Access in Wireless Networks DESCRIPTION:We address the problem of designing distributed Multiple Access Control algorithms for wireless networks under the SINR interference model. In the proposed framework\, time is divided into frames consisting of a fixed number of slots\, and transmitters may adapt the power levels used in the various slots. We aim at developing fully distributed multiple access algorithms that are throughput-optimal in the sense that they perform as well as centralized scheduling algorithms. These algorithms based on a simple power control mechanism\, referred to as Power Packing. This mechanism allows each transmitter to tune their power levels in the different slots so as to achieve a target rate while minimizing the number of slots actually used. The proposed algorithms are throughput-optimal\, simple and do not require any message passing: each transmitter adapts its power levels depending on the observed interference levels in the various slots. We illustrate the efficiency of our algorithms using numerical experiments. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:229@lincs.fr DTSTART;TZID=Europe/Paris:20121114T140000 DTEND;TZID=Europe/Paris:20121114T150000 DTSTAMP:20170328T131338Z URL:https://www.lincs.fr/events/auctions-of-licensed-vs-unlicensed-use-of- spectrum/ SUMMARY:Auctions of Licensed vs Unlicensed Use of Spectrum DESCRIPTION:Auctions have regained interest from researchers due to its differentnew applications (Google AdWords auctions\, cloud computing auctions\,privacy auctions\, and white spaces spectrum auctions). In this work inparticular we explore auctions for spectrum that can be allocatedeither to a Abstract single bidder (for licensed use) or to a collection ofbidders (for unlicensed use). In this auction\, a number of individualbidders all try to get the spectrum for their exclusive use and agroup of other bidders try to get the spectrum for their collectiveuse. The objective is to study these auctions and compare theirdifferent properties. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:228@lincs.fr DTSTART;TZID=Europe/Paris:20121024T140000 DTEND;TZID=Europe/Paris:20121024T150000 DTSTAMP:20190124T111603Z URL:https://www.lincs.fr/events/a-browser-based-network-measurement-platfo rm/ SUMMARY:A Browser-based Network Measurement Platform DESCRIPTION:For analyzing network performance issues\, there can be great utility in having the capability to measure directly from the perspective of end systems. Because end systems do not provide any external programming interface to measurement functionality\, obtaining this capability today generally requires installing a custom executable on the system\, which can prove prohibitively expensive. In this work we leverage the ubiquity of web browsers to demonstrate the possibilities of browsers themselves offering such a programmable environment. We present Fathom\, a Firefox extension that implements a number of measurement primitives that enable websites or other parties to program network measurements using JavaScript. Fathom is lightweight\, imposing <\; 3.2% overhead in page load times for popular web pages\, and often provides 1 ms timestamp accuracy. We demonstrate Fathom's utility with three case studies: providing a JavaScript version of the Netalyzr network characterization tool\, debugging web access failures\, and enabling web sites to diagnose performance problems of their clients. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:227@lincs.fr DTSTART;TZID=Europe/Paris:20121017T140000 DTEND;TZID=Europe/Paris:20121017T150000 DTSTAMP:20170328T131317Z URL:https://www.lincs.fr/events/sequential-anomaly-detection-in-a-batch-wi th-growing-number-of-tests-application-to-network-intrusion-detection-2/ SUMMARY:Sequential Anomaly Detection in a Batch with Growing Number of Tests: Application to Network Intrusion Detection DESCRIPTION:For high (N)-dimensional feature spaces\, we consider detection of an unknown\, anomalous class of samples amongst a batch of collected samples (of size T)\, under the null hypothesis that all samples follow the same probability law. Since the features which will best identify the anomalies are a priori unknown\, several common detection strategies are:\n\n1) evaluating atypicality of a sample (its p-value) based on the null distribution defined on the full N-dimensional feature space\;\n\n2) considering a (combinatoric) set of low order distributions\, e.g.\, all singletons and all feature pairs\, with detections made based on the smallest p-value yielded over all such low order tests.\n\nThe first approach relies on accurate estimation of the joint distribution\, while the second may suffer from increased false alarm rates as N and T grow. Abstract Alternatively\, inspired by greedy feature selection commonly used in supervised learning\, we propose a novel sequential anomaly detection procedure with a growing number of tests. Here\, new tests are (greedily) included only when they are needed\, i.e.\, when their use (on currently undetected samples) will yield greater aggregate statistical significance of (multiple testing corrected) detections than obtainable using the existing test cadre. Our approach thus aims to maximize aggregate statistical significance of all detections made up until a finite horizon. Our method is evaluated\, along with supervised methods\, for a network intrusion domain\, detecting Zeus bot command-and-control (i.e.\, intrusion) packet flows embedded amongst (normal) Web flows. It is shown that judicious feature representation is essential for discriminating Zeus from Web.\n\nThis work in collaboration with D.J. Miller and F. Kocak.\n\nBiography\n\nGeorge Kesidis received his M.S. and Ph.D. in EECS from U.C. Berkeley in 1990 and 1992 respectively. He was a professor in the E&\;CE Dept of the University of Waterloo\, Canada\, from 1992 to 2000. Since 2000\, he has been a professor of CSE and EE at the Pennsylvania State University. His research\, including several areas of computer/communication networking and machine learning\, has Biography been primarily supported by NSERC of Canada\, NSF and Cisco Systems URP. He served as the TPC co-chair of IEEE INFOCOM 2007 among other networking and cyber security conferences. He has also served on the editorial boards of the Computer Networks Journal\, ACM TOMACS and IEEE Journal on Communications Surveys and Tutorials. Currently\, he is an Intermittent Expert for the National Science Foundation's Secure and Trustworthy Cyberspace (SaTC) program.\n\nHis home page is http://www.cse.psu.edu/~kesidis CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:226@lincs.fr DTSTART;TZID=Europe/Paris:20121010T140000 DTEND;TZID=Europe/Paris:20121010T150000 DTSTAMP:20190124T095430Z URL:https://www.lincs.fr/events/joint-complexity-of-short-texts-or-how-to- spy-twitter/ SUMMARY:Joint complexity of short texts or how to spy Twitter DESCRIPTION:Twitter produces several millions of short texts per hour. Monitoring information tendencies has become a key business. In particular the content provider can detect in advance which movie will be popular and move it toward proxies before it is too late (ie causes a network/server congestion). In this talk we present the analysis of short texts via joint complexity. The joint complexity of two texts is the number of distinct factors common to both Abstract texts. When the source models of the texts are close then the joint complexity is higher. This technique is applied to DNA sequence analysis because it has a very low overhead. It can now be applied to short text analysis thanks to more accurate theoretical estimate. In particular we show new theoretical results when the sources that generate the texts are Markovian of finite order\, a model that particularly fits well with text generation.\n\nJoint work with W.Szpankowski\, D. Milioris\, B. Berde. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:225@lincs.fr DTSTART;TZID=Europe/Paris:20121003T140000 DTEND;TZID=Europe/Paris:20121003T150000 DTSTAMP:20170328T131256Z URL:https://www.lincs.fr/events/how-much-do-we-benefit-from-cooperation-be tween-pairs-of-neighbouring-base-stations/ SUMMARY:How much do we benefit from cooperation between pairs of neighbouring base stations? DESCRIPTION:In the current work we deal with the problem of base station cooperation in the downlink of infinite wireless cellular networks.The positions of base stations are modeled by a Poisson point process. Each base station can choose to cooperate or not with exactly oneof its Delaunay neighbours in order to provide service to a user located within its cell. The cooperation protocol uses a variation of the so-called Willems' encoderand a fixed total transmission power per user is considered.We analytically derive closed form expressions for the coverage probability and we determine the optimal cooperation zones in the network.Numerical evaluation shows benefits in coverage\, compared to the common cellular architecture. These however are not very high due to thedeterioration in SINR caused by increased outer-cell total interference. Joint work with F. Baccelli. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:224@lincs.fr DTSTART;TZID=Europe/Paris:20120919T140000 DTEND;TZID=Europe/Paris:20120919T150000 DTSTAMP:20220210T141352Z URL:https://www.lincs.fr/events/towards-less-manipulable-voting-systems/ SUMMARY:Towards less Manipulable Voting Systems DESCRIPTION:Voting systems can be used in any situation where several entities are to make a decision together. However\, the sincere vote may lead to a situation that is not a generalized Nash equilibrium: a group of electors can hide their sincere preferences in order to change the outcome to a candidate they prefer. In that case\, we say that the situation is manipulable (i.e. susceptible to tactical voting). Gibbard-Satterthwaite theorem (1973) states that for 3 candidates and more\, all voting systems but dictatorship are vulnerable to manipulation. So we would like to know\, amongst "reasonable" voting systems\, which ones are manipulable with a probability as little as possible. We show that\, under quite weak assumptions on the meaning of "reasonable"\, such optimal voting systems can be found in the class of systems that depend only on the electors' preorders of preferences over the candidates and meet Condorcet criterion. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:223@lincs.fr DTSTART;TZID=Europe/Paris:20120912T140000 DTEND;TZID=Europe/Paris:20120912T150000 DTSTAMP:20170328T131241Z URL:https://www.lincs.fr/events/error-free-perfect-secrecy-systems-2/ SUMMARY:Error Free Perfect Secrecy Systems DESCRIPTION:Shannon's fundamental bound for perfect secrecy stated that the entropy of the secret message U cannot be larger than the entropy of the secret key R shared by the sender and the legitimated receiver. Massey gave an information-theoretic proof of this result and the proof did not require U and R to be independent. By adding an extra assumption that I(U.R) = 0\, we show a tighter bound on H(R) in this talk. Our bound states that the logarithm of the message sample size cannot be larger than the entropy of the secret key. We also consider the case that a perfect secrecy system is used multiple times. A new parameter\, namely expected key consumption\, is defined and justified. We show the existence of a fundamental trade-off between the expected key consumption and the number of channel uses for transmitting a cipher-text. A coding scheme\, which is optimal under certain conditions\, is introduced. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:222@lincs.fr DTSTART;TZID=Europe/Paris:20120910T140000 DTEND;TZID=Europe/Paris:20120910T150000 DTSTAMP:20170328T131224Z URL:https://www.lincs.fr/events/evolving-internet-into-the-future-via-name d-data-networking/ SUMMARY:Evolving Internet into the Future via Named Data Networking DESCRIPTION:While the Internet has succeeded far beyond expectations\, the success has also stretched its initial design assumptions. Since applications operate in terms of data and more end points become mobile\, it becomes increasingly difficult and inefficient to satisfy IP's requirement of determining exactly where (at which IP address) to find desired data. The Named Data Networking project aims to carry the Internet into the future through a conceptually simple yet transformational architecture shift\, from today's focus on where -- addresses and hosts -- to what -- the data that users and applications care about.  In this talk I will present the basic design of NDN and our initial results. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:221@lincs.fr DTSTART;TZID=Europe/Paris:20120905T140000 DTEND;TZID=Europe/Paris:20120905T150000 DTSTAMP:20170328T131214Z URL:https://www.lincs.fr/events/nsf-center-for-science-of-information/ SUMMARY:NSF Center for Science of Information DESCRIPTION:"Information is the distinguishing mark of our era\, permeating every facet of our lives. An ability to understand and harness information has the potential for significant advances. Our current understanding of information dates back to Claude Shannon's revolutionary work in 1948\, resulting in a general mathematical theory of reliable communication that not only formalized the modern digital communication and storage principles but also paved the way for the Internet\, DVDs and iPods of today. While Shannon's information theory has had profound impact\, its application beyond storage and communication poses foundational challenges. In 2010 the National Science Foundation established the Science &\; Technology Center for the Science of Information to meet the new challenges posed by the rapid advances in networking\, biology and knowledge extraction. Its mission is to advance science and technology through a new quantitative understanding of the representation\, communication and processing of information in biological\, physical\, social and engineering systems. Purdue University leads nine partner institutions: Berkeley\, Bryn Mawr\, Howard\, MIT\, Princeton\, Stanford\, Texas A&\;M\, UCSD\, and UIUC (cf. http://cacm.acm.org/magazines/2011/2/104389-information-theory-after-shanno n/fulltext).\n\nIn this talk\, after briefly reviewing main results of Shannon\, (cf. http://cacm.acm.org/magazines/2011/2/104389-information-theory-after-shanno n/fulltext) we attempt to identify some features of information encompassing structural\, spatio-temporal\, and semantic facets of information. We present two new results: One on a fundamental lower bound for structural compression and a novel algorithm achieving this lower bound for graphical structures. Second\, on the problem of deinterleaving Markov processes over disjoint finite alphabets\, which have been randomly interleaved by a finite-memory switch.\n\nBiography: Wojciech Szpankowski is Saul Rosen Professor of Computer Science and (by courtesy) Electrical and Computer Engineering at Purdue University where he teaches and conducts research in analysis of algorithms\, information theory\, bioinformatics\, analytic combinatorics\, random structures\, and stability problems of distributed systems. He received his M.S. and Ph.D. degrees in Electrical and Computer Engineering from Gdansk University of Technology. He held several Visiting Professor/Scholar positions\, including McGill University\, INRIA\, France\, Stanford\, Hewlett-Packard Labs\, Universite de Versailles\, University of Canterbury\, New Zealand\, Ecole Polytechnique\, France\, and the Newton Institute\, Cambridge\, UK. He is a Fellow of IEEE\, and the Erskine Fellow. In 2010 he received the Humboldt Research Award. In 2001 he published the book Average Case Analysis of Algorithms on Sequences\, John Wiley &\; Sons\, 2001. He has been a guest editor and an editor of technical journals\, including Theoretical Computer Science\, the ACM Transaction on Algorithms\, the IEEE Transactions on Information Theory\, Foundation and Trendsin Communications and Information Theory\, Combinatorics\, Probability\, and Computing\, and Algorithmica. In 2008 he launched the interdisciplinary Institute for Science of Information\, and in 2010 he became the Director of the newly established NSFScience and Technology Center for Science of Information. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:220@lincs.fr DTSTART;TZID=Europe/Paris:20120901T140000 DTEND;TZID=Europe/Paris:20120901T150000 DTSTAMP:20170328T131206Z URL:https://www.lincs.fr/events/acm-sigcomm-information-centric-networking -icn-preview-talks/ SUMMARY:ACM SIGCOMM Information Centric Networking (ICN) preview talks DESCRIPTION:About 4 talks\, more details will follow. CATEGORIES:Previews LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:219@lincs.fr DTSTART;TZID=Europe/Paris:20120720T140000 DTEND;TZID=Europe/Paris:20120720T150000 DTSTAMP:20190124T094354Z URL:https://www.lincs.fr/events/controlling-queue-delay-2/ SUMMARY:Controlling queue delay DESCRIPTION:Nearly three decades after it was first diagnosed\, the persistently full buffer problem\, recently exposed as part of bufferbloat is still with us and made increasingly critical by two trends. First\, cheap memory and a more is better mentality have led to the inflation and proliferation of buffers. Second\, dynamically varying path characteristics are much more common today and are the norm at the consumer Internet edge. Reasonably sized buffers become extremely oversized when link rates and path delays fall below nominal values.The solution for persistently full buffers\, AQM (active queue management)\, has been known for two decades but has not been widely deployed because of implementation difficulties and general misunderstanding about Internet packet loss and queue dynamics. Unmanaged buffers are more critical today since buffer sizes are larger\, delay-sensitive applications are more prevalent\, and large (streaming) downloads common. The continued existence of extreme delays at the Internet edge can impact its usefulness and hamper the growth of new applications.This article aims to provide part of the bufferbloat solution\, proposing an innovative approach to AQM suitable for today Internet called CoDel (for Controlled Delay\,). This is a no-knobs AQM that adapts to changing link rates and is suitable for deployment and experimentation in Linux-based routers (as well as silicon).\n\nTalk by Dave Taht on a recent ACM Queue paper by Kathleen Nichols\, Pollere Inc.Van Jacobson\, PARC (just google for the link) CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:218@lincs.fr DTSTART;TZID=Europe/Paris:20120718T140000 DTEND;TZID=Europe/Paris:20120718T150000 DTSTAMP:20170328T131145Z URL:https://www.lincs.fr/events/sinr-diagrams-and-their-application-to-int erference-cancellation-2/ SUMMARY:SINR diagrams and their application to interference cancellation DESCRIPTION:In this talk we will first present what a SINR diagram is and why it is important to the design of efficient algorithms for wireless networks. Then we will discuss the reception zones of a wireless network in the SINR model with receivers that employ interference cancellation (IC). IC is a recently developed technique that allows a receiver to decode interfering signals\, and cancel them from the received signal in order to decode its intended message. We first derive the important topological properties of the reception zones and their relation to high-order Voronoi diagrams and other geometric objects. We then discuss the computational issues that arise when seeking an efficient description of the zones. Our main fundamental result states that although potentially there are exponentially many possible cancellation orderings\, and as a result\, reception zones\, in fact there are much fewer nonempty such zones. We prove a linear bound (hence tight) on the number of zones and provide a polynomial time algorithm to describe the diagram. Moreover\, we introduce a novel parameter\, the Compactness Parameter\, which influences the tightness of our bounds. We then utilize these properties to devise a logarithmic time algorithm to answer point-location queries for networks with IC.\n\nThis work was published in the Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'12).\n\nBiography: Yoram Haddad received his BSc\, Engineer diploma and MSc (Radiocommunications) from SUPELEC in 2004 and 2005\, and his PhD in computer science and networks from Telecom ParisTech in 2010. Since 2010 he is a tenure-track senior lecturer (Assistant Professor) at the Jerusalem College of Technology (JCT) in Jerusalem\, Israel. In parallel\, since 2011 he is a post-doctoral research associate at the Ben- Gurion University (BGU) in Beer-Sheva\, Israel. Yoram's main research interests are in the area of Wireless Networks and Algorithms for networks. He is specifically interested in energy efficient wireless deployment\, Femtocell\, modeling of wireless networks\, wireless application to Intelligent Transportation Systems (ITS) and more recently Wireless Software Defined Networks (SDN). CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:217@lincs.fr DTSTART;TZID=Europe/Paris:20120704T140000 DTEND;TZID=Europe/Paris:20120704T150000 DTSTAMP:20170328T131132Z URL:https://www.lincs.fr/events/netmap-2/ SUMMARY:Netmap DESCRIPTION:Many applications (routers\, traffic monitors\, firewalls\, etc.) need to send and receive packets at line rate even on very fast links. In this paper we present netmap\, a novel framework that enables commodity operating systems to handle the millions of packets per second traversing 1..10 Gbit/s links\, without requiring custom hardware or changes to applications. In building netmap\, we identified and successfully reduced or removed three main packet processing costs: per-packet dynamic memory allocations\, removed by pre-allocating resources. system call overheads\, amortized over large batches. and memory copies\, eliminated by sharing buffers and metadata between kernel and user space\, while still protecting access to device registers and other kernel memory areas. Separately\, some of these techniques have been used in the past. The novelty in our proposal is not only that we exceed the performance of most of previous work\, but also that we provide an architecture that is tightly integrated with existing operating system primitives\, not tied to specific hardware\, and easy to use and maintain. netmap has been implemented in FreeBSD and Linuxfor several 1 and 10 Gbit/s network adapters. In our prototype\,a single core running at 900 MHz can send orreceive 14.88 Mpps (the peak packet rate on 10 Gbit/slinks). This is more than 20 times faster than conventional APIs. Large speed ups (5x and more) are also achieved on user-space Click and other packet forwarding applications using a libpcap emulation library running on top of netmap.\n\nThis work received the Best paper award at USENIX ATC 201. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:216@lincs.fr DTSTART;TZID=Europe/Paris:20120619T180000 DTEND;TZID=Europe/Paris:20120619T181500 DTSTAMP:20170328T131124Z URL:https://www.lincs.fr/events/scientific-workshop-2012-conclusionary-rem arks/ SUMMARY:Scientific Workshop 2012 Conclusionary Remarks DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:215@lincs.fr DTSTART;TZID=Europe/Paris:20120619T160000 DTEND;TZID=Europe/Paris:20120619T163000 DTSTAMP:20220210T133207Z URL:https://www.lincs.fr/events/alcatel-lucent-vision-relevance-lincs/ SUMMARY:Alcatel-Lucent Vision and the Relevance of the LINCS DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:214@lincs.fr DTSTART;TZID=Europe/Paris:20120619T153000 DTEND;TZID=Europe/Paris:20120619T160000 DTSTAMP:20190124T091839Z URL:https://www.lincs.fr/events/towards-sybil-tolerant-systems/ SUMMARY:Towards Sybil-tolerant Systems DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:212@lincs.fr DTSTART;TZID=Europe/Paris:20120619T150000 DTEND;TZID=Europe/Paris:20120619T153000 DTSTAMP:20170328T130954Z URL:https://www.lincs.fr/events/super-scalable-p2p-networks/ SUMMARY:Super-scalable P2P Networks DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:213@lincs.fr DTSTART;TZID=Europe/Paris:20120619T143000 DTEND;TZID=Europe/Paris:20120619T150000 DTSTAMP:20170328T131027Z URL:https://www.lincs.fr/events/platforms-testbeds/ SUMMARY:Platforms and TestBeds DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:211@lincs.fr DTSTART;TZID=Europe/Paris:20120619T140000 DTEND;TZID=Europe/Paris:20120619T143000 DTSTAMP:20211125T122133Z URL:https://www.lincs.fr/events/internet-things/ SUMMARY:Internet of Things DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:210@lincs.fr DTSTART;TZID=Europe/Paris:20120619T120000 DTEND;TZID=Europe/Paris:20120619T124500 DTSTAMP:20190124T092115Z URL:https://www.lincs.fr/events/design-analysis-content-caching-networks/ SUMMARY:Design and Analysis of Content Caching Networks DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:209@lincs.fr DTSTART;TZID=Europe/Paris:20120619T114500 DTEND;TZID=Europe/Paris:20120619T120000 DTSTAMP:20170328T125807Z URL:https://www.lincs.fr/events/diffusion-cascading-behavior-random-networ ks/ SUMMARY:Diffusion and Cascading Behavior in Random Networks DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:208@lincs.fr DTSTART;TZID=Europe/Paris:20120619T111500 DTEND;TZID=Europe/Paris:20120619T114500 DTSTAMP:20190124T092500Z URL:https://www.lincs.fr/events/asynchronous-packet-switching/ SUMMARY:Asynchronous Packet Switching DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:163@lincs.fr DTSTART;TZID=Europe/Paris:20120619T103000 DTEND;TZID=Europe/Paris:20120619T114500 DTSTAMP:20190124T092629Z URL:https://www.lincs.fr/events/big-data-page-ranking/ SUMMARY:Big Data and Page Ranking DESCRIPTION:An introduction to DIteration. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:207@lincs.fr DTSTART;TZID=Europe/Paris:20120618T121500 DTEND;TZID=Europe/Paris:20120618T130000 DTSTAMP:20220210T150416Z URL:https://www.lincs.fr/events/wireless-networks/ SUMMARY:Wireless Networks DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:206@lincs.fr DTSTART;TZID=Europe/Paris:20120618T114500 DTEND;TZID=Europe/Paris:20120618T121500 DTSTAMP:20170328T124850Z URL:https://www.lincs.fr/events/metrology/ SUMMARY:Metrology DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:205@lincs.fr DTSTART;TZID=Europe/Paris:20120618T111500 DTEND;TZID=Europe/Paris:20120618T114500 DTSTAMP:20220210T150447Z URL:https://www.lincs.fr/events/real-time-wireless-networking/ SUMMARY:Real-time Wireless Networking DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:204@lincs.fr DTSTART;TZID=Europe/Paris:20120618T101500 DTEND;TZID=Europe/Paris:20120618T104500 DTSTAMP:20170328T124821Z URL:https://www.lincs.fr/events/content-distribution-information-centric-n etworking-overview-activities-main-results/ SUMMARY:Content Distribution and Information Centric Networking Overview of activities and main results DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:203@lincs.fr DTSTART;TZID=Europe/Paris:20120618T094500 DTEND;TZID=Europe/Paris:20120618T104500 DTSTAMP:20190123T145143Z URL:https://www.lincs.fr/events/network-chip/ SUMMARY:Network on Chip DESCRIPTION: CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:202@lincs.fr DTSTART;TZID=Europe/Paris:20120618T093000 DTEND;TZID=Europe/Paris:20120618T101500 DTSTAMP:20220210T150519Z URL:https://www.lincs.fr/events/openflow-software-defined-networking/ SUMMARY:OpenFlow and Software Defined Networking DESCRIPTION: CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:201@lincs.fr DTSTART;TZID=Europe/Paris:20120618T090000 DTEND;TZID=Europe/Paris:20120618T093000 DTSTAMP:20190123T145414Z URL:https://www.lincs.fr/events/introduction-lincs/ SUMMARY:Introduction of LINCS DESCRIPTION:Daniel Kofman\, the director of LINCS\, introduces the lab. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:200@lincs.fr DTSTART;TZID=Europe/Paris:20120607T140000 DTEND;TZID=Europe/Paris:20120607T150000 DTSTAMP:20170328T124724Z URL:https://www.lincs.fr/events/scaling-analysis-of-a-transient-stochastic -network-trec-seminar-2/ SUMMARY:Scaling Analysis of a Transient Stochastic Network (TREC seminar) DESCRIPTION:In this talk\, we consider a simple transient Markov process with an absorbing point to investigate the qualitative behavior of a large scale storage network of non reliable file servers where files can be duplicated. When the size of the system goes to infinity we show that there is a critical value for the maximum number of files per server such that below this quantity\, the system stays away from the absorbing state\, all files lost\, in a quasi-stationary state where most files have a maximum number of copies. Above this value\, the network looses a significant number of files until some equilibrium is reached. When the network is stable\, we prove that\, with  convenient time scales\, the evolution of the network towards the absorbing state can be described via a stochastic averaging principle. Some extensions of this model will be discussed. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:199@lincs.fr DTSTART;TZID=Europe/Paris:20120606T140000 DTEND;TZID=Europe/Paris:20120606T150000 DTSTAMP:20190122T150918Z URL:https://www.lincs.fr/events/bipartite-graph-structures-for-efficient-b alancing-of-heterogeneous-loads/ SUMMARY:Bipartite graph structures for efficient balancing of heterogeneous loads DESCRIPTION:ACM SIGMETRICS'12 Preview Talk\n\nThis paper considers large scale distributed content serviceplatforms\, such as peer-to-peer video-on-demand systems.Such systems feature two basic resources\, namely storageand bandwidth. Their efficiency critically depends on twofactors: (i) content replication within servers\, and (ii) howincoming service requests are matched to servers holding requestedcontent. To inform the corresponding design choices\,we make the following contributions.We first show that\, for underloaded systems\, so-called pro-portional content placement with a simple greedy strategyfor matching requests to servers ensures full system efficiencyprovided storage size grows logarithmically with the systemsize. However\, for constant storage size\, this strategy undergoesa phase transition with severe loss of efficiency assystem load approaches criticality.To better understand the role of the matching strategy inthis performance degradation\, we characterize the asymptoticsystem efficiency under an optimal matching policy.Our analysis shows that -in contrast to greedy matching-optimal matching incurs an inefficiency that is exponentiallysmall in the server storage size\, even at critical systemloads. It further allows a characterization of content replicationpolicies that minimize the inefficiency. These optimalpolicies\, which differ markedly from proportional placement\,have a simple structure which makes them implementablein practice.On the methodological side\, our analysis of matching performanceuses the theory of local weak limits of randomgraphs\, and highlights a novel characterization of matchingnumbers in bipartite graphs\, which may both be of independentinterest.\n\nJoint work by Mathieu Leconte (Technicolor - INRIA)\, Marc Lelarge (INRIA - Ecole Normale Supérieure) and Laurent Massoulié (Technicolor) CATEGORIES:Previews,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:198@lincs.fr DTSTART;TZID=Europe/Paris:20120530T140000 DTEND;TZID=Europe/Paris:20120530T150000 DTSTAMP:20170328T124637Z URL:https://www.lincs.fr/events/mobile-web-acceleration-challenges/ SUMMARY:Mobile web acceleration challenges DESCRIPTION:Abstract to be added. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:197@lincs.fr DTSTART;TZID=Europe/Paris:20120516T140000 DTEND;TZID=Europe/Paris:20120516T150000 DTSTAMP:20190122T150526Z URL:https://www.lincs.fr/events/distributed-scheduling-algorithm-for-async hronous-input-queued-switches/ SUMMARY:Distributed scheduling algorithm for asynchronous input-queued switches DESCRIPTION:Input-queued (IQ) switches are one of the referencearchitectures for the design of high-speed packet switches. Classical results in this field refer to the scenario in which the whole switch transfers the packets in a synchronous fashion\, in phase with a sequence of fixed-size timeslots\, selected to transport aminimum-size packet. However\, for switches with large numberof ports and high bandwidth\, maintaining an accurate global synchronization and transferring all the packets in a synchronousfashion is becoming more and more challenging. Furthermore\,variable size packets (as in the traffic present in the Internet) require rather complex segmentation and reassembly processes and some switching capacity is lost due to partial filling of time slots. Thus\, we consider a switch able to natively transfer packets in an asynchronous fashion thanks to a simple and distributed packet scheduler. We investigate the performance of synchronous IQ switches and show that\, despite their simplicity\, their performance is comparable or even better than those of synchronous switches. These partly unexpected results highlight the great potentiality of the asynchronous approach for the design of high-performance switches. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:196@lincs.fr DTSTART;TZID=Europe/Paris:20120509T140000 DTEND;TZID=Europe/Paris:20120509T150000 DTSTAMP:20170328T124603Z URL:https://www.lincs.fr/events/d-iteration-asynchronous-distributed-compu tation/ SUMMARY:D-iteration: asynchronous distributed computation DESCRIPTION:We present a first evaluation of the potential of an asynchronous distributed computation associated to the recently proposed approach\, D-iteration: the D-iteration is a fluid diffusion based iterative method\, which has the advantage of being natively distributive. It exploits a simple intuitive decomposition of the matrix-vector product as elementary operations of fluid diffusion associated to a new algebraic representation. We show through experiments on real datasets how much this approach can improve the computation efficiency when the parallelism is applied: with the proposed solution\, when the computation is distributed over K virtual machines (PIDs)\, the memory size to be handled by each virtual machine decreases linearly with K and the computation speed increases almost linearly with K with a slope becoming closer to one when the number N of linear equations to be solved increases. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:195@lincs.fr DTSTART;TZID=Europe/Paris:20120502T140000 DTEND;TZID=Europe/Paris:20120502T150000 DTSTAMP:20170328T124550Z URL:https://www.lincs.fr/events/game-theoretic-resource-management-in-cell ular-networks/ SUMMARY:Game-theoretic resource management in cellular networks DESCRIPTION:We pose a few resource management problems in cellular networks\, and propose solutions based on game theory. First\, we investigate cooperation among cellular service providers. We consider networks in which communications involving different base stations do not interfere. If providers jointly deploy and pool their resources\, such as spectrum and BSs\, and agree to serve each others customers\, their aggregate payoff substantially increases. The potential of such cooperation can\, however\,be realized only if the providers intelligently determine who they would cooperate with\, how they would deploy and share their resources\, and howthey would share the aggregate payoff. We assume that the providers can arbitrarily share the aggregate payoff . Then\, developing a rational basis for payoff sharing is imperative for the stability of the coalition. We address these issues by formulating cooperation using the theory of transferable utility coalitional games. I will briefly discuss two other resource allocation problems in cellular networks which are in the context of joint power control\, BS association and BS placement in the uplinks of cellular networks. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:194@lincs.fr DTSTART;TZID=Europe/Paris:20120425T140000 DTEND;TZID=Europe/Paris:20120425T150000 DTSTAMP:20170328T124541Z URL:https://www.lincs.fr/events/privacy-preference-expression/ SUMMARY:Privacy preference expression DESCRIPTION:As we browse the web we are tracked by ad-networks\, social networks and other third parties that build (supposedly) anonymized and incomplete records of users' browsing histories. This talk will first discuss the threats resulting from web-tracking by describing how these records can be de-anonymized. Then\, we will overview existing solutions to prevent tracking with a focus on the work done in the W3C Tracking Protection group. We will also quickly overview privacy-preserving mechanisms that could be used to support behavioral targeting. In the last part of the talk we will discuss another type of threat: photo tagging on social networks. We will quickly overview the proposed mechanism to protect privacy of pictured persons. Finally we will present Photo-Tagging Preference Enforcement (Photo-TaPE) which helps users to control how their pictures are published on the web. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:193@lincs.fr DTSTART;TZID=Europe/Paris:20120418T140000 DTEND;TZID=Europe/Paris:20120418T150000 DTSTAMP:20190122T150109Z URL:https://www.lincs.fr/events/wire-speed-statistical-classification-of-n etwork-traffic-on-commodify-hardware/ SUMMARY:Wire-speed statistical classification of network traffic on commodify hardware DESCRIPTION:In this paper\, we present a software-based traffic classification engine running on off-the-shelf multi-core hardware\, able to process in real-time aggregates of up to 15 million packet per second over a single 10Gbps interface.This significant advance with respect to achievable classification rates with respect to the current state of the art is possible due to: (i) the use of Packet Shading to efficiently move batches of packet headers from the NIC to the main CPU. (ii) the use of lightweight statistical classification techniques expoiting the size of the first few packets of a flow. (iii) a careful tuning of several aspects of the software application and of the hardware environment.Using both real Tier-1 traces and synthetic traffic\, we demonstrate that traffic classification of more than 10Gbps traffic aggregates is feasible with open-source sofware on common hardware. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:192@lincs.fr DTSTART;TZID=Europe/Paris:20120411T140000 DTEND;TZID=Europe/Paris:20120411T150000 DTSTAMP:20190122T145640Z URL:https://www.lincs.fr/events/towards-all-optical-packet-networks-using- optical-switch-combiners/ SUMMARY:Towards all-optical packet networks using optical switch-combiners DESCRIPTION:We propose a novel manner to perform optical packet switching which does not require any prior electronicsignaling or header processing. The proposed packet switchingscheme can be implemented by means of a new optical deviceable to handle packet contention in the optical domain byimplementing a first-come first-served policy. This simple deviceis based exclusively on off-the-shelf components and can be usedto build optical packet switches\, that we refer to as switch-combiners. The latter can in turn be used to build all-opticalpacket networks. Using variants of the Engset model\, we analysethe impact of network load on the performance of data traffic.The results are illustrated on the practically interesting cases ofaccess and data center networks.\n\nJoint work with T. Bonald\, D. Cuda and L. Noirie CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:164@lincs.fr DTSTART;TZID=Europe/Paris:20120404T140000 DTEND;TZID=Europe/Paris:20120404T150000 DTSTAMP:20170328T124455Z URL:https://www.lincs.fr/events/routing-in-equilibrium/ SUMMARY:Routing in equilibrium DESCRIPTION:Some path problems cannot be modelled using semirings because the associated algebraic structure is not distributive. Rather than attempting to compute globally optimal paths with such structures\, it may be sufficient in some cases to find locally optimal paths - paths that represent a stable local equilibrium.For example\, this is the type of routing system that has evolved to connect Internet Service Providers (ISPs) where link weights implement bilateral commercial relationships between them.Previous work has shown that routing equilibria can be computed for some non-distributive algebra susing algorithms in the Bellman-Ford family.However\, no polynomial time bound was knownfor such algorithms. In this talk\, we show thatrouting equilibria can be computed using Dijkstra's algorithm for one class of non-distributivestructures. This provides the first polynomial time algorithm for computing locally optimal solutions to path problems.\n\nThis is joint work with João Luís Sobrinho (http://www.lx.it.pt/~jls/) presented at the 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010).\n\nYou can find the paper here: http://www.cl.cam.ac.uk/~tgg22/publications/routing_in_equilibrium_mtns_201 0.pdf\n\nBiography: Timothy G. Griffin is currently on sabbatical in Paris at PPS/INRIA-pi-r2\, http://www.pps.jussieu.fr\n\nThis file http://www.cl.cam.ac.uk/~tgg22/metarouting/rie-1.0.v is a first cut at formalizing these results using Coq (http://coq.inria.fr) with ssreflect (http://www.msr-inria.inria.fr/Projects/math-components) CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:191@lincs.fr DTSTART;TZID=Europe/Paris:20120328T140000 DTEND;TZID=Europe/Paris:20120328T150000 DTSTAMP:20220210T141541Z URL:https://www.lincs.fr/events/opportunities-and-challenges-for-icn-exper imentation-and-deployment-in-software-defined-networks/ SUMMARY:Opportunities and challenges for ICN experimentation and deployment in software defined networks DESCRIPTION:The Information-Centric Networking (ICN) paradigm is expected to be one of the major innovations of the Future Internet. An ICN system can be characterized by some key components like: (i) the content-centric request/reply paradigm for data distribution\, (ii) route-by-name operations\, and (iii) in-network caching.A crucial problem for all ICN solutions is to identify policies forits experimentation in a real networking environment and its actua ldeployment in operating network infrastructures. Software Defined Networking (SDN)\, which is another topic currently attracting increasing attention\, may represent a valid solution tosuch a problem. SDN serates the forwarding operations from the network control operations which may be defined dynamically through software. In this way\, it is extremely simple to introduce novel networking solutions\,in operating communication infrastructures\, thus increasing network evolvability. We are currently implementing and testing an ICN approach\, named CONET (COntent NETwork)\, in OFELIA - a pan-European SDN network platform\, based on the OpenFlow technology. This talk will cover our motivations\, our expectations and our frustrations. in other words the lessons we are learning in such a process. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:190@lincs.fr DTSTART;TZID=Europe/Paris:20120321T151500 DTEND;TZID=Europe/Paris:20120321T153000 DTSTAMP:20190122T135438Z URL:https://www.lincs.fr/events/on-sizing-ccn-content-stores-by-exploiting -topological-information/ SUMMARY:On sizing CCN content stores by exploiting topological information DESCRIPTION:Preview of talk at INFOCOM 2012 and associated workshop.\n\nIn this work\, we study the caching performance of Content Centric Networking (CCN)\, with special emphasis on thesize of individual CCN router caches. Specifically\, we consider several graph-related centrality metrics (e.g.\, betweenness\, closeness\, stress\, graph\, eccentricity and degree centralities) to allocate content store space heterogeneously across the CCN network\, and contrast the performance to that of an homogeneous allocation. To gather relevant results\, we study CCN caching performance under large cache sizes (individual content stores of 10 GB)\, realistic topologies (up to 60 nodes)\, a YouTube-like Internet catalog (10^8 files for 1PB video data). A thorough simulation campaign allow us to conclude that\n\n the gain brought bycontent store size heterogeneity is very limited\, and that\n the simplest metric\, namely degree centrality\, already proves to be a sufficiently good allocation criterion.\n\nOn the one hand\, this implies rather simple rules of thumb forthe content store sizing (e.g.\, if you add a line card to a CCN router\, add some content store space as well). On the other hand\, we point out that technological constraints\, such as line speed operation requirement\, may however limit the applicabilityof degree-based content store allocation.\n\nJoint work with D. Rossi CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:189@lincs.fr DTSTART;TZID=Europe/Paris:20120321T150000 DTEND;TZID=Europe/Paris:20120321T151500 DTSTAMP:20220210T141622Z URL:https://www.lincs.fr/events/an-effective-hop-by-hop-interest-shaping-m echanism-for-ccn-communications/ SUMMARY:An effective hop-by-hop interest shaping mechanism for CCN communications DESCRIPTION:Preview of talk at INFOCOM 2012 and associated workshop.\n\nWe introduce a rate-based congestion control mechanism for Content-Centric Networking (CCN). It builds on the fact that one Interest retrieves at most one Data packet. Congestion can occur when aggregate conversations arrive in excess and fill up the transmission queue of a CCN router. We compute the available capacity of each CCN router in a distributed way in order to shape their conversations Interest rate and therefore adjust dynamically their data rate and transmission buffer occupancy. We demonstrate the convergence properties of this Hop-by-hop Interest Shaping mechanism (HoBHIS) and provide a performance analysis based on various scenarios using our ns-2 simulation environment.\n\nJoint work with Serge Fdida. CATEGORIES:Previews,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:188@lincs.fr DTSTART;TZID=Europe/Paris:20120321T144500 DTEND;TZID=Europe/Paris:20120321T150000 DTSTAMP:20190122T140042Z URL:https://www.lincs.fr/events/icp-design-and-evaluation-of-an-interest-c ontrol-protocol-for-content-centric-networking/ SUMMARY:ICP: design and evaluation of an interest control protocol for content-centric networking DESCRIPTION:Preview of talk at INFOCOM 2012 and associated workshop\n\n.Content-centric networking (CCN) brings aparadigm shift in the present Internet communication modelby addressing named-data instead of host locations. With respect to TCP/IP\, the transport model is connectionless witha unique endpoint at the receiver\, driving a retrieval process natively point to multi-point. Another salient feature of CCN is the possibility to embed storage capabilities into the network\, adding a new dimension to the transport problem. The focus of this work is on the design of a receiver-driven Interestcontrol protocol for CCN\, whose definition\, to the best of our knowledge\, still lacks in literature. ICP realizes a window-based interest flow control\, achieving full efficiency and fairness under proper parameters setting. In this paper\, we provide an analytical characterization of average rate\, expected datatransfer delay and queue dynamics in steady state on a single and multi-bottleneck network topology. Our model accounts for the impact of on-path caches. Protocol performance is also assessed via packet-level simulations and design guidelines are drawn from previous analysis.\n\nJoint work with G. Carofiglio and L. Muscariello. CATEGORIES:Previews,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:187@lincs.fr DTSTART;TZID=Europe/Paris:20120321T143000 DTEND;TZID=Europe/Paris:20120321T144500 DTSTAMP:20220210T142107Z URL:https://www.lincs.fr/events/characterizing-end-host-application-perfor mance-across-multiple-networking-environments/ SUMMARY:Characterizing end-host application performance across multiple networking environments DESCRIPTION:Preview of talk at INFOCOM 2012 and associated workshop.\n\nUsers today connect to the Internet everywhere - from home\, work\, airports\, friend's homes\, and more. This paper characterizes how the performance of networked applications varies across networking environments. Using data from a few dozen end-hosts\, we compare the distributions of RTTs and download rates across pairs of environments. We illustrate that for most users the performance difference is statistically significant. We contrast the influence of the application mix and environmental factors on these performance differences.\n\nJoint work with Oana Goga\, Renata Teixeira\, Jaideep Chandrashekar and Nina Taft. CATEGORIES:Previews,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:186@lincs.fr DTSTART;TZID=Europe/Paris:20120321T141500 DTEND;TZID=Europe/Paris:20120321T143000 DTSTAMP:20220210T142228Z URL:https://www.lincs.fr/events/stochastic-geometry-based-medium-access-ga mes/ SUMMARY:Stochastic geometry based medium access games DESCRIPTION:Preview of talk at INFOCOM 2012 and associated workshop.\nThis paper studies the performance of Mobile Ad hoc Networks (MANETs) when the nodes\, that form a Poisson point process\, selfishly choose their Medium Access Probability (MAP). We consider goodput and delay as the performance metric that each node is interested in optimizing taking into account the transmission energy costs. We introduce a pricing scheme based on the transmission energy requirements and compute the symmetric Nash equilibria of the game in closed form. It is shown that by appropriately pricing the nodes\, the selfish behavior of the nodes can be used to achieve the social optimum at equilibrium. The Price of Anarchy is then analyzed for these games. For the game with delay based utility\, we bound the price of anarchy and study the effect of the price factor. For the game with goodput based utility\, it is shown that price of anarchy is infinite at the price factor that achieves the global optima.\nJoint work with E. Altman and F. Baccelli.Full paper is available at http://arxiv.org/pdf/1112.3741.pdf\n CATEGORIES:Previews,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:185@lincs.fr DTSTART;TZID=Europe/Paris:20120321T140000 DTEND;TZID=Europe/Paris:20120321T141500 DTSTAMP:20190122T151045Z URL:https://www.lincs.fr/events/on-the-spatial-modeling-of-wireless-networ ks-by-random-packing-models/ SUMMARY:On the spatial modeling of wireless networks by random packing models DESCRIPTION:Preview of talk at INFOCOM 2012 and associated workshop.\n\nIn order to represent the set of transmitters simultaneously accessing a wireless network using carrier sensing based medium access protocols\, one needs tractable point processes satisfying certain exclusion rules. Such exclusion rules forbid the use of Poisson point processes within this context. It has been observed that Matern point processes\, which have been advocated in the past because of their exclusion based definition\, are rather conservative within this context. The present paper confirms that it would be more appropriate to use the point processes induced by the Random Sequential Algorithm in order to describe such point patterns. It also shows that this point process is in fact as tractable as the Matern model. The generating functional of this point process is shown to be the solution of a differential equation\, which is the main new mathematical result of the paper. In comparison\, no equivalent result is known for the Matern hard-core model. Using this differential equation\, a new heuristic method is proposed\, which leads to simple bounds and estimates for several important network performance metrics. These bounds and estimates are evaluated by Monte Carlo simulation.\n\nJoint work with Francois Baccelli CATEGORIES:Previews,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:184@lincs.fr DTSTART;TZID=Europe/Paris:20120320T140000 DTEND;TZID=Europe/Paris:20120320T150000 DTSTAMP:20170328T124247Z URL:https://www.lincs.fr/events/a-fine-grained-distance-metric-for-analyzi ng-internet-topology/ SUMMARY:A fine-grained distance metric for analyzing Internet topology DESCRIPTION:One of the defining properties of small worlds is the prevalence of short paths connecting node pairs. Unfortunately\, as a result the usual notion of distance is not particularly helpful in distinguishing neighborhoods in such graphs. This is the case\, for example\, when analyzing the interdomain routing system of the Internet. We describe a motivating problem that requires a finer-grained notion of distance. The problem is quite simple to state: how can any given network operator in the Internet determine which paths pass through its network. Surprisingly\, the nature of Internet routing makes this question rather hard to answer. To address this problem\, we define a new distance metric on graph nodes. This metric has useful and interesting properties: it is easy to compute and understand\, it can be used to sharply distinguish neighborhoods in networks\, and it remains useful even in small-world networks. We show how we use this metric to address our motivating problem\, and more generally how it can be used for visualization and dimensionality reduction of complex networks. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:183@lincs.fr DTSTART;TZID=Europe/Paris:20120314T140000 DTEND;TZID=Europe/Paris:20120314T150000 DTSTAMP:20170328T124234Z URL:https://www.lincs.fr/events/d-iteration-method-or-how-to-improve-the-g auss-seidel-method/ SUMMARY:D-iteration method or how to improve the Gauss-Seidel method DESCRIPTION:The aim of this paper is to present the recently proposed fluid diffusion based algorithm in the general context of the matrix inversion problem associated to the Gauss-Seidel method. We explain the simple intuitions that are behind this diffusion method and how it can outperform existing methods. Then we present some theoretical problems that are associated to this representation as open research problems. We also illustrate some connected problems such as the graph transformation and the PageRank problem. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:182@lincs.fr DTSTART;TZID=Europe/Paris:20120307T140000 DTEND;TZID=Europe/Paris:20120307T150000 DTSTAMP:20170328T124218Z URL:https://www.lincs.fr/events/measurement-based-admission-control-for-fl ow-aware-implicit-service-differentiation/ SUMMARY:Measurement-based admission control for flow-aware implicit service differentiation DESCRIPTION:It has previously been shown that the combined use of fair queuing and admission control would allow the Internet to provide satisfactory quality of service for both streaming and elastic flows without explicitly identifying traffic classes. In this paper we discuss the design of the required measurement based admission control (MBAC) scheme. The context is different to that of previous work on MBAC in that there is no prior knowledge of flow characteristics and there is a twofold objective: to maintain adequate throughput for elastic flows and to ensure low packet latency for any flow whose peak rate is less than a given threshold. In this talk\, we consider the second objective assuming realistically that most elastic and streaming flows are rate limited. We introduce a MBAC algorithm and evaluate its performance by simulation under different stationary traffic mixes and in a flash crowd scenario. The algorithm is shown to offer a satisfactory compromise between flow performance and link utilization.\n\nJoint work with Sara Oueslati\, James Roberts\, 23rd International Teletraffic Congress (ITC 2011)\, San Francisco (CA)\, Sep 6-8\, 2011 CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:181@lincs.fr DTSTART;TZID=Europe/Paris:20120229T153000 DTEND;TZID=Europe/Paris:20120229T160000 DTSTAMP:20190122T133052Z URL:https://www.lincs.fr/events/probe-and-pray-using-upnp-for-home-network -measurements/ SUMMARY:Probe and pray: using UPnP for home network measurements DESCRIPTION:Preview of talk/ workshop at PAM 2012.\n\nNetwork measurement practitioners increasingly focus their interest on understanding and debugging home networks. The Universal Plug and Play (UPnP) technology holds promise as a highly efficient way to collect and leverage measurement data and configuration settings available from UPnP-enabled devices found in home networks. Unfortunately\, UPnP proves less available and reliable than one would hope. In this paper\, we explore the usability of UPnP as a means to measure and characterize home networks. We use data from 120\,000 homes\, collected with the HomeNet Profiler and Netalyzr troubleshooting suites. Our re- sults show that in the majority of homes we could not collect any UPnP data at all\, and when we could\, the results were frequently inaccurate or simply wrong. Whenever UPnP-supplied data proved accurate\, however\, we demonstrate that UPnP provides an array of useful measurement techniques for inferring home network traffic and losses\, for identifying home gateway models with configuration or implementation issues\, and for obtaining ground truth on access link capacity.\n\nJoint work with Renata Teixeira (UPMC Sorbonne Universites and CNRS)\, Martin May (Technicolor)\, and Christian Kreibich (ICSI). CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:180@lincs.fr DTSTART;TZID=Europe/Paris:20120229T150000 DTEND;TZID=Europe/Paris:20120229T153000 DTSTAMP:20190122T133208Z URL:https://www.lincs.fr/events/experimental-assessment-of-bittorrent-comp letion-time-in-heterogeneous-tcputp-swarms/ SUMMARY:Experimental assessment of BitTorrent completion time in heterogeneous TCP/uTP swarms DESCRIPTION:Preview of talk/ workshop at PAM 2012.\n\nBitTorrent\, one of the most widespread used P2P application for file-sharing\, recently got rid of TCP by introducing an application-level congestion control protocol named uTP. The aim of this new protocol is to efficiently use the available link capacity\, while minimizing its interference with the rest of user traffic (e.g.\, Web\, VoIP and gaming) sharing the same access bottleneck. In this paper we perform an experimental study of the impact of uTP on the torrent completion time\, the metric that better captures the user experience. We run BitTorrent applications in a flash crowd scenario over a dedicated cluster platform\, under both homogeneous and heterogeneous swarm population. Experiments show that an all-uTP swarms have shorter torrent download time with respect to all-TCP swarms. Interestingly\, at the same time\, we observe that even shorter completion times can be achieved under mixtures of TCP and uTP traffic\, as in the default BitTorrent settings.\n\nJoint work with D. Rossi (Telecom ParisTech)\, A. Rao (INRIA) and A. Legout (INRIA). CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:179@lincs.fr DTSTART;TZID=Europe/Paris:20120229T143000 DTEND;TZID=Europe/Paris:20120229T150000 DTSTAMP:20190122T133445Z URL:https://www.lincs.fr/events/speed-measurements-of-residential-internet -access/ SUMMARY:Speed measurements of residential Internet access DESCRIPTION:Preview of talk/ workshop at PAM 2012.\n\nThe spread of residential broadband Internet access is raising the question of how to measure Internet speed. We argue that available bandwidth is a key metric of access link speed. Unfortunately\, the performance of available bandwidth estimation tools has rarely been tested from hosts connected to residential networks. This paper compares the accuracy and overhead of state-of-the-art available bandwidth estimation tools from hosts connected to commercial ADSL and cable networks. Our results show that\, when using default settings\, some tools underestimate the available bandwidth by more than 60%. We demonstrate using controlled testbeds that this happens because current home gateways have a limited packet forwarding rate.\n\nJoint work with Renata Teixeira (UPMC Sorbonne Universite and CNRS\, LIP6\, Paris\, France). CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:178@lincs.fr DTSTART;TZID=Europe/Paris:20120229T140000 DTEND;TZID=Europe/Paris:20120229T143000 DTSTAMP:20190122T133851Z URL:https://www.lincs.fr/events/an-end-host-view-on-local-traffic-at-home- and-work/ SUMMARY:An end-host view on local traffic at home and work DESCRIPTION:Preview of talk/ workshop at PAM 2012.\n\nOur work compares local and wide-area traffic from end-hosts connected to different home and work networks. We base our analysis on network and application traces collected from 47 end-hosts for at least one week. We compare traffic patterns in terms of number of connections\, bytes\, duration\, and applications. Not surprisingly\, wide-area traffic dominates local traffic for most users. Local connections are often shorter and smaller than Internet connections. Moreover\, we find that name services (DNS) and network file systems are the most common local applications\, whereas web surfing and P2P\, which are the most popular applications in the wide-area\, are not significant locally.\n\nJoint work with Fabian Schneider (NEC Laboratories Europe\, Heidelberg\, Germany)\, Renata Teixeira (UPMC Sorbonne Universite and CNRS\, LIP6\, Paris\, France). CATEGORIES:Previews,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:166@lincs.fr DTSTART;TZID=Europe/Paris:20120222T140000 DTEND;TZID=Europe/Paris:20120222T150000 DTSTAMP:20170321T204320Z URL:https://www.lincs.fr/events/self-optimization-of-radio-resources-in-sm all-and-macro-cell-networks/ SUMMARY:Self-optimization of radio resources in small and macro cell networks DESCRIPTION:We propose and analyze a class of distributed algorithms performing the joint optimization of radio resources in heterogeneous cellular networks made of a juxtaposition of macro and small cells. We see that within this context\, it is essential to use algorithms able to simultaneously solve the problems of channel selection\, user association and power control. In such networks\, the unpredictability of the cell and user patterns also requires self-optimized schemes. The proposed solution is inspired from statistical physics and is based on Gibbs sampler. It can be implemented in a distributed way and nevertheless achieves minimal system-wide potential delay. Simulation results have shown its effectiveness. CATEGORIES:Seminars,Youtube LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VEVENT UID:177@lincs.fr DTSTART;TZID=Europe/Paris:20120221T143000 DTEND;TZID=Europe/Paris:20120221T153000 DTSTAMP:20190124T113248Z URL:https://www.lincs.fr/events/fock-space-representation-and-variational- analysis-of-poisson-functionals/ SUMMARY:Fock space representation and variational  analysis of Poisson functionals DESCRIPTION:We consider a Poisson process Phi on a general phase space. The expectation of a function of Phi can be considered as a functional of the intensity measure lambda of Phi. Extending ealier results of Molchanov and Zuyev (2000) on finite Poisson processes\, we will study the behaviour of this functional under signed (possibly infinite) perturbations of lambda. A key ingredient of our approach is the explicit Fock space representation obtained in Last and Penrose (2011). As an application we will discuss the infinite cluster in a supercitical Boolean model.\nThis part of the talk is based on joint work with Sergei Zuyev.\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:176@lincs.fr DTSTART;TZID=Europe/Paris:20120221T140000 DTEND;TZID=Europe/Paris:20120221T143000 DTSTAMP:20170328T123824Z URL:https://www.lincs.fr/events/bit-flipping-models/ SUMMARY:Bit flipping models DESCRIPTION:In many areas of engineering and science one faces with an array of devices which possess a few states. In the simplest case these could be on-off or idle-activated states\, in other situations broken or `dead' states are added. If the activation-deactivation (flipping) or breakage cycles produce in a random fashion\, a natural question to ask is when\, if at all\, the system of devices\, which we call bits\, recovers to some initial or ground state. By this we usually mean the state when all the bits are not active\, allowing only for idling and/or broken bits to be seen. When the number of bits is infinite\, the time to recover may assume finite or infinite values when the system actually does not recover. In the latter case we speak of transient behaviour of the system. In the former case\, depending of whether the mean of the recover time exists or not\, we speak of positive or null-recurrence of the system. The terminology is borrowed from Markov chains setting and the above classification is tightly related to the exact random mechanism governing the change of bits' states. The main result for models involving infinite number of bits is the existence of the critical decay of flipping intensities\, at which the model changes from transient to the recurrent behaviour. We show that the recurrence is always null recurrence and estimate which moments of the recover time exist. Besides\, a central limit theorem can be established for the exact way the system behaves in the transient regime. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:26@lincs.fr DTSTART;TZID=Europe/Paris:20120215T140000 DTEND;TZID=Europe/Paris:20120215T150000 DTSTAMP:20170313T170643Z URL:https://www.lincs.fr/events/design-and-analysis-of-content-caching-net works/ SUMMARY:Design and analysis of content caching networks DESCRIPTION:Today's Internet architecture\, nearly 40 years old now\, is grounded in a model of host-to-host communication. More recently\, a number of researchers have begun to focus on Content Networking - a model in which host-to-content (rather than host-to-host) interaction is the norm. Here\, content distribution and retrieval\, rather than host-to-host packet delivery\, is the core function supported in each and every network node. A central component of proposals for such content delivery is the routing of content to requestors through a large-scale interconnected network of caches. In this talk we focus on this cache network.\n\nWe begin with a quick overview of Content Networking. We then describe Breadcrumbs - a simple content caching\, location\, and routing system that uses a small amount of information regarding cache history/routing in a simple\, best-effort approach towards caching. In the second part of this talk we consider the broad challenge of analyzing networks of interconnected caches. We describe an iterative fixed-point algorithm for approximating cache network performance\, evaluate the accuracy of the approximation\, and identify the sources of approximation error. We also consider the steady state behavior of cache networks. We demonstrate that certain cache networks are non-ergodic in that their steady-state characterization depends on the initial state of the system. We describe sufficient conditions (based on topology\, admission control\, and cache replacement policy) for ergodicity and ergodicity equivalence classes among policies. Last\, we describe current work on developing a network calculus for cache network flows.\n\nJoint work with Elisha Rosensweig\, Daniel Menasche\, Don Towsley. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:25@lincs.fr DTSTART;TZID=Europe/Paris:20120208T140000 DTEND;TZID=Europe/Paris:20120208T150000 DTSTAMP:20170313T170643Z URL:https://www.lincs.fr/events/vnext-virtual-network-management-for-xen-b ased-testbeds/ SUMMARY:VNEXT: Virtual NEtwork management for Xen-based Testbeds DESCRIPTION:Network testbeds strongly rely on virtualization that allows the simultaneous execution of multiple protocol stacks but also increases the management and control tasks. This talk presents a system to control and manage virtual networks based on the Xen platform. The goal of the proposed system is to assist network administrators to perform decision-making in this challenging virtualized environment. The system management and control tasks consist of defining virtual networks\, turning on\, turning off\, migrating virtual routers\, and monitoring the virtual networks within few mouse clicks thanks to a user-friendly graphical interface. The administrator can also perform high-level decisions\, such as redefining the virtual network topology by using the plane-separation and loss-free live migration functionality\, or saving energy by shutting down physical routers. Performance tests assure the system has low response time.\n\nBiography: Miguel Elias Mitre Campista was born in Rio de Janeiro\, Brazil\, on May 8th\, 1980. He received the Telecommunications Engineer degree from the Fluminense Federal University (UFF)\, Rio de Janeiro\, Brazil\, in 2003 and the M.Sc. and D.Sc. degrees in Electrical Engineering from the Federal University of Rio de Janeiro (UFRJ)\, Rio de Janeiro\, Brazil\, in 2005 and 2008\, respectively. Currently\, Miguel is with GTA Laboratory in COPPE/UFRJ. His major research interests are in multihop wireless networks\, quality of service\, wireless routing\, wireless mesh networks\, and home networks. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:24@lincs.fr DTSTART;TZID=Europe/Paris:20120201T140000 DTEND;TZID=Europe/Paris:20120201T150000 DTSTAMP:20170313T170642Z URL:https://www.lincs.fr/events/modeling-data-transfer-in-content-centric- networks/ SUMMARY:Modeling data transfer in content-centric networks DESCRIPTION:The move towards a future Internet is today hindered by the mismatch between the host-oriented model\, at thefoundation of the current network architecture\, and the dominant content-oriented usage\, centered on data dissemination and retrieval. Content-centric networking (CCN) brings a paradigm shift in the present Internet communication model by addressing named-data instead of host locations. Important features of such networks are the availability of built-in network storage and of receiver-driven chunk level transport\, whose interaction significantly impacts overall system and user performance. In the talk\, I will focus on the performance evaluation of CCN networks and present an analytical model of bandwidth and storage sharing under fairly general assumption on total demand\, topology\, content popularity and limited network resources. Further\, an overview of the ongoing activities and the main research challenges in this area will be provided. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:23@lincs.fr DTSTART;TZID=Europe/Paris:20120126T140000 DTEND;TZID=Europe/Paris:20120126T150000 DTSTAMP:20190122T131143Z URL:https://www.lincs.fr/events/robustesse-temporelle-dans-les-systemes-em barques-mono-et-multiprocesseur/ SUMMARY:Robustesse temporelle dans les systèmes embarqués mono et multiprocesseur DESCRIPTION:\nLe respect de contraintes temporelles strictes dans un système temps réel peut être garanti par l’établissement de conditions de faisabilité pires cas. Ces conditions de faisabilité sont établies pour un système temps réel spécifié par différents modèles (modèle de taches exécutées\, modèle d’ordonnancement\, modèle d’architecture\,…). Nous nous intéressons dans cette présentation au modèle sporadique et aux ordonnancements préemptifs à priorités fixes et dynamiques (Earliest Deadline First) pour des architectures mono et multiprocesseur. Le modèle sporadique est défini par ses hypothèses pires cas (pire durée d’exécution\, inter-arrivée minimale et échéance minimale de terminaison au plus tard associées aux tâches). Les conditions de faisabilité permettant de garantir la ponctualité des traitements sont parfois jugées restrictives car elles se basent sur des modèles de systèmes pessimistes. Nous nous intéressons dans cette présentation à la robustesse temporelle d’un système en cas de déviation de ses spécifications (hors-ligne dans une phase de dimensionnement ou en-ligne). Nous nous focalisons sur la sensibilié des pires durées d’exécution (WCETs) et montrons comment caractériser leurs déviations maximales acceptables ne remettant pas en cause l’ordonnancabilité des tâches. Les causes de déviation sont multiples\, elle proviennent soit de problèmes de conception (fautes logicielles ou matérielles)\, de l’imprécision du modèle de système (pas de prise en compte du coËšt système\, du coËšt de la préemption ou de migration)\, ou de l’adaptation du système aux conditions opérationnelles de son utilisation : changement des paramètres pour obtenir plus de précision\, contraintes d’énergie conduisant à changer la fréquence du processeur ou à augmenter les périodes. Un système temps réel\, dans ce contexte\, se doit d’être beaucoup plus robuste à ces variations. Nous étudions dans cet exposé la robustesse temporelle des systèmes temps réel en contexte monoprocesseur puis en contexte multiprocesseur selon l’approche semi-partitionnée\, approche hybride entre l’approche partitionnée et l’approche globale. Nous terminons cette présentation par des perspectives d’applications de ces travaux aux systèmes distribués pour des modèles de tâches dont les durées d’exécution sont probabilistes.\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:22@lincs.fr DTSTART;TZID=Europe/Paris:20120125T140000 DTEND;TZID=Europe/Paris:20120125T150000 DTSTAMP:20190122T130323Z URL:https://www.lincs.fr/events/the-fleming-viot-process-driven-by-subcrit ical-branching-a-selection-principle/ SUMMARY:The Fleming Viot process driven by subcritical branching: a selection principle DESCRIPTION:We consider Fleming Viot processes having the following dynamics: N particles move independently according to the dynamics of a subcritical branching process until they hit 0\, at which point\, they instantaneously and uniformly choose the position of one of the other particles. We first establish a coupling between the FV processes (associated to any one-dimensional dynamics) and multitype branching processes. This allows us to prove convergence of scaled version of the FV processes and ergodicity for fixed N. Using large deviations estimate for subcritical branching processes\, this coupling further allows to obtain useful drift inequalities for the maximum of the Fleming Viot process. These inequalities imply in turn tightness of the family of empirical measures under measure of the branching process when N tends to infinity. the stationary measure of the FV process. Finally\, we prove a selection principle: the empirical measures converge to the extremal quasi-stationary measure of the branching process when N tends to infinity.\n\n\n\n CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:21@lincs.fr DTSTART;TZID=Europe/Paris:20111207T140000 DTEND;TZID=Europe/Paris:20111207T150000 DTSTAMP:20170313T170641Z URL:https://www.lincs.fr/events/performance-of-p2p-networks-with-spatial-i nteractions-of-peers-2/ SUMMARY:Performance of P2P networks with spatial interactions of peers DESCRIPTION:We propose a new model for peer-to-peer networking which takes thenetwork bottlenecks into account beyond the access. This model allowsone to cope with the fact that distant peers often have a smaller ratethan nearby peers. We show that the spatial point process describingpeers in their steady state exhibits an interesting repulsionphenomenon. We study the implications of this phenomenon by analyzingtwo asymptotic regimes of the peer-to-peer network: the fluid regimeand the hard--core regime. We get closed form expressions for the mean(and in some cases the law) of the peer latency and the download rateobtained by a peer as well as for the spatial density of peers in thesteady state of each regime. The analytical results are based on a mixof mathematical analysis and dimensional analysis and have importantdesign implications.\n\nThis is a joint work with François Baccelli and Ilkka Norros CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:20@lincs.fr DTSTART;TZID=Europe/Paris:20111130T140000 DTEND;TZID=Europe/Paris:20111130T150000 DTSTAMP:20170313T170641Z URL:https://www.lincs.fr/events/future-internet-an-information-centric-per spective-2/ SUMMARY:Future Internet: An information-centric perspective DESCRIPTION:Although the Internet has been designed as a network for the pairwise communication between end hosts\, the current traffic-mix reveals that it is currently used for the massive distribution of information. Based on a host-centric architecture\, the Internet serves as a communication infrastructure interconnecting requests to the information itself. In view of this model mismatch\, the networking community has started to investigate architectures for a Future Internet many of which revolve around information-centrism. In this talk\, we will provide an overview of the emerging Information-Centric Networking (ICN) paradigm\, highlighting its main features and discussing the ways it offers a promising alternative to the current Internet architecture. We will take a close look at the current ICN research efforts\, including our work in the field\, and point out their commonalities and key differences. Finally\, we will identify key research challenges in the area\, fostering further discussion on the topic.\n\nBiography: Konstantinos Katsaros received his B.Sc.\, M.Sc. and Ph.D. degrees in 2003\, 2005 and 2010 respectively from the Department of Computer Science\, Athens University of Economics and Business\, Greece. His PhD thesis was on content distribution and mobility support in the context of the Information-Centric Networking (ICN) paradigm. His current research is also in the area of ICN\, focusing on scalable information discovery and name resolution\, policy compliant routing\, packet-level caching and multipath routing. He has also worked in the areas of multicast and broadcast service provision over next generation cellular networks\, mobile grid computing and cognitive radio. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:19@lincs.fr DTSTART;TZID=Europe/Paris:20111116T140000 DTEND;TZID=Europe/Paris:20111116T150000 DTSTAMP:20170313T170640Z URL:https://www.lincs.fr/events/manipulability-of-voting-systems-2/ SUMMARY:Manipulability of voting systems DESCRIPTION:Voting systems allow competing entities to decide among different options. In order to ensure fairness between the competing entities\, a strong requirement is to avoid manipulability by voters. Unfortunately\, strong theoretical results show that\, unless using some degenerated and a priori non-acceptable voting systems such as the dictatorial ones\, any other voting system is susceptible to be manipulated by a single voter! However\, very little is know about how much a voting system is manipulable. We evaluate different voting systems by quantifying their probability of manipulability on various kinds of voter populations. The results are very general and can be applied in any context where voting systems can be used. CATEGORIES:Seminars,Youtube LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:18@lincs.fr DTSTART;TZID=Europe/Paris:20111102T140000 DTEND;TZID=Europe/Paris:20111102T150000 DTSTAMP:20170313T170640Z URL:https://www.lincs.fr/events/practicing-interoperability-technical-and- scientific-challenge-2/ SUMMARY:Practicing interoperability: technical and scientific challenge DESCRIPTION:A technical and scientific understanding of interoperability has been available for years in the telecom industry. But the practice of interoperability needs to evolve because of the speed with which ICT ecosystems are created.\n\nThis talk will present the reasons why this is the case and subsequently call for further technical and scientific research. The presentation will include the following points. Practice of interoperability today Research (e.g. DIEM and ARTEMIS projects) Business practices (Handling IPR\, Standardisation) Practice of interoperability in the future ICT ecosystems needs Societal aspects (legal\, business\, ethical) Technical aspects (platform viewpoint\, deployment viewpoint) Engineering aspects (interoperability by design\, interoperability assurance) Business practices and consensus building (Harvard roadmap) Discussion\n\nBiography: Antonio Kung has 30-year experience in embedded systems. He was initially involved in the development of real-time kernels\, before co-founding Trialog in 1987\, where he now serves as CTO. He heads the company product development (kernels\, protocols\, tools) as well as collaborative projects with a focus on embedded systems\, security privacy trust and ICT for ageing. He is involved in the promotion of initiatives towards common platforms and interoperability. He holds a Master's degree from Harvard University and an Engineering degree from Ecole Centrale Paris. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:17@lincs.fr DTSTART;TZID=Europe/Paris:20111021T103000 DTEND;TZID=Europe/Paris:20111021T113000 DTSTAMP:20190806T134327Z URL:https://www.lincs.fr/events/resilient-networking-and-resource-manageme nt-in-ip-networks-2/ SUMMARY:Resilient networking and resource management in IP networks DESCRIPTION:Resilience analysis in packet-based communication networks quantifies the risk of link overload due to rerouted traffic and the risk of disconnectivity. Proactive optimization of routing and rerouting may reduce the first risk\, improvement of the network topology the second one. Recently\, IP fast reroute mechanisms have been suggested by the IETF. Loop-free alternates (LFAs) are simple\, but they may not cover all single element failures. The IETF has recently defined Pre-Congestion Notification (PCN) for Differentiated Services networks. It uses simple load-dependent packet re-marking to communicate load conditions to edge. This information is used for admission control and flow termination. The latter is useful to remove overload that occurs in spite of admission control due unexpected events. However\, termination can be avoided if admissible rate thresholds are set low enough\, which is the principle of resilient admission control. Today's access networks suffer from a minority of heavy users who are responsible for most traffic and compromise the quality of experience for a majority of light users. Some ISPs rate-limit the user access\, others use deep packet inspection to classify and downgrade some traffic which violates network neutrality. To tackle that problem\, the IETF defines Congestion Exposure (ConEx). It makes congestion visible to any IP device along a flow's path. This information may be used to throttle the user access to achieve per-user fairness rather than per-flow fairness\, to improve traffic engineering\, and to enhance SLAs.\n\n \;\n\nBiography: Michael Menth is a full professor at the Department of Computer Science at the University of Tuebingen/Germany and head of the Communication Networks chair. He received a Diploma and PhD degree in 1998 and 2004 from the University of Wuerzburg/Germany. Prior he was studying computer science at the University of Texas at Austin and worked at the University of Ulm/Germany. His special interests are performance analysis and optimization of communication networks\, resource management\, resilience issues\, and Future Internet. He holds numerous patents and received various scientific awards for innovative work. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:16@lincs.fr DTSTART;TZID=Europe/Paris:20111019T140000 DTEND;TZID=Europe/Paris:20111019T150000 DTSTAMP:20170313T170639Z URL:https://www.lincs.fr/events/bufferbloat-2/ SUMMARY:Bufferbloat DESCRIPTION:Bufferbloat - Identification\, analysis\, tools for analyzing overly deep buffering across the (mostly wireless) internet\, with some potential for solutions. For an introduction to the bufferbloat problem\, see Jim Gettys'talk :\n\nhttp://gettys.wordpress.com/2011/06/02/google-techtalk-video-is-up/\n\ nThis talks reportes latest update of work in progress\, more information is available online at http://lwn.net/Articles/458625/ or http://www.bufferbloat.net/ CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:15@lincs.fr DTSTART;TZID=Europe/Paris:20110929T140000 DTEND;TZID=Europe/Paris:20110929T150000 DTSTAMP:20170313T170638Z URL:https://www.lincs.fr/events/how-can-the-internet-help-smarten-the-grid -2/ SUMMARY:How can the Internet help smarten the grid DESCRIPTION:This seminar presents the research activities on Smart Grids of the Information Systems and Sciences for Energy (ISS4E) laboratory co-founded by Professors Rosenberg and Keshav at University of Waterloo. After a brief introduction on smart grids and their similarities with the Internet\, two research projects will be presented. The first is on dimensioning transformers and storage using probabilistic analysis. The second one\, on demand response\, proposes a solution to take advantage of the elasticity inherent to most of the major home appliances. All these projects are conducted in collaboration with Prof. Keshav and graduate students.\n\nBiography: Catherine Rosenberg is a Professor in Electrical and Computer Engineering at the University of Waterloo. Since June 2010\, she holds the Canada Research Chair in the Future Internet. She started her career in ALCATEL\, France and then at AT&\;T Bell Labs.\, USA. From 1988-1996\, she was a faculty 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. In August 1999\, Dr. Rosenberg became a Professor in the School of Electrical and Computer Engineering at Purdue University 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 for a three-year term. Catherine Rosenberg is on the Scientific Advisory Board of France-Telecom and is a Fellow of the IEEE. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:14@lincs.fr DTSTART;TZID=Europe/Paris:20110805T100000 DTEND;TZID=Europe/Paris:20110805T110000 DTSTAMP:20170313T170638Z URL:https://www.lincs.fr/events/on-leveraging-social-informatics-for-cyber -security-2/ SUMMARY:On leveraging social informatics for cyber security DESCRIPTION:A fundamental challenge of trustworthy computing is to develop a systematic and yet practical/usable approach on determining whether or not\, and how much a piece of information (e.g.\, software program or information content) should be trusted. The focus of this talk is our trust management architecture\, called DSL (Davis Social Links) based on social informatics\, i.e.\, information about human social relationships and the interactions based on those relationships. Under the DSL architecture\, we will discuss how to enhance the trustworthiness of distributed applications running on top of today's Internet\, and furthermore\, how to re-design a brand new trustworthy Internet architecture based on social informatics. The speaker will perform some small demos during his talk. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:13@lincs.fr DTSTART;TZID=Europe/Paris:20110630T150000 DTEND;TZID=Europe/Paris:20110630T160000 DTSTAMP:20190726T111714Z URL:https://www.lincs.fr/events/mutual-impact-of-traffic-correlation-and-r egenerator-concentration-in-translucent-wdm-networks-2/ SUMMARY:Mutual impact of traffic correlation and regenerator concentration in translucent WDM networks DESCRIPTION:Since the early 2000s\, a real attention is paid to physical impairments arising in large-scale optical networks. One cost-effective solution to cope with transmission impairments is to deploy 3R (re-amplifying\, re-shaping\, and re-timing) regenerators in a limited number of network nodes (i.e.\, translucent networks). Taking into account the simultaneous effect of four transmission impairments (amplified spontaneous emission\, chromatic dispersion\, polarization mode dispersion\, and nonlinear phase shift)\, we propose a novel exact approach for impairment-aware network planning. In contrast with previous works\, we investigate the problem under pre-planed dynamic traffic. Our proposal takes advantage of the dynamics of the traffic pattern so that regeneration resources may be shared among non-concurrent requests. Given a network topology and a set of pre-planned requests\, we target the minimum number of regenerators or/and regeneration sites. Thanks to an ILP formulation of this problem\, we outline through the obtained numerical results the mutual impact between the time-correlation of the requests and the level of regenerators' concentration.\n\nJoint work with E. Doumith and S. Al Zahr CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:12@lincs.fr DTSTART;TZID=Europe/Paris:20110630T140000 DTEND;TZID=Europe/Paris:20110630T150000 DTSTAMP:20190726T111941Z URL:https://www.lincs.fr/events/modeling-and-blocking-probability-evaluati on-for-multi-priority-circuit-switched-optical-networks-2/ SUMMARY:Modeling and blocking probability evaluation for multi-priority circuit switched optical networks DESCRIPTION:It is expected that circuit switching (CS) will play an important major role in future optical networks. CS normally does not require buffering which is very costly in the optical domain. If the traffic on a CS network is well managed CS networks can guarantee quality of service (QoS) to customers in a way that can even lead to efficient link utilization and low consumption of energy per bit. In the core Internet\, where traffic is heavily multiplexed\, it is easier to achieve high utilization and therefore the role of CS at the core is clearly important. However\, CS can also lead to a green and efficient operation end-to-end for large bursts of data. Accurate\, robust and scalable blocking probability evaluation is an important element in CS traffic management. We consider an optical network that uses various circuit-switching based technologies such as OCS and OFS. We model it as two-priority circuit-switched network with non-hierarchical alternate routing. We evaluate the blocking probability using algorithms based on the Erlang Fixed-point Approximation (EFPA) and the Overflow Priority Classification Approximation (OPCA). For a particular example of a 6-node fully meshed network with alternate routing\, we compare numerically between OPCA over EFPA and discuss traffic implications.\n\nBiography: Moshe Zukerman received his B.Sc. in Industrial Engineering and Management and his M.Sc. in Operation Research from Technion-Israel Institute of Technology and a Ph.D. degree in Engineering from The University of California Los Angeles in 1985.During 1986-1997 he served in Telstra Research Laboratories (TRL). During 1997-2008 he was with The University of Melbourne. In Dec 2008\,he joined City University of Hong Kong where he is a Chair Professor of Information Engineering. He has served on the editorial boards of various journals such as IEEE JSAC\, IEEE/ACM Transactions on Networking\, IEEE Communications Magazine\, Computer Networks and Computer Communications. Prof. Zukerman has over 300 publications in scientific journals and conference proceedings\, has been awarded several national and international patents\, two conference best paper awards and honorary Professorships at CCNU\, Wuhan. CityU\, Hong Kong and BJTU\, Beijing. He is a Fellow of the IEEE and has served as a member and Chair of the IEEE Koji Kobayashi Computers and Communications Award Committee. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:11@lincs.fr DTSTART;TZID=Europe/Paris:20110331T140000 DTEND;TZID=Europe/Paris:20110331T150000 DTSTAMP:20170313T170637Z URL:https://www.lincs.fr/events/recursive-quantum-repeater-networks-2/ SUMMARY:Recursive quantum repeater networks DESCRIPTION:Internet-scale quantum repeater networks will be heterogeneous in physical technology\, repeater functionality\, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of theInternet might have been solved in a more uniform fashion\, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture\, developed from the emerging classical concept ofRECURSIVE NETWORKS\, extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes\, unifies software layering\, and virtualizes the addresses of resources to improve information hiding and resource management. Our architecture is useful for building arbitrary distributed states\, including fundamental distributed states such as Bell pairs and GHZ\, W\, and cluster states.\n\n \;\n\nBiography: Rodney VAN METER received a B.S. in engineering and applied science from the California Institute of Technology in 1986\, an M.S. in computer engineering from the University of Southern California in1991\, and a Ph.D. in computer science from Keio University in 2006.His research interests include storage systems\, networking\, andpost-Moore's Law computer architecture. He has held positions in both industry and academia in the U.S. and Japan. He is now an Associate Professor of Environment and Information Studies at Keio University's Shonan Fujisawa Campus. Dr. Van Meter is a member of AAAS\, ACM and IEEE. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:10@lincs.fr DTSTART;TZID=Europe/Paris:20110210T110000 DTEND;TZID=Europe/Paris:20110210T120000 DTSTAMP:20170313T170636Z URL:https://www.lincs.fr/events/seeking-simplicity-in-complex-systems-2/ SUMMARY:Seeking simplicity in complex systems DESCRIPTION:Queueing network models are an important tool in the evaluation of the performance of computer systems and networks. Explicit analytical solutions exist for a class of such models\, but features such as realistic global dependencies\, priorities\, or simple commonly used service disciplines\, preclude their direct application. Additionally\, even when such solutions are known\, their numerical computation may still be challenging due to the size of the state space of classical queueing models.\n\nIn this talk\, we try to show that the use of conditional probabilities may be valuable in exposing simple properties hidden from view by classical state descriptions. Examples include tandem networks with blocking\, multiclass models\, multi-server systems with priorities\, as well as guided state sampling in large systems. CATEGORIES:Seminars LOCATION:LINCS Meeting Room 40\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.8283983;2.3568972000000485 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Meeting Room 40:geo:48.8283983,2.3568972000000485 END:VEVENT BEGIN:VEVENT UID:165@lincs.fr DTSTART;TZID=Europe/Paris:20110112T140000 DTEND;TZID=Europe/Paris:20110112T150000 DTSTAMP:20190722T070700Z URL:https://www.lincs.fr/events/spanners-de-graphes/ SUMMARY:Spanners de graphes DESCRIPTION:Etant donné un graphe G\, un spanner est un sous graphe H qui couvre tous les sommets de G. On s’intéresse alors à  deux paramètres: la distance dans H par rapport à  la distance dans G\, et la taille de H en nombre d'arêtes. L'optimisation simultanée de ces deux paramètres conduit à  des compromis que nous mettrons en évidence.\n\n\nTags : Laurent Viennot\, Inria\, Spanners de graphes\, spanner\n CATEGORIES:Seminars LOCATION:LINCS Seminars room\, 23\, avenue d'Italie\, Paris\, 75013\, France GEO:48.828400;2.356897 X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23\, avenue d'Italie\, Paris\, 75013\, France;X-APPLE-RADIUS=100;X-TITLE=LINCS Seminars room:geo:48.828400,2.356897 END:VEVENT BEGIN:VTIMEZONE TZID:Europe/Paris X-LIC-LOCATION:Europe/Paris BEGIN:STANDARD DTSTART:20101031T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20110327T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20111030T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20120325T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20121028T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20130331T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20131027T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20140330T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20141026T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20150329T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20151025T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20160327T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20161030T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20170326T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20171029T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20180325T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20181028T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20190331T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20191027T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20200329T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20201025T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20210328T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20211031T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20220327T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20221030T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20230326T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20231029T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20240331T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20241027T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20250330T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT BEGIN:STANDARD DTSTART:20251026T020000 TZOFFSETFROM:+0200 TZOFFSETTO:+0100 TZNAME:CET END:STANDARD BEGIN:DAYLIGHT DTSTART:20260329T030000 TZOFFSETFROM:+0100 TZOFFSETTO:+0200 TZNAME:CEST END:DAYLIGHT END:VTIMEZONE END:VCALENDAR