VPeers : A peer-to-peer service discovery framework for Virtual Manufacturing Organizations

Anbo XIANG*, Liming LIU, Qiong LUO

*Corresponding author for this work

Research output: Journal PublicationsJournal Article (refereed)

9 Citations (Scopus)

Abstract

We present VPeers, a peer-to-peer service discovery framework for a Virtual Manufacturing Organization (VMO). In our framework, each VPeer (a VMO member) publishes the services that it intends to share and maintains a list of friend VPeers that it has recently interacted with. When a VPeer receives a search query, it will first search its local services. If the search query is not satisfied locally, this VPeer will forward the query to its friend VPeers with an additional time constraint. This process continues recursively until the search query is fully satisfied or the time allowed by the constraint has elapsed. The features of the VPeers framework include: (1) a fully distributed search process; (2) a search query involving both string matches and range predicates; and (3) a ranking scheme that ranks search results by predefined quality measures. Our prototype implementation shows the feasibility of this approach.

Original languageEnglish
Pages (from-to)411-419
Number of pages9
JournalComputers in Industry
Volume59
Issue number5
DOIs
Publication statusPublished - May 2008
Externally publishedYes

Keywords

  • Decentralized service discovery
  • Peer-to-peer
  • Virtual Manufacturing Organization

Cite this

@article{0b1c4f1b4d6c433db10cdf62c1d07ae2,
title = "VPeers : A peer-to-peer service discovery framework for Virtual Manufacturing Organizations",
abstract = "We present VPeers, a peer-to-peer service discovery framework for a Virtual Manufacturing Organization (VMO). In our framework, each VPeer (a VMO member) publishes the services that it intends to share and maintains a list of friend VPeers that it has recently interacted with. When a VPeer receives a search query, it will first search its local services. If the search query is not satisfied locally, this VPeer will forward the query to its friend VPeers with an additional time constraint. This process continues recursively until the search query is fully satisfied or the time allowed by the constraint has elapsed. The features of the VPeers framework include: (1) a fully distributed search process; (2) a search query involving both string matches and range predicates; and (3) a ranking scheme that ranks search results by predefined quality measures. Our prototype implementation shows the feasibility of this approach.",
keywords = "Decentralized service discovery, Peer-to-peer, Virtual Manufacturing Organization",
author = "Anbo XIANG and Liming LIU and Qiong LUO",
year = "2008",
month = "5",
doi = "10.1016/j.compind.2008.02.003",
language = "English",
volume = "59",
pages = "411--419",
journal = "Computers in Industry",
issn = "0166-3615",
publisher = "Elsevier",
number = "5",

}

VPeers : A peer-to-peer service discovery framework for Virtual Manufacturing Organizations. / XIANG, Anbo; LIU, Liming; LUO, Qiong.

In: Computers in Industry, Vol. 59, No. 5, 05.2008, p. 411-419.

Research output: Journal PublicationsJournal Article (refereed)

TY - JOUR

T1 - VPeers : A peer-to-peer service discovery framework for Virtual Manufacturing Organizations

AU - XIANG, Anbo

AU - LIU, Liming

AU - LUO, Qiong

PY - 2008/5

Y1 - 2008/5

N2 - We present VPeers, a peer-to-peer service discovery framework for a Virtual Manufacturing Organization (VMO). In our framework, each VPeer (a VMO member) publishes the services that it intends to share and maintains a list of friend VPeers that it has recently interacted with. When a VPeer receives a search query, it will first search its local services. If the search query is not satisfied locally, this VPeer will forward the query to its friend VPeers with an additional time constraint. This process continues recursively until the search query is fully satisfied or the time allowed by the constraint has elapsed. The features of the VPeers framework include: (1) a fully distributed search process; (2) a search query involving both string matches and range predicates; and (3) a ranking scheme that ranks search results by predefined quality measures. Our prototype implementation shows the feasibility of this approach.

AB - We present VPeers, a peer-to-peer service discovery framework for a Virtual Manufacturing Organization (VMO). In our framework, each VPeer (a VMO member) publishes the services that it intends to share and maintains a list of friend VPeers that it has recently interacted with. When a VPeer receives a search query, it will first search its local services. If the search query is not satisfied locally, this VPeer will forward the query to its friend VPeers with an additional time constraint. This process continues recursively until the search query is fully satisfied or the time allowed by the constraint has elapsed. The features of the VPeers framework include: (1) a fully distributed search process; (2) a search query involving both string matches and range predicates; and (3) a ranking scheme that ranks search results by predefined quality measures. Our prototype implementation shows the feasibility of this approach.

KW - Decentralized service discovery

KW - Peer-to-peer

KW - Virtual Manufacturing Organization

UR - http://www.scopus.com/inward/record.url?scp=41649107647&partnerID=8YFLogxK

U2 - 10.1016/j.compind.2008.02.003

DO - 10.1016/j.compind.2008.02.003

M3 - Journal Article (refereed)

AN - SCOPUS:41649107647

VL - 59

SP - 411

EP - 419

JO - Computers in Industry

JF - Computers in Industry

SN - 0166-3615

IS - 5

ER -