scholarly journals Survey of QoS issues for TCP connections in Optical Burst Switched Networks

2012 ◽  
Vol 42 (13) ◽  
pp. 25-28 ◽  
Author(s):  
Terrance FrederickFernandez ◽  
S.Ramachandiran S.Ramachandiran
Keyword(s):  
Switched Networks ◽  
Tcp Connections ◽  
Optical Burst

Dynamic Deflection Routing with Virtual Wavelength Assignment in Optical Burst-Switched Networks

2005 ◽  
Vol 9 (3) ◽  
pp. 347-356 ◽  
Author(s):  
SuKyoung Lee ◽  
LaeYoung Kim ◽  
JooSeok Song ◽  
David Griffith ◽  
Kotikalapudi Sriram
Keyword(s):  
Wavelength Assignment ◽  
Deflection Routing ◽  
Switched Networks ◽  
Optical Burst

Quality-of-service differentiation and fairness in optical burst-switched networks

2002 ◽  
Author(s):  
Fabrice Poppe ◽  
Koenraad Laevens ◽  
Herman Michiel ◽  
Serge Molenaar
Keyword(s):  
Quality Of Service ◽  
Service Differentiation ◽  
Switched Networks ◽  
Optical Burst

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>

Sign in / Sign up

Export Citation Format

Share Document