Customer Joining Behavior and Regulation Strategy in Visible Multi-Server Queues with Synchronous Vacations of Partial Servers

This paper studies customer joining behavior and system regulation strategy in nonexhaustive visible M/M/m queues with synchronous vacations of a part of the servers.Once this part of the servers are idle,they take multiple vacations simultaneously(vacation period).Until there are customers waiting in the queue,they are reactivated and all servers are busy or idle(busy period).The authors call this part of the servers as“partial servers”.In view of the fully visible queue and the almost visible queue,the authors obtain customers’equilibrium joining threshold strategies and their socially optimal joining threshold strategies,respectively,and observe that customer joining behavior in equilibrium generally makes the system overcrowded,which makes the equilibrium social welfare lower than the optimal social welfare.After regulation,interestingly,for optimizing social welfare,the system manager hopes not only customers arriving in vacation period pay attention to the number of partial servers,but also customers arriving in busy period should care about it rather than ignore.Moreover,arranging more servers for vacation does not necessarily lead to the decrease of social welfare on condition that the number of partial servers is close to m.As for the information advantage of the fully visible case,it is not obvious for increasing social welfare and even unfavorable to servers’profit unless the number of partial servers is big enough.Furthermore,given the different composition of social welfare,there exists the optimal number of partial servers and the optimal arrival rate of customers for maximizing social welfare.

A Multi-server Queue in a Multi-phase Random Environment with Waiting Servers and Customers'Impatience Under Synchronous Working Vacation Policy

In this paper,we develop an M/M/c queueing system in a Markovian environment with waiting servers,balking and reneging,under both synchronous single and multiple working vacation policies.When the system is in operative phase j,j=1,K¯,customers are served one by one.Once the system is empty,the servers have to wait a random period of time before leaving,causing the system to move to vacation phase 0 at which new arrivals can be served at lower rate.Using the method of the probability generating functions,we establish the steady-state analysis of the system.Special cases of the queueing model are presented.Then,explicit expressions of the useful system characteristics are derived.In addition,a cost model is constructed to define the optimal values of service rates,simultaneously,to minimize the total expected cost per unit time via a quadratic fit search method.Numerical examples are provided to display the impact of different system characteristics.

Internet环境下“分布式智能决策支持系统生成器”Browser/Multi-Server结构的研究

针对当前的Internet环境，文章提出了一种新的分布式智能决策支持系统生成器的结构，并着重阐述了IDSSG的这种结构如何在Internet环境下实现。

A Secure Three-Factor Authenticated Key Agreement Scheme for Multi-Server Environment

Multi-server authenticated key agreement schemes have attracted great attention to both academia and industry in recent years.However,traditional authenticated key agreement schemes in the single-server environment are not suitable for the multi-server environment because the user has to register on each server when he/she wishes to log in various servers for different service.Moreover,it is unreasonable to consider all servers are trusted since the server in a multi-server environment may be a semi-trusted party.In order to overcome these difficulties,we designed a secure three-factor multi-server authenticated key agreement protocol based on elliptic curve cryptography,which needs the user to register only once at the registration center in order to access all semi-trusted servers.The proposed scheme can not only against various known attacks but also provides high computational efficiency.Besides,we have proved our scheme fulfills mutual authentication by using the authentication test method.

An efficient hash-based authenticated key agreement scheme for multi-server architecture resilient to key compromise impersonation

During the past decade,rapid advances in wireless communication technologies have made it possible for users to access desired services using hand-held devices.Service providers have hosted multiple servers to ensure seamless online services to end-users.To ensure the security of this online communication,researchers have proposed several multi-server authentication schemes incorporating various cryptographic primitives.Due to the low power and computational capacities of mobile devices,the hash-based multi-server authenticated key agreement schemes with offline Registration Server(RS)are the most efficient choice.Recently,Kumar-Om presented such a scheme and proved its security against all renowned attacks.However,we find that their scheme bears an incorrect login phase,and is unsafe to the trace attack,the Session-Specific Temporary Information Attack(SSTIA),and the Key Compromise Impersonation Attack(KCIA).In fact,all of the existing multi-server authentication schemes(hash-based with offline RS)do not withstand KCLA.To deal with this situation,we propose an improved hash-based multi-server authentication scheme(with offline RS).We analyze the security of the proposed scheme under the random oracle model and use the t4Automated Validation of Internet Security Protocols and Applications''(AVISPA)tool.The comparative analysis of communication overhead and computational complexity metrics shows the efficiency of the proposed scheme.

Cryptanalysis of Two Dynamic Identity Based Authentication Schemes for Multi-Server Architecture

