R. Nadarajan

R. Nadarajan
PSG College of Technology | psg · Department of Applied Mathematics and Computational Sciences

About

105
Publications
15,409
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
688
Citations
Citations since 2017
13 Research Items
364 Citations
2017201820192020202120222023020406080
2017201820192020202120222023020406080
2017201820192020202120222023020406080
2017201820192020202120222023020406080

Publications

Publications (105)
Article
The process of ranking molecular chemical compounds is a challenging task as it has degeneracy behavior. It is a novel idea to apply graph theory based concepts to predict the rank of each molecular chemical graph, which will reduce the effect of getting the same topological index for more than one molecular compound. The proposed work introduces a...
Article
The physical and biological properties of a chemical molecule entity are related to its structure. One of the basic widely accepted principles in chemistry is that compounds with similar structures frequently share similar physicochemical properties and biological activities. The process of finding structural similarities between chemical structure...
Article
Isotonic separation (IS) is a non-parametric classification technique which constructs an isotonic function from ordered data. The rationale is to convert partially isotonic data into isotonic using a linear programming problem (LPP) and partition the input space into isotonic and non-isotonic regions to make predictions easier. Despite the widespr...
Article
Greenhouse gas emission in transport sector is a major problem with its harmful effects on environment and population. This paper proposes to devise green routing solution for Mobile Advertisement Vehicle (MAV). The objective of the problem is to minimize route cost and carbon emission under time dependent speed constraint. The problem is modelled...
Article
Organizations spend considerable amount of time and money in distributing goods from production centres to customers who are geographically distributed. When vehicles are engaged to make long trips, along with serving the customers it may halt at facility centres like toll booths, warehouses, refuelling stations etc., for some service. The cost and...
Chapter
Full-text available
The human brain is one of the least understood large-scale complex systems in the universe that consists of billions of interlinked neurons forming massive complex connectome. Graph theoretical methods have been extensively used in the past decades to characterize the behavior of the brain during different activities quantitatively. Graph, a data s...
Article
A bi-objective Fuel efficient Green Vehicle Routing Problem (F-GVRP) with varying speed constraint is discussed in this paper as an extension of Green Vehicle Routing Problem (G-VRP). F-GVRP is modelled to minimize both route cost and fuel consumption using goal programming. The problem is solved using Particle Swarm Optimization with Greedy Mutati...
Conference Paper
Green Logistics are gaining importance due to green house gas emissions and its adverse impact on the environment. In this paper, we address the issues with vehicle routing and emissions. This paper reports the emissions that arise with Vehicle Routing Problem with Mid way Halts (VRPMH) and concentrates in finding low cost route for VRPMH using PSO...
Article
Full-text available
Understanding and analyzing the dynamic interactions among the millions of spatially distributed and functionally connected regions in the human brain constituting a massively parallel communication system is one of the major challenges in computational neuroscience. Many studies in the recent past have employed graph theory to efficiently model, q...
Chapter
Full-text available
Design Patterns provide solutions to problems that are notably prevailing in software engineering. The paper targets the importance of design patterns, but also aims on how design patterns uncover and fortify good object oriented principles. A design pattern called Bout was discovered to maintain sessions for a specific period of time. The design i...
Article
Graph similarity plays an essential role in various fields of scientific and industry oriented applications such as bioinformatics and computational chemistry. The process of determining structural similarities between chemical structures of molecules helps to identify common behavior of these molecules. A promising approach to capture the structur...
Conference Paper
Vehicle Routing Problem with Time Windows (VRPTW) is a well known combinatorial optimization problem. Many solution strategies are proposed to solve VRPTW. In this work, a constraint based (COB) heuristic approach is proposed to solve VRPTW. The algorithm uses two stages to solve. In the first stage, priority based decomposition is introduced that...
Conference Paper
Recommender systems serve as business tools which make use of knowledge discovery techniques to reshape the world of E-Commerce. Collaborative filtering (CF), the most effective type of recommender systems, predicts user preferences by learning from past user-item relationships. Prediction algorithms are based on similarity between item vectors or...
Article
Full-text available
Rapid growth in wireless communications gives mobile users the facility to search local emergency services, business events, entertainment activity and other necessary information at anytime from anywhere using any device. Recent research on mobility and spatial–temporal data focuses on techniques for improving data availability and reducing latenc...
Article
The complex nature of neuronal interactions of the human brain has posed many challenges to the research community. To explore the underlying mechanisms of neuronal activity of cohesive brain regions during different cognitive activities, many innovative mathematical and computational models are required. This paper presents a novel Common Function...
Article
Communication networks are ubiquitous, increasingly complex, and dynamic. Predicting and visualizing common patterns in such a huge graph data of communication network is an essential task to understand active patterns evolved in the network. In this work, the problem is to find an active pattern in a communication network which is modeled as detec...
Conference Paper
Full-text available
Design patterns are used in software development to provide reusable solutions. Patterns can improve the documentation and maintenance of existing systems. Shuffle is a method which refers to jumble together, mix, or interchange the positions of objects. The shuffling technique is applied to gaming applications like Jigsaw puzzle, Sudoku, jumbled w...
Article
Adapting dynamic changes in the user needs or in the environment is considered as one of the important quality attributes of a system in the pervasive or ubiquitous environment. An aspect-oriented framework to modularize the dynamic changes using aspects is considered as a solution for creating dynamic adaptable systems. This framework allows the s...
Conference Paper
Collaborative filtering (CF), one of the successful social recommendation approaches, makes use of history of user preferences in order to make predictions. Even though this characteristic of Recommender System has attracted many applications, the quality of recommendations is still inclined by the unreliability of user provided data. In most Recom...
Article
Compression techniques are vital for efficient storage and fast transfer of medical image data. The existing compression techniques take significant amount of time for performing encoding and decoding and hence the purpose of compression is not fully satisfied. In this paper a rapid 4-D lossy compression method constructed using data rearrangement,...
Article
Route planning and goods distribution are a major component of any logistics. Vehicle Routing Problem is a class of problems addressing the issues of logistics. Vehicle Routing Problem with Limited Refueling Halts is introduced in this paper. The objective is to plan a route with an emphasis on the time and cost involved in refueling vehicles. The...
Article
Maximum common induced subgraph (MCIS) of a communication network graph database determine the common substructures which are always active and retain the links between any pair of nodes exactly as in all graphs of the database. Many benchmark graph algorithms to predict MCIS of a graph database deal only with two graphs at a time and seek isomorph...
Article
One of the biggest challenges in the field of computational neuroscience from the perspective of complex network analysis is the measurement of dynamic local and global interactions of the brain regions during cognitive function. Graph theoretic analysis has been extensively applied to study the dynamics of functional brain networks in the recent y...
Conference Paper
Recommender systems are becoming more and more attractive in both research and commercial communities due to Information overload problem and the popularity of the Internet applications. Collaborative Filtering, a popular branch of recommendation approaches, makes predictions based on historical data available in the system. In particular, user bas...
Article
In recent times, Web usage mining has attracted significant attention due to its large number of applications. Existing Web usage mining approaches determine the significance of a Web access pattern by computing its support or utility, considering the entire span time of the database. The discovered frequent and high-utility patterns are treated as...
Conference Paper
Security policy helps to ensure that system always takes the desired input action sequence and works in a proper manner. Formal verification of finite state transactional security policy is necessary to check whether the given policy conforms to the specification. One way to specify finite state transactional security policy is by using a filter au...
Article
Compression techniques are essential for efficient storage and fast transfer of medical image data. In this paper, a rapid 2-D lossy compression technique constructed using wavelet-based contourlet transform (WBCT) and binary array technique (BAT) has been proposed for computed tomography (CT) and magnetic resonance imaging (MRI) images. In WBCT, t...
Conference Paper
Signature verification is a highly complex and challenging task. This paper presents a similarity measure based person-dependent off-line signature verification using fuzzy techniques in image contrast enhancement, feature extraction and verification. Two sets of experimental studies are conducted on CEDAR benchmark dataset and the results are repo...
Article
Isotonic separation is a supervised machine learning technique where classification is represented as a linear programming problem (LPP) with an objective of minimizing the number of misclassifications. It is computationally expensive to solve the LPP using traditional methods when the dataset grows. Evolutionary isotonic separation (EIS), a hybrid...
Conference Paper
Timed edit automaton is action sequence transformer which takes a sequence of actions as input and produces another sequence of actions according to the policy it implements. If the input action sequence obeys the policy then timed edit automaton produces same actions sequence or an equivalent action sequence. If the input action sequence does not...
Article
Monitoring large scale infrastructures hosting an even larger number of applications in highly consolidated multi-tenant environments presents a wealth of problems. Dealing with these challenges is essential since monitoring is the cornerstone to make clouds responsive, failure-tolerant, automated and cost-efficient for operators. In this special i...
Article
Adaptability of dynamic changes in the user's needs is considered as one of the important qualities to be possessed by a software system in pervasive environment. The work described in this paper proposed the solution for creating dynamic adaptable system through encapsulating dynamic changes using aspect-oriented approach. In the proposed solution...
Article
New technologies have provided the educational field with innovations that allow significant improvement in the teaching learning process. The development of information technology has increased the popularity of Web based education,; particularly E-assessment This paper provides an overview of Bayesian Network and its application to handle uncerta...
Article
The objective of the work is to propose a context driven dynamic adaptation model for knowledge assessment in E-Learning system through software as component. Most of the existing models deployed for Knowledge Management have focused on the contents of the assessment while giving less emphasis to the context with which the assessment services are t...
Article
A Collaborative filtering (CF), one of the successful recommendation approaches, makes use of history of user preferences in order to make predictions. Common drawback found in most of the approaches available in the literature is that all users are treated equally. i.e., all users have same importance. But in the real scenario, there are users who...
Article
Full-text available
Mining of frequent web traversal patterns finds pages that co-occur in an order in a transaction. Patterns only with frequency would not provide sufficient information about the preferences or interestingness of users. By adopting utility-based mining model in web traversal pattern mining, users “interestingness of patterns could be found by consid...
Article
In this study, the authors have proposed a new rapid method for the compression of coronary angiogram video sequences. The method is based on the philosophy that diagnostically significant areas of the image should be allocated the greatest proportion of the total allocated bit-budget. The approach uses a wavelet-based contourlet transform coder ba...
Article
In supervised machine learning, a training set containing labeled instances is taken by a learning algorithm to construct a model that is subsequently used for determining the class label of new instances. Isotonic separation is a supervised machine learning technique in which classification is represented as a Linear Programming Problem (LPP) with...
Article
Full-text available
Assessment is an integral part of learning and plays a significant role in education. Adaptive testing is a form assessment in which the tests are tailored to the individual’s ability. This paper presents an adaptive assessment system realized in PHP and MYSQL. The motivation was to investigate the techniques for the improvement of student assessme...
Article
The objective of medical image compression is to reduce the data volume and to achieve a low bit rate in the digital representation of medical images without perceived loss of image quality. However, the demand for transmission bandwidth and storage space in the digital radiology environment, especially Picture Archiving and Communication Systems (...
Article
Making a distributed system adaptable to the dynamic variations in the user requirements is a big challenge in software industries. It is identified that the solution for the adaptability of such dynamic variations can be achieved through reflective middleware. In this paper an efficient solution is proposed by combining aspect oriented approach wi...
Chapter
Data caching at mobile clients is an efficient mechanism to enhance data accessibility and reduce access cost. The issues of cache replacement for location-dependent data have been studied under a geometric location model, and a new cache replacement policy has been proposed by taking into account the spatial and temporal factors.Cache hit ratio is...
Article
Full-text available
In managing huge-enterprise communication networks, the ability to measure similarity is an important performance monitoring function. It is possible to draw certain significant conclusions regarding effective utilization of networks by characterizing a computer network as a time series of graphs with IP addresses as nodes and communication between...
Conference Paper
Web access sequence mining discovers hidden information or knowledge from weblogs containing web usage patterns. The discovered knowledge is useful in many ways for web designers or decision makers to improve the website organization. Several algorithms have been proposed to mine web access sequence patterns and in general they generate candidate s...
Conference Paper
A new model for semantic caching of location dependent data in mobile environments is proposed. In the proposed model, semantic descriptions are designed to dynamically answer the nearest neighbor queries (NNQ) and range queries (RQ) from the client cache. In order to accurately answer user queries, the concept of partial objects is introduced in t...
Article
Full-text available
Measuring similarity of graphs is an important task in graph mining for matching, comparing, and evaluating patterns in huge graph databases. In managing huge-enterprise communication networks, the ability to measure similarity is an important performance monitoring function. It is possible to draw certain significant conclusions regarding effectiv...
Article
Measuring similarity of graphs is an important task in graph mining for matching, comparing, and evaluating patterns in huge graph databases. In managing huge-enterprise communication networks, the ability to measure similarity is an important performance monitoring function. It is possible to draw certain significant conclusions regarding effectiv...
Article
Full-text available
In recent years, graph representations have been used extensively for modelling complicated structural information, such as circuits, images, molecular structures, biological networks, weblogs, XML documents and so on. As a result, frequent subgraph mining has become an important subfi�eld of graph mining. This paper presents a novel Frequent Patte...
Chapter
There has been an unparalleled explosion of textual information flow over the internet through electronic mail, web browsing, digital library and information retrieval systems, etc. Since there is a persistent increase in the amount of data that needs to be transmitted or archived, the importance of data compression is likely to increase in the nea...
Article
In this paper, we propose a new lossy image compression algorithm for DICOM ( Digital Imaging and Communications in Medicine) images using Bilinear interpolation. This method presents a technique for classification of the image blocks on the basis of threshold value of variance. The image is divided into [m×n] blocks. Depending on the variance, the...
Article
Data caching in mobile clients is an important technique to enhance data availability and improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. In this paper, the authors study the issues of cache replacement for location-dependent data under a ge...
Article
Frequent sequence mining has been a topic of research interest in recent years. Mining of web log sequence with forward references is an application of sequence mining and useful with many applications that include web recommendation, caching, pre-fetching etc. In this study, a fast algorithm presented that aims at mining prefix based maximal frequ...
Article
This paper presents an application of discrete cosine transform compression technique on color medical images. The binary matrix technique is used to encode the coefficients. Initially the image is divided into R,G,B planes, discrete cosine transform(DCT), threshold function, quantization and binary matrix technique is applied to the planes. In the...
Article
Full-text available
Graphs have become indispensable in modeling and representing complicated structured data such as proteins, chemical compounds, and XML documents. Development of graph databases for use in research and development is a well-established activity in pharmaceutical and chemical industries. Storing the graphs into large databases is a challenging task...
Article
In recent years, mining of sequential patterns has been studied extensively in various domains. Most of the existing algorithms find patterns in transactional databases by scanning the records whether they contain patterns or not. This paper proposes a novel algorithm to mine closed sequential patterns using an inverted matrix and prefix based sequ...
Article
In this paper, new strategies for prefetching and cache replacement are proposed. The proposed pre-fetching algorithm considers the geographical and semantic adjacency between queried items. The strategy is to pre-fetch the most probable secondary service as a by-product of the execution of a query to a primary service. Association rule mining is u...
Article
There has been an unparalleled explosion of textual information flow over the internet through electronic mail, web browsing, digital library and information retrieval systems, etc. Since there is a persistent increase in the amount of data that needs to be transmitted or archived, the importance of data compression is likely to increase in the nea...
Article
An important question in information retrieval is how to create a database index which can be searched efficiently for the data one seeks. One such technique called signature file based access method is preferred for its easy handling of insertion and update operations. Most of the proposed methods use either efficient search method or tree based i...
Article
Lossless data compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic coding, the Lempel-Ziv family, prediction by partial matching and Burrow-Wheeler transform based algorithms. One approach for attaining better compression is to develop generic, reversible transformation that can be applied to...
Article
We follow signature-based approach to object-oriented query handling in this paper. The use of signature files as an index for full text search has been widely known and used. Signature file based access methods initially applied on text have now been used to handle set-oriented queries in Object- Oriented Data Bases (OODB). All the proposed method...
Conference Paper
This paper proposes a cache management method that manages the cache content by pre-fetching data items with maximum prefetch score and evicting cache data items with minimum replacement score. The strategy is to pre-fetch the most probable secondary services based on user's query pattern. The client cache is partitioned into three sections to plac...
Conference Paper
Data caching in mobile clients is an important technique to enhance data availability and to improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. In this paper, we study the issues of cache replacement for location-dependent data under a geometri...
Article
Full-text available
This paper proposes a new fuzzy similarity measure to calculate the degree of similarity of generalized fuzzy numbers (GFN's).The fuzzy similarity measure is developed by integrating the concept of centre of gravity (COG) points and fuzzy difference of distance of points of fuzzy numbers. A fuzzy description for difference of distances between fuzz...
Conference Paper
Data caching in mobile clients is an important technique to enhance data availability and to improve data access time. Due to cache size limitations, cache replacement policies are used to find a suitable subset of items for eviction from the cache. The existing policies focus on Euclidean space and consider Euclidean distance as a spatial paramete...
Chapter
Association rule mining was originally applied in market basket analysis which aims at understanding the behaviour and shopping preferences of retail customers. The knowledge is used in product placement, marketing campaigns, and sales promotions. In addition to the retail sector, the market basket analysis framework is also being extended to the h...
Conference Paper
Incrementality is a major challenge in the mining of dynamic databases. In such databases, the maintenance of association rules can be directly mapped into the problem of maintaining closed frequent itemsets. A number of incremental strategies have been proposed earlier with several limitations. A serious limitation is the need to examine the entir...
Article
Recent studies have shown an increasing thrust on the development of algorithms based on a lattice framework. Efficient pruning of the search space is an important factor which determines the performance of such algorithms. In this communication, we present certain lattice theoretical concepts relevant to our work and propose two novel hybrid strat...
Article
Full-text available
Using a Global Positioning System (GPS) in the car navigation system enables the driver to perform a wide range of queries, from locating the car position, to finding a route from a source to a destination, or dynamically selecting the best route in real time. With spatial network databases (SNDB), objects are restricted to move on pre-defined path...
Conference Paper
Incrementality is a major challenge in the mining of dynamic databases. In such databases, the maintenance of association rules can be directly mapped into the problem of maintaining closed frequent itemsets. A number of incremental strategies have been proposed earlier with several limitations. A serious limitation is the need to examine the entir...
Conference Paper
Signature file based access methods initially applied on text have now been used to handle set-oriented queries in Object-Oriented Data Bases (OODB). All the proposed methods use either efficient search method or tree based intermediate data structure to filter data objects matching the query. Use of search techniques retrieves the objects by seque...
Conference Paper
Caching frequently accessed items on the mobile client is an important technique to enhance data availability and to improve data access time. Cache replacement policies are used to find a suitable subset of items for eviction from the cache due to limited cache size. The existing policies rely on Euclidean space and consider Euclidean distance as...
Conference Paper
A desired feature of data mining systems is the ability to support ad hoc and interactive data mining in order to facilitate flexible and effective knowledge discovery. Data mining query languages can be designed to support such a feature. There are data mining query languages like DMQLfor mining relational databases. In this paper, we have propose...
Article
The task of finding frequent itemsets in a dataset forms the computationally intensive task in association rule mining. The last decade has witnessed a number of state-of-art strategies directed at the Frequent Itemset Mining (FIM) problem. Some of these are hybrid which combine the desirable characteristics of several algorithms. The proposed hybr...
Conference Paper
Nowadays different approaches are coming forth to tutor students using computers. In this paper, a computer based intelligent tutoring system (ITS) is presented. It projects out a new approach dealing with diagnosis in student modeling which emphasizes on Bayesian networks (for decision making) and item response theory (for adaptive question select...
Conference Paper
In this paper we present an overview of the architectural design of the BiTutor which is a Bayesian Intelligent Tutoring System. This is an on-going research whose final goal is to build an open Intelligent Tutoring System (ITS). Every component of the architecture has its own strategies and tools that makes it intelligent. This makes the entire sy...
Conference Paper
This paper proposes a decision model for BiTutor using Decision Bayesian Networks. The BiTutor is a Bayesian Intelligent Tutoring System whose architecture is composed of intelligent modules like student model, knowledge domain and the adaptation module. Bayesian Networks are used to assess users' state of knowledge and preferences, in order to sug...
Conference Paper
Enumeration of the frequent itemsets forms the computationally intensive task in Association rule mining. Pruning the search space is a primary objective in many of the proposed strategies. However some of the methods effectively apply only the downward closure property and often a number of computations are wasted in examining infrequent nodes .We...
Article
We study the constant retrial queue with two heterogeneous servers under the steady-state conditions. Explicit expressions are obtained for the steady-state system size probabilities and the expected number of customers in the orbit. A cost model for the system is obtained. The Laplace-Stieltjes transform of the virtual waiting time distribution fo...
Conference Paper
Nowadays different approaches are coming forth to tutor students using computers. In this paper, a computer based intelligent tutoring system (ITS) is presented. It projects out a new approach dealing with diagnosis in student modeling which emphasizes on Bayesian Networks (for decision making) and Item Response Theory (for adaptive question select...
Conference Paper
Full-text available
Random access text compression is a type of compression technique in which there is a direct access to the compressed data. It facilitates to start decompression from any place in the compressed file, not necessarily from first. If any byte changed during transmission, the remaining data can be retrieved safely. In this paper, a try has been made t...
Conference Paper
Parallel computing in network of workstations is receiving lot of attentions from the research community. However, still it is faced with many practical difficulties. One of the major problems is the lack of high level programming model. Many programming languages provide an efficient system, but employ a relatively low level programming model and...
Article
We derive the system size distribution and expected length of idle and busy period of a M-X/G(a, b)/1 queueing system with N-policy, multiple vacations and setup time. After finishing a service, if the queue length is less than "a", the server leaves for a vacation of random length. When he returns, if the queue length is less than "N" (N greater t...
Article
An M|M|s queueing model with repeated vacation is studied under the following condition. The system should have at least r servers always available (busy or idle) for service and only the remaining (s - r) servers are allowed to go for vacation, when they are free. The distribution of the number of busy servers and the mean number of units in the s...
Article
A parallel Markovian model with R repairmen and a vacation for the repairmen is considered. In this paper two models are analysed. In the first model, a repairman takes only a single vacation at a time. In the second model a repairman returning to an empty queue immediately takes another vacation. A recursive computational approach is given to solv...
Article
A single-server queueing system with general bulk service that alternates stochastically between operational state and failed (or repair) state is considered. The system, when operational, functions as a single-server Poisson queue with general bulk service. When it fails, no service occurs but customers continue to arrive according to a Poisson pr...
Article
In this paper a multiserver nonpreemptive priority queueing system consisting of two types of customer units with Poisson arrival and exponential service time distribution is analysed. The lower priority units are served in batches according to a general bulk service rule. The higher priority units have nonpreemptive priority over lower priority un...
Article
In this paper a queueing model consisting of three units in series, with a finite number of parallel servers at each unit, is considered. Buffers of nonidentical finite capacity are available between the units. A buffer of infinite capacity is assumed to exist in front of the first unit. The occurrence times for all events have negative exponential...
Article
This paper analyses a queueing model consisting of two units I and II connected in series, separated by a finite buffer of size N. Unit I has only one exponential server capable of serving customers one at a time. Unit II consists of c parallel exponential servers and they serve customers in groups according to the general bulk service rule. The st...
Article
A single-server preemptive priority queueing system consisting of two types of units, with unlimited Poisson input of high priority and limited Poisson input of low priority, and exponential service time distribution is studied. The higher-priority units are served in batches according to a general bulk service rule and they have preemptive priorit...
Article
This paper analyses two queueing models consisting of two units I and II connected in series, separated by a finite buffer of size N. In both models, unit I has only one exponential server capable of serving customers one at a time and unit II consist of c parallel exponential servers, each of them serving customers in groups according to general b...
Article
We consider a batch service queuering system with a single-vacation policy. The server leaves for a vacation as soon as the system empties. If more than B customers are present when the server returns from a vacation, the first B customers are taken into service. if fewer than B customers are present, all waiting customers go into service. If the s...
Article
A Markovian tandem queue with two units, in which there is general bulk service and server's vacation in unit II, random breakdown in both units and a finite intermediate waiting room, has been studied. Matrix geometric theory is used to find the steady-state probabilities and the steady-state condition.
Article
A Markovian general bulk service queueing system with vacation and additional server is considered. Whenever the number of customers in the queue is less than the quorum, the regular server takes an exponential vacation. An additional server is introduced when the queue length exceeds a preassigned number. The steady state probability vector of the...
Article
We consider two models of the M/M a,b /c queueing system with servers’ vacation. In model I, any server on completion of a service batch of size k (a≤k≤b), who finds less than or equal to (a-1) customers in the waiting line, leaves for any exponential vacation. If any server finds β (0≤β≤a-1) customers on returning to the main system, immediately t...
Article
We study a queueing model consisting of two units 1 and 2 connected in series with a finite intermediate waiting room. The customers in the buffer are served according to a general bulk service rule with exponential times. Unit 2 is in the up state for a random interval of time following an exponential distribution with parameter α and the distribu...

Network

Cited By