担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： doi.org/10.1007/978-3-031-46784-4_1

DOI： doi.org/10.1007/978-3-031-46784-4_1

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

The need for fast and efficient one-to-many file transfers is growing with the rapid increase in traffic among distributed servers for replicating and distributing large files. Assuming centrally-managed Software Defined Networking (SDN) environments, the authors have been developing a framework of one-to-many file transfers for networks with full-duplex links by which every receiver can fully utilize its own max-flow from the sender throughout the file transfer duration. In our framework, a file is divided into multiple blocks that are transmitted to receivers on a set of multicast trees according to a block transmission schedule designed for a given network topology with the locations of the sender and the receivers (called MPMC). Our previous study proposed an extension of MPMC in which the sender generates additional coded blocks from the original blocks and transmits those blocks, but it may suffer from the processing delays of encoding and decoding at the sender and all the receivers. Therefore, this paper proposes a new extension of MPMC (called Rainbow-MPMC) by incorporating in-network cache at tailored switches, in which a block in transmission can be replaced (overwritten) at a switch on the way by another block previously passing the switch and cached, instead of just being forwarded to downstream. Through a variety of network topology examples, we verify that many different optimal sched-ules of Rainbow-MPMC can be generated in a given network, each of which minimizes every receiver's reception completion time simultaneously while requiring a different number of block replacements. We also showed that the minimum number of block replacements among different optimal schedules varies significantly by network even over similar-sized networks.

DOI： 10.1109/ITNAC59571.2023.10368542

DOI： 10.1109/ITNAC59571.2023.10368542

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85183042027&origin=inward

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

Fault-tolerance and self-organization are critical properties in modern distributed systems. Self-stabilization is a class of fault-tolerant distributed algorithms which has the ability to recover from any kind and any finite number of transient faults and topology changes. In this paper, we propose a self-stabilizing distributed algorithm for the 1-MIS problem under the unfair central daemon assuming the distance-3 model. Here, in the distance-3 model, each process can refer to the values of local variables of processes within three hops. Intuitively speaking, the 1-MIS problem is a variant of the maximal independent set (MIS) problem with improved local optimizations. The time complexity (convergence time) of our algorithm is O(n) steps and the space complexity is O(logn) bits, where n is the number of processes.

DOI： 10.1109/CANDARW60564.2023.00025

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85185713005&origin=inward

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

Cloud computing and content delivery networking have increased demand for centrally managed networks with dynamic and flexible traffic engineering that are based on OpenFlow. In such systems, detecting and locating deteriorated links is necessary to maintain a high network service quality. Our previous work suggested a measurement framework that merely relies on standard OpenFlow functions and can quickly locate all high-loss links. The load on the data-plane and control-plane incurred by the measurement can be reduced by combining an active measurement by probing multicast packets along a designed route and a passive measurement by collecting flow-stats of the probing flow at selected switch ports in an appropriate sequential order to access switches. In particular, the measurement overhead (the number of switches accessed before locating all high-loss links) can be decreased while maintaining a high level of accuracy with a specific length path by creating the measurement route based on the backbone-and-branch tree (BBT) route scheme. Since a longer path will reduce the number of accesses to the switches, the path length is better to be long unless it exceeds the maximum allowable length depending on the targeted link loss rate to detect. However, there was no such control to make the path length optimal. Therefore, in this paper, we proposed a method to optimize the route scheme with a limited length of paths for probing packets. The numerical simulation shows the effectiveness of our proposal.

DOI： 10.1109/ATC58710.2023.10318523

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85179127692&origin=inward

担当区分：筆頭著者,　責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic tori. The partial gathering problem is a generalization of the (well-investigated) total gathering problem, which requires that all k agents distributed in the network terminate at a non-predetermined single node. The partial gathering problem requires, for a given positive integer g (< k), that agents terminate in a configuration such that either at least g agents or no agent exists at each node. So far, in almost cases, the partial gathering problem has been considered in static graphs. As only one exception, it is considered in a kind of dynamic rings called 1-interval connected rings, that is, one of the links in the ring may be missing at each time step. In this paper, we consider partial gathering in another dynamic topology. Concretely, we consider it in n × n dynamic tori such that each of row rings and column rings is represented as a 1-interval connected ring. In such networks, when k = O(gn), focusing on the relationship between the values of k, n, and g, we aim to characterize the solvability of the partial gathering problem and analyze the move complexity of the proposed algorithms when the problem can be solved. First, we show that agents cannot solve the problem when k = o(gn), which means that Ω(gn) agents are necessary to solve the problem. Second, we show that the problem can be solved with the total number of O(gn3) moves when 2gn + 2n − 1 ≤ k ≤ 2gn + 6n + 16g − 12. Finally, we show that the problem can be solved with the total number of O(gn2) moves when k ≥ 2gn + 6n + 16g − 11. From these results, we show that our algorithms can solve the partial gathering problem in dynamic tori with the asymptotically optimal number Θ(gn) of agents. In addition, we show that agents require a total number of Ω(gn2) moves to solve the partial gathering problem in dynamic tori when k = Θ(gn). Thus, when k ≥ 2gn + 6n + 16g − 11, our algorithm can solve the problem with asymptotically optimal number O(gn2) of agent moves.

