Optimal capacity placement for path restoration in STM or ATMmesh-survivable networks

The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long-haul networks. Previously, the spare capacity of a network with a given set of working span sizes has been optimized to facilitate span restoration. Path restorable networks can, however, be even more efficient by defining the restoration problem from an end to end rerouting viewpoint. We provide a method for capacity optimization of path restorable networks which is applicable to both synchronous transfer mode (STM) and asynchronous transfer mode (ATM) virtual path (VP)-based restoration. Lower bounds on spare capacity requirements in span and path restorable networks are first compared, followed by an integer program formulation based on flow constraints which solves the spare and/or working capacity placement problem in either span or path restorable networks. The benefits of path and span restoration, and of jointly optimizing working path routing and spare capacity placement, are then analyzed     

Fast restoration of ATM networks

Asynchronous transfer mode (ATM) is now well recognized as the fundamental switching and multiplexing technique for future broadband ISDN. As these networks will be increasingly relied upon for providing a multitude of integrated voice, data, and video services, network reliability is a key concern. There are several intrinsic features of ATM networks that could potentially be exploited to provide improved restoration techniques, beyond those established for synchronous transfer mode (STM) networks, such as digital cross-connect restoration or self-healing rings. These features include ATM cell level error detection, inherent rate adaptation and nonhierarchical multiplexing. The authors explore the use of these features in developing fast restoration strategies for ATM networks. In particular, they address: (1) ATM error detection capabilities for enhanced failure detection, (2) network rerouting strategies, (3) spare capacity allocation, and (4) network control architecture and related implementation aspects. Their findings suggest that fast network span failure detection and bandwidth-efficient rerouting capabilities can be combined to develop restoration strategies for ATM networks with significantly greater performance-cost ratios when compared to existing STM network restoration strategies     

Self-healing ATM networks based on virtual path concept

This paper proposes self-healing network techniques suitable for ATM networks in order to realize a high-reliablity B-ISDN. First, the characteristics of the virtual paths (VP) and their influence on failure restoration are discussed. A high-speed restoration technique which exploits the benefits of the VP is then proposed and described. The technique simplifies the message transmission processes and reduces the number of generated messages by using preassigned backup virtual paths. Next, the scheme used to design the backup VP routes and spare resource distribution for each link is proposed in order to create a network that applies the proposed restoration scheme. Next, self-reconstruction techniques of backup virtual paths are proposed for the realization of a reversionless restoration cycle. Finally, the feasibility of the distributed control operation is discussed     

Preplanned rerouting optimization and dynamic path rerouting for ATM VP restoration

The survivability for ATM based B‐ISDN has become an important challenge for telecommunication network planners and engineers. In this paper, we consider multiple grades of reliability concept and a multilayer survivable network architecture for survivable ATM networks. We address two complementary ATM VP restoration schemes in this paper. First, we propose preplanned rerouting models and algorithms based on combinatorial optimization to prepare efficient backup VP configuration. We test two formulations and algorithms for this problem. Efficient column generation technique to solve linear programming relaxation and strong valid inequalities incorporating the branch‐and‐bound scheme are suitable to solve the problem to optimality within small time limits. Second, we propose a new dynamic VP path restoration scheme to restore nonprotected VPs by the preplanned rerouting. Our protocol has shown the advantage in restoration effectiveness comparing a well‐known protocol in computational simulation. We, finally, address the relationships between the suggested models of this paper and the expected results of our ongoing project. This revised version was published online in August 2006 with corrections to the Cover Date.     

Restoration message transfer mechanism and restorationcharacteristics of double-search self-healing ATM network

The self-healing network is particularly interesting with regard to ATM networks, because the restoration time can be shortened by using the advantages of the ATM network. This paper studies a self-healing ATM network based on virtual path (VP) protection switching. First, a novel self-healing algorithm-the double-search self-healing algorithm-is proposed. It is shown that this algorithm can restore failed bidirectional VPs faster and find alternate VPs more effectively than existing self-healing algorithms. Second, it is shown that the restoration information for self-healing control (SHC) messages must be transferred by specific cells carrying the control and OAM information (Ic&o). Message parameters and a cell format are proposed. Third, evaluation of the restoration characteristics using the proposed self-healing algorithm by computer simulation indicates that good performance against a transmission link failure is obtained even in a large-scale network model with 110 nodes. The results also indicate that the VP group (VPG) method can improve the restoration time without reducing the restoration ratio     

