基于模拟光突发交换结构的星载光网络资源预留机制研究

为了适应可实现性强、稳健性高的卫星光交换网络,选择模拟偏置时间光突发交换(E-OBS)作为转发卫星的激光通信架构,并结合现有的地面光交换资源预留方法,提出了一种偏置时间固定的资源预留机制。通过流量估计把突发数据按照目的地址和服务质量(Qo S)区分为单个突发和突发流,按照分类对卫星光网络资源进行了成功预留,并建立了平均端-端时延、吞吐量、链路利用率、丢包率数学分析模型。理论分析与仿真证明,该资源预留方法通过突发流机制降低了光交换矩阵的重置时间和交换时延,通过E-OBS架构降低了核心节点控制复杂度和对边缘节点的缓存需求,提高了网络吞吐量,适用于星载光交换网络。     

一种基于突发长度预测的光突发汇聚机制

提出了一种基于突发长度预测的固定时间汇聚方法.边缘节点在监测时间段内对到达的数据流进行监测,并且根据监测的结果预测在固定的汇聚时间内完成汇聚的突发包长度,提前将控制分组转发到核心网络中进行资源预留.通过理论分析及计算机仿真表明,这种汇聚方法能够有效地降低光突发交换网络中的端到端延迟.     

OBS中结合JET和TAW的混合预留机制

光突发交换OBS是目前最有发展潜力的光交换技术之一。本文首先介绍OBS中的JET预留机制和TAW预留机制,然后根据这两者的优缺点提出一种结合这两者优势的混合预留机制。该预留机制根据不同业务要求对突发数据的端到端时延和丢包率进行折衷。     

OBS中结合JET和TAW的混合预留机制

光突发交换OBS是目前最有发展潜力的光交换技术之一。本文首先介绍OBS中的JET预留机制和TAW预留机制，然后根据这两者的优缺点提出一种结合这两者优势的混合预留机制。该预留机制根据不同业务要求对突发数据的端到端时延和毛包率进行折衷。     

光突发交换网络中的传输控制协议性能

光突发交换(OBS)是IP over WDM核心网络采用的交换技术。在OBS网络中,送往同一边缘节点的IP分组汇聚成传输和交换的基本单元———数据突发(DB),DB丢弃会导致大量IP分组丢失,显著影响传输层的性能。文中分析OBS网络的参数对传输控制协议(TCP)吞吐量和时延的影响。仿真结果表明,DB丢包率越高,TCP性能越差。在低丢包率情况下,随着DB长度的增加,TCP吞吐量和端到端时延明显增加,高丢包率情况下则不明显;随着汇聚周期的增加,TCP吞吐量逐渐下降,端到端时延逐渐增加。     

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

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

E-OBS网络中一种基于窗口的资源预留机制

为了有效地降低突发包的阻塞率和保证网络的服务质量,提出了模拟光突发交换（E-OBS）网络中一种偏置时间连续可变的基于窗口资源预留机制。在E-OBS核心路由器的控制信道（CC）上设置资源预留窗口,以此决定是否允许控制包为相应的突发包预留链路资源,并且给出了该机制下关于阻塞概率的近似方程式。仿真结果表明,适当增加资源预留窗...     

自适应混合光交换

当前的混合光交换只是简单地把光电路交换和光突发交换叠加在一起,其复杂度高.并且不能有效支持突发性强的业务.针对这种缺陷,本文提出了一种自适应混合光交换方式.自适应混合光交换的入口边缘节点监测一对入口边缘节点和出口边缘节点之间的业务流量的大小,自适应地调整光交换方式.在最小突发长度最大汇聚时间算法的基础上,提出了自适应混合光交换的汇聚算法,以提高光路的利用率和有效支持突发性强的业务.同时提出了数据信道调度算法,它能统一为光路和数据突发预留资源,并降低了混合光交换的复杂度,提高了网络性能.仿真结果表明,与光突发交换相比,自适应光交换能有效降低IP包丢失率和端对端时延.     

基于OPNET的校园网优化设计与仿真

