Analysis of blocking probability in optical burst switched networks

Tintor, Vladica; Matavulj, Petar; Radunovic, J.B.

doi:10.1007/s11107-007-0101-2

Cited by 11 publications

(4 citation statements)

References 14 publications

(17 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…e possibility of data contention and loss is examined in the context of multiple routing codes [25]. e model in [26] is a lower load fixedpoint method for determining the likelihood of data loss. For both JIT and JET concepts, the method utilizes data segmentation and path-based priorities.…”

Section: Related Researchmentioning

confidence: 99%

[Retracted] Dynamic Wavelength Scheduling by Multiobjectives in OBS Networks

Kumar¹,

Kumar

Shribala³

et al. 2022

Journal of Mathematics

View full text Add to dashboard Cite

The burst dropping ratio is witnessed in the contemporary literature as a considerable constraint of optical burst switching (OBS) networks that attained many researchers’ efforts in the recent past. Among the multiple practices endeavoring to reduce the burst drop ratio, the optimal burst scheduling is one dimension in this regard. The transmission channel scheduling and appropriate wavelength allocation are critical objectives to achieve optimal burst scheduling in regard to minimal burst drop ratio. Many of the scheduling models depicted in the contemporary literature aimed to achieve the optimum scheduling by electing the channels, which depend on optimum utilization of idle time. Some of the studies tried to select channels by any metrics of quality, and significantly minimal amount of studies focused on wavelength allocation for lowering BDR. Moreover, in regard to this, this study tried to achieve optimum wavelength allocation beneath manifold objective QoS metrics, which is identified as “multiobjective dynamic wavelength scheduling (DyWaS).” The experimental study carried through the simulations evinced that the proposed model DyWaS escalated the optimality of burst scheduling through wavelength allocation compared with other existing methods represented in the contemporary literature.

show abstract

Section: Related Researchmentioning

confidence: 99%

[Retracted] Dynamic Wavelength Scheduling by Multiobjectives in OBS Networks

Kumar¹,

Kumar

Shribala³

et al. 2022

Journal of Mathematics

View full text Add to dashboard Cite

show abstract

“…As a result, there is an increasing demand fo r network bandwidth and quality of service [1]. An optical network based on the WDM (Wavelength Div ision Multiplexing) technique is considered as a very promising approach for developing future large bandwidth networks.…”

Section: Introductionmentioning

confidence: 99%

Multihop Routing and Wavelength Assignment Algorithm for Optical WDM Networks

Tintor¹,

Radunovic²

2012

IJNC

Self Cite

View full text Add to dashboard Cite

We propose a new routing and wavelength assignment scheme that improves the blocking probability of WDM networks and offers a very good utilizat ion of the networks resources. This heuristic results in high quality of service, prioritization of the LAN networks and lower installat ion costs compared with the traditional RWA algorith ms applied in WDM networks. It is based on the distributed Dijkstra sparse placement routing algorithm, first-fit wavelength reservation and traffic mu ltip lexing. We apply load balancing and a sparse electronic switch placement algorithm during the process of finding the optimal lightpath in order to reduce the number of dropped lightpath sessions to zero, min imize the number of opaque nodes and maximize the utilization of the network.

show abstract

“…In Ref. [14], we examine the blocking probability in optical burst switching networks and the issue of quality of service in transparent optical networks is one of the issues that is expected to be studied more.…”

Section: Introductionmentioning

confidence: 99%

Distributed Dijkstra sparse placement routing algorithm for translucent optical networks

Tintor

Radunovic

2008

Photon Netw Commun

Self Cite

View full text Add to dashboard Cite

In this paper we study translucent optical networks as an alternative to fully transparent and fully opaque optical networks. In the former networks, a technique called sparse placement is used to overcome the lightpath blocking caused by the signal quality degradation, using much less regenerators, which must strategically be placed, in contrast to a fully opaque network. In this paper we propose a sparse placement algorithm based on two requirements. The first one is signal regeneration necessary to re-amplify, reshape, and retime the optical signals after some predefined transparent distance in order to successfully receive the signals at the destination node. The other is load balance of the traffic in the network aimed at efficient usage of the network capacity resources. We apply a distributed Dijkstra routing algorithm which dynamically changes weights of links during the process of locating regeneration capable nodes. We compare the performance of the proposed algorithm with commonly used sparse placement algorithms through simulation experiments. The benefits are such that load balancing of the network traffic is fully utilized, and with technological development it will be sufficient to equip up to 30% of nodes in the network with electronic regenerations in order to have the same performance as in an opaque network.

show abstract

Analysis of blocking probability in optical burst switched networks

Cited by 11 publications

References 14 publications

[Retracted] Dynamic Wavelength Scheduling by Multiobjectives in OBS Networks

[Retracted] Dynamic Wavelength Scheduling by Multiobjectives in OBS Networks

Multihop Routing and Wavelength Assignment Algorithm for Optical WDM Networks

Distributed Dijkstra sparse placement routing algorithm for translucent optical networks

Contact Info

Product

Resources

About