Planning OBS networks with QoS constraints

The design of OBS networks that guarantee QoS provisioning for different classes of traffic is a major topic under current research. In this work we formulate a unified framework for studying QoS in OBS networks with a GMPLS-based control plane. We use this framework in order to investigate two problems. First, the configuration of the parameters of an aggregation strategy so that a given Forwarding Equivalency Class observes its corresponding QoS requirements. Second, we address the problem of planning a whole OBS network given a series of QoS constraints for each one of the Forwarding Equivalency Classes in the network. The presented QoS framework constitutes a valuable tool for studying QoS-related issues in OBS networks.     

一种支持QoS的OBS网络数据信道调度协议

综合考虑了突发包所经历跳数和突发包的长度等因素,文章给出了一种新型的支持服务质量(QoS)的光突发交换(OBS)数据信道调度协议--考虑跳数的改进型JET模式下的优先级抢占(H-PPJET)协议.文章在OBS网络环境中对H-PPJET协议进行了仿真,并与JET模式下的优先级抢占(PPJET)协议进行了对比,仿真结果表明,H-PPJET协议改善了网络的吞吐量和丢包率性能.     

FRR for latency reduction and QoS provisioning in OBS networks

We propose a forward resource reservation (FRR) scheme to reduce the data burst delay at edge nodes in optical burst switching (OBS) systems. We also explore algorithms to implement the various intrinsic features of the FRR scheme. Linear predictive filter (LPF)-based methods are investigated and demonstrated to be effective for dynamic burst-length prediction. An aggressive resource reservation algorithm is proposed to deliver a significant performance improvement with controllable bandwidth cost. By reserving resources in an aggressive manner, an FRR system can reduce both the signaling retransmission probability and the bandwidth wastage as compared with a system without the aggressive reservation. An FRR-based QoS strategy is also proposed to achieve burst delay differentiation for different classes of traffic. Theoretical analysis and simulation results verify the feasibility of the proposed algorithms and show that our FRR scheme yields a significant delay reduction for time-critical traffic without incurring a deleterious bandwidth overhead.     

光突发交换网络中的QoS实现机制研究

光突发交换(OBS)是构造下一代光互联网最有前途的解决方案之一.首先简单介绍了在OBS网络中实现QoS的几种传统机制,接着对波长分组预留策略提出了一种改进方案,并分析了其优越性和可行性.     

光突发交换网中流量特性分析与汇聚机制研究

文章对光突发交换(OBS)网络中的IP流量特性以及汇聚机制进行了深入的研究,通过引入ON／OFF源模型来模拟OBS网络中数据业务的自相似特性,通过对仿真进行分析,验证了ON／OFF理论模型的正确性,最后,利用合成的可控Hurst参数流量源,对几种典型的OBS汇聚算法进行了仿真分析,结果表明,这些汇聚算法对严格自相似性流量的长相关性并没有抑制效果,只是在短时间内对流量具有平滑作用．     

A new busy signal-based MAC protocol supporting QoS for ad-hoc networks with hidden nodes

This article presents three versions of a novel MAC protocol for IEEE 802.11 ad-hoc networks called Busy Signal-based Mechanism turned On (BusySiMOn) (This is an extended version of our conference paper: [15]). The key idea of the proposed solution is based on an intelligent two-step reservation procedure combined with the advantages of EDCA service differentiation. The former alleviates the hidden node problem while the latter ensures compatibility with the IEEE 802.11 standard. Simulation results obtained for saturated and non-saturated network conditions emphasize the advantages of the new protocol over the currently used four-way handshake mechanism in terms of fairness, throughput, and average frame delay.     

解决光突发交换网竞争的新机制

文章提出了一种用于解决光突发交换(OBS)网中突发包之间竞争的新方案,并对它的性能进行了仿真研究。仿真结果表明,该方案可以大幅度降低OBS网络中的数据丢失率。     

A framework of prioritized burst segmentation supporting controlled retransmission in OBS networks

In optical burst switching (OBS) networks, burst contentions in OBS core nodes may cause data loss. To reduce data loss, retransmission scheme has been applied. However, uncontrolled retransmission may increase network load significantly and data loss probability defeating the retransmission purpose. In addition, in a priority traffic existing OBS network, OBS nodes may apply different retransmission mechanisms to priorities bursts for quality-of-service (QoS) support. This study has developed a controlled retransmission scheme for prioritized burst segmentation to support QoS in OBS networks. Unlike previous works in the literature, we have set a different value to retransmission probability at each contention and propose a retransmission analytical model for burst segmentation contention resolution scheme. In addition, we have applied the proposed retransmission scheme to the prioritized burst segmentation for QoS support. We have taken into account the load at each link due to both fresh and retransmitted traffic, and have calculated the path blocking probability and byte loss probability (ByLP) for high-priority and low-priority burst to evaluate network performance. An extensive simulation has been proposed to validate our analytical model.     

Congestion window-based adaptive burst assembly for TCP traffic in OBS networks

Burst assembly is one of the key factors affecting the TCP performance in optical burst switching (OBS) networks. When the TCP congestion window is small, the fixed-delay burst assembler waits unnecessarily long, which increases the end-to-end delay and thus decreases the TCP goodput. On the other hand, when the TCP congestion window becomes larger, the fixed-delay burst assembler may unnecessarily generate a large number of small-sized bursts, which increases the overhead and decreases the correlation gain, resulting in a reduction in the TCP goodput. In this paper, we propose adaptive burst assembly algorithms that use the congestion window sizes of TCP flows. Using simulations, we show that the usage of the congestion window size in the burst assembly algorithm significantly improves the TCP goodput (by up to 38.4% on the average and by up to 173.89% for individual flows) compared with the timer-based assembly, even when the timer-based assembler uses the optimum assembly period. It is shown through simulations that even when estimated values of the congestion window size, that are obtained via passive measurements, are used, TCP goodput improvements are still close to the results obtained by using exact values of the congestion window.     

