IEICE Trans

Keyword : network reliability

Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy Atsushi TANIGUCHI Takeru INOUE Kohei MIZUNO Takashi KURIMOTO Atsuko TAKEFUSA Shigeo URUSHIDANI
Publication: Publication Date: 2020/04/01 Vol. E103-B No. 4 ; pp. 440-451 Type of Manuscript: PAPER Category: Network Management/Operation Keyword: network reliability, social sustainability, inter-domain networks, graph theory,
	Summary \| Full Text:PDF(2MB)

Probabilistic Analysis of the Network Reliability Problem on Random Graph Ensembles Akiyuki YANO Tadashi WADAYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/12/01 Vol. E99-A No. 12 ; pp. 2218-2225 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Networks and Network Coding Keyword: random graph, network reliability, connectivity, LDGM codes,
	Summary \| Full Text:PDF(356.1KB)

Analyzing and Utilizing the Collaboration Structure for Reliable Router-Level Networks Yu NAKATA Shin'ichi ARAKAWA Masayuki MURATA
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2012/06/01 Vol. E95-B No. 6 ; pp. 2013-2021 Type of Manuscript: PAPER Category: Network Keyword: network reliability, transcriptional regulatory network, router-level topology, collaboration structure, power-law network,
	Summary \| Full Text:PDF(1.6MB)

Drouting Architecture: Improvement of Failure Avoidance Capability Using Multipath Routing Yasuhiro OHARA Hiroyuki KUSUMOTO Osamu NAKAMURA Jun MURAI
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2008/05/01 Vol. E91-B No. 5 ; pp. 1403-1415 Type of Manuscript: PAPER Category: Network Keyword: multipath routing architecture, network reliability, failure avoidance,
	Summary \| Full Text:PDF(947.2KB)

An Optimal Parallel Algorithm for Finding All Hinge Vertices of a Circular-Arc Graph Hirotoshi HONMA Shigeru MASUYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/01/01 Vol. E91-A No. 1 ; pp. 383-391 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: parallel algorithms, circular-arc graphs, hinge vertices, network reliability,
	Summary \| Full Text:PDF(390.2KB)

Estimating the Performance of a Large Enterprise Network for Updating Routing Information Yukio OGAWA Teruhiro HIRATA Kouji TAKAMURA Keiichi YAMAHA Satomu SAITOU Kouichi IWANAGA Tsutomu KOITA
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2005/05/01 Vol. E88-B No. 5 ; pp. 2054-2061 Type of Manuscript: PAPER Category: Network Management/Operation Keyword: enterprise networking, scalability, routing convergence, EIGRP, network reliability,
	Summary \| Full Text:PDF(768.5KB)

A Parallel Algorithm for Finding All Hinge Vertices of a Trapezoid Graph Hirotoshi HONMA Shigeru MASUYAMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2002/05/01 Vol. E85-A No. 5 ; pp. 1031-1040 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: parallel algorithm, trapezoid graphs, hinge vertices, network reliability,
	Summary \| Full Text:PDF(688KB)

Parallelizing SDP (Sum of Disjoint Products) Algorithms for Fast Reliability Analysis Tatsuhiro TSUCHIYA Tomoya KAJIKAWA Tohru KIKUNO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/05/25 Vol. E83-D No. 5 ; pp. 1183-1186 Type of Manuscript: LETTER Category: Fault Tolerance Keyword: network reliability, networks of workstations, dependability evaluation, parallel processing, coherent systems,
	Summary \| Full Text:PDF(187.9KB)

Computing the Invariant Polynomials of Graphs, Networks and Matroids Hiroshi IMAI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2000/03/25 Vol. E83-D No. 3 ; pp. 330-343 Type of Manuscript: INVITED SURVEY PAPER Category: Algorithms for Matroids and Related Discrete Systems Keyword: Tutte polynomial, matroid, simplicial complex, network reliability, BDD,
	Summary \| Full Text:PDF(513.5KB)

The Evaluations on Lower Bounds of All-Terminal Reliability by Arc-Packings for General Networks Takeshi KOIDE Shuichi SHINMORI Hiroaki ISHII
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/05/25 Vol. E82-A No. 5 ; pp. 784-791 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: probabilistic graph, network reliability, arc-packing, acyclic graph, lower bound,
	Summary \| Full Text:PDF(847.2KB)

Computational Investigations of All-Terminal Network Reliability via BDDs Hiroshi IMAI Kyoko SEKINE Keiko IMAI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/05/25 Vol. E82-A No. 5 ; pp. 714-721 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: network reliability, BDD, output-size sensitive, #P-complete,
	Summary \| Full Text:PDF(586.3KB)

Network Design for Simultaneous Traffic Flow Requirements Yiu Kwok THAM
Publication: IEICE TRANSACTIONS on Communications Publication Date: 1997/06/25 Vol. E80-B No. 6 ; pp. 930-938 Type of Manuscript: PAPER Category: Communication Networks and Services Keyword: network optimization methods, network configuration/control techniques, graph/network theory, network reliability, demand uncertainty,
	Summary \| Full Text:PDF(722.3KB)

Graph Rewriting Systems and Their Application to Network Reliability Analysis Yasuyoshi OKADA Masahiro HAYASHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/02/25 Vol. E76-D No. 2 ; pp. 154-162 Type of Manuscript: PAPER Category: Automaton, Language and Theory of Computing Keyword: graph rewriting systems, critical pair lemma, complete systems, reduction methods, network reliability,
	Summary \| Full Text:PDF(685.3KB)