| 摘要 |
<p>A system and method in a communications network for minimizing the number of attempts required to establish a communication between two nodes is disclosed. Each node maintains a database table composed of addresses of other nodes within the communications system. Associated with each nodal entry is a list of dialogue types that have been initiated with or terminated from the relevant node. Associated with each dialogue type entry is the most-advanced protocol version, such as the Mobile Application Part (MAP), that has been negotiated with the affiliated node for that dialogue type. When a first node wishes to initiate a dialogue with a second node, the first node checks the database table. The first node locates the second node in the table by address, locates the appropriate dialogue by type, and then determines the appropriate MAP version. If either the node or the specifically desired dialogue type is not within the database table, the first node attempts to establish the dialogue with the highest MAP version that the first node supports. After any resulting fall-back procedure has occurred, the first node stores in the database table the highest MAP version that was negotiated. The database table is periodically refreshed by clearing one or more entries.</p> |
