• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 460
  • 91
  • 43
  • 34
  • 29
  • 28
  • 27
  • 24
  • 16
  • 13
  • 10
  • 9
  • 9
  • 8
  • 2
  • Tagged with
  • 857
  • 857
  • 317
  • 309
  • 197
  • 142
  • 142
  • 137
  • 137
  • 102
  • 87
  • 81
  • 80
  • 78
  • 72
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
51

Evaluating the Effectiveness of Sybil Attacks Against Peer-to-Peer Botnets

Verigin, Adam Louis 18 December 2013 (has links)
Botnets are networks of computers which have been compromised by malicious software which enables a remotely located adversary to control them and focus their collective power on specific tasks. Botnets pose a significant global threat, with tangible political, economic and military ramifications and have resultingly become a field of significant interest within the cyber-security research community. While a number of effective defence techniques have been devised for botnets utilizing centralized command and control infrastructures, few of these techniques are suitable for defending against larger-scale peer-to-peer (P2P) botnets. In contrast, the sybil attack, combined with index poisoning is an established defence technique for P2P botnets. During a sybil attack, fake bots (\ie sybils) are inserted into the botnet. These sybils distribute fake commands to bots, causing them not to carry out illicit activities. Bots also then unwittingly redistribute the fake commands to other bots in the botnet. This work uses packet-level simulation of a Kademlia-based P2P botnet to evaluate 1) the impact that the location of sybils within the underlying network topology can have on the effectiveness of sybil attacks and 2) several potential optimizations to the placement of sybils within the underlying network topology. / Graduate / 0537 / 0544 / 0984
52

Agent behavior in peer-to-peer shared ride systems

Wu, Yunhui Unknown Date (has links) (PDF)
Shared ride systems match the travel demand of transport a client with the supply of vehicles, or hosts, so that the client find rides to their destinations. A peer-to-peer shared ride system allows a client to find rides in an ad-hoc manner, by negotiating directly with nearby hosts via radio-based communication. Such a peer-to-peer shared ride system has to deal with various types of hosts, such as private cars, taxicabs and mass transit vehicles. Agents, i.e. a client and hosts, have diverse behaviors in such systems. Their different behaviors affect the negotiation process, and consequently the travel choices. Preliminary research (Winter et al. 2005) has investigated peer-to-peer shared ride systems with homogeneous hosts and immobile client. This thesis extends their work to multiple types of agents. It focuses on what are typical agent behaviors in peer-to-peer shared ride systems, and how these behaviors affect negotiation processes in a dynamic transport environment. (For complete abstract open document)
53

Bounded rationality for BitTorrent networks

Wu, Yiping. January 2008 (has links)
Thesis (M.S.)--University of Missouri-Columbia, 2008. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 19, 2009) Includes bibliographical references.
54

Global virtual market Konzept für einen dezentral organisierten elektronischen Markt /

Hartert, Dirk. January 2003 (has links)
Mannheim, Univ., Diss., 2002.
55

Dezentrale Bootstrapping-Verfahren für Peer-to-Peer-Systeme

Antonovic, Manuela. January 2007 (has links)
Stuttgart, Univ., Studienarbeit, 2007.
56

Designing a resilient routing infrastructure for peer-to-peer networks

Liu, Huaiyu, Lam, Simon S., January 2005 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2005. / Supervisor: Simon S. Lam. Vita. Includes bibliographical references.
57

Bandwidth allocation algorithms for file distribution networks and location-aware topology construction in peer-to-peer networks /

Ou, Qi. January 2007 (has links)
Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 64-67). Also available in electronic version.
58

Measuring and characterizing properties of peer-to-peer systems /

Stutzbach, Daniel, January 2006 (has links)
Thesis (Ph. D.)--University of Oregon, 2006. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves 214-227) and index. Also available for download via the World Wide Web; free to University of Oregon users.
59

Overlay network mechanisms for peer-to-peer systems

Darlagiannis, Vasilios. Unknown Date (has links)
Techn. University, Diss., 2005--Darmstadt.
60

Podpora automatizovaného multiplatformního sdílení a synchronizace souborů

Košíček, Michal January 2014 (has links)
KOŠÍČEK, M. Support for automated cross-platform sharing and files synchronization. Brno, 2013. This thesis examines the issue of sharing and synchronizing files between different types of devices. It deals with the possible tools and technologies for the realization of automated sharing. It performs analysis of applications to share data and on the basis of this knowledge determines the appropriate procedures and techniques for the implementation application for data sharing.

Page generated in 0.0668 seconds