Some principles for designing a wide-area WDM optical network

Mukherjee, Biswanath; Banerjee, D.; Ramamurthy, S.; Mukherjee, Amarnath

doi:10.1109/90.541317

Cited by 370 publications

(166 citation statements)

References 23 publications

Supporting

Mentioning

165

Contrasting

Unclassified

Order By: Relevance

“…The first approach is based on exact MILP (Mixed Integer Linear Programming) formulations, with the objective to minimize the number of transceivers required in the network, yielding optimal solutions to the problem. Clearly, both the SVTD-R and SVTD-NR problems are NP-hard, as the reduced problem with constant traffic is known to be NP-hard (integer capacity planning) [6]. Our tests indicate that solving the problem optimally using the MILP formulations can be done in reasonable time only for small network sizes and for a moderate number of time intervals.…”

Section: Introductionmentioning

confidence: 88%

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Skorin-Kapov¹,

Pavón‐Mariño²,

Garcia-Manrubia³

et al. 2009

Proceedings of the 6th International ICST Conference on Broadband Communications, Networks, and Systems

View full text Add to dashboard Cite

Abstract-This paper investigates offline planning and scheduling in transparent optical networks for a given periodic traffic demand. The main objective is to minimize the number of transceivers needed which make up for the main network cost. We call this problem "Scheduled Virtual Topology Design" and consider two variants: non-reconfigurable and reconfigurable equipment. We formulate both problems as exact MILPs (Mixed Integer Linear Programs). Due to their high complexity, we propose a more scalable tabu search heuristic approach, in conjunction with smaller MILP formulations for the associated subproblems. The main motivation of our research efforts is to assess the benefits of using reconfigurable equipment, realized as a reduction in the number of required transceivers. Our results show that the achieved reductions are not very significant, except for cases with large network loads and high traffic variability.Index Terrms-All-optical networks, virtual topology design, multilayer optimization, scheduling, tabu search.

show abstract

Section: Introductionmentioning

confidence: 88%

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Skorin-Kapov¹,

Pavón‐Mariño²,

Garcia-Manrubia³

et al. 2009

Proceedings of the 6th International ICST Conference on Broadband Communications, Networks, and Systems

View full text Add to dashboard Cite

show abstract

“…This problem can be solved due to the use of heuristic algorithms, such as Tabu-search [18,19], the annealing algorithm [20,21], or genetic algorithms [22].…”

Section: Methods For Solving Of Rwa Problemmentioning

confidence: 99%

Radio over Fiber Networks Synthesis Using Meta-Heuristic BCO

Pereverzev¹

2013

COM

View full text Add to dashboard Cite

Email address:pereverzev_aa@mail.ru (A. Pereverzev), dm@ageyev.in.ua (D. Ageyev) To cite this article:Alexander Pereverzev, Dmitry Ageyev. Radio over Fiber Networks Synthesis Using Meta-Heuristic BCO, Communications.Vol. 1, No. 1, 2013, pp. 9-15. doi: 10.11648/j.com.20130101.12 Abstract: Radio access network over fiber (RoF) technology combines both wireless and fiber-optic technology. The advantages of this technology are low attenuation, bigger network bandwidth, easy installation and management, reduced power consumption, multiservice, dynamic allocation of resources. There are many methods of designing optical and wireless networks. Since RoF combines these technologies, the design tasks are a complex problem. Therefore there is a need for a new design method for RoF technology. The main problem in designing DWDM transport networks is the wavelength assignment of light paths. If the network topology has a great need to use heuristic methods there is one way to solve this problem: use of the BCO-RWA algorithm. Meta-based heuristic algorithm BCO-RWA contains the modeling of the behavior of bees collecting nectar. The main advantage of this algorithm is low computational complexity. However, BCO-RWA has the following disadvantage: during the calculation of route selection probability, base algorithm does not take into account the nonlinear four-wave mixing phenomenon. In this paper we present new method to design RoF network and modification of BCO-RWA algorithm.

show abstract

“…Note that the latter will have an impact on where jobs will end up being executed, thus the eventual traffic matrix, hence the network dimensions. It is clear that jointly determining both server and network dimensions is a very hard problem (note that even single-period dimensioning, where a single traffic matrix is given specifying the average demand between every node pair, may already be NP-hard [14]). Therefore, we will propose a phased approach, dimensioning first the servers and then the network (see Section 3).…”

Section: The Grid Dimensioning Problemmentioning

confidence: 99%

On dimensioning optical grids and the impact of scheduling

et al. 2008

Self Cite

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

Some principles for designing a wide-area WDM optical network

Cited by 370 publications

References 23 publications

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Scheduled Virtual Topology Design Under Periodic Traffic in Transparent Optical Networks

Radio over Fiber Networks Synthesis Using Meta-Heuristic BCO

On dimensioning optical grids and the impact of scheduling

Contact Info

Product

Resources

About