Verfügbarkeit: Handbook of peer-to-peer networking

Handbook of peer-to-peer networking:

Gespeichert in:

Bibliographische Detailangaben
Format:	Buch
Sprache:	English
Veröffentlicht:	New York Springer 2010
Schlagworte:	Peer-to-peer architecture (Computer networks) Peer-to-Peer-Netz Mathematisches Modell Mündung Konferenzschrift Konferenzschrift > 1978 > Hamburg
Online-Zugang:	Inhaltsverzeichnis
Beschreibung:	XLVII, 1405 S. graph. Darst.
ISBN:	0387097503 9780387097503

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV035346917
003	DE-604
005	20100222
007	t
008	090305s2010 d\|\|\| \|\|\|\| 00\|\|\| eng d
015			\|a GBA8D7614 \|2 dnb
020			\|a 0387097503 \|9 0-387-09750-3
020			\|a 9780387097503 \|c hbk. \|9 978-0-387-09750-3
035			\|a (OCoLC)277069416
035			\|a (DE-599)BVBBV035346917
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-703 \|a DE-91G \|a DE-83 \|a DE-898 \|a DE-739 \|a DE-355 \|a DE-1049
050		0	\|a TK5105.525
082	0		\|a 004.65 \|2 22
082	0		\|a 004.652 \|2 22
084			\|a ST 200 \|0 (DE-625)143611: \|2 rvk
084			\|a DAT 250f \|2 stub
245	1	0	\|a Handbook of peer-to-peer networking \|c Xuemin Shen ..., eds.
264		1	\|a New York \|b Springer \|c 2010
300			\|a XLVII, 1405 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		4	\|a Peer-to-peer architecture (Computer networks)
650		4	\|a Peer-to-peer architecture (Computer networks)
650	0	7	\|a Peer-to-Peer-Netz \|0 (DE-588)4343110-0 \|2 gnd \|9 rswk-swf
650	0	7	\|a Mathematisches Modell \|0 (DE-588)4114528-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Mündung \|0 (DE-588)4154906-5 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|2 gnd-content
655		7	\|0 (DE-588)1071861417 \|a Konferenzschrift \|y 1978 \|z Hamburg \|2 gnd-content
689	0	0	\|a Peer-to-Peer-Netz \|0 (DE-588)4343110-0 \|D s
689	0		\|5 DE-604
689	1	0	\|a Mündung \|0 (DE-588)4154906-5 \|D s
689	1	1	\|a Mathematisches Modell \|0 (DE-588)4114528-8 \|D s
689	1		\|5 DE-604
700	1		\|a Shen, Xuemin \|d 1958- \|e Sonstige \|0 (DE-588)142337242 \|4 oth
776	0	8	\|i Erscheint auch als \|n Online-Ausgabe \|z 978-0-387-09751-0
856	4	2	\|m Digitalisierung UB Passau \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017151128&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-017151128

Datensatz im Suchindex

