Sciweavers

552 search results - page 66 / 111
» Routing complexity of faulty networks
Sort
View
ICICS
2003
Springer
15 years 4 months ago
Secure Route Structures for the Fast Dispatch of Large-Scale Mobile Agents
Abstract. For the application of large-scale mobile agents in a distributed environment, where a large number of computers are connected together to enable the large-scale sharing ...
Yan Wang 0002, Chi-Hung Chi, Tieyan Li
MIDDLEWARE
2005
Springer
15 years 4 months ago
MEDYM: Match-Early with Dynamic Multicast for Content-Based Publish-Subscribe Networks
Abstract. Design of distributed architectures for content-based publish-subscribe (pub-sub) service networks has been a challenging problem. To best support the highly dynamic and ...
Fengyun Cao, Jaswinder Pal Singh
TC
2008
14 years 11 months ago
An Efficient and Deadlock-Free Network Reconfiguration Protocol
Component failures and planned component replacements cause changes in the topology and routing paths supplied by the interconnection network of a parallel processor system over ti...
Olav Lysne, José Miguel Montañana, J...
CCGRID
2010
IEEE
15 years 7 days ago
Dynamic TTL-Based Search in Unstructured Peer-to-Peer Networks
Abstract--Resource discovery is a challenging issue in unstructured peer-to-peer networks. Blind search approaches, including flooding and random walks, are the two typical algorit...
Imen Filali, Fabrice Huet
EOR
2008
83views more  EOR 2008»
14 years 11 months ago
Rerouting tunnels for MPLS network resource optimization
In Multi-Protocol Label Switching (MPLS) networks, traffic demands can be routed along tunnels called Label Switched Paths (LSPs). A tunnel is characterized by a path in the netwo...
Olivier Klopfenstein