Autonomic networking requires that the services and resources offered by the network at any specific time adapt to evolving changes in user needs, business goals and environmental conditions. This paper describes a rich and extensible context-aware policy model as part of the FOCALE autonomic network architecture. This context-aware policy model is built explicitly to support context-awareness that in turn enables the control loops in FOCALE to be adaptive.

Presents the introductory welcome message from the conference proceedings.

Provides a listing of current committee members and society officers.

Improved product quality and accelerated software development through systematic reuse of common software assets have been the key attractions behind software product lines. Magnitude of improvement in industrial practices has been reported in the literature. However, experiences with software product line also showed that it is a rather chall enging task to maintain software product lines and families over a long period of time. The time and resources needed to manage and maintain product lines increase and quality degrades as product lines evolve. This paper describes an industrial practice of software product line maintenance and evolution. The conventional software maintenance process is enhanced with data mining techniques to uncover lost reuse pattern and defects, maintain reuse, and reduce design erosion of product lines. Case studies with mobile phone product lines are described.

Adding autonomic capabilities to network management systems provides great promise in delivering high QoS while lowering operation and maintenance cost. In this paper, we present a model-based approach to adding autonomic capabilities to a fault management system for cellular networks. We propose the use of modeling techniques to specify software failures and their dispositions at the model level for the target system. This facilitates the deployment of a control loop for adding autonomic capabilities into the system architecture, which include self-monitoring, self-healing, and self-adjusting. Our case study on the intelligent network fault management system illustrates the proposed approach by adding and deploying these autonomic capabilities derived from self-model specifications, to mitigate the risk of specified failures and maintain the level of healthiness of the system, dynamically and effectively.

Abstract In model‐driven engineering, it is often desirable to evaluate different design alternatives as they relate to scalability issues of the modeled system. A typical approach to address scalability is model replication, which starts by creating base models that capture the key entities as model elements and their relationships as model connections. A collection of base models can be adorned with necessary information to characterize a specific scalability concern as it relates to how the base modeling elements are replicated and connected together. In current modeling practice, such a model replication is usually accomplished by scaling the base model manually. This is a time‐consuming process that represents a source of error, especially when there are deep interactions between model components. As an alternative to the manual process, this paper presents the idea of automated model replication through a model transformation process that expands the number of elements from the base model and makes the correct connections among the generated modeling elements. The paper motivates the need for model replication through case studies taken from models supporting different domains. Copyright © 2008 John Wiley & Sons, Ltd.

Survivability is a key concern in modern network design in order to achieve fast service restorability against network failures. This paper investigates the problem of survivable dynamic connection provisioning in general telecom backbone networks, which are mesh structured. These networks employ optical fibers, which may fail due to network outages such as fiber cuts, etc. Our study applies to survivability of optical wavelength-division multiplexing (WDM) as well as multi-protocol label switching (MPLS) networks. For survivability study, we assume differentiated services where connections may have different availability requirements, so they may be provisioned differently with protection (if needed) based on their availability requirements and current network state. Therefore, it may be possible that connections with the same source, destination, and availability requirement are provisioned differently (unprotected, shared-path protected, or dedicated-path protected) at different times based on current network state. Such differentiated provisioning can provide diverse levels of service performance and achieve network resource optimization flexibly. Our main contributions are as follows. First, we develop an analytical model to quantify the availabilities of connections with various protection modes, i.e., unprotected, dedicated-path protected, and shared-path protected. Particular emphasis is placed on computing a connection's availability with shared-path protection by employing the link-vector technique, because this technique can maximally explore the sharing potential among backup paths and achieve bandwidth-assignment flexibility. Based on the mathematical model, we then present a novel provisioning strategy for dynamic connection requests in which multiple levels of services are provided and different protection schemes may be applied to different connections. The strategy jointly considers both connection availability satisfaction and resource optimization. Numerical results show very good accuracy of our model and high effectiveness of our provisioning strategy

Optical burst switching (OBS) is a promising technique for supporting high-capacity, bursty data traffic over optical wavelength-division-multiplexed (WDM) networks. An optical link failure may result in a huge amount of data (and revenue) loss, and it has been an important survivability concern in optical networks. In this paper, we study the fault- management issues related with a link failure in an OBS network. We propose to use pre-planned global rerouting to balance network load and to reroute bursts after a link fails. We apply optimization techniques to pre-plan explicit backup routes for failure scenarios. Our objective is to achieve optimal load balancing both before and after a failure such that the network state can still remain stable with minimum burst-loss probability when a failure occurs. We apply the pre-planned normal and backup routing tables to an OBS network, and study the network performance after a failure occur using illustrative numerical examples. The results show that the average burst-loss probability can be significantly reduced by 60% - from an average of 0.10 to 0.04 (when the normalized link load is less than 0.5) using globally-rerouted backup routes, when compared with the scheme without global rerouting. We also observe that the burst-loss probability is reduced by 43% - from an average of 0.07 to 0.04 (when the link load is less than 0.5) if the rerouting is done using optimization techniques, when compared with shortest-path routing.for Fault Management

