Methods and problems of wavelength-routing in all-optical networks

We give a survey of recent theoretical results obtained for wavelength-routing in all-optical networks. The survey is based on the previous survey in [Beauquier, B., Bermond, J-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising from wavelength-routing in all-optical networks. In: Proc. of the 2nd Workshop on Optics and Computer Science, part of IPPS'97, 1997]. We focus our survey on the current research directions and on the used methods. We also state several open problems connected with this line of research, and give an overview of several related research directions

Online Permutation Routing in Partitioned Optical Passive Star Networks

This paper establishes the state of the art in both deterministic and randomized online permutation routing in the POPS network. Indeed, we show that any permutation can be routed online on a POPS network either with $O(\frac{d}{g}\log g)$ deterministic slots, or, with high probability, with $5c\lceil d/g\rceil+o(d/g)+O(\log\log g)$ randomized slots, where constant $c=\exp (1+e^{-1})\approx 3.927$. When $d=\Theta(g)$, that we claim to be the "interesting" case, the randomized algorithm is exponentially faster than any other algorithm in the literature, both deterministic and randomized ones. This is true in practice as well. Indeed, experiments show that it outperforms its rivals even starting from as small a network as a POPS(2,2), and the gap grows exponentially with the size of the network. We can also show that, under proper hypothesis, no deterministic algorithm can asymptotically match its performance

Benchmarking and viability assessment of optical packet switching for metro networks

Optical packet switching (OPS) has been proposed as a strong candidate for future metro networks. This paper assesses the viability of an OPS-based ring architecture as proposed within the research project DAVID (Data And Voice Integration on DWDM), funded by the European Commission through the Information Society Technologies (IST) framework. Its feasibility is discussed from a physical-layer point of view, and its limitations in size are explored. Through dimensioning studies, we show that the proposed OPS architecture is competitive with respect to alternative metropolitan area network (MAN) approaches, including synchronous digital hierarchy, resilient packet rings (RPR), and star-based Ethernet. Finally, the proposed OPS architectures are discussed from a logical performance point of view, and a high-quality scheduling algorithm to control the packet-switching operations in the rings is explained

Forwarding and optical indices of 4-regular circulant networks

An all-to-all routing in a graph $G$ is a set of oriented paths of $G$, with exactly one path for each ordered pair of vertices. The load of an edge under an all-to-all routing $R$ is the number of times it is used (in either direction) by paths of $R$, and the maximum load of an edge is denoted by $\pi(G,R)$. The edge-forwarding index $\pi(G)$ is the minimum of $\pi(G,R)$ over all possible all-to-all routings $R$, and the arc-forwarding index $\overrightarrow{\pi}(G)$ is defined similarly by taking direction into consideration, where an arc is an ordered pair of adjacent vertices. Denote by $w(G,R)$ the minimum number of colours required to colour the paths of $R$ such that any two paths having an edge in common receive distinct colours. The optical index $w(G)$ is defined to be the minimum of $w(G,R)$ over all possible $R$, and the directed optical index $\overrightarrow{w}(G)$ is defined similarly by requiring that any two paths having an arc in common receive distinct colours. In this paper we obtain lower and upper bounds on these four invariants for $4$-regular circulant graphs with connection set $\{\pm 1,\pm s\}$, $1<s<n/2$. We give approximation algorithms with performance ratio a small constant for the corresponding forwarding index and routing and wavelength assignment problems for some families of $4$-regular circulant graphs.Comment: 19 pages, no figure in Journal of Discrete Algorithms 201

Minimum Cost Design of Cellular Networks in Rural Areas with UAVs, Optical Rings, Solar Panels and Batteries

Bringing the cellular connectivity in rural zones is a big challenge, due to the large installation costs that are incurred when a legacy cellular network based on fixed Base Stations (BSs) is deployed. To tackle this aspect, we consider an alternative architecture composed of UAV-based BSs to provide cellular coverage, ground sites to connect the UAVs with the rest of the network, Solar Panels (SPs) and batteries to recharge the UAVs and to power the ground sites, and a ring of optical fiber links to connect the installed sites. We then target the minimization of the installation costs for the considered UAV-based cellular architecture, by taking into account the constraints of UAVs coverage, SPs energy consumption, levels of the batteries and the deployment of the optical ring. After providing the problem formulation, we derive an innovative methodology to ensure that a single ring of installed optical fibers is deployed. Moreover, we propose a new algorithm, called DIARIZE, to practically tackle the problem. Our results, obtained over a set of representative rural scenarios, show that DIARIZE performs very close to the optimal solution, and in general outperforms a reference design based on fixed BSs