Filters








215 Hits in 7.1 sec

Scalar Prefix Search: A New Route Lookup Algorithm for Next Generation Internet

M. Behdadfar, H. Saidi, H. Alaei, B. Samari
2009 IEEE INFOCOM 2009 - The 28th Conference on Computer Communications  
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to propose new lookup algorithms  ...  Recently, some new algorithms are proposed trying to store the prefixes in a balanced tree to reduce the worst case prefix search and update times.  ...  In this paper, a new prefix search algorithm was introduced called Scalar Prefix Search. In contrast to other current solutions, this algorithm treats each prefix as a number.  ... 
doi:10.1109/infcom.2009.5062179 dblp:conf/infocom/BehdadfarSAS09 fatcat:52wo7tjn6nhkniud6k4vdfgwnu

Memory-Efficient IPv4/v6 Lookup on FPGAs Using Distance-Bounded Path Compression

Hoang Le, Weirong Jiang, Viktor K. Prasanna
2011 2011 IEEE 19th Annual International Symposium on Field-Programmable Custom Computing Machines  
Furthermore, implementation on a state-of-the-art FPGA device shows that our algorithms achieve 466 million lookups per second and are well suited for 100Gbps lookup.  ...  We propose two algorithms to compress the uni-bit-trie representation of a given routing table: (1) single-prefix distancebounded path compression and (2) multiple-prefix distancebounded path compression  ...  Related Work In general, algorithms for IP-lookup can be classified into the following categories: trie-based, scalar-tree-based, range-tree-based, and hash-based approaches.  ... 
doi:10.1109/fccm.2011.40 dblp:conf/fccm/LeJP11 fatcat:3t7epjhknng45ca5sy4vegikrm

Scalable Tree-Based Architectures for IPv4/v6 Lookup Using Prefix Partitioning

Hoang Le, Viktor K. Prasanna
2012 IEEE transactions on computers  
In particular, we target our solutions for a class of large and sparsely-distributed routing tables, such as those potentially arising in the next-generation IPv6 routing protocol.  ...  Implementations on 45 nm ASIC and a state-of-the-art FPGA device (for a routing table consisting of 330K prefixes) show that our algorithm achieves 980 and 410 million lookups per second, respectively.  ...  Prefix Paritioning Algorithm Tree search algorithm is a good choice for IPv6 forwarding engine as the lookup latency does not depend on the length of the prefix, but on the number of prefixes in the routing  ... 
doi:10.1109/tc.2011.130 fatcat:tmyybhlqtvfinm4fobjbq22jjy

A fast IP routing lookup scheme for gigabit switching routers

Nen-Fu Huang, Shi-Ming Zhao, Jen-Yi Pan, Chi-An Su
1999 IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)  
One of the key design issues for the new generation IP routers is the route lookup mechanism.  ...  For each incoming IP packet, the IP routing requires to perform a longest prefix matching on the address lookup in order to determine the packet's next hop.  ...  For a database of N prefixes with address length W, the native binary search scheme takes O(W*logN) searches. This improved schemes takes only O(W+logN) searches.  ... 
doi:10.1109/infcom.1999.752163 dblp:conf/infocom/HuangZPS99 fatcat:mlong5w3t5cq3ntz4xogmcnhry

A framework for computation-memory algorithmic optimization for signal processing

G. Cheung, S. McCanne
2003 IEEE transactions on multimedia  
The heterogeneity of today's computing environment means computation-intensive signal processing algorithms must be optimized for performance in a machine dependent fashion.  ...  We discuss two instantiations of the framework: fast IP address lookup, and fast nonuniform scalar quantizer and unstructured vector quantizer encoding.  ...  We obtained a routing table with 2638 prefixes from the Palo Alto Internet Exchange (PAIX) from [19] on June 19, 1998.  ... 
doi:10.1109/tmm.2003.811625 fatcat:wmnwc5kpeffq5p4txmnlmcv7fa

Scalable IP lookups using shape graphs

Haoyu Song, Murali Kodialam, Fang Hao, T.V. Lakshman
2009 2009 17th IEEE International Conference on Network Protocols  
We develop a new data structure, called the shape graph, that significantly compacts the trie data-structure used for IP lookups.  ...  Recently, there has been much renewed interest in developing compact data structures for packet processing functions such as longest prefix-match for IP lookups.  ...  If the trie root's shape id is new, we generate a new vertex having this shape id in the shape graph and make it the new starting vertex.  ... 
doi:10.1109/icnp.2009.5339697 dblp:conf/icnp/SongKHL09 fatcat:lv2dsmj2hzhkfhtemt65b2es3q

Scalable forwarding tables for supporting flexible policies in enterprise networks

Shu Yang, Mingwei Xu, Dan Wang, Gautier Bayzelon, Jianping Wu
2014 IEEE INFOCOM 2014 - IEEE Conference on Computer Communications  
With increasing demands for more flexible services, the routing policies in enterprise network becomes much richer.  ...  This hinders the development of new network services. In this paper, we present the design and implementation of a new forwarding table structure.  ...  We implement the FISE-based forwarding table on the linecard of a commercial router. Our design does not need any new device.  ... 
doi:10.1109/infocom.2014.6847941 dblp:conf/infocom/YangXWBW14 fatcat:75d4qvsffra7fnbphilzb3wvzm