Survivability is a key concern in modern telecom mesh networks because of the enormous capacity of a telecom link which is usually an optical fiber employing wavelength-division multiplexing (WDM). Backup bandwidth reprovisioning has been shown to be an effective approach for improving network survivability as well as preventing existing services from unnecessary interruption. We investigate the advantages of reprovisioning new backup paths for connections when a previous failure is repaired (as well as when a network failure occurs). We consider reprovisioning of backup paths either (1) for unprotected or vulnerable connections that lose their primary or backup paths due to a previous failure and fail to be reprovisioned when the failure happens due to resource limits, or (2) for all existing connections in the network. The pros and cons of the two policies are investigated. A wavelength-convertible network and shared-path protection are assumed in this study. We compare the performance of our dynamic reprovisioning approach with a conventional scheme which reprovisions backup paths for connections only when a network failure occurs. The simulation results demonstrate that our approach achieves more network robustness and better backup capacity optimization.

The ever increasing societal demand for the timely availability of newer and feature-rich but highly dependable network-centric applications imposes the need for these applications to be constructed by the composition, assembly and deployment of off-the-shelf infrastructure and domain-specific services building blocks. Service oriented architecture (SOA) is an emerging paradigm to build applications in this manner by defining a choreography of loosely coupled building blocks. However, current research in SOA does not yet address the per for mobility (i.e., performance and dependability) challenges of these modern applications. Our research is developing novel mechanisms to address these challenges. We initially focus on the composition and configuration of the infrastructure hosting the individual services. We illustrate the use of domain-specific modeling languages and model weavers to model infrastructure composition using middleware building blocks, and to enhance these models with the desired performability attributes. We also demonstrate the use of generative tools that synthesize metadata from these models for performability validation using analytical, simulation and empirical benchmarking tools.

Domain-specific models increase the level of abstraction used to develop large-scale component-based systems. Model-driven development (MDD) approaches (e.g., Model-Integrated Computing and Model-Driven Architecture) emphasize the use of models at all stages of system development. Decomposing problems using MDD approaches may result in a separation of the artifacts in a way that impedes comprehension. For example, a single concern (such as deployment of a distributed system) may crosscut different orthogonal activities (such as component specification, interaction, packaging and planning). To keep track of all entities associated with a component, and to ensure that the constraints for the system as a whole are not violated, a purely model-driven approach imposes extra effort, thereby negating some of the benefits of MDD. This paper provides three contributions to the study of applying aspect-oriented techniques to address the crosscutting challenges of model-driven component-based distributed systems development. First, we identify the sources of crosscutting concerns that typically arise in model-driven development of component-based systems. Second, we describe how aspect-oriented model weaving helps modularize these crosscutting concerns using model transformations. Third, we describe how we have applied model weaving using a tool called the Constraint-Specification Aspect Weaver (C-SAW) in the context of the Platform-Independent Component Modeling Language (PICML), which is a domain-specific modeling language for developing component-based systems. A case study of a joint-emergency response system is presented to express the challenges in modeling a typical distributed system. Our experience shows that model weaving is an effective and scalable technique for dealing with crosscutting aspects of component-based systems development.

As networks grow in size and complexity, both the probability and the impact of failures increase. The pre-allocated backup bandwidth, which has been widely investigated in the literature, may not be able to provide full protection guarantee when multiple failures occur in a network. In this study, we consider multiple concurrent failures where concurrent means that a new failure occurs before a previous failure is repaired. To combat the effect of multiple concurrent failures, new backups can be reprovisioned after one failure such that the next potential failure can be handled effectively and efficiently. We consider dynamic traffic where a pair of link-disjoint primary and backup paths is provisioned when a new connection request arrives. After a failure occurs, the affected connections switch traffic from their primary paths to backup paths. To protect against next potential failure, we reprovision new backups for connections that become unprotected or vulnerable because of losing their primary or their backup due to the previous failure or due to backup resource sharing. This approach is called Minimal Backup Reprovisioning (MBR). An alternative approach is to globally rearrange backups for all connections after one failure occurs, which is called Global Backup Reprovisioning (GBR). Backup reprovisioning can be performed whenever the network's state changes, e.g., (1) when a new request arrives, (2) when an existing connection terminates, (3) when a network failure occurs, (4) when a failed link/node is repaired, etc., to utilize the available resources more efficiently or to recover quickly from the next failure. In this study, we perform MBR or GBR after one network failure occurs to protect against the next potential failure in a wavelength-convertible WDM mesh network. The link-vector network model which can maximally explore the backup-sharing potential is assumed in this study. We then analyze the complexity of MBR and GBR under such a network model. A reprovisioning algorithm is proposed for MBR which can significantly reduce the connection vulnerability without the knowledge of the location of the next failure. In GBR, both integer linear program (ILP) and heuristic-based approaches are proposed. We compare capacity requirement and computational complexity of MBR to that of GBR through numerical examples. MBR demonstrates a good tradeoff between complexity and capacity efficiency to handle multiple concurrent failures

