New measure and experimental evaluation for multiagent-based reservation of backup virtual paths in ATM networks

Abstract

I n order to make the A T M network fault-tolerantand the network service flexible, a method for setting up backup virtual paths (VP's for short) using multiagents is effective with respect to adaptability to change of network resource and user requirements, examples of which are failure of nodes and links and addition of VP's, respectively. I n the method, under the assumption that candidates of backup VP's between dafferent pairs of source and destination nodes are given, the optimum backup VP's are obtained b y exchanging information among agents autonomously. First, this paper proposes a new measure for determining backup VP's between different pairs of source and destination nodes. The measure shows degree of fault-tolerance for backup VP's and addition of VP's. Next, this paper presents simulation results to evaluate the adaptability of the method. The results show that the method efficiently obtains the optimum backup VP's even when the number of backup VP's increases and that different idle time at each destination node enables to shorten the total processing time whale keeping complete detection of shared links.

Multiagent-based path rerouting method in MPLS networks

“…Procedure of an agent assigned to LSR A : First the agent broadcasts a candidate-msg 2 including constraints for IEpair n+1 and LSR A with some value of Time To Live(TTL) and a reliable flag. 3 Next LSR A waits for candidate-ack's arrive and stores them. While waiting for the candidate-ack's, 1 There exist paths between an ingress LSR and an egress LSR denoted by a IEpair.…”