基于虚拟服务器的负载均衡技术研究与实现

Intemet业务量的激增和网络应用特殊化,都使得负载均衡成为迫切需求。Linux虚拟服务器按传输层连接对集群节点进行业务分配,能便捷而高效地实现负载均衡。对Linux虚拟服务器集群的结构与原理进行讨论,重点阐述了满足不同应用需要的4种负载均衡算法,并在Linux操作系统环境下构建了虚拟服务器集群,测试了负载响应、服务性能、调度器备份。结果表明,虚拟服务器集群技术较大幅度地提高了系统的综合性能。     

基于Linux虚拟服务器的负载均衡技术探讨

Internet业务量的激增和网络应用特殊化都使得负载均衡成为迫切需求。如何实现网络服务器负载均衡是一个急待解决的新课题。而LVS是一个具有良好的扩展性、高可靠性、高性能、高可用性的基于Linux系统的服务器集群,利用它可以较好解决这一问题。针对Linux虚拟服务器集群的负载均衡技术,探讨了其体系结构、工作方式、负载均衡算法,并以一简单的应用实例介绍了其具体实现。这样可以在很大程度上减轻网络的负载,提高网络的效率,是未来网络服务器技术的主要发展方向之一。     

客户/服务器计算环境及其数据库服务器的结构分析

本文首先介绍了客户/服务器的有关概念,并详细讨论了客户/服务器带给我们的好处。然后重点研究了客户/服务器系统中数据库服务器的几种结构,并比较了它们之间的优劣。     

基于B/S结构的某连指挥车模拟训练系统

对开发模拟训练系统的原因进行了简要介绍,而后介绍了虚拟场景的建模和系统交互控制功能的实现方法,将三维虚拟现实技术应用在基于浏览器/服务器(B/S)结构的模拟训练系统中,实现了基于VRML和Java语言的三维模拟训练系统,对该系统的技术途径进行了介绍,为系统的开发指明了方向。     

指挥云脑研究

智能化是指挥信息系统未来发展的重要方向。从类脑系统设计角度,基于云计算设计了指挥云脑的技术架构,分别从虚拟神经元、虚拟神经纤维、虚拟感觉、虚拟视觉和听觉系统、虚拟运动系统、虚拟记忆系统、虚拟自主神经系统、虚拟中枢神经系统和虚拟末梢神经系统,对指挥云脑功能进行重点阐述,并基于"数据-知识-智慧"的分层体系描绘了指挥云脑信息运行机理,以期为指挥信息系统的智能化研究提供参考。     

虚拟制造系统的运行机制研究

介绍了虚拟制造系统的技术特点及其相关概念,分析了虚拟制造系统的系统构成和运行机制,并对虚拟制造系统的下一步的发展进行了探讨。     

海事广角

1澳舰来访为庆祝中澳两国建交40周年,澳大利亚海军"巴拉瑞特"号护卫舰在舰长乔纳森·厄尔利海军中校率领下,干5月17-21日对上海进行了友好访问。(江山安鹏摄影报道)2中国船舶信息中心与水晶石集团战略合作签约仪式在北京举行5月16日上午10点,中国船舶信息中心与水品石数字科技股份有限公司战略合作签约仪式在北京水晶石总部举行。中国船舶信息中心副主任安斌峰、     

高速导弹末制导虚拟样机系统设计、建模及校验

总结了国内外虚拟样机技术的发展现状,结合目前正开展的高速末制导虚拟样机系统,对虚拟样机系统建摸、模型校验等技术进行了探讨,并提出了解决方案。     

火炮虚拟随机试验技术

为了实现装备的虚拟随机试验,运用虚拟样机技术和多刚体理论,建立了火炮系统动力学模型;基于模型考虑装备系统结构及参数的随机性、离散性,将随机模拟方法与虚拟试验技术结合,借助MSC\Insight模块开发了火炮虚拟随机试验平台。基于平台进行了火炮虚拟试验,并对实验结果进行了统计分析,实现了装备行为特征的有效模拟。     

基于Virtools 4.0的某型船艇柴油机虚拟维修关键技术研究

针对目前船艇柴油机维修训练方式,提出一种基于Virtools 4.0的虚拟维修方法,并对虚拟维修中的虚拟维修建模技术和虚拟维修仿真技术进行研究讨论,重点分析了场景优化、碰撞检测以及交互式维修过程仿真等关键技术。根据实际维修过程,制定虚拟维修训练流程图,编写交互式维修过程实现程序,实现了对船艇柴油机的虚拟维修仿真。最后结合自身的开发经验总结出Virtools 4.0应用中应注意的几个问题。通过对基于Virtools 4.0的虚拟维修关键技术研究,为船艇柴油机虚拟维修训练系统设计开发提供了一定的理论依据。     