Since network services are provided cooperatively by multiple servers in the lnternet, the authentication protocols for multiserver architecture are required by Internetbased services, such as online game, online trade and so on. Recently, Li et al. analyzed Lee et al.＇s protocol and proposed an improved dynamic identity based authentication protocol for multi-server architecture. They claimed that their protocol provides user＇s anonymity, mutual authentication and the session key agreement against several kinds of attacks. In this paper, a cryptanalysis on Lee et al.＇s scheme shows that Lee et al＇s protocol is also vulnerable to malicious server attack, stolen smart card attack and leak-of-verifier attack. Moreover, Li e/ al.＇s improved protocol is also vulnerable to all these attacks. Further cryptanalysis reveals that Li et al.＇s improved protocol is susceptible to collusion attack.

Efficient Hierarchical Multi-Server Authentication Protocol for Mobile Cloud Computing

With the development of communication technologies,various mobile devices and different types of mobile services became available.The emergence of these services has brought great convenience to our lives.The multi-server architecture authentication protocols for mobile cloud computing were proposed to ensure the security and availability between mobile devices and mobile services.However,most of the protocols did not consider the case of hierarchical authentication.In the existing protocol,when a mobile user once registered at the registration center,he/she can successfully authenticate with all mobile service providers that are registered at the registration center,but real application scenarios are not like this.For some specific scenarios,some mobile service providers want to provide service only for particular users.For this reason,we propose a new hierarchical multi-server authentication protocol for mobile cloud computing.The proposed protocol ensures only particular types of users can successfully authenticate with certain types of mobile service providers.The proposed protocol reduces computing and communication costs by up to 42.6%and 54.2%compared to two superior protocols.The proposed protocol can also resist the attacks known so far.

Weaknesses of a Dynamic ID Based Remote User Authentication Protocol for Multi-Server Environment

Currently, smart card based remote user authentication schemes have been widely adopted due to their low cost and convenient portability. With the purpose of using various different internet services with single registration and to protect the users from being tracked, various dynamic ID based multi-server authentication protocols have been proposed. Recently, Li et al. proposed an efficient and secure dynamic ID based authentication protocol using smart cards. They claimed that their protocol provides strong security. In this paper, we have demonstrated that Li et al.’s protocol is vulnerable to replay attack, denial of service attack, smart card lost attack, eavesdropping attack and server spoofing attacks.

Effects of pooling,specialization,and discretionary task completion on queueing performance

Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.

A Maintenance Service Improvement Approach Based on Queue Networks: Application

The quest to increase the performance of production systems that have become complex leads to the transfer to the maintenance function of the responsibility of guaranteeing the availability of such systems. Also, we will never stop saying that maintenance must integrate into all of the company’s initiatives, to affirm its role, which is to ensure greater availability and sustainability of the means of production. The objective of this paper is to evaluate the reliability and availability of a system without knowing the distribution law of the operating times. Among the methods for evaluating dependability criteria (Fault Trees, Petri Nets, etc.), we are interested in queues that have the advantage of taking into account functional dependencies, thus allowing a quantified optimization of maintenance. Indeed, queues make it possible to model parallel or sequential processes, implementing operations taking place at the same time or one after the other, meeting the needs of modeling production systems. The main result of this paper is the study of the influence of availability on the reliability of a multi-state production system.

LabVIEW中Queue技术在发电机监测系统中的应用

介绍了基于虚拟仪器的在线监测系统的基本组成,其采用PCI总线仪器和LabVIEW可视化的虚拟仪器系统开发平台,把传统仪器的所有功能模块集成在一台计算机中,用户可以通过修改虚拟仪器的软件改变其功能与规模。该系统有效地利用了LabVIEW提供的同步控制Queue技术实现了发电机在现场运行环境下运行状态的监测显示,体现出了其一定的优势。

基于Message Queue技术的医疗信息交换与共享集成平台研究

对目前医院信息系统集成方式进行了分析,简单介绍了IBM Message Queue的技术特点,通过介绍重症监护系统(ICU系统)和HIS系统之间的集成方案,阐述了基于消息机制构建医疗信息交换与共享集成平台的思路和方法。

儿童中医体质与血脂代谢的相关性:基于浦东新区儿童青少年生长发育及健康队列

