science science uva uva nl nl delaat delaat cees de laat
play

www.science. www.science.uva uva.nl nl/~ /~delaat delaat Cees - PowerPoint PPT Presentation

(0 of 12) High Performance Networking for Grid Applications www.science. www.science.uva uva.nl nl/~ /~delaat delaat Cees de Laat (1 of 12) High Performance Networking for Grid Applications www.science.uva www.science.


  1. (0 of 12) High Performance Networking for Grid Applications λ www.science. www.science.uva uva.nl nl/~ /~delaat delaat Cees de Laat

  2. (1 of 12) High Performance Networking for Grid Applications λ www.science.uva www.science. www.science.uva www.science. uva.nl uva.nl nl/~ nl/~ /~delaat /~de delaat de λ aat aat Cees de λ aat Cees de Laat EU SURFnet University of Amsterdam SARA NIKHEF NCF

  3. Contents of this talk λ This slide is intentionally left blank

  4. (1 of 12) eVLBI λ

  5. (2 of 12) VLBI λ

  6. iGrid 2002 (3 of 12) September 24-26, 2002, Amsterdam, The Netherlands • 28 demonstrations from 16 countries: Australia, Canada, CERN, France, Finland, Germany, Greece, Italy, Japan, The Netherlands, Singapore, Spain, Sweden, Taiwan, United Kingdom, United States • Applications demonstrated: art, bioinformatics, chemistry, cosmology, cultural heritage, education, high-definition media streaming, manufacturing, medicine, neuroscience, physics, tele-science • Grid technologies demonstrated: Major emphasis on grid middleware, data management grids, data replication grids, visualization grids, data/visualization grids, computational grids, access grids, grid portals • 25Gb transatlantic bandwidth (100Mb/attendee, 250x iGrid2000!) www.igrid2002.org

  7. (3b of 12) Experimental Networks • High-performance trials of new technologies that support application-dictated development of software toolkits, middleware, computing and networking. • Provide known and knowable characteristics with deterministic and repeatable behavior on a persistent basis, while encouraging experimentation with innovative concepts. • Experimental Networks are seen as the missing link between Research and Production Networks. http://www.evl.uic.edu/activity/NSF/index.html http://www.calit2.net/events/2002/nsf/index.html

  8. (3c of 12) What is a LambdaGrid? • A grid is a set of networked, middleware-enabled computing resources. • A LambdaGrid is a grid in which the lambda networks themselves are resources that can be scheduled, like all other computing resources. The ability to schedule and provision lambdas provides deterministic end-to-end network performance for real-time or time-critical applications, which cannot be achieved on today ’ s grids.

  9. (4a of 12) # u A. Lightweight users, browsing, mailing, home use s Need full Internet routing, one to many e r λ B. Business applications, multicast, streaming, VPN’s, mostly LAN s Need VPN services and full Internet routing, several to several + uplink C. Special scientific applications, computing, data grids, virtual-presence Need very fat pipes, limited multiple Virtual Organizations, few to few A C B GigE ADSL F(t) BW requirements

  10. (4b of 12) # u A. Lightweight users, browsing, mailing, home use s Need full Internet routing, one to many e r λ B. Business applications, multicast, streaming, VPN’s, mostly LAN s Need VPN services and full Internet routing, several to several + uplink C. Special scientific applications, computing, data grids, virtual-presence Need very fat pipes, limited multiple Virtual Organizations, few to few A C B GigE ADSL F(t) BW requirements

  11. (5 of 12) λ Scale 2-20-200

  12. (6 of 12) The only formula’s # λ ( rtt ) ≈ 200 ∗ e ( t − 2002) λ rtt Now, having been a High Energy Physicist we set c = 1 e = 1 h = 1 # λ ≈ 200 ∗ e ( t − 2002) and the formula reduces to: rtt

  13. (7 of 12) dummy λ d SURFnet Lambda’s fibers (old already)

  14. (8 of 12) Services λ 2 20 200 SCALE Metro National/ World regional CLASS A Switching/ Routing ROUTER$ routing B VPN’s, VPN’s Routing (G)MPLS Routing C dark fiber Lambda Sub- switching lambdas, Optical ( t − 2002) # λ ≈ 200 ∗ e ethernet- switching sdh rtt

  15. (9 of 12) Current technology + (re)definition λ • Current (to me) available technology consists of SONET/SDH switches, 10 gig ethernet and dark fiber environments • Optical switch installed (this week)! • DWDM+switching included • Starlight/NetherLight deploy VLAN’s on Ethernet switches to connect [exactly two] ports (but also routing) • We want to understand routerless limited environments • So redefine a λ as: “a λ is a pipe where you can inspect packets as they enter and when they exit, but principally not when in transit. In transit one only deals with the parameters of the pipe: number, color, bandwidth”

  16. (9a of 12) MEMS optical switch (CALIENT) λ

  17. (10 of 12) So what are the facts λ • Costs of fat pipes (fibers) are one/third of cost of equipment to light them up – Is what Lambda salesmen tell me • Costs of optical equipment 10% of switching 10 % of full routing equipment for same throughput – 100 Byte packet @ 40 Gb/s -> 20 ns to look up in 140 kEntries routing table (light speed from me to you!) • Big sciences need fat pipes • Bottom line: look for a hybrid architecture which serves all users in a cost effective way

  18. (10b of 13) Architectures - L1 - L3 R Internet λ R L2 VPN’s Long haul λ SW Internet TDM R R

  19. (11 of 14) High bandwidth app Application Application Middleware Middleware Transport Transport λ Switch • lambda for high bandwidth 2.5Gb applications lambda Router UvA – Bypass of production network GbE – Middleware may request (optical) ams Router Lambda Lambda pipe SURFnet5 Switch Switch • RATIONALE: Router chi – Lower the cost of transport per GbE packet Router Lambda Lambda 3 rd party Switch carriers Switch Router GbE Router UBC Vancouver Switch

  20. (12 of 15) How low can you go? Local MEMS Application Application Ethernet ONS Endpoint A Endpoint B Regional 15454 POS dark Trans-Atlantic fiber Router NetherLight NetherLight Ethernet SONET DWDM TransLight fiber

  21. (13 of 15) Virtual Organization on L2 λ Univ X Univ A Layer 2 VPN Univ B Univ Y SN5 SN5 CHICAGO A’DAM lambda

  22. (15 of 17) NetherLight Network: 2003 Emerging international lambda grid Stockholm Stockholm New York City Northern Light Northern Light 10 10 Gbit/s Gbit/s Tyco/IEEAF NSF Amsterdam Dwingeloo Amsterdam Dwingeloo NetherLight ASTRON/JIVE NetherLight ASTRON/JIVE 10 Gbit/s DWDM SURFnet SURFnet 10 Gbit/s Chicago NSF Chicago 2.5 Gbit/s StarLight StarLight 10 Gbit/s CESNET SURFnet London Prague London Prague UKLight CzechLight UKLight CzechLight Geneva Geneva CERN CERN Operational 1H03 Expected 2H03 E. Radius, 2 nd e VLBI workshop, Dwingeloo, May 15-16, 2003 22

  23. (16 of 18) NetherLight DAS: 32*2cpu’s IBM Myrinet 1 Gbs 100Mbs SURFnet F E 6509 backbone O X R T C R E E 1 M 10 Gbs 0 E Lambda’s to •Chicago, calient 15454 •Geneve, server •Praha, •NYC Fat pc •London 1 Gbs 4 HP servers Dark fiber To Dwingeloo UvA/NikHEF/SARA

  24. (intermezzo) N e t h e r L i g h t

  25. (17 of 19) λ Early Lambda/LightPath TDM experiences fast L2 L2 slow fast WS WS fast->slow slow->fast high RTT

  26. (17b of 20) λ

  27. (18 of 20) 5000 1 kByte UDP packets λ

  28. (18a of 20) Layer - 2 requirements from 3/4 λ fast L2 L2 slow fast WS WS fast->slow slow->fast high RTT TCP is bursty due to sliding window protocol and slow start algorithm. Window = Window = BandWidth BandWidth * * RTT RTT & & BW BW == == slow slow fast fast - - slow slow Memory-at-bottleneck = Memory-at-bottleneck = ----------- ----------- * * slow slow * * RTT RTT fast fast So pick from menu: •Flow control •Traffic Shaping •RED ( Random Early Discard ) •Self clocking in TCP •Deep memory

  29. Self-clocking of TCP (19 of 20) λ high RTT fast L2 L2 fast WS WS fast->slow slow->fast 14 µsec 20 µsec 20 µsec 20 µsec 20 µsec

  30. (19b of 20) Layer - 2 requirements from 3/4 λ high RTT fast L2 L2 fast WS WS fast->slow slow->fast Window = BandWidth * RTT & BW == slow fast - slow Memory-at-bottleneck = ___________ * slow * RTT fast Given M and f, solve for slow ===> f * M 0 = s 2 - f * s + ______ RTT f M s 1 ,s 2 = ___ ( 1 +/- sqrt( 1 - 4 ________ ) ) 2 f * RTT

  31. (19c of 20) Forbidden area, solutions for s when f = 1 Gb/s, M = 0.5 Mbyte AND NOT USING FLOWCONTROL 158 ms = RTT Amsterdam - Vancouver λ s OC12 OC9 OC6 OC3 OC1 rtt

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend