Dynamic Network Reconfiguration in Presence of Multiple Node and Link Failures Using Autonomous Agents

Acosta, Juan R.; Avresky, Dimiter R.

doi:10.1109/colcom.2005.1651234

Cited by 7 publications

(17 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Agent NetReconf [2], is a dynamic reconfiguration algorithm capable of tolerating multiple simultaneous network failures. The algorithm uses mobile agents to find restoration paths that re-establish connectivity on the network devices adjacent to the failed component.…”

Section: Agent Netreconf Overviewmentioning

confidence: 99%

“…Agent NetReconf as described in [2], runs successfully only if no failures occur after the reconfiguration process started. This condition reduces the effectiveness of the algorithm to a small number of cases when in practice faults can appear at any time.…”

Section: Algorithm Assumptionsmentioning

confidence: 99%

“…Therefore, in order to enhance Agent NetReconf we need to establish the following assumptions: Assumption 2. [2] and Net Rec [3], the paths are saved in a priority queue, based on the time of arrival.…”

Section: Algorithm Assumptionsmentioning

confidence: 99%

“…If ER 1 is after the failure, then the agent will travel until it reaches RL 1 . The leader, RL 1 will send a RT B message towards NAF 1 using explicit path routing, as defined in [2]. The message will stop traveling further, when it reaches the node adjacent to the failure.…”

Section: No Restoration Paths Established Between Leader Andmentioning

confidence: 99%

“…The algorithm performs network reconfiguration based on the same principles used in NetRec [3,4]. Agent NetReconf differentiates from NetRec [3] in several aspects: it is agent based and not message based, uses knowledge instead of synchronous messaging, has a lower runtime complexity, as proved in [2]. Finally, the algorithm can tolerate new failures even if the reconfiguration for a different failure started already, as shown in Section 2.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Intelligent Dynamic Network Reconfiguration

Acosta

Avresky

2007

2007 IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

Section: Agent Netreconf Overviewmentioning

confidence: 99%

Section: Algorithm Assumptionsmentioning

confidence: 99%

Section: Algorithm Assumptionsmentioning

confidence: 99%

Section: No Restoration Paths Established Between Leader Andmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Intelligent Dynamic Network Reconfiguration

Acosta

Avresky

2007

2007 IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

show abstract

RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration

Solheim

Lysne

Skeie

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Reconfiguration of an interconnection network is fundamental for the provisioning of a reliable service. Current reconfiguration methods either include deadlock-avoidance mechanisms that impose performance penalties during the reconfiguration, or are tied to the Up*/Down* routing algorithm which achieves relatively low performance. In addition, some of the methods require complex network switches, and some are limited to distributed routing systems. This paper presents a new dynamic reconfiguration method, RecTOR, which ensures deadlockfreedom during the reconfiguration without causing performance degradation such as increased latency or decreased throughput. Moreover, it is based on a simple concept, is easy to implement, is applicable for both source and distributed routing systems, and assumes Transition-Oriented Routing which achieves excellent performance. Our simulation results confirm that RecTOR supports a better network service to the applications than Overlapping Reconfiguration does.

show abstract

Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents

Zhou

Guan

2011

J Netw Syst Manage

View full text Add to dashboard Cite

The growing popularity of Peer-to-Peer (P2P) technology in real applications in recent years has sparked increasing interest from both academia and industry in designing resilient P2P networks for these applications. Routing is a crucial technique to support successful P2P applications, and designing robust routing mechanisms is still a technical challenge for P2P systems and applications due to their inherent dynamics. This paper addresses the issue of resilient routing in unstructured P2P networks. To this end, we first propose a novel query routing approach to improving query performance in unstructured P2P networks, and then develop a mobile agent based network reconfiguration mechanism that provides a combined node and link failure diagnosis and restoration to maintain routing performance even in dynamic network environments. Simulated results show that the proposed query routing approach can achieve a good tradeoff between query hit rates and space costs in scale-free networks and that the mobile agent based network reconfiguration mechanism outperforms the existing methods in different types of network topologies.

show abstract

Dynamic Network Reconfiguration in Presence of Multiple Node and Link Failures Using Autonomous Agents

Cited by 7 publications

References 11 publications

Intelligent Dynamic Network Reconfiguration

Intelligent Dynamic Network Reconfiguration

RecTOR: A New and Efficient Method for Dynamic Network Reconfiguration

Enhancing Routing Robustness of Unstructured Peer-to-Peer Networks Using Mobile Agents

Contact Info

Product

Resources

About