基于多信道优先级统计的战术数据链MAC协议

为了满足对移动目标实现精确打击而提出的对时敏信息可靠传输的要求,提出一种基于多信道优先级统计的MAC协议(MCPS-MAC)。MCPS-MAC协议将不同优先级业务发送的门限阈值与反应信道忙闲状态的信道占用统计值作为判定数据包是否能够发送的条件,从而极大减少信道冲突,降低数据发送的时延,有效缓和了网络的流量激增导致网络超载的问题,并且保证通信网络中优先级较高的数据包仍然能够成功地发送。仿真结果表明,随着网络节点增多和业务量的增大,Link-16数据链延时急剧增大,导致严重的丢包率,而与之相比较,MCPS-MAC协议的端到端延时恒定在3 ms～4 ms内,能够满足高业务量网络的要求,并保障数据包一次发送的成功率不低于95%。     

光纤通道调度算法研究

针对光纤通道协议中没有规定数据调度算法的问题,在满足系统实时性的情况下,经过对FC-AE-ASM协议的深入分析,提出一种基于令牌桶的优先级和加权轮转相结合的调度算法,同时给出了权值分配和轮转周期的确定方法。在以消息的延迟率作为算法性能的评价指标的基础上,经过仿真,对调度算法的性能进行了验证,结果显示出该算法可以很好地满足航空电子系统实时性要求。     

蜂群无人机数据链自组网协议设计

针对蜂群无人机的国内外发展现状,设计了蜂群数据链组网技术方案,将遥测数据通过窄带和宽带数据链分别传输,通过数据链自组网完成遥控和遥测,增强了测控的可靠性;同时,设计集群数据链自组网协议栈,针对介质访问控制(MAC)协议和路由协议进行设计。基于QualNet和STK的通信网络仿真平台,针对无人机集群数据链的MAC协议和路由协议进行了仿真性能评估,验证了统计优先级多址接入(SPMA)协议的可行性,实现无人机之间不需要预约信道和时隙进行自组网通信,确保了高优先级业务的实时性。     

CAN总线在战车综合电子系统仿真平台中的应用

利用CAN总线开发了战车综合电子系统仿真平台,规划了各终端的功能和信息流程,定义了各终端通信的协议规则,给出了CAN总线波特率的计算方法,实现了各终端间信息的准确、快速传输。测试结果表明,利用CAN总线开发的战车综合电子系统仿真平台性能稳定、可靠性高。     

优先级管理的全双工交换式以太网实时通信

航空电子全双工交换式以太网(AFDX)以其独有的优势在航空航天等领域的应用不断扩展,但是由于通信模式,无法满足实时任务的可预测性和低延迟等要求,因此,研究AFDX的实时性成为一个重要的课题,为了提高网络的实时性最可行的措施就是采取优先级管理模式,对具有优先级的分组传输问题进行了分析,给出了两种优先级排队模型下,不同优先级分组的平均排队等待时间和平均逗留时间,并进行了计算机仿真.得出:采用具有优先级的分组传输模式能很好的提高网络的实时性.     

随机Petri网的光纤通道总线传输模型

利用随机Petri网方法建立了基于FC-AE-1553协议的光纤通道交换式网络的网络模型,验证了模型的可行性。通过仿真计算得到总线性能指标,仿真结果表明光纤通道在带宽、数据延迟、传输媒体和距离、错误检测、优先级等方面具有适合于航空电子系统的良好特性。     

海战场移动自组织网络QoS路由协议研究

针对海战场信息网络动态变化和信息传输具有QoS约束的特点,通过分析现有移动自组织网络路由协议,对多约束QoS路由协议进行深入研究,提出QoS-DSR路由协议,并进行网络仿真,仿真结果表明该路由协议满足海战场信息多约束QoS传输的要求,且具备较好的协议性能,适合海战场复杂多变的环境。     

带优先级的单类型航空弹药转运多目标规划模型

针对航母航空弹药转运过程非常复杂、涉及设备多、要求高的特点，在对其流程进行细致分析的基础上，将其抽象为一个两阶段多目标规划问题。同时，深入分析了转运过程中的各种约束条件、构建了该问题的两阶段优化模型。建模时，不仅考虑了武器升降机的有效利用、弹药量的合理分配等因素，还考虑了转运时对于不同类型弹药转运优先级与停机区弹药需求优先级的要求。通过模型优化，在满足转运优先级要求的基础上，能有效提高航空弹药的转运效率。     

