loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07)
Service Discovery Reliability and Network Neighbor Knowledge in Pervasive Computing Environments
Niagara Falls, Ontario, Canada
May 21-May 23
ISBN: 0-7695-2847-3
Michael S. Thompson, Virginia Polytechnic Institute and State University, USA
Scott F. Midkiff, Virginia Polytechnic Institute and State University, USA
Current service discovery methods offer a single level of discovery reliability since they utilize a single method of discovery communication. However, the value of services vary by service type and consumer. Also, the number of similar services may vary. While it is acceptable to use best effort location in the case of a large number of similar or low-value services, it is undesirable to fail to locate available services in scenarios of high value services or situations where there is only a single instance of a desired service. Current schemes do not take into account variations in value or importance. This paper discusses the need for various levels of discovery reliability and our approach to fulfilling this need, including a discussion of development, testing, and experimental results. The results show that our reliability mechanisms provide higher levels of discovery probability when desired by a consumer.
Citation:
Michael S. Thompson, Scott F. Midkiff, "Service Discovery Reliability and Network Neighbor Knowledge in Pervasive Computing Environments," ainaw, vol. 2, pp.307-313, 21st International Conference on Advanced Information Networking and Applications Workshops (AINAW'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.