一种应用于桥载设备监控网络CSMA/CA机制算法

在机场桥载设备在线监测管理网络的现场应用测试中,针对网络突发事件中高优先级节点传输延时长,节点能耗利用率低的问题,采用基于优先级调度策略思想的网络节点能量优化机制,对网络MAC层协议中的CSMA/CA算法参数做出调整,达到数据快速传输的目的,利用NS2软件进行网络仿真,结果表明该方法提高了高优先级节点的信道访问率,均衡了网络能耗并延长了网络生命周期。     

一种基于分层的量子分组传输方案及性能分析

大规模量子通信网络中,采用量子分组传输技术能有效提升发送节点的吞吐量,提高网络中链路的利用率,增强通信的抗干扰性能.然而量子分组的快速传输与路由器性能息息相关.路由器性能瓶颈将严重影响网络的可扩展性和链路的传输效率.本文提出一种量子通信网络分层结构,并根据量子密集编码和量子隐形传态理论,给出一种基于分层的量子分组信息传输方案,实现端到端的量子信息传输.该方案先将量子分组按照目的地址进行聚类,再按聚类后的地址进行传输.仿真结果表明,基于分层的量子分组信息传输方案能够有效减少量子分组信息在量子通信网络中的传输时间,并且所减少的时间与量子路由器性能与发送的量子分组数量有关.因此,本文提出的量子分组信息传输方案适用于大规模量子通信网络的构建.     

基于分组交换的量子通信网络传输协议及性能分析

量子纠缠交换能够建立可靠的量子远程传输信道, 实现量子态的远程传输. 然而, 基于纠缠交换的量子信道要求网络高度稳定, 否则会浪费大量纠缠资源. 为节省纠缠资源, 本文根据隐形传态理论, 提出了一种基于分组交换的量子通信网络传输协议, 建立了发送量子态所需的纠缠数目与所经过的路由器数、链路错误率的定量关系, 并与纠缠交换传输协议进行了比较. 仿真结果表明, 在链路错误率为0.1% 时, 分组传输协议所使用的纠缠数目少于纠缠交换的数目, 另外, 随着错误率的升高, 分组传输协议所需的纠缠数比纠缠交换协议明显减少. 由此可见, 基于分组交换的量子通信网络传输协议在网络不稳定时, 能够节省大量纠缠资源, 适用于链路不稳定的量子通信网络.     

基于最小化平均分组跳的分组交换多跳光网的设计

本文研究了支持分组交换通信的波长路由光网的逻辑拓扑设计问题,并将它表示为混合整数线性规划问题(MILP),其目标函数为最小化平均分组跳数目.在约束条件中同时考虑了分组传输时延和排队时延.我们以6结点的网络为例,对于不同的收发机数目和时延边界,数值结果表明最小化平均分组跳数目等价于最小化网络拥塞.小的平均分组跳数目可以保证网络通信时具有较小的时延.最后,对于不同的通信模式,我们比较分析了网格的优化性能参数,这些结果有助于提出更好的启发式算法.     

光弹性分组环节点光分组的组装及时延分析

分析了光弹性分组环(ORPR)网络中流量成型时光分组组装算法,提出一种适合ORPR网络的基于控制发送时间的光分组组装算法,并给出了该算法的算法结构.该算法在混合门限组装算法的基础上,通过增加一个控制分组发送间隔的参数,使得光分组单位时间内流量的突发性被平滑,并可以保证ORPR网络的服务质量(QoS)性能,适合于使用容量有限光缓存的ORPR网络.对ORPR节点光分组平均组装时延进行了详细的分析,新算法通过对分组发送间隔的调整,使在不同负载条件下,组装时延的概率分布基本相同.在ORPR中,平均组装时延的稳定对ORPR网络的QoS性能和公平性调度有重要意义,而发送时机的合理选择,可以保证ORPR网络的QoS性能以及公平性.仿真结果表明,新算法使得ORPR网络中的光分组平均组装时延相对稳定,在大多数情况下,可以保证ORPR网络的调度要求.     

多波长双二进制载波抑制归零码光分组产生方法研究

为了简化多波长光分组交换系统的发送端结构,提出了一种基于马赫-曾德尔延时干涉仪(MZDI)器件实现多波长双二进制载波抑制归零码(DCS-RZ)格式的光分组产生方法。该方法采用单个MZDI器件将波分复用(WDM)差分相移键控(DPSK)净荷信号转换成WDM DCS-RZ净荷信号,同时完成WDM非归零码(NRZ)标签与净荷信号的耦合,得到WDM DCS-RZ光分组信号。通过4×40 Gb/s DCS-RZ光分组信号产生、传输和分离仿真实验,验证了方法的可行性。仿真结果表明:240 km光纤传输后,净荷在经过法布里-珀罗(F-P)滤波器分离后接收灵敏度仅下降1.8 d B。     

光弹性分组环(ORPR)节点中光分组组装算法研究