DOI： 10.4230/LIPIcs.SAND.2023.2

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85163632894&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.4230/LIPIcs.OPODIS.2022.14

DOI： 10.4230/LIPIcs.OPODIS.2022.14

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

A globally integrated testbed for various experiments of distributed applications based on the edge cloud computing was constructed and operated as part of an international joint research program, Japan-US Network Opportunity 2 (JUNO2). The testbed consists of many virtual machines (VMs) at Kyushu Institute of Technology (Kyutech), The City College of The City University of New York (CCNY), StarBED (a large-scale PC cluster testbed), and RISE (a wide-area OpenFlow testbed) over multiple Layer-2 virtual networks (VLANs) through collaboration with international research and educational networks. Those VLANs are used as the data and the control planes with a single OpenFlow controller and twelve OpenFlow switches. As an example, this paper introduces an experiment of VM migration among CCNY, Kyutech, and StarBED for a global virtual collaborative working environment. An OpenFlow-based multicasting scheme is adopted for efficient use of the bottleneck network bandwidth in replicating a large VM environment from CCNY to two sites in Japan. The implementation details on the global testbed and the experimental results are reported, verifying that the multicast-based transfer halves the elapsed time of VM migration compared with the unicast-based transfer.

DOI： 10.1109/INFOCOMWKSHPS57453.2023.10226149

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85171612297&origin=inward

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

In this paper, we consider the problem of semi-uniform deployment for mobile robots in perfect (Formula presented.) -ary trees. This problem requires robots to spread in the tree so that, for some positive integer (Formula presented.) and some fixed integer (Formula presented.), each node of depth (Formula presented.) is occupied by a robot. Robots have an infinite visibility range but are opaque, and each robot can emit a light color visible to itself and other robots, taken from a set of (Formula presented.) colors, at each time step. Then, we clarify the solvability of the semi-uniform deployment problem, focusing on the number of available light colors. First, we consider robots with (Formula presented.). In this setting, we show that there is no collision-free algorithm to solve the problem. Next, relax the number of available light colors, that is, we consider robots with (Formula presented.). In this setting, we propose a collision-free algorithm that can solve the problem. From these results, we can show that the semi-uniform deployment problem can be solved when (Formula presented.), and our proposed algorithm is optimal with respect to the number of used light colors (i.e., 2).

DOI： 10.1002/cpe.7432

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85141440311&origin=inward

担当区分：筆頭著者,　責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

In this paper, we consider the almost uniform deployment problem of mobile agents in dynamic rings, which requires all agents other than one agent to spread uniformly in the ring. In this paper, we consider this problem in 1-interval connected rings, that is, one of the links may be missing at each time step. Focusing on global knowledge given to agents, we clarify the problem solvability and the algorithm performance. First, we consider agents with knowledge of the number n of nodes. Then, we show that the problem can be solved with O(klog⁡n) memory space per agent, O(nlog⁡k) rounds, and a total number of O(kn) moves, where k is the number of agents. Next, we consider agents with knowledge of k. Then, we show that the problem can be solved with O(klog⁡n) memory space per agent, O(n2) rounds, and a total number of O(n2) moves.

DOI： 10.1016/j.ic.2022.104949

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85136145120&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

In this paper, we provide a new perspective on the observation by robots; a robot cannot necessarily observe all other robots regardless of distances to them. We introduce a new computational model with defected views called a (N,k)-defected model where k robots among N - 1 other robots can be observed. We propose two gathering algorithms: one in the adversarial (N,N - 2)-defected model for N ≥ 5 (where N is the number of robots) and the other in the distance-based (4,2)-defected model. Moreover, we present two impossibility results for a (3,1)-defected model and a relaxed (N, N - 2)-defected model respectively. This announcement is short; the full paper is available at [1].

