17-03-2014, 10:45 AM
Abstract-A new clustering route algorithm of p2p networks
based on knodel graph is proposed in this paper. According to
the primary method, our algorithm added physical clustering
in ordering to create relation between node's physical position
and logical id number can improve the route efficiency of the
whole Ic1idil p2p network.
INTRODUCTION
The value potential of the enormous resources in the
scope of WAN provides immense impetus for the integration
of network resources and the development of control
technology. The emergence of P2P networks makes it
possible to deploy a distributed computing environment
which is sleazy, available and has a certain guarantee of
service quality. P2P network is a typical network technology
based on Overlay, and it has reciprocity, easy deployment
and self-organization three basic properties.
P2P network topology has some relevance with node
management model, and it can be divided into random
topological P2P network and structured topological P2P
network. The typical networks of the random topological
structure are Freenet and Gnutella networks, and the typical
networks of the structured topological structure are CAN and
CHORD networks. The P2P network based on knodel
studied in this paper is also structured topological network,
and this network has a certain similarity with the CHORD
network in the framework, but the routing algorithm is
different. This network not only improves the efficiency of
the routing algorithm, but also reduces the routing table size
of each client node.
The core this new P2P network studied is its routing
algorithm. The study of the P2P network algorithm based on
Knodel model also only stays in solving the problem of
routing efficiency in accordance with the superiority of the
model itself, and if the factor of node physical location is
added in the routing process, the routing efficiency of the
whole knodel network will be further improved.
based on knodel graph is proposed in this paper. According to
the primary method, our algorithm added physical clustering
in ordering to create relation between node's physical position
and logical id number can improve the route efficiency of the
whole Ic1idil p2p network.
INTRODUCTION
The value potential of the enormous resources in the
scope of WAN provides immense impetus for the integration
of network resources and the development of control
technology. The emergence of P2P networks makes it
possible to deploy a distributed computing environment
which is sleazy, available and has a certain guarantee of
service quality. P2P network is a typical network technology
based on Overlay, and it has reciprocity, easy deployment
and self-organization three basic properties.
P2P network topology has some relevance with node
management model, and it can be divided into random
topological P2P network and structured topological P2P
network. The typical networks of the random topological
structure are Freenet and Gnutella networks, and the typical
networks of the structured topological structure are CAN and
CHORD networks. The P2P network based on knodel
studied in this paper is also structured topological network,
and this network has a certain similarity with the CHORD
network in the framework, but the routing algorithm is
different. This network not only improves the efficiency of
the routing algorithm, but also reduces the routing table size
of each client node.
The core this new P2P network studied is its routing
algorithm. The study of the P2P network algorithm based on
Knodel model also only stays in solving the problem of
routing efficiency in accordance with the superiority of the
model itself, and if the factor of node physical location is
added in the routing process, the routing efficiency of the
whole knodel network will be further improved.