Improved degree search algorithms in unstructured P2P networks

DOI10.1155/2012/923023zbMath1264.68019OpenAlexW1973053649WikidataQ57631865 ScholiaQ57631865MaRDI QIDQ1955348

Qun Luo, Haipeng Peng, Lixiang Li, Guole Liu, 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)

Related Items (1)

A linear time complexity of breadth-first search using P system with membrane division

Cites Work

• Unnamed Item
• Optimizing random walk search algorithms in P2P networks
• On modified iterative method for nonexpansive mappings and monotone mappings
• Probabilistic flooding for efficient information dissemination in random graph topologies
• Survey of research towards robust peer-to-peer networks: search methods
• Critical line in undirected Kauffman Boolean networks — the role of percolation
• Rumors in a Network: Who's the Culprit?

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