光突发交换网络中的重调度算法

介绍了光突发交换（OBS）网络,在现有算法LAUC_VF的基础上提出了一种重调度算法,即LAUC_VF_RESCHEDULE算法,它的主要思想是：对新到达的突发运用LAUC_VF算法调度不成功时,将已经调度成功的突发从原有信道Ⅰ重新调度到另一数据信道J上,并保持该突发的到达时刻和结束时刻不变,从而将新到达的突发调度到数据信道Ⅰ上。仿真结果表明在大多数情况下该重调度算法相对于LAUC_VF算法对网络性能的改善是比较大的。     

一种支持比例区分服务的OBS数据信道调度算法

光突发交换（OBS）是实现IP／DWDM网络的一种极有前途的方案,该文提出了一种用于OBS网络的PDF数据信道调度算法,此算法能支持比例区分服务，保证高优先级业务数据比低优先级业务数据得到更可靠的传输．计算机仿真验证了PDF调度算法的性能．     

OBS网络中多重主动重调度算法

信道调度算法是光突发交换（OBS）网络的关键技术之一。在主动重调度算法的基础上,提出了一种新的多重主动重调度算法,通过搜索并重调度数据信道上所有能进行重调度的突发,使多个突发重调度后产生的间隔尽量小,从而降低突发丢失率。     

光突发交换中基于突发包计算权值的数据信道调度

对光突发交换网络中传统的数据信道调度算法进行了分析。针对其不足之处进行了改进,提出了一种基于突发包计算权值的最小时隙数据信道调度算法。从理论上分析了该算法的优越性,并通过实验仿真对算法的性能进行验证。采用理论估计和现实仿真运算相结合的方法对其分析误差。结果表明该算法在信道利用率、降低突发的丢包率、减小网络的拥塞等方面比传统的数据信道调度算法有了较大的提高。     

光突发交换数据信道调度算法研究

随着IP业务的迅速增长,对传送网带宽和交换系统容量的需求正以前所未有的速度增加,由于光电路交换带宽利用率低和光分组交换对器件的要求过高等等缺点,结合二者优点的光突发交换便脱颖而出,并受到业界的广泛关注。本文在介绍光突发交换基本概念、特点的基础上,重点探讨了光突发交换数据信道调度算法,主要包括最近可用信道调度算法(LAUC)、最近可用信道-插空调度算法(LAUC-VF)、轮询调度算法等技术,对LAUC和LAUC-VF的优缺点进行了分析比较,并给出了一种基于阈值的光突发交换数据信道调度算法。     

WiMAXMesh网络路由与调度算法研究

WiMAX Mesh网络引入多跳的方式实现远距离通信,取得覆盖范围和吞吐量的性能优化.在集中式Mesh网络中,路由与调度算法对网络性能有重要影响.针对Mesh模式提出一个新的方案,在基于冲突感知与负载平衡路由的基础上,利用多信道单收发机模式,采用联合调度和信道分配算法提高系统性能.仿真结果表明,该算法在调度长度和归一化...     

光多环互连的弹性光突发交换环的信道调度

本文针对多环互连的弹性光突发交换环网的控制结构展开了研究探讨,针对目前RPR与OBS网络提出的信道分配与调度算法,虽然在一定程度上提高了信道的利用率,但始终没有从全网角度考虑波长分配,环网结构中仍会引起较大的丢包。鉴于此我们在此从资源利用率,时延,成本方面提出一种更适合环网和网状网的混合目的信道优先算法(FDCP,Fixed Destination Channel Priority),并建模仿真分析。     

OBS网络中的静态业务量疏导技术

现有的光突发交换(OBS)网络中的业务量疏导技术都没有考虑全网业务量优化问题,对此提出OBS网络的静态业务量疏导机制和两种算法:基于相同目的地址的静态业务量疏导算法和基于相同下一跳地址的静态业务量疏导算法.使用OPNET仿真工具对两种算法进行仿真,结果表明,低负载情况下,该疏导机制指导下的两种算法均能提高链路利用率,降低IP分组丢包率,改善网络性能.同等条件下,基于相同下一跳地址的疏导算法更为有效.     

一种多收发器WiMax mesh网络集中式调度算法

根据IEEE 802.16协议,集中式调度是WiMax mesh网络中的主要带宽调度方式.目前的集中式调度算法只适用于单收发器系统.本文研究多收发器WiMax mesh网络中的调度问题,提出一种集中式调度与信道分配算法.该算法用令牌代表数据包在路由树上的传输,在每个时隙内选择可以并行传输的链路集合并分配信道.模拟实验表明本文提出的算法可以充分利用多收发器系统特性,有效减少总传输时间.     

两种改进型的网络数据信道调度算法