DOI： 10.4230/LIPIcs.DISC.2022.46

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85140924296&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-031-20029-8_23

DOI： 10.1007/978-3-031-20029-8_23

記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

Software Defined Networking (SDN) enables flexible and dynamic control of packet forwarding and processing by decoupling the control plane and the data plane. However, to implement an efficient and reliable in-band SDN control channel to connect controller(s) and switch/router(s), conventional static schemes such as VLAN are insufficient especially in highly utilized and/or network-topology variable wireless networks. Therefore, a dynamic in-band control channel is considered which can piggyback (embed) control messages onto data packets flowing on the network. In this paper, we report a feasibility study on the dynamic in-band control channel implemented on the BMv2 router in Programming Protocol Independent Packet Processors (P4) framework. The adverse impact on the data plane performance is experimentally investigated. It is found that the TCP goodput and packet loss characteristics are degraded as the amount of embedded information increases but the significant impact comes from not embedding/extracting the control information on data packets but sending the extracted information to a controller; which give us hints to applicable conditions and possible improvements on the dynamic in-band control channel implementation.

DOI： 10.1007/978-3-031-14627-5_45

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85137023850&origin=inward

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.15803/ijnc.12.1_2

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

In this paper, we consider the partial gathering problem of mobile agents in synchronous dynamic bidirectional rings. The partial gathering problem is a generalization of the (well-investigated) total gathering problem, which requires that all k agents distributed in the network terminate at a non-predetermined single node. The partial gathering problem requires, for a given positive integer g(&lt;k), that agents terminate in a configuration such that either at least g agents or no agent exists at each node. The requirement for the partial gathering problem is strictly weaker than that for the total gathering problem, and thus it is interesting to clarify the difference in the move complexity between them. So far, partial gathering has been considered in static graphs. In this paper, we consider this problem in 1-interval connected rings, that is, one of the links in the ring may be missing at each time step. In such networks, we aim to clarify the solvability of the partial gathering problem and the move complexity, focusing on the relationship between values of k and g. First, we consider the case of 3 g≤ k≤ 8 g- 2. In this case, we show that our algorithm can solve the problem with the total number of O(kn) moves, where n is the number of nodes. Since k= O(g) holds when 3 g≤ k≤ 8 g- 2, the move complexity O(kn) in this case can be represented also as O(gn). Next, we consider the case of k≥ 8 g- 3. In this case, we show that our algorithm can also solve the problem and its move complexity is O(gn). These results mean that, when k≥ 3 g, the partial gathering problem can be solved also in dynamic rings. In addition, agents require a total number of Ω(gn) (resp., Ω(kn) ) moves to solve the partial (resp., total) gathering problem. Thus, the both proposed algorithms can solve the partial gathering problem with the asymptotically optimal total number of O(gn) moves, which is strictly smaller than that for the total gathering problem.

DOI： 10.1007/978-3-030-91081-5_29

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85119832095&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

When a large-scale disaster occurs, it is necessary for an emergency response headquarters (HQ) to promptly collect disaster damage information. We consider monitoring such information along all streets in a town by a single vehicle equipping cameras, mics, and other sensors especially when high-speed communications infrastructures are unavailable. The vehicle starts from HQ, cruises through all streets, and finally backs to HQ to bring monitored information. Note that the vehicle can return to HQ on the way to drop a partial information monitored before. In this paper, a vehicle routing problem is posed for the information collecting vehicle by considering not only collection time of the entire information but also how much ratio and how long time the information is delayed in incremental collection to HQ for an early decision and a partial response. A grid map is used as a town’s street network with three types of HQ location. Through an extensive search by leveraging Eulerian circles, we found good routes for incremental collection of disaster information. The experimental results suggest the importance of an appropriate number of returns to HQ with almost equally-sized intervals depending on the HQ location.

DOI： 10.1007/978-3-030-94822-1_28

DOI： 10.1007/978-3-030-94822-1_28

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85125233683&origin=inward

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

