1022 |
|
|
1023 |
|
|
1024 |
|
|
1025 |
\parbox{90pt}{Query routing \cite{sit02securitycons}, \cite{aspnes02faultrouting}, \cite{castro02securerouting}, \cite{ratnasamy02routing}, \cite{gavoille01routing}} & |
\parbox{90pt}{Query routing \cite{sit02securitycons}, \cite{aspnes02faultrouting}, \cite{castro02securerouting}, \cite{ratnasamy02routing}, \cite{gavoille01routing}, \cite{lynch02atomicdataaccess}} & |
1026 |
\parbox{110pt}{Incorrect forwarding (hostile), incorrect routing (hostile)} & |
\parbox{110pt}{Incorrect forwarding (hostile), incorrect routing (hostile)} & |
1027 |
\parbox{110pt}{Query monitoring, cross check routing tables, verify routing tables, create routing table invariants} & |
\parbox{110pt}{Query monitoring, cross check routing tables, verify routing tables, create routing table invariants} & |
1028 |
\parbox{110pt}{Increases system complexity} |
\parbox{110pt}{Increases system complexity} |
1029 |
\\ \hline |
\\ \hline |
1030 |
|
|
1031 |
|
|
1032 |
\parbox{90pt}{DoS attack \cite{sit02securitycons}, \cite{saia02dynamicfaultcontentnetwork}, \cite{datar02butterflies}, \cite{daswani02queryflooddos}} & |
\parbox{90pt}{DoS attack \cite{sit02securitycons}, \cite{saia02dynamicfaultcontentnetwork}, \cite{datar02butterflies}, \cite{daswani02queryflooddos}, \cite{juels99clientpuzzles}} & |
1033 |
\parbox{110pt}{Distributed, controlled burden againts specific computer(s)} & |
\parbox{110pt}{Distributed, controlled burden againts specific computer(s)} & |
1034 |
\parbox{110pt}{Client puzzles, load balancing, traffic measurements, traffic models, replication} & |
\parbox{110pt}{Client puzzles, load balancing, traffic measurements, traffic models, replication} & |
1035 |
\parbox{110pt}{Only partial solutions, traffic models most effective} |
\parbox{110pt}{Only partial solutions, traffic models most effective} |
1071 |
\\ \hline |
\\ \hline |
1072 |
|
|
1073 |
|
|
1074 |
\parbox{90pt}{Anonymity \cite{reiter98crowds}, \cite{tarzan:ccs9}, \cite{pub00}, \cite{clarke00freenet}} & |
\parbox{90pt}{Anonymity \cite{reiter98crowds}, \cite{tarzan:ccs9}, \cite{pub00}, \cite{clarke00freenet}, \cite{reiter98crowds}, \cite{352607},\cite{502002}} & |
1075 |
\parbox{110pt}{Anonymity cannot be provided in all cases} & |
\parbox{110pt}{Anonymity cannot be provided in all cases} & |
1076 |
\parbox{110pt}{Remailers, pre-routing} & |
\parbox{110pt}{Remailers, pre-routing} & |
1077 |
\parbox{110pt}{Total anonymity cannot be provided yet} |
\parbox{110pt}{Total anonymity cannot be provided yet} |
1143 |
|
|
1144 |
\endfoot |
\endfoot |
1145 |
|
|
1146 |
\parbox{90pt}{Web indexing and searching \cite{li03feasibility}, \cite{Bhattacharjee03resultcache}, \cite{362692}} & |
\parbox{90pt}{Web indexing and searching \cite{li03feasibility}, \cite{Bhattacharjee03resultcache}, \cite{362692}, \cite{CuencaAcuna2002DSIWorkshop}, \cite{rhea02probabilistic}, \cite{joseph02neurogrid}, \cite{crespo02semanticoverlay}, \cite{joseph02p2players}, \cite{chord:om_p-meng}} & |
1147 |
\parbox{110pt}{Perform Web like searches in Peer-to-Peer network} & |
\parbox{110pt}{Perform Web like searches in Peer-to-Peer network} & |
1148 |
\parbox{110pt}{Data compression, view trees, bloom filters and its variations, gap compression, index intersection optimizations, clustering} & |
\parbox{110pt}{Data compression, view trees, bloom filters and its variations, gap compression, index intersection optimizations, clustering} & |
1149 |
\parbox{110pt}{Effective but complex solutions, some compromises have to be done (decrease result quality, modify overlay's structure), more research needed} |
\parbox{110pt}{Effective but complex solutions, some compromises have to be done (decrease result quality, modify overlay's structure), more research needed} |
1150 |
\\ \hline |
\\ \hline |
1151 |
|
|
1152 |
|
|
1153 |
\parbox{90pt}{Efficient data discovery \cite{lv02searchreplication}, \cite{osokine02distnetworks}, \cite{yang02improvingsearch}} & |
\parbox{90pt}{Efficient data discovery \cite{lv02searchreplication}, \cite{osokine02distnetworks}, \cite{yang02improvingsearch}, \cite{lv02gnutellascalable}, \cite{ganesan02yappers}, \cite{adamic02localsearch}, \cite{adamic01powerlawsearch}, \cite{ripeanu02mappinggnutella}, \cite{milgram67smallworld}, \cite{adamic99small}, \cite{sterling95beowulf}, \cite{ramanathan02goodpeers}, \cite{kleinberg99small}, \cite{nips02-Kleinberg}, \cite{zhang02using}, \cite{watts00dynamics}} & |
1154 |
\parbox{110pt}{Find resources efficiently, if resource exists (loosely structured)} & |
\parbox{110pt}{Find resources efficiently, if resource exists (loosely structured)} & |
1155 |
\parbox{110pt}{Super nodes, node clusters, caching techiques} & |
\parbox{110pt}{Super nodes, node clusters, caching techiques} & |
1156 |
\parbox{110pt}{More efficient, less network traffic, not comparable to DHT's efficiency} |
\parbox{110pt}{More efficient, less network traffic, not comparable to DHT's efficiency} |
1164 |
\\ \hline |
\\ \hline |
1165 |
|
|
1166 |
|
|
1167 |
\parbox{90pt}{Robustness} & |
\parbox{90pt}{Robustness \cite{datar02butterflies}, \cite{saia02dynamicfaultcontentnetwork}, \cite{fiat02censorship}, \cite{aspnes02faultrouting}, \cite{albert-00-tolerance}} & |
1168 |
\parbox{110pt}{How well system performs under hostile attacks/in the case of severe failure ?} & |
\parbox{110pt}{How well system performs under hostile attacks/in the case of severe failure ?} & |
1169 |
\parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law networks/properties} & |
\parbox{110pt}{Self-tuning, backup links, use diverse routing paths, power-law networks/properties} & |
1170 |
\parbox{110pt}{Working solutions} |
\parbox{110pt}{Working solutions} |
1178 |
\\ \hline |
\\ \hline |
1179 |
|
|
1180 |
|
|
1181 |
\parbox{90pt}{Data availability/persistency} & |
\parbox{90pt}{Data availability/persistency \cite{bhagwan03availability}} & |
1182 |
\parbox{110pt}{Data might be temporarily unavailable, or lost permanently} & |
\parbox{110pt}{Data might be temporarily unavailable, or lost permanently} & |
1183 |
\parbox{110pt}{Data caching, data replication} & |
\parbox{110pt}{Data caching, data replication} & |
1184 |
\parbox{110pt}{Working solutions, but creates more traffic and overhead per node} |
\parbox{110pt}{Working solutions, but creates more traffic and overhead per node} |
1185 |
\\ \hline |
\\ \hline |
1186 |
|
|
1187 |
|
|
1188 |
\parbox{90pt}{Network proximity \cite{pias03lighthouse}, \cite{ng02predicting}} & |
\parbox{90pt}{Network proximity \cite{pias03lighthouse}, \cite{ng02predicting}, \cite{ratnasamy02ght}, \cite{eriksson03peernet}, \cite{castro02networkproximity}} & |
1189 |
\parbox{110pt}{Can we take account the underlying network's properties better when forming overlay network (network-awareness for performance) ?} & |
\parbox{110pt}{Can we take account the underlying network's properties better when forming overlay network (network-awareness for performance) ?} & |
1190 |
\parbox{110pt}{Global Network Positioning, Lighthouse technique, trianqulated heuristics} & |
\parbox{110pt}{Global Network Positioning, Lighthouse technique, trianqulated heuristics} & |
1191 |
\parbox{110pt}{Increases system complexity, no real world experience in a wide scale, proposed solutions are susceptible to single point of failure} |
\parbox{110pt}{Increases system complexity, no real world experience in a wide scale, proposed solutions are susceptible to single point of failure} |
1192 |
\\ \hline |
\\ \hline |
1193 |
|
|
1194 |
|
|
1195 |
\parbox{90pt}{Locality} & |
\parbox{90pt}{Locality \cite{keleher-02-p2p}, \cite{hildrum02distributedobject}, \cite{freedman02trie}, \cite{sloppy:iptps03}, \cite{plaxton97accessingnearby}, \cite{karger02findingnearest}} & |
1196 |
\parbox{110pt}{Could DHTs exploit locality properties better ?} & |
\parbox{110pt}{Could DHTs exploit locality properties better ?} & |
1197 |
\parbox{110pt}{Constrained Load Balancing, using network properties for nearest neighbor selection, self-organizing clusters} & |
\parbox{110pt}{Constrained Load Balancing, using network properties for nearest neighbor selection, self-organizing clusters} & |
1198 |
\parbox{110pt}{Working solutions} |
\parbox{110pt}{Working solutions} |
1199 |
\\ \hline |
\\ \hline |
1200 |
|
|
1201 |
|
|
1202 |
\parbox{90pt}{Hotspots} & |
\parbox{90pt}{Hotspots \cite{258660}, \cite{sloppy:iptps03}, \cite{maymounkov03ratelesscodes}} & |
1203 |
\parbox{110pt}{What will happen if some resource is extremely popular and only one node is hosting it ?} & |
\parbox{110pt}{What will happen if some resource is extremely popular and only one node is hosting it ?} & |
1204 |
\parbox{110pt}{Caching, multisource downloads, replication, load balancing, sloppy hashing} & |
\parbox{110pt}{Caching, multisource downloads, replication, load balancing, sloppy hashing} & |
1205 |
\parbox{110pt}{For query hotspots, caching and multisource downloads efficiently reduces hotspots, for routing hotspots, benefits are smaller} |
\parbox{110pt}{For query hotspots, caching and multisource downloads efficiently reduces hotspots, for routing hotspots, benefits are smaller} |
1212 |
\parbox{110pt}{Better scalability, but not comparable to DHTs} |
\parbox{110pt}{Better scalability, but not comparable to DHTs} |
1213 |
\\ \hline |
\\ \hline |
1214 |
|
|
1215 |
\parbox{90pt}{Load balancing} & |
\parbox{90pt}{Load balancing \cite{rao03loadbalancing}, \cite{ledlie02selfp2p}, \cite{byers03dhtbalancing}} & |
1216 |
\parbox{110pt}{Random (but uniformly distributed) identifier selection could cause systen imbalance among participants with different capabilities} & |
\parbox{110pt}{Random (but uniformly distributed) identifier selection could cause systen imbalance among participants with different capabilities} & |
1217 |
\parbox{110pt}{Caching, virtual server transfers} & |
\parbox{110pt}{Caching, virtual server transfers} & |
1218 |
\parbox{110pt}{Effective, more research required in fully dynamic environment} |
\parbox{110pt}{Effective, more research required in fully dynamic environment} |
1219 |
\\ \hline |
\\ \hline |
1220 |
|
|
1221 |
\parbox{90pt}{System in flux} & |
\parbox{90pt}{System in flux \cite{libennowell01observations}, \cite{571863}, \cite{ledlie02selfp2p}, \cite{albert-02-statistical}} & |
1222 |
\parbox{110pt}{Nodes join and leave system constantly. What about load balancing and performance ?} & |
\parbox{110pt}{Nodes join and leave system constantly. What about load balancing and performance ?} & |
1223 |
\parbox{110pt}{Half-life phenomenon (for analysis), simple overlay maintenance and construction protocol} & |
\parbox{110pt}{Half-life phenomenon (for analysis), simple overlay maintenance and construction protocol} & |
1224 |
\parbox{110pt}{Initial theoretical analysis have been created, but not comprehensive model for analysing different system states and its variations (e.g. complex usage patterns)} |
\parbox{110pt}{Initial theoretical analysis have been created, but not comprehensive model for analysing different system states and its variations (e.g. complex usage patterns)} |
1225 |
\\ \hline |
\\ \hline |
1226 |
|
|
1227 |
\parbox{90pt}{Sudden network partition} & |
\parbox{90pt}{Sudden network partition \cite{harvey03skipnet1}, \cite{harvey03skipnet2}, \cite{rowston03controlloingreliability}} & |
1228 |
\parbox{110pt}{Sub network is isolated from other network because of network disconnection} & |
\parbox{110pt}{Sub network is isolated from other network because of network disconnection} & |
1229 |
\parbox{110pt}{Self-tuning, environment observatorion, localized network connection for minimun latency (backup connections)} & |
\parbox{110pt}{Self-tuning, environment observatorion, localized network connection for minimun latency (backup connections)} & |
1230 |
\parbox{110pt}{Creates more overhead/space requirements per node} |
\parbox{110pt}{Creates more overhead/space requirements per node} |
1237 |
\\ \hline |
\\ \hline |
1238 |
|
|
1239 |
|
|
1240 |
\parbox{90pt}{Byzantine faults} & |
\parbox{90pt}{Byzantine faults \cite{296824}} & |
1241 |
\parbox{110pt}{Faulty nodes may behave arbitrarily} & |
\parbox{110pt}{Faulty nodes may behave arbitrarily} & |
1242 |
\parbox{110pt}{Byzantine replication protocols -> get information from multiple entities, trust majority's opinion} & |
\parbox{110pt}{Byzantine replication protocols -> get information from multiple entities, trust majority's opinion} & |
1243 |
\parbox{110pt}{Much research has been done on this field, practical solutions, decreases system's, performance slighly} |
\parbox{110pt}{Much research has been done on this field, practical solutions, decreases system's, performance slighly} |
1275 |
\endfoot |
\endfoot |
1276 |
|
|
1277 |
|
|
1278 |
\parbox{90pt}{Mutual distrust} & |
\parbox{90pt}{Mutual distrust, \cite{cornelli02reputableservents}, \cite{aberer01trust}} & |
1279 |
\parbox{110pt}{Nobody trusts anybody} & |
\parbox{110pt}{Nobody trusts anybody} & |
1280 |
\parbox{110pt}{Reputation methods, key infrastructures} & |
\parbox{110pt}{Reputation methods, key infrastructures} & |
1281 |
\parbox{110pt}{Resource demanding, not practical to implement/not working solutions, no real world experience in a wide scale} |
\parbox{110pt}{Resource demanding, not practical to implement/not working solutions, no real world experience in a wide scale} |
1282 |
\\ \hline |
\\ \hline |
1283 |
|
|
1284 |
|
|
1285 |
\parbox{90pt}{Lack of motivation to cooperate} & |
\parbox{90pt}{Lack of motivation to cooperate \cite{golle01incentivesp2p}} & |
1286 |
\parbox{110pt}{All participants do not behave like they should be, instead they go for own profit} & |
\parbox{110pt}{All participants do not behave like they should be, instead they go for own profit} & |
1287 |
\parbox{110pt}{Different reputation methods} & |
\parbox{110pt}{Different reputation methods} & |
1288 |
\parbox{110pt}{No real world experience in a wide scale} |
\parbox{110pt}{No real world experience in a wide scale} |
1289 |
\\ \hline |
\\ \hline |
1290 |
|
|
1291 |
|
|
1292 |
\parbox{90pt}{Heterogeneity} & |
\parbox{90pt}{Heterogeneity \cite{saroiu02measurementstudyp2p}, \cite{brinkmann02compactplacement}, \cite{zhao02brocade},\cite{gurmeet03symphony}} & |
1293 |
\parbox{110pt}{There are different kind of nodes in the system, in light of bandwidth and computing power} & |
\parbox{110pt}{There are different kind of nodes in the system, in light of bandwidth and computing power} & |
1294 |
\parbox{110pt}{Super peers (broadcasting), cluster (broadcasting) additional layer upon DHTs, structural simplicity (DHTs)} & |
\parbox{110pt}{Super peers (broadcasting), cluster (broadcasting) additional layer upon DHTs, structural simplicity (DHTs)} & |
1295 |
\parbox{110pt}{Working solutions, increases system complexity (additional layer)} |
\parbox{110pt}{Working solutions, increases system complexity (additional layer)} |
1296 |
\\ \hline |
\\ \hline |
1297 |
|
|
1298 |
|
|
1299 |
\parbox{90pt}{Programming guidelines \cite{zhao03api}, \cite{frise02p2pframework}, \cite{babaoglu02anthill}, \cite{rhea03benchmarks}} & |
\parbox{90pt}{Programming guidelines \cite{zhao03api}, \cite{frise02p2pframework}, \cite{babaoglu02anthill}, \cite{rhea03benchmarks}, \cite{garciamolina03sil}, \cite{balakrishnan03semanticfree}} & |
1300 |
\parbox{110pt}{Set of programming guidelines/frameworks is needed for better interoperability between different systems} & |
\parbox{110pt}{Set of programming guidelines/frameworks is needed for better interoperability between different systems} & |
1301 |
\parbox{110pt}{Common frameworks and APIs} & |
\parbox{110pt}{Common frameworks and APIs} & |
1302 |
\parbox{110pt}{Common framework/API is still missing, a few proposals have been made (DHTs)} |
\parbox{110pt}{Common framework/API is still missing, a few proposals have been made (DHTs)} |
1310 |
\\ \hline |
\\ \hline |
1311 |
|
|
1312 |
|
|
1313 |
\parbox{90pt}{Overlay management and health monitoring} & |
\parbox{90pt}{Overlay management and health monitoring \cite{zhang03somo}} & |
1314 |
\parbox{110pt}{System is self-capable to monitor it's status and health for better performance} & |
\parbox{110pt}{System is self-capable to monitor it's status and health for better performance} & |
1315 |
\parbox{110pt}{Build a metadata overlay atop of structured overlay (such as SOMO for structured overlays), make local decisions about overlay (unstrucured)} & |
\parbox{110pt}{Build a metadata overlay atop of structured overlay (such as SOMO for structured overlays), make local decisions about overlay (unstrucured)} & |
1316 |
\parbox{110pt}{For structured overlays, efficient and simple to implement, fault-tolerance unknowns, for unstructured, not necessarily efficient because decisions are based on local knowledge} |
\parbox{110pt}{For structured overlays, efficient and simple to implement, fault-tolerance unknowns, for unstructured, not necessarily efficient because decisions are based on local knowledge} |