Routing in Multiple Layers: Opportunities and Challenges

Slides:



Advertisements
Similar presentations
CONFIDENTIAL © 2004 Procket Networks, Inc. All rights reserved. 4-Feb-14 The 21 st Century Intelligent Network Tony Li, Carl DeSousa.
Advertisements

Multihoming and Multi-path Routing
Distributed Scheduling in Supply Chain Management Emrah Zarifoğlu
B 黃冠智.
Resource Management §A resource can be a logical, such as a shared file, or physical, such as a CPU (a node of the distributed system). One of the functions.
Jaringan Komputer Lanjut Packet Switching Network.
Network+ Guide to Networks, Fourth Edition
MPLS - 75th IETF Stockholm1 Composite Transport Group (CTG) Framework and Requirements draft-so-yong-mpls-ctg-framework-requirement-02.txt draft-so-yong-mpls-ctg-framework-requirement-02.txt.
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara in collaboration with: D. Xu, R. Doverspike, D. Johnson and J. Rexford.
CIS 235: Networks Fall, 2007 Western State College Welcome to CIS 235 Computer Networks Fall, 2007 Prof Peterson.
Challenges, Opportunities and Initiatives Panel Statement Mostafa H. Ammar College of Computing Georgia Tech.
1 Routing as a Service Karthik Lakshminarayanan (with Ion Stoica and Scott Shenker) Sahara/i3 retreat, January 2004.
Directed Diffusion: A Scalable and Robust Communication Paradigm for Sensor Networks Charlmek Intanagonwiwat Ramesh Govindan Deborah Estrin Presentation.
1© Copyright 2015 EMC Corporation. All rights reserved. SDN INTELLIGENT NETWORKING IMPLICATIONS FOR END-TO-END INTERNETWORKING Simone Mangiante Senior.
Multipath Routing Algorithms for Congestion Minimization Ron Banner and Ariel Orda Department of Electrical Engineering Technion- Israel Institute of Technology.
The Future of the Internet Jennifer Rexford ’91 Computer Science Department Princeton University
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
1 EL736 Communications Networks II: Design and Algorithms Class11: Multi-Hour and Multi-Layer Network Design 12/05/2007.
Dynamic Freight Train Rerouting Alborz Parcham-Kashani Dr. Alan Erera Georgia Institute of Technology H. Milton Stewart School of Industrial & Systems.
C OLUMBIA U NIVERSITY Lightwave Research Laboratory Embedding Real-Time Substrate Measurements for Cross-Layer Communications Caroline Lai, Franz Fidler,
1 Slides by Yong Liu 1, Deep Medhi 2, and Michał Pióro 3 1 Polytechnic University, New York, USA 2 University of Missouri-Kansas City, USA 3 Warsaw University.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jennifer Rexford Princeton University With Jiayue He, Rui Zhang-Shen, Ying Li,
On the Interaction between Dynamic Routing in the Native and Overlay Layers INFOCOM 2006 Srinivasan Seetharaman Mostafa Ammar College of Computing Georgia.
CS : Software Defined Networks 3rd Lecture 28/3/2013
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
P4P: Provider Portal for Applications Haiyong Xie, Y. Richard Yang Arvind Krishnamurthy, Yanbin Liu, Avi Silberschatz SIGCOMM ’08 Hoon-gyu Choi
1 High-Level Carrier Requirements for Cross Layer Optimization Dave McDysan Verizon.
Topology aggregation and Multi-constraint QoS routing Presented by Almas Ansari.
Putting Intelligence in Internetworking: an Architecture of Two Level Overlay EE228 Project Anshi Liang Ye Zhou.
Logical Topology Design
Page 1 Unclassified _NB_Next Steps.ppt Phillip E. Paulsen Space Communications Office NASA Glenn Research Center (GRC) Cleveland, Ohio 6 November.
Self-Managed Networks: Dream or Reality? Jawad Khaki Corporate Vice President Windows Networking & Device Technologies.
DaVinci: Dynamically Adaptive Virtual Networks for a Customized Internet Jiayue He, Rui Zhang-Shen, Ying Li, Cheng-Yen Lee, Jennifer Rexford, and Mung.
Resource Allocation in Network Virtualization Jie Wu Computer and Information Sciences Temple University.
Dzmitry Kliazovich University of Luxembourg, Luxembourg
1 An Arc-Path Model for OSPF Weight Setting Problem Dr.Jeffery Kennington Anusha Madhavan.
1 Simple provisioning, complex consolidation – An approach to improve the efficiency of provisioning oriented optical networks Tamás Kárász Budapest University.
Use Cases for High Bandwidth Query and Control of Core Networks Greg Bernstein, Grotto Networking Young Lee, Huawei draft-bernstein-alto-large-bandwidth-cases-00.txt.
ICNP 2006 Inter­domain Policy Violations in Overlay Routes Srinivasan Seetharaman, Mostafa Ammar Networking and Telecommunications Group College of Computing.
Routing in Multi-Layered Networks Srinivasan Seetharaman Georgia Institute of Technology Case Western Reserve University March 2007.
Overlay Networking Srinivasan Seetharaman Fall 2006.
GLOBECOM 2007 Exit Policy Violations in Multi-hop Overlay Routes Srinivasan Seetharaman, Mostafa Ammar Networking and Telecommunications Group College.
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.
Draft-deoliveira-diff-te-preemption-02.txt J. C. de Oliveira, JP Vasseur, L. Chen, C. Scoglio Updates: –Co-author: JP Vasseur –New preemption criterion.
Multiprotocol Label Switching (MPLS) Routing algorithms provide support for performance goals – Distributed and dynamic React to congestion Load balance.
1 On the Interaction between Dynamic Routing in the Native and Overlay Layers Infocom2006 Srinivasan Seetharaman and Mostafa Ammar College of Computing.
P4P: Proactive Provider Assistance for P2P Haiyong Xie Yale University.
Confluent vs. Splittable Flows
VPN Extension Requirements for Private Clouds
P4P : Provider Portal for (P2P) Applications Haiyong Xie, Y
Constraint-Based Routing
Presented by Tae-Seok Kim
Hydra: Leveraging Functional Slicing for Efficient Distributed SDN Controllers Yiyang Chang, Ashkan Rezaei, Balajee Vamanan, Jahangir Hasan, Sanjay Rao.
Analyzing Cross-layer Interaction in Overlay Networks
ElasticTree Michael Fruchtman.
Overlay­Friendly Native Network: A Contradiction in Terms?
ISP and Egress Path Selection for Multihomed Networks
Multi-Core Parallel Routing
Frank Yeong-Sung Lin (林永松) Information Management Department
Overlay Networking Overview.
Software Defined Networking (SDN)
IEEE MEDIA INDEPENDENT HANDOVER
Managing Inter-domain Traffic in the Presence of BitTorrent File-Sharing Srinivasan Seetharaman and Mostafa Ammar School of Computer Science Objective:
Advisor: Yeong-Sung, Lin, Ph.D. Presented by Yu-Ren, Hsieh
Cross-Layer Interaction in Overlay Networks
EE 122: Lecture 22 (Overlay Networks)
QoS routing Finding a path that can satisfy the QoS requirement of a connection. Achieving high resource utilization.
Authors: Jinliang Fan and Mostafa H. Ammar
Srinivasan Seetharaman - College of Computing, Georgia Tech
Presentation transcript:

Routing in Multiple Layers: Opportunities and Challenges Mostafa Ammar, Srinivasan Seetharaman Networking and Telecommunications Group College of Computing Georgia Institute of Technology

Overlays P2P Nets Service Overlays Application Layer X (X= multicast, QoS, …) Virtual Networks (a la PlanetLab, VINI, GENI)

Overlays like to do routing! Their raison d’etre Performance reasons Fault recovery reasons Resource management To “battle” lower layer

Multi-Layer Routing C E B C E F H A G D B A C E F H B D G OVERLAY2 No knowledge of each other. Causing increase in perceived freedom E F H B NATIVE IP LAYER D G

Challenge 1: Objective Mismatch Conflict in objective between the two layers AS policy violation C OVERLAY1 LAYER E F H A G D B A C PROVIDER Policy violation E F H B NATIVE IP LAYER CUSTOMER D G

Challenge 2: Functionality overlap Each layer performs rerouting, with no knowledge of which layer leads to optimal restoration Overlay rerouting C OVERLAY1 LAYER E F H A G D A B A C Functionality overlap and suboptimality E F H X Failure B NATIVE IP LAYER D G Native rerouting

Challenge 3: Coexistence issues In reality, coexistence is required between: overlay and legacy apps. overlay and other overlay apps C OVERLAY1 LAYER E F H A G D B A C Conflict between layers and between entities in the same layer that share resources. Unfortunately, this grim picture is here to stay and not contrived. The ISPs need to be prepared. E F H B NATIVE IP LAYER D G

Challenge 4: Unconstrained Design Higher level of perceived freedom as you go up No knowledge of physical constraints & optimal placement Essential nodes C E F OVERLAY1 LAYER H A G D B A C E F H B NATIVE IP LAYER D G

Virtual network assignment (VNA) Problem Statement Allowing virtual networks (VNs) to be assigned to the substrate network efficiently and on-demand Tasks Assign VNs to the substrate Achieve low and balanced load on both substrate nodes and links Importance Allows for accommodating more VNs with limited resources Helps to handle dynamic situation In our envisioned scenario, DVN demands would arrive at different time instances and request to set up virtual networks (VNs) with different topologies and lifetimes. Allowing VNs to be assigned to the substrate network efficiently and on-demand is desirable for the following reasons: • Increasing efficiency in the substrate resource utilization would allow the substrate network to accommodate more VNs with limited resources and reduce hot spots or congestion. • On-demand assignment means that the assignment for each VN is determined based on the current network situation as the demand arrives. Given that DVN demands can arrive at any moment and the SNP would not have information regarding future arrivals, it is important for the SNP to be able to make the assignment decision in response to each individual demand as they arrive. A special case of the VN assignment problem can be formulated as an unsplittable flow problem which is NP-hard. Therefore, the VN assignment problem is intrinsically difficult and heuristics will be used to solve the problem.

Research Opportunities Layer-aware design of protocols in all layers Sufficient incentive for inter-layer awareness Level of awareness and cooperation needs to determined Improves co-existence/resource sharing Virtual network (resource) assignment Resource management Intelligent placement Efficient reconfiguration Multi-layer testbed that allows control of multiple layers That helps meter actual user experience