Improving TCP performance over optical burst-switched (OBS) networks using forward segment redundancy

Random contentions occur in optical burst-switched (OBS) networks because of one-way signaling and lack of optical buffers. These contentions can occur at low loads and are not necessarily an indication of congestion. The loss caused by them, however, causes TCP at the transport layer to reduce its send rate drastically, which is unnecessary and reduces overall performance. In this paper, we propose forward segment redundancy (FSR), a proactive technique to prevent data loss during random contentions in the optical core. With FSR, redundant TCP segments are appended to each burst at the edge and redundant burst segmentation is implemented in the core, so that when a contention occurs, primarily redundant data are dropped. We develop an analytical throughput model for TCP over OBS with FSR and perform extensive simulations. FSR is found to improve TCP’s performance by an order of magnitude at high loads and by over two times at lower loads.     

Loss differentiation in OBS networks without wavelength-conversion capability

Service differentiation is an open research issue in OBS networks. Most proposals assume full wavelengthconversion, but wavelength converters are still very complex and expensive. We propose the QoS Multiple Wavelength Simultaneous Transmission technique (QoS-MWST), a novel method for providing loss differentiation in OBS networks without wavelengthconversion capability (or even limited capability). In QoS-MWST, multiple copies of each burst are simultaneously sent on different wavelengths, and loss differentiation is achieved by properly sending more copies of the higher-priority bursts. Through analysis and simulation, we prove that QoS-MWST can efficiently provide loss differentiation in this type of OBS networks.     

TCP over OBS边缘节点重传机制的研究

使用传输控制协议(TCP)的拥塞控制机制在传统互联网技术中是解决问题的很好方法.然而在面对新型的光网络技术OBS网络,简单地采用TCP技术因受到OBS自身特性的影响,性能表现不佳,吞吐量低下.为此,通过对OBS技术和TCP拥塞控制机制深入的研究,提出一种基于OBS边缘节点的ACK重传机制来提升TCP over OBS性能的方法,提高OBS网络吞吐量.     

Analytic models for the latency and steady-state throughput of TCP Tahoe, Reno, and SACK

Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.     

可用于大型Grid over OBS光子网格网络的自组织资源管理技术

针对目前以光突发交换(OBS)为基础的光子网格(grid)网络中基于客户/服务器(C/S)模型的资源管理技术的缺点,在已有工作的基础上提出了一种改进式的基于P2P技术的自组织资源管理技术.该技术利用P2P的特点以及通过对资源所进行的特定描述,从而使资源信息分散存储在多个节点上,同时利用该技术可以较快地实现资源查找.仿真结果表明,该方案不但可以解决传统C/S资源管理方案扩展性不足和容错性较差的缺点,同时可以进一步地缩短资源查找时间,因此可以更好地支持未来面向普通消费者群体的大规模网格业务.     

Source-ordering for improved TCP performance over load-balanced optical burst-switched (OBS) networks

Recent advances in optical switching technology allow for the creation of networks in which data bursts are switched optically at each node, offering a greater degree of flexibility suitable for handling bursty Internet traffic. TCP-based applications account for a majority of data traffic in the Internet; thus understanding and improving the performance of TCP implementations over OBS networks are critical. Previously, several articles show that load-balanced routing improves loss-performance in OBS. In this paper, we identify the ill-effects of load-balanced OBS on TCP performance caused by false time-outs and false fast-retransmits. We propose a source-ordering mechanism that significantly improves TCP throughput over a load-balanced OBS network.     

基于可变长光突发数据分组的OBS网络性能分析

光突发交换(OBS)网络是迈向全光分组交换网络的典型代表.文章主要研究了基于可变长光突发数据分组的OBS网络性能,给出并分析了不同负荷量大小的情况下网络中的平均突发数据分组数量等参数.在设定网络速率为10和40 Gbit/s的情况下,给出了网络平均时延、突发数据分组负荷量及突发数据分组长度之间的关系.所得结果可作为对OBS网络理论研究的一种补充.     

