Private Peering Among Internet Backbone Providers

We develop a model, in which Internet backbone providers decide on private peering agreements, comparing the benefits of private peering relative to being connected only through National Access Points. Backbone providers compete by setting capacities for their networks, capacities on the private peering links, if they choose to peer privately, and access prices. The model is formulated as a multistage game. We examine the model from two alternative modelling perspectives - a purely non-cooperative game, where we solve for Subgame Perfect Nash Equilibria through backward induction, and a network theoretic perspective, where we examine pairwise stable and efficient networks. While there are a large number of Subgame Perfect Nash Equilibria, both the pairwise stable and the efficient network are unique and the stable network is not efficient and vice versa. The stable network is the complete network, where all the backbone providers choose to peer with each other, while the efficient network is the one, where the backbone providers are connected to each other only through the National Access Points.Subgame perfect Nash equilibrium, networks, pairwise stability, efficiency

Private Peering Among Internet Backbone Providers

We develop a model, in which Internet backbone providers decide on private peering agreements, comparing the benefits of private peering relative to being connected only through National Access Points. Backbone providers compete by setting capacities for their networks, capacities on the private peering links, if they choose to peer privately, and access prices. The model is formulated as a multistage game. We examine the model from two alternative modelling perspectives - a purely non-cooperative game, where we solve for Subgame Perfect Nash Equilibria through backward induction, and a network theoretic perspective, where we examine pairwise stable and efficient networks. While there are a large number of Subgame Perfect Nash Equilibria, both the pairwise stable and the efficient network are unique and the stable network is not efficient and vice versa. The stable network is the complete network, where all the backbone providers choose to peer with each other, while the efficient network is the one, where the backbone providers are connected to each other only through the National Access Points.Subgame perfect Nash equilibrium, networks, pairwise stability, efficiency

A Methodology for Assessing Eco-efficiency in Logistics Networks

Recent literature on sustainable logistics networks points to two important questions: (i) How to spot the preferred solution(s) balancing environmental and business concerns? (ii) How to improve the understanding of the trade-offs between these two dimensions? We posit that a complete exploration of the efficient frontier and trade-offs between profitability and environmental impacts are particularly suitable to answer these two questions. In order to deal with the exponential number of basic efficient points in the frontier, we propose a formulation that performs in exponential time for the number of objective functions only. We illustrate our findings by designing a complex recycling logistics network in Germany.Eco-efficiency;Environmental impacts;Profitability;Recycling logistics network

Quantum Entanglement Percolation

Quantum communication demands efficient distribution of quantum entanglement across a network of connected partners. The search for efficient strategies for the entanglement distribution may be based on percolation theory, which describes evolution of network connectivity with respect to some network parameters. In this framework, the probability to establish perfect entanglement between two remote partners decays exponentially with the distance between them before the percolation transition point, which unambiguously defines percolation properties of any classical network or lattice. Here we introduce quantum networks created with local operations and classical communication, which exhibit non-classical percolation transition points leading to the striking communication advantages over those offered by the corresponding classical networks. We show, in particular, how to establish perfect entanglement between any two nodes in the simplest possible network -- the 1D chain -- using imperfect entangled pairs of qubits.Comment: 5 pages, 2 figure

Connectivity-Based Self-Localization in WSNs

Efficient localization methods are among the major challenges in wireless sensor networks today. In this paper, we present our so-called connectivity based approach i.e, based on local connectivity information, to tackle this problem. At first the method fragments the network into larger groups labeled as packs. Based on the mutual connectivity relations with their surrounding packs, we identify border nodes as well as the central node. As this first approach requires some a-priori knowledge on the network topology, we also present a novel segment-based fragmentation method to estimate the central pack of the network as well as detecting so-called corner packs without any a-priori knowledge. Based on these detected points, the network is fragmented into a set of even larger elements, so-called segments built on top of the packs, supporting even more localization information as they all reach the central node