Packet loss and delay performance of feedback and feed-forwardarrayed-waveguide gratings-based optical packet switches with WDMinputs-outputs

This paper analyzes the packet loss and delay performance of an arrayed-waveguide-grating-based (AWG) optical packet switch developed within the EPSRC-funded project WASPNET (wavelength switched packet network). Two node designs are proposed based on feedback and feed-forward strategies, using sharing among multiple wavelengths to assist in contention resolution. The feedback configuration allows packet priority routing at the expense of using a larger AWG. An analytical framework has been established to compute the packet loss probability and delay under Bernoulli traffic, justified by simulation. A packet loss probability of less than 10^-9 was obtained with a buffer depth per wavelength of 10 for a switch size of 16 inputs-outputs, four wavelengths per input at a uniform Bernoulli traffic load of 0.8 per wavelength. The mean delay is less than 0.5 timeslots at the same buffer depth per wavelength     

Scheduling algorithms for shared fiber-delay-line optical packet Switches-part II: the three-stage clos-network case

In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. To prevent packet loss in the switch, fiber delay lines (FDLs) are used as optical buffers to store optical packets. However, assigning FDLs to the arrival packets to achieve high throughput, low delay, and low loss rate is not a trivial task. In the authors' companion paper, several efficient scheduling algorithms were proposed for single-stage shared-FDL optical packet switches (OPSs). To further enhance the switch's scalability, this work was extended to a multistage case. In this paper, two scheduling algorithms are proposed: 1) sequential FDL assignment and 2) multicell FDL assignment algorithms for a three-stage optical Clos-Network switch (OCNS). The paper shows by simulation that a three-stage OCNS with these FDL assignment algorithms can achieve satisfactory performance.     

基于图卷积神经网络的软件定义电力通信网络路由控制策略

传输时延和数据包丢失率是电力通信业务可靠传输重点关注的问题,该文提出一种面向软件定义电力通信网络的最小路径选择度路由控制策略。结合电力通信网络软件定义网络(SDN)集中控制架构的特点,利用图卷积神经网络构建的链路带宽占用率预测模型(LBOP-GCN)分析下一时刻路径带宽占用率。通过三角模算子(TMO)融合路径的传输时延、当前时刻的路径带宽占用率和下一时刻的路径带宽占用率,计算出从源节点到目的节点间不同传输路径的选择度(Q),然后将Q值最小的路径作为SDN控制器下发的流表项。实验结果表明,该文所提出的路由控制策略能有效减小业务传输时延和数据包丢失率。     

'Staggering switch': an 'almost-all' optical packet switch

An 'almost-all' optical packet switch architecture is presented, based on two rearrangeably nonblocking stages interconnected by optical delay lines with different amounts of delay. Probability of loss as a function of link use and the size of the switch is investigated. In general, with proper setting of the number of delay lines, the switch can achieve arbitrarily low probability of loss.<>     

无线传感器网络路由协议的设计与实现

针对传统路由协议端到端时延长、丢包率过高的现实问题,提出了一种基于贪婪转发的能量感知多路径路由协议(Greedy Forward Energy-aware Multipath Routing Protocol,GFEMRP)。GFEMRP从传感器起始结点出发,如果遇到网络黑洞则选择周边转发方式,否则将选择吞吐量大、且更接近于目的结点的结点作为下一跳结点。利用了OMNET++5.0和INET框架对包括无线自组网按需平面距离向量路由协议(Ad hoc on-demand distance vector routing protocol,AODV),动态按需无线自组织网络(Dynamic MANET On-demand,DYMO),贪婪周边无状态路由无线网络(Greedy Perimeter Stateless Routing for Wireless Networks,GPSR)和GFEMRP协议在内的四种路由协议进行了仿真和比较,实验结果表明GFEMRP协议具有良好的端到端时延、丢包率等性能。     

Performance analysis of handover delay and buffer capacity in mobile OpenFlow‐based networks

