Ruchi Tuli

Followers

Following

Co-authors

Public Views

Interests

Uploads

Papers by Ruchi Tuli

Analyzing Network Performance Parameters using Wireshark

International Journal of Network Security & Its Applications

Network performance can be a prime concern for network administrators. The performance of the net... more Network performance can be a prime concern for network administrators. The performance of the network depends on many factors. Some of the issues faced in the network performance are - Slow Internet, Bottlenecks, Loss of packets and/or retransmissions, and Excessive bandwidth consumption. For troubleshooting a network, an in-depth understanding of network protocols is required. The main objective of this research is to analyze the performance and various other parameters related to the integrity of a network in a home-based network environment using Wireshark. Network traffic is captured for different devices. The captured traffic is then analysed using Wireshark’s basic statistical tools and advanced tools for various performance parameters.

Download

Minimum Process Coordinated Checkpointing Scheme for Ad Hoc Networks

arXiv (Cornell University), Nov 9, 2011

The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile host... more The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. This has made possible creating a mobile distributed computing environment and has also brought several new challenges in distributed protocol design. In this paper, we study a very fundamental problem, the fault tolerance problem, in a MANET environment and propose a minimum process coordinated checkpointing scheme. Since potential problems of this new environment are insufficient power and limited storage capacity, the proposed scheme tries to reduce the amount of information saved for recovery. The MANET structure used in our algorithm is hierarchical based. The scheme is based for Cluster Based Routing Protocol (CBRP) which belongs to a class of Hierarchical Reactive routing protocols. The protocol proposed by us is nonblocking coordinated checkpointing algorithm suitable for ad hoc environments. It produces a consistent set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster are required to take checkpoints; it uses very few control messages. Performance analysis shows that our algorithm outperforms the existing related works and is a novel idea in the field. Firstly, we describe an organization of the cluster. Then we propose a minimum process coordinated checkpointing scheme for cluster based ad hoc routing protocols.

Download

Ad hoc Mobile Wireless Network Routing Protocols- A Review

Mobile ad hoc networks(MANET) represent complex distributed systems that comprise wireless mobile... more Mobile ad hoc networks(MANET) represent complex distributed systems that comprise wireless mobile nodes that can freely and dynamically self organize into arbitrary and temporary ad hoc network topologies, allowing people and devices to seamlessly internet work in areas with no preexisting communication infrastructure e.g., disaster recovery environments. An ad-hoc networkis not a new one, having been around in various forms for over 20 years. Traditionally, tactical networks have been the only communication networking application that followed the ad-hoc paradigm. Recently the introduction of new technologies such as Bluetooth, IEEE 802.11 and hyperLan are helping enable eventual commercial MANET deployments outside the military domain. These recent revolutions have been generating a renewed and growing interest in the research and development of MANET. To facilitate communication within the network a routing protocol is used to discover routes between nodes. The goal of the routin...

A Survey and Performance Analysis of Checkpointing and Recovery Schemes for Mobile Computing Systems

A SURVEY AND PERFORMANCE ANALYSIS OF CHECKPOINTING AND RECOVERY SCHEMES FOR MOBILE COMPUTING SYST... more A SURVEY AND PERFORMANCE ANALYSIS OF CHECKPOINTING AND RECOVERY SCHEMES FOR MOBILE COMPUTING SYSTEMS Ruchi Tuli1 and Parveen Kumar2 1Yanbu University College, Royal Commission for Jubail and Yanbu, Directorate General for Yanbu, P.O. Box 30436 Madinat Yanbu Al Sinaiyah Kingdom of Saudi Arabia., E-mail : tuli.ruchi@gmail.com 2Merrut Institute of Engineering and Technology, Merrut (INDIA) E-mail : pk223475@yahoo.com Check point is defined as a designated place in a program where normal processing of a system is interrupted to preserve the status information. Checkpointing is a process of saving status information. Mobile computing systems often suffer from high failure rates that are transient and independent in nature. To add reliability and high availability to such distributed systems, checkpoint based rollback recovery is one of the widely used techniques for applications such as scientific computing, database, telecommunication applications and mission critical applications. In t...

