s.vissicchio (at) cs (dot) ucl (dot) ac (dot) uk
University College London
Department of Computer Science
London, WC1E 6BT, UK
I have joined the Department of Computer Science at University College in October 2016, after 4 years as post-doctoral researcher at Universite catholique de Louvain in Belgium as well as 3 years as PhD student at Roma Tre University in Italy. More information on my background and achievements are reported in the About me page.
My research activity focuses on theory, algorithms and systems for efficiently and reliably managing communication networks. I believe in a rigorous approach to solve practical networking problems: In my research, I often leverage the insights gained by deep, theoretical analyses of formal network models and problem statements to design new algorithms and techniques -- and build fully-fledged system prototypes around them.
I currently have openings for PhD students. Successful candidates must pass the standard UCL admission process. If you are interested in working with me, don't hesitate to drop me an email!
Latest updates on my professional activity.
November 2017: participation in IMC 2017
October 2017: Our position paper on low latency routing on "meshy" ISPs has been accepted to Hotnets 2017
October 2017: REPETITA, our proposal to ease repeatable experiments on traffic engineering algorithms (with data on more than 250 topologies, implementation of state of the art algorithms, and easy-to-run analyses), is out: Check out our arXiv paper, and our GitHub repository!
August 2017: SWIFT has been presented at SIGCOMM, by Thomas Holterbach (Thomas' slides)
August 2017: participation in SIGCOMM 2017
June 2017: The extended version of our FLIP paper has been accepted to ToN
April 2017: SWIFT, our system to avoid packet losses due to remote Internet failures through predictive fast rerouting, has been accepted at SIGCOMM 2017!
March 2017: TPC member for INFOCOM 2018
December 2016: Our paper on efficient update of traditional, SDN and hybrid networks, including theory, generalized algorithms and extensive simulations, has been accepted at ToN
November 2016: Expect the Unexpected, our local search algorithm for sub-second traffic engineering with Segment Routing, has been accepted at INFOCOM 2017
November 2016: participation in Hotnets 2016
October 2016: happy to join University College London as lecturer!
September 2016: Mille-feuille, our paper on using Fibbing for monitoring ISP traffic at fine granularity, has been accepted at HotNets 2016
June 2016: Our Fibbing demo has been accepted at SIGCOMM 2016
An overview of the main topics on which my research activity has focused.
Hybrid SDN: Theory, architecture and techniques to profitably combine centralized (SDN) and distributed (traditional) control-planes, for the greater good. Our contributions range from an overview of the research space (CCR11) and a general control-plane theory (INFOCOM15) to concrete architectures and techniques (like Fibbing, DEFO, and IBSDN).
Fine-grained monitoring: Architectures and systems for advanced monitoring and anomaly detection. Mainly, we proposed and assessed the feasibility of control-plane message collectors based on packet cloning (INM10), traffic-matrix estimators based on programmable routers (PRESTO10), warning systems for BGP policy violations (TNSM16), hardware-bug detectors exploiting segment routing (SCMon), and generic, fine-grained traffic monitoring systems based on Fibbing (Mille-feuille).
Network updates: Complexity results, algorithms and systems to change packet-forwarding paths in a running network with guaranteed service continuity. We considered several network-update problems, in IGP-only (like SIGCOMM11 and ToN15a), BGP-running (see INFOCOM13 and ToN13), SDN (especially, FLIP) and generic multi control-plane (INFOCOM15,ToN17) networks.
Network testing: Methodologies, techniques and tools for checking control-plane correctness before deployment on production networks. Our contributions span configuration checkers for distributed protocols in traditional networks (TNSM11,ToN15b), and black-box testing of OpenFlow controllers (TASTE).
Routing theory: Graph-based modeling and formal analysis of distributed network protocols, notably policy-based routing ones as BGP. Our main results include the characterizations of the BGP expressive power and complexity of related routing problems (ICNP13), as well as the identification of sufficient and necessary conditions for guaranteed configuration correctness (ICNP09,INFOCOM12).
Measurements: Analyses of active measurements on Internet routing. We conducted large-scale measurement campaign to support key claims in our papers (see, for example, the ToN15b paper on iBGP Policies). We have also performed bias analyses of existing measurement infrastructures, including distributed platforms as RIPE Atlas (IMC13) and publicly-available datasets like RIS/Routeviews BGP ones (Networking14).
Hereafter, a list of the most important articles that I have co-authored (with several great collaborators!). A complete list is available on my Publications page.
N. Gvozdiev, S. Vissicchio, B. Karp, M. Handley. Low-Latency Routing on Mesh-Like Backbones. In Proc. HotNets, 2017. To appear. (paper)
O. Tilmans, T. Buhler, S. Vissicchio, L. Vanbever. Mille-Feuille: Putting ISP traffic under the scalpel. In Proc. HotNets, 2016. (paper)
S. Vissicchio, O. Tilmans, L. Vanbever, J. Rexford. Central Control over Distributed Routing. In Proc. SIGCOMM 2015.
Selected as SIGCOMM 2015 Best Paper, awarded with the IRTF Applied Network Research Prize 2016
R. Hartert, S. Vissicchio, P. Schaus, O. Bonaventure, C. Filsfils, T. Telkamp, P. Francois. A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks. In Proc. SIGCOMM 2015. (paper) (talk) (Web site)
S. Vissicchio, L. Vanbever, O. Bonaventure. Opportunities and Research Challenges of Hybrid Software Defined Networks. ACM SIGCOMM Computer Communications Review. 44(2):70- 75. April 2014. (paper)
M. Chiesa, L. Cittadini, G. Di Battista, L. Vanbever, S. Vissicchio. Using Routers to Build Logic Circuits: How Powerful is BGP? In Proc. ICNP, 2013.
Selected as ICNP 2013 Best Paper
S. Vissicchio, L. Vanbever, C. Pelsser, L. Cittadini, P. Francois, O. Bonaventure. Improving Network Agility with Seamless BGP Reconfigurations. IEEE/ACM Transactions on Networking. 21(3):990-1002. June 2013.
Awarded with the IRTF Applied Network Research Prize 2013
C. Pelsser, L. Cittadini, S. Vissicchio, R. Bush. From Paris to Tokyo: On the Suitability of ping to Measure Latency. In Proc. IMC, 2013. (paper)
L. Vanbever, S. Vissicchio, C. Pelsser, P. Francois, O. Bonaventure. Seamless Network-Wide IGP Migrations. In Proc. SIGCOMM, 2011. (paper)
L. Cittadini, G. Di Battista, M. Rimondini, S. Vissicchio. Wheel + Ring = Reel: the Impact of Route Filtering on the Stability of Policy Routing. In Proc. ICNP, 2009. (paper)
Hereafter, you can find pointers to the code produced with my collaborators and myself during research projects in which I have participated.
REPETITA: a software framework for repeatable experiments on traffic engineering (TE) algorithms. It includes more than 250 real topologies, the implementation of state of the art TE algorithms (with IGP weight optimization and segment routing), and easy-to-run analyses
SWIFT inference algorithm and VM: predictively rerouting traffic to drastically speed up reaction to remote inter-domain failures
Fibbing controller: profitably using distributed routing protocols for centralized control
DEFO optimization module: optimizing forwarding paths with Constraint Programming
FLIP algorithm: computing fast, low-memory and policy-preserving updates of OpenFlow networks by combining rule replacements and tag-and-match operations
Hybrid SDN update algorithms: guaranteeing usage of either initial or final paths throughout the update of traditional, SDN and mixed networks
SCMon prototype: monitoring an entire network from a single box with Segment Routing