Software‐defined networking (SDN) is a network concept that brings significant benefits for the mobile cellular operators. In an SDN‐based core network, the average service time of an OpenFlow switch is highly influenced by the total capacity and type of the output buffer, which is used for temporary storage of the incoming packets. In this work, the main goal is to model the handover delay due to the exchange of OpenFlow‐related messages in mobile SDN networks. The handover delay is defined as the overall delay experienced by the mobile node within the handover procedure, when reestablishing an ongoing session from the switch in the source eNodeB to the switch in the destination eNodeB. We propose a new analytical model, and we compare two systems with different SDN switch designs that model a continuous time Markov process by using quasi‐birth–death processes: (1) single shared buffer without priority (model SFB), used for all output ports for both control and user traffic, and (2) two isolated buffers with priority (model priority finite buffering [PFB]), one for control and the other for user plane traffic, where the control traffic is always prioritized. The two proposed systems are compared in terms of total handover delay and minimal buffer capacity needed to satisfy a certain packet error ratio imposed by the link. The mathematical modeling is verified via extensive simulations. In terms of handover delay, the results show that the model PFB outperforms the model SFB, especially for networks with high number of users and high probability of packet‐in messages. As for the buffer dimensioning analysis, for lower arrival rates, low number of users, and low probability of packet‐in messages, the model SFB has the advantage of requiring a smaller buffer size.     

Dynamic cache allocation routing strategy of Internet of things satellite node based on traffic prediction

Aiming at the routing problem of low earth orbit (LEO) Internet of things (IoT) satellite systems,a dynamic cache allocation routing strategy based on traffic prediction for IoT satellite nodes was proposed.Firstly,the space-time characteristics of traffic distribution in the LEO coverage area were analyzed,and an end-to-end traffic prediction model was proposed.Then,according to the traffic prediction result,a dynamic cache allocation routing strategy was proposed.The satellite node periodically monitored the traffic load of the inter-satellite link,dynamically allocated the cache resources of each inter-satellite link between the neighboring nodes.The cache allocation process was divided into two phases,initialization and system operation.At the same time,the traffic offload and packet forwarding strategy when the node was congested was proposed.By comparing the queuing delay and the forwarding delay,it was determined whether the data packet needs to be rerouted.The simulation results show that the proposed routing strategy effectively reduces the packet loss rate and average end-to-end delay,and improves the traffic distribution in the whole network.     

Scheduling algorithms for shared fiber-delay-line optical packet Switches-part I: the single-stage case

In all-optical packet switching, packets may arrive at an optical switch in an uncoordinated fashion. When contention occurs, fiber delay lines (FDLs) are needed to delay (buffer) the packets that have lost the contention to some future time slots for the desired output ports. There have been several optical-buffered switch architectures and FDL assignment algorithms proposed in the literature. However, most of them either have high implementation complexity or fail to schedule in advance departure time for the delayed packets. This paper studies the packet scheduling algorithms for the single-stage shared-FDL optical packet switch. Three new FDL assignment algorithms are proposed, namely sequential FDL assignment (SEFA), multicell FDL assignment (MUFA), and parallel iterative FDL assignment (PIFA) algorithms for the switch. The proposed algorithms can make FDLs and output-port reservation so as to schedule departure time for packets. Owing to FDL and/or output-port conflicts, the packets that fail to be scheduled are discarded before entering the switch so that they do not occupy any FDL resources. It is shown by simulation that with these algorithms, the optical-buffered switch can achieve a loss rate of /spl sim/10/sup -7/ even at the load of 0.9. These algorithms are extended to the three-stage Clos-Network optical packet switches in the companion paper.     

一种自适应早期包丢弃方案

该文提出了一种自适应早期包丢弃方案,与以ATM网络支持的TCP应用中通常采用的早期包丢弃方案相比,该方案能减少ATM网络交换结点所需的缓存数量,提高ATM网络中IP流量的完好流量通过率,并降低丢包率。     

Intermediate-node-initiation (INI): A generalized signaling framework for optical burst-switched networks

