Thibaut Stimpfling
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Thibaut Stimpfling has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Yvon Savaria
Department of Electrical Engineering, Polytechnique Montreal, Montreal, QC H3T lJ4, Canada
2 shared publications André Béliveau
Ericsson Canada, Montréal, PQ, Canada
1 shared publication- J. M. Pierre Langlois
Polytechnique Montreal
1 shared publication - Normand Belanger
Ecole Polytechnique de Montréal
1 shared publication Normand Bélanger
Ecole Polytechnique de Montréal, Montréal, PQ, Canada
1 shared publication- Omar Cherkaoui
AMBOSS Global Hlth Initiat, Berlin, Germany
1 shared publication
Latest Publications
- 25 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 27 (4) , 1529-1542
SHIP: A Scalable High-Performance IPv6 Lookup Algorithm That Exploits Prefix Characteristics
Due to the emergence of new network applications, current IP lookup engines must support high bandwidth, low lookup latency, and the ongoing growth of IPv6 networks. However, the existing solutions are not designed to address jointly these three requirements. This paper introduces SHIP, an IPv6 lookup algorithm that exploits prefix characteristics to build a data structure designed to meet future application requirements. Based on the prefix length distribution and prefix density, prefixes are first clustered into groups sharing similar characteristics and then encoded in hybrid trie-trees. The resulting memory-efficient and scalable data structure can be stored in low-latency memories and allows the traversal process to be parallelized and pipelined in order to support high packet bandwidth in hardware. In addition, SHIP supports incremental updates. Evaluated on real and synthetic IPv6 prefix tables, SHIP has a logarithmic scaling factor in terms of the number of memory accesses and a linear memory consumption scaling. Compared with other well-known approaches, SHIP reduces the required amount of memory per prefix by 87%. When implemented on a state-of-the-art field-programmable gate array (FPGA), the proposed architecture can support processing 588 million packets per second.
- 25 July 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 27 (4) , 1529-1542
SHIP: A Scalable High-Performance IPv6 Lookup Algorithm That Exploits Prefix Characteristics
Due to the emergence of new network applications, current IP lookup engines must support high bandwidth, low lookup latency, and the ongoing growth of IPv6 networks. However, the existing solutions are not designed to address jointly these three requirements. This paper introduces SHIP, an IPv6 lookup algorithm that exploits prefix characteristics to build a data structure designed to meet future application requirements. Based on the prefix length distribution and prefix density, prefixes are first clustered into groups sharing similar characteristics and then encoded in hybrid trie-trees. The resulting memory-efficient and scalable data structure can be stored in low-latency memories and allows the traversal process to be parallelized and pipelined in order to support high packet bandwidth in hardware. In addition, SHIP supports incremental updates. Evaluated on real and synthetic IPv6 prefix tables, SHIP has a logarithmic scaling factor in terms of the number of memory accesses and a linear memory consumption scaling. Compared with other well-known approaches, SHIP reduces the required amount of memory per prefix by 87%. When implemented on a state-of-the-art field-programmable gate array (FPGA), the proposed architecture can support processing 588 million packets per second.
- Open Access
- 18 June 2013
- Published by Association for Computing Machinery (ACM)
- p. 9-14
Optimal packet classification applicable tothe OpenFlow context
- 18 June 2013
- Published by Association for Computing Machinery (ACM)
- p. 9-14
Open AccessOptimal packet classification applicable tothe OpenFlow context