Browsing by Author "JAN, RH"

Now showing 1 - 9 of 9

CSMA/CD PROTOCOL FOR TIME-CONSTRAINED COMMUNICATION ON BUS NETWORKS
(1993-06-01)
JAN, RH
;
YEH, YJ
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
A multiple access protocol for transmitting time-constrained packets on bus networks is presented. Based on carrier sense multiple access/collision detection (CSMA/CD) protocol, a new protocol is developed and its performance evaluated by computer simulation. An approximate analysis model for this protocol is also presented. Numerical results indicate that the new protocol achieves a better performance, and the approximate analysis model is also effective.
DESIGN OF RELIABLE NETWORKS
(1993-01-01)
JAN, RH
;
資訊工程學系
;
Department of Computer Science
In many applications, the network designer may want to know how to synthesize a reliable network. Assume that a network, denoted as G(n,e), has the number of nodes n and the number of edges e, and the operational probability of each edge is known. The system reliability of the network is defined to be the probability that every pair of nodes can communicate with each other. A network synthesis problem considered in this paper is to find a network G(n,e)* that maximizes system reliability over the class of all networks having n nodes and e edges. We find the optimal networks for the classes of networks G(n,n-1), G(n,n) and G(n,n+1), respectively. In addition, an upper bound of maximum reliability for the networks with n nodes and e edges (e greater-than-or-equal-to n + 2) is derived in terms of node degrees. Computational experiments for the reliability upper bound are also presented. The results show that the proposed reliability upper bound is effective.
FINDING THE MOST VITAL EDGE WITH RESPECT TO MINIMUM SPANNING TREE IN WEIGHTED GRAPHS
(1991-09-13)
HSU, LH
;
JAN, RH
;
LEE, YC
;
HUNG, CN
;
CHERN, MS
NONLINEAR INTEGER BILEVEL PROGRAMMING
(1994-02-10)
JAN, RH
;
CHERN, MS
;
資訊工程學系
;
Department of Computer Science
In many decentralized organizations, resource planning with sequential decision making can be formulated as a multi-level programming problem. In such cases, the decision variables are partitioned among the decision makers. Each of the decision makers optimizes his/her own objective function. This paper presents an algorithm using parametric analysis to solve a typical kind of nonlinear integer multilevel programming problems, called separable integer monotone bilevel programming (SIMBP), and then extends the algorithm for solving a parametric SIMBP problem. A numerical example with application of reliability optimization is given to illustrate the solution method.
PARAMETRIC NONLINEAR INTEGER PROGRAMMING - THE RIGHT-HAND SIDE CASE
(1991-09-25)
CHERN, MS
;
JAN, RH
;
CHERN, RJ
;
資訊工程學系
;
Department of Computer Science
In this paper, we present algorithms for solving families of nonlinear integer programming problems in which the problems are related by having identical objective coefficients and constraint matrix coefficients. We consider two types of right-hand sides which have the forms b(l) and b(i) + theta-i(d)i where {b(l)}l = 1,...,L is a given set of vectors, b(i) + theta-i(d)i is a parametric function and the parameter theta-i varies from zero to one. The approach consists primarily of solving the most relaxed problem using branch and search method and then finding the optimal solutions of the proposed parametric programming problems. The application of this methodology to a parametric chance-constrained problem is illustrated with applications in system reliability optimization problems.
RELIABILITY-ANALYSIS OF A SIMPLE REPLICATED AND-FORK AND-JOIN GRAPH
(1994-08-01)
LIANG, DR
;
JAN, RH
;
資訊工程學系
;
Department of Computer Science
In this paper, we consider the problem of calculating the reliability of the replicated and-fork/and-join (RAFAJ) task graphs. An RAFAJ task graph is generated from an AFAJ task graph with vertex and arc replications. Due to the AFAJ constraint, the task graphs considered in our problem are more general than those considered in the network reliability problem, which is an NP-complete problem for general task graphs. In this paper, we propose an algorithm with time complexity O(n . 2(2r)); where n is numbere of concurrent tasks, and r is the number of replications.
SYSTEM RELIABILITY-DESIGN WITH DETERIORATIVE COMPONENTS
(1988)
JAN, RH
;
CHERN, MS
;
資訊工程學系
;
Department of Computer Science
THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES IN 2-TERMINAL SERIES-PARALLEL GRAPHS
(1992)
JAN, RH
;
HSU, LH
;
LEE, YY
;
資訊工程學系
;
Department of Computer Science
A set E' of k edges in a multigraph G = (V, E) is said to be a k most vital edge set (k-MVE set) if these edges being removed from G, the resultant graph G' = (V,E - E') has minimum number of spanning trees. The problem of finding a k-MVE set for two-terminal series-parallel graphs is considered in this paper. We present an O(Absolute value of E) time algorithm for the case k = 1, and an O(Absolute value of V(k) + Absolute value of E) time algorithm for arbitrary k.
TOPOLOGICAL OPTIMIZATION OF A COMMUNICATION-NETWORK SUBJECT TO A RELIABILITY CONSTRAINT
(1993-03-01)
JAN, RH
;
HWANG, FJ
;
CHENG, ST
;
資訊工程學系
;
Department of Computer Science
This paper considers network topological optimization with a reliability constraint. The objective is to find the topological layout of links, at a minimal cost, under the constraint that the network reliability is not less than a given level of system reliability. A decomposition method, based on branch & bound, is used for solving the problem. In order to speed-up the procedure, an upper bound on system reliability in terms of node degrees is applied. A numerical example illustrates, and shows the effectiveness of the method. If a*, an important parameter, is close to the minimal number of links in a network which satisfy the reliability constraint, then a better starting solution can be obtained, and many searching steps can be saved. In our method, the lower bound a* is close to its actual value if the operational reliability of the link is close enough to 1. Also, if we can find the maximal increasing value of the reliability when a set of links is added to a specified topology, the efficiency of the branch & bound algorithm is improved.