基于FPGA的FC终端协议处理芯片的设计与实现

为满足新一代航空电子系统对光纤通道网络的实际应用,实现FC终端接口板的快速开发,在对光纤通道协议进行深入研究的基础上,提出了一种基于FPGA的FC协议处理芯片的设计方案。对协议处理芯片的功能结构进行研究分析,采用模块化设计思想,对FC帧收发模块、缓冲区流量控制模块、端口状态机以及FC收发通道模块进行详细设计。通过对协议处理芯片的功能测试表明芯片满足高速低功耗的设计要求,该芯片对航空电子系统中光纤通道网络的研究与应用具有一定的借鉴与促进作用。     

动态服务质量的多信道媒体接入控制传输机制

针对航空自组网在高负载下的服务质量及时延问题,提出一种动态服务质量的多信道媒体接入控制传输机制。以多信道检测统计为平台,结合优先级机制,通过在高负载网络中适当遏制低优先级业务,并且进行网络流量优化,保证高优先级业务的低时延发送;同时利用流量预测模型估计网络流量,通过粒子群优化算法进行优化,寻找合适的优先级门限值,确保高优先级业务接入率。通过计算机仿真可知,所设计的动态服务质量的多信道媒体接入控制传输机制,可在大负载网络中动态控制信道的接入,保持良好的网络吞吐量,其高优先级业务接入率达到99%以上,能有效解决航空数据链网络高业务量导致的服务质量及时延问题。     

一种用于SpaceWire网络的混合路由机制设计*

针对星上系统总线多元性导致的星载网络接口和协议不能标准化的发展瓶颈,本文基于SpaceWire总线协议,通过将静态路由(时间触发)与动态路由(事件触发)机制结合,实现了控制数据和载荷数据共用网络。静态路由完全遵循SpaceWire-D协议,在保证确定性传输的同时,通过启发式调度算法首次实现了多时间窗并行调度,并提出利用最大公约数法设计时间窗,以提高网络吞吐量；动态路由通过对随机事件和载荷数据分配优先级,实现传输路径冲突时对紧急任务的优先处理。最后在OPENT中搭建网络系统仿真模型,对所提出的路由机制进行了仿真。实验结果表明,静态路由时段网络吞吐量较现有调度算法有明显提高,动态路由实现了紧急事件优先传输。     

光互连网络中资源预留的多级光互连仲裁机制

基于资源预留策略提出一种多级光互连仲裁机制,通过将网络分级实现快速、高效的仲裁。多优先级数据缓存队列的传输节点设计,提供了不同类型流量的差异化传输;通过预约式两级仲裁机制,实现网络的完全公平与100%的高吞吐率。设计并对快速仲裁通道进行了合理布局,极大地缩短了仲裁延迟。仿真结果表明:采用基于资源预留的分级仲裁策略,在多种流量模式下所有节点均获得公平的服务。与Feather Weight相比,分级仲裁策略吞吐率提高17%;与2-pass相比,仲裁延迟减少15%,同时,功耗减少5%。     

A dynamic inventory system with recycling

This paper deals with a periodic review inventory system in which a constant proportion of stock issued to meet demand each period feeds back into the inventory after a fixed number of periods. Various applications of the model are discussed, including blood bank management and the control of reparable item inventories. We assume that on hand inventory is subject to proportional decay. Demands in successive periods are assumed to be independent identically distributed random variables. The functional equation defining an optimal policy is formulated and a myopic base stock approximation is developed. This myopic policy is shown to be optimal for the case where the feedback delay is equal to one period. Both cost and ordering decision comparisons for optimal and myopic policies are carried out numerically for a delay time of two periods over a wide range of input parameter values.     

一种航空武器数据链MAC协议设计与研究

