一种新型的突发汇聚算法研究

分析了现有的突发汇聚算法,同时针对现有汇聚算法的一些特点,提出了一种新型突发包汇聚算法,可以实现在不同网络负载的情况下,根据到达边缘节点的速率同时结合网络的性能(丢包率),动态的调整突发包汇聚的门限值,从而实现了智能组包,克服了原有算法简单,不灵活的缺点.通过仿真结果可以得知,该算法可以明显改善光突发交换网络的丢包率和时延性能,能够很好地支持实时性要求很高的数据业务.     

一种新型的突发汇聚算法研究

分析了现有的突发汇聚算法,同时针对现有汇聚算法的一些特点,提出了一种新型突发包汇聚算法,可以实现在不同网络负载的情况下,根据到达边缘节点的速率同时结合网络的性能（丢包率）,动态的调整突发包汇聚的门限值,从而实现了智能组包,克服了原有算法简单,不灵活的缺点.通过仿真结果可以得知,该算法可以明显改善光突发交换网络的丢包率和时延性能,能够很好地支持实时性要求很高的数据业务.     

光突发交换网络中基于LDPC码的丢包恢复机制(英文)

基于前向纠错编码理论,在光突发交换网络中提出一种丢包恢复机制来降低突发丢失率.构造了一种能对突发包进行在线编解码的低密度奇偶校验码.入口边缘节点通过对信息突发包进行在线编码产生冗余突发包,出口边缘节点利用译码算法从接收到的突发包中恢复出丢失的突发数据.另外,为信息突发包增加一个额外的偏置时间以减少冗余突发与信息突发竞争信道资源.通过OPNET仿真软件对不同丢包恢复机制的性能进行仿真,结果表明,与奇偶校验码提出的丢包恢复机制相比,具有更低的突发丢失率和良好的丢包恢复能力.     

波长重用-扩大基于单纤连接节点的WDM星形单跳网容量

针对可利用的有限信道波长数对基于单纤连接节点的WDM星形单跳网容量限制问题,本文提出了一种有效的解决方案-波长重用.根据该方案,在信道波长数一定的条件下,至少可使网络所支持的节点数-网络容量扩大一倍;在网络节点数不变时,则可大大减少网络节点的排队时延,缓和网络中各通信节点对数据信道波长使用权的竞争矛盾,使网络吞吐量增加1～3倍,有效地改善网络性能.本文首先论述了该基于单纤连接节点的波长重用WDM星形单跳网结构,接着分析了网络的波长重用特性,进而对所要求的光放大器增益和输出功率进行了计算;最后计算了网络的最大节点数和最大信道波长数.     

基于最少中继节点约束的量子VoIP路由优化策略

量子信息的传输过程中,由于拥塞、链路故障等原因,导致数据分组在路由器排队,产生时延、丢包.为了保证量子Vo IP系统的性能,本文提出了基于最少中继节点约束的路由优化策略.采用基于纠缠交换的中继技术,通过优先选择最少中继节点的量子信道,实现多用户量子Vo IP通信.理论分析和仿真结果表明,当链路出现故障和拥塞时,基于M/M/m型排队系统,采用本策略,当设定量子比特的误码率为0.2,共用信道数目从4增加到8时,量子网络的呼损率由0.25下降到0.024,量子网络的最大吞吐量由64 kbps增加到132 kbps.当设定共用信道数目为4,控制量子比特的误码率从0.3到0.1时,可使量子网络最大吞吐量从41 kbps增加到140 kbps.由此可见,本策略能够极大地提高量子Vo IP网络的性能.     

基于纠缠交换的树形量子局域网传输模型

本文提出了一种基于纠缠交换的量子局域网络传输模型,结合传统通信网络的树形局域网模型,使用经典通信协议,并根据以太网IEEE802.3一般帧格式设置一种帧格式用来承载建立量子信道的控制信息。用户间依靠该局域网模型通过纠缠交换协议以及经典信道辅助传递控制信息来控制用户间量子信道的建立与释放,实现端到端量子信息的传输。对该网络的吞吐率进行分析表明,当节点时延为1μs,将传输过程中理想条件下的概率PSW、Pbel、Ptes设为0.8,则吞吐率随着网络中纠缠粒子生成概率Pbor增加而显著增加,最大为550kb/s;将传输过程中理想条件下的概率Pbor、Pbel、Ptes设为0.8,吞吐率也随着网络中纠缠交换成功概率PSW的增加而增加,最大为450kb/s;同时当节点时延每增加1μs,相同条件下的网络吞吐率将下降50%。因此,在将来量子局域网设置中应尽量提升纠缠交换过程的成功率,同时优化信道,降低经典信道的时延以提高量子局域网中的的系统吞吐率。     

