Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Distributed Algorithms
An ad hoc mobility model founded on social network theory
MSWiM '04 Proceedings of the 7th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Graphs over time: densification laws, shrinking diameters and possible explanations
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
Agent-organized networks for dynamic team formation
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Exploring the Effects of Hyper-Threading on Parallel Simulation
DS-RT '06 Proceedings of the 10th IEEE international symposium on Distributed Simulation and Real-Time Applications
Temporal evolution of social networks in Paltalk™
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Hi-index | 0.01 |
Network Topology has been shown as a key factor on influencing system performance even under the same coordination algorithm. Although many distributed algorithm designs have been proved to be feasible to make up some functions in the large scale distributed systems as claimed, for example, recovering the network from link or node failures, they may significantly change the network topology which has never been tested. Therefore, their influences on the overall system performance are unknown. In this paper, we have made an initial effort to find how a standard network recovery policy, such as MPLS algorithm, may change the network in terms of network congestions and shifts of network topologies. Those interesting discoveries are helpful to predict their influences on system performance and in turn to be useful for new algorithm design.