Generating Representative ISP Technologies From First-Principles

Understanding and modeling the factors that underlie the growth and evolution of network topologies are basic questions that impact capacity planning, forecasting, and protocol research. Early topology generation work focused on generating network-wide connectivity maps, either at the AS-level or the router-level, typically with an eye towards reproducing abstract properties of observed topologies. But recently, advocates of an alternative "first-principles" approach question the feasibility of realizing representative topologies with simple generative models that do not explicitly incorporate real-world constraints, such as the relative costs of router configurations, into the model. Our work synthesizes these two lines by designing a topology generation mechanism that incorporates first-principles constraints. Our goal is more modest than that of constructing an Internet-wide topology: we aim to generate representative topologies for single ISPs. However, our methods also go well beyond previous work, as we annotate these topologies with representative capacity and latency information. Taking only demand for network services over a given region as input, we propose a natural cost model for building and interconnecting PoPs and formulate the resulting optimization problem faced by an ISP. We devise hill-climbing heuristics for this problem and demonstrate that the solutions we obtain are quantitatively similar to those in measured router-level ISP topologies, with respect to both topological properties and fault-tolerance

Algorithms for Constructing Overlay Networks For Live Streaming

We present a polynomial time approximation algorithm for constructing an overlay multicast network for streaming live media events over the Internet. The class of overlay networks constructed by our algorithm include networks used by Akamai Technologies to deliver live media events to a global audience with high fidelity. We construct networks consisting of three stages of nodes. The nodes in the first stage are the entry points that act as sources for the live streams. Each source forwards each of its streams to one or more nodes in the second stage that are called reflectors. A reflector can split an incoming stream into multiple identical outgoing streams, which are then sent on to nodes in the third and final stage that act as sinks and are located in edge networks near end-users. As the packets in a stream travel from one stage to the next, some of them may be lost. A sink combines the packets from multiple instances of the same stream (by reordering packets and discarding duplicates) to form a single instance of the stream with minimal loss. Our primary contribution is an algorithm that constructs an overlay network that provably satisfies capacity and reliability constraints to within a constant factor of optimal, and minimizes cost to within a logarithmic factor of optimal. Further in the common case where only the transmission costs are minimized, we show that our algorithm produces a solution that has cost within a factor of 2 of optimal. We also implement our algorithm and evaluate it on realistic traces derived from Akamai's live streaming network. Our empirical results show that our algorithm can be used to efficiently construct large-scale overlay networks in practice with near-optimal cost

Optimization and resilience of complex supply-demand networks

Acknowledgments This work was supported by NSF under Grant No. 1441352. SPZ and ZGH were supported by NSF of China under Grants No. 11135001 and No. 11275003. ZGH thanks Prof Liang Huang and Xin-Jian Xu for helpful discussions.Peer reviewedPublisher PD

Sensor Deployment for Network-like Environments

This paper considers the problem of optimally deploying omnidirectional sensors, with potentially limited sensing radius, in a network-like environment. This model provides a compact and effective description of complex environments as well as a proper representation of road or river networks. We present a two-step procedure based on a discrete-time gradient ascent algorithm to find a local optimum for this problem. The first step performs a coarse optimization where sensors are allowed to move in the plane, to vary their sensing radius and to make use of a reduced model of the environment called collapsed network. It is made up of a finite discrete set of points, barycenters, produced by collapsing network edges. Sensors can be also clustered to reduce the complexity of this phase. The sensors' positions found in the first step are then projected on the network and used in the second finer optimization, where sensors are constrained to move only on the network. The second step can be performed on-line, in a distributed fashion, by sensors moving in the real environment, and can make use of the full network as well as of the collapsed one. The adoption of a less constrained initial optimization has the merit of reducing the negative impact of the presence of a large number of local optima. The effectiveness of the presented procedure is illustrated by a simulated deployment problem in an airport environment

Regulatory Approaches to NGNs: An International Comparison

The emergence of Next Generation Networks (NGNs) raises profound challenges for regulators everywhere. Different regulatory authorities have approached these problems in strikingly different ways, depending in part on the overall regulatory milieu in which they operate, and in part on the nature of the NGN migration envisioned by major market players. Also, the NGN core network raises significantly different issues from those of the NGN access network. The migration to NGN raises many of the same issues that were already on the table as a result of the broader migration to IP-based services, notably in regard to the de-coupling of the service from the underlying network. To these concerns are added profound questions related to the nature of market power. Will NGNs enable new forms of competition? Will competitive bottlenecks remain, especially in the last mile? Will NGN enable new forms of bottlenecks to emerge, especially in the upper layers of the network, perhaps as a result of new IMS capabilities? Regulators in the UK, Netherlands, Germany, Japan and the United States have been forced to deal with these issues due to relatively rapid migration to NGNs proposed by their respective incumbent telecoms operators. Many of the same issues are also visible in the recommendations that the European Commission finalised on 13 November 2007 as part of the ongoing review of the European regulatory framework for electronic communications. In this paper, we compare and contrast the many regulatory proceedings that have been produced by these regulatory authorities.Regulation; Next Generation Networks; access network; core network; all-IP; competition; market power; international comparison