Cart (Loading....) | Create Account
Close category search window
 

An effective longest prefix matching algorithm for speeding up query routing in skip graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Ming Xu ; Sch. of Comput. Sci., Fudan Univ., Shanghai, China

The tremendous growth of public interest in peer-to-peer (P2P) networks in recent years has initiated a lot of research work on how to design efficient overlay structures for P2P systems. Structured overlay networks that based on various distributed hash tables (DHTs) provide no control over where data is stored and cannot support range queries directly. Ordered overlays such as skip graphs and SkipNet have obviously practical advantages over DHTs, which can support several locality properties and range queries. This paper presents a novel longest prefix matching algorithm for speeding up query routing in skip graphs without consumption of extra memory space. A novel data structure called triple linked list (TLL) is designed to store each node's pointers in the network. Experimental results show that the TLL-based longest prefix matching algorithm can speed up both exact-match and range queries in different network sizes.

Published in:

Communications and Information Technology, 2009. ISCIT 2009. 9th International Symposium on

Date of Conference:

28-30 Sept. 2009

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.