FR2814017A1 - Communications network router payment system having digital word packets received predetermined sum released from packet memorised global sum/then packets transmitted. - Google Patents

Abstract

The router payment system has packets transmitted and received on communications network.

Description

<Desc / Clms Page number 1>
The present invention relates to a method of compensating a router of a communication network.

It also relates to a method of transmitting a data packet over a communication network via paid routers. Correlatively, the present invention relates to a device for compensating a router and a device for transmitting data packets over a communication network.

The present invention relates generally to the field of communication networks of the Internet or local network type comprising several routers adapted to receive and transmit data packets over the network.

More specifically, it relates to the remuneration of the various routers on the communication network as a function in particular of the traffic carried by each of these routers.

The billing mechanisms used to date to remunerate routers according to traffic are based on traffic measurements which can be carried out at the ends of the network. Thus, the number of data packets transmitted by a client station on the network is measured at a router close to the client station, in order to evaluate the duration of use of the network by the client station.

This specific router often corresponds to Internet service providers (Internet Service Provider or ISP).

This access provider then distributes the payment received from the client station to the various routers on the network, according to their contribution to the transmission of data packets.

Such a billing system requires specific measures of traffic at different network borders.

<Desc / Clms Page number 2>

 In addition, it is difficult to convert the number of packets and the number of bytes transmitted in minutes of network use, due in particular to variations in bandwidth on the network.

The present invention aims to provide a router compensation system on a communication network in which billing is carried out within the communication network.

To this end, the present invention relates to a method of compensating a router of a communication network suitable for receiving and transmitting data packets on the communication network.

According to the invention, this remuneration method comprises the following stages - reception of a data packet; - withdrawal of a predetermined amount from a global sum of money stored in the data packet; and - transmission of the data packet on the communication network.

Thus, thanks to the invention, each router on the path of a data packet in the communication network takes a fraction of a sum of money directly stored in the data packet.

In addition to the usual routing function, the routers of the communication network also have a function of withdrawing an amount of money from the data packets received by this router.

Thanks to the invention, the invoicing and remuneration of the different routers is carried out according to the actual traffic of the data packets on each of these routers of the communication network.

According to a preferred characteristic of the invention, the debiting step comprises the sub-steps - reading an initial global sum of money stored in said data packet; - subtracting a predetermined amount from the initial total sum of money;

<Desc / Clms Page number 3>

 - storage of said predetermined amount in an electronic purse of the router; and - replacement of the initial total sum by the remaining total sum after subtracting the predetermined amount.

Each data packet can thus cross the communication network as soon as it contains in memory an initial global sum of money sufficient for the remuneration of each of the routers of the communication network.

According to another preferred characteristic of the invention, the remuneration method further comprises the following steps - checking for the received data packet if this data packet has already been transmitted by said router; and - if so, transmission of the data packet without debiting said predetermined amount.

Thanks to this particular characteristic, any overcharging of a router is avoided when a data packet has to be retransmitted due to a failure of one of the routers of the communication network.

According to another preferred characteristic of the invention, the remuneration method comprises a prior step of memorizing for each connection established between the router and a client station, a certificate of authentication of the currency stored in data packets sent by the client station, and a step of validating the predetermined amount of money to be taken from the data packet.

It is thus verified, before each withdrawal, that the currency included in each data packet is indeed valid in order to avoid any fraudulent use of the communication network.

According to another aspect of the invention, a method of transmitting a data packet from a client station and bound for a server station via paid routers of a communication network comprises a step of storing in a specific field of said data packet of a global sum of money, each router of the network of

<Desc / Clms Page number 4>

 communication being adapted to withdraw a predetermined amount from said global sum of money.

By directly storing the global sum of money to be spent on the network in the data packet, any loss of money in the communication network is avoided.

The storage of the global sum of money can also be carried out directly when cutting the data to be transmitted into packets of predetermined length.

According to a particularly practical embodiment of the invention, the method of transmitting a data packet comprises the following steps - determination of a set of routers adapted to establish a connection between the client station and the server station; - Acquisition of predetermined amounts of money received respectively by the routers of said set of routers; and - storage in a specific field of said data packet of a global sum of money greater than or equal to the sum of said predetermined amounts received by the routers.

Thus, for each connection to be established between a client station and a server station, a path in the communication network is determined via a set of routers used.

Thanks to the acquisition of the various rights of way perceived by the routers of the communication network, it is possible to determine the global sum of money which must be memorized in each data packet to allow the transfer of the latter from the client station to the communication network server station.

Correlatively, the present invention relates to a device for compensating a router of a communication network, the router being adapted to receive and transmit data packets on the communication network, comprising - means for receiving a packet of data;

<Desc / Clms Page number 5>

 - means for withdrawing a predetermined amount from a global sum of money stored in the data packet; and - means for transmitting the data packet over the communication network.

This router compensation device has characteristics and advantages similar to those described above with reference to the compensation method according to the invention.

The present invention also relates to a device for transmitting a data packet from a client station and destined for a server station via paid routers of a communication network, comprising storage means in a specific field of said data packet of a global sum of money, the routers of the communication network being adapted to take a predetermined amount of said global sum of money.

This device for transmitting a data packet has advantages and characteristics similar to those described above with reference to the transmission method according to the invention.

The present invention also relates directly to a communication network router comprising means suitable for implementing the remuneration method according to the invention.

The present invention also relates to a computer and a communication network comprising means adapted to respectively implement the method of paying a router and the method of transmitting a data packet in accordance with the invention.

Finally, it relates to a computer program, readable by a microprocessor, comprising program instructions or portions of software code suitable for implementing the method of paying a router and / or transmitting a data packet. according to the invention.

Other features and advantages of the invention will appear in the description below.

In the accompanying drawings, given by way of nonlimiting examples

<Desc / Clms Page number 6>

 - Figure 1 is a diagram illustrating a communication network adapted to cover the invention; - Figure 2 schematically illustrates a data packet transmitted in accordance with the transmission method according to the invention; - Figure 3 is a block diagram illustrating a transmission device according to the invention; - Figures 4, 5 and 6 are algorithms illustrating the transmission method according to the invention; - Figure 7 is a block diagram of a router adapted to cover the compensation method according to the invention; - Figures 8, 9 and 10 are algorithms illustrating the method of remuneration of a router according to the invention; and - Figure 11 is a block diagram illustrating a computer adapted to cover the invention.

FIG. 1 illustrates a communication network of the TCP / IP type (acronym for English Transmission Control Protocol / Internet Protocol) adapted to cover the invention.

This network can be the Internet or a local network. Typically, a client station 1 can exchange data with a server station 2 via the communication network 3.

Routers RA_E are adapted to receive and transmit data over the communication network 3.

The invention could also apply to other types of network using relays (Switches), such as ATM networks (acronym for Asynchrome Transfer Mode). These relays perform substantially the same functions as routers.

In order to carry out the transmission of the data on the communication network 3, this data is divided into a set of packets of predetermined length.

For example, each packet as illustrated in FIG. 2, can have a length of 4096 bytes (or in English 4096 bytes).

<Desc / Clms Page number 7>

 Each of these packets includes a header H (in English Header) in which are stored in particular the address of the recipient, the address of the sender, the size of the data and a sequence number.

The actual information to be transmitted on the network is cut and inserted into a Data field of the packet.

We will now describe with reference to FIG. 3, a client station suitable for transmitting data packets over the communication network 3.

The user of the client station 1 uses the application 10 and the latter exchanges data with another computer on the network. To do this, it uses and controls connection means provided by an operating system.

The connection means can here be broken down into three levels - means for establishing a paid connection 20 with a server station 2; - data transmission means 30; and - means for closing the paid connection 40.

The means for establishing a paid connection 20 firstly comprise means for establishing a normal connection 21 conventionally used in TCP / IP communication networks and which it is not necessary to re-describe here.

In particular, these means for establishing a normal connection 21 make it possible to determine the path followed by the different data packets on the communication network 3 between the client station 1 and the server station 2.

Thus, with reference to FIG. 1, when the client station sends packets to the server station 2, there are two possible paths on the communication network 3 - either by the routers A, B, C and D; - either by routers A, E and D.

Generally, in an Internet type network, the packets transmitted follow the shortest path, for example via routers A, E and D.

<Desc / Clms Page number 8>

 These connection establishment means thus make it possible to know all the routers which will transfer the data packets from the client station 1 to the server station 2.

