Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Reliability, IEEE Transactions on

Issue 4 • Date Oct 1991

Filter Results

Displaying Results 1 - 9 of 9
  • Fault tolerant packet-switched network design and its sensitivity

    Publication Year: 1991 , Page(s): 452 - 460
    Cited by:  Papers (10)  |  Patents (2)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (652 KB)  

    Reliability and performance for telecommunication networks have traditionally been investigated separately in spite of their close relation. A design method integrating them for a reliable packet switched network, called a proofing method, is presented. Two heuristic design approaches (max-average, max-delay-link) for optimizing network cost in the proofing method are described. To verify their effectiveness and applicability, they are compared numerically for three example network topologies. The sensitivity of these two methods is examined with respect to changes in traffic demand and in link reliability. The design sensitivity to variation of input data is examined by changing the predicted probability of link failure, and by increasing the network traffic over the predicted value. The resulting analysis shows relative insensitivity of solutions generated by the two design methods to input data View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliability enhancement by time and space redundancy in multistage interconnection networks

    Publication Year: 1991 , Page(s): 461 - 473
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1004 KB)  

    The authors present the dynamic full access (DFA) properties of fault tolerant multistage interconnection networks (MINs) which have multiple connections to the inputs and outputs, and thus potentially no hardcore. When full access is lost due to multiple faults, but DFA exists, multiple pass routing could be utilized to achieve graceful degradation. Some efficiency conditions for the existence of DFA in a broad class of fault tolerant MINs are derived. The reliability of four multiple path MINs under DFA is studied. The metrics used are the probability of existence of DFA and the mean time to failure. One particular network (the MD-Omega), which uses a minimum amount of hardware redundancy to provide two connections from each source to the MIN and to each destination from the MIN, shows the most gain in reliability when time redundancy is used. The MD-Omega network has a 2×2 switch as its basic element, but is almost as reliable as another fault tolerant MIN, the ASEN, which uses a 3×3 element, when multiple pass routing is used View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using a software reliability model to design a telecommunications software architecture

    Publication Year: 1991 , Page(s): 488 - 494
    Cited by:  Papers (7)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (568 KB)  

    The author proposes a software reliability model for a large real-time telecommunications software architecture. Some simple examples of the critical components of the software architecture and their dependencies are described. The component dependencies permit the propagation of faults from the component in which the fault originates to the other components. This propagation can cause failures in the chain (or in the tree) of components. Detection and failures depends on the tests executed or on the number and type of customer requests. An error can occur in any component. This error can be caused by a fault that propagated from another component or it can be a fault that originates in that component. The error can be traced through the component-dependency chain (or tree) to repair all the faults that are associated with that error. The software reliability model guides the design of the software architecture View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconfigurable fault tolerant networks for fast packet switching

    Publication Year: 1991 , Page(s): 474 - 487
    Cited by:  Papers (2)  |  Patents (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1028 KB)  

    The authors consider the design and analysis of reconfigurable networks for fast packet switching. The design constraints resulting from the use of fast packet switching that affect fault-tolerant network design are carefully studied. A reconfigurable network with high link redundancy is then proposed. An abstract replacement model that characterizes the proposed reconfigurable network is presented. Network fault tolerance problems are transformed into well known assignment problems. Two practical designs based on feasible technology are presented. An appreciable reliability improvements is achieved and full bandwidth is maintained up to a tolerable level of failures, with relatively few spare switches View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multi-period design model for survivable network architecture selection for SONET interoffice networks

    Publication Year: 1991 , Page(s): 417 - 427
    Cited by:  Papers (6)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (880 KB)  

    The authors propose a multi-period design model to select a best mix of SONET survivable network architectures. These include: (1) point-to-point/hubbing architectures with diverse protection and (2) ring architectures. The algorithm can be used to study growth strategies, for networks incorporating the ring architecture, that minimize the network evolution cost. Numerical examples show that the algorithm can generate a good solution quickly, using a VAX 6000-420 computer for most practical applications. A case study suggests that a particular well accepted engineering rule can work well. This engineering rule is: use direct point-to-point systems in conjunction with self-heating rings and hubbing/diverse protection architectures only when a few demand pairs have appreciably higher demand requirements than other demand pairs. When demand is fairly even, then use self-healing rings or hubbing/diverse protection without direct point-to-point systems View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A computer approach for reliability evaluation of telecommunication networks with heterogeneous link-capacities

    Publication Year: 1991 , Page(s): 441 - 451
    Cited by:  Papers (19)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (868 KB)  

    The authors present a computer approach to obtaining a survivability index called capacity related reliability (CRR) in large telecommunication networks where links have different capacities. The method is a two-step approach. The first step deals with composite path enumeration (CPE). A k-composite path is defined as the union of the set of edges in any k simple paths and relates link capacity and network connectivity. The CPE approach is an improvement over the algorithms proposed by the authors earlier (1991). In step two, k-composite paths information is manipulated to generate the CRR. The authors use CAREL (computer aided reliability evaluator) to solve this step. The technique is automated using C on the Encore Multimax System. The results on CRR for three networks with various values of minimum message capacity are presented. An exhaustive technique is used to verify these results. An informal proof of the CPE approach is also included View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design of survivable communications networks under performance constraints

    Publication Year: 1991 , Page(s): 433 - 440
    Cited by:  Papers (20)  |  Patents (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (652 KB)  

    The authors describe a network design algorithm that uses a set of deterministic connectivity measures which result in topologically survivable network designs that also meet processing and performance requirements. The authors briefly describe some applicable graph theoretic concepts and recently developed connectivity measures. They describe systematic procedures for improving the topological survivability of a network, and the overall network design process. A design example is presented View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using distributed topology update and preplanned configurations to achieve trunk network survivability

    Publication Year: 1991 , Page(s): 404 - 416, 427
    Cited by:  Papers (29)  |  Patents (31)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (1316 KB)  

    The authors present a new approach for trunk network survivability. This modular approach is intended for a telephone trunk network consisting of high-bandwidth fiber-optic links connected through reconfigurable digital cross-connect nodes. It works for both node and link failures. This approach comprises a distributed protocol with two parts. First, the surviving digital cross-connect nodes are caused to converge to an agreement on the topology (i.e., what is up and what is down). Second, based on the agreed topology and on a precomputed plan for that topology, the digital cross-connect nodes are reconfigured to restore as much call-carrying capacity as possible. The modularity of this approach comes from separating the problem of devising a distributed fault-tolerant protocol to determine what the failure is from the problem of designing a network reconfiguration for that failure View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An algorithm for designing rings for survivable fiber networks

    Publication Year: 1991 , Page(s): 428 - 432
    Cited by:  Papers (22)  |  Patents (5)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (404 KB)  

    The authors present an algorithm for routing fiber around a ring in a network, when the network nodes, links, connectivity, and which offices are to be used on that ring together are known. The algorithm aids automated survivable network planning. The algorithm was programmed in C, and run on a SPARC-station. Under certain conditions, the problem degenerates to the traveling salesman problem, and the ring routing algorithm degenerates to the nearest neighbor method of solving that problem View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IEEE Transactions on Reliability is concerned with the problems involved in attaining reliability, maintaining it through the life of the system or device, and measuring it.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Way Kuo
City University of Hong Kong