Zentrum für Informationsdienste und Hochleistungsrechnen (ZIH) Routing on the Dependency Graph: A New Approach to Deadlock-Free High-Performance Routing Jens Domke

First Page		Document Content
Date: 2016-06-02 03:41:57 Routing Routing algorithms Routing protocols Computing Wireless networking		Zentrum für Informationsdienste und Hochleistungsrechnen (ZIH) Routing on the Dependency Graph: A New Approach to Deadlock-Free High-Performance Routing Jens Domke Add to Reading List Source URL: spcl.inf.ethz.ch Download Document from Source Website File Size: 1,57 MB 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