一种基于消息中间件的协议一致性测试系统

针对传统的协议一致性测试系统多采用单机架构或基于某些特定的平台,缺乏足够的通用性和可扩展性的这些问题,本文提出并设计了一种基于消息中间件的协议一致性测试系统.利用面向服务架构的消息中间件实现分布式运行环境,不仅增强消息传输的效率和可靠性,还支持对消息传输流程的扩展和重组等.最后,通过实际的测试应用,验证了该系统的通用性、实时性和可扩展性.     

Reservation and allocation policies for influenza vaccines

This research investigates the impact of alternative allocation mechanisms that can be employed in the context of vaccine inventory rationing. Available vaccine inventory can be allocated to arrivals from high priority (target groups such as healthcare professionals) and low priority (non-target groups) demand classes using Partitioned Allocation (PA), Standard Nesting (SN), and Theft Nesting (TN). In any one of the mechanisms, a part of the available inventory is reserved for the exclusive use of the high priority demand class. They differ, however, in how the unreserved portion of the inventory is utilized: Under PA, demand from the high (low) priority class consumes only the reserved (unreserved) quantity. Under SN, demand from the high priority class first consumes the reserved quantity; once and if this quantity is exhausted, high priority demand competes with low priority demand for the remaining inventory. Under TN the sequence of allocation is reversed: both demand classes first compete for the unreserved inventory. Once this portion of inventory is exhausted, high priority demand is fulfilled from the reserved inventory and low priority demand is rejected. We develop service level (probability of fulfilling the entire demand) and fill rate (fraction of demand fulfilled) expressions for all three allocation mechanisms. Based on these expressions, numerical analyses are conducted to illustrate which allocation mechanism a health planner should choose depending on the availability of vaccines, and how the health planner should set the reserved quantity for the high priority class. We observe that (1) there exist certain conditions under which one of the allocation mechanisms outperforms the others and (2) this effect is determined by the decision maker’s choice of the performance measure.     

Scheduling projects with heterogeneous resources to meet time and quality objectives

In service organizations, heterogeneity in workforce skills can lead to variation in end-product/service quality. The multi-mode, resource-constrained, project scheduling problem (MRCPSP), which assumes similar skills among resources in a given resource pool, accounts for differences in quality levels of individuals by assigning different activity durations depending on the skill level used. This approach is often inadequate to model the problem type investigated here. Using typical projects from the customer training division of a large telecommunications company (which motivated this research), a labor assignment problem using a successive work–time concept is formulated and solved using integer programming optimization procedures. The setting represents a multiple-project environment where projects are separate and independent, but require the same renewable resource mix for their completion. The paper demonstrates how the output of the model can be used to identify bottlenecks (or critical resource skills), and also demonstrates how cross-training the appropriately skilled groups or individuals can increase throughput. The approach guides decision-making concerning which workers to cross-train in order to extract the greatest benefits from worker-flexibility.     

Stability of periodic polling system with BMAP arrivals

This paper considers the stability of BMAP/GI/1 periodic polling models with mixed service disciplines. The server attends the N stations in a repeating sequence of stages. Customers arrive to the stations according to batch Markov arrival processes (BMAPs). The service times of the stations are general independent and identically distributed. The characterization of global stability of the system, the order of instability of stations and the necessary and sufficient condition for the stability are given. Our stability analysis is based on the investigation of the embedded Markovian chains at the polling epochs, which allows a much simpler discussion than the formerly applied approaches. This work can also be seen as a survey on stability of a quite general set of polling models, since the majority of the known results of the field is a special case of the presented ones.     

基于Web Service的多层分布式体系结构

文章讨论了客户机/服务器(C/S)结构和浏览器/服务器(B/S)结构的发展,以及这两种结构在大型系统中应用受限的现状。为了解决大型系统中跨平台交互问题,引入WebService技术,介绍了WebService的架构和特点,提出了基于WebService的多层分布式体系结构,并以实例分析了这种结构的工作原理。