光突发交换是实现IP/DWDM网络的一种非常有前途的方案.已有的FF调度算法和LAU调度算法都没有考虑QoS功能、波长转换等因素,在此基础上,进行了部分改进.提出了两种改进型的网络数据信道调度算法:优化波长转换调度算法OWCT和重分服务(RFA)调度算法.通过NS2仿真实验验证,证明这两种改进型的数据信道调度算法在确保高优先权的数据可靠性传输方面、减少光突发交换网络中的光信号的波长转换次数方面,与已有的FF调度算法和LAU调度算法相比,具有更好的性能.     

On ordered scheduling for optical burst switching

Optical burst switching (OBS) is a promising optical networking paradigm for efficient transport of bursty IP traffic over wavelength division multiplexing (WDM) optical Internet networks. In OBS, the header of a burst is sent in advance of the data burst to reserve a wavelength channel at each optical switching node along the path. The nodes use a scheduling algorithm to assign wavelengths to incoming bursts. Our work is motivated from the observation that existing scheduling algorithms assign a wavelength to a burst when its header arrives at the node. Thus, information about other bursts whose headers arrive later is not available when the scheduling decision is made. This leads to suboptimal scheduling decisions and unnecessary burst dropping. The key idea in our proposed algorithm, Ordered Scheduling, is to defer making the scheduling decision until just before the burst arrival in order to have full knowledge about other bursts. The effectiveness of the proposed algorithm is studied through simulation and the computational complexity and signalling overhead are analysed.     

一种自适应的存储器访问乱序调度机制

存储器访问速度已经成为现代处理器系统中的瓶颈。对于存储器访问的调度可以有效地提高存储器带宽利用率。基于一种称为突发调度的机制进行改进,通过使用优先级表达式从各个块里选择最合适的突发来访问存储器,运用自适应的方法来调节优先级表达式里各项的系数,使得这一方法针对不同的应用都能取得好的效果。通过运行SPECCPU2000测试程序和stream程序,与顺序访问机制以及突发调度机制相比,该自适应调度机制将总线利用率分别提高了52%和4.8%。[0]     

光突发交换网络中支持服务质量的一种新方案

提出了光突发交换网络支持服务质量的一种新方案.在此方案中,核心节点根据到达的数据突发的优先级别,将每一出口链路的数据信道进行分组.每一组别的数据信道数主要取决于相应优先级别的数据流量.通常情况下,属于某优先级别的数据突发会被调度在相应组别的数据信道上.在高优先级别的数据突发未能预留在其相应组别的数据信道上时,可尝试为其在低组别的数据信道上预留,甚至抢占低组别内已经被预留的信道;低优先级别的数据突发不能被预留在高组别的数据信道上.另外,也考察了抢占数据突发长度与被抢占数据突发长度之间的关系.     

Scheduling multimedia services in a low-power MAC for wireless andmobile ATM networks

This paper describes the design and analysis of the scheduling algorithm for energy conserving medium access control (EC-MAC), which is a low-power medium access control (MAC) protocol for wireless and mobile ATM networks. We evaluate the scheduling algorithms that have been proposed for traditional ATM networks. Based on the structure of EC-MAC and the characteristics of wireless channel, we propose a new algorithm that can deal with the burst errors and the location-dependent errors. Most scheduling algorithms proposed for either wired or wireless networks were analyzed with homogeneous traffic or multimedia services with simplified traffic models. We analyze our scheduling algorithm with more realistic multimedia traffic models based on H.263 video traces and self-similar data traffic. One of the key goals of the scheduling algorithms is simplicity and fast implementation. Unlike the time-stamped based algorithms, our algorithm does not need to sort the virtual time, and thus, the complexity of the algorithm is reduced significantly     

Algorithms for burst rescheduling in WDM optical burst switching networks

Wavelength division multiplexing (WDM) is a promising technology for realizing terabit networks. Optical burst switching (OBS) is a way to efficiently support bursty traffic on WDM-based optical Internet networks. In OBS networks, the control (header) and payload (data) components of a burst are sent separately with a time gap. The control packet first traverses the burst switching nodes and reserves suitable wavelengths on the links for the corresponding data burst by using a scheduling algorithm. Our work is motivated from the observation that the existing scheduling algorithms either have low computational complexity or high performance in terms of burst dropping probability, but not both simultaneously. Since the arrival of bursts is dynamic, it is highly desirable that the scheduling is done as quickly as possible. We develop scheduling algorithms which integrate the merits of both low computational complexity and high burst dropping performance. The key idea is to reschedule an existing burst by assigning a new wavelength to it keeping the burst arrival and leaving time unchanged in order to accommodate the new burst. We propose computationally simple rescheduling algorithms called on-demand burst rescheduling and aggressive burst rescheduling. The effectiveness of the proposed algorithms and the signaling overhead are studied through simulation experiments.     

Link-level traffic scheduling for providing predictive QoS in wireless multimedia networks

