I agree that this site is using cookies. You can find further informations
here
.
X
Login
Merkliste (
0
)
Home
About us
Home About us
Our history
Profile
Press & public relations
Friends
The library in figures
Exhibitions
Projects
Training, internships, careers
Films
Services & Information
Home Services & Information
Lending and interlibrary loans
Returns and renewals
Training and library tours
My Account
Library cards
New to the library?
Download Information
Opening hours
Learning spaces
PC, WLAN, copy, scan and print
Catalogs and collections
Home Catalogs and Collections
Rare books and manuscripts
Digital collections
Subject Areas
Our sites
Home Our sites
Central Library
Law Library (Juridicum)
BB Business and Economics (BB11)
BB Physics and Electrical Engineering
TB Engineering and Social Sciences
TB Economics and Nautical Sciences
TB Music
TB Art & Design
TB Bremerhaven
Contact the library
Home Contact the library
Staff Directory
Open access & publishing
Home Open access & publishing
Reference management: Citavi & RefWorks
Publishing documents
Open Access in Bremen
zur Desktop-Version
Toggle navigation
Merkliste
1 Ergebnisse
1
Spider: Parallelizing Longest Prefix Matching with Optimiza..:
, In:
2020 6th IEEE Conference on Network Softwarization (NetSoft)
,
Ueno, Yukito
;
Nakamura, Ryo
;
Kuga, Yohei
. - p. 267-271 , 2020
Link:
https://doi.org/10.1109/NetSoft48620.2020.9165306
RT T1
2020 6th IEEE Conference on Network Softwarization (NetSoft)
: T1
Spider: Parallelizing Longest Prefix Matching with Optimization for SIMD Instructions
UL https://suche.suub.uni-bremen.de/peid=ieee-9165306&Exemplar=1&LAN=DE A1 Ueno, Yukito A1 Nakamura, Ryo A1 Kuga, Yohei A1 Esaki, Hiroshi YR 2020 K1 IP networks K1 Software K1 Routing K1 Data structures K1 Optimization K1 Hardware K1 Middleboxes K1 IP Routing K1 LPM K1 SIMD K1 Software Middlebox SP 267 OP 271 LK http://dx.doi.org/https://doi.org/10.1109/NetSoft48620.2020.9165306 DO https://doi.org/10.1109/NetSoft48620.2020.9165306 SF ELIB - SuUB Bremen
Export
RefWorks (nur Desktop-Version!)
Flow
(Zuerst in
Flow
einloggen, dann importieren)