Sciweavers

53 search results - page 6 / 11
» Network Swapping
Sort
View
APPT
2007
Springer
14 years 1 months ago
An Efficient Construction of Node Disjoint Paths in OTIS Networks
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
Weidong Chen, Wenjun Xiao, Behrooz Parhami
CDC
2010
IEEE
106views Control Systems» more  CDC 2010»
13 years 2 months ago
Semi-autonomous networks: Network resilience and adaptive trees
This paper examines the dynamics of a networked multi-agent system operating with a consensus-type coordination algorithm that can be influenced by external agents. We refer to thi...
Airlie Chapman, Mehran Mesbahi
ISPA
2005
Springer
14 years 26 days ago
A Generic Approach to Make Structured Peer-to-Peer Systems Topology-Aware
Abstract. With the help of distributed hash tables, the structured peerto-peer system has a short routing path and good extensibility. However, the mismatch between the overlay and...
Tongqing Qiu, Fan Wu, Guihai Chen
OPODIS
2004
13 years 8 months ago
Robust Topology Control Protocols
Topology control protocols attempt to reduce the energy consumption of nodes in an ad-hoc wireless network while maintaining sufficient network connectivity. Topology control proto...
Sukumar Ghosh, Kevin M. Lillis, Saurav Pandit, Sri...
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 11 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin