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

science science uva uva nl nl delaat delaat cees de laat
SMART_READER_LITE
LIVE PREVIEW

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.


slide-1
SLIDE 1

λ

High Performance Networking for Grid Applications

Cees de Laat

www.science. www.science.uva uva.nl nl/~ /~delaat delaat

(0 of 12)

slide-2
SLIDE 2

λ

High Performance Networking for Grid Applications

EU

SURFnet

University of Amsterdam

SARA

NIKHEF NCF

Cees de λaat Cees de Laat

www.science. www.science.uva uva.nl nl/~ /~delaat delaat www.science. www.science.uva uva.nl nl/~ /~de deλaat aat

(1 of 12)

slide-3
SLIDE 3

λ

Contents of this talk

This slide is intentionally left blank

slide-4
SLIDE 4

λ

eVLBI

(1 of 12)

slide-5
SLIDE 5

λ

VLBI

(2 of 12)

slide-6
SLIDE 6
  • 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!)

iGrid 2002 September 24-26, 2002, Amsterdam, The Netherlands

www.igrid2002.org (3 of 12)

slide-7
SLIDE 7

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 (3b of 12)

slide-8
SLIDE 8

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.

(3c of 12)

slide-9
SLIDE 9

λ

BW requirements #

u s e r s

C A B

ADSL GigE

F(t)

  • A. Lightweight users, browsing, mailing, home use

Need full Internet routing, one to many

  • B. Business applications, multicast, streaming, VPN’s, mostly LAN

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 (4a of 12)

slide-10
SLIDE 10

λ

BW requirements #

u s e r s

C A B

ADSL GigE

F(t)

  • A. Lightweight users, browsing, mailing, home use

Need full Internet routing, one to many

  • B. Business applications, multicast, streaming, VPN’s, mostly LAN

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 (4b of 12)

slide-11
SLIDE 11

λ

Scale 2-20-200

(5 of 12)

slide-12
SLIDE 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 and the formula reduces to:

# λ ≈ 200∗ e(t −2002) rtt

(6 of 12)

slide-13
SLIDE 13

λ

dummy d

SURFnet Lambda’s fibers (old already)

(7 of 12)

slide-14
SLIDE 14

λ

Services

Sub- lambdas, ethernet- sdh Lambda switching dark fiber Optical switching C Routing VPN’s Routing VPN’s, (G)MPLS B ROUTER$ Routing Switching/ routing A 200 World 20 National/ regional 2 Metro

#λ ≈ 200∗ e

(t−2002)

rtt

(8 of 12)

SCALE CLASS

slide-15
SLIDE 15

λ

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

  • nly deals with the parameters of the pipe: number, color,

bandwidth”

(9 of 12)

slide-16
SLIDE 16

λ

MEMS optical switch (CALIENT)

(9a of 12)

slide-17
SLIDE 17

λ

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

(10 of 12)

slide-18
SLIDE 18

λ

R

Architectures - L1 - L3

R R R SW

L2 VPN’s Internet Internet

TDM Long haul λ

(10b of 13)

slide-19
SLIDE 19

λ

  • lambda for high bandwidth

applications

– Bypass of production network – Middleware may request (optical) pipe

  • RATIONALE:

– Lower the cost of transport per packet

Application Middleware Transport Application Middleware Transport

Router Router

UvA

Router Router

3rd party carriers

Router

ams chi SURFnet5 UBC Vancouver

Switch

GbE GbE GbE 2.5Gb lambda Lambda Switch Lambda Switch Lambda Switch Lambda Switch Switch Router

High bandwidth app

(11 of 14)

slide-20
SLIDE 20

How low can you go?

Router Ethernet SONET DWDM fiber

Application Endpoint A Application Endpoint B Regional dark fiber MEMS POS ONS 15454

TransLight

Trans-Atlantic Local Ethernet

NetherLight

(12 of 15)

NetherLight

slide-21
SLIDE 21

λ

Virtual Organization on L2

lambda SN5 A’DAM Univ A SN5 CHICAGO Univ B Univ X Univ Y Layer 2 VPN

(13 of 15)

slide-22
SLIDE 22

22

  • E. Radius, 2nd eVLBI workshop, Dwingeloo, May 15-16, 2003

NetherLight Network: 2003

Emerging international lambda grid

10 Gbit/s NSF 10 Gbit/s SURFnet 10 Gbit/s SURFnet 10 Gbit/s Tyco/IEEAF DWDM SURFnet

Geneva

CERN

Geneva

CERN

Dwingeloo

ASTRON/JIVE

Dwingeloo

ASTRON/JIVE

Prague

CzechLight

Prague

CzechLight 2.5 Gbit/s CESNET 10 Gbit/s NSF New York City

