Blocking probabilities of optical burst switching networks based on reduced load fixed point approximations

Rosberg, Z.; Vu, Hai L.; Zukerman, Moshe; White, Jolyon

doi:10.1109/infcom.2003.1209222

Cited by 41 publications

(48 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The optimisation methods used in OBS routing are usually based on linear programming formulations with piecewise linear approximations of the overall BLP function [19] even it has nonlinear character [35]. Thus, in order to complete the study, we formulate and solve a nonlinear optimisation problem for an OBS network with multi-path source routing.…”

Section: Reactive and Proactive Routing Methodsmentioning

confidence: 99%

Reactive and proactive routing in labelled optical burst switching networks

2009

View full text Add to dashboard Cite

Optical burst switching architectures without buffering capabilities are sensitive to burst congestion. The existence of a few highly congested links may seriously aggravate the network throughput. Proper network routing may help in congestion reduction. The authors focus on adaptive routing strategies to be applied in labelled OBS networks, that is, with explicit routing paths. In particular, two isolated alternative routing algorithms that aim at network performance improvement because of reactive route selection are studied. Moreover, a nonlinear optimisation method for multi-path source-based routing, which aims at proactive congestion reduction is proposed. Comparative performance results are provided and some implementation issues are discussed.

show abstract

Section: Reactive and Proactive Routing Methodsmentioning

confidence: 99%

Reactive and proactive routing in labelled optical burst switching networks

2009

View full text Add to dashboard Cite

show abstract

“…The exact solution for blocking probabilities in OBS networks is an NP-complete problem [9]. Therefore, many studies employ a single-link model to calculate blocking probabilities in such networks.…”

Section: The Multilink Analytical Modelmentioning

confidence: 99%

“…In this article, we derive a multilink analytical model for the load-level-based mechanism based on the reduced load fixed-point approximation for OBS networks developed by Rosberg et al [9]. The main goal of this article is to analyze the performance of LLAC in a real network topology, using the developed multilink model.…”

Section: Introductionmentioning

confidence: 99%

Using the Network Load for Admission Control in OBS Networks: A Multilink Approach

Moraes¹,

Duarte²

2010

J. Opt. Commun. Netw.

View full text Add to dashboard Cite

Abstract-In this article, we analyze the performance of the Load-Level-Based Admission Control mechanism (LLAC) for optical burst-switched networks in a multilink scenario. The goal of our mechanism is to differentiate the blocking probability of a given service class according to the network load and a classassociated parameter, called load level. We develop a multilink analytical model based on the reduced load approximation method to analyze the proposed mechanism in more realistic scenarios. The multilink model provides an estimation error up to 13 times lower than the one provided by the single-model for the analyzed configurations. Both are compared with simulation results. In addition, our results show that the load-level-based mechanism effectively differentiates the services in all analyzed configurations, when compared with other similar mechanisms.

show abstract

“…This approach is taken in [16], where an analytical methodology known as reduced load fixed-point approximation [17] is used to dimension both network and computational resources. In this paper however, we focus on a 'clean slate' or greenfield Grid dimensioning problem finding the complete Grid capacity required to meet a given Grid job arrival pattern.…”

Section: The Grid Dimensioning Problemmentioning

confidence: 99%

On dimensioning optical grids and the impact of scheduling

et al. 2008

View full text Add to dashboard Cite

Abstract-When deploying Grid infrastructure, the problem of dimensioning arises: how many servers to provide, where to place them, and which network to install for interconnecting server sites and users generating Grid jobs? In contrast to classical optical network design problems, it is typical of optical Grids that the destination of traffic (jobs) is not known beforehand. This leads to so-called anycast routing of jobs. For network dimensioning, this implies the absence of a clearly defined (source,destination)-based traffic matrix, since only the origin of Grid jobs (and their data) is known, but not their destination. The latter depends not only on the state of Grid resources, including network, storage, and computational resources, but also the Grid scheduling algorithm used. We present a phased solution approach to dimension all these resources, and use it to evaluate various scheduling algorithms in two European network case studies. Results show that the Grid scheduling algorithm has a substantial impact on the required network capacity. This capacity can be minimized by appropriately choosing a (reasonably small) number of server site locations: an optimal balance can be found, in between the single server site case requiring a lot of network traffic to this single location, and an overly fragmented distribution of server capacity over too many sites without much statistical multiplexing opportunities, and hence a relatively large probability of not finding free servers at nearby sites.

show abstract

Blocking probabilities of optical burst switching networks based on reduced load fixed point approximations

Abstract: Abstract-

Cited by 41 publications

References 19 publications

Reactive and proactive routing in labelled optical burst switching networks

Reactive and proactive routing in labelled optical burst switching networks

Using the Network Load for Admission Control in OBS Networks: A Multilink Approach

On dimensioning optical grids and the impact of scheduling

Contact Info

Product

Resources

About