Scuola Superiore Sant’Anna Francesco Paolucci, Luca Valcarenghi, Filippo Cugini, and Piero Castoldi Grid High Performance Networking Research Group (GHPN-RG)

Slides:



Advertisements
Similar presentations
Network Resource Broker for IPTV in Cloud Computing Lei Liang, Dan He University of Surrey, UK OGF 27, G2C Workshop 15 Oct 2009 Banff,
Advertisements

UNIVERSITY OF JYVÄSKYLÄ P2PDisCo – Java Distributed Computing for Workstations Using Chedar Peer-to-Peer Middleware Presentation for 7 th International.
G : DCM Signaling Mechanism Using GMPLS RSVP-TE ITU-T Workshop on IP-Optical, Chitose, Japan 7/11/2002 Dimitrios Pendarakis, Tellium, Inc. ITU-T.
Application-Based Network Operations (ABNO) IETF 88 – SDN RG
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 4: Routing Concepts Routing Protocols.
© 2006 Cisco Systems, Inc. All rights reserved. MPLS v2.2—8-1 MPLS TE Overview Understanding MPLS TE Components.
Application of GMPLS technology to traffic engineering Shinya Tanaka, Hirokazu Ishimatsu, Takeshi Hashimoto, Shiro Ryu (1), and Shoichiro Asano (2) 1:
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—2-1 Implementing an EIGRP-Based Solution Advanced EIGRP Features in an Enterprise Network.
MPLS additions to RSVP Tunnel identification Tunnel parameter negotiation Routing policy distribution Routing debugging information Scalability improvements.
Monitoring network traffic of Cisco 2950 switch and Cisco 1600 router Group 4 Ishan Shah (CIN: ) Jyotsna Mishra (CIN: ) Parth Chavda (CIN: )
1 In VINI Veritas: Realistic and Controlled Network Experimentation Jennifer Rexford with Andy Bavier, Nick Feamster, Mark Huang, and Larry Peterson
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
Rheeve: A Plug-n-Play Peer- to-Peer Computing Platform Wang-kee Poon and Jiannong Cao Department of Computing, The Hong Kong Polytechnic University ICDCSW.
MPLS H/W update Brief description of the lab What it is? Why do we need it? Mechanisms and Protocols.
MPLS and Traffic Engineering
1IMIC, 8/30/99 Constraint-Based Unicast and Multicast: Practical Issues Bala Rajagopalan NEC C&C Research Labs Princeton, NJ
OSMOSIS Final Presentation. Introduction Osmosis System Scalable, distributed system. Many-to-many publisher-subscriber real time sensor data streams,
Introduction to MPLS and Traffic Engineering
RATES: A Server for MPLS Traffic Engineering (Routing And Traffic Engineering Server) Zlatokrilov Haim Advanced Topics in IP Networks5/1/2001 Tel-Aviv.
Network Monitoring for Internet Traffic Engineering Jennifer Rexford AT&T Labs – Research Florham Park, NJ 07932
Multicast Communication
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #5 Mobile Ad-Hoc Networks TBRPF.
A Study of MPLS Department of Computing Science & Engineering DE MONTFORT UNIVERSITY, LEICESTER, U.K. By PARMINDER SINGH KANG
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
1 Multi-Protocol Label Switching (MPLS) presented by: chitralekha tamrakar (B.S.E.) divya krit tamrakar (B.S.E.) Rashmi shrivastava(B.S.E.) prakriti.
Mobile IP Performance Issues in Practice. Introduction What is Mobile IP? –Mobile IP is a technology that allows a "mobile node" (MN) to change its point.
Link State Routing Protocol W.lilakiatsakun. Introduction (1) Link-state routing protocols are also known as shortest path first protocols and built around.
1 Multi Protocol Label Switching Presented by: Petros Ioannou Dept. of Electrical and Computer Engineering, UCY.
Introduction to MPLS and Traffic Engineering Zartash Afzal Uzmi.
Scuola Superiore Sant’Anna Enabling Platforms for high-performance computational Grids oriented to scalable virtual organization (GRID.IT) P. Castoldi,
GrIDS -- A Graph Based Intrusion Detection System For Large Networks Paper by S. Staniford-Chen et. al.
C O R P O R A T E T E C H N O L O G Y Information & Communications Networks & Multimedia Communications NOBEL WP4 – Siemens implementation activities contact:
Integrated Dynamic IP and Wavelength Routing in IP over WDM Networks Murali Kodialam and T. V. Lakshman Bell Laboratories Lucent Technologies IEEE INFOCOM.
Institute of Computer and Communication Network Engineering OFC/NFOEC, 6-10 March 2011, Los Angeles, CA Lessons Learned From Implementing a Path Computation.
IP/MPLS Multiprotocol Label Switching
MPLS and Traffic Engineering Ji-Hoon Yun Computer Communications and Switching Systems Lab.
Multicast monitoring and visualization tools A. Binczewski R. Krzywania R. Łapacz.
Brief Introduction to Juniper and its TE features Huang Jie [CSD-Team19]
Applicazione del paradigma Diffserv per il controllo della QoS in reti IP: aspetti teorici e sperimentali Stefano Salsano Università di Roma “La Sapienza”
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
OS Services And Networking Support Juan Wang Qi Pan Department of Computer Science Southeastern University August 1999.
© Wiley Inc All Rights Reserved. MCSE: Windows Server 2003 Active Directory Planning, Implementation, and Maintenance Study Guide, Second Edition.
Management of the LHCb DAQ Network Guoming Liu * †, Niko Neufeld * * CERN, Switzerland † University of Ferrara, Italy.
A Practical Approach for Providing QoS: MPLS and DiffServ
Optical Networking & Grid Middleware Final Presentation May 25, 2004.
Distance Vector Routing Protocols Dynamic Routing.
Research Unit in Networking - University of Liège A Distributed Algorithm for Weighted Max-Min Fairness in MPLS Networks Fabian Skivée
Distributed Computing Systems CSCI 4780/6780. Scalability ConceptExample Centralized servicesA single server for all users Centralized dataA single on-line.
Management of the LHCb Online Network Based on SCADA System Guoming Liu * †, Niko Neufeld † * University of Ferrara, Italy † CERN, Geneva, Switzerland.
© 2009 Cisco Systems, Inc. All rights reserved. ROUTE v1.0—2-1 Implementing an EIGRP-Based Solution Lab 2-2 Debrief.
Spring 2000CS 4611 Routing Outline Algorithms Scalability.
ECHO A System Monitoring and Management Tool Yitao Duan and Dawey Huang.
A Snapshot on MPLS Reliability Features Ping Pan March, 2002.
Management of the LHCb DAQ Network Guoming Liu *†, Niko Neufeld * * CERN, Switzerland † University of Ferrara, Italy.
Label Distribution Protocols LDP: hop-by-hop routing RSVP-TE: explicit routing CR-LDP: another explicit routing protocol, no longer under development.
Page th IETF – Dublin, Ireland, July 2008 Performance Evaluation of PCE Architectures for Wavelength Switched Optical Networks Editors: Greg
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
1 Revision to DOE proposal Resource Optimization in Hybrid Core Networks with 100G Links Original submission: April 30, 2009 Date: May 4, 2009 PI: Malathi.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Supporting Advanced Scientific Computing Research Basic Energy Sciences Biological and Environmental Research Fusion Energy Sciences High Energy Physics.
A System for Monitoring and Management of Computational Grids Warren Smith Computer Sciences Corporation NASA Ames Research Center.
This teaching material is a part of e-Photon/ONe Master study in Optical Communications and Networks Course and module: Author(s):
draft-sitaraman-sr-rsvp-coexistence-rec-01
Inter domain signaling protocol
CHAPTER 3 Architectures for Distributed Systems
CCNA 2 v3.1 Module 6 Routing and Routing Protocols
CS 457 – Lecture 12 Routing Spring 2012.
Replication Middleware for Cloud Based Storage Service
Comparison of LAN, MAN, WAN
An Introduction to Computer Networking
Presentation transcript:

