Segmentation-based nonpreemptive channel scheduling algorithms for optical burst-switched networks

Vokkarane, Vinod M.; Jue, Jason P.

doi:10.1109/jlt.2005.856265

Cited by 44 publications

(17 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, both types of void filling algorithms are still considered too slow to provide a viable solution to the problem [14]. Table 1 summarizes the comparison between the algorithms based on the study in [15]. It uses the following notation: (w) number of wavelengths at each output port; (N b ) number of bursts currently scheduled on every data channel.…”

Section: Burst Schedulingmentioning

confidence: 99%

Flexible simulators for oBS network architectures

Pedrola

Rumley

Klinkowski

et al. 2008

2008 10th Anniversary International Conference on Transparent Optical Networks

View full text Add to dashboard Cite

Since the OBS paradigm has become a potential candidate to cope with the needs of the future all optical networks, it has really caught the attention from both academia and industry worldwide. In this direction, OBS networks have been investigated under many different scenarios comprising numerous architectures and strategies. This heterogeneous context encourages the development of flexible simulation tools. These tools should permit both an easy integration of any possible new network protocol design and a rapid adaptation to different performance target goals. In this paper, we present two OBS network simulators, namely, a C-based simulator (ADOBS) and our novel Java-based simulator (JAVOBS). We compare their performances and we provide some exemplary results that point out remarkable flexibility that can be achieved with the JAVOBS simulator. Keywords: optical burst switching (OBS), simulation tool, flexibility. INTRODUCTIONTo move towards IP-over-WDM architectures, various optical switching techniques have been under intensive research. Among them, three switching paradigms have appeared as potential candidates. Firstly, Optical Circuit Switching (OCS) [1] pursues a wavelength routed networking architecture with a whole wavelength as its finest granularity. However, it lacks both the flexibility and efficiency required to cope with the needs of current traffic patterns. Secondly, in the Optical Packet Switching (OPS) approach [2], each packet is sent into the network with its own header. This header is going to be either electronically or all-optically processed at each intermediate node while the packet is optically buffered. Although OPS may be seen as both the natural choice and conceptually ideal for the future all-optical networks, current optical technology is still immature and not able to overcome its exigencies. Finally, in order to provide optical switching for next-generation Internet traffic in a flexible yet feasible way, the Optical Burst Switching (OBS) paradigm was proposed in [3]. In an OBS network, a burst control packet (BCP) is sent out-of-band both to reserve all resources and to set up the path for its burst of data, which will be sent optically after an offset time in a cut through manner. In this way, OBS allows for an efficient use of resources without the need of optical buffering at any intermediate node. Although it can be seen as an intermediate step of the migration from OCS to OPS, OBS has emerged as a more competitive choice for the transmission of data traffic in the near future. In essence, OBS combines the best from both OCS and OPS while avoiding their shortcomings. Consequently, OBS has received an increasing amount of attention from the optical research community and has become, nowadays, a research field of its own.OBS networks display a complex structure and the design of their constituent elements offers several degrees of freedom. So far, much of the research on OBS networks has been conducted through theoretical analysis. Undeniably, the analytical approach...

show abstract

Section: Burst Schedulingmentioning

confidence: 99%

Flexible simulators for oBS network architectures

Pedrola

Rumley

Klinkowski

et al. 2008

2008 10th Anniversary International Conference on Transparent Optical Networks

View full text Add to dashboard Cite

show abstract

“…Besides above approaches, which are common in both traditional and optical networks, there is a contention resolution scheme peculiar to OBS networks-segmentation [6,12,[30][31][32]. When two bursts result in a contention, one of them would be completely transmitted.…”

Section: Contention Resolutionmentioning

confidence: 99%

On the fairness improvement of channel scheduling in optical burst-switched networks

Hsu

2007

Photon Netw Commun

View full text Add to dashboard Cite

In the past years, several signaling protocols were proposed for OBS networks and the most popular one is the Just-Enough-Time (JET) protocol. JET not only efficiently utilizes the network capacity, but also effectively reduces the end-to-end transmission delay. However, the most critical defect of JET is its intrinsic deficiency: Fairness. The fairness problem is a traditional problem common to various kinds of networks. It results in a phenomenon that bursts with a shorter number of hops are generally favorized and hence deteriorates the network utilization as well. In this article, we investigate this problem and propose a fair channel scheduling algorithm as a solution. Usually there is a tradeoff between fairness and blocking performance. Accordingly, the objective of our scheme is to achieve a balance between the two conflicting metrics as much as possible. In our scheme, each burst is associated with a dynamic priority which is defined by several characteristics of the burst. When contention occurs, the proposed scheme picks the preferable burst and drops the other one according to their priorities. From simulation results, we observed that the proposed scheme could improve fairness without causing significant reduction in dropping performance. Furthermore, it increases the effective link utilization as well.

show abstract

“…The example of non segmentation Horizon algorithms are FFUC, LAUC and non segmentation Void algorithms are FFUC-VF [3], LAUC-VF [4,5,6,7] and Min-EV [8]. The example of segmentation Horizon algorithms are Non preemptive Minimum Overlap Channel (NP-MOC) [9], Non-preemptive Delay-First Minimum Overlap Channel (NP DFMOC) [9] and Non-preemptive Segment-First Minimum Overlap Channel (NP-SFMOC) [9]. And the example of non segmentation void filling algorithms are Non preemptive Minimum Overlap Channel with Void Filling (NP-MOC-VF) [9], Non-preemptive Delay-First Minimum Overlap Channel with Void Filling (NP-DFMOC-VF) [9] and Non-preemptive Segment First Minimum Overlap Channel with Void Filling (NP-SFMOC-VF) [9].…”

Section: Introductionmentioning

confidence: 99%

“…The example of segmentation Horizon algorithms are Non preemptive Minimum Overlap Channel (NP-MOC) [9], Non-preemptive Delay-First Minimum Overlap Channel (NP DFMOC) [9] and Non-preemptive Segment-First Minimum Overlap Channel (NP-SFMOC) [9]. And the example of non segmentation void filling algorithms are Non preemptive Minimum Overlap Channel with Void Filling (NP-MOC-VF) [9], Non-preemptive Delay-First Minimum Overlap Channel with Void Filling (NP-DFMOC-VF) [9] and Non-preemptive Segment First Minimum Overlap Channel with Void Filling (NP-SFMOC-VF) [9]. Horizon algorithms are easy to implement and burst loss ratio is high, where as burst loss ratio is lower in Void filling algorithms but complex switching are required to implement.…”

Section: Introductionmentioning

confidence: 99%

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

Rauniyar

Mandloi

2016

J. Adv. Coll. Engin. Mgt.

View full text Add to dashboard Cite

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.

show abstract

Segmentation-based nonpreemptive channel scheduling algorithms for optical burst-switched networks

Cited by 44 publications

References 28 publications

Flexible simulators for oBS network architectures

Flexible simulators for oBS network architectures

On the fairness improvement of channel scheduling in optical burst-switched networks

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

Contact Info

Product

Resources

About