METHOD AND DEVICE FOR ROUTING DATA PACKETS IN COMMUNICATION NETWORKS

Abstract: A method and a device for optimizing the routing of data packets, in which method data packets are received, data flow is detected on the received data packets, a feedback request is transmitted in response to the detected data flow, feedback information is received, feedback information is generated and added to the received feedback information, feedback information is transmitted and the data packets belonging to the data flow are directed on the basis of said feedback information.

Description: METHOD AND DEVICE FOR ROUTING DATA PACKETS IN COMMUNICATION NETWORKS The present invention relates to a method and a device for routing data packets in communication networks. BACKGROUND OF THE INVENTION The Internet Protocol (IP) has enabled connectionless datagram service in a worldwide information network, the Internet. By means of said protocol the network is able to route messages to a correct destination address. Routing is performed on the basis of an IP network address and routing tables. The IP protocol is connectionless and does not provide reliable transfer which is assigned to other transmission protocols, such as Transmission Control Protocol (TCP). Each terminal connected to the World Wide Web has a specific IP address. Traffic of IP data packets in the telecommunication networks based on the Internet Protocol continues to grow. As a result of the growth, the communication networks continue to expand and the size of the network may become too large. The expanding network causes problems that appear as reducing data transmission rate and unreliable delivery of transmitted data. Typically, the growth has been restricted by dividing an excessively large network into smaller sections, i.e. subnetworks, and reconnecting said subnetworks to one another. To achieve this, a bridge is used between the networks, and simultaneously said bridge serves as a router for data flow. There is a slight difference, however, between a bridge and a router. The bridge is a data link layer operation and interconnects two networks of the same type by using physical addresses. The routing is a network layer operation which interconnects two or more networks of different types by using IP addresses. In addition to convey traffic between local area networks, the task of the router is also, in general, to serve as a gateway means between a local and an external router network. Data flow consists of data packet sequences that are treated in an equal manner by routers between the source and destination addresses. A prac- tical example of data flow transmission is, for instance, transmission of a data file over the network between two different computers. Data transmission is implemented by the Transmission Control Protocol (TCP), which divides the file into IP packets and sends them one at a time to the network. The packets pass via a plurality of routers and each router performs routing operations on each packet separately. The routers forward the packets to a next router without ever knowing whether the packet concerned reached its destination or not. Currently, more and more information is transmitted on the Internet, particularly in the form of Internet calls and video data. In the near future, there will be a need for routers that are capable of transmitting a continuously increasing amount of information from a source address to a destination address as quickly and reliably as possible. One suggested solution to the problem is, for instance, to deconcentrate the router decision making between several processors. However, this will not solve the problem that each IP packet has to be routed individually. Another solution is to use IP switching which comprises a router and an ATM switch. An IP switch is able to route data packets in the same manner as ordinary routers but it differs therefrom in that it is able to perform data flow identification and switch the packets belonging to a given flow to pass via an ATM connection. The IP switch always requires other IP switches for being able to switch ATM connections, and in addition, the network must comprise a considerable number of IP switches in order for them to be actually useful. The identification and control of the flow are performed on the basis of the IP address of the sender or the receiver, for instance, whereby all packets belonging to the identified flow are directed via a given route to the address of the receiver. In router networks the routers form nodes through which data packet transmission takes place. The data packets are conveyed through a router in two different ways. If a router receives a packet addressed to a next router, i.e. to a second router having a direct connection to said router, it allows the packet through without interfering with the routing thereof in any way. If a router receives a packet addressed to a receiver that has no direct connection to said router, the router has to solve the routing problem so as to define to which router the packet should be sent next in order for the packet to be sent to a correct address. The routers transmit datagrams towards a destination by using routing tables which are maintained by means of specific routing protocols. The routers exchange data on possible routes by means of the routing protocol and at the same time the routers are informed of the routing topology of the network. The topology in- formation is collected in a routing table which contains information on possible destination addresses and how to reach them. The contents of the table depend on the routing algorithm used. In general, the routes are predetermined, and consequently each router knows in advance the next default router whereto the received packet will be transmitted. The predetermined routing leads all traffic, large and small packets alike, to pass along the same route in the network. This results in that certain routes are congested, whereas other routes have less traffic than their capacity allows. Figure 1 shows, by way of example, a typical network structure which comprises a sender 1 , routers 2 to 6 and a receiver 7. Between the starting point and the destination there are generally a plurality of routers as appears in Figure 1 , and consequently data packets have a plurality of alternative routes from the sender 1 to the receiver 7. The router 2 can route the packet addressed to the destination 7 either via the router 3 or the router 5. The data packet routing se- lection is carried out in the router 2 on the basis of a routing table and a routing algorithm. For data transmission, the routing algorithm finds a route in the routing table, via which route it is possible to proceed in the network from the source address to the destination address. The routers form a default route between the sender 1 and the receiver 7, which consists of default routes between each router. Let us assume that said default route passes from the sender 1 via the router 2 to the router 5, and further, via the routers 6 and 4 to the receiver 7. If the formed default route does not work any longer at any one router because of increased traffic or some such reason, said router may make a change in the route and forward the data packets to another router. This change made on a local level by an individual router may affect other routers such that the traffic increases excessively for some routers while others operate at a lower than maximum capacity. This results in that the network is not routed optimally as a whole but each router tends to change its own routing to a more optimal direction seen from its own viewpoint. Thus, the network routing is not optimized on a more global level, which results in uneven loading in different sections of the network as the data traffic passes only on certain routes. SUMMARY OF THE INVENTION A method and a device for optimizing the routing of data packets in communication networks have now been invented. The object of the invention is to provide a dynamic feedback mecha- nism between routers to optimize routing of a given data flow through a network from a sender to a receiver. Feedback can be given such that each next router provides feedback information by replying to a request of a preceding router. As a result, the feedback produces information on the routes that fulfill the requirements set for routing. In the method of the invention, each router can start sending a rever- tive feedback request independently of other routers. The first router having a direct connection to a data flow sender detects a data flow for a particular destination and starts sending a revertive feedback request to all the routers that may form a route to said destination. All the routers that receive the feedback request message forward it to subsequent routers. Upon receiving the feedback request the last router having a direct connection to said destination generates feedback information and sends it back via the same route(s) as the request was received. The feedback may contain, for instance, information on how reliably or at what rate each router has conveyed packets. The feedback information thus passes along the same route(s) to the preceding routers which, in turn, add corresponding data of their own to the feedback concerned. The first router now receives feedback information on all possible routes that lead to said destination. The first router can now make its own decision on route selection on the basis of data about the reliability and speed of different routes and the applicability of the flow concerned to each route. The first router can also make feedback-based amendments in its routing table as regards the data flow concerned, which amendments allow the router to send all the packets belonging to the same flow via the same, optimized route in the future. By this, optimized routing is achieved for all the routes in the network, whereby large packets can be directed to other routes than small ones, for instance, and packets belonging to an IP call, for instance, can be directed to quicker routes than packets that do not require high transmission rate. A first aspect according to the invention implements a method for routing data packets in a communication network comprising routers, in which method data packets from a source address are received in a first router, the data packets are routed from the first router to at least one next router, characterized in that a destination address is identified on the data packets in the first router, a feedback request is transmitted to said at least one next router in the direction of the destination address in order to find out the quality of connection between at least said first and said at least one next router, in response to the request information about the quality of at least said connection is transmitted from said at least one next router to said first router, routing decision is made in said first router on the basis of said received quality of connection data. A second aspect according to the invention implements a system for routing data packets in a communication network, the system comprising at least a first router for receiving data packets from a source address and for routing further to at least one second router, said at least one second router being ar- ranged to receive data packets and transmit them to a destination address, the first and at least one second router comprising routing means for routing the data packets, characterized in that the first router also comprises at least detecting means for detecting header data on the received packets, feedback request generating means for generating a quality of connection feedback request, feedback request transmitting means for transmitting the feedback request to said at least one second router in order to find out the quality of connection between at least said first router that sent the request and said at least one second router, and that said at least one second router also comprises at least feedback request receiving means for receiving the feedback request from said first router, feed- back information generating means for generating feedback information in response to the received feedback request, feedback information transmitting means for transmitting the feedback information to said first router, and that said first router further comprises feedback information receiving means for receiving the feedback information from said at least one second router, and means for making routing decision on the basis of the received feedback information. A third aspect according to the invention implements a routing device for routing data packets in a communication network, the routing device comprising receiving means for receiving the data packets, transmitting means for transmitting the data packets, routing means for routing the data packets, characterized in that the routing device also comprises at least detecting means for detecting header data on the received data packets, feedback request generating means for generating a feedback request for the quality of connection, feedback request transmitting means for transmitting the feedback request to at least one next routing device in the direction of the destination address, feedback request receiving means for receiving the feedback request from at least one preceding routing device in the direction of the source address, feedback information generating means for generating the feedback information in response to the re- ceived feedback request, feedback information transmitting means for transmitting the feedback information to at least one preceding routing device in the direction of the source address, feedback information receiving means for receiving the feedback information from at least one preceding routing device in the direction of the destination address, feedback information adding means for adding the generated feedback information to the received feedback information, means for making a routing decision on the basis of the received feedback information. A fourth aspect according to the invention implements a computer program product for routing data packets in a communication network, the com- puter program product comprising computer program means for receiving the data packets at the router, computer program means for routing the data packets onwards from the router, characterized in that said computer program product also comprises computer program means for detecting header data on the received data packets, computer program means for transmitting a feedback re- quest to at least one next router in the direction of the destination address, computer program means for receiving the feedback request from at least one preceding router in the direction of the source address, computer program means for generating the feedback request for at least one connection quality parameter, computer program means for receiving the feedback information from at least one preceding router in the direction of the destination address, computer program means for generating the feedback information on the basis of the received feedback request, computer program means for adding the generated feedback to the received feedback information, computer program means for transmitting the feedback information to at least one preceding router in the direction of the source address, computer program means for making a routing decision on the basis of the received feedback information. In the invention, the routers detect the data flow, generate and trans- mit the feedback request in response to the detected data flow, receive the feedback request, generate and transmit the feedback information and add the generated feedback information of their own to the received feedback information. On the basis of the feedback information each router is able to optimize routing independently for their own part. Routing optimization is not performed packet- specifically but based on a particular data flow, and packets belonging thereto can always be transmitted via the same, once optimized route. In the following, the invention will be described in greater detail, with reference to the attached drawings, in which Figure 1 illustrates a typical description of a network; Figure 2 illustrates a general block diagram of one operational environment according to the invention; Figure 3 illustrates a block diagram of a routing device according to the invention; Figure 4a illustrates a block diagram showing operation of a first router of the method of the invention; Figure 4b illustrates a block diagram showing operation of a router between the first router and the last router of the method of the invention; Figure 4c illustrates a block diagram showing operation of the last router of the method of the invention. Prior art was described above with reference to Figure 1. In the following the invention will be mainly described with reference to Figures 2 to 4. Figure 2 illustrates a general block diagram of one operational environment of the invention. The router 201 is the first router of a host 207 which detects and routes data packets 210 sent by the host 207, identifies the data packets as a data flow, generates and transmits a feedback request 200 and receives feedback information 209 and makes a routing decision on the basis of the feedback information. The router 201 is also the host's 207 last router which conveys the data packets addressed to said host. The routers 202, 204 and 205 serve as intermediate routers receiving and transmitting feedback requests, receiving feedback information, generating feedback information of their own and adding it to the received feedback information to be forwarded and transmitting the feedback information back via the same route as the feedback request ar- rived. The routers 203 and 206 are the last routers of the host 208 which reply to arriving feedback requests by generating feedback information of their own and by transmitting it via the same route the feedback request arrived to them. The routers 203 and 206 can also be treated as the host's 208 first routers when the host 208 transmits data packets. The first router 201 receives data packets 210 from the host 207 and identifies the packets as a data flow destined for the host 208. In addition to detection of source and destination addresses the characteristics of the data flow are detected at the same time. The detection of the data flow characteristics allows to distinguish between data flows of different media types with the same source and destination addresses. For instance, data flows of an IP call and an image file can be directed via different routes, so that the data flow of the IP call is directed via a quicker route and the data flow of the image file via a slower route. The router 201 transmits a feedback request 200 to next routers, i.e. to the router 202 and the router 204. The feedback request 200 may comprise e.g. the following data: ID, Q, Hip, R201ip. ID is the feedback request's individual identification number which acts as an identifier of said feedback request. In this example, Q comprises parameters representing the quality of service (QoS), such as the reliability or speed of the connection, but it may also comprise other parameters. Hip is the IP address of the data flow sender and R201ip is the IP ad- dress of the router 201. To the feedback request 200 is always added the IP address of each router in order for the transmitted request to return via the same route to the sender of the request. The routers 202 and 204 forward the feedback request 200 to the routers 203 and 206 adding their own IP addresses to the feedback request. In this example, the routers 203 and 206 are the last routers having a direct connection to the addressee. They also add their own IP addresses and generate feedback information 209 according to the request. For the router 203, the feedback information 209 could include the following: ID, Q, Hip, R201 ip, R202ip, FB_R203, where FB_R203 is the feedback information of the router 203 on the requested parameter Q. It is possible to include in the same feedback request one or more parameters, as in the case of the example, speed and reliability of said router at that instant. Corresponding data are also included in the feedback information for other routers. The feedback information 209 of the router 202 to the router 201 would include ID, Q, Hip, R201ip, FB_R202, FB_R203 comprising, in addition to the feedback of the router 203, the feedback FB_R202 of the router 202 itself. The feedback information transmitted by the last routers 203 and 206 come to the router 201 via the same route as the feedback request arrived to them. The router 201 receives the feedback information on each possible route that leads to the host 208. On the basis of the received feedback information the router 201 optimizes for the data flow in question a route between the sender 207 and the receiver 208. If the routing results from the router 202 to the router 201 fulfill the set criteria, said path between the routers 201 and 202 fulfill the conditions set for forming a route. A corresponding inspection is also performed between other routers. For instance, if the routing results returned from the router 202 to the router 201 of the path between the routers 202 and 206 do not fulfill the route forming conditions, the router 201 has to find a better route via another route, which in this case is the router 203. The router 201 may also, if possible, inform the application program about inadequate results for route forming, for instance, too low a service level. Route optimization for a given data flow can also be performed more often than only in connection with the flow identification. The optimized route can be updated at given time periods, for instance. The routers can transmit the feedback request independently, which is useful particularly in a network where loading between different sections often varies. Any one router locating on the route can generate a feedback request and transmit it to next routers, if the local operation of the network changes for some reason, for instance, due to disturbance or a sudden change in loading. Figure 3 shows a block diagram of a routing device 30 according to the invention. The device comprises a transmission and reception element 31 with inputs and outputs 40 to 43 connected thereto, which element receives data packets either directly from a sender 36 of packets or from another router 37 and transmits data packets routed by a routing means 32, on the basis of routing table 33 data, to next routers 38 or directly to a receiver 39 of packets. The routing device also comprises detecting means 34 for a data flow, a feedback request and feedback information, by which the received data packets are determined whether they belong to a particular data flow or whether they are feedback request or feedback information. Feedback request generating means 35 generate a message to other routers for returning the values of a particular parameter as feedback information. An identifier is added to the generated feedback request, so that other routers distinguish the feedback request from an ordinary data packet because they are transmitted in the same manner. In addition, the routing device comprises feedback information generating means 44, by which feedback information is generated in response to the received feedback request, and feedback information receiving means 45, by which feedback information transmitted by other routers is received, on the basis of which data a routing decision is made (reference 46). The made decision is always based on the transmitted feedback request and the received feedback information, on the basis of which decision the data packets belonging to the given data flow are routed onwards. For instance, a microprocessor 47 controls operational blocks in a centralized manner, whereby the operation of different operational blocks, such as routing of data packets in block 32, and identification of data flow in block 34, can be carried out in parallel. Figure 4a illustrates as a flow chart the operation of a first router based on the method of the invention. In the method, data packets are received from a source address (step 401) and the aim is to identify whether the received packets belong to a particular flow (step 402). The flow can be identified, for instance, in such a manner that within a given time period the router receives more than one data packets having the same source and destination addresses, also other methods applicable to flow identification can be used. If it is stated that the received packets do not belong to a particular flow, they are routed according to a general practice by using routing tables further to a next router or to the destination address depending on which one is in question (step 403). If the router detects that the received packets belong to a particular data flow, it transmits a feedback request (step 404) to at least one next router, which has either a direct connection to the destination address or a connection to routers having connection to the destination address. Next, the router receives the feedback information from all the routers to which it transmitted said feedback request (step 405). On the basis of the data, the router selects a next router for said data flow and makes a routing decision which represents the most optimal alternative at the reception moment of feedback parameters (step 406). From that time on, the router routes all the packets belonging to said flow via said route to the destination address. As a parallel process to steps 401 to 406, the received data packets are routed (steps 401 , 403) either using routing tables or using previous routing data until new routing data is available, so the data packets do not stop at the router for the duration of said steps. Any router in the network can transmit the feedback request, for instance, at given time periods or at any time in case loading, speed or other factors of a previously selected route have changed such that said route is no longer optimal for the propagating flow. Figure 4b illustrates as a flow chart the operation of a router between the first and the last routers according to the method of the invention. In the method, data packets are received (step 410) from at least one preceding router and the packets are identified (step 411). If the packets are identified as individual packets, not belonging to any particular flow (step 412) they are routed for- wards, according to a general practice, using routing tables to a next router or to the destination address depending on which one is in question (step 413). Whereas, if the router receives a feedback request (step 414) it forwards the request to next routers (step 415). The router generates feedback information according to the feedback request (step 416) and upon receiving feedback informa- tion reverting from next routers it adds feedback of its own to said feedback information (step 418) and returns the updated feedback information to the router from which the feedback request arrived (step 419). On the basis of the received feedback information, the router forms the route for packets belonging to a particular data flow to the destination address (step 420). Upon receiving and iden- tifying the packets which belong to the data flow (step 421) and to which said feedback request was directed, the router forwards the packets via the route that best fulfills the parameters of the feedback request. As a parallel process to steps 410 to 421 the received data packets are routed (steps 410, 413) either using routing tables or using previous routing data until new routing data is available, so the data packets do not stop at the router for the duration of said steps. Figure 4c illustrates as a flow chart the operation of the last router according to the method of the invention. The router according to the method re- ceives data packets (step 430) and identifies the packets (step 431) from at least one preceding router and routes the data packets to at least one destination address. If the data packets are identified as ordinary packets (step 432), they are routed, in an ordinary manner, using routing tables to the destination addresses (step 433). If a feedback request is received and identified (step 434), said router, being the last router on the route, generates feedback information according to the feedback request (step 435) by transmitting said feedback information back via the same route it arrived to said router (step 436). Upon receiving and identifying the packets which belong to the data flow and to which said feedback request was directed (step 437), the router forwards the packets to the destination address. As a parallel process to steps 430 to 437, all the received data packets are routed (steps 430, 433) either using routing tables or using previous routing data until new routing data is available, so the data packets do not stop at the router for the duration of said steps. Physically, the router can be implemented as a router comprising e.g. a system according to Figure 3, or as a computer whereby routing operation is performed by software. It is to be understood that, to act like a computer, the router needs a processor for performing commands and a memory for storing data according to the programmed functions. Correspondingly, to act as a router, the computer needs e.g. physical components so that it can be connected to the network. Feedback request generation and transmission in response to a detected data flow is not limited only to the router that is the first one seen from the direction of the sender of data packets. Each router in the network is able to act as the first router, i.e. as the generator and transmitter of the feedback request. This is advantageous, for instance, when network loading increases locally more than expected. In general however, the first router that detects data flow on the received data packets and generates said feedback request is the router to which the data packet sender transmits the packets first. In the above, the implementation and embodiments of the invention have been described by means of examples. It is obvious to a person skilled in the art that the invention is not restricted to the details of the above-described embodiments but the invention can also be implemented otherwise without deviating from the characteristics of the invention. The described embodiments should be considered illustrative, not restrictive. The implementations and applications of the invention are only restricted by the attached claims. Thus, different implementation alternatives defined by the claims, and also equivalent implementations, are within the scope of the invention.