背景随着社会高速发展,儿童血脂异常检出率逐步上升。目前针对儿童亚健康运用中医体质辨识的数据较少,缺乏临床关联性数据分析。目的观察儿童中医体质与血脂代谢的变化趋势,分析两者间的相关性,为后续连续监测研究提供相关依据。方法本研究数据来源于浦东新区儿童青少年生长发育及健康队列(SCAHC),选取上海市浦东新区2080名健康小学生(二年级、三年级)为研究对象,采用上海中医药大学自主研发的“昭明系统”收集学生2021年及2022年体质信息,中医体质辨识根据人体面色、舌象、症状体征、问卷信息等将儿童分为脾虚质、平和质、气郁质、虚热质、实热质5种体质(偏颇体质指除平和质外所有具有偏向的体质),抽血采集其三酰甘油(TG)、高密度脂蛋白胆固醇(HDL-C)、低密度脂蛋白胆固醇(LDL-C)、总胆固醇(TC)血脂四项信息。分析并比较不同性别儿童血脂异常率以及不同年龄、性别中医体质分布特点及转变情况。采用多因素Logistic回归分析法探讨中医体质与血脂异常的相关性。结果2080名儿童中男1122名(53.9%)、女958名(46.1%),平均年龄为(8.18±0.39)岁;血脂异常儿童522名,血脂异常率为25.09%,其中男272名(52.1%),女250名(47.9%)。2021年儿童中医体质中平和质815名(39.2%),偏颇体质1265名(60.8%);2022年儿童中医体质中平和质764名(36.7%),偏颇体质1316名(63.3%);2021年与2022年儿童中医体质分布比较,差异有统计学意义(χ^(2)=106.28,P<0.001)。男童的偏颇体质检出率高于女童(χ^(2)_(2021年)=14.073,P<0.001;χ^(2)_(2022年)=20.090,P<0.001)。多因素Logistic回归分析排除性别、年龄等人口学影响因素后结果显示,儿童HDL-C升高是平和质(OR=1.624,95%CI=1.258~2.097,P<0.001)、虚热质(OR=0.654,95%CI=0.499~0.858,P=0.002)发生的影响因素。结论观察SCAHC队列儿童中医体质与血脂代谢变化趋势后发现,儿童HDL-C升高可促进平和质的发生,抑制虚热质的发生。

FastQueue:一种高性能的磁盘队列存储管理机制

1.引言 随着消息通信(如消息、短消息)的爆炸式增长,消息传递系统的性能面临严峻的挑战.消息通信的首要特点是高可靠性,在发送人确认消息收到之前必须将消息保存到磁盘上.

Active Queue Management技术的研究与发展

Active Queue Management(AQM)技术通过有效控制输出队列的丢包时间和丢包方式,对拥塞进行早期通告,这在TCP拥塞控制的实现中至关重要。目前对AQM进行较全面介绍和总结的文献尚不多见,以RandomEarly Detection(RED)为重点介绍了这种第一代AQM技术的设计思想、优缺点以及为此出现的多种RED变种方法,另外还简单介绍了其它几种与RED设计思路不同的AQM方法,以期对AQM技术的研究和发展进行较全面的总结,并促进国内学者以及设备制造商对这一技术的关注。

基于Virtual Output Queued交换结构的最大权重匹配算法

信头阻塞（HOL）限制了采用FIFO输入队列交换机的吞吐率，而使用虚输出队列（VOQ）技术可以完全消除HOL阻塞。文章给出了VOQ的交换机模型，介绍了基于最大权重匹配的算法LQF、OCF、LPF及其性能，还描述了更加实用的并行迭代算法i－LQF、i－OCF和i－LPF。文章的结论对于构造高带宽的交换机具有实际意义。

基于IP Queue的实时网页过滤系统的设计与实现

在分析了IP Queue机制的实现技术、HTTP请求报文和响应报文,以及IP数据包的相关特征的基础上,实现了基于IP地址、URL的请求报文过滤以及基于关键词的响应报文过滤的实时网页过滤系统。该系统同时运行于一个具体的网关计费系统,提高了网关的监控能力,为增强同类产品的网络安全尤其是在用户态防火墙和网关监控等方面提供了有益的参考。

基于优先级的Three-Queue调度算法研究

针对Hadoop平台上调度算法存在的不足,提出了一种改进的调度算法———Triple-Queue算法。在充分考虑数据的本地性后,Triple-Queue算法设计了一种改进的优先级计算模型,以有效地区分用户作业的等级,同时又保证一定程度的公平性,进而减小作业执行时间,避免系统资源浪费。实验结果表明,随着数据量的提高,该算法执行效率明显提高,同时能够较好地解决数据本地性问题。

THE TRANSIENT SOLUTION FOR M/G/1 QUEUEWITH SERVER VACATIONS

In this paper, the transient solutions for M/G/1 queues with single server vacation and multiple server vacations are firstly studied, and the recursion expressions of their Laplace transform are given. Further the distribution and stochastic decomposition result of the queue length at a random point in equilibrium are directly obtained from the transient solution. As will be seen this paper provides a intuitive and elegant method for studying transient solutions for M/G/1 queues with single server.

基于Netfilter框架和IP Queue机制的轻量级网络防火墙实现

一般而言,要在Linux下开发防火墙的程序,需要对内核协议栈有深入的理解,并掌握内核协议栈代码的细节。这对普通开发者是非常有难度的。Netfilter是一个支持数据报过滤、数据报处理、NAT等功能的内核子系统框架。以Linux 2.6内核为基础。IP Queue机制是Linux内核在Netfilter框架的基础上提供的,是应用层上的机制,通过NetLink和内核进行交互,这使得开发一些用户态的防火墙应用成为可能。在此基础上,同时实现了一种基于Netfilter框架和IP Queue机制的轻量级防火墙。通过对比测试表明,由于设计清晰的模块架构、较强的可扩展性,本文实现的轻量级防火墙能够很好地达到实际要求,容易开发出更专业防火墙程序。