Advanced hashing schemes for packet forwarding using set associative memory architectures
نویسندگان
چکیده
منابع مشابه
Advanced hashing schemes for packet forwarding using set associative memory architectures
Building a high performance IP packet forwarding (PF) engine remains a challenge due to increasingly stringent throughput requirements and the growing size of IP forwarding tables. The router has to match the incoming packet’s IP address against all entries in the forwarding table. The matching process has to be done at increasingly higher wire speed; hence, scalability and low power consumptio...
متن کاملPacket Forwarding Using Xen
Network virtualization allows the development of systems with several virtual routers (VR) over the same physical router. Each virtual router can execute, at the same time, different protocol stacks without disrupting the coexisting routers. The main purpose of this work is to analyze Xen capabilities and limitations and compare its efficiency with native solutions. Tests are performed in order...
متن کاملEnabling Name-based Packet Forwarding over Flat ID Network Architectures
A BF-BASEDANALYTICALMODEL : DETAILS At its core, the analytical model of BF-based forwarding calculates the probability of forwarding decisions within a router, assuming Longest Prefix Matching (LPM) semantics. E.g. say a router has 3 interfaces 0, 1 and 2 each associated forwarding entries with sizes 1 or 2. Themodel calculates the probability of events such as ‘having a packet forwarded over ...
متن کاملPacket Forwarding in VANETs, the Complete Set of Results
The discrepancy between real-world radio channel behavior and its standard modeling in simulations (Unit Disk Graph) is a major reason for protocols to perform different – often worse – than predicted when deployed in a real-world setup. As researchers having to deal with real ad hoc networks are aware of, assuming a fixed border for a node’s communication range might not only lead to inaccurat...
متن کاملCryptanalytic Time-Memory Tradeoff for Password Hashing Schemes
A cryptanalytic technique known as time-memory tradeoff (TMTO) was proposed by Hellman for finding the secret key of a block cipher. This technique allows sharing the effort of key search between the two extremes of exhaustively enumerating all keys versus listing all possible ciphertext mappings produced by a given plaintext (i.e. table lookups). The TMTO technique has also been used as an eff...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2011
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2010.10.006