Peer-to-peer network fees and commission etc charging method, involves determining charge and commission information by a first station of first part of station

The Invention relates to a method for charging in decentralized networks according to the preamble of claim 1 and an arrangement for charging in decentralized networks according to the preamble of claim 3rd

The the object underlying the invention is to provide a method and to provide an arrangement which the billing in decentralized networks allow (for example, peer-to-peer networks).

These Object, starting from the method according to the preamble of claim 1 achieved by the characterizing features as well, starting from the Arrangement according to the preamble of claim 3 achieved by the characterizing features.

On significant advantage of the invention is the reliable detection of consumption-based billing data in peer-to-peer networks.

given is a peer-to-peer (P2P) network based on distributed hash tables (DHT). An overview of such Networks are for example [<figref>1</figref>]. In this network Information (hereinafter referred to as resources) in a decentralized stored on those units whose "P2P address" (z. B. the hash IP address and port number) best with the key ID of the resource (Z. B. hash value of a search term, etc.) coincides, as measured by the each metric of P2P algorithm [<figref>2</figref>. <figref>3</figref>]. The devices (Hereinafter referred to as stations, units or peers designated) in authenticate this network and authorize itself or their production of messages with digital signatures and Certificates. The certificates are issued by a trusted, centralized (Certification Authority CA) issued in advance and as Resource in the P2P network introduced.

In This P2P network will now be provided a secure way, Services not only a flat rate of charging for a flat rate, but consumption based on isolated individual services, even if the service provision performed locally will.

charging is not currently practiced in P2P networks. In networks based on client-server architectures Services are provided by a central server for all clients. This may be a central gatekeeper z. B. over which the signaling processes running, and in which the client must authenticate. This Server but also collects all charging- Informations.

In a decentralized P2P network without real-time central components would therefore have every Peer itself incurred in his own fees to a central location weitermelden; However, this solution has the drawback that a manipulated peer could change or suppress these messages such as that an incorrect billing to the detriment of its would take place, which the P2P network and the services based on it provides.

According to Report the peers not only their own, but also the charging information other peers to a central point on. This is possible because for execution usually accesses stored of services on the P2P network information are necessary. If one or several peers use a service want, so even more other peers are involved in performing normally. Further advantages and details of the invention are based on the in the <figref idrefs="S9">1</figref> to <figref idrefs="S11">3</figref> embodiments shown explained. From that shows:

<figref idrefs="S9">1</figref> a embodiment the inventive arrangement;

<figref idrefs="S10">2</figref> a schematic representation of the storage according to the invention one at a peer associated Data set;

<figref idrefs="S11">3</figref> a schematic representation of the novel treatment of requests for resources in the peer-to-peer Netwerks.

In <figref idrefs="S9">1</figref> is the inventive arrangement shown. Evident is a so-called peer-to-peer network P2P network, which typically, through a variety of stations Peer1, Peer2, PeerA PeerB, PeerX that are generally associated with "peer" means, is formed.

Of Furthermore, a network for said P2P network external station to recognize SV, which according to the invention with the network P2P network a compound has, over the at least vergebührungsrelevante transfer information will. The external station SV is designed such that they invoicing of completed network services provides.

outgoing of the illustrated arrangement now comes the inventive method to the &lt;?page 3?&gt;Carrying, which is based on two basic features. To the one identifies each station Peer1, Peer2, PeerA, PeerB, PeerX, with its own certificate, and on the other collects the external station to the stations Peer1, Peer2, PeerA, PeerB, PeerX, ... The Related billing information.

As in <figref idrefs="S10">2</figref> done schematically illustrated a safe Billing records from the inventive arrangement such that, for example, a first station Peer1 his personal would drop profile as a resource in the P2P network. This profile contains information about Peer1 (Name, email address, phone number, IP address, etc.), the first the Station Peer1 other stations (peers) Peer2, PeerA, PeerB, PeerX would like to ask the network P2P network to enable they can communicate with him. This profile has as a resource in the P2P network in a specific ID, which determines what peers, for example PeersB ... PeersX, they is stored. These storing peers PeerB ... PeerX (for redundancy in usually several) place the generated by Peer1 and with the digital Certificate of the first station Peer1 signed resource file in their Memory. subsequently sends each of these peers send a copy to a central collection point SV for charging the first station Peer1.

In <figref idrefs="S11">3</figref> is shows how a stored resource requested inventively can be. Are resources according to the above-described method been filed, may Search all peers in the P2P network to a particular resource. If z. B. the first station Peer1 after a second profile Peer2 station searches, it will be this resource on one (or more) Peers PeerA..PeerX find (not to Peer2 directly!), and can Request it from there. According to the illustration found the first station Peer1 this on a recent peer PeerX. If this requirement has been signed by the first station Peer1, can too for charging of PeerB of the last station PeerX to the central collection point SV are forwarded.

If Now Peer1 received profile Peer2, he can an encrypted message generate at Peer2 and send them to Peer2, if it is online. If Peer2 is unreachable, Peer1 itself may now these store message as a resource in the P2P network, where the PeersA..X is stored. These peers send a copy to the central Transmitting site SV so Peer1 can be billed for it.

The central collection SV receives at least one copy of the fee request, resource, etc., even if the to vergebührende Peer does not send any information to the collection point. The reality this copy, the collection means of the digital certificate the charges check peers. In order to you may face the charges Peer irrefutably prove (non repudiation), that he this news / resource has created and signed. The production of false billing information is excluded if each peer requests / resources, for he billed will sign needs.

The Alerts the collection need not be done in real time. Is the cost of transmission the entire resource still too large, also can instead only its hash value and the associated transmitted signature will. Then leaves However, only prove in retrospect that anything with signed the digital certificate of the peer. Which message was actually signed and if they are really entitled to collect fees, let yourself then no longer prove.

The by applying the method and the inventive arrangement advantages may, for example, a safe, non dismissible Capturing detailed, usage-related billing data possible, the possibility, that a signaling not central server must be running and additional security from tampering the charging, as a peer is not for the acquisition of own fees responsible is such that otherwise avoided easily possible manipulation will.

The Invention is not intended thereby to the embodiments explained Limited be, but all can be generated within the skill of the art variations comprise the inventively essential cores - collecting the charging information through to execution participating peers which do not benefit from the service or the distribution of such information to external collection (Server), which then create the actual accounts - include.

literature

<ul><li>[1] Thomas Friese: "Self-organizing peer-to-peer networks", dissertation at Philipps University Marburg, March 2002</li><li>[2] Petar Maymounkov, David Mazieres: "Kademlia: A peer to peer Information System Bases on the XOR Metric ", New York University</li><li>[3] Stoica, Morris, Karger, Kaashoek, Balakrishnan: "Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications ", MIT Laboratory for Computer Science, 2001</li></ul>