Time Dependent Solution of Batch Arrival Queue with Second Optional Service, Optional Re-Service and Bernoulli Vacation

This paper deals with an M[X]/G/1 queues with second optional service, optional re-service and Bernoulli vacations. Each customer undergoes first phase of service after completion of service, customer has the option to repeat or not to repeat the first phase of service and leave the system without taking the second phase or take the second phase service. Similarly after the second phase service he has yet another option to repeat or not to repeat the second phase service. After each service completion, the server may take a vacation with probability 1-theta or may continue staying in the system with probability . The service and vacation periods are assumed to be general. The time dependent probability generating functions have been obtained in terms of their Laplace transforms and the corresponding steady state results have been obtained explicitly. Also the average number of customers in the queue and the waiting time are also derived. Keywords: Batch arrival, Second optional service, Optional re-service, Average queue size, Average waiting time

Martingale proofs of many-server heavy-traffic limits for Markovian queues

This is an expository review paper illustrating the ``martingale method'' for proving many-server heavy-traffic stochastic-process limits for queueing models, supporting diffusion-process approximations. Careful treatment is given to an elementary model -- the classical infinite-server model $M/M/\infty$, but models with finitely many servers and customer abandonment are also treated. The Markovian stochastic process representing the number of customers in the system is constructed in terms of rate-1 Poisson processes in two ways: (i) through random time changes and (ii) through random thinnings. Associated martingale representations are obtained for these constructions by applying, respectively: (i) optional stopping theorems where the random time changes are the stopping times and (ii) the integration theorem associated with random thinning of a counting process. Convergence to the diffusion process limit for the appropriate sequence of scaled queueing processes is obtained by applying the continuous mapping theorem. A key FCLT and a key FWLLN in this framework are established both with and without applying martingales.Comment: Published in at http://dx.doi.org/10.1214/06-PS091 the Probability Surveys (http://www.i-journals.org/ps/) by the Institute of Mathematical Statistics (http://www.imstat.org

A middleware for a large array of cameras

Large arrays of cameras are increasingly being employed for producing high quality image sequences needed for motion analysis research. This leads to the logistical problem with coordination and control of a large number of cameras. In this paper, we used a lightweight multi-agent system for coordinating such camera arrays. The agent framework provides more than a remote sensor access API. It allows reconfigurable and transparent access to cameras, as well as software agents capable of intelligent processing. Furthermore, it eases maintenance by encouraging code reuse. Additionally, our agent system includes an automatic discovery mechanism at startup, and multiple language bindings. Performance tests showed the lightweight nature of the framework while validating its correctness and scalability. Two different camera agents were implemented to provide access to a large array of distributed cameras. Correct operation of these camera agents was confirmed via several image processing agents

Research into alternative network approaches for space operations

The main goal is to resolve the interoperability problem of applications employing DOD TCP/IP (Department of Defence Transmission Control Protocol/Internet Protocol) family of protocols on a CCITT/ISO based network. The objective is to allow them to communicate over the CCITT/ISO protocol GPLAN (General Purpose Local Area Network) network without modification to the user's application programs. There were two primary assumptions associated with the solution that was actually realized. The first is that the solution had to allow for future movement to the exclusive use of the CCITT/ISO standards. The second is that the solution had to be software transparent to the currently installed TCP/IP and CCITT/ISO user application programs

The network queueing system

Described is the implementation of a networked, UNIX based queueing system developed on contract for NASA. The system discussed supports both batch and device requests, and provides the facilities of remote queueing, request routing, remote status, queue access controls, batch request resource quota limits, and remote output return

On Efficiency and Validity of Previous Homeplug MAC Performance Analysis

The Medium Access Control protocol of Power Line Communication networks (defined in Homeplug and IEEE 1901 standards) has received relatively modest attention from the research community. As a consequence, there is only one analytic model that complies with the standardised MAC procedures and considers unsaturated conditions. We identify two important limitations of the existing analytic model: high computational expense and predicted results just prior to the predicted saturation point do not correspond to long-term network performance. In this work, we present a simplification of the previously defined analytic model of Homeplug MAC able to substantially reduce its complexity and demonstrate that the previous performance results just before predicted saturation correspond to a transitory phase. We determine that the causes of previous misprediction are common analytical assumptions and the potential occurrence of a transitory phase, that we show to be of extremely long duration under certain circumstances. We also provide techniques, both analytical and experimental, to correctly predict long-term behaviour and analyse the effect of specific Homeplug/IEEE 1901 features on the magnitude of misprediction errors

Embedding agents in business applications using enterprise integration patterns

This paper addresses the issue of integrating agents with a variety of external resources and services, as found in enterprise computing environments. We propose an approach for interfacing agents and existing message routing and mediation engines based on the endpoint concept from the enterprise integration patterns of Hohpe and Woolf. A design for agent endpoints is presented, and an architecture for connecting the Jason agent platform to the Apache Camel enterprise integration framework using this type of endpoint is described. The approach is illustrated by means of a business process use case, and a number of Camel routes are presented. These demonstrate the benefits of interfacing agents to external services via a specialised message routing tool that supports enterprise integration patterns