Research ArticleOpen accessPhrase in the titleA Fault Tolerant Congestion Aware Routing Protocol for Mobile Adhoc NetworksG. Rajkumar, K. DuraiswamyProblem statement: The performance of ad hoc routing protocols will significantly degrade when there are faulty nodes in the network. Packet losses and bandwidth degradation are caused due to congestion and thus, time and energy is wasted during its recovery. The fault tolerant congestion aware routing protocol addresses these problems by exploring the network redundancy through multipath routing. Approach: In … …Journal of Computer Science, Vol. 8, Issue 5 · 23 Feb 2012 · 6,446 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleProactive and Reactive View Change for Fault Tolerant Byzantine AgreementPoonam Saini, Awadhesh Kumar SinghProblem statement: Dealing with arbitrary failures effectively, while reaching agreement, remains a major operational challenge in distributed transactions. In the contemporary literature, standard protocols such as Byzantine Fault Tolerant Distributed Commit and Practical Byzantine Fault Tolerance handles the problem to a greater extent. However, the limitation with these protocols is that they incur increased message overhead as well as large … …Journal of Computer Science, Vol. 7, Issue 1 · 15 Jan 2011 · 7,048 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleA Fault Tolerant Mobile Agent Information Retrieval SystemR. Punithavathi, K. DuraiswamyProblem statement: Most of the information retrieval systems used only client-server architectures. The client-server model though powerful, had some limitations. In mobile computing environment which has both wired network and wireless networks with limited communication capabilities, the performance of the system was very low. Approach: Mobile agents are considered a suitable technology to develop applications such as information retrieval system … …Journal of Computer Science, Vol. 6, Issue 5 · 31 May 2010 · 7,203 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleIMPROVING FAULT TOLERANT RESOURCE OPTIMIZED AWARE JOB SCHEDULING FOR GRID COMPUTINGK. Nirmala Devi, A. TamilarasiWorkflow brokers of existing Grid Scheduling Systems are lack of cooperation mechanism which causes inefficient schedules of application distributed resources and it also worsens the utilization of various resources including network bandwidth and computational cycles. Furthermore considering the literature, all of these existing brokering systems primarily evolved around models of centralized hierarchical or client/server. In such models, vital responsibility such … …Journal of Computer Science, Vol. 10, Issue 5 · 4 Jan 2014 · 6,896 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleActive Reset and Scheduling in Fault-Tolerant Quantum-Classical Cloud ComputingMohamed El-DosukyQuantum-classical cloud computing refers to a hybrid computing model that integrates quantum computing with classical computing resources, typically hosted on the cloud. The objective of this paper is threefold: First, to scrutinize the computing paradigm of quantum-classical cloud computing; second, to study the three pillars of the underpinning techniques: Active reset, scheduling, and fault tolerance; third, to demonstrate the realization … …Journal of Computer Science, Vol. 22, Issue 7 · 1 Sep 2026 · 767 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Novel Fault-Tolerant Majority Gate Architecture for Robust Operation in QCA-Based Nano CircuitsAmi Patel, Vrushank Shah, Dipti KhurgeQuantum Dot Cellular Automata (QCA) is one of the promising alternatives to the traditional CMOS technologies for next-generation nanocomputing, which can be integrated at a higher density and has a higher possibility of low power consumption. Fabrication defects, environmental noise, and fault tolerance, especially in larger circuits, are challenging for practical implementation of QCA circuits. A new Fault-Tolerant Majority Gate … …Journal of Computer Science, Vol. 22, Issue 7 · 7 Jul 2026 · 1,194 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleA Robust Byzantine Fault-Tolerant Replication Technique for Peer-to-Peer Content DistributionAyyasamy Sellappan, Sivanandam NatarajanProblem statement: In peer-to-peer networks, Byzantine fault tolerance refers to the capability of a system to tolerate Byzantine faults. It can be achieved by replicating the server and by ensuring all server replicas reach an agreement on the input despite Byzantine faulty replicas and clients. Since malicious attacks and software errors can cause faulty nodes to exhibit Byzantine behavior, Byzantine-fault-tolerant … …Journal of Computer Science, Vol. 7, Issue 2 · 25 Feb 2011 · 7,056 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleFormal Analysis of Fault-tolerant Algorithm in the Time-triggered ArchitectureAliouat Zibouda, Aliouat Makhlouf, Batouche ChawkiTime-Triggered architecture (TTA) provides a computing infrastructure for the design and implementation of dependable distributed systems. The core building block of the TTA is the communication protocol TTP/C. This protocol has been designed to provide no faulty nodes. TTP/C integrates a set of fault-tolerant services like: message transmissions, clocks synchronization and Group Membership Protocol (GMP). The GMP protocol ensures that … …Journal of Computer Science, Vol. 3, Issue 1 · 31 Jan 2007 · 6,647 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleDesign and Bandwidth Analysis of Fault-Tolerant Multistage Interconnection NetworksR. Aggarwal, L. KaurThe design of a suitable interconnection network for inter-processor communication is one of the key issues of the system performance. In this study a new irregular interconnection network IABN (Irregular Augmented Baseline) has been proposed. IABN is designed by modifying existing ABN (Augmented Baseline Network). ABN is a regular multi-path network with limited fault tolerance. IABN provides three times more … …Journal of Computer Science, Vol. 4, Issue 11 · 30 Nov 2008 · 6,830 accessesView PDFCite