Abstract: This invention is to provide a technique enabling efficient routing in the entire network by totally viewing a state of the entire network from a specific server. An information processing method for managing paths between arbitrary nodes in a specific network according to the invention, includes: obtaining data concerning a utilization state of each link constituting a path, from associated nodes in the specific network; and calculating a value of dynamic transmission bandwidth in an entire path by using the data concerning the utilization state of each link constituting the path, and storing the calculated value into a management data storage. By the dynamic transmission bandwidth, that is, bandwidth, which can actually be used for communication to be carried out from now, it becomes possible to carry out efficient routing.

Abstract: This invention is to enable inter-domain routing using MPLS. When communication is carried out passing through plural domains, respective management servers managing respective domains cooperate to carry out path constitution and optimum routing. At the path constitution, the respective management servers connect links within the respective controlling domain to constitute paths to reach a target address. When the paths are constituted, label data is notified to nodes associated with the constituted paths, and is used at the routing. At the routing, the management server controlling the source domain obtains the dynamic transmission bandwidths from the respective management servers, and identifies the routing policy from a port number of a request to be routed or the like to identify the optimum path. When the optimum path is determined, it is possible to carry out the routing using the label data held in the respective nodes.

Abstract: This invention is to enable inter-domain routing using MPLS. When communication is carried out passing through plural domains, respective management servers managing respective domains cooperate to carry out path constitution and optimum routing. At the path constitution, the respective management servers connect links within the respective controlling domain to constitute paths to reach a target address. When the paths are constituted, label data is notified to nodes associated with the constituted paths, and isused at the routing. At the routing, the management server controlling the source domain obtains the dynamic transmission bandwidths from the respective management servers, and identifies the routing policy from a port number of a request to be routed or the like to identify the optimum path. When the optimum path is determined, it is possible to carry out the routing using the label data held in the respective nodes.

Abstract: This invention is to provide a technique enabling efficient routing in the entire network by totally viewing a state of the entire network from a specific server. An information processing method for managing paths between arbitrary nodes in a specific network according to the invention, includes: obtaining data concerning a utilization state of each link constituting a path, from associated nodes in the specific network; and calculating a value of dynamic transmission bandwidth in an entire path by using the data concerning the utilization state of each link constituting the path, and storing the calculated value into a management data storage. By the dynamic transmission bandwidth, that is, bandwidth, which can actually be used for communication to be carried out from now, it becomes possible to carry out efficient routing.

Abstract: A selective reception communication system operates to prevent a double data reception from occurring owing to the difference between times at which data are transmitted over transmission paths when switching is effected from one transmission path to another due to a transmission path or node fault. Frame data transmission delay times required for data to reach a destination node over the transmission paths are established in every predetermined period of time. For data communication between nodes, frame data transmitted over the transmission path are given time delays corresponding to the differences between the established frame data transmission delay times and the longest one of the frame data transmission delay times. The frame data which have been transmitted over the different transmission paths now arrive simultaneously at the destination node where switching is made between the transmission paths.