介绍了光弹性分组环(ORPR)节点模型,分析了ORPR网络中流量成型时光分组组装算法,提出一种适合ORPR网络的基于控制发送时间的光分组组装算法,给出了该算法的算法结构,并和传统的光分组组装算法做了比较。该算法通过分组发送间隔的调整,使得分组单位时间内的流量的自相似性被平滑,具有很好地抑制突发性的效果,同时,分组组装的时间门限可以被ORPR调度算法动态调整,可以适应缺乏缓存的ORPR网络的调度机制。     

多波长双二进制载波抑制归零码光分组产生方法研究EI北大核心CSCD

为了简化多波长光分组交换系统的发送端结构,提出了一种基于马赫-曾德尔延时干涉仪(MZDI)器件实现多波长双二进制载波抑制归零码(DCS-RZ)格式的光分组产生方法。该方法采用单个MZDI器件将波分复用(WDM)差分相移键控(DPSK)净荷信号转换成WDM DCS-RZ净荷信号,同时完成WDM非归零码(NRZ)标签与净荷信号的耦合,得到WDM DCS-RZ光分组信号。通过4×40 Gb/s DCS-RZ光分组信号产生、传输和分离仿真实验,验证了方法的可行性。仿真结果表明:240 km光纤传输后,净荷在经过法布里-珀罗(F-P)滤波器分离后接收灵敏度仅下降1.8 d B。     

用于塑料光纤接入网的三优先级控制协议设计

为了解决用有限的码字来实现多于码字数目的多媒体工作站间的信息通信,提出一种基于光码分多址(Optical Code Division Multiple Access,OCDMA)技术的塑料光纤接入网的多优先级控制协议. 该协议通过使用预约方案和仲裁算法可以有效地解决信道冲突和目的地址的冲突问题,可以支持多媒体信息传输中各类信息不同的时间延迟要求.通过建立一个离散马尔科夫链模型对塑料光纤接入网的网络吞吐量和平均延时时间进行了数值分析和仿真实验,结果证明,这种多优先级控制协议能够适应多媒体网络中各类业务对信号时延要求的不同进行信道的优先级分配.     

分组Karhun-Loeve变换/整数小波变换高光谱影像准无损压缩新方法

提出了分组Karhunen-Leove变换(KLT)和整数小波变换(IWT)的高光谱图像数据压缩方法,并采用整数小波变换技术和Set Partitioning in Hierarchical Trees(SPIHT)压缩编码,实现了对分组Karhun-Loeve变换后的数据压缩。该压缩编码方法与现有压缩方法相比,既保留了Karhun-Loeve变换压缩性能和整数小波变换高压缩比的特点,也宜于实时传输。实验结果表明,分组Karhun-Loeve变换/整数小波变换/SPIHT在相同压缩比下,峰值信噪比比Karhun-Loeve变换/小波变换/WSFCVQ、Karhun-Loeve变换/小波变换/改进的对块零树编码压缩和Karhun-Loeve变换/WT/FSVQ分别提高了6 dB,9 dB和8 dB,运算时间减少一半,整体压缩性能有了较大的提高。     

Effective usage of shortest paths promotes transportation efficiency on scale-free networks

With rapid economic and social development, the problem of traffic congestion is getting more and more serious. Accordingly, network traffic models have attracted extensive attention. In this paper, we introduce a shortest-remaining-path-first queuing strategy into a network traffic model on Barabási–Albert scale-free networks under efficient routing protocol, where one packet’s delivery priority is related to its current distance to the destination. Compared with the traditional first-in-first-out queuing strategy, although the network capacity has no evident changes, some other indexes reflecting transportation efficiency are significantly improved in the congestion state. Extensive simulation results and discussions are carried out to explain the phenomena. Our work may be helpful for the designing of optimal networked-traffic systems.     

Delay-Sensitive NOMA-HARQ for Short Packet Communications

This paper investigates the two-user uplink non-orthogonal multiple access (NOMA) paired with the hybrid automatic repeat request (HARQ) in the finite blocklength regime, where the target latency of each user is the priority. To limit the packet delivery delay and avoid packet queuing of the users, we propose a novel NOMA-HARQ approach where the retransmission of each packet is served non-orthogonally with the new packet in the same time slot. We use a Markov model (MM) to analyze the dynamics of the uplink NOMA-HARQ with one retransmission and characterize the packet error rate (PER), throughput, and latency performance of each user. We also present numerical optimizations to find the optimal power ratios of each user. Numerical results show that the proposed scheme significantly outperforms the standard NOMA-HARQ in terms of packet delivery delay at the target PER.     

优先权排队在消防物联网中的应用

