search query: @instructor Nikander, Pekka / total: 18
reference: 2 / 18
Author: | Ghani, Adnan Hassan |
Title: | Secure In-packet Bloom Filter Based Forwarding on a Reusable Network Hardware Design |
Publication type: | Master's thesis |
Publication year: | 2011 |
Pages: | ix + 56 Language: eng |
Department/School: | Tietoliikenne- ja tietoverkkotekniikan laitos |
Main subject: | Tietoliikennetekniikka (S-72) |
Supervisor: | Hämäläinen, Jyri |
Instructor: | Nikander, Pekka |
Electronic version URL: | http://urn.fi/URN:NBN:fi:aalto-201207022666 |
OEVS: | Electronic archive copy is available via Aalto Thesis Database.
Instructions Reading digital theses in the closed network of the Aalto University Harald Herlin Learning CentreIn the closed network of Learning Centre you can read digital and digitized theses not available in the open network. The Learning Centre contact details and opening hours: https://learningcentre.aalto.fi/en/harald-herlin-learning-centre/ You can read theses on the Learning Centre customer computers, which are available on all floors.
Logging on to the customer computers
Opening a thesis
Reading the thesis
Printing the thesis
|
Location: | P1 Ark Aalto 741 | Archive |
Keywords: | publish/subscribe Bloom filters forwarding node security denial-of-service resistance NetFPGA |
Abstract (eng): | In-packet Bloom filters allow one to forward source-routed packets with minimal forwarding tables, the Bloom filter encoding the identities of the links the packet needs to be forwarded over. If the link identities are made content dependent, e.g. by computing the next-hop candidate link identifiers by applying a cryptographic function over some information carried in the packet header, the Bloom filters differ pseudo-randomly from packet-to-packet, making the forwarding fabric resistant towards unauthorized traffic. The implementation and testing of in-packet bloom filter forwarding node that uses cryptographically computed link identifiers are discussed in this thesis. Two different cryptographic techniques are tested for the link-identity computation and thereby for making the forwarding decision. The algorithms have been implemented and tested on the Stanford NetFPGA. The performance and efficiency of the algorithms is also briefly discussed. |
ED: | 2011-09-07 |
INSSI record number: 42707
+ add basket
INSSI