3,203 research outputs found

    A Constrained, Possibilistic Logical Approach for Software System Survivability Evaluation

    Get PDF
    In this paper, we present a logical framework to facilitate users in assessing a software system in terms of the required survivability features. Survivability evaluation is essential in linking foreign software components to an existing system or obtaining software systems from external sources. It is important to make sure that any foreign components/systems will not compromise the current system’s survivability properties. Given the increasing large scope and complexity of modern software systems, there is a need for an evaluation framework to accommodate uncertain, vague, or even ill-known knowledge for a robust evaluation based on multi-dimensional criteria. Our framework incorporates user-defined constrains on survivability requirements. Necessity-based possibilistic uncertainty and user survivability requirement constraints are effectively linked to logic reasoning. A proof-of-concept system has been developed to validate the proposed approach. To our best knowledge, our work is the first attempt to incorporate vague, imprecise information into software system survivability evaluation

    Survivability through pre-configured protection in optical mesh networks

    Get PDF
    Network survivability is a very important issue, especially in optical networks that carry huge amount of traffic. Network failures which may be caused by human errors, malfunctional systems and natural disaster (eg. Earthquakes and lightening storms), have occurred quite frequently and sometimes with unpredictable consequences. Survivability is defined as the ability of the network to maintain the continuity of service against failures of network components. Pre-configuration and dynamic restoration are two schemes for network survivability. For each scheme, survivability algorithms can be applied at either Optical Channel sublayer (Och) known as link-based. Or, Optical Multiplex Section sublayer (OMS) known as path-based. The efficiency of survivability algorithms can be assessed through such criteria as capacity efficiency, restoration time and quality service. Dynamic restoration is more efficient than pre-configuration in terms of capacity resource utilization, but restoration time is longer and 100% service recovery cannot be guaranteed because sufficient spare capacity may not be available at the time of failures. Similarly, path-based survivability offers a high performance scheme for utilizing capacity resource, but restoration time is longer than link based survivability

    Public policy and natural resource management: a framework for integrating concepts and methodologies for policy evaluation

    Get PDF

    Survivability aspects of future optical backbone networks

    Get PDF
    In huidige glasvezelnetwerken kan een enkele vezel een gigantische hoeveelheid data dragen, ruwweg het equivalent van 25 miljoen gelijktijdige telefoongesprekken. Hierdoor zullen netwerkstoringen, zoals breuken van een glasvezelkabel, de communicatie van een groot aantal eindgebruikers verstoren. Netwerkoperatoren kiezen er dan ook voor om hun netwerk zo te bouwen dat zulke grote storingen automatisch opgevangen worden. Dit proefschrift spitst zich toe op twee aspecten rond de overleefbaarheid in toekomstige optische netwerken. De eerste doelstelling die beoogd wordt is het tot stand brengen vanrobuuste dataverbindingen over meerdere netwerken. Door voldoende betrouwbare verbindingen tot stand te brengen over een infrastructuur die niet door een enkele entiteit wordt beheerd kan men bv. weredwijd Internettelevisie van hoge kwaliteit aanbieden. De bestudeerde oplossing heeft niet enkel tot doel om deze zeer betrouwbare verbinding te berekenen, maar ook om dit te bewerkstelligen met een minimum aan gebruikte netwerkcapaciteit. De tweede doelstelling was om een antwoord te formuleren om de vraag hoe het toepassen van optische schakelsystemen gebaseerd op herconfigureerbare optische multiplexers een impact heeft op de overleefbaarheid van een optisch netwerk. Bij lagere volumes hebben optisch geschakelde netwerken weinig voordeel van dergelijke gesofistikeerde methoden. Elektronisch geschakelde netwerken vertonen geen afhankelijkheid van het datavolume en hebben altijd baat bij optimalisatie

    Managerial decisions to recover from Covid-19 disruption: A multi-objective optimization approach applied to public transport operators

    Get PDF
    The resilience of transport systems, facing natural or man-made disruptions, has been widely discussed in literature in terms of recovery capabilities concerning infrastructures, suggesting solutions to provide users an acceptable level of service along the interrupted network. However, in the context of the Covid-19 outbreak, the disruption has stressed the resilience of transport systems not on the supply side but rather at organizational level for transport service providers. Indeed, the sudden and drastic decrease in users due to the restrictions imposed by governments to limit the pandemic spread has implicated severe economic consequences in the running of transport companies. In this paper, attention has been focused on the public transport sector to analyse the effects of different initiatives, which companies could undertake in response to the demand shock caused by the Covid-19 emergency. Notably, an optimization procedure has been developed with the aim of determining feasible Pareto-front solutions, which correspond to trade-off conditions for the concurrent maximization of the company profit and the minimization of outsourcing services. The time span necessary to implement the examined recovery measures has been considered together with the limitation to appropriate threshold values for the main cost and income items influencing the company operations management. The proposed approach has been applied to the case study of an Italian public transport company to appraise different post-Covid-19 resilience strategies

    India’s Nuclear Doctrine : Context and Constraints

    Get PDF
    Ever since India achieved independence in 1947, its response to global nuclear non-proliferation measures has been a dominant theme in the country’s overall evolution of nuclear policy. However, India conducted a nuclear test in 1974, which it termed a ‘peaceful nuclear explosion’ and in 1998, India conducted a full-scale nuclear test and subsequently claimed to have attained nuclear capability. The purpose of this article is to critically evaluate key elements of India’s draft nuclear doctrine. The draft was presented to the Prime Minister and the Cabinet in August 1999 and released later for public debate by the National Security Advisory Board

    Survivable Logical Topology Mapping under Multiple Constraints in IP-over-WDM Networks

    Get PDF
    The survivable logical topology mapping problem in an IP-over-WDM network deals with the cascading effect of link failures from the bottom (physical) layer to the upper (logical) layer. Multiple logical links may get disconnected due to a single physical link failure, which may cause the disconnection of the logical network. Here we study survivability issues in IP-over-WDM networks with respect to various criteria.We first give an overview of the two major lines of pioneering works for the survivable design problem. Though theoretically elegant, the first approach which uses Integer Linear Programming (ILP) formulations suffers from the drawback of scalability. The second approach, the structural approach, utilizes the concept of duality between circuits and cutsets in a graph and is based on an algorithmic framework called Survivable Mapping Algorithm by Ring Trimming (SMART). Several SMART-based algorithms have been proposed in the literature.In order to generate the survivable routing, the SMART-based algorithms require the existence of disjoint lightpaths for certain groups of logical links in the physical topology, which might not always exist. Therefore, we propose in Chapter 4 an approach to augment the logical topology with new logical links to guarantee survivability. We first identify a logical topology that admits a survivable mapping against one physical link failure. We then generalize these results to achieve augmentation of a given logical topology to survive multiple physical link failures.We propose in Chapter 5 a generalized version of SMART-based algorithms and introduce the concept of robustness of an algorithm which captures the ability of the algorithm to provide survivability against multiple physical link failures. We demonstrate that even when a SMART-based algorithm cannot be guaranteed to provide survivability against multiple physical link failures, its robustness could be very high.Most previous works on the survivable logical topology design problem in IP-over-WDM networks did not consider physical capacities and logical demands. In Chapter 6, we study this problem taking into account logical link demands and physical link capacities. We define weak survivability and strong survivability in capacitated IP-over-WDM networks. Two-stage Mixed-Integer Linear Programming (MILP) formulations and heuristics to solve the survivable design problems are proposed. Based on the 2-stage MILP framework, we also propose several extensions to the weakly survivable design problem, considering several performance criteria. Noting that for some logical networks a survivable mapping may not exist, which prohibits us from applying the 2-stage MILP approach, our first extension is to augment the logical network using an MILP formulation to guarantee the existence of a survivable routing. We then propose approaches to balance the logical demands satisfying absolute or ratio-weighted fairness. Finally we show how to formulate the survivable logical topology design problem as an MILP for the multiple failure case.We conclude with an outline of two promising new directions of research
    • …
    corecore