ROUTING OF PEER-TO-PEER MESSAGES IN A COMMUNICATION NETWORK

摘要

The present invention relates to a method and an arrangement for routing of peer-to-peer messages (M1, M2, M3) in a communication network. The messages are routed between a first instance (Y) in a first node (A) and a second node (B). The method comprises inserting information (I1) in a first message (M1). The information is to be forwarded from the first instance (Y) to the second node (B). Data identifying the first instance (Y) is inserted in an originating identification field (OI) in the first message (M1). A default value (DF) is inserted in a destination identification field (DI) in the first message. The first message (M1) is then sent from the first node (A) to the second node (B). In the second node (B), the default value (DF) is identified. The information (I1) in the first message (M1) is then routed to a second instance (Q) in the second node (B) whereby the second instance is selected out of several destination instances (Q, R, S) in the second node. When the two instances have been pointed out, the ongoing interchange between the nodes continue by using the originating and destination identification fields to find the right connected instance.