Proceedings. Fourth IEEE International Conference on Engineering of Complex Computer Systems (Cat. No.98EX193)

DOI: 10.1109/iceccs.1998.706662

|View full text |Cite

|

Sign up to set email alerts

|

VP reservation for rapid restoration using multiagents

Yoshiaki Kakuda

¹

,

²

,

³

et al.

Abstract: This paper discusses how a backup VP between each pair of a source node and a destination node is set up such that when some nodes and links in primary VP's fail, primary VP's are changed to backup VP's rapidly. Then, this paper proposes a multiagent-based method for such rapid restoration from primary VP's to backup VP's.The proposed method consists of the following three steps. The first step enumerates candidates of backup VP between each pair of a source node and a destination node. In the second step, cap… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Execution Example2

Introduction1

Citation Types

Supporting

0

Mentioning

3

Contrasting

0

Publication Types

Select...

Other4

Article1

Relationship

Self Cite1

Independent4

Authors

Journals

Cited by 5 publications

(3 citation statements)

References 4 publications

Supporting

0

Mentioning

3

Contrasting

0

Order By: Relevance

“…2 In S nodes (1,1), (2,2), messages msg and ack are transmitted in parallel along backup VP candidates 2-1, 2-2 for SD pair ((2,2), (6,6)) and backup VP candidates 1-1, 1-2 for SD pair ((1,1), (5,5) In addition, nodes (4,3), (5,6), (5,4), (1,3) obtain a synchronism of message ack at time points #1, #2, #3, #4. For example, at #1, after waiting for the reception of ack from nodes (5,6), (5,4), ack is transmitted to nodes (1,1), (2,2). By this synchronism, the competition information of links on backup VP candidates 1-1, 2-2 can be transmitted to S nodes (1,1), (2,2).…”

Section: Execution Examplementioning

confidence: 95%

“…For example, at #1, after waiting for the reception of ack from nodes (5,6), (5,4), ack is transmitted to nodes (1,1), (2,2). By this synchronism, the competition information of links on backup VP candidates 1-1, 2-2 can be transmitted to S nodes (1,1), (2,2).…”

Section: Execution Examplementioning

confidence: 95%

“…In Ref. 2, a method of reserving a backup VP in advance based on a scheme using multiagents is proposed.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Backup VP reservation method using multiagents and its experimental evaluation

¹

,

²

,

³

2001

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

SUMMARYHigh reliability schemes of switching from a primary VP to a backup VP by establishing two virtual paths (VPs), a primary VP and a backup VP, between a source (S) node and a destination (D) node in an ATM network when a failure of the node or the link occurs on the primary VP are known. The schemes performing the switching of the VPs without using multiagents have a problem associated with the incapability of switching rapidly from a primary VP to a backup VP, with the increase in the scale of the networks and the number of primary VPs (and backup VPs). In Ref.2, a scheme of establishing backup VPs using multiagents such that such switching is performed rapidly is proposed. In this scheme, under the assumption that a candidate backup VP is given for each pair of an S node and a D node (SD pair), link-sharing backup VPs are obtained among candidate VPs by information exchanges between the agents. In this scheme, the competition for a link between backup VPs is detected by the reception of messages passing the link, the function of collecting this detection information by an S node by information exchanges between agents is incorporated by each agent and the changes in the competition for the link can be followed. As an effect, it has a characteristic of high adaptability to the changes in the network resources (link capacity, topology) and resource requirements (primary VPs, backup VPs). In this paper, the results of performing simulation experiments to verify this characteristic are shown. The results of the experiments demonstrate that optimal backup VPs are obtained with good efficiency even when the number of backup VP candidates increases with the increase in SD pairs. In addition, the methods for obtaining the parameters of the agents required for obtaining optimal backup VPs are shown.

“…2 In S nodes (1,1), (2,2), messages msg and ack are transmitted in parallel along backup VP candidates 2-1, 2-2 for SD pair ((2,2), (6,6)) and backup VP candidates 1-1, 1-2 for SD pair ((1,1), (5,5) In addition, nodes (4,3), (5,6), (5,4), (1,3) obtain a synchronism of message ack at time points #1, #2, #3, #4. For example, at #1, after waiting for the reception of ack from nodes (5,6), (5,4), ack is transmitted to nodes (1,1), (2,2). By this synchronism, the competition information of links on backup VP candidates 1-1, 2-2 can be transmitted to S nodes (1,1), (2,2).…”

Section: Execution Examplementioning

confidence: 95%

“…For example, at #1, after waiting for the reception of ack from nodes (5,6), (5,4), ack is transmitted to nodes (1,1), (2,2). By this synchronism, the competition information of links on backup VP candidates 1-1, 2-2 can be transmitted to S nodes (1,1), (2,2).…”

Section: Execution Examplementioning

confidence: 95%

“…In Ref. 2, a method of reserving a backup VP in advance based on a scheme using multiagents is proposed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Backup VP reservation method using multiagents and its experimental evaluation

¹

,

²

,

³

2001

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

SUMMARYHigh reliability schemes of switching from a primary VP to a backup VP by establishing two virtual paths (VPs), a primary VP and a backup VP, between a source (S) node and a destination (D) node in an ATM network when a failure of the node or the link occurs on the primary VP are known. The schemes performing the switching of the VPs without using multiagents have a problem associated with the incapability of switching rapidly from a primary VP to a backup VP, with the increase in the scale of the networks and the number of primary VPs (and backup VPs). In Ref.2, a scheme of establishing backup VPs using multiagents such that such switching is performed rapidly is proposed. In this scheme, under the assumption that a candidate backup VP is given for each pair of an S node and a D node (SD pair), link-sharing backup VPs are obtained among candidate VPs by information exchanges between the agents. In this scheme, the competition for a link between backup VPs is detected by the reception of messages passing the link, the function of collecting this detection information by an S node by information exchanges between agents is incorporated by each agent and the changes in the competition for the link can be followed. As an effect, it has a characteristic of high adaptability to the changes in the network resources (link capacity, topology) and resource requirements (primary VPs, backup VPs). In this paper, the results of performing simulation experiments to verify this characteristic are shown. The results of the experiments demonstrate that optimal backup VPs are obtained with good efficiency even when the number of backup VP candidates increases with the increase in SD pairs. In addition, the methods for obtaining the parameters of the agents required for obtaining optimal backup VPs are shown.

Multiple backup virtual paths reservation problem and its solution

¹

,

²

Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000

View full text Add to dashboard Cite

No abstract

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

¹

,

²

,

³

Proceedings Sixth IEEE International Conference on Engineering of Complex Computer Systems. ICECCS 2000

Self Cite

View full text Add to dashboard Cite

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.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.