Reference : Optimising Packet Forwarding in Multi-Tenant Networks using Rule Compilation

	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	Focus Areas :	Computational Sciences
	To cite this reference:	http://hdl.handle.net/10993/32841

Title :	Optimising Packet Forwarding in Multi-Tenant Networks using Rule Compilation
Language :	English
Author, co-author :	Hommes, Stefan [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
	Valtchev, Petko [Université du Québec à Montréal]
	Blaiech, Khalil [Université du Québec à Montréal]
	Hamadi, Salaheddine [Université du Québec à Montréal]
	Cherkaoui, Omar [Université du Québec à Montréal]
	State, Radu [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Publication date :	Nov-2017
Main document title :	Optimising Packet Forwarding in Multi-Tenant Networks using Rule Compilation
Publisher :	IEEE
Peer reviewed :	Yes
Audience :	International
ISBN :	978-1-5386-1465-5
Event name :	International Symposium on Network Computing and Applications (NCA 2017)
Event date :	from 30-10-2017 to 01-11-2017
Event place (city) :	Cambridge, MA
Event country :	US
Keywords :	[en] rule compression ; OpenFlow ; multi-tenant
Abstract :	[en] Packet forwarding in Software-Defined Networks (SDN) relies on a centralised network controller which enforces network policies expressed as forwarding rules. Rules are deployed as sets of entries into network device tables. With heterogeneous devices, deployment is strongly bounded by the respective table constraints (size, lookup time, etc.) and forwarding pipelines. Hence, minimising the overall number of entries is paramount in reducing resource consumption and speeding up the search. Moreover, since multiple control plane applications can deploy own rules, conflicts may occur. To avoid those and ensure overall correctness, a rule validation mechanism is required. Here, we present a compilation mechanism for rules of diverging origins that minimises the number of entries. Since it exploits the semantics of rules and entries, our compiler fits a heterogeneous landscape of network devices. We evaluated compiler implementations on both software and hardware switches using a realistic testbed. Experimental results show a reduction in both produced table entries and forwarding delay.
Permalink :	http://hdl.handle.net/10993/32841

	File(s) associated to this reference
	Fulltext file(s): File Commentary Version Size Access Limited access 095.pdf Publisher postprint 494.85 kB Request a copy

All documents in ORBi^lu are protected by a user license.

 

University of Luxembourg Library |  Feedback |  Legal notices Site Map