一种基于虚拟突发的OBS网络业务疏导机制

提出了一种基于虚拟突发光突发交换的(OBS)网络业务疏导机制TG-VB(traffic grooming based on virtual burst)。作为一种多粒度动态业务疏导机制,TG-VB将常规突发通过"逻辑汇聚"组成虚拟突发,增大核心网中业务传输粒度;同时,TG-VB根据虚拟突发整体传输、整体调度的特点,为汇聚的常规突发动态地选择最优的共用传输路径。仿真结果表明,与采用传统疏导机制的OBS网络相比,TG-VB能够有效地减轻核心节点的通信处理开销,降低对网络节点端口数量的需求;在相同负载条件下,TG-VB可极大地提高波长信道利用率。     

OBS网络中一种基于优先级的偏射路由机制

提出了一种基于优先级的偏射路由机制,该机制通过分割偏射优先级低的突发包来保证高优先级突发包的QoS.仿真结果表明,高优先级突发包的丢失率比低优先级的要低,并且突发包的丢失率随数据信道数目的增加而降低.该机制不仅能够有效地降低突发包的丢失率,而且能够为高优先级突发包提供很好的QoS保障.     

A burst segmentation-deflection routing contention resolution mechanism in OBS networks

One of the key problems to hinder the realization of optical burst switching(OBS) technology in the core networks is the losses due to the contention among the bursts at the core nodes.Burst segmentation is an effective contention resolution technique used to reduce the number of packets lost due to the burst losses.In our work,a burst segmentation-deflection routing contention resolution mechanism in OBS networks is proposed.When the contention occurs,the bursts are segmented according to the lowest packet loss probability of networks firstly,and then the segmented burst is deflected on the optimum routing.An analytical model is proposed to evaluate the contention resolution mechanism.Simulation results show that high-priority bursts have significantly lower packet loss probability and transmission delay than the low-priority.And the performance of the burst lengths,in which the number of segments per burst distributes geometrically,is more effective than that of the deterministically distributed burst lengths.     

一种新的低延迟OBS突发组装算法

提高带宽利用率和降低端到端的时间延迟是下一代网络性能的重要指标,文章简单扼要地介绍了目前OBS网络中在提高带宽利用率和降低端到端的时间延迟方面比较典型的两种组装算法:前向资源预留算法(Forward Resource Reservation,FRR)和精确组装FRR算法(Precision Assembly with Forward Resource Reservation,PAFRR).分析了这两种算法在带宽利用率提高以及平均时间延迟降低方面存在的问题.针对这些问题,提出了一种新的降低延迟的组装周期预测算法(As sembly Duration Forecasting,ADC)并进行了网络仿真.仿真结果验证了该算法在进一步提高带宽利用率方面和降低平均时间延迟方面的有效性.     

一种基于混合门限的快速前向资源预留OBS组装算法

研究了一种以突发组装的时间门限与包长门限的乘积为混合门限的按照步长大小进行自适应调整的突发组装算法,并且当第一个IP包进入组装队列时就对突发的大小及组装时间进行预测,最大程度上降低了端到端的延迟;仿真结果表明,在进行快速前向资源预留组装的基础上引入重传机制,可以在减少端到端延时的同时降低突发丢包率,较大地提高了OBS网络的性能.     

OBS网络支持多业务并考虑路径关联的分片方法

提出一种在OBS(光突发交换)网络中基于优先级并考虑路径关联的BS(突发数据分组分片)方法,所提BS方法能够较好地支持多业务并充分考虑多路径冲突情况。仿真结果表明:路径长度和关联路径数目都会对OBS网络数据丢失产生影响。     

基于连通支配集的OBS网络多粒度业务疏导机制

针对目前光网络核心节点的交换速度无法匹配单波长的传输速度难以满足大量的业务请求而拥塞,为了提高核心节点交换效率使其具有大容量数据交换的能力,本文提出了一种基于连通支配集(CDS)的光突发交换(OBS)网络稀疏节点疏导机制(CDS-TG).主要思路是:首先在OBS核心网络中根据改进的连通支配集算法选取疏导节点;其次在疏导...     

光突发交换网络新型偏射路由方案研究

光突发交换(OBS)被认为是下一代光网络中的有效核心交换技术之一,设计OBS网络的最初目的之一是减小突发包丢失率.解决突发竞争的方法主要包括光缓存、波长变换、偏射路由和突发分段.提出一种改进偏射路由方案,并建立了数学模型,对改进方案的性能进行了仿真分析,结果表明改进方案能更好的提高网络整体性能.     

光突发交换网络的一种批量重调度算法

数据信道调度算法是光突发交换网络的关键算法.按需重调度算法(0DBR)只重调度一个突发,对性能提高有限,为此提出批量重调度算法.仿真结果表明该算法突发丢失率低于LAUC、LAUC-VF和按需重调度算法.     

QoS provisioning in micro-cellular networks supporting multiple classes of traffic

We introduce an adaptive call admission control mechanism for wireless/mobile networks supporting multiple classes of traffic, and discuss a number of resource sharing schemes which can be used to allocate wireless bandwidth to different classes of traffic. The adaptive call admission control reacts to changing new call arrival rates, and the resource sharing mechanism reacts to rapidly changing traffic conditions in every radio cell due to mobility of mobile users. In addition, we have provided an analytical methodology which shows that the combination of the call admission control and the resource sharing schemes guarantees a predefined quality-of-service to each class of traffic. One major advantage of our approach is that it can be performed in a distributed fashion removing any bottlenecks that might arise due to frequent invocation of network call control functions.