共查询到17条相似文献,搜索用时 453 毫秒
1.
针对光突发交换(0BS)网络现有组装算法在输入业务量较小时组装填充开销较大的性能缺陷,提出了一种新的突发组装算法,称之为BPRA算法.该组装算法通过改变突发生成时间,在不增加端到端时延的条件下利用偏置时间来延长突发组装时间,从而可以有效降低填充空闲比特的数目.同时提出一个近似分析模型来计算空闲比特填充概率.分析和仿真结果表明BPRA算法可以明显降低组装填充开销. 相似文献
2.
3.
4.
5.
光突发交换网络试验平台 总被引:2,自引:2,他引:0
研究并实现了几种光突发交换网络的关键技术,包括高速的突发组装技术、突发调度技术及突发光发射及接收技术等,其中突发接收具有较高的灵敏度和小于80 ns的时钟数据恢复时间.在这些技术的基础上,建立了一个灵活且可扩展的光突发交换网络实验平台.在OBS网络平台上进行了TCP性能评估实验和多QoS业务传输实验。实验结果表明光突发网络中丢包率严重影响其上TCP的性能,但若丢包率小于0.1%,则TCP性能可得到一定程度的保证.光突发交换网络实验平台上的TCP传输实验还表明了OBS物理层带来的额外延时对上层TCP带宽有极大的影响.实验结果还验证了OBS网络中的QoS保证机制. 相似文献
6.
7.
光突发交换网络核心节点中QoS策略研究 总被引:2,自引:2,他引:0
对OBS网络核心节点中所采取的多种改善QoS的策略进行了研究并提出了一种反馈证实机制以减少数据突发的丢失.其原理是在BCP传输建立端到端通路的过程中,如果在某核心节点处不能成功预约波长信道,该节点将在数据突发离开边缘节点之前返送NACK证实信息,取消边缘节点的该数据突发调度输出计划,并将其重新缓冲排队以备再次调度发送.这样可以尽量为数据突发提供可靠的波长路径,减少数据突发的丢失. 相似文献
8.
OBS网络中一种基于优先级和门限的偏射路由算法 总被引:3,自引:3,他引:0
为了解决偏射算法在偏射控制上的问题,提出了一种基于优先级和门限的偏射路由算法.该算法采用丢弃少量偏射的高优先级分割突发数据包来保证偏射路由上低优先级非偏射突发数据包的QoS.当冲突发生时,分割偏射优先级低的突发数据包,从而保护高优先级突发数据包;在偏射路由上,通过启用偏射检测函数来判断是允许偏射的分割突发数据包抢占资源或是丢弃偏射的分割突发数据包.仿真结果表明,虽然该算法增加了少量的端到端的传输时延,但这种算法可以很好地控制偏射突发对网络偏射路由上正常流量的影响,并且能够有效地降低整个网络的丢包率,很好地保护高优先级突发数据包的完整性.故这种方法能够有效地提高OBS网络的性能. 相似文献
9.
基于前向纠错编码理论,在光突发交换网络中提出一种丢包恢复机制来降低突发丢失率.构造了一种能对突发包进行在线编解码的低密度奇偶校验码.入口边缘节点通过对信息突发包进行在线编码产生冗余突发包,出口边缘节点利用译码算法从接收到的突发包中恢复出丢失的突发数据.另外,为信息突发包增加一个额外的偏置时间以减少冗余突发与信息突发竞争信道资源.通过OPNET仿真软件对不同丢包恢复机制的性能进行仿真,结果表明,与奇偶校验码提出的丢包恢复机制相比,具有更低的突发丢失率和良好的丢包恢复能力. 相似文献
10.
为了解决偏射算法在偏射控制上的问题,提出了一种基于优先级和门限的偏射路由算法.该算法采用丢弃少量偏射的高优先级分割突发数据包来保证偏射路由上低优先级非偏射突发数据包的QoS.当冲突发生时,分割偏射优先级低的突发数据包,从而保护高优先级突发数据包|在偏射路由上,通过启用偏射检测函数来判断是允许偏射的分割突发数据包抢占资源或是丢弃偏射的分割突发数据包.仿真结果表明,虽然该算法增加了少量的端到端的传输时延,但这种算法可以很好地控制偏射突发对网络偏射路由上正常流量的影响,并且能够有效地降低整个网络的丢包率,很好地保护高优先级突发数据包的完整性.故这种方法能够有效地提高OBS网络的性能. 相似文献
11.
在光突发交换试验网络中对TCP的性能进行了实验研究.首先研究了丢包对网络性能的影响,表明突发包丢失将导致TCP吞吐量的快速下降,并且丢包率越高,可用的TCP传输带宽越窄.然后分别详细研究了OBS试验网络中的延时损伤和报文段关联增益,以及对TCP传输性能的影响.最后综合考虑这些因素.实验结果表明,在本OBS试验网络中存在一个不随丢包率变化的最优化突发包组装时间250us使得可用TCP带宽最大化.为了最大限度地提高TCP的传输性能,组包时间应该选择等于或稍大于这个最优值. 相似文献
12.
We focus on the burst assembly mechanism and propose a new intelligent method in which the burst is assembled from several internet protocol (IP) packets in which the number of IP packets is changed according to the traffic load and the burst is segmented into several parts, called the ISOBS mechanism. The average burst assembly time of the ISOBS mechanism decreases as compared with the fixed-assembly-time and fixed-assembly-time-and- length mechanisms. The loss ratio decreases 50% as compared with the general optical burst switching (OBS) mechanism. The last segment can carry high quality of service (QOS) information. We can achieve that the loss ratio of the last segment is almost zero when the traffic load is less than 0.05. When the traffic load is 0.9, the loss ratio of the last segment is 0.0041. The ISOBS can support to transmit different QOS data. 相似文献
13.
United assembly algorithm for optical burst switching 总被引:3,自引:0,他引:3
Optical burst switching (OBS) is a promising optical switching technology. The burst assembly algorithm controls burst assembly, which significantly impacts performance of OBS network. This paper provides a new assembly algorithm, united assembly algorithm, which has more practicability than conventional algorithms. In addition, some factors impacting selections of parameters of this algorithm are discussed and the performance of this algorithm is studied by computer simulation. 相似文献
14.
15.
Optical burst switching (OBS) aims at combining the strengths of packet and circuit switching and is considered as a promising technology for implementing the next generation optical Internet, required to cope with the rapid growth of Internet traffic and the increased deployment of new services. In this paper, an optimal burst assembly approach employing traffic shaping (OBATS) for OBS networks has been proposed in order to improve network performance in terms of reduced blocking probability, congestion control and better utilization of bandwidth. Particularly, the proposed scheme aims at reducing the average delay experienced by the packets during the burstification process in optical burst switched (OBS) networks, for a given average size of the bursts produced. Reducing the packet burstification delay, for a given average burst size, is essential for real-time applications; correspondingly, increasing the average burst size for a given packet burstification delay is important for reducing the number of bursts injected into the network and the associated overhead imposed on the core nodes. Simulation results show that the proposed burst assembly approach gives better network performance in terms of burst drop, resource contention and delay as compared to conventional burst assembly approaches. 相似文献
16.
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. 相似文献