Flocchini et al., 2012 - Google Patents

Searching for black holes in subways

Flocchini et al., 2012

View PDF
Document ID
10183045569206561403
Author
Flocchini P
Kellett M
Mason P
Santoro N
Publication year
Publication venue
Theory of Computing Systems

External Links

Snippet

Current mobile agent algorithms for mapping faults in computer networks assume that the network is static. However, for large classes of highly dynamic networks (eg, wireless mobile ad hoc networks, sensor networks, vehicular networks), the topology changes as a function …
Continue reading at www.eecs.uottawa.ca (PDF) (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F15/00—Digital computers in general; Data processing equipment in general
    • G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
    • G06F15/163—Interprocessor communication
    • G06F15/173—Interprocessor communication using an interconnection network, e.g. matrix, shuffle, pyramid, star, snowflake

Similar Documents

Publication Publication Date Title
Flocchini et al. Searching for black holes in subways
Kshemkalyani et al. Efficient dispersion of mobile robots on graphs
Dobrev et al. Mobile search for a black hole in an anonymous ring
Flocchini et al. On the exploration of time-varying networks
Dobrev et al. Searching for a black hole in arbitrary networks: Optimal mobile agents protocols
Flocchini et al. Ping pong in dangerous graphs: Optimal black hole search with pebbles
Devismes et al. Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Di Luna Mobile agents on dynamic graphs
Gotoh et al. Group exploration of dynamic tori
Markou et al. Dangerous graphs
Flocchini et al. Distributed security algorithms for mobile agents
Gotoh et al. Tight bounds on distributed exploration of temporal graphs
Dobrev et al. Using scattered mobile agents to locate a black hole in an un-oriented ring with tokens
CN110380903A (en) A kind of power telecom network fault detection method, device and equipment
Di Luna et al. Black hole search in dynamic rings: The scattered case
Flocchini et al. Mapping an unfriendly subway system
Dieudonné et al. Deterministic network exploration by a single agent with Byzantine tokens
Markou Identifying hostile nodes in networks using mobile agents
Flocchini et al. Ping pong in dangerous graphs: Optimal black hole search with pure tokens
Shi et al. Improving the on-vehicle experience of passengers through SC-M*: A scalable multi-passenger multi-criteria mobility planner
Knyazeva et al. Managing temporal uncertainty in multi-mode Z-number fuzzy graph structures
Abbas et al. Distributed computation of a spanning tree in a dynamic graph by mobile agents
Zibaeenejad et al. Dependency graph: An algorithm for analysis of generalized parameterized networks
Charif et al. MUGEN: A high-performance fault-tolerant routing algorithm for unreliable Networks-on-Chip
Saxena et al. Natural Calamities Demand More Rescuers: Exploring Connectivity Time Dynamic Graphs