It is necessary to define the route for each connection established between two computers on the network, in a given direction, according to the configuration at a given time of the communication network. Indeed, the data packets do not necessarily follow an identical reverse path when they are transmitted in the opposite direction between two computers.

Means for obtaining 22 a connection identifier make it possible to generate a connection identifier S.

According to the invention, means 23 for acquiring the rights of way collected by each router are incorporated in the client station 1 in order to obtain the predetermined amounts of money collected by each of the routers.

Calculation and storage means 24 make it possible to know the total right of way which will have to be paid by a data packet transferred from the client station 1 to the server station 2.

In order to generate an electronic money usable on the communication network 3, the client station 1 also comprises means 25 for striking a currency and means 26 for storing this money in a table of coins 27.

The generation of this currency will be described later with reference to Figure 4.

Means 28 for sending bills of exchange make it possible to send over the network 3, to each router RA, RE and Ro used for the connection of the client station 1 and the server station 2 via the communication network, bills of exchange. The latter consist of a specific data packet comprising both the connection identifier S and a certificate of authentication of the currency generated by the client station 1.

Furthermore, the data transmission means 30 comprise segmentation means 31 allowing, conventionally in this type of

<Desc / Clms Page number 9>

 network, to split the information to be transmitted into several data packets of the type illustrated in FIG. 2.

Means of taking a right of way 32 make it possible to take from the parts table 27 the amount necessary for the routing of each data packet to its destination.

Registration means 33 also make it possible to store a global sum of money in a specific field C of each data packet.

The operation of these removal and registration means 32, 33 will be better understood with reference to the description of FIG. 5.

Means for sending each data packet 34 conventionally make it possible to send a data packet over the communication network 3.

The means for closing the paying connection 40 comprise connection closing means 41 conventionally used in communication networks.

Generally, a data packet called end packet is sent on the communication network in order to signal the end of this connection.

In addition, destruction means 42 make it possible to remove from the table of parts 27, the parts remaining at the end of the connection.

It is important to note that the parts generated and stored in the parts table 27 are specific to the connection established. Thus, if the client station establishes two different connections with the same server station 2, two separate sets of money will be generated on the client station 1.

We will now describe with reference to Figures 4 to 6, the transmission method according to the invention implemented by the client station 1 described above.

First of all, with reference to FIG. 4, the client station 1 opens a paying connection on the communication network 3.

A step E101 of establishing a normal connection is first of all conventionally covered on the communication network of the TCP / IP type.

<Desc / Clms Page number 10>

 During this step of establishing a connection E101, a set of routers is determined allowing the transfer of information between the client station 1 and the destination server station 2.

An obtaining step E102 makes it possible to obtain a connection identifier S valid for the entire session in progress.

Then, in accordance with the invention, an acquisition step E103 makes it possible to know the predetermined amounts of money received by each of the routers determined in the step of establishing the connection E101.

These predetermined amounts collected by each router, also called rights of way, can be different from one router to another or identical.

In practice, since the client station 1 does not know the identity of the routers on the path followed by each packet in the communication network 3, it is possible to use a known procedure consisting in sending different packets having the different TTL (Time To Live) lifetimes.

Thus, a first packet with a lifetime equal to 1 is sent, then a second packet with a lifetime equal to 2, etc., until a packet reaches the server station 2.

It is thus possible to obtain information on each intermediate router of the connection S, and in particular its address and the right of way perceived.

As soon as the addresses on the computer network of each router are known to the client station 1, the latter can directly contact these routers to find out the amount of the right of way collected by each.

A calculation and storage step E104 makes it possible to calculate the total right of way D necessary for routing a data packet from the client station 1 to the server station 2.

This total right of way D corresponds to the sum of the different rights of way acquired previously.

<Desc / Clms Page number 11>

 It is then necessary to generate an electronic money on the client station 1 making it possible to create a series of coins which can be spent on the communication network 3, and in particular taken by each router.

We use as an example, to generate this electronic money, a Pay Word system proposed by Rivest and Shamir.

A description of this system can be found at http://theory.lcs.mit.edu/-rivest/RivestShamir-mpay.ps.

This system generally consists, from a random number Wn, of generating a sequence of numbers using a hash function (in English Hash function).

