scholarly journals Quantum Key Based Burst Confidentiality in Optical Burst Switched Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
A. M. Balamurugan ◽  
A. Sivasubramanian

The optical burst switching (OBS) is an emergent result to the technology concern that could achieve a feasible network in future. They are endowed with the ability to meet the bandwidth requirement of those applications that require intensive bandwidth. There are more domains opening up in the OBS that evidently shows their advantages and their capability to face the future network traffic. However, the concept of OBS is still far from perfection facing issues in case of security threat. The transfer of optical switching paradigm to optical burst switching faces serious downfall in the fields of burst aggregation, routing, authentication, dispute resolution, and quality of service (QoS). This paper deals with employing RC4 (stream cipher) to encrypt and decrypt bursts thereby ensuring the confidentiality of the burst. Although the use of AES algorithm has already been proposed for the same issue, by contrasting the two algorithms under the parameters of burst encryption and decryption time, end-to-end delay, it was found that RC4 provided better results. This paper looks to provide a better solution for the confidentiality of the burst in OBS networks.

Author(s):  
A. K. Rauniyar ◽  
A. S. Mandloi

<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>


2005 ◽  
Vol 9 (3) ◽  
pp. 357-371 ◽  
Author(s):  
Vishwas S Puttasubbappa ◽  
Harry G Perros

2012 ◽  
Author(s):  
C. Yahaya ◽  
A. L. Muhammad Shafie ◽  
M. Abu Bakar ◽  
E. Hassan

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


Sign in / Sign up

Export Citation Format

Share Document