A set of centralized burst-level cell scheduling schemes, namely, First Come First Served with Frame Reservation (FCFS-FR), FCFR-FR+, Earliest Deadline First with Frame Reservation (EDF-FR), EDF-FR+, and Multitraffic Dynamic Reservation (MTDR), are investigated for transmission of multiservice traffic over time division multiple access (TDMA)/time division duplex (TDD) channels in wireless ATM (WATM) networks. In these schemes, the number of time slots allocated to a virtual circuit (VC) during a frame-time is changed dynamically depending on the traffic type, system traffic load, the time of arrival (TOA)/time of expiry (TOE) value of the data burst and data burst length. The performances of these schemes are evaluated by computer simulation for realistic voice, video and data traffic models and their quality-of-service (QoS) requirements in a wireless mobile multimedia network. Both the error-free and the correlated fading channel conditions are considered. Simulation results show that the EDF-FR+ and MTDR schemes outperform the other schemes and can provide high channel utilization with predictive QoS guarantee in a multiservice traffic environment even in the presence of bursty channel errors. The EDF-FR+ scheme is found to provide better cell multiplexing performance than the MTDR scheme, Such a scheme would be easy to implement and would also result in a power conservative TDMA/TDD medium access control (MAC) protocol for broadband wireless access. Burst-level cell scheduling schemes such as EDF-FR+ can be easily adapted as MAC protocols in the emerging differentiated services (DS) enhanced wireless Internet protocol (IP) networks.     

Memory access schedule minimization for embedded systems

The growing gap between microprocessor speed and DRAM speed is a major problem that computer designers are facing. In order to narrow the gap, it is necessary to improve DRAM’s speed and throughput. To achieve this goal, this paper proposes techniques to take advantage of the characteristics of the 3-stage access of contemporary DRAM chips by grouping the accesses of the same row together and interleaving the execution of memory accesses from different banks. A family of Bubble Filling Scheduling (BFS) algorithms are proposed in this paper to minimize memory access schedule length and improve memory access time for embedded systems.When the memory access trace is known in some application-specific embedded systems, this information can be fully utilized to generate efficient memory access schedules. The offline BFS algorithm can generate schedules which are 47.49% shorter than in-order scheduling and 8.51% shorter than existing burst scheduling on average. When memory accesses are received by the single memory controller in real time, the memory accesses have to be scheduled as they come. The online BFS algorithm in this paper serves this purpose and generates schedules which are 58.47% shorter than in-order scheduling and 4.73% shorter than burst scheduling on average. To improve the memory throughput and further reduce the memory access schedule, an architecture with dual memory controllers is proposed. According to the experimental results, the dual controller algorithm can generate schedules which are 62.89% shorter than in-order scheduling, 14.23% shorter than burst scheduling, and 10.07% shorter than single controller BFS algorithms on average.     

An elastic compensation model for frame-based scheduling algorithms in wireless networks

Scheduling algorithms for high-speed wireless networks need to be simple to implement for serving packets while ensuring quality-of-service (QoS). The ordinary frame-based scheduling principle is well-known for providing fair service with low implementation complexity. However, existing frame-based scheduling algorithms cannot properly handle location-dependent burst errors in wireless networks. To utilize the advantages of frame-based scheduling algorithms in error-prone wireless networks, we propose an elastic compensation model that provides not only smooth compensations without any service disruptions of flows but also flexible compensations to flows that experience frequent errors to provide flows with fairness of service. From our analysis and simulation studies, we found that the proposed compensation model shows smooth compensation performance without any service disruption periods and good fairness performance when channel errors occur.     

Optimal admission control algorithms for scheduling burst data in CDMA multimedia systems

The third generation mobile communication systems are widely envisioned to be based on wideband code division multiple access (CDMA) technologies to support high data rate (HDR) packet data services. To effectively harness the precious bandwidth while satisfying the HDR requests from users, it is crucial to use a judicious burst admission control algorithm. In this paper, we propose and evaluate the performance of a novel jointly adaptive burst admission algorithm, called the synergistic burst admission control algorithm to allocate valuable resources (i.e., channels) in wideband CDMA systems to burst HDR requests. We consider the spatial dimension only, and by that we mean the algorithm performs scheduling and admission control, for the current frame only, based solely on the selection diversity in the geographical and mobility aspects. The scheduler does not exploit the temporal dimension in that it does not make allocation decisions about future frames (i.e., requests that do not get allocation are simply ignored and such requests will be treated as new request in future frames). In the physical layer, we use a variable rate channel-adaptive modulation and coding system which offers variable throughput depending on the instantaneous channel condition. In the MAC layer, we use the proposed optimal multiple-burst admission algorithm, induced by our novel integer programming formulation of the admission control and scheduling problem. We demonstrate that synergy could be attained by interactions between the adaptive physical layer and the burst admission layer. Both the forward link and the reverse link burst requests are considered and the system is evaluated by dynamic simulations which takes into account of the user mobility, power control and soft handoff. We found that significant performance improvement, in terms of average packet delay, data user capacity and coverage, could be achieved by our scheme compared to the existing burst assignment algorithms.