This PayWord system has the advantage of being reliable and of not requiring the approval of a third party (bank, notary, etc.) to validate each individual payment.

In practice, the client station 1 draws a random number in a random drawing step E105. Let be the random number Wn.

Then, in a coin striking step E106, recursively, a known hash function such as W, -, - h (Wn) is applied. This hash function has the particularity of not being reversible so that it is impossible, from a number Wn - to find the previous number Wn.

We thus obtain a series of parts Wn, Wn-1, ... W2, W1, Wo. The end Wo of the chain of numbers thus obtained is called the root coin (in English Root Coin) and makes it possible to verify the authenticity of the different coins.

This PayWord system advantageously makes it possible to verify the authenticity of the coins by simple application of the hash function.

When generating such electronic money, it is necessary for the client station 1 to obtain a certificate from a bank in order to prove its identity to the subsequent sellers.

Two certificates are used

<Desc / Clms Page number 12>

 - a bank certificate C (Pke), issued by a bank in response to a request from the client station; and - a bill of exchange C (Wo) generated directly by the client station.

The bank certificate C (PKe) is an assurance for each seller that the bank will honor any request for redemption of authentic documents. The bill of exchange C (Wo) is an assurance for each seller that the documents produced by the client station are authentic and will be honored by the bank.

In practice, the client station sends to a banking organization the number of its credit card as well as its public key Pke.

The banking organization returns a bank certificate C (PKe) which contains the identity of the banking organization, the identity of the client station and the public key of the client station PKe. This certificate also includes an electronic signature authenticating the information it contains, this signature being produced by the bank using its private key SKb.

Once the various parts Wo, Wj, ..., Wn have been generated, these parts are stored in the parts table 27 as illustrated in FIG. 3 in association with the connection identifier S, the right-of-way value total D (calculated in step E104) and an index i, initialized to the value 0, corresponding to the index of the last part used in the table of parts 27.

In addition, from the bank certificate C (PKe) obtained from the bank, the client station 1 generates certificates or bills of exchange intended for each of the intermediate routers used during the connection S.

Each bill of exchange contains the bank certificate C (PKe) previously received, the identity of the router for which it is intended, as well as the root coin Wo. This bill of exchange also includes an electronic signature authenticating the information it contains, this signature being produced by the client station using its private key SK, ..

<Desc / Clms Page number 13>

 After this step of creating E108 bills of exchange, these are sent in a step of sending E109 to each of the intermediate routers.

Thus, only the routers determined for the connection S established between the client station 1 and the server station 2 will be authorized to charge a right of way on the data packets transmitted during this connection S.

In addition, bills of exchange are specific to each intermediate router of connection S, although it is possible to send the same bill of exchange to each router if the banking organization managing electronic money allows it.

Ultimately, each router receives the following information via the certificate C (PKe): the identity of the banking organization, the client station, the public key of the client station PKe, and the root piece Wo.

Recall that the public key of the PKe client station is contained in the certificate of bank C (PKe). The authenticity of this key can therefore be established by comparing the value obtained by decoding the signature of this certificate using the public key of the bank PKb, with the initial information contained in this certificate (signature excluded).

In addition, it is recalled that the document Wo is contained in the bill of exchange of the client station C (Wo). The authenticity of this document can therefore be established by comparing the value obtained by decoding the signature of the certificate using the PKe public key previously authenticated, with the initial information contained in this certificate (signature excluded).

Thus, by playing a double signature, each router is able to verify that it is indeed in possession of a root coin Wo issued by a customer, known to the bank, and authorized by the latter to issue coins. electronic money.

Once this chargeable connection has been established, the client station 1 can transmit one or more data packets in accordance with the procedure illustrated in FIG. 5.

A reading step E201 makes it possible first of all to read in the room table 27 the total right of passage D necessary to establish the connection S.

<Desc / Clms Page number 14>

 This total right of way D corresponds to the total sum of money which it is necessary to store at least in each data packet to allow its transfer over the communication network during connection S.

A second reading step E202 makes it possible to know the value of the index i of the last part used in the part chain stored in table 27.

A storage step E203 then makes it possible to register in the specific field C of each data packet to be transmitted a global sum of money greater than or equal to the total right of way D.

It is possible to store for example in this specific field C a series of parts W; +1, ..., W; + p.