Restoration strategies and spare capacity requirements inself-healing ATM networks

This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The problem is formulated here as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the restoration strategies used in the network. We compare several restoration strategies quantitatively in terms of spare cost, notably: global versus failure-oriented reconfiguration, path versus link restoration, and state-dependent versus state-independent restoration. The advantages and disadvantages of various restoration strategies are also highlighted. Such comparisons provide useful guidance for real network design. Further, a new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration. Numerical results illustrate that the heuristic algorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment for tested examples     

A Virtual Private Local PCN Ring Network Based on ATM VP Cross—Connection

ＡＶｉｒｔｕａｌＰｒｉｖａｔｅＬｏｃａｌＰＣＮＲｉｎｇＮｅｔｗｏｒｋＢａｓｅｄｏｎＡＴＭＶＰＣｒｏｓｓ－ＣｏｎｎｅｃｔｉｏｎＬｉｕＢｉｎ；ＭａＹｉｎｇｊｕｎ；ＭｅｎｇＬｕｏｍｉｎｇ（ＢｅｉｊｉｎｇＵｎｉｖｅｒｓｉｔｙｏｆＰｏｓｔｓａｎｄＴｅｌｅｃｏｍ...     

Optimizing the system of virtual paths

The virtual path (VP) concept is known to be a powerful transport mechanism for ATM networks. This paper deals with the optimization of the virtual paths system from a bandwidth utilization perspective. While previous research on VP management has basically assumed that bandwidth in ATM networks is unlimited, emerging technologies and applications are changing this premise. In many networks, such as wireless, bandwidth is always at a premium. In wired networks, with increasing user access speeds, less than a dozen of broadband connections can saturate even a Gigabit link. We present an efficient algorithm that finds a system of VP routes for a given set of VP terminators and VP capacity demands. This solution is motivated by the need to minimize the load, or reduce congestion, generated by the VP's on individual links. A nontrivial performance guarantee is proven for the quality of the proposed solution and numerical results show that the proposed solution carries the potential for a near optimal allocation of VPs     

Hierarchical VP restoration management system for a reliable ATM backbone network

This paper proposes a distributed ATM VP PVC restoration framework with the dynamic rerouting schemes in a hierarchical transport network. The rerouting algorithm aims to provide rapid ATM VP PVC restoration in the case of fault or performance degradation in terms of maximization of network resource utilization and satisfaction of the end user's QoS requirement. Copyright © 2002 John Wiley & Sons, Ltd.     

Optimal capacity and flow assignment for self-healing ATM networksbased on line and end-to-end restoration

This paper addresses an optimal link capacity design problem for self-healing asynchronous transfer mode (ATM) networks based on two different restoration schemes: line restoration and end-to-end restoration. Given a projected traffic demand, capacity and flow assignment is jointly optimized to find an optimal capacity placement. The problem can be formulated as a large-scale linear programming. The basis matrix can be readily factorized into an LU form by taking advantage of its special structure, which results in a substantial reduction on the computation time of the revised simplex method. A row generation and deletion mechanism is developed to cope with the explosive number of constraints for the end-to-end restoration-based networks. In self-healing networks, end-to-end restoration schemes have been considered more advantageous than line restoration schemes because of a possible reduction of the redundant capacity to construct a fully restorable network. A comparative analysis is presented to clarify the benefit of end-to-end restoration schemes quantitatively in terms of the minimum resource installation cost. Several networks with diverse topological characteristics as well as multiple projected traffic demand patterns are employed in the experiments to see the effect of various network parameters. The results indicate that the network topology has a significant impact on the required resource installation cost for each restoration scheme. Contrary to a wide belief in the economic advantage of the end-to-end restoration scheme, this study reveals that the attainable gain could be marginal for a well-connected and/or unbalanced network     