A survey and comparison of peer-to-peer overlay network schemes

Eng Keong Lua, J. Crowcroft, M. Pias, R. Sharma, S. Lim
2005 IEEE Communications Surveys and Tutorials  
Given a key, a store operation (put(key,value)) lookup retrieval operation (value=get(key)) can be invoked to store and retrieve the data object corresponding to the key, which involves routing requests  ...  Lookup queries or message routing are forwarded across overlay paths to peers in a progressive manner, with the NodeIDs that are closer to the key in the identifier space.  ...  ACKNOWLEDGMENT The authors would like to thank the reviewers for their valuable comments.  ... 
doi:10.1109/comst.2005.1610546 fatcat:wbzstyu4yzddfbw4zmu5r3yzxm

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems [chapter]

Antony Rowstron, Peter Druschel
2001 Lecture Notes in Computer Science  
Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet.  ...  This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications.  ...  Fig. 10 . 10 Number of routing hops versus node failures, b = 4, |L| = 16, |M | = 32, 200,000 lookups and 5,000 nodes with 500 failing. Table 1 . 1 Pseudo code for Pastry core routing algorithm.  ... 
doi:10.1007/3-540-45518-3_18 fatcat:i5nvwyqpfzfqbp4mv4jzxtryym

Revealing the Autonomous System Taxonomy: The Machine Learning Approach [article]

Xenofontas Dimitropoulos, Dmitri Krioukov, George Riley, kc claffy
2006 arXiv   pre-print
In this paper, we introduce a radically new approach based on machine learning techniques to map all the ASes in the Internet into a natural AS taxonomy.  ...  Although the Internet AS-level topology has been extensively studied over the past few years, little is known about the details of the AS taxonomy.  ...  The prefix length of 24 bits is generally the smallest IPv4 prefix size that is globally routed, which suggests our last AS attribute to be the number of unique /24 prefixes found within the union of address  ... 
arXiv:cs/0604015v1 fatcat:bifljezgknhgjfyyneukass5a4

Full Function Firewalls and Fast Routing Query on MANETs

Ting Zhang, Dale Lindskog
2014 Journal of Internet Technology and Secured Transaction  
This paper proposes a routing storage and query mechanism for the ROFL firewall scheme, a mechanism that combines a hierarchical routing storage structure with a fast routing query method.  ...  ROFL, which stands for Routing as the Firewall Layer, is a firewall scheme designed mainly to prevent insider attacks on Mobile Ad Hoc Networks (MANETs).  ...  We focus on routing table storage size and CPU time for route lookups. We estimate routing table storage size based on an assumed network, and evaluate CPU time using appropriate algorithms.  ... 
doi:10.20533/jitst.2046.3723.2014.0025 fatcat:iy7wimconbazrkwrzrujrohira

3DLS

Roy Friedman, Noam Mori
2009 Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing - MobiHoc '09  
mechanism for adapting the lengths of the walks, in order to ensure good performance in varying circumstances and loads.  ...  A data location service (DLS) provides this capability.  ...  messages or other types of messages, which generates a significant amount of traffic. • The use of several multi-hop routing steps on each data advertisement/lookup.  ... 
doi:10.1145/1530748.1530791 dblp:conf/mobihoc/FriedmanM09 fatcat:gpb4tqy5dfgc3gtf5ta3vshkku

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

Antony Rowstron, Peter Druschel
2001 Proceedings of the eighteenth ACM symposium on Operating systems principles - SOSP '01  
Files stored in PAST are associated with a quasi-unique fileld that is generated at the time of the file's insertion into PAST.  ...  A storage utility like PAST is attractive for several reasons.  ...  Peter Druschel thanks Microsoft Research, Cambridge, UK, and the Massachussetts Institute of Technology for their support during his visits in Fail 2000 and Spring 2001, respectively, and Compaq for donating  ... 
doi:10.1145/502051.502053 fatcat:nhpugyz4zvdnrifi74ry6wimaq

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

Antony Rowstron, Peter Druschel
2001 Proceedings of the eighteenth ACM symposium on Operating systems principles - SOSP '01  
Files stored in PAST are associated with a quasi-unique fileld that is generated at the time of the file's insertion into PAST.  ...  A storage utility like PAST is attractive for several reasons.  ...  Peter Druschel thanks Microsoft Research, Cambridge, UK, and the Massachussetts Institute of Technology for their support during his visits in Fail 2000 and Spring 2001, respectively, and Compaq for donating  ... 
doi:10.1145/502034.502053 dblp:conf/sosp/RowstronD01 fatcat:ozg5hsdiezawva4bsxzcb6xbji

Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility

Antony Rowstron, Peter Druschel
2001 ACM SIGOPS Operating Systems Review  
Files stored in PAST are associated with a quasi-unique fileld that is generated at the time of the file's insertion into PAST.  ...  A storage utility like PAST is attractive for several reasons.  ...  Peter Druschel thanks Microsoft Research, Cambridge, UK, and the Massachussetts Institute of Technology for their support during his visits in Fail 2000 and Spring 2001, respectively, and Compaq for donating  ... 
doi:10.1145/502059.502053 fatcat:2rv5zi3gb5csfhzz5kzlyara3q
« Previous Showing results 1 — 15 out of 215 results