Service Discovery in DEAPspace

        A new algorithm is presented through which a computing device can detect the presence of neighbouring devices, share configuration and service information with those devices, and also notice when devices become unavailable. This solution minimizes the number of transimssions required from individual devices, while allowing devices with better power availability to further reduce the transmission requirement imposed on the other devices. Evidence is presented to demonstrate the effectiveness of this algorithm.

By: Michael Nidd

Published in: RZ3149 in 1999

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

rz3149.ps

Questions about this service can be mailed to reports@us.ibm.com .