CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES

DOI10.1142/S0129054104002601MaRDI QIDQ3022020zbMATH OpenFDO

Authors Mojca Ciglarič

Publication date 22 June 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

floodingdistributed searchcontent-based routingcontent networkpeer-to-peer networking

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14)

Recommendations

• Solving replica placement and request distribution in content distribution networks
• Using taxonomies for content-based routing with ants
• Optimization of a peer-to-peer system for efficient content replication
• scientific article; zbMATH DE number 1928256
• A new consistency algorithm for dynamic documents in content distribution networks.

Cites work

• Collective dynamics of `small-world' networks

Cited in

(6)

• A new consistency algorithm for dynamic documents in content distribution networks.
• scientific article; zbMATH DE number 2016052 (Why is no real title available?)
• Solving replica placement and request distribution in content distribution networks
• Using taxonomies for content-based routing with ants
• Optimal node-selection algorithm for parallel download in overlay content-distribution networks
• On the asymptotic content routing stretch in network of caches: impact of popularity learning

This page was built for publication: CONTENT NETWORKS: DISTRIBUTED ROUTING DECISIONS IN PRESENCE OF REPEATED QUERIES

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