In this paper, we introduce the Pre-cross-connected Segment First —PXSFirst protection scheme; a new path-based protection schemes for WDM optical networks. The goal of the PXSFirst scheme is to achieve fast recovery, while maximizing bandwidth sharing to improve bandwidth utilization. Similar to pre-cross-connected trails (PXTs) protection scheme, PXSFirst ensures that all backup paths are pre...

In order to provide reliable connections across metropolitan and wide-area optical networks, the network operator must provide some degree of redundancy so that traffic can be switched from damaged working paths to backup paths that are disjoint from the working paths that they are protecting. In the most general form of path protection, N working paths between two client edge nodes are protect...

Process allocation is important for fault-tolerant multi-computer systems since it directly aaects the performance and dependability of the system. In this paper, we consider load-balancing process allocation for fault-tolerant systems that balances the load before as well as after faults start to degrade the performance of the system. We show two schemes to tolerate multiple faults in the pass...

The performances of the routing protocols are important since they compute the primary path between source and destination. In addition, routing protocols need to detect failure within a short period of time when nodes move to start updating the routing table in order to find a new primary path to the destination. Meantime, loss of packets and end-toend delays will increase thereby reducing thr...

Making backup is so cumbersome and expensive that individuals hardly ever backup their data and companies usually duplicate their data into a secondary server. This paper proposes a novel Peer-to-Peer (P2P) backup system known as the SecureBackup service, which was defined in the DisPairse research project. It utilizes the unused personal hard disk spaces attached to the Internet to implement a...

Process allocation is important for fault-tolerant multi-computer systems since it directly aaects the performance and dependability of the system. In this paper , we consider load-balancing process allocation for fault-tolerant systems that balances the load before as well as after faults start to degrade the performance of the system. We show two schemes to tolerate multiple faults in the pas...

Abstract With frequent political conflicts and public health emergencies, global supply chains are constantly under risk interference, significantly reducing chain resilience (SCR), especially for the knowledge-intensive (KISCs). To assess improve of KISC, this paper uses complex network theory to construct a directed weighted model suitable KISC expresses SCR as comprehensive capability that c...

The benefits provided by cloud computing and the space savings offered by data deduplication make it attractive to host data storage services like backup in the cloud. Data deduplication relies on comparing fingerprints of data chunks, and store them in the chunk index, to identify and remove redundant data, with an ultimate goal of saving storage space and network bandwidth. However, the chunk...

Sensor nodes in a distributed sensor network can fail due to a variety of reasons, e.g., harsh environmental conditions, sabotage, battery failure, and component wear-out. Since many wireless sensor networks are intended to operate in an unattended manner after deployment, failing nodes cannot be replaced or repaired during field operation. Therefore, by designing the network to be fault-tolera...

This paper focuses on the protection of virtual circuits (Label Switched Paths, LSPs) in a (G)MPLS (Generalised Multi-Protocol Label Switching) network. The proposed algorithm is designed to protect traffic with strong delay requirements such as EF (Expedited Forwarding) ordered aggregates in a DiffServ domain. Indeed, for this type of application, we need fast restoration in case of failure. T...