Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
An Architecture for Secure Wide-Area Service Discovery
Edit
An Architecture for Secure Wide-Area Service Discovery   (Citations: 67)
BibTex | RIS | RefWorks Download
The widespread deployment of inexpensive communications technology, computational resources in the networking infrastruc- ture, and network-enabled end devices poses an interesting problem for end users: how to locate a particular network service or device out of hundreds of thousands of accessible services and devices. This paper presents the architecture and implementation of a secure wide-area Service Discovery Service (SDS). Service providers use the SDS to advertise descriptions of available or already running services, while clients use the SDS to compose complex queries for locating these services. Service descriptions and queries use the eXtensible Markup Language (XML) to encode such factors as cost, performance, location, and device- or service-specific capabilities. The SDS provides a fault-tolerant, incrementally scalable service for locating services in the wide-area. Security is a core component of the SDS: communica- tions are both encrypted and authenticated where necessary, and the system uses a hybrid access control list and capability system to control access to service information. Wide-area query routing is also a core component of the SDS: all information in the system is potentially reachable by all clients.
Journal: Wireless Networks - WINET , vol. 8, no. 2-3, pp. 213-230, 2002
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
More »
    • ...Signatures on sets, multisets, and Bloom lters can be used in a number of distributed data sharing applications, including peer-to-peer systems [14, 30, 24, 36], distributed caches [19, 9, 35], blacklisting services [17, 40, 39], and network ow monitoring systems [18]...

    Lei Wei, et al. Bounded vector signatures and their applications

    • ...Many organizations in industry and in academia have designed service discovery mechanisms [4-11]...
    • ...Representative examples in academia include MIT’s Intentional Naming System (INS) [4], UC Berkeley’s Ninja Service Discovery Service (Ninja SDS) [5], and IBM Research’s DEAPspace [6]...
    • ...In directory-based models, a directory will process service announcements, store the service information, and handle clients’ discovery requests [5, 8]. In non-directory-based models, other mechanisms (e.g., peer caching) are used [6, 17, 21-23]...
    • ...To support large number of services in wide areas, Ninja SDS uses Bloom filters to encode service attributes [5]...

    Feng Zhu, et al. DynamicSD: Discover Dynamic and Uncertain Services in Pervasive Comput...

    • ...Some systems only support data search [4][5] while others merely support service discovery [6]...

    Ying Zhang. Semantic-Based Data and Service Unified Discovery

    • ...An SBF can be used as a summarizing technique to aid global collaboration in peer-topeer (P2P) networks [5], [6], [7], to support probabilistic algorithms for routing and locating resources [8], [9], [10], [11], and to share web cache information [12]...

    Deke Guo, et al. The Dynamic Bloom Filters

    • ...In [9] Prototyping Service Discovery is proposed...

    Muhammad Taqi Raza, et al. FESP: Fast and Energy Efficient Service Provisioning in 6LoWPAN

Order by:

Citations (67)

Share this on | Contribute to Academic