MAC协议是航空武器数据链组网通信的重要技术,网络的性能依赖于所采用的多址接入协议,也是航空武器数据链研究的难点之一。固定分配、竞争和预约三大类MAC协议各有优缺点以及适应场景,需要根据应用需求设计对应的多址接入协议,以满足通信网络的战术和技术性能指标。在分析数字化战场通信网络——战术数据链组网通信应用的主要MAC协议的基础上,结合航空武器数据链的通信特点和体系结构,提出一种基于固定分配TDMA的航空武器数据链MAC协议——ODTCFMA协议,并对协议的时延性能进行了仿真和分析。分析结果表明,该协议能够同时满足编队战术协同和武器制导的低时延要求,对航空武器数据链的研究具有一定的借鉴意义。     

随机弱实时系统作业调度概率保证分析

随机弱实时系统与强实时系统的显著区别是 ,它不要求实时任务的每一项作业都满足时限要求 ,只要保证作业的时限延误率低于某一阈值 ,其总体执行性能就是可以接受的。提出了概率时间需求分析法 (PTDA) ,用于估计可剥夺静态优先级调度策略下周期性任务的作业满足时限约束的概率的下界 ,并通过一个具体的实例考察了下界的紧性。对实例系统的仿真结果表明 ,PTDA分析的误差小于 1 0 % ,计算速度快 ,可以为弱实时应用的设计提供重要的参考依据     

Dynamic capacity reservation and due date quoting in a make‐to‐order system

We consider a make‐to‐order manufacturer facing random demand from two classes of customers. We develop an integrated model for reserving capacity in anticipation of future order arrivals from high priority customers and setting due dates for incoming orders. Our research exhibits two distinct features: (1) we explicitly model the manufacturer's uncertainty about the customers' due date preferences for future orders; and (2) we utilize a service level measure for reserving capacity rather than estimating short and long term implications of due date quoting with a penalty cost function. We identify an interesting effect (“t‐pooling”) that arises when the (partial) knowledge of customer due date preferences is utilized in making capacity reservation and order allocation decisions. We characterize the relationship between the customer due date preferences and the required reservation quantities and show that not considering the t‐pooling effect (as done in traditional capacity and inventory rationing literature) leads to excessive capacity reservations. Numerical analyses are conducted to investigate the behavior and performance of our capacity reservation and due date quoting approach in a dynamic setting with multiple planning horizons and roll‐overs. One interesting and seemingly counterintuitive finding of our analyses is that under certain conditions reserving capacity for high priority customers not only improves high priority fulfillment, but also increases the overall system fill rate. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

On the (S − 1, S) lost sales inventory model with priority demand classes

In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot‐for‐lot or (S ? 1, S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time, we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 593–610, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10032     

The continuous‐time single‐sourcing problem with capacity expansion opportunities

This paper develops a new model for allocating demand from retailers (or customers) to a set of production/storage facilities. A producer manufactures a product in multiple production facilities, and faces demand from a set of retailers. The objective is to decide which of the production facilities should satisfy each retailer's demand, in order minimize total production, inventory holding, and assignment costs (where the latter may include, for instance, variable production costs and transportation costs). Demand occurs continuously in time at a deterministic rate at each retailer, while each production facility faces fixed‐charge production costs and linear holding costs. We first consider an uncapacitated model, which we generalize to allow for production or storage capacities. We then explore situations with capacity expansion opportunities. Our solution approach employs a column generation procedure, as well as greedy and local improvement heuristic approaches. A broad class of randomly generated test problems demonstrates that these heuristics find high quality solutions for this large‐scale cross‐facility planning problem using a modest amount of computation time. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A produce‐to‐stock system with advance demand information and secondary customers

We consider a manufacturer (i.e., a capacitated supplier) that produces to stock and has two classes of customers. The primary customer places orders at regular intervals of time for a random quantity, while the secondary customers request a single item at random times. At a predetermined time the manufacturer receives advance demand information regarding the order size of the primary customer. If the manufacturer is not able to fill the primary customer's demand, there is a penalty. On the other hand, serving the secondary customers results in additional profit; however, the manufacturer can refuse to serve the secondary customers in order to reserve inventory for the primary customer. We characterize the manufacturer's optimal production and stock reservation policies that maximize the manufacturer's discounted profit and the average profit per unit time. We show that these policies are threshold‐type policies, and these thresholds are monotone with respect to the primary customer's order size. Using a numerical study we provide insights into how the value of information is affected by the relative demand size of the primary and secondary customers. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007