A Novel Implementation of TCP Vegas by UsingA Fuzzy-Threshold Base Algorithm to Improve Performance of Optical Networks

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Reza Poorzare ◽  
Siamak Abedidarabad
Keyword(s):  
Fuzzy Logic ◽  
Optical Networks ◽  
Network Performance ◽  
Optical Burst Switching ◽  
Window Size ◽  
Congestion Window ◽  
Improve Performance ◽  
Burst Switching ◽  
Packet Delivery ◽  
Tcp Vegas

AbstractThere is a misunderstanding in Optical Burst Switching (OBS) networks about the congestion status in the network that can cause a reduction in the performance of the networks. OBS networks are bufferless in their nature so when a burst drop happens in the network it can be because of the congestion or contention in the network but TCP cannot distinguish it is due to the congestion or contention. TCP wrongly decreases the congestion window size (cwnd) and causes significant reduction of the network performance. In this paper we are trying to employ a new algorithm by using fuzzy logic and some thresholds to divide the network into several areas then we can solve the problem. This new scheme can help us to distinguish a burst drop is because of the congestion or a burst contention in the network. Extensive simulative studies show that the proposed algorithm outperforms TCP Vegas in terms of throughput and packet delivery count.

scholarly journals Best Fit Void Filling Segmentation Based Algorithm in Optical Burst Switching Networks

2016 ◽  
Vol 1 ◽  
pp. 1
Author(s):  
A. K. Rauniyar ◽  
A. S. Mandloi
Keyword(s):  
Optical Networks ◽  
Wavelength Division Multiplexing ◽  
Scheduling Algorithm ◽  
Optical Burst Switching ◽  
Wdm Optical Networks ◽  
Switched Networks ◽  
Burst Switching ◽  
College Of Engineering ◽  
Data Burst ◽  
Optical Burst

<p>Optical Burst Switching (OBS) is considered to be a promising paradigm for bearing IP traffic in Wavelength Division Multiplexing (WDM) optical networks.  Scheduling of data burst in data channels in an optimal way is one of a key problem in Optical Burst Switched networks. The main concerns in this paper is to schedule the incoming bursts in proper data channel such that more burst can be scheduled so burst loss will be less. There are different algorithms exists to schedule data burst on data channels. Non-preemptive Delay-First Minimum Overlap Channel with Void Filling (NP-DFMOC-VF) and Non-preemptive Segment-First Minimum Overlap Channel with Void Filling (NP-SFMOC-VF) are best among other existing segmentation based void filling algorithms. Though it gives less burst loss but not existing the channel utilization efficiently. In this paper we propose a new approach, which will give less burst loss and also utilize existing channels in efficient way. Also analyze the performance of this proposed scheduling algorithm and compare it with the existing void filling algorithms. It is shown that the proposed algorithm gives some better performances compared to the existing algorithms.</p><p><em>Journal of Advanced College of Engineering and Management, Vol.1, 2015,</em> pp. 1-10</p><p> </p>

Performance Analysis Of Wdm Mesh Hierarchical Time Sliced Optical Burst Switched Networks

2012 ◽  
Author(s):  
C. Yahaya ◽  
A. L. Muhammad Shafie ◽  
M. Abu Bakar ◽  
E. Hassan
Keyword(s):  
Optical Networks ◽  
Optical Burst Switching ◽  
Loss Probability ◽  
Bandwidth Sharing ◽  
Switched Networks ◽  
Burst Switching ◽  
Delay Sensitive ◽  
Simulation Results ◽  
Near Future ◽  
Optical Burst

Although Optical Burst Switching (OBS) is seen as the favored switching technology for near–future all–optical networks, this technology still suffers from high burst drops probability as a result of contention at the buffer–less core node. Many variants of OBS have been proposed to address this issue. In this paper, the performance of a newly proposed OBS variant known as Hierarchical Time Sliced OBS (HiTSOBS) is studied. The evaluation aims at comparing the performance of HiTSOBS, in terms of burst loss probability and delay for different bandwidths in different topologies. Simulation results demonstrate that larger topologies experience higher loss and higher delay. Moreover, the simulation results show that our proposed bandwidth sharing model is good for delay sensitive applications especially at lower and medium load. Key words: Optical burst switching (OBS); hierarchical time sliced optical burst switching burst loss (HiTSOBS);, contention; burst loss probability (BLP) time slot

A Review Burst Assembly Techniques in Optical Burst Switching (OBS)

2015 ◽  
Vol 73 (2) ◽  
Author(s):  
Abdulsalam A. Yayah ◽  
Abdul Samad Ismail ◽  
Yahaya Coulbaly
Keyword(s):  
Optical Networks ◽  
Optical Burst Switching ◽  
Continuous Growth ◽  
Burst Switching ◽  
Edge Node ◽  
Internet Users ◽  
All Optical ◽  
Burst Assembly ◽  
Switching Method ◽  
Optical Burst

Optical Burst Switching (OBS) is perceived as the most favorable switching method for the next generation all optical networks to support the growth of the number of Internet users and to satisfy bandwidth demands for greedy-bandwidth applications which are in continuous growth. OBS consists of an edge node and a core node. The edge node is responsible for burst assembly which is the first process in an OBS network. Currently, there is only one review paper for burst assembly; the paper is limited in number of techniques reviewed. In this paper, we have undertaken a comprehensive review of burst assembly techniques proposed for OBS where techniques are reviewed by category. The aim is to identify strengths and weaknesses of these techniques. The analysis of the paper will assist researchers in finding problems; thus, a significant amount of time will be saved which can be used in developing appropriate solutions for OBS networks.

Channel Scheduling Based on Orchestrator Live Node-Wavelength Reservation for Optical Burst Switching Networks

2020 ◽  
Vol 15 (1) ◽  
pp. 34-45
Author(s):  
S. Manisekar ◽  
J. A.V. Selvi
Keyword(s):  
Fuzzy Logic ◽  
Optical Burst Switching ◽  
Packet Transmission ◽  
Burst Switching ◽  
End To End Delay ◽  
The Status ◽  
End To End ◽  
Burst Assembly ◽  
Offset Time ◽  
Optical Burst

Background: Dedicated wavelength utilization and the isolation of control plane from the data plane are the important features in the design of Optical Burst Switching (OBS). The contention in bursts, link congestion and the reservation cause the burst dropping in optical networks. The slotted time and the burst assembly models incorporate the wavelength assignment and the channel reservation schemes to reduce the dropping probability. The reservation of resources prior to burst arrival and the additional delay due to the burst assembly and the offset time are the major issues in the reduction of probability. Besides, the traditional one-to-one packet transmission consumes more time due to a large number of packets handling. Materials and Methods: This paper proposes the novel OBS model that incorporates the three processes such as Open-Flow (OF)-based Orchestrator Live Node (OLN) modeling, fuzzy logic based ranking and the offset time-based reservation (without/with void filling) to overcome the issues in the traditional methods. Initially, the OLN modeling based on OF analysis includes the Flow Information Base (FIB) table for the periodical update of the link information. The fuzzy logic- based ranking of channels followed by OF-OLN predicts the status of the wavelength such as free, used and conversion. Based on the status, the channels are reserved without and with void filling to schedule the bursts effectively. The reservation scheme employs the Offset-Time Burst Assembly algorithm to allow the resource reservation prior to burst arrival. Through these processes, the reuse of wavelength and the reallocation of resources are possible in OBS. Results & Conclusion: The controlling of maximum burst transfer delay by the OTBA efficiently reduces the end-to-end delay for data traffic. The comparative analysis between the proposed OLN-WR with the existing Hybrid Burst Assembly (HBA), Fuzzy-based Adaptive Threshold (FAT) and Fuzzy-based Adaptive Hybrid Burst Assembly (FAHBA) in terms of end-to-end delay and transmitted amount of bursts assures the applicability of OLN-WR in scheduling and communication activities in OBS networks.

scholarly journals Adaptive Probabilistic Broadcasting over Dense Wireless Ad Hoc Networks

2010 ◽  
Vol 2010 ◽  
pp. 1-12 ◽  
Author(s):  
Victor Gau ◽  
Jenq-Neng Hwang
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Window Size ◽  
Data Broadcasting ◽  
Improve Performance ◽  
Packet Delivery ◽  
Elapsed Time ◽  
Contention Window Size ◽  
Hoc Networks

We propose an idle probability-based broadcasting method,iPro, which employs an adaptive probabilistic mechanism to improve performance of data broadcasting over dense wireless ad hoc networks. In multisource one-hop broadcast scenarios, the modeling and simulation results of the proposediProare shown to significantly outperform the standard IEEE 802.11 under saturated condition. Moreover, the results also show that without estimating the number of competing nodes and changing the contention window size, the performance of the proposediProcan still approach the theoretical bound. We further applyiProto multihop broadcasting scenarios, and the experiment results show that within the same elapsed time after the broadcasting, the proposediProhas significantly higher Packet-Delivery Ratios (PDR) than traditional methods.

Sign in / Sign up

Export Citation Format

Share Document