15.05.2014 Dynamic Traffic Management (DTM) for minimization of inter- domain traffic cost Rafal Stankiewicz, Zbigniew Dulinski AGH University of Science.

Slides:



Advertisements
Similar presentations
Network Aware Forward Caching Presenter: Alexandre Gerber Jeffrey Erman, Mohammad T. Hajiaghayi, Dan Pei, Oliver Spatscheck AT&T Labs Research April 24.
Advertisements

The following 5 questions are about VOLTAGE DIVIDERS. You have 20 seconds for each question What is the voltage at the point X ? A9v B5v C0v D10v Question.
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Generative Design in Civil Engineering Using Cellular Automata Rafal Kicinger June 16, 2006.
A Hierarchical Position Prediction Algorithm for Efficient Management of Resources in Cellular Networks Tong Liu, Paramvir Bahl, Imrich Chlamtac
June 27, 2007 FIND Meeting, From Packet-Switching to Contract- Switching Aparna Gupta Shivkumar Kalyanaraman Rensselaer Polytechnic Institute Troy,
OSPF 1.
February 20, Spatio-Temporal Bandwidth Reuse: A Centralized Scheduling Mechanism for Wireless Mesh Networks Mahbub Alam Prof. Choong Seon Hong.
Theory Lunch. 2 Problem Areas Network Virtualization for Experimentation and Architecture –Embedding problems –Economics problems (markets, etc.) Network.
Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Optimizing Cost and Performance for Multihoming Nick Feamster CS 6250 Fall 2011.
Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
Circuit Monitoring July 16 th 2011, OGF 32: NMC-WG Jason Zurawski, Internet2 Research Liaison.
All rights reserved © 2006, Alcatel Grid Standardization & ETSI (May 2006) B. Berde, Alcatel R & I.
and 6.855J Cycle Canceling Algorithm. 2 A minimum cost flow problem , $4 20, $1 20, $2 25, $2 25, $5 20, $6 30, $
Wireless Networks Should Spread Spectrum On Demand Ramki Gummadi (MIT) Joint work with Hari Balakrishnan.
P4P: ISPs and P2P Laird Popkin, Pando Networks Doug Pasko, Verizon.
Slide 1 Integration of Mobility Management in land use planning: Outputs Janina Welsch (ILS), Roberto. De Tommasi (synergo), Tom Rye (TRI, ENU), Aljaz.
Scoping the Framework Guidelines on Interoperability Rules for European Gas Transmission Geert Van Hauwermeiren Workshop, Ljubljana, 13 Sept 2011.
1 All rights reserved © 2001, Alcatel, Paris. Information Document 7-E ITU-T Study Group 2 January 2002 QUESTIONS:ALL SOURCE:TSB TITLE:TELECOM NETWORK.
MPLS VPN.
Multipath Routing for Video Delivery over Bandwidth-Limited Networks S.-H. Gary Chan Jiancong Chen Department of Computer Science Hong Kong University.
Video Services over Software-Defined Networks
FIND PI Meeting, November Value Flows and Risk Management Architecture for Future Internet Murat Yuksel University of Nevada.
Two-Market Inter-domain Bandwidth Contracting
THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
Top-Down Network Design Chapter Nine Developing Network Management Strategies Copyright 2010 Cisco Press & Priscilla Oppenheimer.
FIND PI Meeting, April Contract-Switching: Value Flows in Inter-Domain Routing Murat Yuksel University of Nevada – Reno Reno, NV Aparna Gupta, Koushik.
1 Praveen K. Muthuswamy Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute In collaboration with Koushik Kar, Aparna Gupta (RPI)
Chapter 1: Introduction to Scaling Networks
Virtual Distance: A Generalized Metric for Overlay Tree Construction ISCC12 July Suat Mercan (Zirve University) & Murat Yuksel (University of Nevada,
1 Comnet 2010 Communication Networks Recitation 4 Scheduling & Drop Policies.
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
Peter R. Pietzuch Peer-to-Peer Computing – or how to make your BitTorrent downloads go faster... Peter Pietzuch Large-Scale Distributed.
20S Applied Math Mr. Knight – Killarney School Slide 1 Unit: Spreadsheets Lesson: SS-L4 Creating Spreadsheet Formulas Creating Spreadsheet Formulas Learning.
1 Computer Aided Geometric Design Ferienakademie 2004 Bernstein Polynomials, Bézier Curves, de Casteljau‘s Algorithm Shenqiang Wu.
Modelling uncertainty in 3APL Johan Kwisthout Master Thesis
PSIRP Publish-Subscribe Internet Routing Paradigm 08-Oct /27.
Web-pa – the tutors’ view Web-PA – a tutors’ view Peter Willmot (School of Mechanical and Manufacturing Engineering)
Abhigyan, Aditya Mishra, Vikas Kumar, Arun Venkataramani University of Massachusetts Amherst 1.
Systems Analysis and Design in a Changing World, Fifth Edition
Tarun Bansal*, Karthik Sundaresan+,
A Measurement Study of Available Bandwidth Estimation Tools MIT - CSAIL with Jacob Strauss & Frans Kaashoek Dina Katabi.
Traversing symmetric NAT with predictable port allocation function SIN 2014 Dušan Klinec, Vashek Matyáš Faculty of Informatics, Masaryk University.
© 2013 The SmartenIT Consortium 1 Commercial in Confidence Game Theoretic approach to energy efficiency Mateusz Wielgosz, Krzysztof Wajda, AGH Krakow Meeting,
Alex Cheung and Hans-Arno Jacobsen August, 14 th 2009 MIDDLEWARE SYSTEMS RESEARCH GROUP.
Application of Ensemble Models in Web Ranking
CloudWatcher: Network Security Monitoring Using OpenFlow in Dynamic Cloud Networks or: How to Provide Security Monitoring as a Service in Clouds? Seungwon.
Will P2P Users Cooperate with ISPs? A Word-of-Mouth Communication Approach Piotr Wydrych (AGH University of Science and Technology, Poland); Piotr Cholda.
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. The Internet has many mechanisms for.
Mohamed Hefeeda 1 School of Computing Science Simon Fraser University, Canada ISP-Friendly Peer Matching without ISP Collaboration Mohamed Hefeeda (Joint.
Traffic Engineering With Traditional IP Routing Protocols
COGNITIVE RADIO FOR NEXT-GENERATION WIRELESS NETWORKS: AN APPROACH TO OPPORTUNISTIC CHANNEL SELECTION IN IEEE BASED WIRELESS MESH Dusit Niyato,
EQ-BGP: an efficient inter- domain QoS routing protocol Andrzej Bęben Institute of Telecommunications Warsaw University of Technology,
9/15/2015CS622 - MIRO Presentation1 Wen Xu and Jennifer Rexford Department of Computer Science Princeton University Chuck Short CS622 Dr. C. Edward Chow.
P.1Service Control Technologies for Peer-to-peer Traffic in Next Generation Networks Part2: An Approach of Passive Peer based Caching to Mitigate P2P Inter-domain.
© 2014 The SmartenIT Consortium 1 Commercial in Confidence Panel on “Cloud Federations and SDN/NFV: the highways towards improved QoE, Cost, and Energy.
© 2013 The SmartenIT Consortium 1 Commercial in Confidence 2.4: Game Theoretic approach to Horst-RB Mateusz Wielgosz, AGH ? ?, ? ?, 2014 Socially-aware.
A Framework for Elastic Execution of Existing MPI Programs Aarthi Raveendran Tekin Bicer Gagan Agrawal 1.
A Framework for Elastic Execution of Existing MPI Programs Aarthi Raveendran Graduate Student Department Of CSE 1.
Resilient Overlay Networks Robert Morris Frans Kaashoek and Hari Balakrishnan MIT LCS
Performance Limitations of ADSL Users: A Case Study Matti Siekkinen, University of Oslo Denis Collange, France Télécom R&D Guillaume Urvoy-Keller, Ernst.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
ALTO: A Multi Dimensional Peer Selection Problem IETF 73 Saumitra Das
VIEWS b.ppt-1 Managing Intelligent Decision Support Networks in Biosurveillance PHIN 2008, Session G1, August 27, 2008 Mohammad Hashemian, MS, Zaruhi.
© 2015 The SmartenIT Consortium 1 Commercial in Confidence DTM for minimization of inter-domain traffic cost Grzegorz Rzym, AGH, June 16, 2015 Socially-aware.
ISP and Egress Path Selection for Multihomed Networks
MENTER: Dynamic Traffic Engineering for MPLS Networks
ExaO: Software Defined Data Distribution for Exascale Sciences
Towards Predictable Datacenter Networks
Presentation transcript:

Dynamic Traffic Management (DTM) for minimization of inter- domain traffic cost Rafal Stankiewicz, Zbigniew Dulinski AGH University of Science and Technology Department of Telecommunications RACI BoF session

Rafal Stankiewicz, Socially-aware Management of New Overlay Application Traffic with Energy Efficiency in the Internet European Seventh Framework Project FP ICT AGH University of Science and Technology Department of Telecommunications Krakow, Poland

Rafal Stankiewicz, Content requestors ISP-0 peers Cloud provider DC A ISP-1 ISP-2 ISP-3 peers end-user Transit network peers Background The content is not available locally – The download will generate inevitable inter-domain traffic The cost of the downstream traffic depend on the tariff on inter-domain link used Optimize total cost of inter-domain traffic Manage the traffic: – Selection of content source (multiple resources available, communicate with overlay application, e.g. by using ALTO) – Select the path, e.g. by using tunnels (might be transparent to or cooperate with overlay) DC DC B DC C

Rafal Stankiewicz, Traffic management Link 1 Link 2 5 min samples nn–1n+1n+2n+3n+4 TARGET traffic (cost) to be achieved in the current period 5 min samples nn–1n+1n+2n+3n+4 TARGET traffic (cost) to be achieved in the current period Total amount of traffic in each period n remains the same, but the traffic is differently distributed among two links manageable traffic non-manageable traffic

Rafal Stankiewicz, Basic assumptions Tariffs based on total traffic volume or 95 th percentile Upstream and downstream traffic management Find cost-optimal traffic distribution on inter-domain links Goal – minimize cost by the end of accounting period – long time scale Influence traffic distribution dynamically on short time scale Observe traffic on links Periodic measurements and estimation of final cost Influence the manageable traffic by selecting path for flows

Rafal Stankiewicz, Sample use-case  Cloud agnostic  Tunnels (GRE or MPLS) between DAs (Data Center Access router) located in different ISP domains  Simple management in DAs  Recognize flows  Choose appropriate interface (tunnel) for the flow  SDN controller  Agreements between ISPs may be needed ISP-C ISP-A ISP-B ISP-D DA-A DA-B Cloud A DC Cloud A DC

Rafal Stankiewicz, Compensation algorithm Metering component Optimization algorithm DTM – traffic management concept

Rafal Stankiewicz, DTM – traffic management concept Compensation algorithm Metering component Optimization algorithm Finds optimal goal vector D t Calculates compensation vector U t e.g. every 5 min and influences path selection e.g. (modified) NetFlow Monitors current traffic on inter- domain links and calculated measured vector X t e.g. every 30s

Rafal Stankiewicz, Example more detailed example  Frequent traffic measurements (per epoch)  5-min slot divided into a number of epochs  Per epoch reaction: compensation vector is recalculated after each epoch  The compensation vector says how much traffic should be shifted from one link to the other to keep the sample small enough and achieve target cost (in terms of 95 th percentile) 5 minutes B1B1 B2B2 B3B3 B4B4 B5B5 D1D1 D2D2 D3D3 D4D Epoch Tr/N=3,6 B1B1 B2B2 B3B3 B4B4 B5B5 D1D1 D2D2 D3D3 D4D4 5 minute sample Tr= minute sample Tr=16 Link 1Link 2

Rafal Stankiewicz, Simulation results – 95 th percentile tariff Time [h] [GB] Cumulated traffic volume on links Without compensation With compensation Goal vector of traffic

Questions?