为了达到优化校园网的目的,通过OPNET仿真方法,从网络拓扑结构到资源合理配置两方面进行优化设计。对多级网络和三级网络环境下网络的系统时延、服务器响应速度和吞吐量进行仿真。结果表明,控制交换级数可以有效降低系统时延,提高网络性能。建议中小型网络采用＂核心交换-汇聚交换-节点交换＂的三级交换拓扑结构。     

端边协同保障时延确定性技术研究

工业自动控制等5G垂直行业对网络传输时延与可靠性有着苛刻的要求。聚焦自动导引车（automated guided vehicle,AGV）协同搬运业务场景,深入分析AGV业务关键质量指标（key quality indicator,KQI）与网络时延可靠性需求。现有的5G低时延技术,比如预调度机制通过大量预留空口时频资源降低传输调度等待时延,降低了频谱效率。此外,无线信道弱覆盖、干扰等质差因素会引发较大的时延抖动,难以满足业务时延可靠性需求。针对现有5G网络面临的挑战,设计了一种端边协同时延确定性保障技术方案,基于业务特征进行网络资源预留,同时感知空口信道状态,开启质差保障机制,提升传输可靠性。测试结果表明,端边协同技术方案可以有效提升时延可靠性,降低大时延抖动与优化业务KQI。     

Distributed Reservation Protocol and QoS Method in WR-OBS System

1IntroductionOptical Burst Switching (OBS)[1 ~4]provides a feasi-ble paradigm for Internet Protocol (IP) over Wave-length-Division Multiplexing ( WDM) integration[5 ~10],which has been the focus of intense investigation owingtoits flexibilityin utilizingthe terahertz bandwidth of asingle fiber andits capabilitytosupport transparent datatransmissions. However , with the emergence of allkinds of applications such as data ,voice ,the next-gen-eration network must also be designedto provide …     

基于光突发交换的下一代光互联网技术

给出了基于光突发交换的下一代光互联网技术的体系结构,然后从光突发数据格式、光突发的装配、光突发交换节点与网络结构、资源预留协议,以及数据信道调度算法等方面讨论了其核心技术问题.最后,简要地指出了下一代光互联网技术的未来研究方向和主要研究内容.     

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.     

Hybrid switching and p-routing for optical burst switching networks

One promising switching technology for wavelength-division multiplexing optical networks is optical burst switching (OBS). However, there are major deficiencies of OBS. (1) The delay offset between a control message and its corresponding data burst is based on the diameter of a network. This affects network efficiency, quality-of-service, and network scalability.( 2) OBS adopts one-way resource reservation scheme, which causes frequent burst collision and, thus, burst loss. We address the above two important issues in OBS. In particular, we study how to improve the performance of delay and loss in OBS. To reduce the end-to-end delay, we propose a hybrid switching scheme. The hybrid switching is a combination of lightpath switching and OBS switching. A virtual topology design algorithm based on simulated annealing to minimize the longest shortest path through the virtual topology is presented. To minimize burst collision and loss, we propose a new routing algorithm, namely, p-routing, for OBS network. The p-routing is based on the wavelength available probability. A path that has higher available probability is less likely to drop bursts due to collision. The probability-based p-routing can reduce the volatility, randomness, and uncertainty of one-way resource reservation. Our studies show that hybrid switching and p-routing are complementary and both can dramatically improve the performance of OBS networks.     

Hybrid Control and Reservation Architecture for Multidomain Burst Switched Network

Optical burst switching realizes all-optical communication by dividing data transmission system into control plane and data plane. In order to implement control plane two controlling mechanisms such as distributed and centralized control and reservation models have been presented in literature. Both of the architectures have pros and cons associated such as distributed model lacks efficient resource utilization while centralized model is nonscalable. In order to overcome these, a new hybrid control and reservation mechanism has been presented by the authors. The proposed model is based on clustering technique where each cluster consists of cluster head and member nodes. Cluster head performs major functionalities in the network such as path establishment, routing and resource management, fault management, etc., while member nodes perform data switching functionality. In order to implement the architecture, a signaling protocol is also presented. In this paper, we discuss different scenarios required for the implementation of the proposed hybrid model. These scenarios detail the message dialogs exchange between different network nodes and between different software modules during lightpath establishment, data transmission, and connection teardown operations. The goal of efficient resource utilization is achieved through centralized control of network resources while scalability is achieved through dividing the network into multiple domains. Finally, the simulation section shows the mechanism of designing the multidomain architecture, network bandwidth utilization comparison and reduction in end-to-end data transmission latency.      