In this paper, we discuss different signaling techniques for optical burst-switched networks. We develop a generalized signaling framework for optical burst-switched networks, which provides guidelines about the performance of each signaling technique based on the different parameters in the framework. The two commonly used signaling techniques in optical burst switching are two-way based tell-and-wait (TAW) and one-way based just-enough-time (JET). TAW suffers from high end-to-end packet delay, while JET suffers from high packet loss. There is no signaling technique that offers flexibility in terms of both loss and delay. We propose a hybrid signaling technique called intermediate-node-initiated (INI) signaling for optical burst-switched networks. INI can provide different levels of loss and delay characteristics based on end-user application requirements. The granularity of INI ranges between the one-way based and the two-way based signaling techniques. In INI reservation of channels is initiated at an intermediate node, known as the initiating node, in both forward and backward directions at the same time. We show that by appropriately selecting the initiating node, we can simulate both TAW and JET using the INI signaling technique. Through simulations, we shown that INI performs better than TAW in terms of average end-to-end packet delay and better than JET in terms of burst loss probability. We extend the INI signaling technique to provide QoS differentiation in the OBS core, differentiated INI (DINI), by carefully choosing different initiation nodes depending on delay and loss requirements of end-user applications. Through extensive simulations, we show that the DINI technique outperforms the existing offset-based QoS technique.     

A fast parallel-tree switch architecture for ATM networks

In this paper we present a novel fast packet switch architecture based on Banyan interconnection networks, called parallel-tree Banyan switch fabric (PTBSF). It consists of parallel Banyans (multiple outlets) arranged in a tree topology. The packets enter at the topmost Banyan. Internal conflicts are eliminated by using a conflict-free 3 × 4 switching element which distributes conflicting cells over different Banyans. Thus, cell loss may occur only at the lowest Banyan. Increasing the number of Banyans leads to a noticeable decrease in cell loss rate. The switch can be engineered to provide arbitrarily high throughput and low cell loss rate without the use of input buffering or cell pre-processing. The performance of the switch is evaluated analytically under uniform traffic load and by simulation, under a variety of asynchronous transfer mode (ATM) traffic loads. Compared to other proposed architectures, the switch exhibited stable and excellent performance with respect to cell loss and switching delay for all studied conditions as required by ATM traffic sources. The advantages of PTBSF are modularity, regularity, self-routing, low processing overhead, high throughput and robustness, under a variety of ATM traffic conditions. © 1998 John Wiley & Sons, Ltd.     

Logarithmic Delay for N ×N Packet Switches Under the Crossbar Constraint

We consider the fundamental delay bounds for scheduling packets In an N times N packet switch operating under the crossbar constraint. Algorithms that make scheduling decisions without considering queue backlog are shown to incur an average delay of at least O(N). We then prove that O(log(N)) delay is achievable with a simple frame based algorithm that uses queue backlog information. This is the best known delay bound for packet switches, and is the first analytical proof that sublinear delay is achievable in a packet switch with random inputs.     

Odd-even input-buffered multicast switch

An input buffered packet switch called the odd-even multicast switch is proposed. The packet splitting probability of the proposed switch is derived and the packet output contention is resolved using the cyclic-priority reservation (CPR) algorithm. The throughput and mean packet delay of the proposed switch are compared with a simple input buffered switch. It is found that the proposed switch gives a significant performance improvement at the expense of extra packet splitting overhead     

A high-performance input access scheme for ATM multicast switching

In this paper, we propose an input access scheme for input-queued ATM multicast switches, achieving high system throughput, low packet delay and packet loss probability. Multicast and unicast packets of each input port are separately queued. Multicast queues take priority over the unicast queues, and both types of queues are fairly served in a cyclic-priority access discipline. In particular, each unicast queue is handled on a window-service basis, and each multicast packet is switched in a one-shot scheduling manner. To evaluate the performance of the access scheme, we propose an approximate analysis based on a simplified cyclic-priority model for anN×N finite-buffer multicast switch possessing Bernoulli multicast and unicast arrivals, with window-service (for unicasting) and one-shot scheduling (for multicasting) both taken into account. Finally, we show simulation results to demonstrate the accuracy of the approximate analysis and the superiority of the scheme over existing schemes with respect to normalized system throughput, mean packet delay, and packet loss probability.An earlier version of this paper appeared in IEEE ICC'96.     

Performance characteristics of cascaded delay‐line node architectures in single‐path interconnection networks

