000			03720nam a2200409 i 4500
999			_c387021 _d387021
001			387021
003			ES-MaUEC
005			20230203131937.0
006			a||||fo|||| 00| 0
007			cr nn 008mamaa
008			220601s2011 sz | o |||| 0|eng d
020			_a9783031799983
024	7		_a10.1007/978-3-031-79998-3 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aTK5105.525 _b2011 EB
100	1		_aKesidis, George _eautor _4aut _4http://id.loc.gov/vocabulary/relators/aut _9686528
245	1	3	_aAn Introduction to Models of Online Peer-to-Peer Social Networking _cby George Kesidis
250			_a1st edition 2011
264		1	_aCham _bSpringer International Publishing _c2011
300			_a1 recurso en línea (XIII, 111 páginas)
336			_atexto _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
347			_aarchivo de texto _bPDF
490	0		_aSynthesis Lectures on Learning Networks and Algorithms _x2690-4314
505	0		_aNetworking overview -- Graphs -- Games -- Search in structured networks -- Search in unstructured networks -- Transactions, reputations, and referrals -- False Referrals -- Peer-to-peer file sharing -- Consensus in dynamical belief systems -- Byzantine consensus -- Epidemics.
520			_aThis book concerns peer-to-peer applications and mechanisms operating on the Internet, particularly those that are not fully automated and involve significant human interaction. So, the realm of interest is the intersection of distributed systems and online social networking. Generally, simple models are described to clarify the ideas. Beginning with short overviews of caching, graph theory and game theory, we cover the basic ideas of structured and unstructured search. We then describe a simple framework for reputations and for iterated referrals and consensus. This framework is applied to a problem of sybil identity management. The fundamental result for iterated Byzantine consensus for a relatively important issue is also given. Finally, a straight-forward epidemic model is used to describe the propagation of malware on-line and for BitTorrent-style file-sharing. This short book can be used as a preliminary orientation to this subject matter. References are given for the interested student to papers with good survey and tutorial content and to those with more advanced treatments of specific topics. For an instructor, this book is suitable for a one-semester seminar course. Alternatively, it could be the framework for a semester's worth of lectures where the instructor would supplement each chapter with additional lectures on related or more advanced subject matter. A basic background is required in the areas of computer networking, probability theory, stochastic processes, and queueing. Table of Contents: Networking overview / Graphs / Games / Search in structured networks / Search in unstructured networks / Transactions, reputations, and referrals / False Referrals / Peer-to-peer file sharing / Consensus in dynamical belief systems / Byzantine consensus / Epidemics.
988			_aSynthesis Collection of Technology_2011
650		7	_2embne _9144553 _aArquitectura de redes informáticas
650		7	_2embne _9431622 _aRedes sociales en Internet
776	0	8	_iPrinted edition: _z9783031799976
776	0	8	_iPrinted edition: _z9783031799990
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-031-79998-3 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b02/2023 _dz _eb _zSI