NDLI: Scalable VPN routing via relaying

Please wait, while we are loading the content...

Performance of random medium access control, an asymptotic approach

Network externalities and the deployment of security features and protocols in the internet

Hierarchical routing over dynamic wireless networks

Confident estimation for multistage measurement sampling and aggregation

On the design of hybrid peer-to-peer systems

Path-quality monitoring in the presence of adversaries

HMTT: a platform independent full-system memory trace monitoring system

Xengine: a fast and scalable XACML policy evaluation engine

Analysis of bittorrent-like protocols for on-demand stored media streaming

Software thermal management of dram memory for multicore systems

Fully decentralized emulation of best-effort and processor sharing queues

Relative competitiveness of cache replacement policies

Performance analysis in the real world

Bound analysis of closed queueing networks with workload burstiness

The delay-friendliness of TCP

Loss-aware network coding for unicast wireless sessions: design, implementation, and performance evaluation

Counter braids: a novel counter architecture for per-flow measurement

Utility maximization in peer-to-peer systems

Densification arising from sampling fixed graphs

Disk scrubbing versus intra-disk redundancy for high-reliability raid storage systems

DARC: dynamic analysis of root causes of latency distributions

Performance bounds for peer-assisted live streaming

Noncooperative power control and transmission scheduling in wireless collision channels

Optimal delay scheduling in networks with arbitrary constraints

Network distance estimation with dynamic landmark triangles

Scheduling despite inexact job-size information

Scalable VPN routing via relaying

Exploiting manufacturing variations for compensating environment-induced clock drift in time synchronization

Tracking in a spaghetti bowl: monitoring transactions using footprints

A queueing system for modeling a file sharing principle

In search of the elusive ground truth: the internet's as-level connectivity structure

Ironmodel: robust performance models in the wild

QDSL: a queuing model for systems with differential service levels

Epidemic live streaming: optimal performance trade-offs

Software-directed combined cpu/link voltage scaling fornoc-based cmps

Revisiting stochastic loss networks: structures and algorithms

Class-of-service in ip backbones: informing the network neutrality debate

Optimal sampling in state space models with applications to network monitoring

Interaction-aware energy management for wireless network cards

Traffic capacity of multi-cell WLANS

Predicting the resource consumption of network intrusion detection systems

Efficient mart-aided modeling for microarchitecture design space exploration and performance prediction

Combined intra- and inter-domain traffic engineering using hot-potato aware link weights optimization

Modeling directionality in wireless networks: extended abstract

Layered interval codes for tcam-based classification

Durability of replicated distributed storage systems

Implementation and evaluation of a migration-based NUCA design for chip multiprocessors

M/G/1 queue with repeated inhomogeneous vacations applied to ieee 802.16e power saving

Managing inter-domain traffic in the presence of bittorrent file-sharing

Clock offset estimation using collaborative one-way transit time

Scheduling with queue length guarantees for shared resource systems

Estimating cardinality distributions in network traffic: extended abstract

Weighted fair sharing for dynamic virtual clusters

Exploring the throughput-fairness tradeoff of deadline scheduling in heterogeneous computing environments

Characterizing multiparty voice communication for multiplayer games

Algorithmic approaches to redesigning tcam-based systems

Scalable VPN routing via relaying

Content Provider	ACM Digital Library
Author	Kim, Changhoon Sen, Subhabrata Lund, Carsten Pei, Dan Gerber, Alexandre
Abstract	Enterprise customers are increasingly adopting MPLS (Multiprotocol Label Switching) VPN (Virtual Private Network) service that offers direct any-to-any reachability among the customer sites via a provider network. Unfortunately this direct reachability model makes the service provider's routing tables grow very large as the number of VPNs and the number of routes per customer increase. As a result, router memory in the provider's network has become a key bottleneck in provisioning new customers. This paper proposes Relaying, a scalable VPN routing architecture that the provider can implement simply by modifying the configuration of routers in the provider network, without requiring changes to the router hardware and software. Relaying substantially reduces the memory footprint of VPNs by choosing a small number of hub routers in each VPN that maintain full reachability information, and by allowing non-hub routers to reach other routers through a hub. Deploying Relaying in practice, however, poses a challenging optimization problem that involves minimizing router memory usage by having as few hubs as possible, while limiting the additional latency due to indirect delivery via a hub. We first investigate the fundamental tension between the two objectives and then develop algorithms to solve the optimization problem by leveraging some unique properties of VPNs, such as sparsity of traffic matrices and spatial locality of customer sites. Extensive evaluations using real traffic matrices, routing configurations, and VPN topologies demonstrate that Relaying is very promising and can reduce routing-table usage by up to 90%, while increasing the additional distances traversed by traffic by only a few hundred miles, and the backbone bandwidth usage by less than 10%.
Starting Page	61
Ending Page	72
Page Count	12
File Format	PDF
ISBN	9781605580050
DOI	10.1145/1375457.1375465
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2008-06-02
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Measurement Vpn Routing Optimization
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in