In our theses we used efficient algorithms that exploits the metadata from the stored documents. The easiest case was when the documents already contained specific fields for the metadata, for example in case of text documents described with a schema defined by the Dublin Core initiative, or the mp3 music files with ID3 tags. For short text documents, there are also efficient implementations of the TFIDF algorithm to retrieve the describing keywords. There are methods elaborated to characterize audio and video streams, pictures and other kinds of documents by analyzing them with a more complex algorithm, however, such kind of algorithms cannot be used in mobile devices efficiently because of the low com-puting and storage capacities of these computers. Research efforts are initiated to design a distributed version of these algorithms, and also there are investigations on persistent metadata storage in Peer-to-Peer networks. We designed our system to be able to incorporate the results of these researches when available.
We designed our protocol to be fully unstructured, and therefore, it can be utilized even in an ad-hoc situation. However, there might be cases when we can expect few dedicated, long-running nodes with higher amount of resources. Such a situation can be utilized to construct a semi-structured network that can decrease the time required to find and establish semantic connections. The chances of a structured solution in the dynamic environment should also be investigated.
The SemPeer protocol extension does not deal with the situation when there are very unpopular topics in the network. In that case it could happen that the random query propagation graphs do not contain any node that shares this topic and obtains further connections to similar nodes. To discover such similar nodes, one solution can be the issuing of "walker" messages, that is, messages with very high T T L value, and these messages should be propagated through one outlink
Chapter 8. Conclusions 122 per node only. However, walker solutions constrain peer autonomy and can hardly guarantee that the walker message returns with success. An optimal unstructured solution is still subject of further research.
The effectiveness of the semantic overlay networks highly depends on the quality of metadata provided by the nodes in the network. Therefore, nodes are exposed to information derived by others in the network (in our case, for example, the reply profile is such outer information), and therefore, they depend on the correct behavior of other nodes. However, there can always be evil or misbehaving clients that may send incorrect protocol data, usually to procure incoming connections to circulate their unwanted advertisements in the network. Although our SemPeer protocol can reveal such clients in time, with the incorporation and customization of distributed trust management such connections could be fully avoided. Mea-surements should be performed to compare the overhead of a reputation system to the expectable loss caused by the misbehaving nodes.
Bibliography
[Andersson et al., 2006] Andersson, C., Freeman, D., James, I., Johnston, A., and Ljung, S. (2006). Mobile Media and Applications, From Concept to Cash: Suc-cessful Service Creation and Launch. Wiley.
[Assadi, 1998] Assadi, H. (1998). Construction of a regional ontology from text and its use within a documentary system. In Proc. of International Conference on Formal Ontology and Information Systems, (FOIS-98).
[Barabási, 2002] Barabási, A. L. (2002). Linked. The New Science of Networks.
Cambridge MA: Perseus Publishing.
[Berger, 1985] Berger, J. O. (1985). Statistical Decision Theory and Bayesian Analysis. Springer, second edition edition.
[Berger, 1999] Berger, J. O. (1999). Statistical Decision Theory and Bayesian Statistics. Second dition. Springer Verlag, New York. ISBN 0-387-96098-8 and also ISBN 3-540-96098-8.
[Bestavros, 1996] Bestavros, A. (1996). Speculative data dissemination and ser-vice to reduce server load, network traffic and serser-vice time for distributed infor-mation systems. In Proceedings of the 1996 International Conference on Data Engineering (ICDE-96), New Orleans, Louisiana.
[Billsus and Pazzani, 1999] Billsus, D. and Pazzani, M. (1999). A hybrid user model for news story classification. In Proceedings of the Seventh International Conference on User Modeling, Banff, Canada.
[BitTorrent, 2004] BitTorrent (2004). The bittorrent protocol homepage.
http://www.bittorrent.org.
[Bonacich, 1987] Bonacich, P. (1987). Power and centrality: A family of measures.
In American Journal of Sociology, volume 92, pages 1170–1182.
124 [Bonifacio et al., 2002] Bonifacio, M., Cuel, R., Mameli, G., and Nori, M. (2002).
A peer-to-peer architecture for distributed knowledge management. In Proc.
of the 3rd International Symposium on Multi-Agent Systems, Large Complex Systems, and E-Businesses MALCEB ’2002. (2002).
[Busca et al., 2004] Busca, J.-M., Picconi, F., and Sens, P. (2004). Pastis: a highly-scalable multi-user peer-to-peer file system. Technical Report RR05288, INRIA.
[Byers et al., 2002] Byers, J., Considine, J., and Mitzenmacher, M. (2002). Simple load balancing for distributed hash tables. Technical report, CS Department, Boston University.
[Canalys, 2007] Canalys (2007). Canalys research report 2007/024, www.canalys.com/pr/2007/r2007024.pdf.
[Chen et al., 2006] Chen, H., Jin, H., and Ning, X. (2006). Semantic peer-to-peer overlay for efficient content locating. In Proc. of MEGA’06, Harbin, China.
[Chesnais, 2007] Chesnais, S. (2007). The netsize guide. Technical report, Netsize Group, www.netsize.com.
[Cholvi et al., 2004] Cholvi, V., Felber, P. A., and Biersack, E. W. (2004). Efficient search in unstructured peer-to-peer networks. In Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pages 271–272, Barcelona, Spain.
[Conati et al., 2002] Conati, C., Gertner, A., and Vanlehn, K. (2002). Using bayesian networks to manage uncertainty in student modeling. User Modeling and User-Adapted Interaction, 12(4):371–417.
[Crespo and Garcia-Molina, 2002] Crespo, A. and Garcia-Molina, H. (2002). Se-mantic overlay networks for p2p systems. InTechnical report, Computer Science Department, Stanford University, October.
[Creus and Kuulusa, 2007] Creus, G. B. and Kuulusa, M. (2007). Mobile Phone Programming and its Application to Wireless Networking, chapter Optimizing Mobile Software with Built-in Power, pages 449–462. Number ISBN 978-1-4020-5968-1. Springer Verlag.
[Dabek, 2001] Dabek, F. (2001). A cooperative file system. Master’s thesis, Mas-sachusetts Institute of Technology.
[Druschel and Rowstron, 2001] Druschel, P. and Rowstron, A. (2001). Past: A large-scale, persistent peer-to-peer storage utility. In in Proceedings of the 8th IEEE Workshop on Hot Topics in Operating Systems, pages 75–80.
125 [Dublin Core, 2006] Dublin Core (2006). Dublin core metadata element set,
ver-sion 1.1. http://dublincore.org/documents/2006/12/18/dces/, dec. 2006.
[Duda and Hart, 1973] Duda, R. O. and Hart, P. E. (1973). Pattern Classification and Scene Analysis. John Willey & Sons, New York.
[Ellis, 1999] Ellis, C. S. (1999). The Case for Higher-Level Power Management. In Proceedings of the 7th Workshop on Hot Topics in Operating Systems (HOTOS), Rio Rico, AZ.
[Fellbaum, 1998] Fellbaum, C. (1998). WordNet, An Electronic Lexical Database.
MIT Press. ISBN 978-0-262-06197-1.
[Flinn and Satyanarayanan, 1999] Flinn, J. and Satyanarayanan, M. (1999).
Energy-aware adaptation for mobile applications. In Symposium on Operating Systems Principles, pages 48–63.
[Forstner, 2006] Forstner, B. (2006). An analytic model for peer-to-peer systems with semantic overlay network. InProc. of AACS’06 Workshop, Budapest, Hun-gary.
[Forstner and Charaf, 2004] Forstner, B. and Charaf, H. (2004). Semantic peer-to-peer information retrieval. In Proc. of MicroCAD 2004 International Scientific Conference, University of Miskolc, Hungary.
[Forstner and Charaf, 2005a] Forstner, B. and Charaf, H. (2005a). Adaptive peer-to-peer network using semantic relations. In Proc. of IEEE 3rd International Conference on Computational Cybernetics (ICCC 2005), Mauritius.
[Forstner and Charaf, 2005b] Forstner, B. and Charaf, H. (2005b). Modeling peer-to-peer networks with interest-based clusters. Transactions on Enformatika, Systems Sciences and Engineering, Volume 8:38–43. ISBN 975-98458-7-3.
[Forstner and Charaf, 2005c] Forstner, B. and Charaf, H. (2005c). Modelling clus-tered peer-to-peer networks. In Proc. of IASTED International Conference on Communication Systems and Applications (CSA 2005), Banff, Alberta, Canada.
[Forstner and Charaf, 2005d] Forstner, B. and Charaf, H. (2005d). Neighbor se-lection in peer-to-peer networks using semantic relations. WSEAS Transactions on Information Science and Applications, 2(2):239–244. ISSN 1790-0832.
[Forstner and Charaf, 2005e] Forstner, B. and Charaf, H. (2005e). The parallel rings topology in semantic peer-to-peer networks. In Proc. of the 6th Inter-national Symposium of Hungarian Researchers on Computational Intelligence, pages 668–679, Budapest, Hungary.
126 [Forstner and Charaf, 2005f] Forstner, B. and Charaf, H. (2005f). Semantic profile-based neighbor selection in peer-to-peer networks. In Proc. of Micro-CAD 2005 International Scientific Conference, University of Miskolc, Hungary.
[Forstner and Charaf, 2006a] Forstner, B. and Charaf, H. (2006a). Analytical model for semantic overlay networks in peer-to-peer systems. In Proc. of 4th WSEAS International Conference on Software Engineering, Parallel Distributed Systems, Madrid, Spain.
[Forstner and Charaf, 2006b] Forstner, B. and Charaf, H. (2006b). Probabilistic model for semantic peer-to-peer overlay networks. WSEAS Transactions on Information Science and Applications, 3(4):691–697. ISSN 1709-0832.
[Forstner and Charaf, 2007] Forstner, B. and Charaf, H. (2007). Bayesian ap-proach to improve the performance of transient peer-to-peer networks. In Proc.
of European Computing Conference, Athens, Greece.
[Forstner and Charaf, 2008] Forstner, B. and Charaf, H. (2008). Applying user profiles in mobile peer-to-peer environment. In Proc. of 1st IEEE International Peer-to-Peer for Handheld Devices Workshop at Fifth Annual IEEE Consumer Communications and Networking Conference (CCNC2008).
[Forstner et al., 2004] Forstner, B., Csúcs, G., Charaf, H., and Marossy, K. (2004).
Symbian alapú szoftverfejlesztés, pages 11–18,97–157. Budapest, Szak Kiadó.
[Forstner et al., 2005a] Forstner, B., Csúcs, G., Marossy, K., and Charaf, H.
(2005a). An advanced simulator for peer-to-peer protocol analysis. In Proc.
of MicroCAD 2005 International Scientific Conference, University of Miskolc, Hungary.
[Forstner et al., 2005b] Forstner, B., Csúcs, G., Marossy, K., and Charaf, H.
(2005b). Evaluating performance of peer-to-peer protocols with an advanced simulator. InProc. of Parallel And Distributed Computing And Networks, Inns-bruck, Austria.
[Forstner and Kelényi, 2006] Forstner, B. and Kelényi, I. (2006). Szemantikus pro-tokollt tartalmazó mobil peer-to-peer kliensszoftver. Híradástechnika, Volume 9.
[Forstner et al., 2008] Forstner, B., Kelényi, I., and Charaf, H. (2008). Applying user profiles in transient peer-to-peer environment. In Proc. of IEEE Cognitive and Cooperative Wireless NetworksWorkshop (CoCoNet) at IEEE ICC.
[Forstner et al., 2007] Forstner, B., Kelényi, I., and Csúcs, G. (2007). Towards Cognitive and Cooperative Wireless Networking: Techniques, Methodologies and
127 Prospects, chapter Peer-to-Peer Information Retrieval Based on Fields of Inter-est, page . Number ISBN 978-1-4020-5968-1. Springer Verlag.
[Forstner et al., 2006a] Forstner, B., Kereskényi, R., and Charaf, H. (2006a). Elim-inating clustering in the propagation tree of semantic peer-to-peer networks. In Proc. of IASTED Conference on Parallel And Distributed Computing And Net-works, Innsbruck, Austria.
[Forstner et al., 2006b] Forstner, B., Kereskényi, R., and Charaf, H. (2006b). Op-timization of semantic peer-to-peer network topology for mobile environment.
In Proc. of MicroCAD 2006 International Scientific Conference, University of Miskolc, Hungary.
[Forstner et al., 2006c] Forstner, B., Lengyel, L., Levendovszky, T., Kelényi, I., and Charaf, H. (2006c). Supporting rapid application development on symbian platform. In Proc. of IEEE EUROCON 2005 The International Conference on
"Computer as a tool", pages 21–24, Belgrade, Serbia Montenegro.
[Forstner et al., 2006d] Forstner, B., Lengyel, L., Levendovszky, T., Mezei, G., Kelényi, I., and Charaf, H. (2006d). Model-based system development for em-bedded mobile platforms. In Proc. of 13th Annual IEEE International Confer-ence and Workshop on the Engineering of Computer Based Systems (ECBS), Potsdam, Germany.
[Frank H. P. Fitzek, 2006] Frank H. P. Fitzek, e. b. (2006). Mobile Phone Pro-gramming and its Applications to Wireless Networking. Springer. ISBN 978-1-4020/5968-1.
[Ge et al., 2003] Ge, Z., Figueiredo, D. R., Jaiswal, S., Kurose, J., and Towsley, D.
(2003). Modeling peer-peer file sharing systems. In Proc. of INFOCOM 2003, San Francisco, USA.
[Gnutella, 2000] Gnutella (2000). The gnutella protocol homepage.
http://www.the-gdf.org.
[Granovetter, 1973] Granovetter, M. (1973). The strength of weak ties.The Amer-ican Journal of Sociology, 78(6):1360–1380.
[Gummadi et al., 2003] Gummadi, K., Dunn, R., Saroiu, S., Gribble, S., Levy, H., and Zahorjan, J. (2003). Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In Proc. of the 19th ACM Symposium on Operating Systems Principles (SOSP-19).
[Haase et al., 2004a] Haase, P., Broekstra, J., Ehrig, M., Menken, M., Mika, P., Plechawski, M., Pyszlak, P., Schnizler, B., Siebes, R., Staab, S., and Tempich,
128 C. (2004a). Bibster - a semantics-based bibliographic peer-to-peer system. In Proc. of the 3rd Int. Semantic Web Conference, Hiroshima, Japan.
[Haase et al., 2004b] Haase, P., Siebes, R., and van Harmelen, F. (2004b). Peer selection in peer-to-peer networks with semantic topologies. In Bouzeghoub, M., editor,Proceedings of the International Conference on Semantics in a Networked World (ICNSW’04), LNCS.
[Heer et al., 2006] Heer, T., Rieche, S., Götz, S., and Wehrle, K. (2006). Adapting distributed hash tables for mobile ad hoc networks. In , editor, Proc. of 3rd IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P’06).
[Iamnitchi et al., 2004] Iamnitchi, A., Ripenau, M., and Foster, I. (2004). Small-world file-sharing communities. In Proc of INFOCOM.
[IBM UIMA, 2005] IBM UIMA (2005). The "ibm uima framework", http://www.research.ibm.com/uima/.
[Jennings and Higuchi, 1992] Jennings, A. and Higuchi, H. (1992). A personal news service based on a user model neural network. IEICE Transactions on Information and Systems, 75(2):198–209, Mar. 1992., 31(75(2)):198–209.
[Joerding, 1999] Joerding, T. (1999). Temporary user modeling for adaptive prod-uct presentations in the web. In Proceedings of the Seventh International Con-ference on User Modeling, pages 333–334, Banff, Canada.
[Joseph, 2003] Joseph, S. (2003). P2p metadata search layers. InProc. of Second International Workshop on Agents and Peer-to-Peer Computing (AP2PC 2003).
[Jovanovic et al., 2001] Jovanovic, M. A., Annexstein, F. S., and Berman, K. A.
(2001). Modeling peer-to-peer network topologies through "small-world" models and power laws. In Proc. of the IX. Telecommunications Forum (TELEFOR).
[Kant and Iyer, 2003] Kant, K. and Iyer, R. (2003). Modeling and simulation of adhoc/p2p resource sharing networks. In In Proc. of TOOLS03.
[Kelényi et al., 2007] Kelényi, I., Csúcs, G., and Forstner, B. (2007).Mobile Phone Programming and its Application to Wireless Networking, chapter Peer-to-Peer file sharing for mibile devices, pages 311–325. Number ISBN 978-1-4020-5968-1.
Springer Verlag.
[Kereskényi et al., 2005] Kereskényi, R., Forstner, B., and Charaf, H. (2005). Uni-versal communication component on symbian series60 platform. In Proc. of the 6th International Symposium of Hungarian Researchers on Computational Intelligence, pages 668–679, Budapest, Hungary.
129 [Kereskényi et al., 2006a] Kereskényi, R., Forstner, B., and Charaf, H. (2006a).
Designing a universal communication framework on different mobile platforms.
In Proc. of MicroCAD 2006 International Scientific Conference, University of Miskolc, Hungary.
[Kereskényi et al., 2006b] Kereskényi, R., Forstner, B., and Charaf, H. (2006b).
Using design patterns in mobile communication software development. In Proc.
of IASTED Conference on Parallel And Distributed Computing And Networks, Innsbruck, Austria.
[Kietz et al., 2000] Kietz, J.-U., Maedche, A., and Volz, R. (2000). Semi-automatic ontology acquisition from a corporate intranet. In Proc. of Learning Language in Logic Workshop (LLL-2000).
[Lau and Horvitz, 1999] Lau, T. and Horvitz, E. (1999). Patterns of search: Ana-lyzing and modeling web query refinement. In Press, A., editor, Proceedings of the Seventh International Conference on User Modeling.
[Leibowitz et al., 2003] Leibowitz, N., Ripeanu, M., and Wierzbicki, A. (2003).
Deconstructing the kazaa network. In Proc. of 3rd IEEE Workshop on Internet Applications (WIAPP’03). Santa Clara, CA.
[Lengyel et al., 2006] Lengyel, L., Levendovszky, T., Mezei, G., Forstner, B., and Charaf, H. (2006). Towards a model-based unification of mobile platforms. In Proc. of ACS/IEEE International Conference on Computer Systems and Appli-cations, Dubai/Sharjah.
[Lu et al., 2000] Lu, Y.-H., Micheli, G. D., and Benini, L. (2000). Requester-aware power reduction. In ISSS, pages 18–24.
[Lv et al., 2002] Lv, C., Cao, P., E.Cohen, Li, K., and Shenker, S. (2002). Search and replication in unstructured peer-to-peer networks. In Proc of the ACM International Conference on Supercomputing (ICS).
[Menasce et al., 2001] Menasce, D. A., Almeida, V. A. F., and Dowdy, L. W.
(2001). Capacity Planning for Web Services: metrics, models, and methods.
Prentice Hall.
[Merugu and Zegura, 2005] Merugu, S. S. and Zegura, E. (2005). Adding structure to unstructured peer-to-peer networks: the use of small-world graphs. Journal of Parallel and Distributed Computing, 65(2):142–153.
[Milgram, 1967] Milgram, S. (1967). The small world problem. Psychology Today, 2(1):60–67.
130 [Moukas A., and Maes P., 1998] Moukas A., and Maes P. (1998). Amalthea:
An Evolving Multi-Agent Information Filtering and Discovery System for the WWW. Autonomous Agents and Multi-Agent Systems, 1(1):59–88.
[Muthitacharoen et al., 2002] Muthitacharoen, A., Morris, R., Gil, T. M., and Chen, B. (2002). Ivy: A read/write peer-to-peer file system. In Proc. of the 5th Symposium on Operating Systems Design and Implementation.
[Napster, 2000] Napster (2000). The napster project homepage.
http://napster.com.
[Nejdl et al., 2004] Nejdl, W., Wolpers, M., Siberski, W., Schmitz, C., Schlosser, M., Brunkhorst, I., and Loser, A. (2004). Super-peer-based routing strategies for rdf-based peer-to-peer networks.
[NHome, 2000] NHome (2000). The nhome homepage.
http://www.aut.bme.hu/portal/nhome.aspx?id=e21996d9-091b-42c3-b114-1700b4381c94.
[Noble, 2000] Noble, B. (2000). System support for mobile, adaptive applications.
IEEE Personal Communications, 7(1):44–49.
[Orwant, 1995] Orwant, J. (1995). Heterogeneous learning in the doppelganger user modeling system. User Modeling and User-Adapted Interaction, 4(2):107–
130.
[Perkowitz and Etzioni, 1999] Perkowitz, M. and Etzioni, O. (1999). Towards adaptive Web sites: conceptual framework and case study. Computer Networks (Amsterdam, Netherlands: 1999), 31(11–16):1245–1258.
[Quinlan, 1993] Quinlan, J. (1993). C4.5: Programs for Machine Learning. Mor-gan Kaufmann, San Mateo, CA.
[Raiffa and Schlaifer, 1961] Raiffa, H. and Schlaifer, R. (1961). Applied Statistical Decision Theory. Division of Research, Graduate School of Business Adminis-tration, Harvard University.
[Raskutti et al., 1997] Raskutti, B., Beitz, A., and Ward, B. (1997). A Feature-based Approach to Recommending Selections Feature-based on Past Preferences, vol-ume 7, pages 179–218. Kluwer Academic Publishers, Hingham, MA, USA.
[Ratnasamy et al., 2001] Ratnasamy, S., Francis, P., Handley, M., RichardKarp, and Shenker, S. (2001). A scalable content-addressable network. In Proc. of SIGCOMM’2001.
131 [Resnick et al., 1994] Resnick, P., Iacovou, N., Suchak, M., Bergstorm, P., and Riedl, J. (1994). GroupLens: An Open Architecture for Collaborative Filtering of Netnews. In Proceedings of ACM 1994 Conference on Computer Supported Cooperative Work, pages 175–186, Chapel Hill, North Carolina. ACM.
[Rijsbergen, 1979] Rijsbergen, V. (1979). Information Retrieval. London, Butter-worth.
[Ripeanu, 2001] Ripeanu, M. (2001). Peer-to-peer architecture case study:
Gnutella network. Proceedings of the First International Conference on Peer-to-Peer Computing, pages 99–100.
[Risson and Moors, 2006] Risson, J. and Moors, T. (2006). Elsevier Computer Networks Journal.
[Ritter, 2001] Ritter, J. (2001). Why Gnutella can’t scale. No, really. Technical report, http://www.darkridge.com/ jpr5/doc/gnutella.html.
[Rohrs, 2001] Rohrs, C. (2001). Query routing for the gnutella network.
http://www.limewire.com/developer/query_routing/keyword routing.htm.
Technical report.
[Rose, 2005] Rose, F. (2005). Battle for the soul of the mp3 phone. Wired Maga-zine, 13(11).
[Rowstron and Druschel, 2001] Rowstron, A. and Druschel, P. (2001). Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. In Proc. of SOSP’01.
[Salton and Mcgill, 1986] Salton, G. and Mcgill, M. J. (1986). Introduction to Modern Information Retrieval. McGraw-Hill, Inc., New York, NY, USA.
[Saroiu et al., 2002] Saroiu, S., Gummadi, P., and Gribble, S. (2002). A mea-surement study of peer-to-peer file sharing systems. In Proc. of Multimedia Computing and Networking (MMCN2002).
[Schlosser et al., 2002] Schlosser, M., Sintek, M., Decker, S., and Nejdl, W. (2002).
Hypercup – hypercubes, ontologies and efficient search on p2p networks. In Workshop on Agents and P2P Computing, Lecture Notes in Computer Science, pages 112–124. Springer.
[Sen and Wang, 2004] Sen, S. and Wang, J. (2004). Analyzing peer-to-peer traffic across large networks. IEEE/ACM Transactions on Networking, 12(2).
[Sripanidkulchai et al., 2003] Sripanidkulchai, K., Maggs, B., and Zhang, H.
(2003). Efficient content location using interest-based locality in peer-topeer systems. In Proc. of Infocom 2003.
132 [Stoica et al., 2001] Stoica, I., Morris, R., Karger, D., Kaashoek, F., and Balakr-ishnan, H. (2001). Chord: A scalable peer-topeer lookup service for internet applications. In Proc. of SIGCOMM’2001.
[Symella, 2000] Symella (2000). The symella homepage.
http://symella.aut.bme.hu.
[SymTorrent, 2005] SymTorrent (2005). The symtorrent homepage.
http://symtorrent.aut.bme.hu.
[Tan et al., 2003] Tan, T. K., Raghunathan, A., and Jha, N. K. (2003). Software architectural transformations: A new approach to low energy embedded soft-ware. In DATE ’03: Proceedings of the conference on Design, Automation and Test in Europe, page 11046, Washington, DC, USA. IEEE Computer Society.
[Tang et al., 2002] Tang, C., Xu, Z., and Dwarkadas, S. (2002). Peer-to-peer in-formation retrieval using self-organizing semantic overlay networks. InTechnical report, HP Labs, November 2002.
[Tarjan, 1983] Tarjan, R. E. (1983). Data Structures and Network Algorithms, volume 44. CBMS-NSF Regional Conference Series in Applied Mathematics, SIAM.
[TNS, 2005] TNS (2005). Two-day battery life tops wish list for future all-in-one phone device. Technical report, Taylor Nelson Sofres.
[Tsoumakos and Roussopoulos, 2003] Tsoumakos, D. and Roussopoulos, N.
(2003). Adaptive probabilistic search for peer-to-peer networks. In Proc. of 3rd IEEE Intl Conference on P2P Computing.
[Upadrashta et al., 2005] Upadrashta, Y., Vassileva, J., and Grassmann, W. K.
(2005). Social networks in peer-to-peer systems. In HICSS. IEEE Computer Society.
[Watts and Strogatz, 1998] Watts, D. J. and Strogatz, S. H. (1998). Collective dynamics of ’small-world’ networks. In Nature, volume 393, pages 440–442.
[Yang and Garcia-Molina, 2002a] Yang, B. and Garcia-Molina, H. (2002a). Effi-cient search in peer-to-peer networks. In Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS).
[Yang and Garcia-Molina, 2002b] Yang, B. and Garcia-Molina, H. (2002b). Effi-cient search in peer-to-peer networks. In Proc of the 22nd IEEE International Conference on Distributed Computing Systems, Vienna, Austria.