Sharing delay information in service systems: a literature survey

Service providers routinely share information about upcoming waiting times with their customers, through delay announcements. The need to effectively manage the provision of these announcements has led to a substantial growth in the body of literature which is devoted to that topic. In this survey paper, we systematically review the relevant literature, summarize some of its key ideas and findings, describe the main challenges that the different approaches to the problem entail, and formulate research directions that would be interesting to consider in future work

Admission control and routing to parallel queues with delayed information via marginal productivity indices

This paper addresses the problem of designing and computing a tractable index policy for dynamic job admission control and/or routing in a discrete time Markovian model of parallel loss queues with one-period delayed state observation, which comes close to optimizing an infinite-horizon discounted or average performance objective involving linear holding costs and rejection costs. Instead of devising some ad hoc indices, we deploy a unifying fundamental design principle for design of priority index policies in dynamic resource allocation problems of multiarmed restless bandit type, based on decoupling the problem into subproblems and defining an appropriate marginal productivity index (MPI) for each subproblem. In the model of concern, such subproblems represent admission control problems to a single queue with one-period feedback delay, for which the structure of optimal policies has been characterized in previous work as being of bi-threshold type, yet without giving an algorithm to compute the optimal thresholds. We deploy in such subproblems theoretical and algorithmic results on restless bandit indexation, which yields a fast algorithm that computes the MPI for a subproblem with a buffer size of n performing only O(n) arithmetic operations. Such MPI values can be used both to immediately obtain the optimal thresholds for the subproblem, and to design an index policy for the admission control and/or routing problem in the multi-queue system. The results readily extend to models with infinite buffer space

Automated Test Framework For The Wireless Protocol Stack Development

Testing plays an important role in the wireless protocol stack development. In order to free the testers out of the shielded chamber, allow both the developers and the testers to use the test systems remotely and maximize the expensive test system usage. An automated test framework is highly demanded. In this thesis, the design of the automated test framework is introduced. There are four main components in the test framework. They are the front end, scheduler, test engine and data storage. The architecture and the protocol among these components are described. Further, the evaluation of the scheduler is conducted based on the queueing theory. Based on the simulation result, a good scheduling algorithm is proposed. Compared with the original scheduling algorithm, the new algorithm improves the performance of the low priority users significantly when the test systems are limited. Moreover, the detail design of the test engine is presented. With the control of the intelligent test engine, the automated test framework has the capability to launch the test cases automatically, catch the commands sent by the test system and manipulate the SUT (System Under Test) without human’s interrupt. It fulfills the objective of automation. The automated test framework has been deployed and is working well.1 yea