'Dominating-set-based' searching in peer-to-peer networks

Yang, Chun-Lin; Li, Xiuqi

doi:10.1504/ijhpcn.2005.008562

Cited by 15 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Aiming at this, several search algorithms have been raised and have a favourable effect in practical applications (Tsoumakos and Roussopoulos, 2006;Watanobe et al, 2006;Yang and Li, 2005). Aiming at this, several search algorithms have been raised and have a favourable effect in practical applications (Tsoumakos and Roussopoulos, 2006;Watanobe et al, 2006;Yang and Li, 2005).…”

Section: Search Algorithms On Distributed Networkmentioning

confidence: 99%

Interest overlay network model on distributed social network service

Liao

Zhang

2016

IJES

View full text Add to dashboard Cite

The social network service brings convenience for users around the world, as well as many kinds of problems especially data isolation between different service providers. In this paper, we are discussing a kind of distributed social network service platform like Diaspora. A model called "interest overlay" along with dependent algorithms was proposed to solve recommendation problem in social network service under distributed environment. The interest overlay model is able to overcome the disadvantage of distributed social network service and improve the quality of recommendation.

show abstract

Section: Search Algorithms On Distributed Networkmentioning

confidence: 99%

Interest overlay network model on distributed social network service

Liao

Zhang

2016

IJES

View full text Add to dashboard Cite

show abstract

“…If p∊ D, i.e. p is a dominator, let u = p, f' = f, C' = C, D' = D, the node is removed after performing (8).…”

Section: Index Maintenancementioning

confidence: 99%

Dominating-Set-Index based Searching Algorithm in Mobile P2P Networks

Chang¹,

Wang²,

Sun³

2014

JCM

View full text Add to dashboard Cite

1-Because of the isomorphism between P2P networks and mobile ad hoc networks (MANET), many research communities are focusing on the work based on the combination of P2P and the backbone strategy, and this produces a field called mobile peer-to-peer (MP2P) networks. An effective algorithm for searching and retrieving information has proven to make a great impact on the performance of MP2P systems. Based on the connected dominating-set (CDS), which overlays the whole Mobile P2P ad hoc network, we propose a dominating-set-index based searching algorithm, named DSI, using dominating set indices to maximize the return of search results. DSI periodically advertises information of shared resources on the backbone of current network topology in a distributed fashion. Similar information will be clustered close to the backbone network. This can accelerate the searching process, as the resource location information is placed close to normal nodes. Both theoretical analysis and experimental results show that DSI outperforms the existing searching algorithms in MANET, OLSR, local index tree (LIT) and pure flooding, in terms of network workload and degree of user satisfaction.

show abstract

“…These works include iterative deepening [7], k-walker random walk [8], modified random BFS [9], two-level k-walker random walk [10], directed BFS [12], intelligent search [9], local indices based search [12], routing indices based search [11], attenuated bloom filter based search [12], adaptive probabilistic search [12], and dominating set based search [13]. They can be classified as BFS based or Depth First Search (DFS) based.…”

Section: Related Workmentioning

confidence: 99%

State-Based Search Strategy in Unstructured P2P

Liu

et al. 2010

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing

View full text Add to dashboard Cite

Efficient resource search in large-scale unstructured peer-to-peer (P2P) systems remains a fundamental challenge. In order to improve search performance, interest-based search is a good way to tackle the challenge. However, the existing interest-based search algorithms pay attention to user interest model and search history, but ignore some influence factors of improving performance. In this paper, through analysis of node's multi-dimensional quality-of-service (QoS) for search, it is found that node state's information is essential for improving search performance. So a State-Based Search (SBS) strategy is presented by improving Sripanidkulchai's interestbased search model, where Node's state evaluation is based on node's QoS fuzzification. The SBS enhances the methods of shortcuts adding, ranking and selecting, and state's life-cycle is predicted by grey theory. The experimental results show that the SBS can improve performance by reducing search response time and achieving load balance.

show abstract

'Dominating-set-based' searching in peer-to-peer networks

Cited by 15 publications

References 12 publications

Interest overlay network model on distributed social network service

Interest overlay network model on distributed social network service

Dominating-Set-Index based Searching Algorithm in Mobile P2P Networks

State-Based Search Strategy in Unstructured P2P

Contact Info

Product

Resources

About