基于MAC层优先级调度的宽带电力线跨层资源分配

传统的资源分配算法采用分层系统,且不适用于宽带电力线通信系统中的不良信道环境。文中引入跨层思想提高资源利用率,保证服务质量(QoS),提出了一种基于MAC层QoS优先级调度功能的宽带电力线跨层资源分配方案。该算法考虑了实时用户对延迟的要求和非实时用户对队列长度的要求,并提出用户优先级函数。根据其优先级函数计算每个用户的数据包数量,生成基于效用函数的调度序列。在物理层中,根据调度的数据包,该算法分配物理资源用于分组。仿真结果表明,该算法在提高用户QoS的同时兼顾了系统的性能和吞吐量。     

光突发交换网络中信道调度的PBR-VF算法

光突发交换网络中,数据信道的调度是一个关键问题.文章基于现有的信道资源调度算法,提出了基于优先级的可插空重新调度-PBR-VF(Priority-based Burst Rescheduling with Void Filling)算法,该算法采用LAUC-VF Plus作为子算法,并结合重新调度和优先级选择丢弃机制,能够充分利用信道空隙,对信道资源进行高效调度.仿真结果表明,该算法有效地提高了光突发交换网络的信道资源利用率,同时较好地提供了网络的QoS保证.     

一种基于门限的光突发交换受限偏射路由算法

提出了一种基于突发丢失门限的条件偏射路由算法（LDFD），该算法采用丢弃少量偏射的高优先级突发来保证偏射路由上较低优先级非偏射突发的服务质量（QoS）。当偏射的高优先级突发到达核心节点而该节点没有空闲数据信道时，就启用定义的偏射条件检测函数来判断是丢弃该突发还是允许其抢占非偏射的低优先级突发的资源，从而减少偏射突发与偏射路由上原有突发的竞争。仿真表明，该算法可以很好地控制偏射突发对偏射路由上正常流量的影响，并有效地提高整个网络的突发丢失性能。     

OBS网络中QoS优先级保证方案研究

文章把信道分组和PPJET(Preemptive Prioritized Just Enough Time)协议以及光纤延时线三者结合使用,提出了一种新的QoS调度方案D-PPJET(Developed-PPJET)协议.在该协议下,高优先级数据包可以被动态地调度到任何可用的信道上去,而低优先级数据包只能在规定的部分信道上调度,并利用光纤延时线(FDL)缓存机制为未成功调度的突发包提供二次调度的机会,这样高优先级业务包调度成功的机会就大大增加,为高优先级业务提供了保证,同时还使得低优先级突发分组丢失率下降.结果表明它能够大大地改善整个网络突发包的丢失率、信道吞吐量及信道利用率.     

一种光突发交换网络中基于优先级的冲突解决方法的研究

该文提出一种解决光突发交换网络节点中突发数据包冲突的方法。发生冲突时,首先基于不同的优先级对突发数据包进行分割,然后根据这种分割方法提出了一种突发数据包的组合封装方式,最后利用计算机对其进行了模拟。可以看出这种方法对高优先级的突发数据包以及IP数据包有很好的保护作用,可以很好地实现服务质量QoS(Quality of Service)机制。     

基于阈值的光突发交换网络数据信道调度算法

光突发交换(OBS)是实现下一代光互联网中的一种极具前景的方案。该文提出了一种基于阈值的OBS网络数据信道调度算法,对于长度大于阈值的光突发数据包采用LAUC算法进行调度,对于长度小于阈值的光突发数据包采用LAUC-VF算法进行调度。仿真结果表明,该算法在调度时间方面与已有的LAUC算法很接近;而在光突发数据包丢失率性能方面要优于LAUC-VF算法。     

基于同波长光纤延迟线集光突发交换结构及其性能分析

由于光突发交换机制本身就避免了光缓存的使用，但是现实中，光突发包之间竞争以及提供优先级服务又依靠光纤延迟线来解决。为此，我们设计了应用光纤延迟线的光突发交换网络核心节点结构。为了避免光纤延迟线色散引起的突发包输入排队缓存偏移，在该结构中设计了同波长光纤延迟线集。采用了空分交换矩阵，避免了波长转换的需要。为了有效运行该交换结构，我们提出了输入排队与自适应光缓存调度算法，而该算法不仅仅适用于光突发交换，也适合于光纤延迟线得到普遍应用的光分组交换。该调度算法能够提供优先级服务，避免队头阻塞，对该调度算法建立了严格的理论分析模型，并进行了仿真。仿真结果表明，与传统的延迟线竞争解决方案相比，这一调度算法能够改善交换性能1到2个数量级，是利用光纤延迟线解决光突发交换中竞争问题的一个较佳方案。     

