共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
This work proposes a stochastic model to characterize the transmission control protocol (TCP) over optical burst switching
(OBS) networks which helps to understand the interaction between the congestion control mechanism of TCP and the characteristic
bursty losses in the OBS network. We derive the steady-state throughput of a TCP NewReno source by modeling it as a Markov
chain and the OBS network as an open queueing network with rejection blocking. We model all the phases in the evolution of
TCP congestion window and evaluate the number of packets sent and time spent in different states of TCP. We model the mixed
assembly process, burst assembler and disassembler modules, and the core network using queueing theory and compute the burst
loss probability and end-to-end delay in the network. We derive expression for the throughput of a TCP source by solving the
models developed for the source and the network with a set of fixed-point equations. To evaluate the impact of a burst loss
on each TCP flow accurately, we define the burst as a composition of per-flow-bursts (which is a burst of packets from a single
source). Analytical and simulation results validate the model and highlight the importance of accounting for individual phases
in the evolution of TCP congestion window. 相似文献
3.
A major concern in optical burst-switched (OBS) networks is contention, which occurs when more than one bursts contend for the same data channel at the same time. Due to the bufferless nature of OBS networks, these contentions randomly occur at any degree of congestion in the network. When contention occurs at any core node, the core node drops bursts according to its dropping policy. Burst loss in OBS networks significantly degrades the throughput of TCP sources in the local access networks because current TCP congestion control mechanisms perform a slow start phase mainly due to contention rather than heavy congestion. However, there has not been much study about the impact of burst loss on the performance of TCP over OBS networks. To improve TCP throughput over OBS networks, we first introduce a dropping policy with burst retransmission that retransmits the bursts dropped due to contention, at the ingress node. Then, we extend the dropping policy with burst retransmission to drop a burst that has experienced fewer retransmissions in the event of contention at a core node in order to reduce the number of events that a TCP source enters the slow start phase due to contention. In addition, we propose to limit the number of retransmissions of each burst to prevent severe congestion. For the performance evaluation of the proposed schemes, we provide an analytic throughput model of TCP over OBS networks. Through simulations as well as analytic modeling, it is shown that the proposed dropping policy with burst retransmission can improve TCP throughput over OBS networks compared with an existing dropping policy without burst retransmission. 相似文献
4.
Burst assembly is one of the key factors affecting the TCP performance in optical burst switching (OBS) networks. When the
TCP congestion window is small, the fixed-delay burst assembler waits unnecessarily long, which increases the end-to-end delay
and thus decreases the TCP goodput. On the other hand, when the TCP congestion window becomes larger, the fixed-delay burst
assembler may unnecessarily generate a large number of small-sized bursts, which increases the overhead and decreases the
correlation gain, resulting in a reduction in the TCP goodput. In this paper, we propose adaptive burst assembly algorithms
that use the congestion window sizes of TCP flows. Using simulations, we show that the usage of the congestion window size
in the burst assembly algorithm significantly improves the TCP goodput (by up to 38.4% on the average and by up to 173.89%
for individual flows) compared with the timer-based assembly, even when the timer-based assembler uses the optimum assembly
period. It is shown through simulations that even when estimated values of the congestion window size, that are obtained via
passive measurements, are used, TCP goodput improvements are still close to the results obtained by using exact values of
the congestion window. 相似文献
5.
N. Sreenath N. Srinath J. Aloysius Suren K. D. S. S. U. Kumar 《Photonic Network Communications》2014,27(1):47-56
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. 相似文献
6.
Hong Xiaobin Zhou Jun Wu Jian Guo Hongxiang Zuo Yong Xu Kun Lin Jintong Key Laboratory of Information Photonics Optical Communications Ministry of Education 《中国通信》2010,7(2):87-91
Transmission Control Protocol (TCP) performance over Optical Burst Switching (OBS) is experimentally investigated on an OBS network testbed, concluding that burst losses will lead to a significant drop in the available TCP bandwidth. Two mechanisms are introduced to improve TCP performance. One is concerning the burst assembly optimization and another is based on the novel assembly and scheduling mechanism to reduce the burst losses. 相似文献
7.
Xiang Yu Jikai Li Xiaojun Cao Yang Chen Chunming Qiao 《Lightwave Technology, Journal of》2004,22(12):2722-2738
Optical burst switching (OBS) is a promising switching technology to exploit the potential benefits of optical communication and, at the same time, support statistical multiplexing of data traffic at a fine granularity. To quantify its benefits, the paper describes several typical burst assembly algorithms and studies their impact on the assembled burst traffic characteristics as well as the performance of TCP traffic. Also described is a proactive burst scheduling algorithm, called burst overlap reduction algorithm (BORA), which schedules locally assembled bursts in such a way as to reduce burst contention at downstream nodes in OBS networks. Furthermore, to provide analytical insights into performance evaluation of OBS networks, a burst loss model at an OBS node and its extension to different reservation protocols are presented. 相似文献
8.
Qiong Zhang Neal Charbonneau Vinod M. Vokkarane Jason P. Jue 《Photonic Network Communications》2011,22(3):299-312
For optical burst-switched (OBS) networks in which TCP is implemented at a higher layer, the loss of bursts can lead to serious
degradation of TCP performance. Due to the bufferless nature of OBS, random burst losses may occur, even at low traffic loads.
Consequently, these random burst losses may be mistakenly interpreted by the TCP layer as congestion in the network. The TCP
sender will then trigger congestion control mechanisms, thereby reducing TCP throughput unnecessarily. In this paper, we introduce
a controlled retransmission scheme in which the bursts lost due to contention in the OBS network are retransmitted at the
OBS layer. The OBS retransmission scheme can reduce the burst loss probability in the OBS core network. Also, the OBS retransmission
scheme can reduce the probability that the TCP layer falsely detects congestion, thereby improving the TCP throughput. We
develop an analytical model for evaluating the burst loss probability in an OBS network that uses a retransmission scheme,
and we also analyze TCP throughput when the OBS layer implements burst retransmission. We develop a simulation model to validate
the analytical results. Simulation and analytical results show that an OBS layer with controlled burst retransmission provides
up to two to three orders of magnitude improvement in TCP throughput over an OBS layer without burst retransmission. This
significant improvement is primarily because the TCP layer triggers fewer time-outs when the OBS retransmission scheme is
used. 相似文献
9.
Yang Chen Chunming Qiao Xiang Yu 《IEEE network》2004,18(3):16-23
10.
Burst assembly mechanism is one of the fundamental factors that determine the performance of an optical burst switching (OBS)
network. In this paper, we investigate the influence of the number of burstifiers on TCP performance for an OBS network. The
goodput of TCP flows between an ingress node and an egress node traveling through an optical network is studied as the number
of assembly buffers per destination varies. First, the burst-length independent losses resulting from the contention in the
core OBS network using a non-void-filling burst scheduling algorithm, e.g., Horizon, are studied. Then, burst-length dependent
losses arising as a result of void-filling scheduling algorithms, e.g., LAUC-VF, are studied for two different TCP flow models:
FTP-type long-lived flows and variable size short-lived flows. Simulation results show that for both types of scheduling algorithms,
both types of TCP flow models, and different TCP versions (Reno, Newreno and Sack), TCP goodput increases as the number of
burst assemblers per egress node is increased for an OBS network employing timer-based assembly algorithm. The improvement
from one burstifier to moderate number of burst assemblers is significant (15–50% depending on the burst loss probability,
per-hop processing delay, and the TCP version), but the goodput difference between moderate number of buffers and per-flow
aggregation is relatively small, implying that an OBS edge switch should use moderate number of assembly buffers per destination
for enhanced TCP performance without substantially increasing the hardware complexity.
相似文献
Ezhan Karasan (Corresponding author)Email: |
11.
光突发交换(OBS)技术集成光电路交换和光分组交换的优势,能满足现有大容量、高速率的多媒体信息交换与传输,将成为下一代光IP骨干网的核心技术。本文详细论述了OBS网络中的关键技术———突发分组的组装技术的各种策略与实现方式,指出具有良好QoS保证又可降低可操控性的突发组装策略将成为最佳选择。 相似文献
12.
Study of TCP performance over OBS networks has been an important problem of research lately and it was found that due to the congestion control mechanism of TCP and the inherent bursty losses in the Optical Burst Switching (OBS) network, the throughput of TCP connections degrade. On the other hand, High Speed TCP (HSTCP) was proposed as an alternative to the use of TCP in high bandwidth-delay product networks. HSTCP aggressively increases the congestion window used in TCP, when the available bandwidth is high and decreases the window cautiously in response to a congestion event. In this work, we make a thorough simulation study of HSTCP over OBS networks. While the earlier works in the literature used a linear chain of nodes as the network topology for the simulation, we use the popular 14-node NSFNET topology that represents an arbitrary mesh network in our study. We also study the performance of HSTCP over OBS for different bandwidths of access networks. We use two different cases for simulations where in the first HSTCP connections are routed on disjoint paths while in the second they contend for resources in the network links. These cases of simulations along with the mesh topology help us clearly distinguish between the congestion and contention losses in the OBS network and their effect on HSTCP throughput. For completeness of study, we also simulate TCP traffic over OBS networks in all these cases and compare its throughput with that of HSTCP. We observe that irrespective of the access network bandwidth and the burst loss rate in the network, HSTCP outperforms TCP in terms of the throughput and robustness against multiple burst losses up to the expected theoretical burst loss probability of 10−3. 相似文献
13.
光突发交换(OBS)是IP over WDM核心网络采用的交换技术。在OBS网络中,送往同一边缘节点的IP分组汇聚成传输和交换的基本单元———数据突发(DB),DB丢弃会导致大量IP分组丢失,显著影响传输层的性能。文中分析OBS网络的参数对传输控制协议(TCP)吞吐量和时延的影响。仿真结果表明,DB丢包率越高,TCP性能越差。在低丢包率情况下,随着DB长度的增加,TCP吞吐量和端到端时延明显增加,高丢包率情况下则不明显;随着汇聚周期的增加,TCP吞吐量逐渐下降,端到端时延逐渐增加。 相似文献
14.
Rajesh R. C. Bikram Neal Charbonneau Vinod M. Vokkarane 《Photonic Network Communications》2011,21(2):158-169
It is well-known that the bufferless nature of optical burst-switching (OBS) networks cause random burst loss even at low
traffic loads. When TCP is used over OBS, these random losses make the TCP sender decrease its congestion window even though
the network may not be congested. This results in significant TCP throughput degradation. In this paper, we propose a multi-layer
loss-recovery approach with automatic retransmission request (ARQ) and Snoop for OBS networks given that TCP is used at the
transport layer. We evaluate the performance of Snoop and ARQ at the lower layer over a hybrid IP-OBS network. Based on the
simulation results, the proposed multi-layer hybrid ARQ + Snoop approach outperforms all other approaches even at high loss probability. We developed an analytical model for end-to-end
TCP throughput and verified the model with simulation results. 相似文献
15.
Random early detection gateways for congestion avoidance 总被引:24,自引:0,他引:24
The authors present random early detection (RED) gateways for congestion avoidance in packet-switched networks. The gateway detects incipient congestion by computing the average queue size. The gateway could notify connections of congestion either by dropping packets arriving at the gateway or by setting a bit in packet headers. When the average queue size exceeds a present threshold, the gateway drops or marks each arriving packet with a certain probability, where the exact probability is a function of the average queue size. RED gateways keep the average queue size low while allowing occasional bursts of packets in the queue. During congestion, the probability that the gateway notifies a particular connection to reduce its window is roughly proportional to that connection's share of the bandwidth through the gateway. RED gateways are designed to accompany a transport-layer congestion control protocol such as TCP. The RED gateway has no bias against bursty traffic and avoids the global synchronization of many connections decreasing their window at the same time. Simulations of a TCP/IP network are used to illustrate the performance of RED gateways 相似文献
16.
使用泊松业务流模型对光突发交换网络进行性能分析不能准确地反映网络状态。该文从理论上对突发包长度进行了推导,对基于时间门限汇聚机制下突发包数据流自相似程度进行了计算机仿真测量,并利用自相似业务流模型对光突发交换网络中比较常用的LAUC和LAUC-VF调度算法进行了性能仿真。仿真结果表明:基于时间门限的汇聚机制能够有效地降低数据流自相似程度,数据流的自相似特性对LAUC算法的影响并不非常明显,但对LAUC-VF算法的性能则产生了比较严重的影响,其突发包丢失率较泊松流平均增加了近3个百分点。 相似文献
17.
Saravut Charcranoon Tarek S. El-Bawab Jong-Dug Shin Hakki C. Cankaya 《Photonic Network Communications》2006,11(1):99-110
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. 相似文献
18.
Since its advent in 1981, TCP has been subject to a tremendous amount of research effort and enhancements for achieving better performance over various network environments and application scenarios. Due to the transmission characteristics of optical burst switched networks, such as random burst dropping, retro-blocking (i.e., bursts proceeding or delayed from their actual reservation time slot), burstification delay, and burst signaling delay, TCP could be significantly affected if no corresponding countermeasure and enhancement are developed. In this review article we provide a comprehensive survey on reported studies for TCP enhancements over OBS networks in order to mitigate the numerous side effects due to the buffer- less characteristic of burst transmission. Furthermore, we closely analyze TCP behavior over OBS networks with various burst transmission characteristics while highlighting the open challenges that have not yet been extensively tackled or solved. 相似文献
19.
Among the various issues lying in optical burst switching (OBS) networks, burstification, i.e., assembling multiple IP packets
into bursts, is an important one. Between the two important aspects related to burst assembly, the burst assembly algorithm
aspect has been extensively studied in the literature. However, as far as we know, there is no research about the burstification
queue management (BQM) aspect, which refers to how many burstification queues (BQ) we should set at each OBS edge node and
how to manage these BQs. Suppose there are G destinations (egress edge nodes) and the OBS network provides S different quality of service (QoS) classes. Traditionally, it is simply regarded that each ingress edge node needs G· S queues to sort incoming packets, one for each possible destination and QoS class. For simplicity, we call this policy the
static dedicate BQM (SDB) policy. The SDB policy, though simple, lacks scalability since we have to add S BQs at each OBS
edge node if an extra OBS edge node is added to the OBS network. To solve this problem, we propose in this paper two BQM policies:
quasi-static BQM (QSB) policy and dynamic BQM (DB) policy. For the QSB policy, we derive the packet loss probability due to
lacking BQs based on a Markov chain, from which we can work out the employed number of BQs for a given packet loss probability.
Based on these results, the scalability of the QSB policy is also studied. With the DB policy, we not only can dynamically
assign BQs for incoming packets, but also can dynamically allocate buffer capacity for each BQ by using a least-mean-square
(LMS)-based linear prediction filter. The performance of the DB policy is investigated by analysis and extensive simulations.
We also compared the performance of the QSB policy and the DB policy. Results from analysis and simulation demonstrate that
the DB policy is the best. 相似文献
20.
FAST TCP is important for promoting data-intensive applications since it can cleverly react to both packet loss and delay for detecting network congestion. This paper provides a continuous time model and extensive stability analysis of FAST TCP congestion-control mechanism in bufferless Optical Burst Switched Networks (OBS). The paper first shows that random burst contentions are essential to stabilize the network, but cause throughput degradation in FAST TCP flows when a burst with all the packets from a single round is dropped. Second, it shows that FAST TCP is vulnerable to burst delay and fails to detect network congestion due to the little variation of round-trip time, thus unstable. Finally it shows that introducing extra delays by implementing burst retransmission stabilizes FAST TCP over OBS. The paper proves that FAST TCP is not stable over barebone OBS. However, it is locally, exponentially, and asymptotically stable over OBS with burst retransmission. 相似文献