Fujitsu Corporation

Hitachi, Ltd.

Nec Corporation

Nippon Telegraph and Telephone Corporation

Konishiroku Photo Industry Co., Ltd.

Takafumi Chujo

Takao Ogura

Keiji Miyazaki

Shigeo Amemiya

Takeo Hamada

Hiroaki Komine

Kohei Iseda

Tetsuo Soejima

Mitsuhiro Azuma

Koji Tezuka

Yasuki Fujii

Yasuyuki Sato

Yoshihiro Ashi

Yukio Nakano

Akihiko Takase

Naoaki Yamanaka

Hitoshi Ueno

Kenichi Fukuda

Norio Murakami

Hiromi Ueda

Michio Kusayanagi

Yoichi Sato

Kazuo Murano

Ryuichi Ikematsu

Takatoshi Kurano

Toshitaka Tsuda

Hiroshi Takeo

Michinobu Ohhata

Masao Yamasawa

Kazuo Yamaguchi

Masayuki Takahashi

Shigeo Shinada

Kenji Akutsu

Kiyoshi Saitou

Masaaki Ueki

Motohide Takahashi

Toshihiko Matsumura

Mituhiro Takano

Kazuhiko Hohara

Tetuhiro Okabe

A method of generating access-control lists executable by a system and derived from access-control rules supplied for insuring security of an operation system is presented. The method includes the steps of inputting access-manager-type-group information, access-target-type-group information, and organizational-structure information, inputting access-control rules each comprised of an access-manager type, an access-target type, and an action in order to represent security guidelines of the system, inputting constraint conditions relating to the organizational structure of the system, extracting access managers and access targets from the access-manager-type-group information and the access-target-type-group information, respectively, with respect to the access-manager type and the access-target type included in each of the access-control rules, checking the constraint conditions with regard to all the combinations between the extracted access managers and the extracted access targets, and generating access-control lists comprised of such an access manager, an access target, and an action as to satisfy the constraint conditions.

Method and device for generating access-control lists

A communication network comprised of communication paths of server layers formed hierarchically by communication paths of client layers, wherein the state of control of the communication paths of a layer being controlled is independently managed in terms of both (i) an administrative state and (ii) a subordinate state indicating influence from communication paths of a server layer, the administrative state of the communication paths of the layer being controlled is changed according to the control for setting and releasing the communication paths, and the subordinate state of the communication paths of a client layer influenced by the change of the administrative state of the communication paths is changed accordingly. At this time, when a subordinate state has already been influenced by a state of control of the communication paths of a server layer, the processing for management is terminated.

Method for controlling communication paths and communication control system in communication network

A detour path determination method wherein each node on a determined detour path stores in advance first and second nodes upstream of each node as well as an identifier(s) of a packet directional path(s); a number of an identifier(s) of a packet directional path(s) required for switching in each link extending from a downstream node one node downstream of each node on the detour path are set for respective nodes on the detour path beginning from the terminal node upstream; the identifier(s) of the packet directional path(s) set as above, and an identifier(s) of a corresponding packet directional path(s) at a start node of the detour path, are sent to a node one node upstream of the above each node; the start node updates a identification data table at the node, by an identifier(s) of a packet directional path(s) set downstream of the start node based on the corresponding identifier(s) of packet directional path(s) at a start node of the detour path, when the start node receives the above identifier(s) (FIG. 1).

Detour path determination method

A dynamic database structuring method includes the steps of (a) clustering transition probabilities among transactions by on-line, (b) forming a hyper graph representing the transition probabilities of the transactions clustered in the step (a) using weighting, (c) partitioning the hyper graph to obtain clustering information related to objects or records to be stored in a storage, and (d) reorganizing a database by rearranging data in the storage by on-line using the clustering information obtained in the step (c), thereby restructuring the database dynamically.

Dynamic database structuring method and apparatus, and database

A method of controlling a telecommunication network management is disclosed. By the method, a managing subject of a telecommunication network carries out a management sequence for management information of the telecommunication network in an agent subject. The method comprises the steps of (a) locating a cache storing the management information in the managing subject; and (b) partitioning attributes of the management information into attribute classes corresponding to demands for cache coherency. In the method, the managing subject carries out the management sequence with a higher speed by accessing the cache, and manages the cache for each attribute class efficiently.

Communication network management apparatus using a cache arranged as a

A path switching system and method for a multiple-node ATM network, in which a plurality of paths can be simultaneously switched preserving proper correspondence thereof. A key choosing unit provided in a node chooses first and second sorting keys out of the virtual paths between the nodes, based on a first and second path information stored in a path information memory unit. Two nodes located at both ends of the route failed due to trouble in the ATM network select a first pair of isolated virtual paths having the first sorting key, which were formerly connected to the failed route, and connect them to a first bypass route. The two nodes then connect in a similar way a second pair of isolated virtual paths both having the second sorting key to a second bypass route.

Path switching system and method

Method and apparatus for control in ATM

A cell loss ratio calculating method is a method of calculating a cell loss ratio of a buffer for storing call cells from a plurality of traffic sources and comprises a distribution expressing step, a number-of-average-arrivals expressing step, an average path calculating step and a cell loss ratio calculating step. In the distribution expressing step, a distribution of the number of cells accumulated within a time for which the cell passes the buffer is expressed by use of a Poisson distribution on an assured side. In the number-of-average-arrivals expressing step, the number-of-cells distribution is expressed with parameters representing a number of average arrivals of the Poisson distribution. In average path calculating step, an average path is calculated with respect to time-variations of a cell arrival ratio and a distribution of the cell arrival ratio. In the cell loss ratio calculating step, the cell loss ratio of the buffer is calculated by using a result of the calculation in the average path calculating step as well as by using a table for storing a precalculated value of a number-of-lost-cells expected value corresponding to each number of average arrivals.