In this paper, we consider the problem of semi-uniform deployment for mobile robots in perfect \ell-Ary trees, where every intermediate node has \ell children, and all leaf nodes have the same depth. This problem requires robots to spread in the tree so that, for some positive integer d and some fixed integer s(0\leq s\leq d-1), each node of depth s+dj\ (j\geq 0) is occupied by a robot. In other words, after semi-uniform deployment is achieved, nodes of depth s, s+d, s+2d, \ldots are occupied by a robot. Robots have an infinite visibility range but are opaque, that is, robot r{i} cannot observe some robot r{j} if there exists another robot r{k} in the path between r{i} and r{j}. In addition, each robot can emit a light color visible to itself and other robots, taken from a set of \kappa colors, at each time step. Then, we clarify the relationship between the number of available light colors and the solvability of the semi-uniform deployment problem. First, we consider robots with the minimum number of available light colors, that is, robots with \kappa =1 (in this case, robots are oblivious). In this setting, we show that there is no collision-free algorithm to solve the semi-uniform deployment problem with explicit termination. Next, we relax the number of available light colors, that is, we consider robots with \kappa=2. In this setting, we propose a collision-free algorithm that can solve the problem with explicit termination. Thus, our algorithm is optimal with respect to the number of light colors. In addition, to the best of our knowledge, this paper is the first to report research considering (a variant of) uniform deployment in graphs other than rings or grids.

DOI： 10.1109/CANDAR53791.2021.00031

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85124152249&origin=inward

担当区分：最終著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

This paper will demonstrate a novel method for consolidating data in an engineered hypercube network for the purpose of optimizing query processing. Query processing typically calls for merging data collected from a small subset of server nodes in a network. This poses the problem of managing efficiently the exchange of data between processing nodes to complete some relational data operation. The method developed here is designed to minimize data transfer, measured as the product of data quantity and network distance, by delegating the processing to a node that is relatively central to the subset. A hypercube not only supports simple computation of network distance between nodes, but also allows for identifying a node to serve as the center for any data consolidation operations. We will show how the consolidation process can be performed by selecting a subgraph of a complex network to simplify the selection of a central node and thus facilitate the computations required. We will also show a prototype implementation of a hypercube using Software-Defined Networking to support query optimization in a distributed heterogeneous database system, making use of network distance information and data quantity.

DOI： 10.1007/978-3-030-84910-8_30

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85113749592&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

In this paper, we introduce a new graph structure named an ST-reachable directed acyclic graph which is a directed acyclic graph (DAG) that guarantees reachability (i.e., a directed path exists) from every sender to every target. When an arbitrarily connected undirected graph G=(V,E) and two sets of the vertices, senders S (⊂V) and targets T (⊂V), are given, we consider the construction of a minimal ST-reachable DAG by changing some undirected edges to arcs and removing the remaining edges. In this paper, we present the necessary and sufficient condition under which a minimal ST-reachable DAG can be constructed when |S|≤2 and |T|≤2, and propose a self-stabilizing algorithm for constructing a minimal ST-reachable DAG (if it exists) when an arbitrarily connected undirected graph, S(|S|≤2) and T(|T|≤2) are given. Moreover, our proposed algorithm can detect the non-existence of any ST-reachable DAG if the ST-reachable DAG of the given graph and two sets of vertices, S and T, do not exist.

DOI： 10.1016/j.tcs.2021.05.005

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85106286691&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1016/j.iot.2021.100398

その他リンク： https://www.scopus.com/record/display.uri?eid=2-s2.0-85117140456&origin=resultslist&sort=plf-f

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1109/IPDPSW52791.2021.00090

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

In the population protocol model, many problems cannot be solved in a self-stabilizing manner. However, global knowledge, such as the number of nodes in a network, sometimes enables the design of a self-stabilizing protocol for such problems. For example, it is known that we can solve the self-stabilizing leader election in complete graphs if and only if every node knows the exact number of nodes. In this paper, we investigate the effect of global knowledge on the possibility of self-stabilizing population protocols in arbitrary graphs. Specifically, we clarify the solvability of the leader election problem, the ranking problem, the degree recognition problem, and the neighbor recognition problem by self-stabilizing population protocols with knowledge of the number of nodes and/or the number of edges in a network.

DOI： 10.1109/TPDS.2021.3076769

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85105843162&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