Each of these pieces will then be deduced from the specific field C of the data packet during its routing by each router of the communication network.

However, in order to limit the place occupied by electronic money in each of the data packets, it is advantageous to store only the last coin read W; + p and its index i + D in the coin chain.

The generated parts each have a length for example of 32 bytes. The index can be coded on 16 bits which allows to generate 2'6 coins. The electronic money used here therefore occupies little space in each data packet.

As will be better described in the description of the method for remunerating each of the routers, this information is sufficient to allow each of the routers during connection S to take a part from the global sum.

A storage step E204 makes it possible to store in the parts table 27 the new index i + D corresponding to the last part read.

It is easily understood that, during the transmission of the next data packet, the storage step E203 makes it possible to register in the

<Desc / Clms Page number 15>

 specific field C of the data packet according to the value W; + 2p associated with the value of the index i + 2D.

The parts being generated and memorized at the opening of the connection, their insertion in each data packet can be carried out very quickly, without creating a real delay on the sending of the packets.

Once a sum of money has been stored in each data packet, a sending step E205 makes it possible to transmit each data packet in a conventional manner over the communication network 2.

As illustrated in FIG. 6, at the end of the paid connection S, an end step E301 makes it possible to terminate the connection S.

Typically, in a TCP / IP type network, a final data packet is transmitted on the communication network 3 in order to inform each of the routers of connection S of the end of this connection.

A deletion step E302 makes it possible to delete from the parts table 27 all of the remaining parts Wo, ..., Wn associated with the connection S.

It is in fact advantageous, during the generation of the different parts, to create a large number of parts making it possible to transmit a large number of data packets, even if it means removing the remaining unused parts at the end of the connection.

We will now describe, with reference to FIG. 7, a router R adapted to implement the remuneration method according to the invention. This router R makes it possible to transmit data packets between an incoming network link 3a to an outgoing network link 3b which is itself connected to another router or directly to the server station 2.

Conventionally, this router comprises means for receiving a data packet 51 and means 63 for transmitting a data packet.

It also includes means 52 for updating a table of received packets 53, making it possible to store all the packets received by the router R during a connection S.

<Desc / Clms Page number 16>

 In order to validate and store the bills of exchange as described above, sent by the client station 1 during the sending step E109, it comprises validation means 54, and updating means 55 of a table bills of exchange 56.

The operation of these different validation and updating means 54, 55 will be described later with reference to FIG. 8.

Furthermore, for the processing of a normal data packet and the remuneration of the router R, the latter comprises means 57 for reading a global sum stored in the data packet.

In order to verify the authenticity of the electronic money present in each of the data packets, the router R comprises means 58 for reading the connection identifier S and validation means 59, cooperating with the table of bills of exchange 56 The router R also comprises withdrawal means 60 of a predetermined amount in each of the data packets and an electronic purse 61 adapted to store the right of way thus withdrawn.

Writing means 62 make it possible to write in the data packet, before its transmission over the network, the total remaining amount, that is to say the total amount of money included in the packet when it enters the router less the right of way perceived.

We will now describe, during the initialization of the paid connection between the client station 1 and the server station 2, the procedure used by each router located on the path of this connection S to process the packets of bills of exchange issued by client station 1.

An obtaining step E401 allows each router R to obtain from a certification body the public key of the bank PKb corresponding to the signature procedure used by the bank.

As described above, a verification step E402 of the bank certificate C (PKe) can be implemented from the public bank key PKb in order to verify the signature.

At the end of a test step E403, if this signature is invalid, the paid connection procedure is interrupted.

<Desc / Clms Page number 17>

 Otherwise, a reading step E404 is implemented in order to read the public key of the client station PKe. This public key PKe makes it possible to verify in a step E405 the signature of the bill of exchange C (Wo) received by the router.

At the end of a test step E406, if this signature is invalid, the paid connection procedure is interrupted.

Otherwise, a reading step E407 is implemented in order to read the connection identifier S.

A storage step E408 then makes it possible to store the bill of exchange in table 56 of the router R.

In practice, each connection identifier S is stored in association with the certificate of authenticity or bill of exchange C (Wo), and more precisely with the value of the root coin Wo.

The paying connection thus established, we will describe with reference to FIG. 9, the procedure for processing a normal data packet transmitted by the router R over the communication network.