一种适用于B3G移动通信系统下行共享信道的调度算法

本文针对后三代(B3G)移动通信系统中的宽带无线信道特性和流媒体业务特征,分析了可用于高速下行共享信道的各种传统分组调度算法,提出面向流媒体业务能够提高系统吞吐量的基于优先级公平调度(Priority-Based Fairness Scheduling,PBFS)算法.该算法根据各移动用户收发信道质量和业务传输的QoS要求动态调整各用户的业务传输优先级,确定下行共享信道的调度方案.并给出该算法的简化形式S-PBFS.仿真结果表明,与传统调度算法相比,S-PBFS算法在数据包传输时延受限的条件下具有无线信道利用率高、实现复杂度低等特点.     

提供区分服务的可抢占信道调度算法

在OBS网络LAUC-VF信道调度算法的基础上,提出了一种新的能够提供区分服务的可抢占武信道调度算法,它既保证了高优先级业务的低延迟传输,也使低优先级的业务能与高优先级业务共享信道资源,从而改善了OBS网络的QoS特性.     

OBS网络中冲突解决方法研究

在OBS网络中,当两个或多个突发包要求在同一时刻,同一输出端口的同一波长上预留资源时．就会产生突发数据包的资源竞争。如何解决资源竞争问题是OBS技术能否最终走向实际应用的关键技术之一。文章首先介绍OBS的基本原理、网络结构、OBS网络的资源预约机制、边缘路由器的封装机制和资源调度机制,接着研究解决OBS网络中突发数据包之间争夺链路资源问题的竞争解决机制,随后详细的给出四种竞争解决方案：光缓存、波长转换、偏射路由和突发分段丢弃,并分析了它们的性能。在此基础上,文章最后提出了各种资源竞争解决方案相结合的联合解决机制的思想。     

Burst scheduling for differentiated services in optical burst switching WDM networks

Optical burst switching (OBS) is one of the most important switching technologies for future optical wavelength division multiplexing (WDM) networks and the Internet. The model of differentiated services has been proposed to support quality of service (QoS) in the IP‐based Internet. It is also very important to have differentiated service support in OBS networks. When the burst scheduling in an OBS network is set up appropriately, network can support differentiated services. In this paper, we proposed a new burst scheduling scheme, called differentiated scheduling with identical priority offset time (DSIPO). In DSIPO, the same priority offset time is used for all the bursts destined to the same edge node regardless of their priorities. Differentiated services in terms of burst loss probability are achieved by processing the control packets of higher priority class bursts, thus reserving resources for their data bursts, more promptly upon their arrival than those of lower priority class bursts. Each intermediate (core) node can adjust the burst loss probabilities of various burst classes by choosing its own differentiated processing delay value for each priority class or its own differentiated processing delay difference value between any pair of adjacent priority classes. We model and analyse DSIPO in terms of the burst loss probability for each priority class with simulation validation. The performance of DISPO is evaluated by simulation. Copyright © 2004 John Wiley & Sons, Ltd.     

E-OBS网络中一种基于优先级的抢占窗口机制

为了有效地降低突发包的丢失率和保证网络的服务质量,提出了模拟光突发交换网络中一种基于优先级的抢占窗口机制.该机制在模拟光突发交换核心路由器的控制信道上设置抢占窗口,以此来决定是否允许高优先级突发包抢占低优先级突发包.冲突发生时,系统判断高优先级突发包对应的控制包的到达时间是否满足抢占条件,如果满足抢占条件,则允许高优先...     

Contour-Based Priority Scheduling in Optical Burst Switched Networks

Optical burst switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over dense wavelength division multiplexing links. Although several quality-of-service (QoS) schemes have been proposed for OBS networks, how to provide QoS at the high speed required by the OBS network is still an open question. In this paper, we propose a novel O(1) runtime contour-based priority algorithm that provides complete priority isolation among different priorities. This is the first practical O(1) runtime priority algorithm proposed for OBS, and it is well suited to high-speed hardware implementation.     