Chicago

StarLight

Chicago

StarLight

Amsterdam

NetherLight

Amsterdam

NetherLight

London

UKLight

London

UKLight

Stockholm

Northern Light

Stockholm

Northern Light Operational 1H03 Expected 2H03

(15 of 17)

slide-23
SLIDE 23

E X T R E M E F O R C E 1 Fat pc 15454 6509

DAS: 32*2cpu’s IBM Myrinet 1 Gbs 100Mbs 10 Gbs 4 HP servers

server

calient SURFnet backbone

Lambda’s to

  • Chicago,
  • Geneve,
  • Praha,
  • NYC
  • London

Dark fiber To Dwingeloo

1 Gbs

NetherLight UvA/NikHEF/SARA

(16 of 18)

slide-24
SLIDE 24

N e t h e r L i g h t

(intermezzo)

slide-25
SLIDE 25

λ

Early Lambda/LightPath TDM experiences

(17 of 19)

WS WS L2 fast->slow L2 slow->fast fast fast high RTT slow

slide-26
SLIDE 26

λ

(17b of 20)

slide-27
SLIDE 27

λ

5000 1 kByte UDP packets

(18 of 20)

slide-28
SLIDE 28

λ

Layer - 2 requirements from 3/4

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

WS WS L2 fast->slow L2 slow->fast fast fast high RTT slow

(18a of 20)

slide-29
SLIDE 29

λ

Self-clocking of TCP

WS WS L2 fast->slow L2 slow->fast fast fast high RTT

20 µsec 14 µsec 20 µsec 20 µsec 20 µsec

(19 of 20)

slide-30
SLIDE 30

λ

Layer - 2 requirements from 3/4

Window = BandWidth * RTT & BW == slow fast - slow Memory-at-bottleneck = ___________ * slow * RTT fast Given M and f, solve for slow ===> f * M 0 = s2 - f * s + ______ RTT f M s1,s2 = ___ ( 1 +/- sqrt( 1 - 4 ________ ) ) 2 f * RTT WS WS L2 fast->slow L2 slow->fast fast fast high RTT

(19b of 20)

slide-31
SLIDE 31

λ

Forbidden area, solutions for s when f = 1 Gb/s, M = 0.5 Mbyte AND NOT USING FLOWCONTROL s rtt

158 ms = RTT Amsterdam - Vancouver

OC12 OC9 OC6 OC3 OC1

(19c of 20)

slide-32
SLIDE 32

Problem Solving Environment Applications and Supporting Tools Application Development Support

Common Grid Services Local Resources

Grid Information Service Uniform Resource Access Brokering Global Queuing Global Event Services Co- Scheduling Data Cataloguing Uniform Data Access Communicatio n Services Authorization Grid Security Infrastructure (authentication, proxy, secure transport) Auditing Fault Management Monitoring Communication Resource Manager CPUs Resource Manager Tertiary Storage Resource Manager On-Line Storage Resource Manager Scientific Instruments Resource Manager Monitors Resource Manager Highspeed Data Transport Resource Manager net QoS layers of increasing abstraction taxonomy Grid access (proxy authentication, authorization, initiation) Grid task initiation

Collective Grid Services Fabric

Data Replication High performance computing and Processor memory co-allocation Security and Generic AAA Optical Networking Researched in other programlines Imported from the Globus toolkit

(19d of 20)

slide-33
SLIDE 33

λ

Generic AAA server Rule based engine Application Specific Module

Policy Data 2 1 1 3

Service

5

Starting point PDP PEP

4

Accounting Metering

3 4’ 5 Acct Data

API

Policy Data 3

RFC 2903 - 2906 , 3334 , policy draft

(19e of 20)

slide-34
SLIDE 34

λ

Multi domain case

(19f of 20)

slide-35
SLIDE 35

λ

(Future) Projects

  • National:
  • NCF Grid project
  • VLE
  • GigaPort-NG
  • LOFAR
  • European
  • DataGrid
  • DataTAG
  • International
  • NetherLight
  • StarLight
  • AnyLight, LowLight, BackLight
  • Optiputer

(19g of 20)

Research: Models of Lambda networking Transport AAA

slide-36
SLIDE 36

λ

Transport in the corners

BW*RTT # FLOWS For what current Internet was designed Needs more App & Middleware interaction

C A B

Full optical future

?

(19h of 20)

slide-37
SLIDE 37

λ

The END

(21 of 21)

Thanks to

SURFnet: Kees Neggers,UIC&iCAIR: Tom DeFanti, Joel Mambretti, CANARIE: Bill St. Arnaud

This work is supported by:, SURFnet, EU-IST project DATATAG