A reception step E501 makes it possible to receive the data packet in the router R.

A reading step E502 is implemented in order to obtain the connection identifier S.

Then a second reading step E503 is then implemented in order to obtain an identifier of the packet P thus received.

A packet identifier can be constituted for example by the sequence number stored in the header H of each data packet. This value of the packet identifier P is added and stored in the table of packets received 53 from the router R. During this addition step E504, it is checked in a test step E505 if the current data packet has already been transmitted or not.

In practice, the packet identifier read in the reading step E503 is compared with the packet identifiers already stored in the table of received packets 53.

<Desc / Clms Page number 18>

 If so, that is to say when the current data packet has already been transmitted by the router R during the same connection S, the packet is transmitted in the transmission step E513 directly on the communication network 3, without levying a right of way.

Such a possibility can arise when, for example, the data packet must be retransmitted by a router of the communication network 3 due to the failure of one of the routers.

With reference to FIG. 1, if the router RE is faulty, the packets transmitted by the previous router RA will again be transmitted by this same router RA to the router RB in order to reach the server station 2 by another path of the communication network .

It is necessary, in such a case, not to rebill the transmission of the data packet by the router RA.

Alternatively, the test of step E505 can be carried out on the basis of the information stored in the header H of each data packet.

If at the end of the test step E505, the data packet has not already been transmitted by the router R, a test step E506 makes it possible to check whether there is a bill of exchange in the table of letters of change 56, corresponding to the current connection S. If not, the data packet is rejected and its transmission over the network is interrupted.

Otherwise, a test step E507 then makes it possible to verify that the data packet indeed contains in a specific field C a global sum of money stored to remunerate the router R.

If not, the packet processing procedure is also terminated.

If so, a reading step E508 is implemented in order to read the memorized amount corresponding here to a piece W; and its index i in the chain of parts generated at the client station 1.

From reading the bill of exchange in table 56, the value of the root coin Wo can be obtained in a reading step E509.

A validation step E510 then makes it possible to verify the authenticity of the piece W ;.

<Desc / Clms Page number 19>

 In practice, we apply to this current part W; the hash function h recursively, and here i times h (h (... h (W;))) The value thus obtained is compared with the value of the root piece Wo.

We can also, to speed up this validation procedure, apply, recursively, i - j times the hash function h, that is to say a number of times just sufficient to find a part Wj, index j lower than the current index i, and already picked up by the router for the transfer of a previous data packet.

If the value obtained is different, the processing of the data packet is interrupted.

On the other hand, if the value obtained is equal to the value of the root coin Wo, a storage step E511 makes it possible to write in the specific field C of the data packet, the total sum of remaining money equal to h (W;) = W; _ 1 associated with the following index i - 1.

In this example, we consider that each router R charges a right of way corresponding to a part W; stored in the data packet.

The value of each piece W; must be defined in advance and can, for example, be 0.01 cents.

Of course, each router could take one or more coins, the amount of money remaining corresponding to the amount of initial money minus the number of coins taken by each router R.

The removed part W is stored in an adding step E512; associated with its index i in the electronic purse 61 of the router R.

The data packet thus processed can then be transmitted in a conventional transmission step E513.

At the end of the paid connection, and as illustrated in FIG. 10, when the router R receives a data packet signifying the end of the connection S, a read step E501 makes it possible to identify the connection S and a delete step E602 is under cover to remove

<Desc / Clms Page number 20>

 bill of exchange table 56 the bill of exchange corresponding to connection S.

The table of received packets 53 is also regularly updated by deleting the data stored in this table 53 at the end of each connection.

In addition, since certain connections can be abnormally interrupted, the table of received packets 53 and the table of bills of exchange 56 are erased periodically to delete the outdated information.

After each connection, or on a daily basis, each router R can retransmit the values W to the banking organization; associated with each index i and stored in the electronic purse 61 in order to recover the monetary value.

All of the means described above forming the transmission device of FIG. 3 and the remuneration device incorporated in a router R as illustrated in FIG. 7, are incorporated in a computer as illustrated in FIG. 11.

This computer conventionally comprises a microprocessor 70, a read only memory (ROM) memorizing either the method of transmitting a data packet or the method of paying a router, and a random access memory 72 (Ramdom Access Memory or RAM) with different registers for the implementation of these processes.

