Agame-theoretical approach to network capacity planning under competition

The paper discusses the dimensioning strategies of two network providers (operators) that supply channels to the same population of users in a competitive environment. Usersare assumed to compete for best service (lowest blocking probability of new request), while operators wishto maximize their profits. This setting gives rise to two interconnected, noncooperative games: a) a users game, in which the partition of primary traffic between operators is determined by the operators' channel capacities and by the users' blocking-avoidance strategy; and b) a network dimensioning game between operators in which the players alternate dimensioning decisions thatmaximize their profit rate under the current channel capacity of his/her opponent. At least for two plausible users' blocking avoidance strategies discussed in the paper, the users game will always reach some algorithmic equilibrium. In the operators' game, the player strategies are given by their numbers of deployed chanels, limited by their available infrastructure resources. If the infrastrucutre is under-dimensioned with respect to the traffic rate, the operators game willreach a Nash equilibrium when both players reach full use of their available infrastructures. Otherweise, a Nash equilibrium may also arise if both operators incur the same deployment costs. If costs are asymmetric, though, the alternating game may enter a loop. If the asymmetry is modest, both players may then try to achieve a competitive monopoly in which the opponent is forced to leave the game or operate with a loss (negative profit). However, if the asymmetry is high enough, only the player with the lower costs can force his opponent to leave the game while still holding a profitable operation. --network dimensioning,game theory,duopoly,Nash equilibrium,circuit switching,blocking probability

Agame-theoretical approach to network capacity planning under competition

The paper discusses the dimensioning strategies of two network providers (operators) that supply channels to the same population of users in a competitive environment. Usersare assumed to compete for best service (lowest blocking probability of new request), while operators wishto maximize their profits. This setting gives rise to two interconnected, noncooperative games: a) a users game, in which the partition of primary traffic between operators is determined by the operators' channel capacities and by the users' blocking-avoidance strategy; and b) a network dimensioning game between operators in which the players alternate dimensioning decisions thatmaximize their profit rate under the current channel capacity of his/her opponent. At least for two plausible users' blocking avoidance strategies discussed in the paper, the users game will always reach some algorithmic equilibrium. In the operators' game, the player strategies are given by their numbers of deployed chanels, limited by their available infrastructure resources. If the infrastrucutre is under-dimensioned with respect to the traffic rate, the operators game willreach a Nash equilibrium when both players reach full use of their available infrastructures. Otherweise, a Nash equilibrium may also arise if both operators incur the same deployment costs. If costs are asymmetric, though, the alternating game may enter a loop. If the asymmetry is modest, both players may then try to achieve a competitive monopoly in which the opponent is forced to leave the game or operate with a loss (negative profit). However, if the asymmetry is high enough, only the player with the lower costs can force his opponent to leave the game while still holding a profitable operation

Upper Bounds And Hamming Spheres Under The Dc Constraint

Upper bounds on the rate of codes in dc-constrained spaces are derived for imbalances 3, 4, and 5. The new bounds are based on the identification and size calculation of the minimal Hamming spheres. A new combination of the Hamming and Plotkin bounds for constrained spaces is obtained.4141138114

Line Codes For Photonically Amplified Digital Links

In noise-limited optical links with cascaded amplifiers, we show that coding gains can be obtained from sparse codes, but will be limited by dispersion. Dispersion limitations are determined by a complex combination of intersymbol interference and laser nonlinearities, so that determination of the worst-case patterns requires computation of laser dynamics. Rates for line codes that eliminate these patterns are shown to be strongly dependent on which patterns one wishes to eliminate. Under the best codes, performance of the system is limited by a combination of noise and dispersion, and performance evaluation will then demand new computational tools.828

SLA-Aware Survivability

Abstract — The paper discusses the provision of differentiated guarantees to a population of users who share a network with different requirements for their connections. The basic concept underlying the proposed solutions is the required availability of the connections, both in the long term and during the period covered by the Service Level Agreement. An adequate metric for the latter is provided by the interval availability. The paper discusses how Markov chains may be used to model interval availability during the SLA period. Index Terms—optical networks, availability, survivability, protection, restoratio

Capacity partitioning in the defragmented elastic single link

The paper discusses blocking and throughput analytical models for a single link under dynamic multi-class traffic, assuming defragmentation is used to mitigate fragmentation losses. The models are shown to generate reversible Markov chains that impart scalability to the performance analysis, including under any truncation of the chain that preserves the transition rates between all surviving states. The notion of link capacity pseudo-partitioning is then introduced, showing that it may be used to provide fairness between two classes in an adaptive, softwarizable fashionCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO - CNPQFUNDAÇÃO DE AMPARO À PESQUISA DO ESTADO DE SÃO PAULO - FAPESP304171/2017-42015/24341-721st International conference on transparent optical networks (ICTON

Feedforward Carrier Recovery For Polarization Demultiplexed Signals With Unequal Signal To Noise Ratios.

We investigate feedforward carrier recovery (FFCR) in coherent polarization diversity receivers where the signal to noise ratio (SNR) of polarization demultiplexed signals can be unequal, such as in polarization-dependent loss impaired systems. A joint-polarization FFCR mechanism for estimating the carrier phase noise based on samples from both polarizations is proposed and compared with three other plausible alternatives. We evaluated each architecture using Monte Carlo simulations and observed that the joint-polarization FFCR yields a 1.1 dB SNR penalty for a given laser linewidth x baud rate product, while the other three architectures offer 1.8 dB, 2.0 dB and 3.9 dB, for QPSK at BER = 10(-3) and 3 dB SNR imbalance.177958-6

A New Analytical Approach for the Estimation of Blocking Probabilities in Wavelength Routing Networks

The paper introduces a new analytical approach for estimating blocking probabilities in all-optical networks. The assumptions of the classical Lee approximation are discussed and their effects are evaluated. The paper proposes a better substitute for the independent link assumption. The new assumption takes all active paths, as well as all free links, as independent objects on the network topology. The new model is shown to generate estimates that fit exactly the blocking probabilities obtained through simulations on linear topologies using Poissonian, spatially homogeneous traffic. A extension to regular meshes is presented that is asymptotically good for very small and very large nodal degrees. Finally, the independent wavelength assumption is also evaluated for two different wavelength assignment algorithms