Kitsutaro Amano

Learn More
SUMMARY In this paper we present a distributed routing protocol for finding two node-disjoint paths between each pair of nodes in a computer network. In the proposed protocol, each node in the network has the same procedure, which is driven by local information with respect to the network topology, such as adjacent nodes on a spanning tree in the network.(More)
Multic ast com m unic atio n servic es will be one of the m ost prom isin g future applic atio ns, w hic h i n clu de real-tim e ow s, inbo th the B-ISDN and the Internet. D esig n of suc h multic ast routin g proto cols is c om ple x and dic ult due to com plic ated requirem en ts. The proto col is d ened to be fa ult-tole ran t i f m essages can be(More)
There always exist limitations on computer capability. For real-time shared three dimensional systems, it is essential to nd important tasks for users among all possible tasks to walk through and interact with 3D CG (Computer Graphics) spaces. Incorporating live videos, as components of virtual spaces, into 3D CG spaces is one of the heaviest tasks. In(More)