如何利用MS PROXY2.0实现代理服务

目前比较流行的代理服务器软件有很多,但是代理服务的机理大同小异.本文以 Microsoft Proxy Sery-er2.0为例,介绍一下代理服务器的实现.     

Modeling and analysis of flexible queueing systems

We consider queueing systems with multiple classes of customers and heterogeneous servers where customers have the flexibility of being processed by more than one server and servers possess the capability of processing more than one customer class. We provide a unified framework for the modeling and analysis of these systems under arbitrary customer and server flexibility and for a rich set of control policies that includes customer/server‐specific priority schemes for server and customer selection. We use our models to generate several insights into the effect of system configuration and control policies. In particular, we examine the relationship between flexibility, control policies and throughput under varying assumptions for system parameters. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Equilibrium customer strategies and social–profit maximization in the single‐server constant retrial queue

We consider the single‐server constant retrial queue with a Poisson arrival process and exponential service and retrial times. This system has not waiting space, so the customers that find the server busy are forced to abandon the system, but they can leave their contact details. Hence, after a service completion, the server seeks for a customer among those that have unsuccessfully applied for service but left their contact details, at a constant retrial rate. We assume that the arriving customers that find the server busy decide whether to leave their contact details or to balk based on a natural reward‐cost structure, which incorporates their desire for service as well as their unwillingness to wait. We examine the customers' behavior, and we identify the Nash equilibrium joining strategies. We also study the corresponding social and profit maximization problems. We consider separately the observable case where the customers get informed about the number of customers waiting for service and the unobservable case where they do not receive this information. Several extensions of the model are also discussed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001     

Optimal control of noncollaborative servers in two‐stage tandem queueing systems

We consider two‐stage tandem queueing systems with dedicated servers in each station and a flexible server that is trained to serve both stations. We assume no arrivals, exponential service times, and linear holding costs for jobs present in the system. We study the optimal dynamic assignment of servers to jobs assuming a noncollaborative work discipline with idling and preemptions allowed. For larger holding costs in the first station, we show that (i) nonidling policies are optimal and (ii) if the flexible server is not faster than the dedicated servers, the optimal server allocation strategy has a threshold‐type structure. For all other cases, we provide numerical results that support the optimality of threshold‐type policies. Our numerical experiments also indicate that when the flexible server is faster than the dedicated server of the second station, the optimal policy may have counterintuitive properties, which is not the case when a collaborative service discipline is assumed. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 435–446, 2014     

Stochastic analysis of a single server retrial queue with general retrial times

Retrial queueing systems are widely used in teletraffic theory and computer and communication networks. Although there has been a rapid growth in the literature on retrial queueing systems, the research on retrial queues with nonexponential retrial times is very limited. This paper is concerned with the analytical treatment of an M/G/1 retrial queue with general retrial times. Our queueing model is different from most single server retrial queueing models in several respectives. First, customers who find the server busy are queued in the orbit in accordance with an FCFS (first‐come‐first‐served) discipline and only the customer at the head of the queue is allowed for access to the server. Besides, a retrial time begins (if applicable) only when the server completes a service rather upon a service attempt failure. We carry out an extensive analysis of the queue, including a necessary and sufficient condition for the system to be stable, the steady state distribution of the server state and the orbit length, the waiting time distribution, the busy period, and other related quantities. Finally, we study the joint distribution of the server state and the orbit length in non‐stationary regime. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 561–581, 1999     

基于NTP协议的一种校时实现及相关算法

提出一种基于NTP协议的系统校时实现方法及相关算法,将该算法用于大型电子信息系统中,以外部精确时间源和系统中若干台稳定主机构造NTP服务器群,并用NTP服务器群对系统中其它所有网络主机进行精确校时,得到了毫秒级的校时精度。     

顾及时空语义的多主题瓦片数据优化检索方法

针对虚拟地球可视化中多个逻辑图层叠加产生大量同名瓦片索引重叠引起的数据无效访问和内存冗余等问题,提出顾及时空语义的瓦片数据优化检索方法。在客户端实现顾及时空语义的自适应瓦片优选,将视点信息与数据集的时空范围、分辨率和优先级等语义信息自动匹配与自适应筛选过滤,显著提高目标瓦片数据的命中率;在服务器端实现面向主题的内存数据库瓦片数据缓存,进一步提高瓦片数据二次访问的响应速度。实验表明,该方法不受逻辑图层增量影响,保证目标瓦片较高的命中率,缓存方法进一步提升瓦片二次访问效率,显著提高面向多数据集的海量数据实时可视化性能。