Intra-backbone and Inter-backbone Peering Among Internet Service Providers

We consider a model with two backbones and a finite number of Internet Service Providers (ISPs) connected to the backbones. ISPs decide on private peering agreements, comparing the benefits of private peering to costs. Intra-backbone peering refers to peering between ISPs connected to the same backbone, whereas inter-backbone peering refers to peering between ISPs connected to different backbones. We formulate the model as a two-stage game. In the first stage, ISPs decide on peering agreements. In the second stage they compete in prices a la Bertrand. We examine the effects of peering on profits of ISPs. Peering affects profits through two channels - reduction of backbone congestion which we call the symmetric effect and ability to send traffic bypassing or circumventing congested backbones which we call the asymmetric effect. The first has a negative or ambiguous effect while the second has a generally positive effect on firm profits. The two often act against each other making the net effect ambiguous. We also conduct simulations to determine pairwise stable peering configurations in a six-provider model and find that there is a paucity of inter-backbone peering in asymmetric settings.Peering, Networks

EPR Study of Spin Labeled Brush Polymers in Organic Solvents

Spin-labeled polylactide brush polymers were synthesized via ring-opening metathesis polymerization (ROMP), and nitroxide radicals were incorporated at three different locations of brush polymers: the end and the middle of the backbone, and the end of the side chains (periphery). Electron paramagnetic resonance (EPR) was used to quantitatively probe the macromolecular structure of brush polymers in dilute solutions. The peripheral spin-labels showed significantly higher mobility than the backbone labels, and in dimethylsulfoxide (DMSO), the backbone end labels were shown to be more mobile than the middle labels. Reduction of the nitroxide labels by a polymeric reductant revealed location-dependent reactivity of the nitroxide labels: peripheral nitroxides were much more reactive than the backbone nitroxides. In contrast, almost no difference was observed when a small molecule reductant was used. These results reveal that the dense side chains of brush polymers significantly reduce the interaction of the backbone region with external macromolecules, but allow free diffusion of small molecules

Multifractal behavior of linear polymers in disordered media

The scaling behavior of linear polymers in disordered media modelled by self-avoiding random walks (SAWs) on the backbone of two- and three-dimensional percolation clusters at their critical concentrations p_c is studied. All possible SAW configurations of N steps on a single backbone configuration are enumerated exactly. We find that the moments of order q of the total number of SAWs obtained by averaging over many backbone configurations display multifractal behavior, i.e. different moments are dominated by different subsets of the backbone. This leads to generalized coordination numbers \mu_q and enhancement exponents \gamma_q, which depend on q. Our numerical results suggest that the relation \mu_1 = p_ c \mu between the first moment \mu_1 and its regular lattice counterpart \mu is valid.Comment: 11 pages, 12 postscript figures, to be published in Phys. Rev.

Stressed backbone and elasticity of random central-force systems

We use a new algorithm to find the stress-carrying backbone of ``generic'' site-diluted triangular lattices of up to 10^6 sites. Generic lattices can be made by randomly displacing the sites of a regular lattice. The percolation threshold is Pc=0.6975 +/- 0.0003, the correlation length exponent \nu =1.16 +/- 0.03 and the fractal dimension of the backbone Db=1.78 +/- 0.02. The number of ``critical bonds'' (if you remove them rigidity is lost) on the backbone scales as L^{x}, with x=0.85 +/- 0.05. The Young's modulus is also calculated.Comment: 5 pages, 5 figures, uses epsfi

Many-to-One Boundary Labeling with Backbones

In this paper we study \emph{many-to-one boundary labeling with backbone leaders}. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-enclosing rectangle. Feature points that need to be connected to this label are linked via vertical line segments to the backbone. We present dynamic programming algorithms for label number and total leader length minimization of crossing-free backbone labelings. When crossings are allowed, we aim to obtain solutions with the minimum number of crossings. This can be achieved efficiently in the case of fixed label order, however, in the case of flexible label order we show that minimizing the number of leader crossings is NP-hard.Comment: 23 pages, 10 figures, this is the full version of a paper that is about to appear in GD'1

Reducing Power Consumption in Backbone Networks

Abstract—According to several studies, the power consumption of the Internet accounts for up to 10 % of the worldwide energy consumption, and several initiatives are being put into place to reduce the power consumption of the ICT sector in general. To this goal, we propose a novel approach to switch off network nodes and links while still guaranteeing full connectivity and maximum link utilization. After showing that the problem falls in the class of capacitated multi-commodity flow problems, and therefore it is NP-complete, we propose some heuristic algorithms to solve it. Simulation results in a realistic scenario show that it is possible to reduce the number of links and nodes currently used by up to 30 % and 50 % respectively during off-peak hours, while offering the same service quality