Simultaneous Burst and Burst Control Packet Transmission Protocol for Optical Burst Switching Ring Networks

In this letter, we design a collision resolution protocol for optical burst switching ring networks to avoid burst collision. We define the offset time condition for no burst transmission collision and manage the free time list of nodes for no burst reception collision. In order to improve the throughput, we use a fiber delay line, void‐filling, and void‐compression. This protocol does not require any additional procedures for bandwidth reservation such as centralized assignment of bandwidth, lightpath setup of WDM ring networks, or token capturing for the burst transmission. The simulation results show that the proposed protocol can achieve high throughput while saving 70% of wavelengths when compared to round robin with random selection, round robin with persistent, and round robin with non‐persistent with only destination delay.     

A Space-Division Multiple-Access Protocol for Spot-Beam Antenna and Satellite-Switched Communication Network

This paper identifies the characteristics of a point-topoint demand-assignment satellite-switched spot-beam antenna communication network for integrated data voice traffic. The described protocol is known as space-division multiple-access (SDMA) which uses an on-board central traffic controller, a fixed-assignment timedivision multiple-access (TDMA) protocol for reservations, and a rigid frame structure with separate data and voice subframes. Message and circuit switching are utilized for data and voice traffic, respectively. Synchronization is maintained by a looped-back reservation burst. A detailed delay analysis of data and voice traffic is presented for an arbitrary compound arrival process. A new method for the calculation of the data reservation and scheduling delays is derived. A comparison of the performance of the SDMA protocol to other protocols is shown. This paper demonstrates the feasibility and illustrates the design of the SDMA protocol.     

Burst-cluster transmission with probabilistic pre-emption for reliable data transfer in high-performance OBS networks

Recently, optical switching and packet processing technologies have been developed and high-performance optical burst switching (OBS) networks are constructed by using these technologies. In high-performance OBS networks, several types of applications such as Grid computing and HDTV can be provided for users according to immediate reservation protocol. Because some applications require that data is transmitted reliably over high-performance OBS networks, it is indispensable to provide reliable data transfer service for high-priority users. Therefore, in this paper, we propose a reliable burst transmission method which can be available for the immediate reservation protocol. In the proposed method, both burst-cluster transmission and probabilistic pre-emption are used at edge and core nodes. By using these methods together, the reliable data transfer and the service differentiation can be provided. We evaluate by simulation the performance of the proposed method in the 14-node NSFNET. Numerical examples show that the proposed method can transmit higher-priority bursts more reliably than the conventional method while not increasing the overall burst loss probability so much. In addition, we investigate effective parameter settings from some simulation results.

Quality-of-service mechanisms in all-IP wireless access networks

In this paper, we focus on resource reservation protocol (RSVP)-based quality-of-service (QoS) provisioning schemes under Internet protocol (IP) micromobility. We consider QoS provisioning mechanisms for on-going RSVP flows during handoff. First, the rerouting of RSVP branch path at a crossover router (CR) at every handoff event can minimize resource reservation delays and signaling overheads, and in turn the handoff service degradation can be minimized. We show that RSVP branch path rerouting scheme could give a good tradeoff between the resource reservation cost and the link usage. Second, the new RSVP reservation can be made along the branch path toward the CR via a new base station in advance, while the existing reservation path is maintained, and in turn the on-going flow can be kept with the guaranteed QoS. We also show that seamless switching of RSVP branch path could provide the QoS guarantee by adaptively adjusting the pilot signal threshold values. Third, during RSVP resource reservation over wireless link, dynamic resource allocation scheme is used to give a statistical guarantee on the handoff success of on-going flows. We finally obtain the forced termination probability of guaranteed service flows, the average system time of best effort flows by using a transition rate matrix approach.