Optical burst switching (OBS) is a promising technique for supporting high-capacity bursty data traffic over optical wavelength-division-multiplexed (WDM) networks. A label-switched path can be established to forward a burst control packet (BCP) if each OBS node is augmented with an IP/MPLS controller. Such a network is called a labeled OBS (LOBS) network, and it can exploit the explicit routing and constraint-based routing properties supported in the MPLS framework to perform traffic and resource engineering. However, the burst-loss probability (denoted as BLP) can be large if the traffic is not properly engineered in a LOBS network, especially after a failure occurs. In this paper, we propose to use pre-planned global rerouting to balance network load and to restore bursts after a link fails. We apply optimization techniques to pre-plan explicit backup routes for failure scenarios. Our objective is to achieve optimal load balancing both before and after a failure such that the network state can still remain stable with minimum BLP when failure occurs. We apply the pre-planned global rerouting method in a LOBS network and study the performance of different rerouting schemes on some typical network topologies. Our illustrative numerical examples show that the BLP can be significantly reduced by 25%-99% (when the average link load is less than 0.5) using globally rerouted backup routes, when compared with the scheme without global rerouting. We also observe that the BLP is reduced by 20%-65% (when the average link load is less than 0.5) if the rerouting is done using optimization techniques, when compared with shortest-path routing.

The problem of aggregating large data files from distributed databases and address the corresponding challenges involved from a network architecture perspective is considered. We model this problem as one of identifying a time-path schedule (TPS) in a graph representation of the network. We prove that the TPS problem (TPSP) is NP-complete. We then propose a mixed integer linear programming (MILP)-based approach and three heuristics longest-file-first (LFF), disjoint-paths (DP), and most-distant-file-first (MDFF) - to solve TPSP.

This paper investigates a generalized protection framework for availability-guaranteed connection provisioning in an optical wavelength-division multiplexing (WDM) mesh network. We develop a link-state-modeling mechanism to form a dynamic link-state parameter, called link and resource availability (LRA). Such link-state information can be used by a standard link-state routing protocol to efficiently provision reliable connections. Based on the LRA parameter, we then propose a connection-provisioning algorithm which can guarantee customers' availability requirements. A new generalized protection model is developed through our dynamic LRA-based provisioning. Numerical results demonstrate the performance of the proposed provisioning approach to be promising.

As networks grow in size and complexity, both the probability and the impact of failures increase. The preallocated backup bandwidth cannot provide 100% protection guarantee when multiple failures occur in a network. In this study, we consider multiple concurrent failures where concurrent means that a failure occurs before the previous failure is physically repaired, and we present a comprehensive study on backup reprovisioning to combat the effect of multiple-link failures. The basic idea is to reprovision new backups for connections that become unprotected or vulnerable for the next possible failure, due to losing the primary or the backup in the first failure or due to backup resource sharing. The pros and cons of the backup-reprovisioning approach are extensively discussed. A generalized network model which can maximally explore the backup-sharing potential is assumed in this study. We then discuss the complexity of backup reprovisioning under such a network model. A reprovisioning algorithm is proposed which can significantly reduce the connection vulnerability without the knowledge of the location of next failure. The effectiveness of our reprovisioning algorithm is demonstrated through numerical examples.

In this paper, we present a connection-provisioning framework to satisfy customers' availability requirements using appropriate protection schemes. The framework contains two pats: (a) WDM mesh network service availability analysis; and (b) a connection-provisioning approach using the analysis. We present the availability analysis for connections with different protection schemes (i.e., unprotected, dedicated, or shared protected) and propose an integer linear program (LIP) based provisioning approach for static traffic. We verify the theoretical availability analysis through simulations, and demonstrate the effectiveness s of our provisioning approach using numerical examples.

This paper investigates the problem of dynamic shared-path-protected lightpath provisioning in optical mesh networks employing wavelength-division multiplexing (WDM). We prove that the problem of finding an eligible pair of working and backup paths for a new lightpath request requiring shared-path protection under the current network state is NP-complete. We develop a heuristic, called CAFES, to compute a feasible solution and an algorithm, called OPT, to optimize resource consumption for a given solution. The merits of our approaches are that they capture the essence of shared-path protection and approach to optimal solutions without enumerating paths. We evaluate the effectiveness of our heuristics and the results are found to be promising.