One-to-many transfers in a fast and efficient manner are essential to meet the growing need for duplicating, migrating, or sharing bulk data among servers in a datacenter and across geographically distributed datacenters. Some existing works utilize multiple multicast trees for a one-to-many transfer request to increase network link utilization and its transfer throughput. However, since those schemes do not fully utilize the max-flow value of transmission from a single sender to each recipient, there is room for each recipient to retrieve data more quickly. Therefore, assuming fully-controlled networks with full-duplex links, we pose a problem to find a set of multicast flows with an allocation of block-wise transmissions by which each of multiple recipients with diverse max-flow values from the sender can utilize its own max-flow value. Based on that, assuming a sender-side coding capability on file blocks, we design a schedule of block transmissions over multiple phases by which each recipient can achieve a lower-bound of its file retrieval completion time, i.e., the file size divided by its own max-flow value. This paper presents the coded Multipath Multicast (Coded-MPMC) for one-to-many transfers with heuristic procedures to find a desired set of multicast flows on which block transmissions are scheduled. Through extensive simulations on large-scale real-world network topologies and different types of randomly-generated synthetic topologies, the proposed method is shown to design a desired schedule efficiently. A preliminary implementation on OpenFlow is also reported to show the fundamental feasibility of Coded-MPMC.

DOI： 10.1109/ACCESS.2021.3063149

Scopus

その他リンク： https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85102295736&origin=inward

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.2197/ipsjjip.29.115

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1007/978-3-030-70639-5_22

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.23919/ICACT51234.2021.9370812

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.34385/proc.63.D4-1

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-64348-5_20

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-64348-5_21

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-61108-8_12

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-57796-4_42

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1109/SRDS51746.2020.00008

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-54921-3_14

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1016/j.tcs.2020.04.002

Kyutacar

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1016/j.tcs.2019.12.031

Kyutacar

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1109/ICOIN48656.2020.9016551

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1109/ICOIN48656.2020.9016438

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-34992-9_21

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-34992-9_18

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-29035-1_33

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1109/ITC31.2019.00025

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-24922-9_19

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1109/ICDCS.2019.00219

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1587/transinf.2018FCP0008

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1016/j.jpdc.2018.03.008

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-030-01325-7_16

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1016/j.tcs.2017.09.016

Kyutacar

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-319-69084-1_37

担当区分：筆頭著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1145/2933057.2933093

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（学術雑誌）

DOI： 10.1016/j.tcs.2015.09.012

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-319-09620-9_25

担当区分：責任著者   記述言語：英語   掲載種別：研究論文（国際会議プロシーディングス）

DOI： 10.1007/978-3-642-35476-2_18

開催期間： 2023年07月   記述言語：日本語  

開催期間： 2023年07月   記述言語：日本語  

開催期間： 2023年05月   記述言語：英語  

開催期間： 2023年03月   記述言語：日本語  

開催期間： 2023年03月   記述言語：日本語  

開催期間： 2022年12月   記述言語：英語  

開催期間： 2022年09月   記述言語：日本語  

開催期間： 2022年07月   記述言語：日本語  

開催期間： 2022年07月   記述言語：日本語  

開催期間： 2022年03月   記述言語：日本語  

開催期間： 2022年03月   記述言語：日本語  

開催期間： 2021年09月   記述言語：日本語  

開催期間： 2021年07月   記述言語：日本語  

開催期間： 2021年03月   記述言語：日本語  

開催期間： 2020年03月   記述言語：英語  

開催期間： 2020年03月   記述言語：日本語  

開催期間： 2019年11月21日 - 2019年11月22日   記述言語：日本語  

開催期間： 2019年11月21日 - 2019年11月22日   記述言語：日本語  

開催期間： 2019年03月   記述言語：日本語  

開催期間： 2019年03月   記述言語：日本語  

開催期間： 2019年03月   記述言語：日本語  

開催期間： 2019年03月   記述言語：日本語  

開催期間： 2017年10月   記述言語：日本語  

開催期間： 2017年09月   記述言語：日本語  

開催期間： 2016年09月   記述言語：日本語  

開催期間： 2016年09月   記述言語：日本語  

開催期間： 2016年07月   記述言語：日本語  

開催期間： 2016年07月   記述言語：日本語  

開催期間： 2016年04月   記述言語：日本語  

開催期間： 2015年10月   記述言語：英語  

開催期間： 2015年09月   記述言語：日本語  

開催期間： 2015年06月   記述言語：日本語  

開催期間： 2014年09月   記述言語：日本語  

開催期間： 2014年09月   記述言語：日本語  

開催期間： 2014年08月   記述言語：日本語  

開催期間： 2013年09月   記述言語：日本語  

開催期間： 2012年09月   記述言語：日本語  

開催期間： 2012年05月   記述言語：英語