Reneging occurs when a transport layer data receiver first selectively acks data, and later discards that data from its receiver buffer prior to delivery to the receiving application or socket buffer. Reliable transport protocols such as TCP (Transmission Control Protocol) and SCTP (Stream Control Transmission Protocol) are designed to tolerate reneging. We argue that this design should be chan...

Data reneging occurs when a data receiver first SACKs data, and later discards that data from its receiver buffer prior to delivering it to the receiving application or socket buffer. Today’s reliable transport protocols such as TCP and SCTP are designed to tolerate data reneging. We argue that this design assumption is wrong, in part based on a hypothesis that data reneging rarely if ever occu...

We consider single-server and multi-server queues with deterministic reneging times motivated by the timeout mechanisms used in application servers.. A Volterra integral equation is developed using the level crossing analysis for the M/G/1 queue with reneging. An analytical solution is given for the M/HyperExponential/1 queue with deterministic reneging times and a numerical approach is present...

In this paper, we study a finite capacity Markovian multi-server queuing system with discouraged arrivals, reneging, and retention of reneging customers. The transient state probabilities of the queuing system are obtained by using a computational technique based on the 4th order RungeKutta method. With the help of the transient state probabilities, we develop some important measures of perform...

This paper employs sample path arguments to derive the following convexity properties and comparative statics for an M/M/S queue with impatient customers. If the rate at which customers balk and renege is an increasing, concave function of the number of customers in the system (head-count), then the head-count process and the expected rate of lost sales are decreasing and convex in the capacity...

Although the lost profit from lost business is quite difficult to estimate for the queuing systems with cyclic demands, this paper presents a creative and effective approach to formulate waiting cost including balking loss and reneging loss. The balking probability is defined as the balking index θ1 multiplying by the expected queue length Lq and the reneging probability is defined as the reneg...

In unobservable queueing systems, customers have several chances to leave the system and forgo their service from an agent. Typically customers may choose to leave by balking, which is based on the queue length or they may leave by reneging from the queue, which is based on the virtual waiting time and the patience of the customer. However, the current literature on unobservable queues assumes ...

Abstract. We model costly interactions (contracts) between managers and investors. We suggest that globalization of production and favorable technology shock of the 1990s altered economic environment of managerinvestor interactions. These changes exacerbate agency conflict due to the increased managerial gains from ex post reneging, and, simultaneously, decreased costs of managerial reneging. I...

In this paper, we consider two basic multi-class call center models, with and without reneging. Customer classes have different priorities. The content of different types of calls is assumed to be similar allowing their service times to be identical. We study the problem of announcing delays to customers upon their arrival. For the simplest model without reneging, we give a method to estimate v...

The concept of reneging has been exploited to a great extent in recent past by the queuing modelers. Reneging leads to loss of potential customers. Keeping into mind this negative impact of reneging, a new queuing model has been developed which deals with retention of reneged customers. In this paper, we have developed an M/M/1/N queuing model which deals with retention of reneged customers. Th...