_version_	1804138665821077504
adam_text	Contents Part I Introduction to Peer-to-Peer Networking Peer-to-Peer Networking and Applications: Synopsis and Research Directions .................................................... 3 John F. Buf ord and Heather Yu 1 Introduction .................................................. 3 1.1 Significance and Emergence ................................ 3 1.2 Key Applications ......................................... 5 1.3 Definition and Properties of P2P Systems .................... 6 1.4 Business Models ......................................... 7 1.5 Technology Drivers ....................................... 8 1.6 Structure of the Chapter ................................... 10 2 Overlay Basics ................................................ 10 2.1 Classification and Taxonomy ............................... 10 2.2 Unstructured Overlays .................................... 11 2.3 Structured Overlays ....................................... 13 2.4 Hierarchical and Federated Overlays ......................... 16 2.5 Service Overlays ......................................... 17 2.6 Semantic Overlays ........................................ 18 2.7 Sensor Overlays .......................................... 19 2.8 Research Directions ...................................... 19 3 Overlay Dynamics, Heterogeneity and Mobility .................... 19 3.1 Churn and Overlay Maintenance ............................ 19 3.2 Mobility in P2P Overlays .................................. 20 3.3 Overlays for MANETs and Ad Hoc Networks ................. 21 3.4 Heterogeneity and Variable Hop Overlays .................... 21 3.5 Research Directions ...................................... 23 4 P2P Content Access and Delivery ................................ 23 4.1 Content Search .......................................___ 24 4.2 P2P Streaming and Multicasting ........................___ 27 4.3 Caching and Replication ................................... 29 4.4 Summary of Design Issues ................................. 31 4.5 Research Issues .......................................... 31 5 Security ...................................................... 32 5.1 The P2P Security Concern ................................. 32 5.2 Basic Classifications of P2P Network Security Threats ......... 33 5.3 Counter Measures ........................................ 34 5.4 Fairness, Trust and Privacy Issues ........................... 36 5.5 More on P2P Security ..................................... 36 6 Summary ..................................................... 37 References ....................................................... 37 The Social Impact of P2P Systems ............................... 47 Andrea Glorioso, Ugo Pagallo, and Giancarlo Ruffo 1 Introduction .................................................. 47 2 Legal Issues .................................................. 48 3 Sociological Aspects ........................................... 52 4 Economic Trends .............................................. 54 5 Political Aspects ............................................... 58 6 Turning Forthcoming P2P Systems into Reality ..................... 61 6.1 Overlay Level ............................................ 62 6.2 Accounting Level ........................................ 63 6.3 Market Level ............................................ 64 7 Conclusions .................................................. 66 References ....................................................... 67 From Client-Server to P2P Networking ........................... 71 Lu Liu and Nick Antonopoulos 1 Introduction .................................................. 71 2 Network Architecture Evolution .................................. 72 2.1 Client-Server Architecture ................................. 72 2.2 Grid Architecture ......................................... 72 2.3 Peer-to-Peer Architecture .................................. 73 3 Evolution of Peer-to-Peer Networks .............................. 74 3.1 Centralised Peer-to-Peer Networks .......................... 75 3.2 Decentralised Peer-to-Peer Networks ........................ 76 3.3 Hybrid Peer-to-Peer Networks .............................. 77 4 Peer-to-Peer Search Systems .................................... 79 4.1 Structured P2P Systems ................................... 79 4.2 Unstructured P2P Systems ................................. 82 5 Future Trends ................................................. 86 5.1 Self-organising Systems ................................... 86 5.2 Hybrid Systems .......................................... 87 6 Conclusions .................................................. 87 References ....................................................... 87 Examining the Use of Peer-to-Peer Networks from an Activity Perspective ................................................... 91 Jörn De Boever and Dirk De Grooff 1 Introduction ................................___.............. 91 2 Theoretical Framework: Activity Theory .......................... 92 2.1 Activity Theory and Human-Computer Interaction ............. 92 2.2 Importance of Context .................................... 93 2.3 Activity System .......................................... 94 3 Methods ..................................................... 96 4 Understanding the Use of P2P Networks ........................... 98 4.1 Process of Using Bittorrent Clients .......................... 98 4.2 Process of Using Gnutella Clients ........................... 105 5 Discussion and Conclusion ...................................... Ill References ....................................................... 113 Part II Unstructured P2P Overlay Architectures Unstructured Peer-to-Peer Network Architectures .................. 117 Xing Jin and S.-H. Gary Chan 1 Introduction .................................................. 117 2 Design Considerations .......................................... 119 3 Unstructured P2P Networks for File Sharing ....................... 119 3.1 A Centralized Approach: Napster ........................... 119 3.2 A Distributed Approach: Gnutella ........................... 120 3.3 A Hybrid Approach: FastTrack/Kazaa ....................... 122 3.4 Other Approach: BitTorrent ................................ 123 3.5 Comparison and Discussion ................................ 124 4 Advanced Issues in File Sharing .................................. 125 4.1 Content Replication ....................................... 125 4.2 Security and Reputation System ............................ 127 4.3 Reputation Storage and Retrieval ............................ 129 5 Other Applications of Unstructured P2P Networks .................. 132 5.1 Media Streaming: CoolStreaming ........................... 132 5.2 VoIP: Skype ............................................. 135 6 Mobile Unstructured P2P Networks ............................... 137 6.1 Characteristics of Mobile Wireless Networks ................. 137 6.2 Approaches for Mobile Unstructured P2P Networks ............ 138 7 Conclusion ................................................... 140 References ....................................................... 140 Exchanging Peers to Establish P2P Networks ...................... 143 Mursalin Akon, Mohammad Towhidul Islam, Xuemin (Sherman) Shen, and Ajit Singh 1 Introduction .................................................. 143 2 The PROOFS Network ......................................... 144 2.1 Evolution ............................................... 144 2.2 Components ............................................. 145 2.3 Protocols ................................................ 145 2.4 Properties of the PROOFS Networks ........................ 147 2.5 Results ................................................. 147 3 The CYCLON Network ........................................ 148 3.1 An Enhanced Exchange Operation .......................... 148 3.2 Results ................................................. 149 4 The IPPS Network ............................................. 151 4.1 The Problem and the Goal ................................. 152 4.2 System Model ........................................... 153 4.3 Topology Maintenance .................................... 154 4.4 Results ................................................. 158 5 The Gradient Topology Network ................................. 161 5.1 The Preliminaries ........................................ 161 5.2 Exchange Operation ...................................... 162 5.3 Search .................................................. 163 5.4 Results ................................................. 163 6 Concluding Remarks ........................................... 163 References ....................................................... 164 Peer-to-Peer Topology Formation Using Random Walk .............. 167 Kin-Wah Kwong and Danny H.K. Tsang 1 Introduction .................................................. 167 2 Literature Review .............................................. 169 3 Our Proposed Protocol ......................................... 170 3.1 P2P Network Model ...................................... 170 3.2 Joining Process .......................................... 171 3.3 Rebuilding Process ....................................... 173 4 Protocol Analysis .............................................. 173 4.1 Stabilizing Network Model ................................ 174 4.2 Analysis of Mean Degree of P2P Network .................... 175 4.3 Analysis of Node Degree Evolution ......................... 177 4.4 Simple Analysis of Peer s Workload ......................... 179 4.5 Analysis of P2P Network Diameter .......................... 180 5 Simulation .................................................... 181 5.1 Node Capacity Distributions ............................... 182 5.2 P2P Network Diameter .................................... 182 5.3 Node Degree Equilibrium .................................. 183 6 Conclusion ................................................... 184 References ....................................................... 186 Semantic Social Overlay Networks ............................... 189 Alexander Löser, Steffen Staab, and Christoph Tempich 1 Semantics and Communities in Peer-to-Peer Networks ............... 190 1.1 Query Routing Strategies in Social Networks ................. 190 1.2 Knowledge Sharing Strategies in Virtual Organizations ......... 191 2 System Architecture ............................................ 192 2.1 Building Blocks.......................................... 192 2.2 Query and Result Messages ................................ 193 2.3 Similarity Function ....................................... 194 3 Overlay Construction, Index Creation and Maintenance .............. 195 3.1 Content Provider and Recommender Shortcuts ................ 195 3.2 Bootstrapping Shortcuts ................................... 197 3.3 Default Network Shortcuts ................................. 198 4 Routing in Semantic Social Overlay Networks ...................... 198 4.1 Overview ............................................... 199 4.2 Selecting Best Matching Shortcuts .......................... 199 5 Experimental Setup ............................................ 200 5.1 Content Distribution ...................................... 202 5.2 Query Distribution ........................................ 204 5.3 Peer-to-Peer Network Setup ................................ 204 5.4 Simulator Setup and Simulation Statistics .................... 206 5.5 Evaluation Measures ...................................... 206 6 Evaluation and Optimization .................................... 207 6.1 Performance Against State-of-the-Art Approaches ............. 208 6.2 Layer and Semantic Similarity Function Contribution .......... 209 6.3 Tradeoff Between Clustering and Recall ...................... 210 6.4 Setting Optimal Index Size ................................. 212 6.5 Setting Optimal Index Weight .............................. 213 6.6 Performance for Conjunctive Queries ........................ 214 7 Related Work ................................................. 215 8 Summary ..................................................... 217 References ....................................................... 218 Part III Structured P2P Overlay Architectures Overview of Structured Peer-to-Peer Overlay Algorithms ............ 223 Krishna Dhara, Yang Guo, Mario Kolberg, and Xiaotao Wu 1 Overview ..................................................... 223 2 Basic Features of Structured P2P Overlays/Networks ................ 224 2.1 Geometries ........................................___. , 225 2.2 Routing Algorithm ....................................... 226 2.3 Join/Leave Mechanisms ................................... 227 2.4 Routing Table Maintenance ................................ 229 2.5 Bootstrapping ............................................ 230 3 Logarithmic Degree Overlays .................................... 230 3.1 Chord .................................................. 230 3.2 Pastry .................................................. 232 3.3 Kademlia ............................................... 234 3.4 Tapestry ................................................ 235 3.5 P-Grid .................................................. 236 4 Constant Degree Overlays ....................................... 238 4.1 CAN ................................................... 238 4.2 Ulysses ................................................. 240 4.3 Cycloid ................................................. 241 5 O(l)-Hop Overlays ............................................ 243 5.1 Kelips .................................................. 243 5.2 OneHop ................................................ 244 5.3 EpiChord ............................................... 246 5.4 D1HT .................................................. 248 6 Comparison and Analysis ....................................... 249 7 Conclusions .................................................. 253 7.1 Open Research Issues ..................................... 253 7.2 Summary ............................................... 254 References ....................................................... 254 Distributed Hash Tables: Design and Applications .................. 257 C.-F. Michael Chan and S.-H. Gary Chan 1 Introduction .................................................. 257 2 Performance Characteristics and Design Considerations .............. 258 2.1 Common Performance Characteristics ....................... 259 2.2 Design Considerations .................................... 259 3 DHT Schemes ................................................ 260 3.1 Chord .................................................. 260 3.2 Pastry .................................................. 262 3.3 Kademlia ............................................... 264 3.4 Other DHTs ............................................. 265 4 Design Fundamentals .......................................... 266 4.1 Static Resilience ......................................... 266 4.2 Path Latency ............................................. 266 4.3 Local Convergence ....................................... 267 4.4 Network Diameter and Node State Tradeoffs .................. 267 5 Applications .................................................. 268 5.1 Cooperative File Storage (CFS) ............................. 268 5.2 Scribe .................................................. 270 5.3 VMesh ................................................. 271 5.4 Internet Indirection Infrastructure (/3)........................ 272 6 DHTs in Wireless Networks ..................................... 274 6.1 Characteristics of Wireless Networks ........................ 274 6.2 Challenges of Using DHTs in Wireless Networks .............. 275 6.3 Search Approaches for Wireless Networks .................... 277 7 Conclusions .................................................. 278 References ....................................................... 279 The Gamut of Bootstrapping Mechanisms for Structured Overlay Networks ................................ 281 Anwitaman Datta 1 Introduction .................................................. 281 2 A Taxonomy of Structured Overlay Topologies ..................... 283 2.1 Ring ................................................... 283 2.2 Tree .................................................... 286 3 Quasi-Sequential Construction of Overlays ........................ 288 3.1 Load-Balancing Considerations ............................. 289 4 Parallelized Construction of Overlays ............................. 290 4.1 Sorting Peer-IDs as a Mechanism to Build a Ring .............. 292 4.2 Recursive Proportional Partitioning .......................... 295 5 The Need and Challenges of Merging Two Similar Structured Overlays ..................................................... 298 5.1 Merger of Two Ring Based Networks ........................ 301 5.2 Merger of Two Structurally Replicated P-Grid Networks ........ 304 6 Summary and Conclusion ....................................... 306 References ....................................................... 307 Network-Aware DHT-Based P2P Systems ......................... 309 Marguerite Fayçal and Ahmed Serhrouchni 1 Motivations ................................................... 309 2 DHT-Based Architectures ....................................... 310 3 Requirements ................................................. 312 4 State of the Art .........................___.___.............. 313 5 Semantics for Resource Sharing .................................. 317 5.1 A Context-Aware P2P System .............................. 317 5.2 A Network Provider Oriented P2P System .................... 319 6 Prospects ..................................................... 322 7 Conclusion ................................................... 323 References ....................................................... 324 On Adding Structure to Unstructured Overlay Networks ............ 37,7 João Leitão, Nuno A. Carvalho, José Pereira, Rui Oliveira, and Luís Rodrigues 1 Introduction .................................................. 328 2 Adding Structure to Unstructured Overlay Networks ................ 329 2.1 Existing Protocols ........................................ 330 2.2 Key Properties to Preserve ................................. 336 2.3 Performance Metrics ...................................... 337 2.4 Methodologies ........................................... 338 3 Overlay Optimization .......................................... 339 3.1 Overview ............................................... 339 3.2 Architecture ............................................. 340 3.3 Algorithm ............................................... 342 3.4 Performance ............................................. 344 4 Gossip Optimization ........................................... 348 4.1 Overview ............................................... 348 4.2 Architecture ............................................. 350 4.3 Strategies and Oracles ..................................... 355 4.4 Performance ............................................. 357 5 Discussion and Future Directions ................................. 361 References ....................................................... 363 Mathematical Modeling of Routing in DHTs ....................... 367 Peter Kersch and Robert Szabo 1 Introduction .................................................. 367 1.1 DHTs Revisited .......................................... 368 2 Modeling DHT Routing ........................................ 371 2.1 Renewal Processes Revisited ............................... 373 2.2 Assumptions and Notations ................................ 374 3 Transformed View of Long-Range Connections ..................... 378 3.1 Long-Range Connection Density ............................ 379 3.2 Regular Power-Law Routing Overlays ....................... 381 3.3 Probabilistic Power-Law Routing Overlays ................... 383 3.4 Distortions in the Transformed View ......................... 385 4 Stochastic Analysis of Routing ................................... 385 4.1 Analysis of Routing in the Transformed view ................. 387 4.2 Upper Bound on the Expected Number of Routing Hops ........ 395 5 Summary ..................................................... 399 References ....................................................... 400 Part IV Search and Query Processing Keyword Search in Unstructured Peer-to-Peer Networks ............ 405 Dingyi Han and Yong Yu 1 Introduction .................................................. 406 1.1 Background ............................................. 406 1.2 Keyword Search Problem .................................. 407 1.3 Evaluation Metrics ....................................... 408 2 Blind Routing ................................................. 409 2.1 Pure Flooding and Its Variations ............................ 409 2.2 Random Walk and Its Variations ............................ 413 2.3 Comparison and Summary ................................. 415 3 Routing Indices ............................................... 415 3.1 Content Oriented Routing .................................. 416 3.2 Query Oriented Routing ................................... 420 3.3 Comparison and Summary ................................. 423 4 Multi-Keyword Search ......................................... 424 5 Conclusion ................................................... 425 References ....................................................... 425 Distributed Search and Pattern Matching ......................... 427 Reaz Ahmed and Raouf Boutaba 1 Introduction .................................................. 427 2 Large Scale Distributed Systems ................................. 428 2.1 Content Sharing .......................................... 429 2.2 Service Discovery ........................................ 431 2.3 Distributed XML Databases ............................___ 433 3 Distributed Search Requirements ................................. 435 4 Components of a Distributed Search System ....................... 437 4.1 Query Semantics ......................................... 437 4.2 Translation .............................................. 439 4.3 Routing ................................................. 440 5 Search Techniques in Content Sharing P2P Systems ................. 441 5.1 Structured Techniques ..................................... 441 5.2 Un-structured and Semi-structured Techniques ................ 444 5.3 Summary ............................................... 445 6 Search Techniques in P2P Service Discovery ....................... 445 6.1 Summary ............................................... 446 7 Search Techniques in Distributed XML Databases .................. 448 7.1 Summary ............................................... 449 8 The DPM Abstraction .......................................... 450 8.1 Distributed Pattern Matching (DPM) ........................ 450 8.2 Mapping to DPM Framework .............................. 451 8.3 Known Solutions to the DPM Problem ....................... 453 9 Conclusion ................................................... 457 References ....................................................... 458 Distributed Semantic Overlay Networks .......................... 463 Christos Doulkeridis, Akrivi Vlachou, Kjetil N0rvag, and Michalis Vazirgiannis 1 Introduction .................................................. 464 2 Semantic Overlay Networks ..................................... 465 2.1 Aims of SON Generation .................................. 466 2.2 Requirements for SON Generation .......................... 467 3 Distributed Creation of Semantic Overlay Networks ................. 469 3.1 The DESENT Approach to Decentralized and Distributed SON Creation ................................................ 469 4 Searching in Semantic Overlay Networks .......................... 474 4.1 Traditional SON-Based Search ............................. 474 4.2 Super-Peer Organization ................................... 475 5 Applications of Semantic Overlay Networks ....................... 476 5.1 P2P Web Search - Document Retrieval ...................... 476 5.2 P2P Image Retrieval ...................................... 479 6 Related Work ................................................. 483 6.1 Unstructured P2P ......................................... 484 6.2 Structured P2P ........................................... 487 6.3 Evaluation .............................................. 489 7 Summary and Future Trends ..................................... 490 References ....................................................... 491 Self-adaptation and Self-organization for Search in Social-Like Peer-to-Peer Networks ......................................... 495 Lu Liu, Jie Xu, Duncan Russell, and Zongyang Luo 1 Introduction .................................................. 495 2 Background ................................................... 497 3 AESLP: Adaptive and Efficient Social-Like Peer-to-Peer ............. 498 3.1 Knowledge Index Creation and Update ....................... 498 3.2 Routing Algorithm for Simple Queries ....................... 501 3.3 Routing Algorithm for Multi-Topic Queries ................... 508 3.4 Adaptive Query .......................................... 513 4 Simulations Methodology ....................................... 515 4.1 Content Generation and Distribution ......................... 516 4.2 Topology Initialisation and Evolution ........................ 516 4.3 Network Churns .......................................... 517 4.4 Search Network .......................................... 517 5 Simulation Results ............................................. 518 5.1 Initial Simulations ........................................ 518 5.2 Performance Comparison to Relevant Methods ................ 520 5.3 Performance Comparison to Derived Methods ................. 521 5.4 Topology Evolution ....................................... 522 5.5 Effects of Parameters ..................................... 522 5.6 Query Packs ............................................. 527 6 Conclusions and Future Work .................................... 528 References ....................................................... 529 Data Sharing in P2P Systems .................................... 531 Rabab Hayek, Guillaume Raschia, Patrick Valduriez, and Noureddine Mouaddib 1 Introduction .................................................. 532 2 P2P Networks ................................................. 534 2.1 Unstructured ............................................. 534 2.2 Structured ............................................... 536 2.3 Unstructured vs. Structured: Competition or Complementarity? ........................................ 537 3 Data Indexing in P2P Systems ................................... 538 3.1 Index Types ............................................. 539 3.2 Semantic-Free Index: DHT ................................ 543 3.3 Semantic Index .......................................... 546 4 Schema Management in P2P Systems ............................. 551 4.1 Pairwise Schema Mappings ................................ 552 4.2 Mapping Based on Machine Learning Techniques ............. 553 4.3 Common Agreement Mapping .............................. 554 4.4 Schema Mapping Using IR Techniques ...................... 555 5 Querying in P2P Systems ....................................... 555 5.1 Partial Lookup ........................................... 556 5.2 Partial Answering ........................................ 561 5.3 What About Approximate Answering? ....................... 563 References ....................................................... 566 Managing Linguistic Data Summaries in Advanced P2P Applications .. 571 Rabab Hayek, Guillaume Raschia, Patrick Valduriez, and Noureddine Mouaddib 1 Introduction .................................................. 572 2 Summarization Process ......................................... 573 2.1 Data Summarization ...................................... 573 2.2 Input Data ............................................... 575 2.3 Process Architecture ...................................... 576 2.4 Distributed Summary Representation ........................ 579 3 Summary Model for Hierarchical P2P Networks .................... 580 3.1 Problem Statement ....................................... 580 3.2 Model Architecture ....................................... 582 3.3 Summary Management .................................... 582 4 Query Processing .............................................. 586 4.1 Query Reformulation ..................................... 587 4.2 Query Evaluation ...................___.................. 588 5 Performance Evaluation ........................................ 590 5.1 Cost Model .............................................. 591 5.2 Simulation ....___...................................... 594 6 Related Work ................................................. 598 7 Conclusion ................................................... 598 References ....................................................... 599 Case Study: Scoop for Partial Read from P2P Database ............. 601 Farnoush Banaei-Kashani and Cyras Shahabi 1 Introduction ................................................. . 602 1.1 Motivation and Problem Definition .......................... 602 1.2 Related Work ............................................ 604 1.3 Scoop .................................................. 605 1.4 Roadmap ............................................... 608 2 Partial Read Operation .......................................... 608 2.1 Definitions .............................................. 609 3 Scoop: Partial Read by Epidemic Dissemination .................... 611 3.1 SIR Epidemic Dissemination ............................... 611 3.2 Percolation Model ........................................ 612 3.3 Tuning Scoop ............................................ 615 4 A Real-World Example of Scoop ................................. 617 4.1 Network Topology ........................................ 617 4.2 Analysis ................................................ 618 4.3 Algorithm ............................................... 618 5 Variants of Scoop .............................................. 619 6 Experiments .................................................. 620 6.1 Methodology ............................................ 620 6.2 Results ................................................. 621 7 Conclusion and Future Work .................................... 624 References ....................................................... 626 Part V Incentive Mechanisms Incentive Mechanisms for Cooperation in Peer-to-Peer Networks ..... 631 Daniel A. G. Manzato and Nelson L. S. da Fonseca 1 Introduction .................................................. 632 2 Characteristics and a Classification of Uncooperative Behaviors ....... 633 3 Comprehensive Study of Incentive Patterns ........................ 636 3.1 Trust Based Incentive Patterns .............................. 637 3.2 Trade Based Incentive Patterns ............................. 641 4 Selection of Incentive Schemes .................................. 649 4.1 Incentive Mechanism for the CoopNet Network ............... 649 4.2 Altruism in Peer-to-Peer Media Streaming .................... 652 4.3 Multicast with Incentive in Peer-to-Peer Media Streaming ....... 653 4.4 Client Selection with Differentiated Service .................. 654 4.5 Incentives in BitTorrent .................................... 656 4.6 Trading in Trust, Tokens and Stamps ........................ 656 4.7 Mobility in Ad hoc Wireless Networks with Incentives ......... 657 5 Final Remarks ................................................ 658 References ....................................................... 659 Bandwidth Trading as Incentive ................................. 661 Kolja Eger and Ulrich Killat 1 Introduction .................................................. 661 2 Trading Schemes for P2P Content Distribution ..................... 663 2.1 P2P Network Model ...................................... 663 2.2 Resource Pricing ......................................... 665 2.3 Reciprocal Rate Control ................................... 667 2.4 BitTorrent ............................................... 668 3 Nash Equilibrium .............................................. 668 4 Performance Evaluation ........................................ 669 4.1 Static networks ........................................... 670 4.2 Dynamic Networks ....................................... 672 5 Bandwidth Trading and Piece Selection ........................... 674 5.1 Piece-Dependent Resource Pricing .......................... 681 6 TCPeer: A TCP Variant for P2PCDNS ............................ 682 7 Conclusion ................................................... 683 References ....................................................... 684 Part VI Trust, Anonymity, and Privacy Reputation-Based Trust Management in Peer-to-Peer Systems: Taxonomy and Anatomy ....................................... 689 Loubna Mekouar, Youssef Iraqi, and Raouf Boutaba 1 Introduction and Motivation ..................................... 689 2 Traditional Systems Versus Reputation-Based Systems ............... 691 3 Trust and Reputation ........................................... 692 3.1 Trust Definition .......................................... 692 3.2 Reputation Definition ..................................... 693 3.3 Trust Properties .......................................... 693 3.4 System Model ........................................... 694 4 The Anatomy of Reputation Systems ............................. 699 4.1 The Local Trust .......................................... 700 4.2 The Reputation Query ..................................... 704 4.3 Reputation Computation ................................... 707 4.4 The Use of Reputation .................................... 712 4.5 Credibility Assessment .................................... 714 4.6 Incentives, Rewards and Punishment ........................ 714 5 Design Requirements ........................................... 716 6 Centralized Reputation Systems .................................. 716 6.1 e-Commerce Applications ................................. 716 6.2 P2P Systems ............................................. 719 7 Decentralized Reputation Systems ................................ 721 7.1 The Distributed Trust Model: DistributedTrust ................ 721 7.2 The Binary Distributed Trust Model: BinaryTrust .............. 722 7.3 Reputation Management by Choosing Reputable Servents: P2PBasic and P2PEnhanced ................................ 723 7.4 Reputation Management by the XRep Protocol: XRep .......... 723 7.5 Reputation Management Using EigenTrust ................... 724 7.6 Limited Reputation Sharing in P2P Systems: LimitedReputation . 725 7.7 Reputation Management Using Trust and Credibility Records: CredibilityRecords ....................................... 726 7.8 Reputation Management Using CCCI Methodology: MDNT ___ 726 7.9 Cooperative Peer Groups in Nice ............................ 726 8 Partially Decentralized Reputation Systems ........................ 727 8.1 BitTorrent ............................................... 728 8.2 The Inauthentic Detector Algorithm (IDA) and the Malicious Detector Algorithm (MDA) ................................ 728 9 Conclusion ................................................... 729 References ....................................................... 730 P2P Reputation Management Through Social Networking........... 733 Zoran Despotovic 1 Introduction .................................................. 733 2 P2P Reputation Systems........................................ 735 2.1 P2P Systems Perspective .................................. 738 2.2 Classification of Existing Solutions .......................... 739 3 Probabilistic Signaling Reputation Mechanisms .................... 741 3.1 Discussion .............................................. 744 4 Ad hoc Signaling Reputation Mechanisms ......................... 745 4.1 A Synchronous Algorithm ................................. 746 4.2 Discussion .............................................. 748 4.3 Bio-inspired P2P Reputation Systems ........................ 750 5 Sanctioning Reputation Mechanisms .............................. 751 5.1 Modeling Reputation ...................................... 752 6 Identities: An Important Practical Problem ......................... 756 7 Discussion and Conclusions ..................................... 757 References ....................................................... 758 State of the Art in Trust and Reputation Models in P2P networks ..... 761 Félix Gómez Mármol and Gregorio Martínez Pérez 1 Introduction .................................................. 761 2 Trust and Reputation Models.................................... 762 3 Discussion .................................................... 775 3.1 Trust and Reputation Management - What for? ................ 775 3.2 Trust and Reputation Models Steps .......................... 776 3.3 Common Challenges and Solutions in Trust and Reputation Management Over P2P Networks ........................... 777 3.4 Strengths and Weaknesses of the Described Models ............ 781 3.5 Real Scenarios ........................................... 782 4 Conclusions and Future Work .................................... 783 References ....................................................... 783 Anonymity in P2P Systems ..................................... 785 Pilar Manzanares-Lopez, Juan Pedro Muñoz-Gea, Josemaria Malgosa-Sanahuja, and Juan Carlos Sanchez-Aarnoutse 1 Introduction .................................................. 786 2 Source-Rewriting Systems ...................................... 787 2.1 Mixes .................................................. 787 2.2 Onion Routing ........................................... 789 2.3 Crowds ................................................. 792 2.4 Freenet................................................. 794 3 Broadcast Systems ............................................. 795 3.1 P5 ...................................................... 795 3.2 Hordes ................................................. 798 4 DC-Net Systems ............................................... 799 4.1 Herbivore ............................................... 799 5 Analysis of Anonymity ......................................... 800 5.1 Mix.. .................................................. 801 5.2 Onion Routing ........................................... 802 5.3 Crowds ................................................. 803 5.4 Crowds with Limited Path Lengths .......................... 804 6 Experimental Analysis of Anonymity ............................. 807 7 Summary ..................................................... 809 8 Future Research Directions ...................................... 810 References ....................................................... 811 Private Peer-to-Peer Networks .................................. 813 Michael Rogers and Saleem Bhatti 1 Introduction .................................................. 813 2 Background ................................................... 814 2.1 Definitions .............................................. 814 2.2 Technical Challenges ..................................... 815 3 Survey of Deployed Systems .................................... 816 3.1 Group-Based Networks .................................... 816 3.2 Friend-to-Friend Networks ................................. 817 3.3 Other Networks .......................................... 818 4 Architecture .................................................. 819 5 Related Research .............................................. 822 6 Conclusions .................................................. 823 References ....................................................... 824 Part VII Broadcast and Multicast Services Gossip-Based Broadcast ........................................ 831 João Leitão, José Pereira, and Luís Rodrigues 1 Introduction .................................................. 831 2 Gossip-Based Broadcast ........................................ 833 2.1 Parameters .............................................. 833 2.2 Strategies ............................................... 834 2.3 Peer Sampling Service .................................... 835 2.4 Partial View ............................................. 836 2.5 Strategies to Maintain Partial Views ......................... 837 2.6 Partial View Properties .................................... 837 2.7 Performance Metrics ...................................... 839 2.8 An Overview of Existing Protocols .......................... 840 3 The HyParView Protocol ........................................ 845 4 Achieving Resilient Broadcast ................................... 847 5 Building Low Cost Spanning Trees ............................... 848 6 Experimental Evaluation ........................................ 850 6.1 Experimental Setting ...................................... 851 6.2 HyParView and Eager Push Strategy ......................... 852 6.3 Plumtree ................................................ 855 7 Discussion and Future Directions ................................. 858 References ....................................................... 859 Employing Multicast in P2P Overlay Networks .................... 861 Mario Kolberg 1 Introduction .................................................. 861 1.1 IP Layer Multicast ........................................ 861 1.2 Application Layer Multicast (ALM) ......................... 862 2 Using IP Multicasting for Parallel P2P Overlay operations ............ 862 2.1 Host Group Multicasting .................................. 864 2.2 Multi-Destination Multicasting ............................. 864 2.3 Chuang-Sirbu Scaling Law ................................. 866 2.4 Strengths and Weaknesses ................................. 867 3 Application Layer Multicast ..................................... 868 3.1 Mesh First Approaches (NARADA) ......................... 869 3.2 Tree First Approaches ..................................... 869 3.3 Implicit Approaches ...................................... 870 3.4 Strengths and Weaknesses ................................. 871 4 Conclusions .................................................. 872 References ....................................................... 873 Multicast Services over Structured P2P Networks .................. 875 Pilar Manzanares-Lopez, Josemaria Malgosa-Sanahuja, Juan Pedro Muñoz-Gea, and Juan Carlos Sanchez-Aarnoutse 1 From IP Multicast to ALM...................................... 876 2 Flooding-Based Structured ALM................................. 877 2.1 CAN-Multicast .......................................... 877 2.2 DKS/Chord Multicast ..................................... 878 3 Tree-Based Structured ALM..................................... 881 3.1 Scribe .................................................. 881 3.2 Bayeux ................................................. 883 4 OverSim: A Useful P2P Simulation Tool .......................... 884 4.1 OMNeT+4- .............................................. 4.2 OverSim .............................................. 4.3 Chord-Multicast Implementation ............................ 887 4.4 Scribe Implementation .................................... 889 5 Performance Evaluation ........................................ 890 6 Summary ..................................................... 894 7 Future Research Directions ...................................... 894 References ....................................................... 895 Multicast Routing in Structured Overlays and Hybrid Networks .......................................... 897 Matthias Wählisch and Thomas С Schmidt 1 Introduction .................................................. 898 2 Overview of Structured Approaches to Group Communication ........ 898 2.1 Flooding of (Sub-)Overlays ................................ 899 2.2 Source-Specific Distribution Trees .......................... 901 2.3 Shared Distribution Trees .................................. 902 2.4 Bi-directional Shared Distribution Trees ...................... 903 3 Properties of Distribution Trees .................................. 904 3.1 CAN Flooding: fc-ary Trees with Node Chains ................ 904 3.2 Prefix-directed Forwarding: k-ary Trees with Node Redundancy . 908 3.3 Reverse Path Forwarding: Topology-Induced Trees ............ 910 4 Hybrid Multicast .............................................. 912 4.1 Inter-Domain Multicast Tunneling and Overlays ............... 913 4.2 Hybrid Shared Tree Architecture ............................ 914 5 A Common API for Group Communication ........................ 919 5.1 General Design Principles for Structured Overlay Networks - The Dabek Model ............................................ 919 5.2 Towards a Structured P2P Group Communication API .......... 922 5.3 Architectural Components ................................. 925 6 Discussions and Conclusions .................................... 928 6.1 Future Research Directions ................................ 930 References ....................................................... 930 Multicast and Bulk Lookup in Structured Overlay Networks ......... 933 Ali Ghodsi 1 Introduction .................................................. 933 1.1 Motivation .............................................. 934 2 Preliminaries .................................................. 934 2.1 Desirable Properties ...................................... 937 3 Broadcast .................................................... 938 3.1 Simple Broadcast ......................................... 939 3.2 Simple Broadcast with Feedback ............................ 941 4 Bulk Operations .............................................., 94?. 4.1 Bulk Operations .......................................... 944 4.2 Bulk Operations with Feedbacks ............................ 946 4.3 Bulk Owner Operations ................................... 946 5 Fault-Tolerance ................................................ 948 5.1 Pseudo Reliable Broadcast ................................. 950 6 Application: Efficient Overlay Multicast ........................... 952 6.1 Basic Design ............................................ 95?, 6.2 Group Management ....................................... 95? 6.3 IP Multicast Integration ................................... 954 7 Related Work ................................................. 955 References ....................................................... 956 Part VIII Multimedia Content Delivery Peer-to-Peer Content Distribution and Over-The-Top TV: An Analysis of Value Networks ............................................. 961 Jörn De Boever and Dirk De Grooff 1 Over-The-Top TV and P2P Systems .............................. 962 1.1 Evolutions of TV ......................................... 962 1.2 Over-The-Top TV........................................ 963 2 Theoretical Framework......................................... 965 2.1 P2P Systems and Business Modeling ........................ 965 2.2 Business Modeling Theory................................. 966 2.3 Value Networks.......................................... 967 3 Case Studies .................................................. 969 3.1 CaselrKontiki .......................................... 969 3.2 Case 2: Zattoo ........................................... 971 3.3 Case 3: Bittorrent Clients .................................. 974 4 The Role of ISPs .............................................. 976 5 Discussion and Conclusion ...................................... 978 References ....................................................... 981 Live Video and IP-TV .......................................... 985 Maria Luisa Meraní and Daniela Saladino 1 Live Streaming and IP-TV ...................................... 985 2 A Taxonomy of P2P Video Broadcasting Systems ................... 987 3 Popular P2P Streaming Systems .................................. 990 4 The Diffusion Process and a Reference System ..................... 991 4.1 Mesh-Based Systems ..................................... 991 4.2 Scheduling .............................................. 993 4.3 Software Architecture and Overlay Membership ............... 993 4.4 New CoolStreaming ...................................... 995 5 Measurements and Quality Monitoring ............................ 997 5.1 Network Edge Measurements .............................. 998 5.2 System Measurements .................................... 1002 6 Modeling Insights .....................___.................... 1009 6.1 First Modeling Efforts ..................................... 1009 6.2 More Recent Contributions ................................ 1011 6.3 A Numerical Comparison Between Mesh and Multiple-Trees .... 1015 7 Open Issues and Promising Solutions ............................. 1018 7.1 QoS and QoE ............................................ 1018 7.2 Network Awareness ....................................... 1019 7.3 Network Coding for P2P Streaming ......................... 1020 8 Summary ..................................................... 1023 References ....................................................... 1023 Providing VoD Streaming Using P2P Networks .................... 1025 Juan Pedro Muñoz-Gea, Josemaria Malgosa-Sanahuja, Pilar Manzanares-Lopez, and Juan Carlos Sanchez-Aamoutse 1 Introduction .................................................. 1026 2 P2P VoD Services Overview ..................................... 1028 3 Overlay Network Structure for P2P VoD ........................... 1028 3.1 Tree-Based Network Structure .............................. 1029 3.2 Mesh-Based Network Structure ............................. 1030 3.3 Hybrid Network Structure ................................. 1030 4 Forwarding Approaches ........................................ 1031 4.1 Buffer-Forwarding ........................................ 1031 4.2 Storage-Forwarding ....................................... 1032 4.3 Hybrid-Forwarding ....................................... 1032 4.4 Pre-Fetching ............................................. 1033 5 Suppliers Search ............................................... 1034 5.1 Searching in Buffer-Forwarding ............................ 1034 5.2 Searching in Storage-Forwarding ........................... 1036 6 Data Scheduling ............................................... 1037 6.1 Scheduling in Buffer-Forwarding ........................... 1038 6.2 Scheduling in Storage-Forwarding .......................... 1038 7 Technical Challenges ........................................... 1040 8 Summary ..................................................... 1040 9 Future Research Directions ...................................... 1041 References ....................................................... 1041 Part IX Mobile P2P Peer-to-Peer Overlay in Mobile Ad-hoc Networks .................. 1045 Marcel C. Castro, Andreas J. Kassler, Carla-Fabiana Chiasserini, Claudio Casetti, and Ibrahim Korpeoglu 1 Introduction .................................................. 1046 2 Overview on Peer-to-Peer and Ad -Нос Networks .................. . 1048 2.1 Peer-to-Peer Overlay Networks ......___................... 1048 2.2 Characteristics of Wireless Multi-hop and Mobility ............ 1049 2.3 Traffic Routing in Multi-hop Networks ....................... 1051 3 Challenges of Deploying P2P Services in Mobile Ad-hoc Networks .... 1053 4 Overview of P2P Solutions for Mobile Ad-hoc Networks ............. 1058 4.1 Integration Principles Between P2P and MANET Routing Layer ........................................... 1058 4.2 Unstructured P2P Networks for MANETs .................... 1059 4.3 Structured P2P Networks for MANETs ...................... 1062 4.4 Summary and Comparison of the Solutions ................... 1069 5 P2P Application Scenarios for Mobile Ad-hoc Networks ............. 1073 5.1 Decentralized Name Service ............................... 1073 5.2 Overlay-Based Multicast .................................. 1074 5.3 Multimedia Services ...................................... 1075 6 Summary ..................................................... 1076 References ....................................................... 1077 Opportunistic Information Retrieval in Sparsely Connected Ad Hoc Networks .................................................... 1081 Mooi-Choo Chuah and Jian-bin Han 1 Introduction .................................................. 1081 2 Related Work ................................................. 1083 3 System Model ................................................. 1084 4 Data/Index/Query Dissemination Schemes ......................... 1085 4.1 Data Caching ............................................ 1085 4.2 Index Advertising ........................................ 1086 4.3 Query Dissemination ...................................... 1087 4.4 DTN Message Routing Scheme ............................. 1087 4.5 Three Information Retrieval Schemes ........................ 1088 5 Performance Evaluation ........................................ 1089 5.1 Simulation Setup ......................................... 1089 5.2 Simulation Results ........................................ 1091 6 Discussion .................................................... 1102 7 Concluding Remarks ........................................... 1103 References ....................................................... 1104 The MOBI-DIK Approach to Searching in Mobile Ad Hoc Network Databases .................................................... 1105 Yan Luo, Ouri Wolfson, and Bo Xu 1 Introduction: MANET Databases ................................. 1105 2 Historical Background .......................................... 1106 3 Scientific Fundamentals ........................................ 1107 4 The МОВІ -DIK Approach ...................................... 1110 5 Key Applications .............................................. 1113 6 Future Research Directions ...................................... 1114 References ....................................................... 1115 Part X Fault Tolerance in P2P Networks Managing Network Partitions in Structured P2P Networks .......... 1127 Tallat M. Shafaat, Ali Ghodsi, and Seif Haridi 1 Introduction .................................................. 1128 2 Preliminaries .................................................. 1129 3 Detecting Network Partitions and Mergers ......................... 1131 4 Merging the Overlays .......................................... 1132 4.1 Simple Ring Unification ................................... 1132 4.2 Gossip-Based Ring Unification ............................. 1133 5 Performance Evaluation ........................................ 1135 6 Related Work ................................................. 1138 6.1 Merging P-Grid Overlays .................................. 1138 6.2 Merging Pastry Overlays .................................. 1142 6.3 Overlay Construction from Random Graph ................... 1142 6.4 Data Consistency ......................................... 1143 7 Summary ..................................................... 1144 7.1 Open Questions .......................................... 1145 References ....................................................... 1145 Load Balancing in Structured P2P Networks ...................... 1149 Yingwu Zhu 1 Introduction .................................................. 1149 1.1 Motivation .............................................. 1149 1.2 Load Definition .......................................... 1150 1.3 Goals ................................................... 1151 2 Load Information Aggregation and Dissemination .................. 1151 2.1 Tree Structure-Based Approach ............................. 1151 2.2 Gossip-Based Approach ................................... 1152 2.3 Summary ............................................... 1153 3 Load Balancing ............................................... 1153 3.1 Virtual Server-Based Approach ............................. 1153 3.2 Power of Two Choices .................................... 1154 3.3 Address-Space and Item Balancing .......................... 1154 3.4 Discussion .............................................. 1155 4 Case Study: Efficient, Proximity-Aware Load Balancing [14]......... 1155 4.1 Overview ............................................... 1155 4.2 LBI Aggregation and Dissemination ......................... 1156 4.3 Proximity-Aware VSA .................................... 1158 4.4 VST .................................................... 1160 4.5 Discussion .............................................. 1161 5 Future Research ............................................... 1162 6 Summary ..................................................... 1163 References ....................................................... 1163 Acyclic Preference-Based Systems ............................... 1165 Fabien Mathieu 1 Introduction .................................................. 1165 1.1 Stable Marriage: A Brief Overview .......................... 1167 1.2 Going P2P .............................................. 1167 1.3 Outline ................................................. 1168 2 Acyclic Preference-Based Systems ............................... 1168 2.1 Notation and Definition ................................... 1168 2.2 Acyclicity: Main Convergence Theorem ...................... 1171 2.3 Acyclic Classes .......................................... 1174 3 Self-Stabilization Speed ........................................ 1176 3.1 Upper Bounds ........................................... 1176 3.2 Expected Convergence Time ............................... 1178 3.3 Simulations ............................................. 1180 4 Stable Configuration Description ................................. 1185 4.1 Specific Notation ......................................... 1186 4.2 Acyclic Formulas ......................................... 1186 4.3 Node-Based Preferences................................... 1187 4.4 Acyclic and Distance-Based Preferences ..................... 1191 4.5 ^-Matching Generalization ................................. 1196 4.6 Some Basic Applications .................................. 1198 5 Conclusion ................................................... 1201 References ....................................................... 1201 Part XI Measurement and P2P Traffic Characteristics The Behavior of Free Riders in BitTorrent Networks ................ 1207 Manaf Zghaibeh, Kostas G. Anagnostakis, and Fotios С Harmantzis 1 Introduction .................................................. 1208 2 BitTorrent Background ......................................... 1209 3 Previous Work ................................................ 1210 4 Methodology ................................................. 1212 4.1 First Measurement Study .................................. 1212 4.2 Second Measurement Study ................................ 1213 5 Results and Discussion ......................................... 1215 5.1 First Measurement Study .................................. 1215 5.2 Second Measurement Study ................................ 1218 6 Conclusions .................................................. 1227 7 Future Work .................................................. 1229 References ....................................................... 1229 The Nature of Peer-to-Peer Traffic ............................... 1231 João V. P. Gomes, Pedro R. M. Inácio, Mário M. Freire, Manuela Pereira, and Paulo P. Monteiro 1 Introduction .................................................. 1232 2 The Importance of Traffic Characterisation ......................... 1234 2.1 The Effect of Peer-to-Peer Traffic in Computer Networks ....... 1234 2.2 Making Peer-to-Peer a Practicable Solution: Traffic Classification 1238 3 Peer-to-Peer Traffic Characterisation .............................. 1240 3.1 Generic Properties of Traffic from Peer-to-Peer Protocols ....... 1241 3.2 Analysing Peer-to-Peer Traffic Behaviour .................... 1242 3.3 Entropy as a Measure of Heterogeneity ...................... 1244 3.4 Capturing the Nature of Peer-to-Peer Traffic .................. 1244 4 Inside a Network: Using Behavioural Characteristics to Identify Peer-to-Peer Traffic ............................................ 1247 5 Summary ..................................................... 1249 References ....................................................... 1250 Characterization of P2P Systems ................................ 1253 Daniel Stutzbach and Reza Rej aie 1 Introduction .................................................. 1253 2 Measurement Techniques ....................................... 1254 2.1 Passive Monitoring ....................................... 1255 2.2 Participate ............................................... 1256 2.3 Crawl .................................................. 1256 2.4 Sample................................................. 1256 2.5 Centralize ............................................... 1257 2.6 Summary ............................................... 1257 3 What to Measure .............................................. 1258 3.1 Static Peer Properties ..................................... 1258 3.2 Dynamic Peer Properties .................................. 1259 3.3 Static Connectivity Properties .............................. 1261 3.4 Dynamic Connectivity Properties ........................... 1262 3.5 Summary ............................................... 12 2 4 Cruiser: A Fast P2P Crawler ..................................... 1263 4.1 The Design of Cruiser ..................................... 1264 4.2 Quantifying Snapshot Accuracy ............................ 1265 5 Sampling ..................................................... 1267 5.1 Sampling with Dynamics .................................. 1267 5.2 Sampling from Static Graphs ............................... 1268 5.3 Empirical Results ........................................ 1272 6 Summary and Future Work ...................................... 1274 References ....................................................... 1274 Improving Peer-to-Peer Transport Paths for Content Distribution ..... 1277 Gerhard Hasslinger 1 Introduction .................................................. 1277 2 P2P Networking on Broadband Internet Platforms .................., 1279 2.1 Users ................................................... 1279 2.2 P2P Service and Protocol Designers ......................... 1280 2.3 Content and Service Providers .............................. 1280 2.4 Network and Broadband Access Providers .................... 1281 2.5 Current Shifts in Internet Usage and Traffic Profiles ............ 1281 3 Distribution and Access to Content on the Internet .................. 1282 3.1 CDN Versus P2P Content Distribution ....................... 1283 3.2 Zipf Laws and 80:20 Rules ................................. 1284 4 Optimized Data Exchange in P2P Networks ........................ 1284 4.1 Current IETF Discussion on Application Layer Traffic Engineering ............................................. 1285 4.2 Experience from the P4P Project Including Traffic Engineering .. 1286 4.3 Influence of Biased Source Selection on the Overlay Topology ... 1287 4.4 Caches ................................................. 1288 4.5 Traffic Control for Bottlenecks ............................. 1289 5 Conclusions .................................................. 1290 References ....................................................... 1290 Part XII Advanced P2P Computing and Networking A Formai Architectural Model for Peer-to-Peer Systems ............. 1295 Lu Yan 1 Introduction .................................................. 1295 2 Action Systems ................................................ 1296 2.1 Actions ................................................. 1296 2.2 Classes and Objects ....................................... 1297 2.3 OO-action System ........................................ 1298 3 Initial Specification of the Gnutella System ........................ 1299 4 Action System Specification of the Gnutella System ................. 1300 5 Refining Gnutella Servent ....................................... 1302 5.1 Refining ConnectService .................................. 1303 5.2 Refining LookupService ................................... 1305 5.3 Refining DownloadService ................................. 1310 6 Concluding Remarks ........................................... 1312 7 Future Directions .............................................. 1312 References ....................................................... 1313 P2P Approach for Web Services Publishing and Discovery ........... 1315 Mohmammad Towhidul Islam, Mursalin Akon, and Xuemin (Sherman) Shen 1 Introduction .................................................. 1315 2 Web Services ................................................. 1317 2.1 Architecture of the Web Services ............................ 1317 2.2 UDDI Structure .......................................... 1318 3 Peer-to-Peer Computing ........................................ 1319 4 Web Services and P2P .......................................... 1319 5 A Framework for Web Services Using P2P ......................... 1321 5.1 Registering a Peer ........................................ 1321 5.2 Publishing Information .................................... 1322 5.3 Finding the Service ....................................... 1322 6 Keyword Based Service Discovery ............................... 1323 6.1 System Architecture ...................................... 1323 6.2 Query Engine ............................................ 1324 6.3 Load Balancing .......................................... 1325 7 Semantic Web Service .......................................... 1325 7.1 Domain Ontology ........................................ 1326 7.2 Semantic Web Service Discovery ........................... 1326 7.3 METEOR-S WSDI: A Semantic Web Services Tool ............ 1327 8 Spider: A Unified Web Service Discovery Tool ..................... 1329 8.1 Keyword Based Search .................................... 1329 8.2 Ontology Based Search .................................... 1330 8.3 Behavior Based Search .................................... 1330 9 Discussion on Open Issues ...................................... 1331 10 Conclusion ................................................... 1331 References ....................................................... 1331 Content-Based Publish/Subscribe Systems ........................ 1333 Haiying Shen 1 Introduction .................................................. 1333 2 Subscription Models ........................................... 1336 2.1 Topic-Based Systems ..................................... 1336 2.2 Content-Based Systems ................................... 1337 2.3 Type-Based Systems ...................................... 1337 3 Filter-Based and Multicast-Based Pub/Sub Systems ................. 1338 4 Centralized and Distributed Pub/Sub Systems ...................... 1340 4.1 Centralized Pub/Sub Systems ............................... 1341 4.2 Distributed Broker-Based Pub/Sub Systems ................... 1343 4.3 Distributed DHT-Based Pub/Sub Systems .................... 1348 5 Summary and Challenges ....................................... 1360 References ....................................................... 1361 Supporting Collaboration and Creativity Through Mobile P2P Computing ................................................... 1367 Adam Wierzbicki, Anwitaman Datta, Łukasz Żaczek, and Krzysztof Rządca 1 Introduction .................................................. 1367 2 Applications for Collaboration and Creativity Support ............... 1369 3 Collaboration Middleware Functionality ........................... 1371 3.1 General-Purpose Mobile P2P Middleware .................... 1371 3.2 Overview of Middleware Functions ......................... 1372 3.3 Required P2P Overlay Functions ............................ 1375 3.4 Research Issues Related to Middleware Function Design ........ 1376 4 SIP and P2PSIP ............................................... 1377 4.1 The Session Initiation Protocol ............................. 1377 4.2 P2PSIP ..........................................,,,.... 1381 4.3 A Case Study: SharedMind ........................,...,... 1385 4.4 Research Issues Related to SIP and P2PSIP ................... 1387 5 Vertically Integrated Overlay .................................... 1387 5.1 In the Realm of Ringless Routing ........................... 1388 5.2 Virtual Ring Routing ...................................... 1389 5.3 Identity Crisis in a Large-Scale Decentralized World ........... 1392 5.4 DHT Based on a SocialCircle .............................. 1393 5.5 The Outlook for Future Works .............................. 1397 5.6 Good and Better Peers .................................... 1397 6 Conclusions .................................................. 1398 References ....................................................... 1399 Index ........................................................... 1401
any_adam_object	1
author_GND	(DE-588)142337242
building	Verbundindex
bvnumber	BV035346917
callnumber-first	T - Technology
callnumber-label	TK5105
callnumber-raw	TK5105.525
callnumber-search	TK5105.525
callnumber-sort	TK 45105.525
callnumber-subject	TK - Electrical and Nuclear Engineering
classification_rvk	ST 200
classification_tum	DAT 250f
ctrlnum	(OCoLC)277069416 (DE-599)BVBBV035346917
dewey-full	004.65 004.652
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.65 004.652
dewey-search	004.65 004.652
dewey-sort	14.65
dewey-tens	000 - Computer science, information, general works
discipline	Informatik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02026nam a2200505 c 4500</leader><controlfield tag="001">BV035346917</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100222 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090305s2010 d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">GBA8D7614</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387097503</subfield><subfield code="9">0-387-09750-3</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780387097503</subfield><subfield code="c">hbk.</subfield><subfield code="9">978-0-387-09750-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)277069416</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV035346917</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-1049</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5105.525</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.65</subfield><subfield code="2">22</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.652</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 200</subfield><subfield code="0">(DE-625)143611:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 250f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Handbook of peer-to-peer networking</subfield><subfield code="c">Xuemin Shen ..., eds.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Springer</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XLVII, 1405 S.</subfield><subfield code="b">graph. Darst.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Peer-to-peer architecture (Computer networks)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Peer-to-peer architecture (Computer networks)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Peer-to-Peer-Netz</subfield><subfield code="0">(DE-588)4343110-0</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Mündung</subfield><subfield code="0">(DE-588)4154906-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)1071861417</subfield><subfield code="a">Konferenzschrift</subfield><subfield code="y">1978</subfield><subfield code="z">Hamburg</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Peer-to-Peer-Netz</subfield><subfield code="0">(DE-588)4343110-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Mündung</subfield><subfield code="0">(DE-588)4154906-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Mathematisches Modell</subfield><subfield code="0">(DE-588)4114528-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Shen, Xuemin</subfield><subfield code="d">1958-</subfield><subfield code="e">Sonstige</subfield><subfield code="0">(DE-588)142337242</subfield><subfield code="4">oth</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-0-387-09751-0</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">Digitalisierung UB Passau</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017151128&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017151128</subfield></datafield></record></collection>
genre	(DE-588)1071861417 Konferenzschrift gnd-content (DE-588)1071861417 Konferenzschrift 1978 Hamburg gnd-content
genre_facet	Konferenzschrift Konferenzschrift 1978 Hamburg
id	DE-604.BV035346917
illustrated	Illustrated
indexdate	2024-07-09T21:31:48Z
institution	BVB
isbn	0387097503 9780387097503
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-017151128
oclc_num	277069416
open_access_boolean
owner	DE-703 DE-91G DE-BY-TUM DE-83 DE-898 DE-BY-UBR DE-739 DE-355 DE-BY-UBR DE-1049
owner_facet	DE-703 DE-91G DE-BY-TUM DE-83 DE-898 DE-BY-UBR DE-739 DE-355 DE-BY-UBR DE-1049
physical	XLVII, 1405 S. graph. Darst.
publishDate	2010
publishDateSearch	2010
publishDateSort	2010
publisher	Springer
record_format	marc
spelling	Handbook of peer-to-peer networking Xuemin Shen ..., eds. New York Springer 2010 XLVII, 1405 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Peer-to-peer architecture (Computer networks) Peer-to-Peer-Netz (DE-588)4343110-0 gnd rswk-swf Mathematisches Modell (DE-588)4114528-8 gnd rswk-swf Mündung (DE-588)4154906-5 gnd rswk-swf (DE-588)1071861417 Konferenzschrift gnd-content (DE-588)1071861417 Konferenzschrift 1978 Hamburg gnd-content Peer-to-Peer-Netz (DE-588)4343110-0 s DE-604 Mündung (DE-588)4154906-5 s Mathematisches Modell (DE-588)4114528-8 s Shen, Xuemin 1958- Sonstige (DE-588)142337242 oth Erscheint auch als Online-Ausgabe 978-0-387-09751-0 Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017151128&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Handbook of peer-to-peer networking Peer-to-peer architecture (Computer networks) Peer-to-Peer-Netz (DE-588)4343110-0 gnd Mathematisches Modell (DE-588)4114528-8 gnd Mündung (DE-588)4154906-5 gnd
subject_GND	(DE-588)4343110-0 (DE-588)4114528-8 (DE-588)4154906-5 (DE-588)1071861417
title	Handbook of peer-to-peer networking
title_auth	Handbook of peer-to-peer networking
title_exact_search	Handbook of peer-to-peer networking
title_full	Handbook of peer-to-peer networking Xuemin Shen ..., eds.
title_fullStr	Handbook of peer-to-peer networking Xuemin Shen ..., eds.
title_full_unstemmed	Handbook of peer-to-peer networking Xuemin Shen ..., eds.
title_short	Handbook of peer-to-peer networking
title_sort	handbook of peer to peer networking
topic	Peer-to-peer architecture (Computer networks) Peer-to-Peer-Netz (DE-588)4343110-0 gnd Mathematisches Modell (DE-588)4114528-8 gnd Mündung (DE-588)4154906-5 gnd
topic_facet	Peer-to-peer architecture (Computer networks) Peer-to-Peer-Netz Mathematisches Modell Mündung Konferenzschrift Konferenzschrift 1978 Hamburg
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=017151128&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT shenxuemin handbookofpeertopeernetworking

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand! Inhaltsverzeichnis

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge