Verfügbarkeit: Overlay networks

Overlay networks: toward information networking

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Tarkoma, Sasu (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Boca Raton [u.a.] CRC Press 2010
Schriftenreihe:	An Auerbach book
Schlagworte:	Datenverarbeitung Information networks Peer-to-peer architecture (Computer networks) Electronic data processing > Distributed processing Multimedia communications
Online-Zugang:	Inhaltsverzeichnis
Beschreibung:	XIII, 245 S. Ill., graph. Darst.
ISBN:	9781439813713

Internformat

MARC


LEADER	00000nam a2200000zc 4500
001	BV036039326
003	DE-604
005	20100312
007	t
008	100217s2010 xxuad\|\| \|\|\|\| 00\|\|\| eng d
010			\|a 2009046412
020			\|a 9781439813713 \|c hardcover : alk. paper \|9 978-1-439-81371-3
035			\|a (OCoLC)463639414
035			\|a (DE-599)BVBBV036039326
040			\|a DE-604 \|b ger \|e aacr
041	0		\|a eng
044			\|a xxu \|c US
049			\|a DE-739
050		0	\|a TK5105.5
082	0		\|a 004.6/52
084			\|a ST 200 \|0 (DE-625)143611: \|2 rvk
100	1		\|a Tarkoma, Sasu \|e Verfasser \|4 aut
245	1	0	\|a Overlay networks \|b toward information networking \|c Sasu Tarkoma
264		1	\|a Boca Raton [u.a.] \|b CRC Press \|c 2010
300			\|a XIII, 245 S. \|b Ill., graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
490	0		\|a An Auerbach book
650		4	\|a Datenverarbeitung
650		4	\|a Information networks
650		4	\|a Peer-to-peer architecture (Computer networks)
650		4	\|a Electronic data processing \|x Distributed processing
650		4	\|a Multimedia communications
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=018931239&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-018931239

Datensatz im Suchindex

_version_	1804141067372593152
adam_text	Contents Preface ................................................................................xi About the Author ....................................................................xiii 1 Introduction .......................................................................1 1.1 Overview .....................................................................1 1.2 Overlay Technology ...........................................................2 1.3 Applications ..................................................................8 1.4 Properties of Data .............................................................8 1.5 Structure of the Book .........................................................10 2 Network Technologies ............................................................13 2.1 Networking ..................................................................13 2.2 Firewalls and NATs ..........................................................15 2.3 Naming ......................................................................17 2.4 Addressing ...................................................................18 2.5 Routing ......................................................................19 2.5.1 Overview .............................................................19 2.5.2 Interdomain ...........................................................20 2.5.3 Border Gateway Protocol ..............................................21 2.5.4 Current Challenges ....................................................21 2.5.5 Compact Routing ......................................................22 2.6 Multicast .....................................................................22 2.6.1 Network-layer Multicast ...............................................23 2.6.2 Application-layer Multicast ............................................24 2.6.3 Chaining TCP Connections for Multicast ...............................25 2.7 Network Coordinates ........................................................25 2.7.1 Vivaldi Centralized Algorithm .........................................26 2.7.2 Vivaldi Distributed Algorithm .........................................26 2.7.3 Applications ..........................................................26 2.7.4 Triangle Inequality Violation ...........................................27 2.8 Network Metrics .............................................................28 2.8.1 Routing Algorithm Invariants .........................................28 2.8.2 Convergence ..........................................................28 2.8.3 Shortest Path ..........................................................28 2.8.4 Routing Table Size and Stretch .........................................29 2.8.5 Forwarding Load ......................................................29 2.8.6 Churn .................................................................30 2.8.7 Other Metrics .........................................................30 3 Properties of Networks and Data .................................................33 3.1 Data on the Internet ..........................................................33 3.1.1 Video Delivery ........................................................33 3.1.2 P2P Traffic .............................................................35 3.1.3 Trends in Networking .................................................35 3.2 Zipf s Law ...................................................................36 3.2.1 Overview .............................................................36 3.2.2 Zipf s Law and the Internet ............................................37 3.2.3 Implications for P2P ...................................................37 3.3 Scale-free Networks ..........................................................37 3.4 Robustness ...................................................................39 3.5 Small Worlds .................................................................40 Unstructured Overlays ............................................................43 4.1 Overview ....................................................................43 4.2 Early Systems ................................................................44 4.3 Locating Data ................................................................44 4.4 Napster ......................................................................45 4.5 Gnutella .....................................................................46 4.5.1 Overview .............................................................46 4.5.2 Searching the Network ................................................48 4.5.3 Efficient Keyword Lists ................................................49 4.6 Skype ........................................................................50 4.7 BitTorrent ....................................................................50 4.7.1 Torrents and Swarms ..................................................53 4.7.2 Networking ...........................................................54 4.7.3 Choking Mechanism ..................................................54 4.7.4 Antisnubbing .........................................................55 4.7.5 End Game .............................................................55 4.7.6 Trackerless Operation .................................................55 4.7.7 BitTorrent Vulnerabilities ..............................................56 4.7.8 Service Capacity .......................................................56 4.7.9 Fluid Models for Performance Evaluation ..............................57 4.8 Cross-ISP BitTorrent ..........................................................58 4.9 Freenet.......................................................................60 4.9.1 Overview .............................................................60 4.9.2 Bootstrapping .........................................................62 4.9.3 Identifier keys .........................................................62 4.9.4 Key-based Routing ....................................................64 4.9.5 Indirect Files ..........................................................65 4.9.6 API ...................................................................65 4.9.7 Security ...............................................................66 4.10 Comparison ..................................................................67 Foundations of Structured Overlays ..............................................71 5.1 Overview ....................................................................71 5.2 Geometries ...................................................................72 5.2.1 Trees ..................................................................73 5.2.2 Hypercubes and Tori ..................................................73 5.2.3 Butterflies .............................................................74 5.2.4 de Bruijn graph ........................................................74 5.2.5 Rings ..................................................................75 5.2.6 XOR Geometry ........................................................76 5.2.7 Summary .............................................................76 5.3 Consistent Hashing ..........................................................77 5.4 Distributed Data Structures for Clusters ...................................... 78 5.4.1 Linear Hashing ........................................................ 78 5.4.2 SDDS Taxonomy ......................................................79 5.4.3 LH* Overview .........................................................80 5.4.4 Ninja ..................................................................82 Distributed Hash Tables ..........................................................85 6.1 Overview ....................................................................85 6.2 APIs .........................................................................86 6.3 Plaxton s Algorithm ..........................................................87 6.3.1 Routing ...............................................................87 6.3.2 Performance ..........................................................88 6.4 Chord ........................................................................89 6.4.1 Joining the Network ...................................................90 6.4.2 Leaving the Network ..................................................90 6.4.3 Routing ...............................................................91 6.4.4 Performance ..........................................................92 6.5 Pastry ........................................................................92 6.5.1 Joining and Leaving the Network ......................................93 6.5.2 Routing ...............................................................93 6.5.3 Performance ..........................................................95 6.5.4 Bamboo ...............................................................96 6.6 Koorde .......................................................................96 6.6.1 Routing ...............................................................96 6.6.2 Performance ..........................................................97 6.7 Tapestry ......................................................................97 6.7.1 Joining and Leaving the Network ......................................98 6.7.2 Routing ...............................................................99 6.7.3 Performance .........................................................100 6.8 Kademlia ...................................................................101 6.8.1 Joining and Leaving the Network .....................................101 6.8.2 Routing .............................................................. 101 6.8.3 Performance ......................................................... 102 6.9 Content Addressable Network .............................................. 103 6.9.1 Joining the Network ..................................................103 6.9.2 Leaving the Network .................................................104 6.9.3 Routing ..............................................................105 6.9.4 Performance .........................................................105 6.10 Viceroy .....................................................................106 6.10.1 Joining the Network ..................................................106 6.10.2 Leaving the Network .................................................107 6.10.3 Routing ..............................................................107 6.10.4 Performance .........................................................107 6.11 Skip Graph ..................................................................108 6.12 Comparison ................................................................109 6.12.1 Geometries ...........................................................110 6.12.2 Routing Function .....................................................110 6.12.3 Churn ................................................................110 6.12.4 Asymptotic Trade-offs ................................................110 6.12.5 Network Proximity ...................................................112 6.12.6 Adding Hierarchy to DHTs ...........................................112 6.12.7 Experimenting with Overlays ........................................113 6.12.8 Criticism .............................................................114 Probabilistic Algorithms .........................................................115 7.1 Overview of Bloom Filters ...................................................115 7.2 Bloom Filters ................................................................116 7.2.1 False Positive Probability .............................................118 7.2.2 Operations ...........................................................119 7.2.3 d-left Counting Bloom Filter ..........................................120 7.2.4 Compressed Bloom Filter .............................................121 7.2.5 Counting Bloom Filters ...............................................121 7.2.6 Hierarchical Bloom Filters ............................................123 7.2.7 Spectral Bloom Filters ................................................124 7.2.8 Bloomier Filters ......................................................124 7.2.9 Approximate State Machines .........................................125 7.2.10 Perfect Hashing Scheme ..............................................125 7.2.11 Summary ............................................................125 7.3 Bloom Filters in Distributed Computing .....................................127 7.3.1 Caching ..............................................................127 7.3.2 P2P Networks ........................................................128 7.3.3 Packet Routing and Forwarding ......................................128 7.3.4 Measurement ........................................................129 7.4 Gossip Algorithms ..........................................................130 7.4.1 Overview ............................................................130 7.4.2 Design Considerations ...............................................132 7.4.3 Basic Models .........................................................132 7.4.4 Basic Shuffling .......................................................133 7.4.5 Enhanced Shuffling ..................................................135 7.4.6 Flow Control and Fairness ............................................135 7.4.7 Gossip for Structured Overlays .......................................136 Content-based Networking and Publish/Subscribe ..............................137 8.1 Overview ...................................................................137 8.2 DHT-based Data-centric Communications ...................................138 8.2.1 Scribe ................................................................138 8.2.2 Bayeux ...............................................................139 8.2.3 SplitStream ...........................................................139 8.2.4 Overcast .............................................................140 8.2.5 Meghdoot ............................................................141 8.2.6 MEDYM .............................................................141 8.2.7 Internet Indirection Infrastructure ....................................141 8.2.8 Data-oriented Network Architecture ..................................141 8.2.9 Semantic Search ......................................................142 8.2.10 Distributed Segment Tree ............................................142 8.2.11 Semantic Queries ....................................................143 8.3 Content-based Routing ......................................................144 8.4 Router Configurations .......................................................145 8.4.1 Basic Configuration ..................................................145 8.4.2 Structured DHT-based Overlays ......................................146 8.4.3 Interest Propagation ..................................................147 8.5 Siena and Routing Structures ................................................148 8.5.1 Routing Blocks.......................................................148 8.5.2 Definitions ...........................................................150 8.5.3 Siena Filters Poset ....................................................150 8.5.4 Advertisements ......................................................152 8.5.5 Poset-derived Forest ..................................................152 8.5.6 Filter Merging ........................................................154 8.6 Hermes .....................................................................156 8.7 Formal Specification of Content-based Routing Systems .....................158 8.7.1 Valid Routing Configuration ..........................................158 8.7.2 Weakly Valid Routing Configuration ..................................159 8.7.3 Mobility-Safety .......................................................159 8.8 Pub/sub Mobility ...........................................................160 Security ..........................................................................165 9.1 Overview ...................................................................165 9.2 Attacks and Threats .........................................................166 9.2.1 Worms ...............................................................166 9.2.2 Sybil Attack ..........................................................166 9.2.3 Eclipse Attack ........................................................166 9.2.4 File Poisoning ........................................................167 9.2.5 Man-in-the-Middle Attack ............................................168 9.2.6 DoS Attack ...........................................................168 9.3 Securing Data ...............................................................169 9.3.1 Self-Certifying Data ..................................................169 9.3.2 Merkle Trees .........................................................170 9.3.3 Information Dispersal ................................................171 9.3.4 Secret-sharing Schemes ...............................................171 9.3.5 Smartcards for Bootstrapping Trust ...................................171 9.3.6 Distributed Steganographic File Systems ..............................172 9.3.7 Erasure Coding ......................................................173 9.3.8 Censorship Resistance ................................................173 9.4 Security Issues in P2P Networks .............................................174 9.4.1 Overview ............................................................174 9.4.2 Insider Attacks .......................................................176 9.4.3 Outsider Attacks .....................................................176 9.4.4 SybilGuard ...........................................................177 9.4.5 Reputation Management with EigenTrust .............................178 9.5 Anonymous Routing ........................................................180 9.5.1 Mixes ................................................................180 9.5.2 Onion Routing .......................................................181 9.5.3 Tor ...................................................................181 9.5.4 P2P Anonymization System ..........................................182 9.5.5 Censorship-resistant Lookup: Achord ................................184 9.5.6 Crowds ..............................................................184 9.5.7 Hordes ...............................................................184 9.5.8 Mist ..................................................................185 9.6 Security Issues in Pub/Sub Networks .......................................186 9.6.1 Hermes ..............................................................186 9.6.2 EventGuard ..........................................................187 9.6.3 QUIP ................................................................187 10 Applications .....................................................................189 10.1 Amazon Dynamo ...........................................................189 10.1.1 Architecture ..........................................................191 10.1.2 Ring Membership ....................................................193 10.1.3 Partitioning Algorithm ...............................................193 10.1.4 Replication ...........................................................194 10.1.5 Data Versioning ......................................................194 10.1.6 Vector Clocks ........................................................195 10.1.7 Coping with Failures .................................................196 10.2 Overlay Video Delivery .....................................................197 10.2.1 Live Streaming .......................................................197 10.2.2 Video-on-Demand ...................................................198 10.3 SIP and P2PSIP .............................................................200 10.4 CDN Solutions ..............................................................203 10.4.1 Overview ............................................................203 10.4.2 Akamai ..............................................................207 10.4.3 Limelight ............................................................208 10.4.4 Coral .................................................................208 10.4.5 Comparison ..........................................................211 11 Conclusions .....................................................................213 References ...........................................................................217 Index ................................................................................235
any_adam_object	1
author	Tarkoma, Sasu
author_facet	Tarkoma, Sasu
author_role	aut
author_sort	Tarkoma, Sasu
author_variant	s t st
building	Verbundindex
bvnumber	BV036039326
callnumber-first	T - Technology
callnumber-label	TK5105
callnumber-raw	TK5105.5
callnumber-search	TK5105.5
callnumber-sort	TK 45105.5
callnumber-subject	TK - Electrical and Nuclear Engineering
classification_rvk	ST 200
ctrlnum	(OCoLC)463639414 (DE-599)BVBBV036039326
dewey-full	004.6/52
dewey-hundreds	000 - Computer science, information, general works
dewey-ones	004 - Computer science
dewey-raw	004.6/52
dewey-search	004.6/52
dewey-sort	14.6 252
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>01433nam a2200397zc 4500</leader><controlfield tag="001">BV036039326</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20100312 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">100217s2010 xxuad\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2009046412</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781439813713</subfield><subfield code="c">hardcover : alk. paper</subfield><subfield code="9">978-1-439-81371-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)463639414</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV036039326</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxu</subfield><subfield code="c">US</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK5105.5</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004.6/52</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="100" ind1="1" ind2=" "><subfield code="a">Tarkoma, Sasu</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Overlay networks</subfield><subfield code="b">toward information networking</subfield><subfield code="c">Sasu Tarkoma</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton [u.a.]</subfield><subfield code="b">CRC Press</subfield><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 245 S.</subfield><subfield code="b">Ill., 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="490" ind1="0" ind2=" "><subfield code="a">An Auerbach book</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information networks</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">Electronic data processing</subfield><subfield code="x">Distributed processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multimedia communications</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=018931239&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-018931239</subfield></datafield></record></collection>
id	DE-604.BV036039326
illustrated	Illustrated
indexdate	2024-07-09T22:09:59Z
institution	BVB
isbn	9781439813713
language	English
lccn	2009046412
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-018931239
oclc_num	463639414
open_access_boolean
owner	DE-739
owner_facet	DE-739
physical	XIII, 245 S. Ill., graph. Darst.
publishDate	2010
publishDateSearch	2010
publishDateSort	2010
publisher	CRC Press
record_format	marc
series2	An Auerbach book
spelling	Tarkoma, Sasu Verfasser aut Overlay networks toward information networking Sasu Tarkoma Boca Raton [u.a.] CRC Press 2010 XIII, 245 S. Ill., graph. Darst. txt rdacontent n rdamedia nc rdacarrier An Auerbach book Datenverarbeitung Information networks Peer-to-peer architecture (Computer networks) Electronic data processing Distributed processing Multimedia communications Digitalisierung UB Passau application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018931239&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis
spellingShingle	Tarkoma, Sasu Overlay networks toward information networking Datenverarbeitung Information networks Peer-to-peer architecture (Computer networks) Electronic data processing Distributed processing Multimedia communications
title	Overlay networks toward information networking
title_auth	Overlay networks toward information networking
title_exact_search	Overlay networks toward information networking
title_full	Overlay networks toward information networking Sasu Tarkoma
title_fullStr	Overlay networks toward information networking Sasu Tarkoma
title_full_unstemmed	Overlay networks toward information networking Sasu Tarkoma
title_short	Overlay networks
title_sort	overlay networks toward information networking
title_sub	toward information networking
topic	Datenverarbeitung Information networks Peer-to-peer architecture (Computer networks) Electronic data processing Distributed processing Multimedia communications
topic_facet	Datenverarbeitung Information networks Peer-to-peer architecture (Computer networks) Electronic data processing Distributed processing Multimedia communications
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=018931239&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT tarkomasasu overlaynetworkstowardinformationnetworking

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