The computer notably includes a communication interface 79 which can be connected to the communication network 3 to receive or transfer data packets.

In addition, the computer includes document storage means, such as a hard disk 76, which is adapted to cooperate by means of a disk drive 77 with removable storage means 78 such as floppy disks, disks compacts or computer cards (PC-Card).

These fixed or removable storage means may include the code of the transmission and / or remuneration method of a conforming router.

<Desc / Clms Page number 21>

 to the invention, which, once read by the microprocessor 70, will be stored in the hard disk 76.

As a variant, the program allowing a device to cover the invention may be stored in the read-only memory 71.

In a second variant, the program can be received to be stored as described above via the communication network 3. Conventionally, the computer also has a screen 73 allowing for example to serve as an interface with an operator at the using a keyboard 74 or a mouse 75 or any other means.

The central unit 70 (CPU) will execute the instructions relating to the covering of the invention. During power-up, the programs and methods relating to the invention stored in a non-volatile memory, for example read only memory 71, are transferred to the random access memory 72 which will then contain the executable code of the invention as well as the variables necessary for implementing the invention.

Thus, the random access memory 72 of a computer as illustrated in FIG. 11, incorporating the data packet transmission device, will contain registers for storing in particular the table of parts 27, the connection identifier S and the right of total passage D.

Likewise, the random access memory 72 incorporated in a router R of the communication network will include registers for storing the table of received packets 53, the table of bills of exchange 56, and an electronic purse 61.

A communication bus 80 allows communication between the different sub-elements of the computer or linked to itself. The representation of the bus is not limiting and in particular the microprocessor 70 is capable of communicating instructions to any sub-element directly or via another sub-element.

Thanks to the invention, a remuneration system for routers in a communication network is obtained, making it possible to bill these routers according to actual traffic on the communication network.

<Desc / Clms Page number 22>

 Billing is carried out in the network itself, each data packet including enough money to cross the communication network to its destination.

Of course, many modifications could be made to the embodiment described above without departing from the scope of the invention.

In particular, the PayWord system is only one example among others of electronic money which can be generated on the client station 1 and then spent on each router R of a communication network 3.

<Desc / Clms Page number 23>

Claims (23)