时隙光分组交换网络中一种新的光缓存优化配置方案

研究了时隙光分组交换网中的光缓存配置方案,针对反馈共享式缓存结构,通过对传统的连续分布式光缓存结构中不同延迟粒度的光缓存丢包的分布情况仿真结果研究,发现在传统的连续分布式光缓存结构中,丢包主要发生在小粒度的光缓存上,为此,提出通过适当增加小粒度的光缓存的方法,达到有效地降低丢包率,仿真结果显示,这种光缓存方案可以明显降低节点的丢包率.     

光突发交换网中一种新的有优先权的冲突解决方案

提出了一种解决不同优先级突发包之间资源竞争的方案,分析了该方案下不同优先级的性能(时延和丢包率) .研究结果表明：高优先级突发包的平均时延和丢包率都远小于低优先级突发包,因此该方案能为高优先级突发包提供很好的QoS保障.     

分组传送网中基于业务服务等级的带宽分配机制(英文)

分析了分组传送网络中现存几种带宽资源分配优化算法的优缺点,针对现有带宽资源分配机制无法很好地保证在不同等级业务带宽需求和实现不同业务公平性之间取得平衡的缺陷,提出了一种基于服务等级的带宽调整机制.通过分析基于MPLS-TP技术的分组传送网网络中存在的基本类型的流量,构建出不同类型业务流量所需带宽资源的数学模型.分析了在不同网络带宽资源情况下,基于不同类型流量的带宽资源分配问题,满足不同服务等级业务对带宽、时延、丢包等的不同要求;并着重分析了带宽实时调整机制下,新接入业务的带宽需求对网络中已有的不同服务等级业务占用带宽的影响.通过计算机仿真,表明该机制在保证高等级业务带宽需求的同时,实时调整低等级带宽业务的带宽,尽最大努力满足低等级业务的带宽需求,同时避免出现饿死现象,实现不同服务等级业务占用带宽的公平性.本机制可实现低丢包率,同时保证高等级业务的实时性.     

基于水声信道传播时延排序的分层空时信号检测

基于分层空时编码的多输入多输出技术是一种极具潜力的高速水声通信技术, 但要实现这种潜力需要复杂的空时信号处理方法, 以抵消来自水声信道的多径干扰和异步到达干扰, 以及叠加在接收端的各层信号之间的干扰. 对低复杂度的空时信号处理方案进行了研究, 提出了一种基于子信道传播时延排序的有序连续干扰抵消信号检测算法, 利用子信道间的传播时延差, 实现可使差错概率最小的最佳检测排序; 给出了利用信道估计, 以极低的计算量确定排序的方法, 从而可以大幅降低信号检测的计算复杂度. 采用低复杂度的单载波频域均衡来抵消水声信道中的码间干扰和异步到达干扰. 仿真结果表明, 基于时延排序的信号处理算法可以获得检测性能的改善, 而且性能增益在高数据率时更加显著. 研究结果表明, 采用有效的信号处理方法可使水声信道中造成信号检测干扰的传播时延成为改善系统性能的有利因素.     

A QoS-Guanranteed Scheduling Algorithm with High Throughput for Edge Nodes of Optical Burst Switching Networks

A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay re quirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.     

A novel scheme based on minimum delay at the edges for optical burst switching networks

This paper proposes a novel scheme based on minimum delay at the edges (MDE) for optical burst switching (OBS) networks. This scheme is designed to overcome the long delay at the edge nodes of OBS networks. The MDE scheme features simultaneous burst assembly, channel scheduling, and pre-transmission of control packet. It also features estimated setup and explicit release (ESXR) signaling protocol. The MDE scheme can minimize the delay at the edge nodes for data packets, and improve the end-to-end latency performance for OBS networks. In addition, comparing with the conventional scheme, the performances of the MDE scheme are analyzed in this paper.     

Contention reduction and service differentiation in OBS networks