Multiple-availability-level ATM network architecture

Because of their high flexibility, ATM networks have the potential to achieve two objectives: switch cost reduction and multi-level network availability. For that purpose, this article proposes to use virtual circuit (VC) route self-healing schemes to achieve a multiple-availability-level ATM network. Flexible multi-QoS logical ATM network (Full-Net), a new concept for ATM networks, is now being studied at NTT Laboratories. Full-Net is a very flexible network design strategy for survivable networks that is based on a self-healing VC network. Defining several logical configurations of the VC network allows us to support multiple levels of network availability, simplifies the adaptation to future and unknown service requirements, and significantly reduces overall ATM network cost. Offering different levels of availability not only saves the network's resources, but also allows the network operator to provide its customers with services at the most appropriate cost. We introduce the advantages of VC route restoration for ATM networks, and compare virtual path (VP) level and physical level restoration strategies. We explain Full-Net's concept, propose a VC route self-healing scheme, and show the impact of the logical network configurations on network survivability and resource management     

Architectural design and bandwidth demand analysis for multiparty videoconferencing on SONET/ATM rings

In this paper, we propose a scheme for implementing multiparty videoconferencing service on SONET/ATM rings. We focus on the architectural design and bandwidth demand analysis. Different multicasting methods on SONET/ATM rings are discussed and compared. A new multicast virtual path (VP) called "Multidrop VP" which is particularly suitable for SONET/ATM rings is proposed. An add-drop multiplexer (ADM) structure for rings capable of multidropping is also presented. Several VP assignment schemes are proposed and their bandwidth utilizations are compared.     

A new synchronous digital hierarchical Bi-directional ring capacity design algorithm based on the shortest-route traffic matrix

In this paper, the concept of the Shortest-Route Traffic Matrix(SRTM) was first presented, and the generalized formula for computing ring capacity requirement in use of SRTM is given. Then, a new capacity design algorithm which is based on SRTM was presented for Synchronous Digital Hierarchical(SDH) Bi-directional Self-Healing Ring (BSHR). The algorithm simulation results demonstrate that this algorithm is very efficient for SDH BSHR capacity design and can make less project investment and make high utilization of lines and equipment. By means of the algorithm in this paper, capacity optimization assignment for SDH Hierarchical Self-Healing Ring (HSHR) and for ATM Virtual Path (VP)-based Self-Healing Ring (SHR) is also discussed.     

Design of ATM Networks with Multiple Traffic Classes

In this paper, we propose a new heuristic design algorithm for the virtual path (VP)-based ATM network with multiple traffic classes, in which QoS constraints associated with traffic class are taken into account. The minimum bandwidth of VP required to carry given amount of traffic is obtained by utilizing an equivalent bandwidth concept, and the route of each VP is placed so that the network cost is minimized while the QoS requirement is fulfilled. To evaluate our design algorithm, we consider two kinds of traffic: voice traffic as low speed service and still picture traffic as high speed service. Through numerical examples, we demonstrate that our design method can achieve an efficient use of network resources, which results in providing a cost-effective VP-based ATM network.     

Architecture for restorable call allocation and fast VP restorationin mesh ATM networks

This paper presents an architecture for restorable call allocation and fast virtual path (VP) restoration in mesh ATM networks. In this architecture, virtual working and spare capacities needed for call allocation and restoration are reserved and released dynamically on a call-by-call basis at the time of call admission and termination. This obviates the need for advance assignment of spare and working capacities. To shorten the call processing delay, this is done in a parallel-distributed fashion. To provide restorable call allocation, parallel-distributed call processing algorithms of sender-chooser type are suggested. The algorithms integrate, on the call level, virtual bandwidth allocation, virtual spare-capacity assignment, and fixed, alternate, or state-dependent routing. Each routing scheme leads to a particular tradeoff between call processing complexity, call setup delay, and bandwidth efficiency. For each pair of nodes, two sets of VPs are provisioned. The first, working VP (WVP) set, is used for call allocation during the normal operation. The second, spare VP (SVP) set, is used for WVP restoration in the event of failures of network elements. Each SVP protects a preassigned subset of the node pair's WVPs. Each SVP is selected to be link/node disjoint from the WVPs that it is assigned to protect. This assures a protection of the WVP set by a small number of SVPs. Since SVPs are preset and appropriate virtual spare capacities are reserved in advance, the architecture guarantees full restorability and provides very fast restoration. The restoration is done on the VP level in a self-healing manner. The suggested architecture requires only local information to be maintained at each node     

