1 Latency Equalization: A Programmable Routing Service Primitive Minlan Yu Joint work with Marina Thottan, Li Li at Bell Labs.

Slides:

Advertisements

Similar presentations

Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.

Advertisements

LASTor: A Low-Latency AS-Aware Tor Client

1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.

1 Efficient and Robust Streaming Provisioning in VPNs Z. Morley Mao David Johnson Oliver Spatscheck Kobus van der Merwe Jia Wang.

Incremental Consistent Updates Naga Praveen Katta Jennifer Rexford, David Walker Princeton University.

Making Cellular Networks Scalable and Flexible Li Erran Li Bell Labs, Alcatel-Lucent Joint work with collaborators at university of Michigan, Princeton,

On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.

Lecture 6 Overlay Networks CPE 401/601 Computer Network Systems slides are modified from Jennifer Rexford.

Towards Virtual Routers as a Service 6th GI/ITG KuVS Workshop on “Future Internet” November 22, 2010 Hannover Zdravko Bozakov.

Scalable Flow-Based Networking with DIFANE 1 Minlan Yu Princeton University Joint work with Mike Freedman, Jennifer Rexford and Jia Wang.

Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.

SCAN: A Dynamic, Scalable, and Efficient Content Distribution Network Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy,

Can Congestion Control and Traffic Engineering be at Odds? Jiayue He, Mung Chiang, Jennifer Rexford Princeton University November 30 th, 2006.

Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.

High Performance Router Architectures for Network- based Computing By Dr. Timothy Mark Pinkston University of South California Computer Engineering Division.

2001 Winter CS215 Course Project Simulation Comparison of Routing Algorithms for Multicast with Bandwidth Reservation Zhihong Duan

Traffic Engineering With Traditional IP Routing Protocols

Traffic Engineering Jennifer Rexford Advanced Computer Networks Tuesdays/Thursdays 1:30pm-2:50pm.

Shadow Configurations: A Network Management Primitive Richard Alimi, Ye Wang, Y. Richard Yang Laboratory of Networked Systems Yale University.

On the Geographic Distribution of On- line Game Servers and Players Wu-chang FengWu-chi Feng Discussion moderated By: John Carter.

PSMC Proxy Server-based Multipath Connection CS 526 Advanced Networking - Richard White.

Rethinking Traffic Management: Using Optimization Decomposition to Derive New Architectures Jennifer Rexford Princeton University Jiayue He, Ma’ayan Bresler,

Rethinking Internet Traffic Management Using Optimization Theory Jennifer Rexford Princeton University Joint work with Jiayue He, Martin Suchara, Ma’ayan.

1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.

A Routing Control Platform for Managing IP Networks Jennifer Rexford Princeton University

Rethinking Internet Traffic Management: From Multiple Decompositions to a Practical Protocol Jiayue He Princeton University Joint work with Martin Suchara,

On Multi-Path Routing Aditya Akella 03/25/02. What is Multi-Path Routing?  Dynamically route traffic Multiple paths to a destination Path taken dependant.

Admission Control and Dynamic Adaptation for a Proportional-Delay DiffServ-Enabled Web Server Yu Cai.

Multipath Protocol for Delay-Sensitive Traffic Jennifer Rexford Princeton University Joint work with Umar Javed, Martin Suchara, and Jiayue He

On Self Adaptive Routing in Dynamic Environments -- A probabilistic routing scheme Haiyong Xie, Lili Qiu, Yang Richard Yang and Yin Yale, MR and.

Building a Strong Foundation for a Future Internet Jennifer Rexford ’91 Computer Science Department (and Electrical Engineering and the Center for IT Policy)

Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.

BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,

Hash, Don’t Cache: Fast Packet Forwarding for Enterprise Edge Routers Minlan Yu Princeton University Joint work with Jennifer.

Performance and Power Efficient On-Chip Communication Using Adaptive Virtual Point-to-Point Connections M. Modarressi, H. Sarbazi-Azad, and A. Tavakkol.

UCSC 1 Aman ShaikhICNP 2003 An Efficient Algorithm for OSPF Subnet Aggregation ICNP 2003 Aman Shaikh Dongmei Wang, Guangzhi Li, Jennifer Yates, Charles.

Magda El Zarki Professor of CS Univ. of CA, Irvine

1 Content Distribution Networks. 2 Replication Issues Request distribution: how to transparently distribute requests for content among replication servers.

Distributing Content Simplifies ISP Traffic Engineering Abhigyan Sharma* Arun Venkataramani* Ramesh Sitaraman*~ *University of Massachusetts Amherst ~Akamai.

Distributed Quality-of-Service Routing of Best Constrained Shortest Paths. Abdelhamid MELLOUK, Said HOCEINI, Farid BAGUENINE, Mustapha CHEURFA Computers.

Routing Algorithms (Ch5 of Computer Network by A. Tanenbaum)

CS 712 | Fall 2007 Using Mobile Relays to Prolong the Lifetime of Wireless Sensor Networks Wei Wang, Vikram Srinivasan, Kee-Chaing Chua. National University.

Network Sensitivity to Hot-Potato Disruptions Renata Teixeira (UC San Diego) with Aman Shaikh (AT&T), Tim Griffin(Intel),

DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,

Lecture 15. IGP and MPLS D. Moltchanov, TUT, Spring 2008 D. Moltchanov, TUT, Spring 2015.

“Intra-Network Routing Scheme using Mobile Agents” by Ajay L. Thakur.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