光突发交换网络中的闭环竞争解析

为改善光突发交换网络(OBS)的性能,深入探讨了光突发交换网络中的闭环竞争解析,提出了OBS网络中的主动资源预留方案OBS—RED和显式竞争通知方案OBS—ECN。OBS—RED采用随机早期丢弃策略,即根据数据信道拥塞情况,随机早期地丢弃控制分组。OBS—ECN的实现需要OBS—RED的支持。在OBS—ECN中,不是随机丢弃控制分组,而是将这一信息显式地通知边缘节点,边缘节点再作相应的处理。OBS—RED与OBS—ECN的应用,有利于提高网络吞吐量和链路带宽资源利用率,大大减少数据突发的阻塞概率。     

光突发交换网络中突发模式发射机设计

分析了光突发交换(OBS)网络中突发模式光发射的关键技术,提出了采用外调制技术实现突发模式光发射机的设计方案.其核心部件是多量子阱电吸收调制器(MQW-EAM),并对其驱动电路和整体电路进行了仿真,论证了实现突发模式光发射机的调制方式及其主要技术指标.     

Service differentiation scheme in OBS networks

In order to achieve service differentiation, especially loss differentiation, in optical burst switching (OBS) networks, we propose a dynamic fiber delay line (FDL) partitioning algorithm, which divides FDLs into several groups over a feed-forward output buffering architecture. In the proposed scheme, a plurality of traffic classes and FDL groups can be considered, and each FDL group is assigned to traffic classes, so that the target loss probabilities of classes are guaranteed. Also, the optimal number of FDLs for each FDL group by the proposed algorithm is decided in Poisson traffic environments. The extensive simulation results validate the effectiveness of the proposed dynamic FDL partitioning algorithm for the loss differentiation in OBS networks.     

OBS网络中改进的重调度算法

信道调度算法是提高光突发交换(OBS)网络性能的关键技术之一.文章在重调度算法的基础上首次提出了一种改进的重调度算法,通过一次性搜索保存数据信道信息,减少了重调度处理的次数与复杂性,并能降低系统的丢包率.     

Adaptive path selection in OBS networks

In this paper, the authors investigate the concept of adaptive path selection in optical burst-switched networks and its potential to reducing the overall burst drop probability. Specifically, the authors assume that each source maintains a (short) list of alternate paths to each destination and uses information regarding the recent congestion status of the network links to rank the paths; it then transmits bursts along the least congested path. The authors present a suite of path selection strategies, each utilizing a different type of information regarding the link congestion status, and evaluate them using simulation. The results demonstrate that, in general, adaptive path selection outperforms shortest path routing, and, depending on the path strategy involved, the network topology, and the traffic pattern, this improvement can be significant. A new framework for the development of hybrid (or meta) path selection strategies, which make routing decisions based on a weighted combination of the decisions taken by several independent path selection strategies, has been presented. This paper presents two instances of such hybrid strategies, i.e., 1) one that assigns static weights and 2) one that dynamically adjusts the weights based on feedback from the network; it has been shown that these strategies can further improve the overall burst drop probability in the network.     

On burst-header contention-resolution in OBS networks

Advances in enabling technologies and the explosive growth of Internet traffic has led to the widespread proliferation of network systems in recent years. With their relatively low cost, high throughputs, high-bandwidth utilization, and low-transmission latency, Optical Burst Switching (OBS) networks represent an ideal solution for next-generation Internet applications. However, in OBS networks, Burst Header Packet (BHP) contentions occur when two or more BHPs are switched simultaneously to the same output port of a given core node. These contention events result in significant losses of the corresponding data burst. Accordingly, this study presents a Store-and-forward COntention-REsolution mechanism, designated as SCORE, which utilizes fiber delay line buffers to resolve the BHP collision problem, thereby minimizing the burst loss rate. The results of a series of simulations performed using an OIRC OBS-ns simulator confirm the effectiveness and efficiency of the proposed scheme.

Improving performance of TCP over mobile wireless networks

Mobile IP is a network layer protocol for handling mobility of hosts in the Internet. However, mobile IP handoff causes degradation of TCP performance. Hence, there is a need for improving performance of TCP over mobile IP in wireless mobile networks. We propose an approach which handles losses due to both wireless link errors and host mobility. To handle losses due to host mobility, a method for seamless handoff is proposed. Empirical results show that the scheme provides substantial improvement of performance.

Reducing the impact of false time out on TCP performance in TCP over OBS networks

Random burst contention losses plague the performance of Optical Burst Switched networks. Such random losses occur even in low load network condition due to the analogous behavior of wavelength and routing algorithms. Since a burst may carry many packets from many TCP sources, its loss can trick the TCP sources to conclude/infer that the underlying (optical) network is congested. Accordingly, TCP reduces sending rate and switches over to either fast retransmission or slow start state. This reaction by TCP is uncalled-for in TCP over OBS networks as the optical network may not be congested during such random burst contention losses. Hence, these losses are to be addressed in order to improve the performance of TCP over OBS networks. Existing work in the literature achieves the above laid objective at the cost of violating the semantics of OBS and/or TCP. Several other works make delay inducing assumptions. In our work, we introduce a new layer, called Adaptation Layer, in between TCP and OBS layers. This layer uses burst retransmission to mitigate the effect of burst loss due to contention on TCP by leveraging the difference between round trip times of TCP and OBS. We achieve our objective with the added advantage of maintaining the semantics of the layers intact.     

Priority-based offline wavelength assignment in OBS networks

Optical burst switching (OBS) is a promising technique for wavelength division multiplexing (WDM) networks. In practice, wavelength converters (WCs) are either absent or only sparsely deployed in WDM networks due to economic and technical limitations. Thus, wavelength assignment is expected to be an important component of OBS networks. In this paper, an offline wavelength assignment scheme in OBS networks without wavelength conversion capability is proposed. The key idea of the scheme is to decide the wavelength searching order of each traffic connection at edge nodes according to the wavelength priorities determined by the calculated burst loss probabilities on different wavelengths. Simulation results indicate that the proposed scheme can reduce the network-wide burst loss probability significantly compared with other schemes. It is also illustrated that the performance of the proposed scheme can be further enhanced by a larger number of wavelengths per link and a reasonable delay bound at edge nodes.     

OBS中基于抢占调度的资源释放策略研究

在光突发交换(OBS)网络的数据信道调度算法中,多采用抢占策略来解决QoS问题,从而导致了大量已预留资源的浪费.提出并探讨了一种预留失败后可及时释放已预留资源的解决方案,并给出了各控制分组和核心节点处资源预留表项的格式,最后分析了其可行性.     

Throughput-based fair bandwidth allocation in OBS networks

Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.     

光突发交换网络的一种批量重调度算法

数据信道调度算法是光突发交换网络的关键算法.按需重调度算法(0DBR)只重调度一个突发,对性能提高有限,为此提出批量重调度算法.仿真结果表明该算法突发丢失率低于LAUC、LAUC-VF和按需重调度算法.     

Long-term estimation-based burst control algorithm in OBS networks

By taking advantage of statistical multiplexing gain in the burst level, optical burst switching (OBS) technology enables optical Internet to handle huge volume of data in an efficient manner without requiring optical buffers in the optical domain. However, when congestion builds up in the optical network core, large amount of data might be lost. In this article, we propose an efficient optical burst control algorithm that operates based on the awareness of future burst traffic condition to eliminate the effect of congestion reaction delay. The proposed algorithm takes advantage of multiple statistics to improve the estimation accuracy.Through performance evaluation, it is verified that the proposed algorithm proactively controls inbound burst traffic so that the OBS network can stay in a stable traffic condition while keeping the network throughput high.