Sciweavers

11 search results - page 2 / 3
» Range Tries for scalable address lookup
Sort
View
INFOCOM
2003
IEEE
13 years 10 months ago
Adaptive Data Structures for IP Lookups
— The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this pape...
Ioannis Ioannidis, Ananth Grama, Mikhail J. Atalla...
CIC
2006
140views Communications» more  CIC 2006»
13 years 6 months ago
An Efficient Update Algorithm for Supporting Mobility in Structured P2P Systems
Structured peer to peer (P2P) systems organize a large number of nodes in well-defined structures and provide efficient and scalable search functionalities. They have been used as ...
Boxuan Gu, Hu Wang, Zongming Fei
HIPEAC
2009
Springer
14 years 2 days ago
Parallel H.264 Decoding on an Embedded Multicore Processor
In previous work the 3D-Wave parallelization strategy was proposed to increase the parallel scalability of H.264 video decoding. This strategy is based on the observation that inte...
Arnaldo Azevedo, Cor Meenderinck, Ben H. H. Juurli...
SIGCOMM
2006
ACM
13 years 11 months ago
Understanding the network-level behavior of spammers
This paper studies the network-level behavior of spammers, including: IP address ranges that send the most spam, common spamming modes (e.g., BGP route hijacking, bots), how persi...
Anirudh Ramachandran, Nick Feamster
PADS
2005
ACM
13 years 10 months ago
RINSE: The Real-Time Immersive Network Simulation Environment for Network Security Exercises
The RINSE simulator is being developed to support large-scale network security preparedness and training exercises, involving hundreds of players and a modeled network composed of...
Michael Liljenstam, Jason Liu, David M. Nicol, You...