Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In this paper, we consider the problem of constructing scale-free networks in a deterministic manner. Scale-free networks have several favorable properties as the topology of interconnection networks such as the short diameter and the quick message propagation. The proposed algorithm is an extension of the Bulut's algorithm for constructing scale-free networks with designated minimum degree k and...
Super-peer network is a type of peer-to-peer networks. In a super-peer network, a super-peer is a peer that has more ability than other peers have and is responsible for some of the tasks of network management. Since different peers vary in terms of capability, selecting a super-peer is a challenge problem. Gradient topology is a type of super-peer networks. Because of dynamicity of peers, adaptive...
Centrality metrics of complex networks are often used to study vulnerability of networks. Thus, node-importance research are with theoretical significance and wide-spread applications. Based on neighbors average degree, this paper presents a novel approach, which combines degree of a node and the average degree of its neighbors to measure node importance. By cascading failures experiments on real-world...
In superpeer based networks, the superpeers are discovered through the process of bootstrapping, whereby resourceful peers get upgraded to superpeers. However, bootstrapping is influenced by several factors like limitation on the maximum number of connections a peer can have due to bandwidth constraints, limitation on the availability of information of existing peers due to cache size constraints...
The resource locating efficiency is the core issue of P2P systems. The unstructured P2P systems adopt the flooding mechanism, which causes huge network burden. The Structured P2P systems, however, employs routing based on DHT, which results in an expensive topology maintenance. This paper will propose a semi-construct P2P model. Based on the research of the small world theory, this model combines...
This work presents a study on the fault-tolerance of unstructured P2P overlays, modeled as complex networks. A framework is proposed to derive the peers' degree distribution, once the P2P system is described through the evolution laws characterizing the distributed protocol, the attachment and failure rates. From the degree distribution, estimations may be derived on the mean number of m-neighbors,...
The topological properties of mobile P2P Ad Hoc networks are critical factors that dominate the performance of these networks. The node degree and diameter of these networks are most important parameters which measure the autonomy, efficiency, robustness and load balancing of these networks. In order to improve the four features for these networks, researchers have proposed many practical systems...
In this paper, we develop a rational model of a market-oriented service overlay network in which peers trade resources and services through a common currency called energy. In our model, an overlay network is created by a set of non-cooperative resource providing peers, called platforms, that perform resource pricing and topology management to maximize their own energy gains. Resource consuming peers,...
Unstructured peer-to-peer systems represent viable candidates for supporting distributed applications with frequent node failures. This paper presents a framework to study the reliability of evolving overlay networks in presence of faulty nodes. We focus on the node degree distribution, an important metric to understand whether the topology of the overlay can be maintained in presence of peer churns...
In this paper we present an analytic study of the impact of churn in cluster-based overlay networks. Cluster-based overlays keep the best of unstructured and structured overlays in terms of scalability, fault-tolerance and stability. Most of join and leave events have no impact on the overall overlay topology making these overlays highly robust to high churn. The only situations that effectively give...
Network coding is a promising technology to improve throughput and reliability. However, the benefit of network coding is restricted and affected by network topology, especially in peer-to-peer system. Precise topology awareness can be helpful to improve system performance of network coding in terms of throughput and reliability. In this paper, we propose an innovative scheme TANCF (Topology Awareness...
Propagation of Peer-to-Peer (P2P) worms in the Internet is posing a serious challenge to network security because of P2P worms' increasing complexity and sophistication, significant damages their propagation can cause, and recent popularity of P2P networks with increasing number of users. No existing work has solved the problem of propagation modeling of P2P worms due to its complexity. This paper...
Peer-to-Peer (P2P) worms have become a serious problem on the Internet because of its adaptive propagation features. Due to the complexity of the problem, no existing work has solved the problem of modeling the propagation of P2P worms, especially when quarantine of peers is enforced. This paper presents a study on modeling the propagation of P2P worms under quarantine. We strive to find a quarantine...
Propose an evolution model for Peer-to-Peer (P2P) file-sharing systems, which try to capture the dynamic properties of P2P application networks. The model consists of four events: node joining, node departure, connection establishing and connection breaking, which captures the most important events in constructing network topology. The evolution model results in a differential equation about degree...
Several proposals on P2P-ISP cooperation have recently been developed using information sharing for locality-based peering. Their benefits in terms of P2P efficiency, ISP cost, and traffic localization have been demonstrated in the single ISP case. However, potential risks associated with such cooperation have not been well examined. This paper develops a taxonomy and a mathematical model to explore...
This paper presents a study on modeling the propagation process of topology-aware worms. Topology-aware worms are more intelligent and adaptive to network topologies than other worms, thus are more difficult to control. Due to the complexity of the problem, no existing work has solved the problem of modeling the propagation of topology-aware worms. Our major contributions in this paper are firstly,...
Currently there is a growing belief that using peer-to-peer (P2P) approach leads to noticeable improvement in the performance of network management systems (NMSs). However P2P systems can be potential vehicle for active worms which can spread in all manager peers in a short time. This issue has not been studied in the literature. In this paper we address effects of active worm propagation in a P2P...
In a content distribution network based on overlay networks, the peer's upload bandwidth is always constrained. To optimize the system performance, one problem is how to assign the upload capacity to the right neighbors for transferring data blocks. In a system using network coding technology, a strategy which is to select the right neighbors based upon the degrees of them is proposed. The selection...
This paper proposes a new kind of anti-worm called P2P anti-worm which propagates using P2P techniques. A mathematical analysis of this new approach is conducted and a mathematical model of P2P anti-worm is introduced to analyze the propagation. Simulation is made on SSFNET to compare the P2P anti-worm and pure random scan worm. The simulation results show that P2P anti-worm can slow down the speed...
The mechanism for a peer to randomly choose logical neighbors, without any knowledge about the physical topology, causes a serious topology mismatch between the overlay networks and the physical network. A flooding-based search is robust to node failure, but the response message will be lost if any node on the response path fails, and the flooding search may causes heavy network traffic. In order...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.