STM／ATM业务链路资源共享策略及其性能分析

在ＳＤＨ向ＡＴＭ过渡的一个长时期内，要求ＳＤＨ能同时处理ＳＴＭ和ＡＴＭ业务，这些业务将共享ＳＤＨ链路资源，本文提出了固定边界和移动边界容量分配两种共享资源策略，对各自的性能作了理论分析，并介绍了计算机模拟结果，计算机模拟证实了分析的正确性。     

ATM in B-ISDN communication systems and VLSI realization

The Asynchronous Transfer Mode (ATM) is considered to be a key technology for B-ISDN. This paper discusses VLSI trends and how VLSI's can be applied to realize ATM switching node systems for B-ISDN. Implementing a practical ATM node system will require the development of technologies such as high-throughput ATM switch LSI's with up to 10 Gb/s capacity and SDH termination technology based on optical fiber transmission. An ATM traffic-handling mechanism with Quality of Service (QoS) controls such as ATM layer performance monitoring, virtual channel handling, usage parameter control, and VP shaping requires several hundred thousand logic gates and several megabytes of high-speed static RAM; VLSI's must be introduced if such mechanisms are to be implemented. ATM node system architecture is based on design principles of a building-block-type structure and hierarchical multiplexing. The basic ATM call handling module, the AHM, is composed mainly of a line termination block and a self-routing switch block; we analyzed this module from the viewpoint of the amount of hardware it requires. Finally, future ATM node systems are discussed on the basis of 0.2-μm VLSI development trends and hardware requirements such as the need for ultrahigh integration of logic gate with memory, multichip modules, and low power dissipation technology     

An economic feasibility study for a broadband virtual pathSONET/ATM self-healing ring architecture

A ring architecture that uses the asynchronous transfer mode (ATM) virtual path (VP) concept to reduce the SONET ring cost in terms of bandwidth management is discussed. The add-drop multiplexer (ADM) proposed for VP ring architectures can evolve from existing SONET ADMs by replacing the STS-3 termination cards by the ATM STS-3c line cards. Existing standard self-healing schemes and protocol SONET rings can be applied to proposed ATM/SONET VP rings. A case study based on a BCC (Bellcore client company) ring network and the sensitivity analysis suggests that the proposed ATM VP ring architecture may be a cost-effective option for implementing the distributed ring grooming system at the DS 1 level. The proposed VP self-healing rings are not only used to carry existing DS 1 and DS 3 service, but can also be used to more cost-effectively consolidate switches for public-switched services and for SMDS, frame relay, and FDDI in metropolitan areas     

Buffer sizing in an ATM switch for both ATM and STM traffics

Specific queueing models are derived in order to size the buffers of ATM switching elements in the cases of ATM or STM multiplexed traffic. Buffering is performed either at the outputs or in a central memory for ATM multiplexed traffic; for STM multiplexed traffic, buffers can also be provided at the inputs. The buffer size is chosen in order to ensure a loss probability in the switch smaller than 10^?10. It is shown that the buffer size per output in the case of central queueing is smaller than the buffer size in case of output queueing for both ATM and STM multiplexed traffics. Moreover, for STM multiplexed traffic, buffer sizes are identical for input and output queueing. Lastly, it is pointed out that buffers used for STM multiplexed traffic should be 4 to 20 times larger than the corresponding buffers for ATM multiplexed traffic.