Improved degree search algorithms in unstructured P2P networks

DOI10.1155/2012/923023MaRDI QIDQ1955348zbMATH OpenOpenAlexWikidataFDO

Authors Guole Liu, Haipeng Peng, Lixiang Li, Qun Luo, Yi-Xian Yang

Publication date 11 June 2013

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2012/923023

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Internet topics (68M11)

Recommendations

• Divisional searching strategy based on degree in unstructured P2P networks
• Novel approaches to efficient flooding search in peer-to-peer networks
• Random walk search in unstructured P2P
• Optimizing random walk search algorithms in P2P networks
• An efficient adaptive strategy for searching in peer-to-peer networks

Cites work

• scientific article; zbMATH DE number 5454133 (Why is no real title available?)
• Critical line in undirected Kauffman Boolean networks — the role of percolation
• On modified iterative method for nonexpansive mappings and monotone mappings
• Optimizing random walk search algorithms in P2P networks
• Probabilistic flooding for efficient information dissemination in random graph topologies
• Rumors in a Network: Who's the Culprit?
• Survey of research towards robust peer-to-peer networks: search methods

Cited in

(3)

• Divisional searching strategy based on degree in unstructured P2P networks
• scientific article; zbMATH DE number 5072496 (Why is no real title available?)
• A linear time complexity of breadth-first search using P system with membrane division

This page was built for publication: Improved degree search algorithms in unstructured P2P networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955348)