Claims: CLAIMS 1. A method for routing data packets in a network comprising routers, the method comprising steps of transmitting data packets from a source address to a destination ad- dress, receiving the data packets transmitted from the source address in a first router (201), routing the data packets from the first router (201) to at least one next router (202), characterized by detecting header data on the received data packets in the first router (201), transmitting a feedback request from the first router (201) to said at least one next router (202) in the direction of the destination address in order to find out the quality of connection between at least said first and at least said one next router, transmitting feedback as feedback information from said at least one next router (202) to said first router (201) in response to the received feedback request, the feedback information comprising at least said connection quality data, making a routing decision in said first router (201) on the basis of said received connection quality data. 2. A method as claimed in claim 1, characterized in that said detection of data packet header data comprises at least identification of the destination address of the data packets. 3. A method as claimed in claim ^ characterized in that said detection of data packet header data also comprises at least detection of a data flow. 4. A method as claimed in claim 3, characterized in that said data flow is detected by checking whether more than one data packets with the same destination address and the same media type are received within a given time period. 5. A method as claimed in claim ^ characterized in that said feedback request is generated in response to the detected data flow. 6. A method as claimed in claim ^ characterized in that said feedback request is transmitted via all possible routes that lead to the destination address of said data flow. 7. A method as claimed in claim ^ characterized in that said feedback request is detected on the received data packet. 8. A method as claimed in claim 1, characterized in that said feedback request comprises the address data of the routers and the destination address. 9. A method as claimed in claim 8, characterized in that said feedback request also comprises data for generating a connection quality parameter at least at one next router. 10. A method as claimed in claim ^characterized in that said feedback information is received from all possible routes via which the feedback request was transmitted. 11. A method as claimed in claim ^characterized in that said feedback information is generated at each router receiving the feedback request. 12. A method as claimed in claim 11, characterized in that said feedback information generated by the router is added to the feedback information received by said router from at least one preceding router in the direction of the destination address. 13. A method as claimed in claim ^characterized in that said feedback information is transmitted back via the same route as the feedback re- quest arrived. 14. A method as claimed in claim 13, characterized in that said feedback information comprises addresses of routers located on the route. 15. A method as claimed in claim 13, characterized in that said feedback information also comprises at least one connection quality pa- rameter. 16. A method as claimed in claim 1, characterized in that said routing decision is made for routing the data packets belonging to a particular data flow from the source address to the destination address. 17. A system for routing data packets in a communication network, the system comprising at least a first router for receiving data packets from a source address and for routing them forward to at least one second router, said at least one second router being arranged to receive the data packets and transmit them to a destination address, the first and at least one second router comprising routing means (32) for routing data packets, c h a r a c t e r i z e d in that the first router also comprises at least detecting means (34) for detecting header data on the received data packets, feedback request generating means (35) for generating a connection quality feedback request, feedback request transmitting means (31) for transmitting the feedback request to said at least one second router in order to find out the quality of connection between said first router and said at least one second router, and that said at least one second router also comprises at least feedback request receiving means (31 , 34) for receiving the feedback request from said first router, feedback information generating means (44) for generating feedback information in response to the received feedback request, feedback information transmitting means (31) for transmitting the feedback information to said first router, and that said first router further comprises feedback information receiving means (31) for receiving the feedback information from at least one second router, means (46) for making a routing decision on the basis of the received feedback information. 18. A system as claimed in claim 17, c h a r a c t e r i z e d in that said detecting means comprise at least destination address detecting means for detecting the destination address on the header data of the received data packet. 19. A system as claimed in claim 18, c h a r a c t e r i z e d in that said detecting means are also arranged to detect data flow on the received data packets, which data flow is detected when more than one data packets with the same destination address and the same media type are received within a given time period. 20. A system as claimed in claim 17, characterized in that said feedback request generating means are implemented to generate a request for a given parameter value to be transmitted to said at least one second router in the direction of the destination address. 21. A system as claimed in claim 17, characterized in that said feedback request generating means are implemented to transmit the feedback request as a data packet. 22. A system as claimed in claim 17, characterized in that said feedback request receiving means are implemented to identify the feedback request on the received data packets. 23. A system as claimed in claim 17, characterized in that said feedback information generating means are implemented to generate a value of at least one desired connection quality parameter received in the feedback request. 24. A system as claimed in claim 17, characterized in that said feedback information transmitting means are implemented to transmit the feedback information back via the same route as the feedback request was received. 25. A system as claimed in claim 17, characterized in that said receiving means for receiving the feedback information are implemented to detect the feedback information on the received data packets. 26. A system as claimed in claim 17, characterized in that the system further comprises a third router located between said first and said at least one second router. 27. A system as claimed in claim 26, characterized in that said third router also comprises adding means (47) for adding the generated feedback to the received feedback information. 28. A system as claimed in claim 17, characterized in that said means for making a routing decision on the basis of the received feedback information are implemented to form a route for data packets belonging to a particular data flow. 29. A routing device for routing data packets in a communication network, the routing device comprising receiving means (31) for receiving data packets, transmitting means for transmitting data packets (31), routing means (32) for routing data packets, c h a r a c t e r i z e d in that the routing device also comprises at least detecting means (34) for detecting header data on the received data packets, feedback request generating means (35) for generating a connection quality feedback request, feedback request transmitting means (31) for transmitting the feedback request to at least one next routing device in the direction of a destination address, feedback request receiving means (31 , 34) for receiving the feedback request from at least one preceding routing device in the direction of a source address, feedback information generating means (44) for generating feedback information in response to the received feedback request, feedback information transmitting means (31) for transmitting the feedback information to at least one preceding routing device in the direction of the source address, feedback information receiving means (31) for receiving the feedback information from at least one preceding routing device in the direction of the destination address, feedback information adding means (47) for adding the generated feedback information to the received feedback information, means (46) for making a routing decision on the basis of the received feedback information. 30. A routing device as claimed in claim 29, c h a r a c t e r i z e d in that said adding means are implemented to add the required parameters and address data to said feedback information. 31. A computer program product for routing data packets in a communication network, the computer program product comprising computer program means for receiving data packets at a router, computer program means for routing the data packets forwards from the router, c h a r a c t e r i z e d in that said computer program product further comprises computer program means for identifying header data on the received data packets, computer program means for transmitting a feedback request to at least one next router in the direction of a destination address, computer program means for receiving the feedback request from at least one preceding router in the direction of the source address, computer program means for generating the feedback request for at least one connection quality parameter, computer program means for receiving feedback information from at least one preceding router in the direction of the destination address, computer program means for generating the feedback information on the basis of the received feedback request, computer program means for adding the generated feedback to the received feedback information, computer program means for transmitting the feedback information to at least one preceding router in the direction of the source address, computer program means for making a routing decision on the basis of the received feedback information.

Inventors: BERGENWALL MARTIN, MUHONEN AHTI, STAACK JENS, BERGENWALL, MARTIN, MUHONEN, AHTI, STAACK, JENS
Applicants: BERGENWALL MARTIN, MUHONEN AHTI, NOKIA CORP, STAACK JENS, BERGENWALL, MARTIN, MUHONEN, AHTI, NOKIA CORPORATION, STAACK, JENS
Application year: 2001
Main classification: H04L12
IPC codes: H04L12