108128738
Architectures and algorithms for fault management in optical wdm networks
With the maturing of wavelength-division multiplexing (WDM) technology, one single strand of fiber can provide tremendous bandwidth (potentially a few tens of terabits per second) by multiplexing many non-overlapping wavelength channels. In a wavelength-routed WDM network, with the relatively high frequency of network failures, and the tremendous traffic loss a failure may cause, fault management becomes a critical concern in network design and its real-time operation. This dissertation investigates architectures and algorithms for survivable optical networks. 
The dissertation first presents a broad overview of the fault-management mechanisms involved in deploying a survivable optical mesh network. Different parameters are presented which can measure the quality of service (QoS) provided by a WDM mesh network to upper protocol layers, such as service availability, service reliability, restoration time, and service restorability. It reviews the concepts, the factors that affect them, and how to improve them. 
Next, the dissertation investigates the problem of using optimal path pair as the routes for the primary and backup paths in a WDM network with and without wavelength-conversion capability. It proves that the problem is NP-complete in wavelength-continuous networks. 
In order to satisfy a connection's service-availability requirement in a cost-effective manner, we need a systematic mechanism to select a proper protection scheme for each connection request. Connection availability is proposed to use as a metric to provide differentiated protection services. A mathematical model is developed to analyze the availabilities of connections with different protection modes. Integer linear program (ILP) and heuristic approaches are studied to provision the connections cost effectively while satisfying the connections' availability requirements. 
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. Backup reprovisioning approaches are proposed and studied under a novel network model. 
Optical burst switching (OBS) is a promising technique for supporting high-capacity, bursty data traffic over optical WDM networks. The fault-management issues in an OBS network are studied. A pre-planned global rerouting scheme is proposed to balance network load and a novel fault-tolerant node architecture is proposed to quickly restore the bursts on a failed link.
18359963
Backup reprovisioning to remedy the effect of multiple link failures in WDM mesh networks
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
11999738
The LLAMA Middleware Support for Accountable Service-Oriented Architecture
Enterprises are turning to SOA for the flexible deployment of business processes. While current monitoring tools can detect service execution problems in an enterprise's servers and report such problems to human decision makers, they may not closely monitor the external services they use, diagnose the root cause of process problems, and automatically reconfigure the process to replace faulty services. This paper presents the LLAMA middleware support for service process monitoring, run-time management, and configuration. Instances of accountability agents are deployed to selectively monitor some services' performance. These agents in turn allow LLAMA's Accountability Authority (AA) to diagnose process problems and apply any necessary reconfiguration. The project also builds tools to simplify the setup and deployment of LLAMA components. Our experimental results indicate that using LLAMA contributes only a modest amount of system overhead, and that the diagnosis process is swift and sufficiently accurate.
18478421
An Efficient Approach for Service Process Reconfiguration in SOA with End-to-End QoS Constraints
Using SOA, service processes can be composed statically or dynamically using services provided by different service providers. Some services may become faulty at runtime and cause the service process to violate the end-to-end quality of service (QoS) constraint. We propose an efficient approach for replacing faulty services to ensure that the reconfigured service process still meets the original end-to-end QoS constraint. We use an iterative algorithm to identify reconfiguration regions that have a small number of services, some faulty and some healthy, in order to have more service selection options. By reconfiguring services in these selected regions rather than the whole service process, the computational complexity is significantly reduced. Simulation study has shown that our approach is efficient as most service processes can be repaired by replacing only a small number of services.
31253731
Explicit Routing for Traffic Engineering in Labeled Optical Burst-Switched WDM Networks
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. In this paper, we consider the traffic-engineering problem in a LOBS network, using explicit routing to balance network load and to reduce the burst-loss probability. We model the traffic-engineering problem in a LOBS network as an optimization problem and propose two new objective functions to minimize network congestion. Our illustrative numerical examples show that the burst-loss probability can be significantly reduced using optimization technique, when compared with shortest-path routing.
495478
Optimized routing for fault management in optical burst-switched WDM networks
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
7669221
Function Finding and Constants Creation Method in Evolutionary Algorithm Based on Overlapped Gene Expression
Evolutionary algorithm based on overlapped gene expression (EAOGE) is a new technology of evolutionary algorithm which is inspired by the overlap gene expression in biological research. Different from existing works, EAOGE suggests a new expression structure of genes, and these genes have a probability to overlapped express in some segments. It uses chromosomes of fixed length to represent expression trees of different shapes and sizes. It does unconstrained search in the genome space and still ensures validity of the expression. This paper implements EAOGE algorithm and proposes a new constants creation method. Extensive experiments show that the method significantly improves the precision in the problems of function finding, and the precision of the new method is about 12.8 times to traditional algorithm at least.
6648098
Reliability Modeling and Analysis of Service-Oriented Robot Management System
It is an obvious trend that computer network and robot technology will more and more closely combine with each other. And the robot, especially the service robot such as house robot, entertainment robot, etc, will provide different kinds of services to the mankind. This paper introduces a service-oriented network robotic management system (SONRMS) to coordinate and manage the behaviors between robots and their users so as to provide high reliability and safety measures to users. Then SONRMS' architecture is put forward. SONRMS reliability model is described by use of stochastic reward net, reliability block datagram and hierarchical model. The influence among parameters of the system upon SONRMS reliability is analyzed in the end
6670638
A Pixel-level Statistical Structural Descriptor for Shape Measure and Recognition
A novel shape descriptor based on the histogram matrix of pixel-level structural features is presented. First, length ratios and angles between the centroid and contour points of a shape are calculated as two structural attributes. Then, the attributes are combined to construct a new histogram matrix in the feature space statistically. The proposed shape descriptor can measure circularity, smoothness, and symmetry of shapes, and be used to recognize shapes. Experimental results demonstrate the effectiveness of our method.
30018886
Federation Based Solution for Peer-to-Peer Network Management
Recently, Peer-to-Peer (P2P) technology has become one of the hottest topics in the research area of Internet. With a variety of P2P applications, especially those applications sharing large-size file resources among a large scale of user community, P2P brought us an even more exciting Internet life. However, P2P also made lots of troubles to network managers because of consuming too much network bandwidth sometimes. Lacking of effective management solution, some ISPs plan to block all P2P services on their network boundaries. In this paper, we propose a federation-based solution for peer-to-peer network management. By setting up a P2P federation, ISPs and P2P service providers can work together for P2P network management. From P2P federation service, ISPs can get P2P nodes information of their own network to make some control to those that disturb normal network services. At the same time, service providers of P2P may get routing information of specific ISPs to optimize the routing of P2P network itself by joining in federation. Under such scenario, it will save much cost for ISPs to detect and control P2P traffic and give up the idea of killing P2P services. Save and help to the development of P2P are the most important target of this solution.
37283725
Business Process-Oriented Software Architecture for Supporting Business Process Change
As a business process is essential in running an enterprise, this paper aims toward improving software architecture by extracting business-relevant semantics from business logic and transforming them as important elements that need to be molded and represented in software architecture. This allows for the development of a business process-oriented software architecture (BPOSA) that can support smoother business process change. The paper introduces the structure of BPOSA and its work mode. Then it describes the steps involved in designing a process-oriented software system, and provides analysis and design methods of extending process-relevant attributes for application in business operations.