Outsourcing warranty repairs: Dynamic allocation

In this paper we consider the problem of minimizing the costs of outsourcing warranty repairs when failed items are dynamically routed to one of several service vendors. In our model, the manufacturer incurs a repair cost each time an item needs repair and also incurs a goodwill cost while an item is awaiting and undergoing repair. For a large manufacturer with annual warranty costs in the tens of millions of dollars, even a small relative cost reduction from the use of dynamic (rather than static) allocation may be practically significant. However, due to the size of the state space, the resulting dynamic programming problem is not exactly solvable in practice. Furthermore, standard routing heuristics, such as join‐the‐shortest‐queue, are simply not good enough to identify potential cost savings of any significance. We use two different approaches to develop effective, simply structured index policies for the dynamic allocation problem. The first uses dynamic programming policy improvement while the second deploys Whittle's proposal for restless bandits. The closed form indices concerned are new and the policies sufficiently close to optimal to provide cost savings over static allocation. All results of this paper are demonstrated using a simulation study. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

一种具有优先级的MAC协议性能分析

在移动通信中,为了满足高动态终端对接入的高要求,设计了一种带有优先级的随机预约/按需分配相结合的MAC协议RRDAMA-P(random reserve/demand assignment multiple access protocol with priority),并利用Opnet软件进行了建模仿真,仿真结果表明,RRDAMA-P协议不仅可以满足终端的优先级要求,而且实现了更好的吞吐量和时延性能。     

Two exact algorithms for the vehicle routing problem on trees

This article describes a heuristic and two exact algorithms for several classes of vehicle routing problems defined on tree networks. These include capacitated and time‐constrained vehicle routing problems. One of the exact algorithms is based on the computation of bin packing lower bounds. The other uses column generation. The first algorithm performs better on problems containing small customer demands and in which all vehicles are identical. Otherwise, the second algorithm is more powerful and more versatile. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 75–89, 1999     

分布式BGP协议体系结构

随着Internet规模的扩展和连接密度的增加,作为域间路由标准的BGP协议面临严峻挑战。集群路由器的出现,其分布式的计算资源、存储资源以及体系结构上的高度可扩展,有利于解决BGP协议面临的这些问题。在分析BGP协议体系结构无法适应集群路由器分布式特点的基础上,通过对BGP协议功能的解耦合,提出一种新的、分布式的BGP协议体系结构。与传统方式相比,分布式BGP体系结构能够充分利用集群路由器的分布式的计算资源和存储资源,在协议可靠性、管理维护成本、协议多维可扩展性和简化BGP网络设计等方面具有极大优势。     

基于扩展标记变迁模型的时钟同步协议正确性验证

时钟同步协议是时间触发网络的一个重要组成部分,是时间触发网络实时性和确定性的关键。本文基于扩展标记变迁模型对时钟同步协议进行建模,基于模型检测方法对协议是否满足正确性属性进行验证。验证结果证明了在不同启动场景下时钟同步网络协议的正确性,也表明了扩展标记变迁模型对于协议验证的有效性。     

一种基于博弈论的无线网状网络路由与信道分配联合优化算法

无线网络中的路由与信道分配可极大地影响网络的性能.为了解决无线网状网络中的路由与信道分配问题,提出并研究了一种称为CRAG(基于博弈论的无线网状网络路由与信道分配联合优化)的方法.CRAG采用协同博弈的方式将网络中的每个节点模型化为一个弈者,每个弈者的策略为与其相关的路由与信道分配方案,收益函数为给定流量需求矩阵下的成功传输流量.弈者通过协同博弈来优化收益函数以最大化网络的吞吐量.基于NS3的仿真结果表明,CRAG在收敛性、时延、丢包率和吞吐量方面优于其他当前的算法,从而证明了协同博弈的方法可以用于无线网状网络的路由与信道分配联合优化,并有效地改进网络性能.     

Shor-Preskill方法不能直接证明B92量子密钥分配协议

密钥分配协议安全性的证明是确保密钥分配绝对安全的要求 ,经典密码方案的安全性大多难以证明 ,而利用量子力学的基本原理 ,可以证明量子密码方案是无条件安全的。介绍了Shor Preskill对BB84量子密钥分配协议无条件安全性的证明方法 ,归纳了其技巧和特点 ,揭示了对称化方法和量子纠缠提纯技术在该方法中的作用。证明了Shor Preskill方法不能直接用来证明B92协议的无条件安全性。提出了利用Shor Preskill方法间接证明B92的可能途径。     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

参数化系统二维抽象框架

针对参数化系统状态空间爆炸问题提出了一个通用的参数化系统二维抽象框架TDA。对所有进程单独进行抽象,利用参数化系统的设计思想,隐藏系统参数构建全系统的抽象模型,最大限度地剔除了原始系统中的冗余信息。建立的具有真并发语义的参数化系统的形式化模型,更适合描述一般意义上的并发系统,较好地解决了验证大规模同构和异构系统的空间激增问题。理论推导和实例均证实了TDA的正确性和合理性。     

基于TCP/IP协议栈构建的弹上飞控软件评测与验收系统的硬件实现

基于TCP/IP协议栈构建了弹上飞控软件评测与验收系统,详细描述了TCP/IP协议栈在该系统中的应用。