1 Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1

First Page		Document Content
Date: 2018-05-31 05:55:54 Computing Routing protocols Data transmission Network architecture Internet architecture Internet Standards Internet protocols Routing algorithms Constraint Open Shortest Path First Link-state routing protocol Router		1 Computing Minimal Update Sequences for Graceful Router-wide Reconfigurations Francois Clad1 , Stefano Vissicchio2 , Pascal Mérindol1 , Pierre Francois3 and Jean-Jacques Pansiot1 1 Add to Reading List Source URL: inl.info.ucl.ac.be Download Document from Source Website File Size: 398,62 KB Share Document on Facebook

	Toward a Taxonomy and Attacker Model for Secure Routing Protocols Matthias Hollick Cristina Nita-Rotaru DocID: 1xUT2 - View Document
	Enabling SDN in old school networks with Software-Controlled Routing Protocols Laurent Vanbever† and Stefano Vissicchio†† ? Princeton University† , Universit´e catholique de Louvain†† DocID: 1xUQU - View Document
	Appears in Proceedings of the 11th IEEE International Conference on Network Protocols (ICNPExploiting Routing Redundancy via Structured Peer-to-Peer Overlays Ben Y. Zhao, Ling Huang, Jeremy Stribling, Anthony D. DocID: 1uCBi - View Document
	FlowBender: Flow-level Adaptive Routing for Improved Latency and Throughput in Datacenter Networks Abdul Kabbani Balajee Vamanan DocID: 1rtxQ - View Document
	Improving Restoration Success in Mesh Optical Networks Fang Yu 1, Rakesh Sinha2, Dongmei Wang3, Guangzhi Li3, John Strand2, Robert Doverspike2, Charles Kalmanek 3, and Bruce Cortez 2 1 EECS Department, UC Berkeley, Berke DocID: 1rrH0 - View Document