Optical burst switching (OBS) has been proposed to be a competitive switching technology for wavelength division networks (WDM) networks. In this switching technique, single burst loss due to contention influences loss of multiple data. Thus, burst loss ratio (BLR) is the main deciding factor for determining the performance of an OBS network. Also, inefficient data channel scheduling algorithm causes burst loss in OBS. In addition to this, the same service to all model of the current Internet is inadequate for the diverse quality of service expectations of Internet applications and users. In this paper, an efficient technique is proposed in which data burst is assembled from several Internet protocol (IP) packets in such a manner that the number of IP packets is changed according to the traffic load. In the proposed scheme, the burst is segmented because the segment located at the end of the contended burst has a greater chance of surviving contention (as the dropped segments are those at the beginning of the contending burst). Thus, the most important (or higher priority) information is enveloped in the last segmented. Further to prevent resource wastage due to over admitting of bursts, the proposed scheme is extended by admission control test for an output link without a fiber delay line (FDL) buffer. Also, modified latest available unscheduled channel with void filling (LAUC-VF) scheduling algorithm utilizing MPLS has been used to provide a scalable and manageable architecture for service differentiation (DiffServ) in IP networks. Simulation results demonstrate that the proposed technique has reduced burst loss rate and better quality of service (QoS) performance in comparison to existing techniques.     

Performance analysis and improvement of loss recovery mechanisms in star OBS networks

In OBS networks, burst loss affects negatively the performance of the higher layers. Proactive loss recovery mechanisms, such as burst cloning, have the advantage of low burst delay but it suffers from low bandwidth utilization. However, reactive loss recovery mechanisms, such as burst retransmission, have the advantage of high bandwidth utilization but at the cost of high burst delay. In this paper, we present an analysis of this trade-off and we propose two new schemes to improve bandwidth utilization while keeping burst delay as low as possible in star OBS networks. The first scheme controls the retransmissions. The second scheme combines burst cloning and burst retransmission mechanisms. Analytical and simulation results show that the both schemes achieve high bandwidth utilization. The results confirm also that compared to basic burst retransmission scheme, the first scheme reduces burst delay only at moderate and high load, however, the second scheme reduce delay at every load.     

An adaptive reservation scheme for optical network

In this paper, the various Optical Burst Switching (OBS) reservation schemes have been examined in order to reduce data loss caused by either channel scheduling or resources. A novel multi-service OBS edge node with synchronized bandwidth reservation mechanism (SRM) has been proposed, which enables high-speed network transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of NS-2 simulation. The results show that the packet delay is kept within the constraint for each traffic flow and the performance metrics such as burst loss rate, throughput and fairness are remarkably improved.     

OBS网络中一种基于优先级和门限的偏射路由算法

为了解决偏射算法在偏射控制上的问题,提出了一种基于优先级和门限的偏射路由算法.该算法采用丢弃少量偏射的高优先级分割突发数据包来保证偏射路由上低优先级非偏射突发数据包的QoS.当冲突发生时,分割偏射优先级低的突发数据包,从而保护高优先级突发数据包|在偏射路由上,通过启用偏射检测函数来判断是允许偏射的分割突发数据包抢占资源或是丢弃偏射的分割突发数据包.仿真结果表明,虽然该算法增加了少量的端到端的传输时延,但这种算法可以很好地控制偏射突发对网络偏射路由上正常流量的影响,并且能够有效地降低整个网络的丢包率,很好地保护高优先级突发数据包的完整性.故这种方法能够有效地提高OBS网络的性能.     

一种光突发交换网络中降低填充开销的突发组装算法(英文)

针对光突发交换(OBS)网络现有组装算法在输入业务量较小时组装填充开销较大的性能缺陷,提出了一种新的突发组装算法,称之为BPRA算法.该组装算法通过改变突发生成时间,在不增加端到端时延的条件下利用偏置时间来延长突发组装时间,从而可以有效降低填充空闲比特的数目.同时提出一个近似分析模型来计算空闲比特填充概率.分析和仿真结果表明BPRA算法可以明显降低组装填充开销.     

Analysis of Wavelength-Routed Optical Burst-Switched Network Performance

This paper studies a novel scalable network architecture combining optical burst switching (OBS) with dynamic wavelength allocation to guarantee quality of service (QoS), forming a wavelength-routed optical burst-switched network. All processing and buffering functions are concentrated at the network edge and bursts are assigned to fast tuneable lasers and routed over a bufferless optical transport core using dynamic wavelength assignment. Different burst aggregation mechanisms are evaluated for a range of traffic statistics in terms of delay and packet loss rate. New network performance parameters in an analytical model quantify the advantages of dynamic wavelength allocation. The results define the operational gain achievable with dynamic wavelength assignment compared to quasi-static wavelength routed optical networks.