نتایج جستجو برای: peer to peer topology

تعداد نتایج: 10640056  

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه صنعتی امیرکبیر(پلی تکنیک تهران) - دانشکده مهندسی کامپیوتر 1386

کرم واره ها (کرم های کامپیوتری)، به علت قابلیت انتشار مستقل و اثرات مخربی که می توانند بر جای بگذارند، یکی از بزرگترین تهدیدات شبکه محسوب می گردند. روش های تشخیص کرم واره باید از سرعت بالایی برخوردار بوده، نرخ خطای پایینی داشته و قابلیت تشخیص کرم واره ها ی جدید را نیز داشته باشند. شبکه های جدیدی مانند شبکه peer-to-peer (p2p)باعث به وجود آمدن زمینه جدیدی برای فعالیت کرم واره ها شده اند. کرم واره...

Journal: :journal of advances in computer engineering and technology 2015
mahdi sattarivand

abstract— peer-to-peer ( p2p ) systems have been the center of attention in recent years due to their advantage . since each node in such networks can act both as a service provider and as a client , they are subject to different attacks . therefore it is vital to manage confidence for these vulnerable environments in order to eliminate unsafe peers . this paper investigates the use of genetic ...

Journal: :International Journal of Computer Applications 2013

Journal: :Computer Communications 2008
Chao Xie Guihai Chen Art Vandenberg Yi Pan

Modeling peer-to-peer (P2P) networks is a challenge for P2P researchers. In this paper, we provide a detailed analysis of large-scale hybrid P2P overlay network topology, using Gnutella as a case study. First, we re-examine the power-law distributions of the Gnutella network discovered by previous researchers. Our results show that the current Gnutella network deviates from the earlier power-la...

Journal: :Peer-to-Peer Networking and Applications 2015
Spiridoula V. Margariti Vassilios V. Dimakopoulos

Probabilistic flooding has been proposed as a means of reducing the excessive message overheads induced by plain flooding in unstructured peer-to-peer network search. We propose here Advanced Probabilistic Flooding (apf), a novel strategy which operates differently from other known strategies. In particular, the decision of a node to propagate a message (or not) is based on both the popularity ...

Journal: :Computer Communications 2008
Murat Karakaya Ibrahim Korpeoglu Özgür Ulusoy

The existence of a high degree of free riding in Peer-to-Peer (P2P) networks is an important threat that should be addressed while designing P2P protocols. In this paper we propose a connection-based solution that will help to reduce the free riding effects on a P2P network and discourage free riding. Our solution includes a novel P2P connection type and an adaptive connection management protoc...

Journal: :JNW 2010
Wenjun Xiao Weibing Wang

General networks such as Internet are complex heterogeneous networks, which are constructed by many different organizations, and so become non-effective ones. Therefore one constructed a level of software over networks which is called overlay or virtual topology. In this paper we present principle of symmetry for general network topology by using Cayley graph models and show its necessity to im...

Journal: :Computer Networks 2016
Gurhan Gunduz Murat Yuksel

Peer-to-peer (P2P) networks have gained importance and spread significantly during the last decades resulting in raised research interest in this area. The basic premise of P2P design is higher scalability and many existing large-scale applications, such as Twitter and Skype, use a form of P2P design. Although structured P2P designs enable one to guarantee finding of every item (rare or popular...

2009
Quanqing Xu Heng Tao Shen Zaiben Chen Bin Cui Xiaofang Zhou Yafei Dai

Mobile P2P networks have potential applications in many fields, making them a focus of current research. However, mobile P2P networks are subject to the limitations of transmission range, wireless bandwidth, and highly dynamic network topology, giving rise to many new challenges for efficient search. In this paper, we propose a hybrid search approach, which is automatic and economical in mobile...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید