11 citations · 20 across the 12 of their papers we have counts for
12 papers · 1 filter
Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
Yuichi Sudo, Naoki Kitamura, Masahiro Shibata +4
We study deterministic exploration by a single agent in -interval-connected graphs, a standard model of dynamic networks in which, for every time window of length , the inter…
Near-linear Time Dispersion of Mobile Agents
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
Consider that there are agents in a simple, connected, and undirected graph with nodes and edges. The goal of the dispersion problem is to move these …
Gathering Despite Defected View
Yonghwan Kim, Masahiro Shibata, Yuichi Sudo +3
An autonomous mobile robot system consisting of many mobile computational entities (called robots) attracts much attention of researchers, and to clarify the relation between the c…
Gathering despite a linear number of weakly Byzantine agents
Jion Hirose, Junya Nakamura, Fukuhito Ooshita +1
We study the gathering problem to make multiple agents initially scattered in arbitrary networks gather at a single node. There exist agents with unique identifiers (IDs) in th…
Network Bandwidth Variation-Adapted State Transfer for Geo-Replicated State Machines and its Application to Dynamic Replica Replacement
Tairi Chiba, Ren Ohmura, Junya Nakamura
This paper proposes a new state transfer method for geographic state machine replication (SMR) that dynamically allocates the state to be transferred among replicas according to ch…
Evaluation and Ranking of Replica Deployments in Geographic State Machine Replication
Shota Numakura, Junya Nakamura, Ren Ohmura
Geographic state machine replication (SMR) is a replication method in which replicas of a service are located on multiple continents to improve the fault tolerance of a general ser…
A State Transfer Method That Adapts to Network Bandwidth Variations in Geographic State Machine Replication
Tairi Chiba, Ren Ohmura, Junya Nakamura
We present a new state transfer method for geographic State Machine Replication (SMR) that dynamically allocates the state to be transferred among replicas according to changes in…
A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations
Junya Nakamura, Yonghwan Kim, Yoshiaki Katayama +1
A distributed system consisting of a huge number of computational entities is prone to faults, because faults in a few nodes cause the entire system to fail. Consequently, fault to…
Evacuation from Various Types of Finite 2D Square Grid Fields by a Metamorphic Robotic System
Junya Nakamura, Sayaka Kamei, Yukiko Yamauchi
A metamorphic robotic system (MRS) is composed of anonymous, memoryless, and autonomous modules that execute an identical distributed algorithm to move while keeping the connectivi…
Self-Stabilizing Construction of a Minimal Weakly -Reachable Directed Acyclic Graph
Junya Nakamura, Masahiro Shibata, Yuichi Sudo +1
We propose a self-stabilizing algorithm to construct a minimal weakly -reachable directed acyclic graph (DAG), which is suited for routing messages on wireless networ…
Gathering with a strong team in weakly Byzantine environments
Jion Hirose, Junya Nakamura, Fukuhito Ooshita +1
We study the gathering problem requiring a team of mobile agents to gather at a single node in arbitrary networks. The team consists of agents with unique identifiers (IDs), an…
The Power of Global Knowledge on Self-stabilizing Population Protocols
Yuichi Sudo, Masahiro Shibata, Junya Nakamura +2
In the population protocol model, many problems cannot be solved in a self-stabilizing way. However, global knowledge, such as the number of nodes in a network, sometimes allows us…