1. Method for compensating a router of a communication network (3) adapted to receive and transmit data packets on the communication network (3), characterized in that it comprises the following steps - reception (E501 ) a data packet; - direct debit (E508-E512) of a predetermined amount (W ;, i) from a global sum of money stored in the data packet; and - transmission (E513) of the data packet on the communication network (3). 2. Method for remunerating a router according to claim 1, characterized in that the debiting step comprises the following sub-steps - reading (E508) of an initial global sum of money stored in said data packet; - subtraction (E511) of a predetermined amount (W ;, i) from the initial total sum of money; - storage (E512) of said predetermined amount (W ;, i) in an electronic purse (61) of the router (R); and - replacement (E511) of the initial total sum by the remaining global sum after subtracting the predetermined amount. 3. Method for compensating a router according to one of claims 1 or 2, characterized in that it further comprises the following steps - verification (E505) for the data packet received if this data packet has already has been transmitted by said router (R); and - in the affirmative, transmission (E513) of the data packet without withdrawal of said predetermined amount. 4. Method for remunerating a router according to claim 3, characterized in that it comprises a storage step (E504) in <Desc / Clms Page number 24>  a packet table (53) of an identifier (P) associated with each data packet transmitted by the router (R). 5. Method for remunerating a router according to one of claims 1 to 4, characterized in that it comprises a prior storage step (E405), for each connection (S) established between the router (R) and a client station (1), an authentication certificate (C (Wo)) of the currency stored in data packets issued by said client station (1), and in that it comprises a validation step ( E509-510) of the predetermined amount (W ;, i) of money to be withdrawn from the data packet. 6. Method for transmitting a data packet from a client station (1) and destined for a server station (2) via paid routers (R) of a communication network (3), characterized in that it comprises a step of memorizing (E203) in a specific field (C) a data packet of a global sum of money (W; + p, i + D), the routers (R) of the communication network (3) being adapted to withdraw a predetermined amount (W ;, i) from said global sum of money. 7. A method of transmitting a data packet according to claim 6, characterized in that it comprises the following steps - determination (E101) of a set of routers (R) adapted to establish a connection (S) between the client station (1) and the server station (2); - Acquisition (E103) of the predetermined amounts of money received respectively by the routers (R) of said set of routers (R); and - storage (E203) in a specific field (C) of said data packet of a global sum of money (W; + p, i + D) greater than or equal to the sum (D) of said predetermined amounts received by the routers (R). 8. A transmission method according to one of claims 6 or 7, characterized in that it further comprises the following steps - generation (E102) of a connection identifier (S); and - sending (E109) of said identifier (S) for connection to the routers (R) of said set of routers. <Desc / Clms Page number 25>  9. Device for compensating a router of a communication network (3) adapted to receive and transmit data packets on the communication network (3), characterized in that it comprises - reception means (51 ) a data packet; - withdrawal means (60) of a predetermined amount (W ;, i) from a global sum of money stored in the data packet; and - means for transmitting (63) the data packet on the communication network (3). 10. Remuneration device according to claim 9, characterized in that the withdrawal means comprise - reading means (57) of an initial total sum of money stored in the data packet; - means for subtracting (60) a predetermined amount (W ;, i) from the initial total sum of money; - means for storing (60) said predetermined amount (W ;, i) in an electronic purse (61) of the router (R); and - means for replacing (62) the initial lump sum by the lump sum remaining after subtracting the predetermined amount. 11. A device for compensating a router according to one of claims 9 or 10, characterized in that it further comprises - verification means (59) for the data packet received if this data packet has already transmitted by said router (R). 12. A device for compensating a router according to claim 11, characterized in that it comprises storage means (52) in a packet table (53) of an identifier (P) associated with each data packet transmitted by the router (R). 13. A device for compensating a router according to one of claims 9 to 12, characterized in that it comprises storage means (56), for each connection (S) established between the router (R) and a client station (1), an authentication certificate (C (wo)) of the currency stored in data packets issued by said client station (1), and <Desc / Clms Page number 26>  means of validation (58, 59) of the predetermined amount (W ;, i) of money to be taken from the data packet. 14. A device for compensating a router according to one of claims 9 to 13, characterized in that it is incorporated in - a microprocessor (70); - a read only memory (71) adapted to store a remuneration program for a router; and - a random access memory (72) comprising registers adapted to store variables modified during the execution of said program. 15. Device for transmitting a data packet from a client station (1) and destined for a server station (2) via paid routers (R) of a communication network (3), characterized in that it comprises means for storing (32, 33) in a specific field (C) a data packet of a global sum of money (W; + o, i + D), the routers (R ) of the communication network (3) being adapted to withdraw a predetermined amount (W ;, i) from said global sum of money. 16. Device for transmitting a data packet according to claim 15, characterized in that it comprises - means for determining (21) a set of routers (R) adapted to establish a connection (S) between the client station (1) and the server station (2); - Means of acquisition (23) of the predetermined amounts of money received respectively by the routers (R) of said set of routers (R); and - storage means (32, 33) in a specific field (C) of said data packet of a global sum of money (W; + p, i + D) greater than or equal to the sum (D) of said amounts predetermined perceived by routers (R). 17. Transmission device according to one of claims 15 or 16, characterized in that it further comprises - means for generating (22) a connection identifier (S); and <Desc / Clms Page number 27>  - means for sending (28) said identifier (S) for connection to the routers (R) of said set of routers. 18. Transmission device according to one of claims 15 to 17, characterized in that it is incorporated in - a microprocessor (70), - a read only memory (71) adapted to store a program for transmitting a packet of data ; and - a random access memory (72) comprising registers adapted to store the variables modified during the execution of said program. 19. Communication network router, characterized in that it comprises means suitable for implementing the remuneration method according to one of claims 1 to 5. 20. Computer, characterized in that it comprises means suitable for implementing the method of paying a router according to one of claims 1 to 5. 21. Computer, characterized in that it comprises means suitable for implementing the method for transmitting a data packet according to one of claims 6 to 8. 22. Communication network, characterized in that it comprises means suitable for implementing the method of paying a router in accordance with one of claims 1 to 5. 23. Communication network, characterized in that it comprises means suitable for implementing the transmission method according to one of claims 6 to 8.