SPSD: A Scalable P2P-based Service Discovery architecture

Wassef Louati; Djamai Zeghlache

doi:10.1109/WCNC.2007.481

SPSD: A Scalable P2P-based Service Discovery architecture

Wassef Louati, Djamai Zeghlache

CNRS SAMOVAR UMR 5157

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

A peer-to-peer (P2P)-based service discovery architecture for large-scale networks is presented. Services and queries are described using XML with descriptions mapped to numeric keys that preserve expressiveness. The architecture relies on a trie-based data structure built on top of a Distributed Hash Table (DHT) to perform key-based routing of descriptions in service resolvers. Performance analysis and evaluation results collected from an emulation of the system show that the architecture is scalable, efficient and capable of load balancing for both service distribution and query resolution.

Original language	English
Title of host publication	2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
Pages	2588-2593
Number of pages	6
DOIs	https://doi.org/10.1109/WCNC.2007.481
Publication status	Published - 27 Nov 2007
Externally published	Yes
Event	2007 IEEE Wireless Communications and Networking Conference, WCNC 2007 - Kowloon, China Duration: 11 Mar 2007 → 15 Mar 2007

Publication series

Name	IEEE Wireless Communications and Networking Conference, WCNC
ISSN (Print)	1525-3511

Conference

Conference	2007 IEEE Wireless Communications and Networking Conference, WCNC 2007
Country/Territory	China
City	Kowloon
Period	11/03/07 → 15/03/07

Access to Document

10.1109/WCNC.2007.481

Cite this

@inproceedings{347c7186180d40a3af74b2e5bc6ec171,

title = "SPSD: A Scalable P2P-based Service Discovery architecture",

abstract = "A peer-to-peer (P2P)-based service discovery architecture for large-scale networks is presented. Services and queries are described using XML with descriptions mapped to numeric keys that preserve expressiveness. The architecture relies on a trie-based data structure built on top of a Distributed Hash Table (DHT) to perform key-based routing of descriptions in service resolvers. Performance analysis and evaluation results collected from an emulation of the system show that the architecture is scalable, efficient and capable of load balancing for both service distribution and query resolution.",

author = "Wassef Louati and Djamai Zeghlache",

year = "2007",

month = nov,

day = "27",

doi = "10.1109/WCNC.2007.481",

language = "English",

isbn = "1424406595",

series = "IEEE Wireless Communications and Networking Conference, WCNC",

pages = "2588--2593",

booktitle = "2007 IEEE Wireless Communications and Networking Conference, WCNC 2007",

note = "2007 IEEE Wireless Communications and Networking Conference, WCNC 2007 ; Conference date: 11-03-2007 Through 15-03-2007",

}

Louati, W & Zeghlache, D 2007, SPSD: A Scalable P2P-based Service Discovery architecture. in 2007 IEEE Wireless Communications and Networking Conference, WCNC 2007., 4204657, IEEE Wireless Communications and Networking Conference, WCNC, pp. 2588-2593, 2007 IEEE Wireless Communications and Networking Conference, WCNC 2007, Kowloon, China, 11/03/07. https://doi.org/10.1109/WCNC.2007.481

TY - GEN

T1 - SPSD

T2 - 2007 IEEE Wireless Communications and Networking Conference, WCNC 2007

AU - Louati, Wassef

AU - Zeghlache, Djamai

PY - 2007/11/27

Y1 - 2007/11/27

N2 - A peer-to-peer (P2P)-based service discovery architecture for large-scale networks is presented. Services and queries are described using XML with descriptions mapped to numeric keys that preserve expressiveness. The architecture relies on a trie-based data structure built on top of a Distributed Hash Table (DHT) to perform key-based routing of descriptions in service resolvers. Performance analysis and evaluation results collected from an emulation of the system show that the architecture is scalable, efficient and capable of load balancing for both service distribution and query resolution.

AB - A peer-to-peer (P2P)-based service discovery architecture for large-scale networks is presented. Services and queries are described using XML with descriptions mapped to numeric keys that preserve expressiveness. The architecture relies on a trie-based data structure built on top of a Distributed Hash Table (DHT) to perform key-based routing of descriptions in service resolvers. Performance analysis and evaluation results collected from an emulation of the system show that the architecture is scalable, efficient and capable of load balancing for both service distribution and query resolution.

U2 - 10.1109/WCNC.2007.481

DO - 10.1109/WCNC.2007.481

M3 - Conference contribution

AN - SCOPUS:36349017909

SN - 1424406595

SN - 9781424406593

T3 - IEEE Wireless Communications and Networking Conference, WCNC

SP - 2588

EP - 2593

BT - 2007 IEEE Wireless Communications and Networking Conference, WCNC 2007

Y2 - 11 March 2007 through 15 March 2007

ER -

SPSD: A Scalable P2P-based Service Discovery architecture

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this