We will review some of the major results in random graphs and some of the more challenging open problems. We will cover algorithmic and structural questions. We will touch on newer models, including those related to the WWW.

Random graphs

An apparatus for multi-bitrate content streaming includes a receiving module configured to capture media content, a streamlet module configured to segment the media content and generate a plurality of streamlets, and an encoding module configured to generate a set of streamlets. The system includes the apparatus, wherein the set of streamlets comprises a plurality of streamlets having identical time indices and durations, and each streamlet of the set of streamlets having a unique bitrate, and wherein the encoding module comprises a master module configured to assign an encoding job to one of a plurality of host computing modules in response to an encoding job completion bid. A method includes receiving media content, segmenting the media content and generating a plurality of streamlets, and generating a set of streamlets.

Apparatus, system, and method for multi-bitrate content streaming

The mobile social network (MSN) combines techniques in social science and wireless communications for mobile networking The MSN can be considered as a system which provides a variety of data delivery services involving the social relationship among mobile users This paper presents a comprehensive survey on the MSN specifically from the perspectives of applications, network architectures, and protocol design issues First, major applications of the MSN are reviewed Next, different architectures of the MSN are presented Each of these different architectures supports different data delivery scenarios The unique characteristics of social relationship in MSN give rise to different protocol design issues These research issues (eg, community detection, mobility, content distribution, content sharing protocols, and privacy) and the related approaches to address data delivery in the MSN are described At the end, several important research directions are outlined

Applications, Architectures, and Protocol Design Issues for Mobile Social Networks: A Survey

Running multiple virtual networks, customized for different performance objectives, is a promising way to support diverse applications over a shared substrate. Despite being simple, a static division of resources between virtual networks can be highly inefficient, while dynamic resource allocation runs the risk of instability. This paper uses optimization theory to show that adaptive resource allocation can be stable and can maximize the aggregate performance across the virtual networks. In the DaVinci architecture, each substrate link periodically reassigns bandwidth shares between its virtual links; while at a smaller timescale, each virtual network runs a distributed protocol that maximizes its own performance objective independently. Numerical experiments with a mix of delay-sensitive and throughput-sensitive traffic show that the bandwidth shares converge quickly to the optimal values. We demonstrate that running several custom protocols in parallel and allocating resource adaptively can be more efficient, more flexible, and easier to manage than a compromise "one-size-fits-all" design.

/pdf/davinci-dynamically-adaptive-virtual-networks-for-a-4fqkvuvlc0.pdf

DaVinci: dynamically adaptive virtual networks for a customized internet

Embodiments related to the manipulation of lists via a multi-touch display are disclosed. One disclosed embodiment comprises a computing device having a touch-sensitive display, a processor, and memory. The memory comprises code executable by the processor to display a scrollable list of items on the touch-sensitive display, to detect a first touch gesture over the scrollable list of items on the touch-sensitive display, and, in response, to scroll the scrollable list of items on the touch-sensitive display. The memory further comprises code executable by the processor to detect a second, multi-touch gesture over the scrollable list of items on the touch-sensitive display, and in response to adjust a displayed range of the scrollable list of items.

Manipulation of list on a multi-touch display

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges, especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options can be activated while waiting for an update from the centralized server after the failure of an individual component (link or node). We provide analytical insight into the feasibility of such backups as a function of network structure and quantify their computational complexity. We also develop an efficient heuristic reconciling protectability and performance, and demonstrate its effectiveness in a broad range of scenarios. The results should facilitate deployments of centralized routing solutions.

/pdf/on-the-feasibility-and-efficacy-of-protection-routing-in-ip-16jmhux09s.pdf

On the feasibility and efficacy of protection routing in IP networks

In this paper, we propose a simple protocol for building heterogeneous unstructured peer-to-peer (P2P) networks. The protocol consists of two parts--the joining process and the rebuilding process. The basic idea for the joining process is to use a random walk to assist new incoming peers in selecting their suitable neighbors in terms of capacity and connectivity to achieve load-balancing. The rebuilding process specifies how the nodes should react when they lose links. In particular, we examine two representative schemes, namely the probabilistic-rebuilding scheme and the adaptive-rebuilding scheme. Furthermore, we provide a detailed analysis to investigate our proposed protocol under any heterogenous P2P environment. We prove that the topology structure of the P2P network depends heavily on the node heterogeneity. The analytical results are validated by the simulations. Our framework provides a guideline to engineer and optimize a P2P network in different respects under a heterogeneous environment. The ultimate goal of this paper is to stimulate further research to explore the fundamental issues in heterogeneous P2P networks.

Building heterogeneous peer-to-peer networks: protocol and analysis

An efficient media streaming method utilizing a globally load balanced overlay network. This method makes use of capacity per out-degree values to construct and maintain an overlay network for media streaming in a Peer-to-Peer environment.

/pdf/intelligent-peer-to-peer-media-streaming-3vx23x4buh.pdf

Intelligent Peer-to-Peer Media Streaming

Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV), which can be combined with any distributed routing algorithm to guarantee that the directed graph induced by the routing decisions remains acyclic at all times. The key contribution of DIV, besides its ability to operate with any routing algorithm, is an update mechanism using simple message exchanges between neighboring nodes that guarantees loop-freedom at all times. DIV provably outperforms existing loop-prevention algorithms in several key metrics such as frequency of synchronous updates and the ability to maintain paths during transitions. Simulation results quantifying these gains in the context of shortest path routing are presented. In addition, DIV's universal applicability is illustrated by studying its use with a routing that operates according to a nonshortest path objective. Specifically, the routing seeks robustness against failures by maximizing the number of next-hops available at each node for each destination.

/pdf/always-acyclic-distributed-path-computation-1rdwvidpx5.pdf

Always acyclic distributed path computation

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options can be activated, while waiting for an update from the centralized server after the failure of an individual component (link or node). We provide analytical insight into the feasibility of such backups as a function of network structure, and quantify their computational complexity. We also develop an efficient heuristic reconciling protectability and performance, and demonstrate its effectiveness in a broad range of scenarios. The results should facilitate deployments of centralized routing solutions.

/pdf/on-the-feasibility-and-efficacy-of-protection-routing-in-ip-56nfhuc13h.pdf

Kin-Wah Kwong

Papers

On the feasibility and efficacy of protection routing in IP networks

Building heterogeneous peer-to-peer networks: protocol and analysis

Intelligent Peer-to-Peer Media Streaming

Always acyclic distributed path computation

On the Feasibility and Efficacy of Protection Routing in IP Networks