Scuola Superiore Sant’Anna Francesco Paolucci, Luca Valcarenghi, Filippo Cugini, and Piero Castoldi Grid High Performance Networking Research Group (GHPN-RG) Session I Monday, Feb. 13th, 2006, Athens, Greece Implementation and Performance Assessment of a Grid-Oriented Centralized Topology Discovery Service

Motivations Global Grid Computing evolution from LAN to WAN  Network resource sharing Bottlenecks Computational resources (CPU) Network Resources OUR PROPOSAL Topology Discovery Service (TDS) NIMS component Implemented and tested in two different configurations: DISTRIBUTED (D-TDS) CENTRALIZED (C-TDS) Grid Network Services Resource availability monitoring and resources adaptation to QoS requirements Network-aware application task staging Network Information and Monitoring Service (NIMS) It provides a Network-Aware Programming Environment (NA-PE) with an updated snapshot of network topology and resource utilization status

Centralized TDS 1. Topology request 2. UNI Queries to Nodes 3. XML Replies 4. XML Topology file Based on a central broker Broker has the routers list and administrator privileges on them Broker directly queries routers with router- based requests Three kinds of topology detected (one of them by querying one node only) ARCHITECTURE

C-TDS: XML Topologies and Retrieval Strategies PHYSICAL TOPOLOGY All VO nodes (i.e., routers) queried XML topology file: nodes, physical and logical interfaces, IP addresses, RSVP resources, node and interface adjacencies. Adjacency detection: IP subnet match Routing protocols independence MPLS TOPOLOGY All VO nodes queried XML topology file: active LSP, ingress/egress nodes, intermediate nodes (ERO), reserved bandwidth, load- balancing LOGICAL TOPOLOGY (IP,OSPF-TE) One node queried XML topology file: nodes, IP addresses, RSVP resources, node/interface adjacencies, OSPF areas, TE link metrics Adjacency detection: TED link objects match TDS Triggering Mechanisms TIMEOUT BASED Periodical polling Delivery time<Timeout No active monitoring EVENT-DRIVEN Network status changes: active network monitoring SNMP traps sent by VO nodes TDS Update Methods GLOBAL Brand new topology for each call Large messages exchanged INCREMENTAL Existing topology update Small messages exchanged

C-TDS Implementation TDS-router Interface TCP Socket communication UNI request-reply platform (router-dependent) Topology-based requests Security: router password needed XSLT Engine Provided by XSLTProc Topology builder files are router- dependent User-TDS Interface TCP Socket communication: only GRID users allowed SNMP trap detector daemon C++ module based on pcap network libraries Detected events: LINK ON/OFF, LSP ON/OFF Topology Update Engine Current file updates exploiting SNMP trap information In case of LSP UP a new query to ingress router is performed BASE MODULES ACTIVE- MONITORING MODULES

TDS Experimental MAN Testbed 3 MPLS-native Juniper Mx© routers, Linux PC Broker MAN 5 km-long optical ring All routers run OSPF-TE and RSVP-TE Junoscript Server activated for XML-file exchange platform TESTBED FEATURES EVENTS 2.OPTICAL LINK R2- R3 FAILURE. FAILURE 1.11 LSP R2-R3 on (10 LSPs 10 Mbit/s resv, 1 LSP 300 Mbit/s resv): total 400 Mbit/s resv LSP re-routed on path R2-R1-R3 (fulfilled FE link), 1 LSP down.

Results - 1 DELIVERY TIME Physical and MPLS Topology with Incremental Event-Driven Updates N= Nodes number 3 t login = Router login time 1 s t q = average query time 0.25 s t XSLT = XSLT engine time 0.1 s t d = topology delivery time 3.85 s BEFORE FAILURE Incremental event-driven update 23 SNMP traps detected: 11 LSP DOWN, 10 LSP UP, 2 LINK DOWN Topology update: 10 new LSP queries to one ingress router. 10 KB traffic exchanged by Broker I= New LSPs Ingress nodes queried 1 t Login = average router login time 1 s t q = average query time (shorter) 0.05 s n i = i-th node new LSPs number 10 t dINC = inc. topology delivery time 1.6 s AFTER FAILURE Physical and MPLS topology information 200 kB traffic totally exchanged by Broker 32 kB Physical topology XML file 8 kB MPLS topology XML file 1.35 s Parallel-mode detection t d= 1.35 s

Results - 2 DELIVERY TIME Logical Topology with Global Timeout-based Update t login = Router login time 1 s t q = TED query time 0.2 s t XSLT = Broker XSLT trans time 0.1 s t d = topology delivery time 1.3 s BEFORE FAILURE SNMP traps ignored by Broker At timeout expiry, a new global topology detection is performed CPU load is low anyway AFTER FAILURE Logical topology information Only one node queried 60 kB traffic totally exchanged by Broker 8 kB Logical toplogy XML file Timeout = 15 seconds Reasonable trade-off between TED update time, CPU load and topology consistency.

Conclusions and future activities Implementations of Centralized Topology Discovery Service for Grid NIMS –Network Status Information: Physical Topology, MPLS Topology, Logical Topology –Topology Update Methods: global and incremental –Update Triggering Method: time-out based and event-driven Experimental results on an IP/MPLS metropolitan network based on commercial routers –Different network status topology information –Delivery time of few seconds –Limited requested traffic Thank you for your attention! Integration with Distributed TDS and Globus Toolkit 4 New tests on wider network scenarios to verify scalability issues NEXT STEPS

Sant’Anna School & CNIT, CNR research area, Via Moruzzi 1, Pisa, Italy

Distributed TDS Each user runs a network sensor service. Users are coordinated by the D-TDS Broker. Users and broker work within a grid service domain (peer visibility). Broker builds topology graph by joining and pruning users multigraphs. ARCHITECTURE 1. Topology request 2. GLOBUS request 4. GLOBUS replies 3. Network sensor towards other clients 5. XML Topology file