The Performance of Soft Chekpointing Approach in Mobile Computing Systems

Global journal of computer science and technology, 2011

Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless... more Mobile computing raises many new issues such as lack of stable storage, low bandwidth of wireless channel, high mobility, and limited battery life. These new issues make traditional checkpointing algorithms unsuitable. Coordinated checkpointing is an attractive approach for transparently adding fault tolerance to distributed applications since it avoids domino effects and minimizes the stable storage requirement. However, it suffers from high overhead associated with the checkpointing process in mobile computing systems. In literature mostly, two approaches have been used to reduce the overhead: First is to minimize the number of synchronization messages and the number of checkpoints; the other is to make the checkpointing process nonblocking. Since MHs are prone to failure, so they have to transfer a large amount of checkpoint data and control information to its local MSS which increases bandwidth overhead. In this paper, we introduce the concept of “Soft checkpoint” which is neith...

Download

Character recognition in neural networks using back propagation method

2013 3rd IEEE International Advance Computing Conference (IACC), 2013

One of the most classical applications of the Artificial Neural Network is the Character Recognit... more One of the most classical applications of the Artificial Neural Network is the Character Recognition System. This system is the base for many different types of applications in various fields, many of which we use in our daily lives. This paper attempts to recognize the characters using a back propagation algorithm and studies the effect of variations of error percentage with number of hidden layers in a neural network. First, the aim is to recognize the twenty-six characters i.e. from A to Z &a to z and then to create a network that could recognize the numerals correctly.

Snoopy and Directory Based Cache Coherence Protocols: A Critical Analysis

Analysis Of Recent Checkpointing Techniques For Mobile Computing Systems

International Journal of Computer Science & Engineering Survey, 2011

Recovery from transient failures is one of the prime issues in the context of distributed systems... more Recovery from transient failures is one of the prime issues in the context of distributed systems. These systems demand to have transparent yet efficient techniques to achieve the same. Checkpoint is defined as a designated place in a program where normal processing of a system is interrupted to preserve the status information. Checkpointing is a process of saving status information. Mobile computing systems often suffer from high failure rates that are transient and independent in nature. To add reliability and high availability to such distributed systems, checkpoint based rollback recovery is one of the widely used techniques for applications such as scientific computing, database, telecommunication applications and mission critical applications. This paper surveys the algorithms which have been reported in the literature for checkpointing in Mobile Computing Systems.

Download

Congestion and latency in symmetric interconnection topology

2012 IEEE Conference on Open Systems, 2012

Interconnection network topologies are those networks which are used in parallel, distributed sys... more Interconnection network topologies are those networks which are used in parallel, distributed system or cluster system to provide the communication among multiple processors or nodes. Interconnection network topologies play a big rule in performance of the system. There are many issues regarding interconnection network topologies. In this paper, congestion and latency point of view have been discussed among three different topologies that are Mesh/Torus, Hypercube and Chordal Ring interconnection topology.

Message Induced Soft Chekpointing for Recovery in Mobile Environments

International Journal, 2011

Checkpointing is one of the commonly used techniques to provide fault tolerance in distributed sy... more Checkpointing is one of the commonly used techniques to provide fault tolerance in distributed systems so that the system can operate even if one or more components have failed. However, mobile computing systems are constrained by low bandwidth, mobility, lack of stable storage, frequent disconnections and limited battery life. Hence checkpointing protocols which have fewer checkpoints are preferred in mobile environment. Since MHs are prone to failure, so they have to transfer a large amount of checkpoint data and control information to its local MSS which increases bandwidth overhead. In this paper we propose a new soft checkpointing scheme for mobile computing systems. These soft checkpoints are saved locally in the host. Locally stored checkpoints do not consume network bandwidth and can be created in less time. Before disconnecting from the MSS, these soft checkpoints are converted to hard checkpoints and are sent to MSSs stable storage. In this way, taking a soft checkpoint avoids overhead transferring large amount of data to the stable storage MSSs.

Download

New Paradigms in Check-Pointing Techniques in Distributed Mobile Systems

