多媒體內容傳遞網路前瞻技術之研究-子計畫二： 對等式內容網路之搜尋與傳遞演算法及安全議題研究(2/2)
Date Issued
2005-07-31
Date
2005-07-31
Author(s)
DOI
932213E002057
Abstract
This project deliberates on various critical aspects in evaluating
searching networks. Existing metrics either draw biased conclusions regarding
search performance or provide wrong guidelines for algorithm design. We,
therefore, define a unified criterion, Search Efficiency (SE), to objectively
address search performance in a comprehensive manner. The goal of SE is to
better characterize performance of searching networks than existing metrics
do as well as to guide the design of future ones. We first validate the
correctness of SE in performance evaluation in an ideal graph, strictly binary
tree, by analyzing SE for two typical search methods, breadth first search and
random walk. We further show its strength in performance characterization in
the real-world topology, power-law random graph, under various network
conditions. We finally design an algorithm, dynamic search, based on SE
analysis. Its proved outstanding performance demonstrates the strength of SE
to provide guidance for the future design of searching networks.
Subjects
Combinatorics
Graph theory
Deterministic network calculus
Publisher
臺北市：國立臺灣大學電信工程學研究所
Type
report
File(s)![Thumbnail Image]()
Loading...
Name
932213E002057.pdf
Size
1.02 MB
Format
Adobe PDF
Checksum
(MD5):eca099871538a97ee682284f0881b68e