Abstract
Current simulations of P2P-networks don't take any kind of schemas into account. We present a simulation-framework and first results for query routing based on extensible schema information to describe peer content, providing more value than simple categorizations like the filename as abstraction for an MP3song. Using different parameterization, we compare the impact of introducing the HyperCuP-topology in a P2P-network for routing and possible clustering in super-peers and discuss first simulation results. © Springer-Verlag 2004.
Cite
CITATION STYLE
Siberski, W., & Thaden, U. (2004). A simulation framework for schema-based query routing in P2P-networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3268, 436–445. https://doi.org/10.1007/978-3-540-30192-9_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
