Analysis of Overlay Network Impact on Dependability

Karwaczyński, Piotr; Kwiatkowski, Jan

doi:10.1109/hicss.2005.97

Cited by 7 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Information sharing technology has been used in many current distributed systems such as Gnutella and BearShare [12,16]. Each node in such a decentralised framework carries a subset of the overall information of the system for searching and other purposes.…”

Section: Memory Consumption For Storing Agent Informationmentioning

confidence: 99%

“…For instance, (i) cost calculation methodologies for wide area network design [3] have been used for network design estimation; (ii) performance analysis of distributed systems has been carried out by Androutsellis-Theotokis and Spinellis [10] and Helsinger et al [11]; (iii) analysis of network topology impact on dependability offers an evaluation method for estimating the effect of topology on dependability [12].…”

Section: Network Topological Theorymentioning

confidence: 99%

See 1 more Smart Citation

Topological analysis of AOCD-based agent networks and experimental results

Zhang

Leung

Raikundalia

2008

Journal of Computer and System Sciences

View full text Add to dashboard Cite

Topological analysis of intelligent agent networks provides crucial information about the structure of agent distribution over a network. Performance analysis of agent network topologies helps multi-agent system developers to understand the impact of topology on system efficiency and effectiveness. Appropriate topology analysis enables the adoption of suitable frameworks for specific multi-agent systems. In this paper, we systematically classify agent network topologies and propose a novel hybrid topology for distributed multi-agent systems. We compare the performance of this topology with two other common agent network topologies-centralised and decentralised topologies-within a new multi-agent framework, called Agent-based Open Connectivity for DSS (AOCD). Three major aspects are studied for estimating topology performance, which include (i) transmission time for a set of requests; (ii) waiting time for processing requests; and (iii) memory consumption for storing agent information. We also conduct a set of AOCD topological experiments to compare the performance of hybrid and centralised agent network topologies and illustrate our experimental results in this paper.

show abstract

Section: Memory Consumption For Storing Agent Informationmentioning

confidence: 99%

Section: Network Topological Theorymentioning

confidence: 99%

Topological analysis of AOCD-based agent networks and experimental results

Zhang

Leung

Raikundalia

2008

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…For instance, (i) cost calculation methodologies for wide area network design [3] has been used for network design estimation; (ii) performance analysis of distributed systems has been carried out by Spinellis and Androutsellis-Theotokis [12] and Helsinger et al [13]; (iii) analysis of network topologies impact on dependability offers an evaluation method for estimating the effect of topology on dependability [14]; (iv) The description of the seven evaluation properties for analysing distributed systems topologies in Minar [2]. However, the current topology analysis based on multi-agent systems is inadequate.…”

Section: Related Workmentioning

confidence: 99%

“…Information sharing technology has been used in many current distributed systems such as Gnutella and BearShare [8] [14]. Each node in such a decentralised framework carries a subset of the overall information of the system for searching and other purposes.…”

Section: Memory Consumption For Storing Agent Informationmentioning

confidence: 99%

Performance analysis of network topologies in agent-based open connectivity architecture for DSS

Zhang

Leung

Raikundalia

2006

20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)

View full text Add to dashboard Cite

Performance analysis of agent network topologies helps multi-agent system developers to understand the impact of topology on system efficiency and effectiveness. Appropriate topology analysis enables the adoption of suitable frameworks for the specific multi-agent systems. In this paper, we propose a novel hybrid topology for distributed multi-agent systems, and compare the performance of this topology with two other common agent network topologies within the new multi-agent framework, Agent-based Open Connectivity for DSS (AOCD). Three major aspects are studied for estimating topology performance, which include (i) transmission time for a set of requests; (ii) waiting time for processing requests; and (iii) memory consumption for storing agent information.

show abstract

“…The P-RLI servers, which serve as both LRC and RLI, construct an overlay network [15] to build a distributed catalog of replicas. It has properties of load balancing, self-organization, fault-tolerance and improved scalability compared with RLS, but the performance and security in multiple-application environment are undermined because its core algorithm, Chord, makes replica mappings randomly stored among servers without awareness of their locations [16].…”

Section: Introductionmentioning

confidence: 99%

Boundary Chord: a novel peer-to-peer algorithm for replica location mechanism in grid environment

Jin

Wang

Chen

2005

8th International Symposium on Parallel Architectures,Algorithms and Networks (ISPAN'05)

View full text Add to dashboard Cite

The emerging grids need an efficient replica location mechanism. In the experience of developing 1 ChinaGrid Supporting Platform (CGSP), a grid middleware that builds a uniform platform supporting multiple grid-based applications, we meet a challenge of utilizing the properties of locality in replica location process to construct a practical and high performance replica location mechanism. The key of the solution to this challenge is to design an efficient replica location algorithm that meets above requirements. Some previous works have been done to build a replica location mechanism, but they are not suitable for replica location in a grid environment with multiple applications like ChinaGrid. In this paper, we present a novel peer-to-peer algorithm for replica location mechanism, Boundary Chord, which has the merits of locality awareness, self-organization, and load balancing. Simulation results show that the algorithm has better performance than other structured peer-to-peer solutions to the replica location problem.

show abstract

Analysis of Overlay Network Impact on Dependability

Cited by 7 publications

References 5 publications

Topological analysis of AOCD-based agent networks and experimental results

Topological analysis of AOCD-based agent networks and experimental results

Performance analysis of network topologies in agent-based open connectivity architecture for DSS

Boundary Chord: a novel peer-to-peer algorithm for replica location mechanism in grid environment

Contact Info

Product

Resources

About