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

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

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.     

Analytical Modeling of Offset-Induced Priority in Multiclass OBS Networks

In this paper, we present for the first time an analytical model that quantifies the mechanism by which offset size affects priority in multiclass optical-burst switching (OBS) systems. Using the model, we derive an exact expression for the distribution of the number of bursts that contend with an arriving burst. The model is applicable to systems in which each class has an arbitrary burst-length distribution and an arbitrary offset size. We also derive accurate approximate expressions for the burst-blocking probability of premium-class traffic, as well as expressions for the sensitivity of premium-class performance to offset jitter and variations in the arrival rates of each class. In a case study, we find that scaling up a system in terms of the number of wavelengths and the traffic load significantly improves not only the burst-blocking performance of the premium class, but also its sensitivity to lower class traffic variations. We also use the model to dimension and provision the system to guarantee a minimum level of premium-class blocking and premium-class robustness to low-class load variations.     

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.     

A non-competing hybrid optical burst switch architecture for QoS differentiation

In this paper, we present a new hybrid optical burst switch architecture (HOBS) that takes advantage of the pre-transmission idle time during lightpath establishment. In dynamic circuit switching (wavelength routing) networks, capacity is immediately hard-reserved upon the arrival of a setup message at a node, but it is used at least a round-trip time delay later. This waste of resources is significant in optical multi-gigabit networks and can be used to transmit traffic of a lower class of service in a non-competing way. The proposed hybrid OBS architecture, takes advantage of this idle time to transmit one-way optical bursts of a lower class of service, while high priority data explicitly requests and establishes end-to-end lightpaths. In the proposed scheme, the two control planes (two-way and one-way OBS reservation) are merged, in the sense that each SETUP message, used for the two-way lightpath establishment, is associated with one-way burst transmission and therefore it is modified to carry routing and overhead information for the one-way traffic as well. In this paper, we present the main architectural features of the proposed hybrid scheme and further we assess its performance by conducting simulation experiments on the NSF net backbone topology. The extensive network study revealed that the proposed hybrid architecture can achieve and sustain an adequate burst transmission rate with a finite worst case delay.     

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

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

光突发交换网络中新型减小竞争冲突方案

光突发交换是下一代光网络中的有效核心交换技术之一,在光突发交换网络中数据突发的调度是影响交换性能的重要因素,如何有效地对数据突发进行合理调度,以减小丢包率正是关键问题所在.采用在波长域业务整形与边缘节点延迟调度相结合的方法对数据突发进行调度,与LAUC-VF算法进行仿真对比分析,该方法能有效地降低突发包丢失率.     

Priority‐Based Duplicate Burst Transmission Mechanism in Optical Burst Switching Networks

This paper proposes a priority‐based duplicate burst transmission mechanism in an optical burst switching network to enhance the probability of successful reception of bursts. The performance of the proposed mechanism is evaluated by NS2 simulations. Our results show that the burst loss rate is improved especially under light traffic loads.     

Group-Scheduling for Multi-Service Optical Burst Switching (OBS) Networks

We propose a new burst scheduling mechanism for Optical Burst-Switched (OBS) networks. The new approach is made possible by gathering data bursts into groups and performing the scheduling decision for each group collectively. In OBS group-scheduling, bursts will not be considered for scheduling until a pre-defined time period elapses, during which the group of burst header packets would be gathered. By transforming a set of data bursts into a set of corresponding time intervals, the problem of scheduling these bursts is transformed into a combinatorial optimization problem. Graph algorithms are applied to obtain the maximum number of non-overlapping bursts. The proposed OBS group-scheduling scheme is shown to improve the performance of OBS networks over existing scheduling schemes in terms of burst loss probability and channel utilization. With an extension through a sequential optimization, using a Branch-and-Bound technique, the proposed scheme can support multiple classes of service. It is shown that the new scheduling approach has several desired characteristics including fairness and service differentiability among classes in terms of burst loss probability and channel utilization.     

Performance of fully variable demand assignment SS/TDMA satellite systems

Fully variable demand assignment in a SS/TDMA satellite system requires frequent burst time plan changes with reconfiguration of the on-board switch matrix state sequence. The burst managment presented in this paper assumes that bursts are not reconfigurated into new bursts during such burst time plan changes but merely shifted in time. The performance of this burst management procedure as obtained from simulations over three different networks is reported in terms of throughput gains, required signalling capacity and time required to change burst time plan.     

Analysis of Burst Segmentation in Optical Burst Switching Networks Considering Path Correlation

One of the key problems hindering the realization of optical burst switching (OBS) technology in the core networks is the losses due to contention among the bursts at the core nodes. Such contention losses do not necessarily indicate a situation of congestion. Burst segmentation is an effective contention resolution technique used to reduce the number of packets lost due to the burst losses. In this work, we propose a method of analyzing the benefit of burst segmentation considering the effect of correlation in traffic across multiple paths. Starting with the cumulative distribution function (cdf) of the length of the bursts at the ingress node destined to a particular egress node, we evaluate the cdf of the burst length at each node along the path considering the probability of segmentation and the traffic on the adjoining paths. Comparing the burst length at the egress node with that at the ingress node, we evaluate the byte loss probability (ByLP) along the path and also the network-wide average ByLP. The proposed analytical framework studies the impact of segmentation on packet loss rate considering the effect of the length of a path, the number of paths adjoining a path (extent of path correlation), the effect of load on a path and other correlated paths, and the burst assembly algorithm. Analytical and simulation results in this work show that the proposed method of analysis gives a good understanding of the influence of aforementioned factors on the benefit of segmentation in OBS networks.      

Network Control for Multibeam TDMA and SS/TDMA

This paper concentrates on the control of individual burst transmissions of traffic and reference stations in TDMA and SS/ TDMA networks. In a TDMA system, the principal task of a TDMA terminal is to transmit each burst at the proper time to assure that, at the satellite, the burst resides in its assigned location in the TDMA frame. The composite of assigned positions for all bursts in the TDMA frame, or frames if more than one transponder is involved, is called the burst time plan. The paper discusses a specific concept of control used by a station to acquire and synchronize its burst transmission to assigned time slot(s) in the TDMA frame. The concept is applied to single-beam (global or regional) and muitibeam systems. The method used controls the instant of traffic burst transmission by introducing a time delay at each station which causes the round-trip propagation time between the satellite and all earth stations to be equal for burst position control purposes. This time delay is simple to implement in the TDMA terminal's timing circuitry and does not require the storage of traffic to accomplish it. It is also shown that the control method leads to a simple means for accomplishing synchronous burst time plan changes throughout the network. The functions of the reference stations needed to accomplish the burst time plan control are defined and explained. The discussion extends to SS/TDMA, and explains how the satellite switch state time plan change can be synchronized to the overall network burst time plan change.     

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

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

A novel transfer mode to reduce burst loss rate for optical burst switching networks

A crucial issue in optical burst switching (OBS) networks is burst loss caused by resource contention. As a result, many methods are currently being proposed to reduce burst loss rate. These methods can be summed up into two categories: burst scheduling algorithms and contention resolutions. Both categories of methods can reduce burst loss rate to a certain degree. However, to make OBS to become a viable solution, the burst loss rate needs to be further reduced. Furthermore, almost all methods ignore the fact that an unfortunately scheduled, locally generated single-hop burst could block a number of future incoming transit bursts, though the burst just travels to its next downstream node. This phenomenon becomes more evident when links are heavily loaded in mesh OBS networks. To eliminate contention caused by single-hop traffic completely, this paper proposes a novel transfer mode called packet calking by differentiating between single-hop traffic from multihop traffic for OBS networks. An analysis model is developed to evaluate the performance of packet calking. Theoretical results are validated through extensive simulations in both ring and mesh networks. These results show that packet calking outperforms the transfer mode without packet calking in terms of burst loss rate and link utilization.     

New assembly techniques and fast reservation protocols for optical burst switched networks based on traffic prediction

We propose new burst assembly schemes and fast reservation (FR) protocols for Optical Burst Switched (OBS) networks that are based on traffic prediction. The burst assembly schemes aim at minimizing (for a given burst size) the average delay of the packets incurred during the burst assembly process, while the fast reservation protocols aim at further reducing the end-to-end delay of the data bursts. The burst assembly techniques use a linear prediction filter to estimate the number of packet arrivals at the ingress node in the following interval, and launch a new burst into the network when a certain criterion, different for each proposed scheme, is met. The fast reservation protocols use prediction filters to estimate the expected length of the burst and the time needed for the burst assembly process to complete. A Burst Header Packet (BHP) packet carrying these estimates is sent before the burst is completed, in order to reserve bandwidth at intermediate nodes for the time interval the burst is expected to pass from these nodes. Reducing the packet aggregation delay and the time required to perform the reservations, reduces the total time needed for a packet to be transported over an OBS network and is especially important for real-time applications. We evaluate the performance of the proposed burst assembly schemes and show that a number of them outperform the previously proposed timer-based, length-based and average delay-based burst assembly schemes. We also look at the performance of the fast reservation (FR) protocols in terms of the probability of successfully establishing the reservations required to transport the burst.     

A partial-success-rate-based resource reservation scheme for slotted OBS networks

Optical burst switching (OBS) is a promising technology for next-generation optical networks. Slotted OBS is an improved version of OBS to reduce burst loss rate, in which wavelength channels are divided into time slots. Slotted OBS has an implicit and under-used property that resources for two bursts with the same source and the same destination are interchangeable. The property further means that resource for a long-distance burst can be partially used by a short-distance burst. In this paper, we utilize the property to design a resource reservation scheme for slotted OBS networks. The scheme reserves a batch of slots every time; the specific number of slots is calculated according to number of arrived bursts and partial success rate (a newly introduced conception in this paper) at each node. Simulation results show that the proposed scheme can get lower burst loss rate, comparing with the well-performing two-way signaling scheme.     

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

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

Cellular digital packet data: channel availability

Cellular digital packet data (CDPD) networks borrow idle radio channels from advanced mobile phone standard (AMPS) cellular networks to send packet data traffic. We explore the amount of unused AMPS capacity available to parasitic data networks such as CDPD. Due to trunking inefficiencies, a relatively large amount of spare AMPS airlink capacity can be found. In addition, the periods of time AMPS channels are idle are fairly long. Due to fluctuations in the number of AMPS channels in a sector busy serving AMPS calls, there will be periods of time when there is not an ample number of idle AMPS channels for CDPD. Resource contention between CDPD and AMPS will affect the amount of data that can be carried on the CDPD airlink and the performance of higher layer protocols. We present analytical results which serve as the basis for cell site capacity engineering rules for CDPD networks     

The use of a triangular estimator to improve scheduling in optical burst switched networks

In an optical burst switched network, variable‐sized data bursts are switched on the fly using bandwidth previously reserved by their control packets. A key problem in OBS networks is the assignment of wavelengths to incoming bursts, that is, the scheduling of bursts. This paper proposes a new class of burst scheduling algorithms based on a triangular estimator. The proposed tool reduces the complexity of the scheduling scheme (measured in channel checks) without compromising its performance (measured by the burst drop ratio). Simulation results demonstrate both the accuracy and the efficiency of the estimator in a variety of scenarios and under self‐similar network traffic. Copyright © 2009 John Wiley & Sons, Ltd.