Internally buffered multistage interconnection network architectures have been widely used in parallel computer systems and large switching fabrics. Migration from electrical domain to optical domain has raised the necessity of developing node architectures with optical buffers. Cascaded fibre delay line architectures can be seen as possible realizations of output and shared buffering in a 2 × 2‐switching element. These approaches can be used as buffered node architecture in a Banyan like interconnect. In this paper, we investigate and compare these approaches by using simulation methods. Different performance metrics, such as normalized throughput, average packet delay, packet loss rate and buffer utilization have been used under uniform and non‐uniform traffic models. Results show that the TC‐chain node Banyan network offer an improved normalized throughput and average packet delay performances under both traffic models without disrupting first‐in‐first‐out order of arrivals. The switched delay‐line requires fewer switching elements than TC and TTC architectures but at the cost of high packet delay. Copyright © 2004 John Wiley & Sons, Ltd.     

软件定义网络中基于密码标识的报文转发验证机制

针对软件定义网络(SDN)中缺乏安全高效的数据来源验证机制问题,该文提出基于密码标识的报文转发验证机制。首先,建立基于密码标识的报文转发验证模型,将密码标识作为IP报文进出网络的通行证。其次,设计SDN批量匿名认证协议,将SDN控制器的验证功能下放给SDN交换机,由SDN交换机进行用户身份验证和密码标识验证,快速过滤伪造、篡改等非法报文,提高SDN控制器统一认证与管理效率,同时可为用户提供条件隐私保护。提出基于密码标识的任意节点报文抽样验证方案,任何攻击者无法通过推断采样来绕过报文检测,确保报文的真实性的同时降低其处理延迟。最后,进行安全性分析和性能评估。结果表明该机制能快速检测报文伪造和篡改及抵抗ID分析攻击,但同时引入了大约9.6%的转发延迟和低于10%的通信开销。     

GDSR：一种基于车载自组网的分组路由协议

针对DSR路由协议因节点频繁移动,路由发现和路由维护过程频繁发生,导致数据传输的时延增加和丢包率增加的问题.在DSR路由协议基础上,提出一种带有分组的DSR路由协议（GDSR）.该协议通过K-medoids聚类算法合理地选择组头,使得分组路由协议更加适合车载自组网的多变的拓扑结构.仿真结果表明,带有分组的GDSR路由协议能够降低数据传输的端到端的时延和丢包率.     

Analysis of input and output queueing for nonblocking ATM switches

A switch model for ATM networks is analyzed. Its interconnection network is internally nonblocking and is provided with dedicated input and output queues, one per switch inlet and one per switch outlet. The switch operates with an internal speed-up: more than one packet per slot can be transferred from the head-of-line positions of the input queues to each output queue by the interconnection network. Two different operation modes are considered for the interaction between input and output queues: backpressure mode and queue loss mode. The analytical model developed for the evaluation of the switch performance under random traffic assumes an infinite size for the switch, arbitrary values for input and output queue size, as well as for the speed-up factor. Switch throughput, packet delay and loss performance are evaluated and the analytical model accuracy is assessed using computer simulation results     

Cell-sorting device for creating synchronous variable-length optical packet switches

We consider the design of a synchronous variable-length optical packet switch. Fixed-length packet switches may be used to switch variable-length packets if the packets are first divided into multiple fixed-length cells. However, for many fixed-length switch architectures, cells from multiple packets will become interspersed, and packet integrity will not be preserved. We describe the design of a fiber-delay-line-based cell sorter that when appended to the output of a fixed-length packet switch converts the switch into a variable-length packet switch by enabling variable-length packets to exit contiguously. We describe two implementations of the cell sorter. The first is simply a bank of delay lines. The second uses two stages of time-slot interchange and reduces the number of delay line elements to be a logarithmic function of the maximum packet length. We also estimate the packet-blocking probabilities of the resulting variable-length packet switch and verify our results via simulation.     

Performance of new relay selection scheme for buffer-assisted multihop decode-and-forward networks

In this paper, a new relay selection scheme is proposed to reduce the end-to-end packet delivery delay for buffer-assisted multihop decode-and-forward cooperative networks. The proposed method selects a relay node having more packets in the associated buffer and relay's proximity to the destination node. Mathematical expressions for the outage probability and average packet delay in Rician fading are obtained by modeling the system as a Markov chain. The proposed relay selection scheme has less packet delay as compared to the max-link relay selection scheme with marginally higher outage probability. Thus, the proposed relay selection scheme is a good alternative to low latency wireless applications.