Classifications

• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L61/00—Network arrangements, protocols or services for addressing or naming
  • H04L61/09—Mapping addresses
  • H04L61/10—Mapping addresses of different types
  • H04L61/103—Mapping addresses of different types across network layers, e.g. resolution of network layer into physical layer addresses or address resolution protocol [ARP]
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
  • H04L67/1059—Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/01—Protocols
  • H04L67/10—Protocols in which an application is distributed across nodes in the network
  • H04L67/104—Peer-to-peer [P2P] networks
  • H04L67/1087—Peer-to-peer [P2P] networks using cross-functional networking aspects
  • H04L67/1093—Some peer nodes performing special functions
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L67/00—Network arrangements or protocols for supporting network services or applications
  • H04L67/50—Network services
  • H04L67/56—Provisioning of proxy services
• • H—ELECTRICITY
  • H04—ELECTRIC COMMUNICATION TECHNIQUE
  • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
  • H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
  • H04L65/1066—Session management
  • H04L65/1101—Session protocols

Definitions

• the present invention relates to a method for Studentstra ⁇ gene of data between different peer-to-peer networks, a suitable peer device, and a corresponding network device.
• peer devices With peer-to-peer systems, it is possible to network a plurality of devices, referred to below as peer devices, without centralized devices such as servers. In this case, certain services, which are taken over in the usual client-server architectures by the respective central unit, the server, must be provided by the peer devices themselves.
• a particularly important func ⁇ tionality is the address resolution, ie the necessary for contacting a particular peer implementation of known data of the user to the network address of his device or its peer device.
• Known data can be z. Be the user name, a telephone number or other peer devices characterizing names.
• the Internet as the parent communication network with the well-known Internet Protocol TCP / IP verwen ⁇ det, so that the network address usually includes the IP address and the port of the peer.
• the communication between peers takes place via the protocol of the parent communication network, which is usually the Internet.
• the actual peer-to-peer network is then formed by a group of peers each having a node ID or node address within the peer-to-peer (P2P) network.
• P2P peer-to-peer
• a data connection between two peers of a P2P network requires next, determining the network address of the requested peer from the node address known to the requesting peer.
• a server keeps a central directory of the peers participating in the P2P network in the form of their node address and corresponding network address.
• File exchange platforms such as Napster or iMesh, Audio Galaxy or SongSpy are based on a P2P network with a corresponding central directory service. The disadvantage here is that in case of failure of the central directory service no new communication connections can be established more.
• no central server or excellent peer is provided for a directory service.
• a requesting peer dynamically locates peers of the P2P network and communicates with them to exchange data and information.
• the address resolution that is, the locating of the network address of the queried peer characterized by a node address in the P2P network, takes place dynamically via a routing protocol.
• DHT Distributed Hash Table
• the peers can for example be a number of peers or nodes ⁇ neighboring addresses and their network administrator ests in a local hash table or allocation abspei ⁇ manuals.
• the node address space has a metric that defines distances between peers or node addresses.
• a suitable algorithm for address resolution in a ring-organized decentralized P2P network is z. B.
• Chord algorithm which in Ion Stoica, Robert Morris, Da vid ⁇ Karger, M. Frans Kaashoek, Hari Balakrishnan, "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applicati ⁇ ons, MIT LCS TR-819 is described.
• node ID The assignment of a node address or node ID (node ID) can be determined, for example, by applying a hash function to a user name of the relevant peer. Analogously, also, such as Dateina ⁇ men a hash function are subjected to yield Searches a hash value. Each peer is assigned a range of hash values, e.g. B. are again arranged in ascending order. The first hash value of the respective peer associated area then corresponds to z. B. the node address of the referen ⁇ fenden peer. This determines, for example, which data is available under the hashed file name at a peer.
• a search for data or users or peers is performed by the querying or searching peer zername the hash value of the predetermined key word, such as file name, or Benut ⁇ z. B. telephone number.
• the requesting peer sends a search request to a peer having its node address and associated network address in a list of known peers, for example a neighbor list and / or Finger list of the requesting peer is listed. If the requested peer is responsible for the searched hash value, it sends the requested data to the requesting peer via the parent network.
• the first requested peer If the first requested peer is not responsible for the hash value, it responds with the address of a peer from its peer list whose node ID is more similar to the searched hash value than its own node address. Whether the own node ID is similar to the searched node ID or the searched hash value, results from the used metric of the node address space. The first requested peer thus sends ⁇ with the requesting peer node ID and IP address, which comes closer to the searched hash value. The requesting peer can now be a second search request to the peer with the surrounding bone ⁇ send th address. This process continues until a peer is found who is responsible for the hash value and can provide the searched data.
• P2P networks are used as example ⁇ application for exchanging files in file sharing networks.
• VOIP voice over IP
• a P2P network is known for voice transmission under the name "Skype". Participants of this network can exchange ⁇ each voice data and thus calls over the Internet.
• the present invention addresses the problem of Da ⁇ tentransfers between different P2P networks mostly different operators.
• the network address assignments of the other, foreign peers are basically unknown.
• the merging or adding of foreign peers requires the exchange of many stabilization messages in order to reconcile or restructure the neighbor lists of the individual peers. These must then be exchanged between the IP networks of the two operators.
• technical problems in the network of one operator also affect the quality of the service for the subscriber of the other operator. A separate licensing of the numbers of end customers of both operators is then difficult.
• gateways it has been proposed to link several P2P networks via so-called gateways.
• selected servers accept the incoming search requests from foreign networks and perform a search for the search query in the ei ⁇ gene P2P ring.
• the result of this search so in ⁇ play as a network address or IP address of a peer in the own network is then or the operator-foreign sent back to the requesting peer network.
• Such Ga ⁇ teways must be very powerful to cope with many searches.
• the address resolution of the searched peer in a peer-to-peer network which is different from the peer-to-peer network of the requesting peer, by passing the network address of the requesting peer to a peer device in the foreign network becomes. There can then be an address resolution of the searched peer in the foreign network until the destination peer is found, which can then build on the parent network, the data connection with the requesting peer or its network address.
• the overall communication network structures such as the Internet or similar network Struk ⁇ .
• the requesting peer device of the destination peer device has received the network address of a data connection between the first peer device and may then further target peer device to be built up over the parent Kommunikati ⁇ onsnetzwerk means of the network addresses.
• the structure of the foreign P2P network plays no role in the requesting peer device.
• the search for the network ⁇ work address of the target peer device is based on the protocol of the second peer-to-peer network. Is binding for the movement of such data ⁇ ultimately only the network address sammlunggeb- borrowed.
• the search request of the first peer device is forwarded to a further second peer device in the second peer-to-peer network, wherein the network address of the further peer device in the second peer-to-peer network is stored in a list.
• a list of network addresses of second peer devices in the second peer-to-peer network can be transmitted to a passive peer device, wherein the passive peer device is assigned to the first peer device. This can ensure the ⁇ that always an active instance or an addressable for a search query from their own peer-to-peer network out in the foreign destination network via a network address Peer device from which the search in the target peer-to-peer network can start.
• the invention further provides a peer device for a first peer-to-peer network having a node address in the first peer-to-peer network and having a network address in a parent communication network, the peer device having an associated passive one Peer device, which peer-to-peer network is independent and maintains at least one network address of a peer device in a second peer-to-peer network, and wherein the passive peer device is adapted to a search ⁇ request for a destination peer device in the second peer-to-peer network indicating the network address of the peer device to the at least one peer device (Pl ') in the second peer-to-peer network sends.
• a peer device for a first peer-to-peer network having a node address in the first peer-to-peer network and having a network address in a parent communication network
• the peer device having an associated passive one Peer device, which peer-to-peer network is independent and maintains at least one network address of a peer device in a second peer-to-pe
• the peer device according to the invention is particularly suitable for carrying out the method according to the invention for data transmission between peer-to-peer networks.
• the passive peer device which is also referred to as a passive instance in the peer-to-peer network, while the usual peer devices are active instances in the network, is not part of the peer-to-peer network. It merely supplies one or more network addresses which are necessary for a search query in the foreign peer-to-peer network.
• the requesting peer device If, for example, the requesting peer device carries out a hunt for a subscriber name, whereby a foreign node address, that is, not the peer-to-peer network associated node address is generated, passes the passive peer device ⁇ this goal Node address to a peer device of the foreign peer-to-peer network which corresponds to the network address stored by the passive peer device.
• the search in the foreign network is performed according to a suitable search algorithm and returns the network address of the searched target peer to the requesting peer device, since the passive peer device has passed the network address of the requesting peer.
• the passive peer device therefore preferably has no node address assigned in one of the peer-to-peer networks and can not be addressed by other peer devices.
• the peer device preferably has a stored partial hash table of a distributed hash table of the peer-to-peer network, which comprises an assignment of node addresses to network addresses.
• the at least one peer device is an executable computer program with a stability program module for stabilizing the peer-to-peer network according to a peer-to-peer protocol
• Memory program module is implemented for storing data and a search program module for generating search queries on a computer, wherein the passive peer Einrich ⁇ processing on the search program module using the Any artwork least a network address the peer device in the second peer-to-peer network accesses.
• Peer-to-peer networks such as file sharing, wel ⁇ operate che so-called file sharing, can be constructed from coupled to the Internet computers.
• the realization of a peer device according to the invention therefore only requires the implementation of an additional passive peer device, which transfers to the search program module the network address of a peer device in the second peer-to-peer network.
• the passive peer device therefore only comprises a table with possible network addresses of foreign peer devices, so that the further address resolution then takes place in the foreign peer-to-peer network.
• the computer charging by means of the data transmission according to the invention between different peer-to-peer networks is also low since only lending to the search in their own peer-to-peer network reproached program modules is used.
• a network arrangement with a first peer-to-peer network with first peer devices and at least one second peer-to-peer network with second peer devices is provided, wherein at least one of the peer devices is designed according to the invention.
• each peer device is assigned a passive peer device.
• networking of all peer-to-peer networks results from the intended passive peer devices, which in turn can each be designed as a computer program.
• At least one peer device is provided as a load balancer, which forwards the search request of a passive peer device to a peer device in the respective peer-to-peer network.
• a load balancer which preferably keeps a list of peer devices active in the respective peer-to-peer network and their network addresses, therefore ensures that the search in the destination peer-to-peer network always from one of its peer devices can be carried out starting.
• At least one peer device is provided as a rendezvous peer which, on request of a passive peer device, provides at least one network address of a peer device in the respective peer-to-peer network.
• the list of passive peer devices may first be updated with possible network addresses of peer devices in the target peer-to-peer network.
• At least one of the peer-to-peer networks working preference ⁇ with a distributed hash table, and in particular with a Chord algorithm or a Kademlia algorithm for address resolution in the respective network.
• FIG. 1 shows a ring-organized peer-to-peer network
• FIG. 2 shows two P2P networks coupled according to the invention
• FIG. 3 a functional diagram of a peer device
• FIG. 4 two P2P networks with a rendezvous peer coupled in accordance with the invention.
• FIG. 5 shows a plurality of P2P networks coupled according to the invention.
• an annular organized P2P network is by way of example Darge ⁇ represents in FIG. 1
• peer devices P1-P8 which are designed, for example, as a computer connected to the Internet with an installed P2P software. Each peer therefore has an IP address IP1-IP8 identifying it on the Internet and a node address NID1-NID8 identifying it as a peer in the P2P network P2P1.
• IP1-IP8 IP address
• NID1-NID8 node address NID1-NID8
• the node address of a peer results, for example, by applying a suitable hash function to the name of the peer.
• the name may be, for example, a user name or a telephone number.
• the hash value of a corresponding search word for example a telephone number, is assigned to a node ID or a node address.
• the table shows the full table of the P2P network. This is not central riding provided by a server be ⁇ but up to the individual peers P1-P8 ⁇ shares stored.
• Each peer knows the assigned hash Values of his neighbors, for example the nearest neighbor.
• each peer has a partial hash table with the assignment of hash values be ⁇ ner in the node address space neighboring peers and, optionally, the assignment of hash values of one or more finger peers z.
• the peer P3 then examines its partial hash table PHT3 and determines the peer P7 as the peer whose jurisdiction or associated hash values are closest to the searched hash value 530 and sends a corresponding second search query F2.
• the peer P7 determined in its side ⁇ associated partial hash table PHT7 the peer P6 with the node address 523 as the hash value 530 competent peer and sends this information to the originally requesting peer P2 whose network address IP2 is associated with the search requests Fl, F2.
• the peer P7 could, if the peer P2 has send a data query of the search term with the hash value 530 ver ⁇ , the peer P6 send the data retrieval request from the peer P2, and the network address IP2 in a message F3 x to.
• the destination peer P6 then transmits directly to the requesting peer P2 or its IP address IP2 the data designated by the hash value 530 via a data connection F4 in the communication network or Internet.
• a corresponding P2P protocol enables the address resolution of searched data, for example from the peer P2, which has no information about the storage location of this data in the P2P network, since the partial hash table PHT2 assigned to the peer P2 does not have this node address range includes.
• two peer-to-peer networks P2P1, P2P2 are each presented with peer devices P1-P4, P1 -P5 X X.
• the peer devices P1-P4, P1 -P5 X X each network addresses IP1-IP4 and assigned IP1 X -IP5 X and Node Interface addresses NID1-NID4, NIDL X -NID5 x in their respective P2P network.
• NID1-NID4, NIDL X -NID5 x in their respective P2P network.
• the two P2P networks P2P1, P2P2 shown in FIG. 2 are operated by different operators or providers. For example, it is conceivable that the P2P networks serve VOIP transmission between their subscribers, each using a peer device.
• the address resolution takes place, as was described, for example, with reference to FIG.
• a subscriber A who operates the peer Pl wants to communicate with a subscriber B who operates the peer P2 x in the second P2P network P2P2P2
• an embodiment of the method according to the invention must be used.
• the Peer Pl is assigned a passive peer device pPl.
• the passive peer device PPL is such designed work as a passive instance the respective network ⁇ P2P1 that it can store any data from other peers but only queries to active instances, so peers send.
• the passive peer device pPl keeps at least one IP address or network address of a peer device in a foreign peer-to-peer network ready.
• Both P2P networks P2P1, P2P2 are implemented in a higher-level communication network, such as the Internet IN.
• the participant A has z. B. as a node address NIDl the hash value of its subscriber name such. B. hash (participantA @ operatorl).
• the peer device Pl determines that the node address NID2 x lies in the foreign peer-to-peer network P2P2. This activates the passive peer device pPl which holds the peer table pPT with active instances or peers of the foreign P2P network P2P2 and their network addresses or IP addresses IP x .
• the passive peer device PPL itself has no node-Ad ⁇ ress for one of the P2P networks but is performed only DER art that it searches a quoting
• Destination node address and preferably the network address IPl of its peer Pl to a peer Pl x of the foreign network P2P2 can send.
• the passive peer device PP1 therefore transmits via the
• the node address NID2 x is listed in the partial hash table or neighbor list of the peer Pl x . That is, the peer Pl x sends to the IP address IPl of the requesting peer pPl from the P2P network P2P1, the network address IP2 x of the target peer P2 x .
• an address resolution can be performed from the peer pPl for a destination peer P2 x in a foreign peer-to-peer network P2P2.
• the passive peer pPl can now request the destination peer P2 x with the IP address or network address IP2 x .
• the higher-level communication network here the Internet IN
• a data connection between the IP addresses IP1, IP2 x is now possible, which is indicated by the arrow S4 in FIG.
• a passive peer PPL associated with the peer Pl it is thus mög ⁇ Lich, a query into the target P2P network to exportie ⁇ reindeer, where these Runaway after the valid search algorithm there is ⁇ leads.
• FIG. 3 schematically shows the structure of a peer device P1 according to an embodiment of the invention.
• a peer device Pl can be particularly com ⁇ puter implemented as executable software on a Compu ter ⁇ run.
• a corresponding computer program or peer Pl a stability program module SM, a memory program module RM, a search program module LM and a pro ⁇ program module ppm for the passive peer.
• further modules such as, for example, a module for implementing the partial hash table PHT1 with the respective neighboring peer and peer addresses for the search algorithm or the search module LM can be provided.
• the peer Pl or the peer software usually interacts with a higher-level application software AP, which serves to re ⁇ al Deutschen the respective function of the computer.
• the Stabilticianspro ⁇ program module is used, among other things, the neighbors table PHTl or the associated partial hash table of the peer taping Pl to aktua ⁇ if additional peers in the P2P network eintre- fail th or peers.
• the stability program module ver ⁇ adds suitable stability algorithms, each of which ensures a suitable for the peer Pl partial hash table.
• the memory program module RM serves, for example, to store data or files which are to be made available to the P2P network. These may be, for example, addresses, telephone numbers, user names or file names.
• the search program module LM realizes, for example, the search algorithms explained in FIGS. 1 and 2 in the peer-to-peer network.
• the search program module engages include the partial hash table of the peer PHTl 1 and generates corresponding search queries, for example, the target bone ⁇ th address and the own network address.
• the pas ⁇ sive peer module pPM has access to the search program module LM and supplies this the network address of a peer in ei ⁇ nem foreign network as an IP address for a peer who can process the query. This happens when the peer PI is to communicate with a peer having a destination node address that is not associated with its own P2P network.
• the search engine module thus generates a
• an address resolution for example, as explained with reference to FIG. 2, can be carried out.
• the program modules for stabilizing the own P2P network SM, for storing RM and for generating search LM is usually provided in peer facilities or corresponding software
• the extension with a passive peer module pPM means only a small extra effort. Since the passive peer module is not assigned any node address, the overall network structure of the respective P2P networks also does not become more complex.
• FIG. 4 shows a further possible embodiment of the invention.
• a first peer-to-peer network P2P1 with peer devices P1-P5 is provided, in which each peer device P1-P5 is assigned a passive peer device pPl-pP5.
• a second peer-to-peer network is constructed with P2P2 peer devices Pl x -P5 ⁇ wherein each peer P1 -P5 X X a passive peer inputs direction PPL x -pP5 x is assigned.
• each peer P1-P5 Pl x - P5 x passive instance in the form of passive peer device is assigned to each of the peer devices when there is a search for files or information in foreign can peer-to-peer networks the search algorithm of the respective target peer-to-peer network, as has already been explained in detail above.
• a peer device is designed as a Rendezvous-Peer RV.
• This rendezvous peer RV provides a list of network addresses of active peers of the second peer-to-peer network P2P2, one of these IP addresses of a peer listed in a list APL being a passive peer pPl of the first network P2P1 is provided if a query from the P2P network P2P1 must be made in the second P2P network P2P2.
• the Rendezvous Peer RV provides a respective passive peer pPl, ie always a selection of peers of the network P2P2, which are active and can start the search algorithms of the P2P2.
• the passive peer pPl first asks in a request MO x at the rendezvous peer RV for possible IP addresses of peers in the second network to which a subsequent search request can be forwarded.
• the rendezvous peer checks its list APL and transmits one or more corresponding IP ADDR ⁇ sen, for example the peer P3 x in a corresponding message to the passive peer MO PPL.
• the passive peer pPl then generates a search query specifying the node address, for example NID5 of the IP address of its peer Pl as start address for the search query and the IP address of the requested peer IP3 x .
• This search request Sl goes to the peer P3 x , which then starts the search algorithm in the second peer-to-peer network P2P2.
• a rendezvous peer RV thus ensures that a passive peer always has a suitable IP address for a peer in the target peer-to-peer network to which a search request can be determined.
• FIG. 5 shows a further embodiment of the invention.
• each P2P network is assigned at least one load balancer LB1, LB2, LB3, which is responsible for search requests from foreign passive peer devices.
• the first message of a search query from a passive peer to a destination P2P network is always sent to the load balancer LB1, LB2, LB3.
• This load balancer derives the search request entwe ⁇ ⁇ to any peer from a list of active peers of the destination network or preferably already to the peer whose node address of the destination node address is closest.
• the passive peer pPl sends, for example, its search request Tl to the load balancer LB2 of the second peer-to-peer network P2P2. This determines that the peer P3 x ge ⁇ the searched destination node address, for example NID4 x is closest, and passes the search request to the peer P3 x pass.
• the Netztechnikad ⁇ ress IP4 x of the destination peer 4 x contains.
• the peers Pl and P4 x can then establish a data connection between their IP addresses IPl and IP4 x .
• the load balancers LB1, LB2, LB3 do not have to be executed as active instances in the P2P networks. It is sufficient that the load balancers LBL LB2, LB3, respectively present a list of active peers APL ⁇ conduct stolen to search queries. The larger the list of load balancers, the better they can distribute the burden of externally-arrived search queries on their target peer-to-peer network.
• the load balancer can also be executed identically with a rendezvous peer, as has been explained in FIG. Then, a corresponding combined peer device transfers to ⁇ next a list of active peers to the requesting passive peer device. It is also possible to provide a plurality of load balancers whose IP addresses are then transmitted to corresponding passive peer devices before a search request.
• the invention can be used, for example, for VOIP applications or file-sharing applications. While the invention is essentially based on a chord algorithm for finding ad ⁇ ests or data in P2P network described, other forms of organization of P2P networks can be used. By way of example only, the Kademlia search algorithm is mentioned.

Landscapes

• Engineering & Computer Science (AREA)
• Computer Networks & Wireless Communication (AREA)
• Signal Processing (AREA)
• Computing Systems (AREA)
• Data Exchanges In Wide-Area Networks (AREA)
• Computer And Data Communications (AREA)

Applications Claiming Priority (2)

Publications (1)

Family

ID=37853011

Family Applications (1)

Country Status (5)

Families Citing this family (20)

Family Cites Families (8)

• 2006
  • 2006-05-09 DE DE102006021591A patent/DE102006021591B3/de not_active Expired - Fee Related
• 2007
  • 2007-05-02 US US12/300,261 patent/US20090119386A1/en not_active Abandoned
  • 2007-05-02 CN CNA2007800259705A patent/CN101491063A/zh active Pending
  • 2007-05-02 WO PCT/EP2007/054243 patent/WO2007128746A1/de active Application Filing
  • 2007-05-02 EP EP07728697A patent/EP2018761A1/de not_active Withdrawn

Non-Patent Citations (1)

Also Published As

Similar Documents

Legal Events