Fig 5 - uploaded by Zhen Chen
Content may be subject to copyright.
Download
View publication
The IP mapping table and topology structure 

The IP mapping table and topology structure 

Source publication
Fig. 1. The Structure of KVM 
Fig. 2. The Structure of Open vSwitch 
Fig. 3. The model of CCN node 
Fig. 4. The structure of cluster (a simple case) 
+2 Fig. 5. The IP mapping table and topology structure 
Large-Scale Emulation for Content Centric Network
Conference Paper
Full-text available
  • Dec 2013
With the explosive growth in Internet Contents, Internet usage is shifting from host-to-host model to content dissemination model, like CDNs (content delivery networks) and CCN (content centric networking). Nowadays, CDNs have been widely deployed by ISPs (Internet service providers), content providers and other third parties, such as Akamai. And C...
Cite
Download full-text

Context in source publication

Context 1
... hope to do a one-button deployment for CCN nodes connections. For this purpose, we set own rules that the table recording the name and IP addresses as Fig. 5. ...

Similar publications

Figure 1. ODCM Architecture 
A Centralized Architecture for Energy-Efficient Job Management in Data Centers
Conference Paper
Full-text available
  • May 2014
In this work, we present a centralized monitoring entity that attempts to reduce power consumption in Internet Data Centers (IDCs) by employing live Virtual Machine (VM) migrations between blade servers. To perform live VM migrations, usage statistics collected by servers are evaluated and the servers that may be offloaded are selected. VMs that be...
View
FIGURE 1. Reference System. 
FIGURE 2. Sequence of event in each slot. 
FIGURE 3. Statistics of the job arrival process. 
FIGURE 4. Job arrival probability matrix. 
+4 FIGURE 5. Trace of the power generated by the wind in two days. 
Battery Management in a Green Fog-Computing Node: a Reinforcement-Learning Approach
Article
Full-text available
  • Sep 2017
In the last years, Internet is evolving towards the cloud-computing paradigm complemented by fog-computing in order to distribute computing, storage, control, networking resources and services close to end-user devices as much as possible, while sending heavy jobs to the remote cloud. When fog-computing nodes cannot be powered by the main electric...
View
Fig. 1: An example 3D reconstruction application. (a) is the mini...
Fig. 2: Apache Storm Architecture and Example Topology. The rightmost...
Fig. 6: Comparing the latency of LaTS, round-robin and resource-aware...
Fig. 8: Comparing the latency distribution of data parallel bolts with...
+1 Fig. 10: When a new stream arrives at the system, we follow this flow...
Hetero-Edge: Orchestration of Real-time Vision Applications on Heterogeneous Edge Clouds
Conference Paper
Full-text available
  • Feb 2019
Running computer vision algorithms on images or videos collected by mobile devices represent a new class of latency-sensitive applications that expect to benefit from edge cloud computing. These applications often demand real-time responses (e.g., <100ms), which can not be satisfied by traditional cloud computing. However, the edge cloud architectu...
View
Fig. 1. The SCC run-time combines ( i ) tailored scheduling for NFV...
Fig. 2. The SCC Profiler. lmbench measures the latencies to access each...
Fig. 3. Latencies to access a progressively increasing array size (1...
Figure 4: End-to-end (per packet) latency (µs) plotted on a logarithmic...
+2 Figure 5: End-to-end latency (µs), plotted on a logarithmic scale, (i)...
Profiling and accelerating commodity NFV service chains with SCC
Article
Full-text available
  • Feb 2017
Recent approaches to network functions virtualization (NFV) have shown that commodity network stacks and drivers struggle to keep up with increasing hardware speed. Despite this, popular cloud networking services still rely on commodity operating systems (OSs) and device drivers. Taking into account the hardware underlying of commodity servers, we...
View
Fig. 1. Transformation to flow network N with costs. The parameters...
Fig. 2. Runtime comparison for makespan minimization, for m = 4096 and...
Efficient minimization of sum and differential costs on machines with job placement constraints
Conference Paper
Full-text available
  • May 2017
We revisit the problem of assigning n jobs to m machines/servers. We study this problem under more general settings, which capture important aspects of applications that arise in networking and information systems. In particular, we consider jobs that have placement constraints and machines that are heterogeneous. The cost incurred at a machine is...
View