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

The connection between information theory and object search in networks

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)
Hong Huang ; Klipsch Sch. of Electr. & Comput. Eng., New Mexico State Univ., Las Cruces, NM

This paper aims to establish a connection between information theory and object search in networks. We make two contributions:1) Using information theoretical arguments, we establish fundamental lower bounds on lookup table sizes and search step numbers. These bounds generalize those derived previously and can deal with non-uniform lookup distributions and object popularities. 2) Using the analogy between search sequences and data compression and coding, we propose a distributed implementation of Shannon code that can reduce the expected length of search sequences to an arbitrarily small value at the cost of at most doubling the table sizes.

Published in:

Communications Letters, IEEE  (Volume:12 ,  Issue: 12 )

Date of Publication:

December 2008

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.