Dynamic wavelength selection and delayed burst assignment schemes for Optical Burst Switching networks

Optical Burst Switching (OBS) has been proposed as a promising switching technology for the next generation of optical transport networks. In this paper, we address the issue of how to provide proportional differentiated services in OBS networks. Firstly, a Dynamic Wavelength Selection (DWS) scheme is introduced to provide proportional differentiated services in bufferless OBS networks by dynamically assigning more and longer periods of wavelengths to high priority classes. This scheme can also utilize wavelengths efficiently because the wavelengths are shared among different classes. Next, a Delayed Burst Assignment (DBA) scheme is introduced, by which bursts of the high priority class are given a higher probability for reserving wavelengths by scheduling the bursts of the low priority class with a delay to provide quality of service (QoS) in OBS networks. The integration of these two schemes provides proportional differentiated services and improves the burst loss performance by giving the burst head packet (BHP) two opportunities of scheduling its data burst (DB).     

OBS网络中基于优先级与参数可调的偏射路由算法

为了保证OBS网络中不同优先级业务的服务质量和解决偏射算法在偏射控制上的问题,提出一种基于优先级与参数可调的偏射路由算法.该算法通过设置可调参数“偏射概率”来控制冲突突发包的偏射,并从可调丢包率和偏射路径长度意义上寻找最佳偏射路由.当冲突发生时,分割优先级低的突发包,并将分割突发包偏射到空闲的链路上;在空闲的链路中选择...     

Traffic statistics and performance evaluation in optical burst switched networks

Optical burst switching (OBS) is a promising switching technology to exploit the potential benefits of optical communication and, at the same time, support statistical multiplexing of data traffic at a fine granularity. To quantify its benefits, the paper describes several typical burst assembly algorithms and studies their impact on the assembled burst traffic characteristics as well as the performance of TCP traffic. Also described is a proactive burst scheduling algorithm, called burst overlap reduction algorithm (BORA), which schedules locally assembled bursts in such a way as to reduce burst contention at downstream nodes in OBS networks. Furthermore, to provide analytical insights into performance evaluation of OBS networks, a burst loss model at an OBS node and its extension to different reservation protocols are presented.     

光突发交换网络基于优先级与突发包分割的光缓存方法

为了保证光突发交换(OBS)网络中不同优先级业务的服务质量(Qos)和有效地降低突发包的丢失率,提出了一种基于优先级与突发包分割的光缓存方法.该方法通过在输出数据信道上设置光纤延迟线组来缓存被分割的冲突突发包.当冲突发生时,基于突发包的优先级进行"竞争突发包头部分割或者原突发包尾部分割,,处理;无冲突部分进行交换或者直...     

OBS网络中基于优先级的先分割后缓存冲突解决方法

为了有效地降低突发包的丢失率和保证OBS网络中不同优先级业务的服务质量,提出了一种基于优先级的先分割后缓存冲突解决方法。该方法通过在多波长信道系统的输出数据信道上设置光纤延迟线组来缓存被分割的冲突突发包。当冲突发生时,首先基于突发包的优先级和处理完毕时间进行"竞争突发包头部分割或者原突发包尾部分割"处理;无冲突部分进行交换或者直接在事先预留的输出数据信道上处理,冲突部分的分割突发包进行光缓存。仿真结果表明,多波长信道系统中,高优先级突发包的丢失率低于低优先级突发包的丢失率。同时该方法在一定程度上可以有效地减少端到端的传输时延和整个网络的丢包率,从而提高整个OBS网络的性能。     

OBS网络中一种基于突发包优先级分割的可控重传方案

在光突发交换(OBS)网络中,突发包会由于竞争OBS核心节点输出端口的有限波长资源而发生冲突。突发包重传能够在一定程度上减少由于突发包在核心节点冲突而导致的数据损失,但重传次数的增加可能会加重网络负荷,反而增加数据丢失率。并且,在多业务存在的OBS网络中,重传方案需要能够实现区分服务以保证网络的服务质量(QoS)。据此,本文提出一种基于突发包优先级分割的可控重传方案,在实施优先级分割的同时,根据网络负荷赋予每次重传不同的概率,并对重传次数加以控制。最后,仿真分析了路径阻塞率和不同优先级业务的字节丢失率(ByLP,byte loss probability)性能。