针对消防物联网系统中消防监控中心收到的火警信息存在延迟,可能导致救火作战时机延误的问题,提出了一种火警信息优先传输的解决方案。首先,推导出FCFS的M/M/1排队系统的运行指标;其次,将消防报警信息分为火警报警信息、火警消除信息、故障报警信息和故障消除信息等四个优先级,建立非抢占优先权排队系统,并推导出各个优先级的运行指标;最后,从平均逗留时间和平均队长两个维度,比较了非抢占优先权排队系统和M/M/1系统的性能。提出的火警信息优先传输方案,满足了火警信息时延小的要求,同时实现复杂度低,为消防物联网安全信息数据的获取提供一定的理论支撑。     

Design and performance evaluation of a metro WDM storage area network with IP datagram support

Storage area networks (SANs) are becoming an important part of optical MANs (metropolitan area networks). Growing storage and business-continuity needs; high-bandwidth, low latency requirements for SANs; storage infrastructure consolidation; and post-9/11 regulatory issues are among the several driving factors to push this trend. We, in this paper, consider a metro wavelength division multiplexing (WDM) SAN that allows the transmission of variable packet size such as Internet protocol (IP) datagram and evaluate its performance by means of discrete-event simulation. The network is based on one fixed transmitter and multiple fixed receivers. Beginning with an introduction and the context of this work, we describe the network and node architectures; and introduce the medium access control (MAC) protocols. Subsequently, using the Poisson and self-similar traffic, we present and discuss performance of the proposed network architecture in terms of throughput and queuing delay under symmetric and asymmetric traffic scenarios. The simulation results suggested that the proposed architecture is suitable for SAN applications which demand low queuing delay and high throughput.     

光网络中视频业务传输的节点排队机制

对服务质量(QoS)中的队列机制进行了重点的分析, 并对先进先出(FIFO)以及具有优先级(PQ)的两种队列机制的特点进行了详细的比较。具有优先级(PQ)队列可以降低高优先级业务的平均排队时延, 但却无法保证时延抖动的要求。提出了基于具有优先级队列机制的改进方案。仿真结果表明, 新的排队机制有效得解决了具有优先级(PQ)排队机制中无法保证高优先级(视频)业务传输中的时延抖动问题, 当初始时延分布差别很大的数据包在经过节点排队调度之后, 时延抖动有了明显改善。     

The queuing delay analysis at relay node based on cooperative GBN-ARQ protocols

In this paper, a single relay cooperative diversity network model is proposed, analyzing queuing delay of the packets at relay node. Using dynamic radio link adaptation in wireless networks, based on the character of GBN-ARQ protocol and the queuing theory, the paper solves the problem that packets wait to transmit at relay, and presents a relay node to destination node queuing analysis model for GBN-ARQ protocol with fixed feedback delay. The paper establishes Markov model of packet transmission, and the delay statistics at relay node are figured out by using matrix geometric methods.     

波长转换器和光纤延迟线在WDM光分组交换中的结构设计和性能研究

介绍了两种新颖的光分组交换结构——MOD1和MOD2,用于解决分组冲突问题.其特点在于,MOD1共享了一组非简并的延迟线,而MOD2则是共享了一组简并的延迟线和波长转换器.研究表明,对于非突发业务,两种结构都只需要少量的延迟线即可获得理想的性能.此时,MOD1比MOD2更加能降低系统体积和成本.而对于突发业务,如果MOD1所共享的延迟线数量和MOD2所共享的延迟线和转换器的总数量相等,MOD2的分组丢弃率要远远低于MOD1.随着业务突发程度的增加,MOD2中的转换器数量也需要增加才能维持给定的分组丢弃率,但即使业务突发程度很高,MOD2在体积、成本和性能等三方面均可取得较理想的折衷.     

Comparison analysis of optical burst switched network architectures

Optical burst switching (OBS) is a promising paradigm for the next-generation Internet infrastructure. In this paper, a novel efficient network architecture for OBS has been presented and compared with conventional OBS architectures. To enhance OBS system performance, the architecture employs a novel proposed burst assembly algorithm, fiber delay lines (FDLs) and dynamic route selection technique. A queuing model is used to predict the system behavior for both classless and prioritized traffic. Simple closed-form expressions are obtained for the burst-loss probability of both classless and prioritized traffic. Numerical results show that the proposed architecture provides an accurate fit for the performance of the highest traffic class and lower bounds for the other traffic classes that are tighter than earlier known results.     

Analysis of queuing delay in optical space network on LEO satellite constellations

Low earth orbit (LEO) satellite constellations using laser inter-satellite links (ISLs) are recognized as a promising technology to provide global broadband network services. In this paper, the queuing delay model of an optical space network built on LEO satellite constellations is established. It is assumed that the optical space network employs wavelength division multiplexing ISLs with wavelength routing technology to communication satellites and makes routing decisions. With consideration of the network task characterizations such as distribution of task arrival time and task holding duration, simulation experiment results are analyzed and the expression of optical space network queuing delay is given. Both theoretical analysis and simulation results show that features of queuing delay vary with distribution characterizations of the network tasks. It is hoped that the study can be helpful to evaluate the design of constellation networking.