Method of calculating cell loss ratio and call accept controller using

A communication system using a network route establishing technique for a network having a plurality of nodes connected through links, in which a route search message is delivered simultaneously in a plurality of directions from a sender node through a network route to a destination node, and a confirmation is delivered from the destination through the network route back to the sender node, and accordingly, a network route is established. The communication system includes a device for detecting, at a node through which a search message is to be transmitted, a possibility of a transmission of the search message beyond the node, a device for delivering a cancel message in the direction from which the search message has been transmitted, and a device for releasing the network route engaged by the search message, based on the delivered cancel message.

Communication system using establishing network route

A probability transition matrix S.sub.t is formulated that expresses a multiplexing process which includes nested threshold priority control and classified priority control. A state equation using the matrix S.sub.t is solved by substituting therein upper and lower bounds of a probability distribution of a cell arrival count a.sub.t in an average time series, to calculate a probability distribution of a cell length in a buffer. From the thus calculated cell length probability distribution, the QOS is evaluated on a priority class basis. Based on the QOS evaluation, optimization of call admission control and priority control is accomplished.

Method and apparatus for evaluating QOS in ATM multiplexing apparatus in

A packet directional path identifier transfer system contains on the transmission side thereof, a means 2 of converting packet directional path identifier data into bit map information in which an address of each bit corresponds to a packet directional path identifier. The system contains on the reception side thereof, a means 5 for inversely converting the bit map information of the packet directional path identifier data to the packet directional path identifier data. Otherwise, the system further contains on the transmission side thereof, means 8 and 10 for determining the top and bottom values of the packet directional path identifier data to be transmitted, and a means 9 for converting the packet directional path identifier data between the top and bottom values into bit map information, and at the reception side thereof, a means 13 for inversely converting into the initial packet directional path identifier data the bit map information of the packet directional path identifier between the top and bottom values. Further, the top value of the identifier(s) of the newly-set packet directional path(s) determined from the non-used packet directional path identifier(s) in the outgoing packet directional path of the transmission-side node and the number of the newly-set packet directional path identifier(s) are transmitted, and a reference is made to the incoming packet directional path identifier table at the reception-side node to recognize the newly-set packet directional path(s) based on the information received. (FIGS. 1 and 2.)

Packet directional path identifier transfer system

A method for restoring a communication failure in a network comprises the steps of providing a predetermined order for selection of the links included in the network, searching for an alternative communication path upon a failure in communication occurring in the network, producing, at a first arbitrary node included in the alternative communication path, a first path setup message containing at least information about the number of the paths to be selected in a first link extending from the first node for setting up the alternative communication path, and an identification code of the path that is to be selected at first in the first link for establishing the alternative communication path, transmitting the first path setup message to a second node also included in the alternative communication path and connected to the first node by a second link, for affecting a setup of the connection therein. The second node selects paths with the number specified by the path setup message according to said predetermined order of selection and affects a connection to the paths in the first link according to the order of selection.

Distributed control of telecommunication network for setting up an

A system for searching for alternative routes in a network at the time of a failure in a node or link which executes a stage for initiation of failure restoration processing which starts up failure restoration processing in accordance with various types of messages when a failure occurs at a link or node, a stage for processing a restoration message for searching for an alternative route, a stage for processing an acknowledgment message for reserving an alternative route, a stage for processing a cancellation message for cancelling reservation of an alternative route, a stage for processing a confirmation message for confirming a reserved alternative route and making a switching of cross-connect equipment, a stage for processing a cross-connection completion message for notifying the completion of switching of the cross-connect equipment to the nodes, a stage for processing a cross-connection acknowledgment message for confirming the completion of switching of all of the cross-connect equipment on the alternative route, and a stage for processing a cross-connection confirmation message for performing processing to complete the search for an alternative route and which thereby searches for alternative routes autonomously in a distributed manner.

Searching system for determining alternative routes during failure in a

A UPC circuit fault diagnosis system for diagnosing a failure in a UPC circuit controls cell traffic volume on the basis of prescribed information about cell traffic. Failure diagnosis of a UPC circuit is provided by a usage parameter determination of at least one kind of cell, using more than one system and comparing determination results. The diagnosis system has an operating UPC circuit for controlling a total of m kinds of cells, and a standby UPC circuit for controlling a total of n kinds of cells. The system also has a total of q bridge memories for keeping a chronological record of the prescribed information of arriving cells. A fault diagnosis of the bridge memories is provided by comparing the contents of the bridge memories, using more than one system.

Trouble diagnosis system of UPC circuit

A method for structuring a communications network based on an asynchronous transfer mode in which communications are held with the use of cells transferred between a node on the upstream side and a node on the downstream side. The method for structuring the network includes a step for preparing a plurality of VPI conversion tables for converting VPIs of the cell input under normal communicating conditions and that of the cell input in the event of a failure and outputting the cell with the VPI converted. The prepared VPI conversion tables are reorganized for each node and the reorganized VPI conversion tables are distributed to all nodes. Then, an alternate route monitoring and switching virtual path is set up in each alternate route and a monitoring cell is periodically transmitted along the alternate route. When a failure occurs, the VPI conversion table is switched over according to the pattern of the failure and the input VPI is converted in accordance with the switched VPI conversion table, and thereby, an alternate virtual path is set up in the relevant alternate route.

Method for structuring communications network based on asynchronous

Growing community of inventors

Kawasaki, Japan

Takafumi Chujo