Efficient Blind Signatures for Accountability (2008)
Saikat Chakrabarti, Santosh Ch, Kenneth L. Calvert, Mukesh Singhal
Abstract—The problem of building privacy-preserving accountability systems is long-standing and has been extensively studied by the network research community. We observe that blind signatures have...
2 Secure routing in mobile wireless ad hoc networks (2008)
Siddhartha Gupte, Mukesh Singhal
6 We discuss several well known contemporaryprotocols aimed at securing routing in mobile wireless ad hoc networks. 7 We analyze each of these protocols against requirements of ad hoc routing and in...
A Fault-Tolerant Dynamic Channel Allocation Scheme for Enhancing QoS in Cellular Networks ∗ (2008)
Jianchang Yang, D. Manivannan, Mukesh Singhal
In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. When mobile hosts move from one cell to another...
INDUSTRY EXPERIENCE SKILLS (2008)
Dr. Tim Finin, Dr. Yelena Yesha, Dr. Hillol Kargupta, Dr. Arya Gangopadhyay, Dr. Mukesh Singhal
� 4+ years of research experience � Industry experience at IBM, Aether Systems (1 year combined) � 1 patent � 2 journal publications and 12 refereed conference and workshop publications...
Vector clocks have been used to capture causal dependencies between processes in distributed computing systems. Vector clocks are not suitable for mobile computing systems due to (i) lack of...
Abstract: Distributed applications are generally structured as a set of communicating processes executing on multiple processors. As the number of processors in a distributed system and the running...
Ravi Prakash, Michel Raynal X, Mukesh Singhal
-causal ordering is a communication abstraction designed for distributed applications whose messages (i) have to be delivered according to causal ordering and (ii) have a limited lifetime after which...
Abstract: Distributed applications are generally structured as a set of communicating processes executing on multiple processors. As the number of processors in a distributed system and the running...
Ravi Prakash, Mukesh Singhal, Michel Raynal
Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination...
Abstract: Although current firewalls serve the purpose of current network security needs, they have several drawbacks and are not suitable for future networking environments. This paper examines the...
Khalid H. Sheta, Mukesh Singhal
Multimedia applications in broadband ISDN present various types and classes of traffic streams, i.e., connections such as audio, video, and file transfers. Output multiplexers at an ATM switching...
Universal Constructs in Distributed Computations (2007)
Ajay D. Kshemkalyani, Mukesh Singhal
This paper presents two classes of universal constructs that occur in distributed computations and explores their properties. It first examines a pair of universal constructs termed IO and OI...
Reliable multicast transport protocols support dissemination communication and their throughputs are either limited by the sender or by intermediate nodes that consolidate acknowledgements and...
Modeling and Analysis of Channel Transferability in Mobile Computing Environments (2007)
Mobile computers use wireless channels to communicate with other computers. Efficient channel allocation is at the heart of an efficient mobile computing system. The finite number of channels should...
A Firewalling Scheme for Securing MPOA-based Enterprise Networks (2007)
A well-known security problem with MPOA is that cutthrough connections generally bypasses firewall routers if there are any. None of the previously proposed approaches solved the problem properly. In...
An Implementation of Global Flush Primitive using F-channels (2007)
Ashwani Gahlot, Mukesh Singhal
The Global Flush communication primitive allows the sender to order receipt of a message with respect to receipt of other messages. Use of this primitive provides an elegant way to reason about...
A Distributed Graphics Library System (2007)
Frank Addstein, Loren Schwiebert, Rick Parent, Mukesh Singhal
We present a set of library routines that allow easily parallelized graphics rendering routines that require no communication between each parallel task, such as ray-tracing, to be run eciently in an...
Topic Subject: Caching infrastructures/meshes (2007)
Web caches have been recognized as an effective way to reduce Web traffic. Currently, hierarchical organization is a standard way to organize cached information in the Web cache. The search of Web...
A Firewalling Scheme for Securing MPOA-based Enterprise Networks (2007)
A well-known security problem with MPOA is that cut-through connections generally bypasses firewall routers if there are any. None of the previously proposed approaches solved the problem properly....
Characterizing and Evaluating Performance Tradeoffs in Causal Multicasting in ATM Networks (2007)
Frank Adelstein, Mukesh Singhal
Because of the high-speed and QOS guarantees, ATM networks are getting popular in multimedia applications. There are multimedia applications that require messages to be delivered in an order that...
Authenticating DSR using a novel multisignature scheme based on cubic LFSR sequences (2007)
Saikat Chakrabarti, Santosh Ch, Mukesh Singhal, Kenneth L
Abstract. The problem of secure routing in mobile ad hoc networks is long-standing and has been extensively studied by researchers. Recently, techniques of aggregating signatures have been applied to...
A path compression technique for on-demand ad-hoc routing protocols (2004)
Venkata C. Giruka, Mukesh Singhal, Siva Prasad Yarravarapu
Ad-hoc on-demand routing protocols like AODV establish and maintain routes on-demand. However, the paths established by on-demand protocols, which are optimal during route establishment phase, become...
Online variable-bit-rate video traffic smoothing (2003)
Guohong Cao, Wu-chi Feng, Mukesh Singhal
The efficient transmission of variable-bit-rate (VBR) video streams is complicated by the burstiness that video compression standards such as MPEG introduce. Most of the existing techniques...
A Fault-Tolerant Dynamic Channel Allocation Scheme for Enhancing QoS in Cellular Networks (2003)
Jianchang Yang, D. Manivannan, Mukesh Singhal
In cellular networks, it is vital to allocate communication channels efficiently because the bandwidth allocated for cellular communication is limited. When mobile hosts move from one cell to another...
A Delay-Optimal Quorum-Based Mutual (2001)
Exclusion Algorithm For, Guohong Cao, Mukesh Singhal
this paper, we propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to # and still has a low message complexity of #### (# is the size of the quorum...
Mutable checkpoints: A new checkpointing approach for mobile computing systems (2001)
AbstractÐ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...
Distributed fault-tolerant channel allocation for cellular networks (2000)
Guohong Cao, Associate Member, Mukesh Singhal, Senior Member
Abstract—A channel allocation algorithm includes a channel acquisition algorithm and a channel selection algorithm. Most of the previous work concentrates on the channel selection algorithm since...
Jun Xu, Mukesh Singhal, Joanne Degroat
| Existing and emerging layer-4 switching technologies require packet classication to be performed on more than one header elds, known as layer-4 lookup. Currently, the fastest general layer-4 lookup...
Jun Xu, Mukesh Singhal, Joanne Degroat
Existing and emerging layer-4 switching technologies require packet classification to be performed on more than one header fields, known as layer-4 lookup. Currently, the fastest general layer-4...
Provision of QoS-related router functions such as traffic regulation, policy routing, and usage-based accounting requires that a flow table stores state information for active flows. The design of...
Jun Xu (contact, Mukesh Singhal
Abstract: Provision of QoS-related router functions such as trac regulation, policy routing, and usage-based accounting requires that a ow table stores state information for active ows. The design of...
Abstract—Provision of QoS-related router functions such as traffic regulation, policy routing, and usage-based accounting requires that a flow table store state information for active flows. The...
Real-time aware protocols for general e-commerce and electronic auction transactions (1999)
Srividhya Subramanian, Mukesh Singhal
In some applications it is important to be able to detect if a transaction completed within a short stipulated time, and to compensate the customer for losses or refund customer fee if the real-time...
Design and Evaluation of a High-Performance ATM Firewall Switch and Its Applications (1999)
Jun Xu, Student Member, Mukesh Singhal, Senior Member
We present the design of a value-added ATM switch that is capable of performing packet-level (IP) filtering at the maximum throughput of 2.88 Gbit/s per port. This firewall switch nicely integrates...
Distributed Dynamic Fault-Tolerant Channel Allocation for Mobile Computing (1999)
Ravi Prakash, Niranjan G. Shivaratri, Mukesh Singhal
Efficient allocation of communication channels is critical for the performance of wireless mobile computing systems. The centralized channel allocation algorithms proposed in literature are neither...
Suitability of Signature Indexing Over the World Wide Web (1999)
Yuping Yang, Neelam Soundarajan, Mukesh Singhal
Signature indexing has been studied extensively in text database or other databases for many years. The main advantages of a signature file as an access index are its small size, distributability,...
Distributed Dynamic Fault-Tolerant Channel Allocation for Mobile Computing (1999)
Ravi Prakash, Niranjan G. Shivaratri, Mukesh Singhal
Efficient allocation of communication channels is critical for the performance of wireless mobile computing systems. The centralized channel allocation algorithms proposed in literature are neither...
Design and evaluation of a high-performance atm firewall switch and its applications (1999)
Jun Xu, Student Member, Mukesh Singhal, Senior Member
Abstract—We present the design of a value-added ATM switch that is capable of performing packet-level (IP) filtering at the maximum throughput of 2.88 Gbit/s per port. This firewall switch nicely...
Distributed Dynamic Fault-Tolerant Channel Allocation for Cellular Networks (1999)
Ravi Prakash, Mukesh Singhal, Niranjan G. Shivaratri
E cient allocation of communication channels is critical for the performance of wireless mobile computing systems. The centralized channel allocation algorithms proposed in litera-ture are neither...
Signature Cache: A Light Weight Web Cache Indexing Structure (1998)
Current trend in Web cache research is to have Web caches sharing their contents to improve the hit ratio. High performance Web cache sharing requires use of access indexes for Web caches to...
Gopal Dommety, Student Member, Malathi Veeraraghavan, Senior Member, Mukesh Singhal, Associate Member
Abstract — In this paper, we propose an algorithm for optimizing the route of a connection that becomes suboptimal due to operations such as handoffs and location-based reroutes, for mobile ATM...
Design of a High-Performance ATM Firewall (1998)
this paper we present the hardware design of a high-speed ATM firewall that does not require the termination of an end-to-end connection in the middle. We propose a novel firewall design philosophy,...
Certificate Path Generating Protocol (CPGP) for Authenticated Signaling in ATM Networks (1998)
Authenticated signaling is an important security service to be provided by ATM networks to guard against threats of spoofing and impersonation. ATM Forum specifies public key cryptography to be the...
Efficient Δ-Causal Broadcasting (1998)
Roberto Baldoni, Ravi Prakash, Michel Raynal, Mukesh Singhal
\Delta-causal ordering is a communication abstraction designed for distributed applications whose messages (i) have to be delivered according to causal ordering and (ii) have a limited lifetime after...
Ajay D. Kshemkalyani, Mukesh Singhal
This paper formulates invariants that represent necessary and sufficient conditions on the information required for enforcing causal ordering. The paper then presents an optimal algorithm for...
Performance Analysis of Key-partitioned Signature Files (1998)
Dik Lun Lee, Mukesh Singhal, Liming Ren
this paper, we propose a new key-based partitioning method, variable-prefix partitioning, to improve the work done by Lee and Leng [8, 9]. we also present some analytically study of key-partitioned...
A Scalability Model for ECS's Data Server (1998)
Daniel A. Menasce, Mukesh Singhal
This paper presents a model for the scalability analysis of the Data Server subsystem of the EOSDIS Core System (ECS). The goal of the model is to analyze to determine if the planned architecture of...
Efficient Δ-Causal Broadcasting (1998)
Roberto Baldoni, Ravi Prakash, Michel Raynal, Mukesh Singhal
\Delta-causal ordering is a communication abstraction designed for distributed applications whose messages (i) have to be delivered according to causal ordering and (ii) have a limited lifetime after...
A Scalability Model for ECS's Data Server (1998)
Daniel Menasce Dept, Daniel A. Menascé, Mukesh Singhal
This paper presents a model for the scalability analysis of the Data Server subsystem of the EOSDIS Core System (ECS). The goal of the model is to analyze to determine if the planned architecture of...
Efficient Distributed Channel Allocation for Mobile Cellular Networks (1998)
There are two approaches to design a distributed channel allocation algorithms: Search and Update. The update approach has shorter acquisition delay and lower call blocking rate, but higher message...
Dynamic Hashing + Quorum = Efficient Location Management for Mobile Computing Systems (1997)
Prakash, Ravi, Singhal, Mukesh
Location management is a fundamental problem in mobile computing systems. Existing industry standards employ centralized location management schemes. Centralized schemes are not highly scalable. This...
Efficient Multicast in IP/ATM Networks (1997)
Real-time transport protocols rely on IP to disseminate audio/video packets from a sender to one or more receivers. In IP over ATM broadband networks, studies have shown that the effective bandwidth...
Scheduling Fork-Join Computations on Distributed-Memory Multiprocessor Systems (1997)
Khalid Sheta Mukesh, Mukesh Singhal, E. Krueger
In this paper, we develop two analytic models for scheduling fork-join computations on distributed-memory multiprocessor system. The first model allows for arriving tasks to multiplex processors with...
A Comprehensive Survey of Join Techniques in Relational Databases (1997)
Equijoin between two relations is one of the basic operations in relational database and a large volume of research have been devoted to it. However, in recent years, there hasn't been a survey...
Fast Join Execution Using Summary Information in Large Databases (1997)
It is well known that a query execution in relational databases is not fast and join execution is generally the most expensive operation in query executions. All three major join methods, namely,...
Protocols for Secure, Atomic Transaction Execution in Electronic Commerce (1997)
Srividhya Subramanian, Mukesh Singhal
Computer networks are an efficient, inexpensive, convenient and fast mode of communication and information transfer. There is widespread demand for the ability to buy and sell goods, especially...
Vector clock has been used to capture causal dependencies between processes in distributed computing systems. It is not suitable for mobile computing systems due to (i) lack of scalability: its size...
Flat Location Management Scheme for PCNs (1997)
Gopal Dommety, Malathi Veeraraghavan, Mukesh Singhal
This paper presents a "flat" mobile location management scheme for Personal Communication Networks (PCNs) with the goal of reducing both mobile tracking and location costs. Mobile tracking...
On Consistent Checkpointing in Distributed Systems (1997)
Consistent checkpointing simplifies failure recovery and eliminates the domino effect in case of failure by preserving a consistent global checkpoint on the stable storage. However, the approach...
Finding Consistent Global Checkpoints in a Distributed Computation (1997)
Manivannan Robert Netzer, D. Manivannan, Mukesh Singhal
Finding consistent global checkpoints of a distributed computation is important for analyzing, testing, or verifying properties of these computations. In this paper we present a theoretical...
Srividhya Subramanian, Mukesh Singhal
In electronic commerce applications, it is often critical to transact within a short stipulated time. In such applications, it is financially damaging to the customer if the transaction does not...
Dynamic Hashing + Quorum = Efficient Location Management for Mobile Computing Systems (1997)
Location management is a fundamental problem in mobile computing systems. Existing industry standards employ centralized location management schemes. Centralized schemes are not highly scalable. This...
ion A mobile computing system of n cells can be modeled as a system of n processes, one per cell, where a process is a partially ordered set of events. The events of a process correspond to the union...
Finding Consistent Global Checkpoints in a Distributed Computation (1997)
Consistent global checkpoints have many uses in distributed computations. A central question in applications that use consistent global checkpoints is to determine whether a consistent global...
A Distributed Mutual Exclusion Algorithm for Mobile Computing Environments (1997)
Mobile computing systems are expected to revolutionize the way computers are used. Mobile hosts have small memory, a relatively slow processor and low power batteries, and communicate over low...
Finding Consistent Global Checkpoints in a Distributed Computation (1997)
Finding consistent global checkpoints of a distributed computation is important for analyzing, testing, or verifying properties of these computations. In this paper we present a theoretical...
A Certificate Path Generation Algorithm for Authenticated Signaling in ATM Networks (1997)
ATM Forum specifies public key cryptography to be the default ATM authentication mechanism and directory services like X.509 to be the infrastructure for public key distribution and certification....
An Adaptive Causal Ordering Algorithm Suited to Mobile Computing Environments (1997)
Ravi Prakash, Michel Raynal, Mukesh Singhal
Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination...
Broadcast with Time and Causality Constraints for Multimedia Applications (1996)
Baldoni, Roberto, Prakash, Ravi, Raynal, Michel, Singhal, Mukesh
Delta causal ordering is a communication abstraction designed for distributed applications whose messages (i) have to be delivered according to causal ordering and (ii) have a limited lifetime after...
Broadcast with Time and Causality Constraints for Multimedia Applications (1996)
Baldoni, Roberto, Prakash, Ravi, Raynal, Michel, Singhal, Mukesh
Delta causal ordering is a communication abstraction designed for distributed applications whose messages (i) have to be delivered according to causal ordering and (ii) have a limited lifetime after...
A Dynamic Approach to Location Management in Mobile Computing Systems (1996)
Managing location information of mobile nodes is an important issue in mobile computing systems. There isatrade-o between location update e ort (when a node moves) and node nding e ort. In this paper...
An efficient causal ordering algorithm for mobile computing environments (1996)
Michel Raynal, Mukesh Singhal, Ravi Prakash, Ravi Prakash
Programme 1--- Architectures parall`eles, bases de donn'ees, r'eseaux et syst`emes distribu'es Projet Adp Publication interne n955--- Octobre 1995--- 30 pages Abstract: Causal message...
An Optimal Algorithm for Generalized Causal Message Ordering (1996)
Ajay D. Kshemkalyani, Mukesh Singhal
This paper presents an optimal algorithm for enforcing causal message ordering. The algorithm works with non-FIFO channels and allows a process to multicast to arbitrary and dynamically changing...
Quasi-Synchronous Checkpointing: Models, Characterization, and Classification (1996)
Checkpointing algorithms are classified as synchronous and asynchronous in the literature. In synchronous checkpointing, processes synchronize their checkpointing activities so that a globally...
A Dynamic Approach to Location Management in Mobile Computing Systems (1996)
Managing location information of mobile nodes is an important issue in mobile computing systems. There is a trade-off between location update effort (when a node moves) and node finding effort. In...
RMSP: A Reliable Multicast Session Protocol for Collaborative Continuous-Feed Applications (1996)
Walid Mostafa Mukesh, Walid Mostafa, Mukesh Singhal
This report presents a portable reliable multicast session protocol for collaborative continuousfeed applications. The protocol supports NxN group multicast communications at the session layer and...
Khalid H. Sheta, Mukesh Singhal
Multimedia applications in broadband ISDN present various types and classes of traffics such as video teleconferencing, broadband telephony and large file transfers. Multicasting is important in...
Quasi-Synchronous Checkpointing: Models, Characterization, and Classification (1996)
Manivannan Mukesh Singhal, D. Manivannan, Mukesh Singhal
Checkpointing algorithms are classified as synchronous and asynchronous in the literature. In synchronous checkpointing, processes synchronize their checkpointing activities so that a globally...
Quasi-Synchronous Checkpointing: Models, Characterization, and Classification (1996)
Checkpointing algorithms are classified as synchronous and asynchronous in the literature. In synchronous checkpointing, processes synchronize their checkpointing activities so that a globally...
An Efficient Coterie-Based Mutual Exclusion Scheme With Fault-tolerance Capability (1996)
Guohong Cao, Mukesh Singhal, Yi Deng, Naphtali Rishe, Wei Sun
The performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section....
A Low-Overhead Recovery Technique Using Quasi-Synchronous Checkpointing (1996)
In this paper, we propose a quasi-synchronous checkpointing algorithm and a low-overhead recovery algorithm based on it. The checkpointing algorithm preserves process autonomy by allowing them to...
Journal of Parallel and Distributed Computing 60, 451473 (2000) (1996)
An Adaptive Distributed, Guohong Cao, Mukesh Singhal
this paper, we propose a novel distributed channel acquisition algorithm, which is a significant improvement over both approaches. Also, we identify two guiding principles in designing channel...
Low-cost checkpointing and failure recovery in mobile computing systems (1996)
A mobile computing system consists of mobile and stationary nodes, connected to each other by acommunication network. The presence of mobile nodes in the system places constraints on the permissible...
An Efficient Causal Ordering Algorithm for Mobile Computing Environments (1995)
Prakash, Ravi, Raynal, Michel, Singhal, Mukesh
Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination...
Efficient Distributed Detection of Conjunctions of Local Predicates (1995)
Hurfin, Michel, Mizuno, Masaaki, Raynal, Michel, Singhal, Mukesh
Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. This paper presents two efficient...
An Efficient Causal Ordering Algorithm for Mobile Computing Environments (1995)
Prakash, Ravi, Raynal, Michel, Singhal, Mukesh
Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination...
Logical Time: A Way to Capture Causality in Distributed Systems (1995)
Raynal, Michel, Singhal, Mukesh
The concept of causality between events is fundamental to the design and analysis of parallel and distributed computing and operating systems. Usually causality is tracked using physical time, but in...
Efficient Distributed Detection of Conjunctions of Local Predicates (1995)
Hurfin, Michel, Mizuno, Masaaki, Raynal, Michel, Singhal, Mukesh
Global predicate detection is a fundamental problem in distributed systems and finds applications in many domains such as testing and debugging distributed programs. This paper presents two efficient...
An Efficient Causal Ordering Algorithm for Mobile Computing Environments (1995)
Prakash, Ravi, Raynal, Michel, Singhal, Mukesh
Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination...
Logical Time: A Way to Capture Causality in Distributed Systems (1995)
Raynal, Michel, Singhal, Mukesh
The concept of causality between events is fundamental to the design and analysis of parallel and distributed computing and operating systems. Usually causality is tracked using physical time, but in...
Distributed Dynamic Channel Allocation for Mobile Computing (1995)
Mobile computers use wireless channels to communicate with other computers. Efficient channel allocation is at the heart of the design of an efficient mobile computing system. The finite number of...
Distributed Dynamic Channel Allocation for Mobile Computing (1995)
Ravi Prakash, Niranjan G. Shivaratri, Mukesh Singhal
Mobile computing has found increased applications and gained importance in recent years. Mobile computing makes use of cellular/wireless communication networks to provide communication among...
An Efficient Causal Ordering Algorithm for Mobile Computing Environments (1995)
Ravi Prakash, Ravi Prakash, Michel Raynal, Michel Raynal, Mukesh Singhal, Mukesh Singhal
: Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination...
An Efficient Causal Ordering Algorithm for Mobile Computing Environments (1995)
Ravi Prakash Dept, Ravi Prakash, Michel Raynal, Rennes Cedex France, Mukesh Singhal
Causal message ordering is required for several distributed applications. In order to preserve causal ordering, only direct dependency information between messages, with respect to the destination...
A Consensus-Based Approach to Implementing Semaphores in a Distributed Environment (1995)
Mahendra Ramachandran, Mukesh Singhal
Semaphores have been used for synchronization in both uniprocessor and shared memory multi-processor systems. However, in distributed systems, semaphores have not recieved much attention. This has...
Temporal Analysis Of Load Imbalance In Distributed Computing Systems (1995)
Distributed computing systems consist of computers interconnected by communications links. In such systems, statistical fluctuations in job arrival and service patterns cause episodes of load...
Real-Time Causal Message Ordering in Multimedia Systems (1995)
Frank Adelstein, Mukesh Singhal
In multimedia systems, not only do messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites, but cause and effect relations must be maintained....
Real-Time Causal Message Ordering In Multimedia Systems (1995)
Frank Adelstein, Mukesh Singhal
In multimedia systems, not only do messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites, but cause and effect relations must be maintained....
Real-time causal message ordering in multimedia systems (1995)
Frank Adelstein, Mukesh Singhal
In multimedia systems, not only do messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites, but cause and effect relations must be maintained....
Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems (1994)
Ravi Prakash And, Ravi Prakash, Mukesh Singhal
A mobile computing system consists of mobile and stationary nodes, connected to each other by a communication network. The presence of mobile nodes in the system places constraints on the permissible...
Mahendra Ramachandran, Mukesh Singhal
Semaphores provide a basic synchronization mechanism in uni- and multiprocessor systems. Supporting semaphores in distributed systems has not received much attention. DSM systems provide a shared...
Maximal Global Snapshot with Concurrent Initiators (1994)
Ravi Prakash And, Ravi Prakash, Mukesh Singhal
In a distributed system multiple nodes may initiate snapshot collection concurrently. In this paper we present a global snapshot collection algorithm that combines the information collected by each...
Multimedia on Local Area Networks (1994)
Amr Elsaadany Mukesh, Mukesh Singhal, Ming T. Liu
In this paper we address the issues related to the delivery of multimedia streams on local area networks. Multimedia integrates voice and video along with text and images into existing systems. Local...
Priority Ethernets: Multimedia Support on Local Area Networks (1994)
Frank Adelstein, Mukesh Singhal
This paper presents solutions to the problems associated with transfer of multimedia data on Ethernet and qualitatively study the performance of these solutions and their suitability to multimedia...
On the Synchronization Mechanisms in Distributed Shared Memory Systems (1994)
Mahendra Ramachandran, Mukesh Singhal
Distributed Shared Memory (DSM) is the implementation of the shared memory programming paradigm on a distributed memory (or multicomputer) system. Programming multicomputer systems using Distributed...
Frank Adelstein, Mukesh Singhal
This paper addresses the issues related to the delivery of multimedia traffic on local area networks. Multimedia integrates voice and video along with text and images into existing systems....
In Distributed Systems, Guohong Cao, Student Member, Mukesh Singhal
Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, the approach suffers...
Distributed shared memory provides a useful paradigm for developing distributed applications. As the number of processors in the system and running time of distributed applications increase, the...
Measures of the Potential for Load Sharing in Distributed Computing Systems (1993)
In this paper we are concerned with the problem of determining the potential for load balancing in a distributed computing system. We define a precise measure, called the number of sharable jobs, of...
Distributed Rule Monitoring in Active Databases and Its Performance Analysis (1992)
Ing-miin Hsu, Mukesh Singhal, Ming T. Liu
Monitoring rules in a distributed active database involves three design issues: how to decompose rules, how to distribute rules to sites, and how to evaluate distributed rules correctly. In this...
Advisor: Mukesh Singhal, Dept. of Computer and Information Science.
Advisor: Mukesh Singhal, Dept. of Computer and Information Science.
Performance analysis of two mutual exclusion algorithms / (1991)
Thesis (M.S.)--Ohio State University, 1991.
Characterization and correctness of distributed deadlock detection and resolution / (1991)
Thesis (Ph. D.)--Ohio State University, 1991.
Performance analysis of the connection machine / (1991)
Thesis (M.S.)--Ohio State University, 1991.
Advisor: Mukesh Singhal, Dept. of Computer and Information Science.
Advisor: Mukesh Singhal, Dept. of Computer and Information Science.
Issues and Approaches to Design of Real-Time Database Systems (1988)
Mukesh Singhal, Jrgen Hansson, Sten F. Andler, Joakim Eriksson
F9.12> " Use existing technology and adapt it for use in a real-time system by trading a feature such as z Serializability z User friendly interfaces 6LQJDO## 57'%6#LVVXHV#DQG#...
Issues and Approaches to Design of Real-Time Database Systems (1988)
Mukesh Singhal, Sten F. Andler, Joakim Eriksson
lizability - user friendly interfaces Sten F. Andler and Jörgen Hansson, Spring 1999 - 5 Performance Enhancement "by High Cost" Main Memory Database Systems (MMDBS) Main Memory Resident...
Vita.
Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems
A mobile computing system consists of mobile and stationary nodes, connected to each other by a communication network. The presence of mobile nodes in the system places constraints on the permissible...