NETWORKING 2012
11th International IFIP TC 6 Networking Conference, Prague, Czech Republic, May 21-25, 2012, Proceedings, Part I
Published on 16. May 2012
XXII, 437 pages
978-3-642-30045-5 (ISBN)
Description
The two-volume set LNCS 7289 and 7290 constitutes the refereed proceedings of the 11th International IFIP TC 6 Networking Conference held in Prague, Czech Republic, in May 2012. The 64 revised full papers presented were carefully reviewed and selected from a total of 225 submissions. The papers feature innovative research in the areas of network architecture, applications and services, next generation Internet, wireless and sensor networks, and network science. The first volume includes 32 papers and is organized in topical sections on content-centric networking, social networks, reliability and resilience, virtualization and cloud services, IP routing, network measurement, network mapping, and LISP and multi-domain routing.
More details
Other editions
Additional editions
Robert Bestak | Lukas Kencl | Li Erran Li
NETWORKING 2012
11th International IFIP TC 6 Networking Conference, Prague, Czech Republic, May 21-25, 2012, Proceedings, Part I
Book
05/2012
1st Edition
Springer
€53.49
Shipment within 7-9 days
Content
- Title Page
- Preface
- Organization
- Table of Contents
- Content-Centric Networking
- Efficient User-Assisted Content Distribution over Information-Centric Network
- Introduction
- Contribution-Aware ICN
- P2P Content Distribution in ICN
- Approach
- Implementation of Contribution-Aware ICN
- Contribution-Aware Content Distribution
- Evaluation
- Effect of User Participation
- Effect of RCL
- Conclusion
- References
- On Inter-Domain Name Resolution for Information-Centric Networks
- Introduction
- Name-Resolution in ICN
- Related Work
- An Enhanced DHT-Based NRS
- Performance Evaluation
- Conclusions
- References
- Cache "Less for More" in Information-Centric Networks
- Introduction
- Caching in ICN
- Model Description and Problem Statement
- Related Work and Motivation
- A Centrality-Based Caching Scheme
- Basic Algorithm
- Approximation via Distributed Computation
- Performance Evaluation
- Performance Metrics and Simulation Scenarios
- Experiments with k-ary Trees
- Experiments with Scale-Free Topologies
- Experiments with the Real Internet Topologies
- Summary and Conclusions
- References
- Collaborative Forwarding and Caching in Content Centric Networks
- Introduction
- Related Work
- Network Model
- Ranking-Based Collaborative Forwarding and Caching
- Overview
- Collaborative Forwarding and Caching Mechanism
- Dealing with Inconsistent Popularity Ranking
- Adaptive Content Store Division
- Evaluations
- Simulation Setup
- Impacts of Number of Contents
- Impact of Adaptive Cache Division
- Impact of Popularity Inconsistency
- Conclusion
- References
- Social Networks
- Crawling and Detecting Community Structure in Online Social Networks Using Local Information
- Introduction
- Related Work
- Crawling and Detecting Communities
- Community Crawling
- Community Detection
- Verification and Performance Evaluation
- Conclusion and Outlook
- References
- Distributed Content Backup and Sharing Using Social Information
- Introduction and Motivation
- Model Description
- Distributed Heuristics
- The Greedy Placement Algorithm
- The Replacement Algorithm
- Evaluating Optimal Model and Distributed Heuristics
- Optimization, Heuristics and Variants Thereof
- Performance Evaluation
- Conclusions
- References
- Trans-Social Networks for Distribut ed Processing
- Introduction
- Related Work
- Architecture
- Implemention Details
- Evaluation
- Conclusion
- References
- Context-Sensitive Sentiment Classification of Short Colloquial Text
- Introduction
- Related Work
- Methodology, Test Corpus and Performance Evaluation
- Sentiment Classification and Polarity Estimation
- Grammatical Sentiment Classification
- Automatic Polarity Estimation
- Detecting Networks of Concepts
- Conclusion
- References
- Reliability and Resilience
- Resilience in Computer Network Management
- Introduction
- Related Works
- Proposed Method
- Resilience Factor
- Results
- Conclusions
- References
- An Experimental Study on the Impact of Network Segmentation to the Resilience of Physical Processes
- Introduction
- Related Work
- Problem Statement and Attack Scenario
- Process Control Architecture Overview
- Control Network Segmentation
- Adversary Model and Attack Scenario
- Experimental Setting and Results
- Overview of the Experimentation Framework
- Tennessee-Eastman Chemical Process
- Experiment Setup
- Experimental Results
- Concluding Remarks
- References
- On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks
- Introduction
- Sophisticated Attacks on Multiple Hash Tables
- Peacock Hashing
- Insertion Algorithm
- Post-Attack Damage: Attack on Peacock Hashing
- Post-Attack Damage: Vulnerability of Peacock Hashing
- Resilience to In-Attack Damage (and Improving Performance Using Bitmaps)
- Cuckoo Hashing
- Algorithm Description
- In-Attack Damage: Attack on Cuckoo Hashing
- In-Attack Damage: Vulnerability of Cuckoo Hashing
- Resilience to Post-Attack Damage
- Summary
- References
- Appendix
- Degree and Principal Eigenvectors in Complex Networks
- Introduction
- The Decrease of the Spectral Radius
- Relation between the Principal Eigenvector and the Degree Vector
- Properties of the Principal Eigenvector
- Relation between Degree Vector and Principal Eigenvector
- Correlation between the Principal Eigenvector and the Degree Vector
- Application: Degree vs. Principal Eigenvector Strategy in Minimizing the Spectral Radius
- Conclusions
- References
- Virtualization and Cloud Services
- Resilient Virtual Network Design for End-to-End Cloud Services
- Introduction
- Related Work
- Resilient Virtual Network Design
- Simple Model without Resilience
- VNO-Resilience
- PIP-Resilience
- Performance Evaluation of the Resilient Virtual Network Design Options
- Enhanced Datacenter Connection Models
- VNO-Resilience
- PIP-Resilience
- Delay Performance Evaluation of the End-to-End System
- Conclusion
- References
- Dynamic Scaling of Call-Stateful SIP Services in the Cloud
- Introduction
- Background and Related Work
- SIP Session Migration
- Architectural Overview
- Migration Protocols
- Experiments and Evaluation
- Call Load Forecasting
- Forecasting Algorithms
- Safety Margin
- Evaluation
- Conclusion and Future Work
- References
- Remedy: Network-Aware Steady State VM Management for Data Centers
- Introduction
- Online Minimum Cost Network Utilization Using VM Migration
- Architecture and Design
- Bandwidth Monitor
- VM and Target Host Selector
- VM Memory Monitor
- Experimental Evaluation
- Validating Remedy in an OpenFlow Network
- Validating the Effectiveness of VM and Target Selector Heuristics at Scale through Simulations
- Background and Related Work
- Network-Aware Placement of VMs
- Cost-Aware Migration of VMs and Prediction of Migration Performance
- Conclusion
- References
- Building a Flexible and Scalable Virtual Hardware Data Plane
- Introduction
- Related Work
- Hardware Design
- Data Plane Design and Implementation
- Design Overview
- Process Stages
- Resource Isolation
- Reference Software Architecture
- Evaluation
- Conclusion
- References
- IP Routing
- Permutation Routing for Increased Robustness in IP Networks
- Introduction
- Next-Hop Optimal Routing
- Permutation Routing
- Generating Routing Permutations
- Next-Hop Optimal Routings
- Approximate NHOR (ANHOR)
- Approximate NHOR-SP (ANHOR-SP)
- Performance Evaluation
- Evaluation Setup
- Robustness Evaluation
- Related Work
- Conclusion
- References
- Routing On Demand: Toward the Energy-Aware Traffic Engineering with OSPF
- Introduction
- Overview of the Basic Idea
- ROD Model
- Network Model
- Universal Existence of Optimal Link Weights
- Optimal Link Weights for Various Cost Functions
- Implementation Issues
- Collecting and Disseminating Information for ROD
- Data Forwarding under ROD
- Evaluation
- Experimental Setup
- Performance versus Energy Saving
- Link Utilization
- Packet Delay
- Related Work
- Conclusion
- References
- Minimization of Network Power Consumption with Redundancy Elimination
- Introduction
- Related Works
- Reduction of Energy Consumption
- Reduction of Traffic Load
- Energy-Aware Routing with RE
- Optimal Solution - Integer Linear Program (ILP)
- Heuristic Solution
- Experiments and Simulation Results
- Energy Consumption with WOC
- Simulation Results with GreenRE
- Discussion
- Conclusion
- References
- Sign What You Really Care about - Secure BGP AS Paths Efficiently
- Introduction
- Backgrounds
- BGP and S-BGP
- Related Works
- Key Observations
- Dilemma of S-BGP.
- FS-BGP: Fast Secure BGP
- Overview
- Path Authentication in FS-BGP
- Forged Paths in FS-BGP
- Prevent Effective Hijacking
- Security Level
- Performance Evaluation
- Methodology
- Signing CSA
- Verifying CSA
- Discussions
- Conclusion and Future Works
- References
- Network Measurement
- Estimating Network Layer Subnet Characteristics via Statistical Sampling
- Introduction
- Subnet Sampling
- Subnet Inference with ExploreNET
- Challenges in Subnet Sampling
- Estimating Subnet Characteristics
- Important Subnet Characteristics
- Evaluations
- Subnet Population Size (N)
- Total Subnets with Prefix Length /p (p)
- Mean Subnet Degree (d)
- IP Address Space Utilization (U)
- Related Work
- Conclusions
- References
- Sparsity without the Complexity: Loss Localisation Using Tree Measurements
- Introduction
- Related Work
- The Tree Hotspot Problem and Solution
- System Solution
- Regularizing the Solution Using Sparsity
- Local Regularisation
- Global Regularisation
- A Sufficiency Condition for Non-uniqueness in Graphs
- The Noisy Problem
- Comparisons with CS Algorithms
- Experiments
- Conclusion
- References
- Efficient and Secure Decentralized Network Size Estimation
- Introduction
- Related Work
- Network Size Estimation for Structured Overlays
- Network Size Estimation for Unstructured Overlays
- Our Approach
- Generating a Random ``Key''
- Starting the Flood
- Processing the Flood
- Joining the Network
- Proof of Work
- Security Analysis
- Experimental Results
- Conclusion
- References
- A Panoramic View of 3G Data/Control-Plane Traffic: Mobile Device Perspective
- Introduction
- Related Work
- Datasets and Preprocessing
- Datasets
- Correlating Datasets
- Limitations
- Measurement Results
- Overview
- Application Characteristics
- Active Devices
- Summary, Implications, and Conclusions
- References
- Network Mapping
- Towards a Robust Framework of Network Coordinate Systems
- Introduction
- Preliminaries
- Related Work
- Metric Space Embedding Models
- Matrix Factorization Models
- Issue of Data Noise
- Algorithm Design
- Huber Norm
- Robust Vivaldi
- Robust Matrix Factorization
- Discussion
- Experiments
- Overview of the Experiments
- Comparison on Prediction Accuracy
- The Choice of
- Convergence Analysis
- Conclusion and Future Works
- References
- BSense: A Flexible and Open-Source Broadband Mapping Framework
- Introduction
- Related Work
- BSense Broadband Mapping Framework
- Design and Implementation
- Broadband Quality Index
- Case Studies
- Broadband Coverage Analysis for Scotland
- Broadband Quality Measurement: A Pilot Study
- Conclusions
- References
- Validity of Router Responses for IP Aliases Resolution
- Introduction
- Related Work
- Network Scenario
- Analysis of Router Behaviors
- IPID-Based Router Behaviors
- Timestamp-Based Router Behaviors
- SourceIP-Based Router Behaviors
- Behaviors Applied to IP Aliases Resolution
- Conclusions
- References
- Semantic Exploration of DNS
- Introduction
- DNS Background
- Exploration of DNS
- System Overview
- SDBF
- Semantic Extension
- Similar Names
- Incremental Discovery
- Splitter
- Evaluation
- Methodology
- Main Metrics
- Exploration Parameters
- Gain Evaluation
- Strategy Evaluation
- Overhead
- Related Work
- Conclusion
- References
- LISP and Multi-domain Routing
- On the Dynamics of Locators in LISP
- Introduction
- LISP Background
- Methodology
- Building a LISP Mapping
- Delay Data Collection
- Impact of RLOC Selection
- Availability Issues
- Conclusion
- References
- A Local Approach to Fast Failure Recovery of LISP Ingress Tunnel Routers
- Introduction
- LISP Basics
- The ITR Failure Problem
- Local ITR Failure Protection
- ITR Failure Protection Evaluation
- ITR Recovery: Problem, Protection, and Evaluation
- Synchronization Set in Large-Scale Networks
- Synchronization Techniques
- Conclusion and Further Work
- References
- An Analytical Model for the LISP Cache Size
- Introduction
- LISP Overview
- LISP Cache Modeling
- Working-Set Theory
- Traffic Properties
- Analytical Model
- Evaluation
- Traces and IP Aggregation
- Simulator
- Results
- Related Work
- Conclusions
- References
- Path Computation in Multi-layer Multi-domain Networks
- Introduction
- Path Computation in Pseudo-Wire Networks
- Heterogeneous Multi-domain Network Model
- From the Network Model to a PDA
- The Shortest Feasible Path
- Minimizing the Number of Nodes
- Minimizing the Number of Adaptation Functions
- The Shortest Path as a Shortest Word
- Conclusion
- References
- Author Index