International Journal of Information Technology, 2011

... Page 6. 564 RUCHI TULI &amp;amp;amp;amp; PARVEEN KUMAR Table 1 Comparison of Various Chec... more

Asynchronous Checkpointing And Optimistic Message Logging For Mobile Ad Hoc Networks

International Journal of Advanced Computer Science and Applications, 2011

... International Journal of Information and Computer Security [], pp 298-314, Vol. 3 No. 1, 2007... more

New Paradigms in Checkpoint Processing and Recovery Techniques for Distributed Mobile Systems

Communications in Computer and Information Science, 2011

... Techniques for Distributed Mobile Systems Ruchi Tuli1 and Parveen Kumar2 ... Distributed 7. S... more

The Design and Performance of a Checkpointing Scheme for Mobile Ad Hoc Networks

Communications in Computer and Information Science, 2011

... Ruchi Tuli1 and Parveen Kumar2 ... IEEE Transactions on parallel and Distributed Sys-tems 12(... more

Snoopy and Directory Based Cache Coherence Protocols: A Critical Analysis

by Safeeullah Soomro, Ruchi Tuli, and Khurram Tanvir

The computational systems (multi and uni-processors) need to avoid the cache coherence problem. T... more The computational systems (multi and uni-processors) need to avoid the cache coherence problem. The problem of cache coherence is solved by today's multiprocessors by implementing a cache coherence protocol. The cache coherence protocol affects the performance of a distributed shared memory multiprocessor system. This paper discusses several different varieties of cache coherence protocols including with their pros and cons, the way they are organized, common protocol transitions, and some examples of systems that implement those protocols

Download

ANALYSIS OF RECENT CHECKPOINTING TECHNIQUES FOR MOBILE COMPUTING SYSTEMS

by Ruchi Tuli and International Journal of Computer Science and Engineering Survey (IJCSES)

Recovery from transient failures is one of the prime issues in the context of distributed systems... more Recovery from transient failures is one of the prime issues in the context of distributed systems. These systems demand to have transparent yet efficient techniques to achieve the same. Checkpoint is defined as a designated place in a program where normal processing of a system is interrupted to preserve the status information. Checkpointing is a process of saving status information. Mobile computing systems often
suffer from high failure rates that are transient and independent in nature. To add reliability and high availability to such distributed systems, checkpoint based rollback recovery is one of the widely used techniques for applications such as scientific computing, database, telecommunication applications and mission critical applications. This paper surveys the algorithms which have been reported in the literature
for checkpointing in Mobile Computing Systems.

Download

Minimum Process Coordinated Checkpointing Scheme For Ad Hoc Networks

by International Journal on AdHoc Networking Systems (IJANS) and Ruchi Tuli

The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile host... more The wireless mobile ad hoc network (MANET) architecture is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. This has made possible creating a mobile distributed computing environment and has also brought several new challenges in distributed protocol design. In this paper, we study a very fundamental problem, the fault tolerance problem, in a MANET environment and propose a minimum process coordinated check pointing scheme.
Since potential problems of this new environment are insufficient power and limited storage capacity, the
proposed scheme tries to reduce the amount of information saved for recovery. The MANET structure used
in our algorithm is hierarchical based. The scheme is based for Cluster Based Routing Protocol (CBRP)
which belongs to a class of Hierarchical Reactive routing protocols. The protocol proposed by us is nonblocking
coordinated checkpointing algorithm suitable for ad hoc environments. It produces a consistent set of checkpoints; the algorithm makes sure that only minimum number of nodes in the cluster are required to take checkpoints; it uses very few control messages. Performance analysis shows that our algorithm outperforms the existing related works and is a novel idea in the field. Firstly, we describe an organization of the cluster. Then we propose a minimum process coordinated checkpointing scheme for cluster based ad hoc routing protocols.

Download

Congestion and latency in symmetric interconnection topology

by Atiya Azmi and Ruchi Tuli

2012 IEEE Conference on Open Systems, 2012

Ruchi Tuli

Uploads

Papers by Ruchi Tuli

Log In