Traffic Engineering for ISP Networks Jennifer Rexford Internet and Networking Systems AT&T Labs - Research; Florham Park, NJ

KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.

DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.

Intradomain Traffic Engineering By Behzad Akbari These slides are based in part upon slides of J. Rexford (Princeton university)

6 December On Selfish Routing in Internet-like Environments paper by Lili Qiu, Yang Richard Yang, Yin Zhang, Scott Shenker presentation by Ed Spitznagel.

On Selfish Routing In Internet-like Environments Lili Qiu (Microsoft Research) Yang Richard Yang (Yale University) Yin Zhang (AT&T Labs – Research) Scott.

A Grid-enabled Multi-server Network Game Architecture Tianqi Wang, Cho-Li Wang, Francis C.M.Lau Department of Computer Science and Information Systems.

CS 6401 Overlay Networks Outline Overlay networks overview Routing overlays Resilient Overlay Networks Content Distribution Networks.

Queue Scheduling Disciplines

1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.

Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.

Placing Relay Nodes for Intra-Domain Path Diversity Meeyoung Cha Sue Moon Chong-Dae Park Aman Shaikh Proc. of IEEE INFOCOM 2006 Speaker 游鎮鴻.

BUFFALO: Bloom Filter Forwarding Architecture for Large Organizations Minlan Yu Princeton University Joint work with Alex Fabrikant,

Optimizing Distributed Actor Systems for Dynamic Interactive Services

Accelerating Peer-to-Peer Networks for Video Streaming

How I Learned to Stop Worrying About the Core and Love the Edge

Jian Wu (University of Michigan)

A Study of Group-Tree Matching in Large Scale Group Communications

Optimal Configuration of OSPF Aggregates

Using Packet Information for Efficient Communication in NoCs

COS 561: Advanced Computer Networks

Backbone Traffic Engineering

Control-Data Plane Separation

Presentation transcript:

1 Latency Equalization: A Programmable Routing Service Primitive Minlan Yu Joint work with Marina Thottan, Li Li at Bell Labs PRESTO’08

2 Motivation Latency EQualization (LEQ) service Online interactive applications require equalized delay among multiple users Online gaming Players vote to exclude players with higher lag Distributed online music concert Delay difference among musicians at different places degrade music quality Online trading Unfair advantage to shopping agents with lower delay

3 Latency Compensation Techniques Server side solutions Buffer packets till all clients response arrive Expensive due to processing overhead Limits on number of clients Client side solutions Buffer the packets to wait for other clients Requires coordination among clients Easy to cheat We need network service for LEQ

4 LEQ Service Reducing latency difference Difference of Maximum delay and minimum delay client1 client2 server client3

5 LEQ Architecture - Basic Idea Avoid changing every router Place a few hub routers in the network Add customized logic to hub routers Redirect traffic through hub routers server client1 client2client3 hub

Easy to Deploy Require only a few programmable routers Allow incremental deployment With one hub in the network, we can reduce delay difference by 40% on average compared with OSPF No modification of underlying routing protocols Can be implemented as an overlay

LEQ Architecture Architecture Select a set of hubs for each client Set up tunnels between clients and hubs, hubs and servers. MPLS tunnels or packet encapsulation Hub routers redirect packets to servers

8 Hub Router Implementation Packet classifier Identify application from src, dst, port Identify class of packets within an application Initial game setup packets: shortest path routing Interactive event packets: LEQ routing FIB Packet classifier

9 Hub Router Implementation Customize routing for each application Different applications may have different max delay bound; different client, server location LEQ routing for gaming, live concert, trading OSPF routing for other applications Control Plane LEQ routing for gaming OSPF LEQ routing For concert LEQ routing For trading FIB

Other benefits of hubs Add service-specific logic to a few enhanced routers in the network Application level packet processing Gaming: Update aggregation, packet inspection Concert: Echo cancellation Multicast Server multicast to hubs Hubs then multicast to their clients Load balancing among servers Hubs can select the least-loaded server for the client 10

11 Hub Placement Problem Input Location of client/server edge routers Maximum number of hub routers (M) Number of hub routers per client (m) Output: A set of m hubs for each client Goal: Minimize delay difference among clients

12 Problem Complexity We proved it is NP-hard and inapproximable Reduced to set cover problem Greedy hub placement algorithm Based on multi-set cover algorithm See details in the paper

13 Evaluation Static analysis Use Rocketfuel Data with different ISPs Focus on lightly loaded network propagation delay Result LEQ achieve 80% reduction of latency difference compared with shortest path routing Reduce from 35ms to 5ms Only need to place 5 hubs in the network Similar maximum delay of LEQ and OSPF

14 Evaluation (cont.) Dynamic Analysis Under dynamic traffic condition Focus on congested network Consider both propagation delay and queuing delay Result LEQ routing can get around congestion

15 Alternative Network-based Solutions OSPF No delay difference consideration Tune weights for each application Computationally hard Source routing Clients need to know the global network condition Require collaboration among clients Hard to compute and implement

16 Conclusion Interactive online applications New requirement on delay difference Latency Equalization service Place a few hubs to provide latency-equalized, reliable paths Deployment on programmable routers Easy to implement and deploy

17 Acknowledgement Grenville Armitage, Swinburne University of Technology Wu-Chang Feng, Washington State University Jennifer Rexford, Princeton University Thomas Woo, Bell Labs

18 Thanks! Q&A?

19 Static Analysis Telstra network 80% 5 hubs are sufficient

20 Static Analysis AT&T network

21 Premise of LEQ: Trading delay for delay difference