bon2003 mpls

Information about bon2003 mpls

Published on October 29, 2007

Author: Alien

Source: authorstream.com

Content

ECSE-6660 Label Switching and MPLS:  ECSE-6660 Label Switching and MPLS http://www.pde.rpi.edu/ Or http://www.ecse.rpi.edu/Homepages/shivkuma/ Shivkumar Kalyanaraman Rensselaer Polytechnic Institute [email protected] Based in part on slides from Prof. Raj Jain (OSU) , Kireeti Kompella, Juniper networks, Peter Ashwood-Smith and Bilel Jamoussi (Nortel Networks), Slide2:  IP-over-ATM to MPLS: History of IP Switching MPLS: generalization of labels, de-coupling of control plane Label distribution/setup protocols: RSVP, LDP Introduction to Traffic Engineering Overview IP: “Best-Effort Philosophy”:  IP: “Best-Effort Philosophy” Well architected, not necessarily worked out in detail Realization: can’t predict the future Architectural decisions: Make it reasonable Make it flexible Make it extensible stuff above transport network stuff below IP Control Plane Evolution:  IP Control Plane Evolution Again, just good enough (best-effort) … But again, flexible, extensible Distance Vector routing was fine for quite a while Just in time, along came link state (OSPF and IS-IS) Now a burning question in OSPF/IS-IS is: Convergence “in a few seconds” is not good enough? See NANOG June 2002 for interesting videos and papers on how to fix LS-routing for fast convergence Goal: “Business” IP for service providers… Make me money – new services, GoS Don’t lose me money – uptime, SLAs OSPF/BGP not originally designed to support QoS or multiple services (eg: VoIP, VPNs) ATM – Perfectionist’s Dream:  ATM – Perfectionist’s Dream Connection-oriented Does everything and does it well Anticipated all future uses and factored them in Philosophical mismatch with IP stuff above transport network ATM AAL 1 AAL 2 AAL 3/4 AAL 5 Overlay Model for IP-over-ATM Internetworking:  Overlay Model for IP-over-ATM Internetworking Goal: Run IP over ATM core networks Why? ATM switches offered performance, predictable behavior and services (CBR, VBR, GFR…) ISPs created “overlay” networks that presented a virtual topology to the edge routers in their network Using ATM virtual circuits, the virtual network could be reengineered without changing the physical network Benefits Full traffic control Per-circuit statistics More balanced flow of traffic across links Overlay Model (Contd):  Overlay Model (Contd) ATM core ringed by routers PVCs overlaid onto physical network Physical View A B C A B C Logical View Issue 1: Mapping IP data-plane to ATM: Address Resolution Woes!:  Issue 1: Mapping IP data-plane to ATM: Address Resolution Woes! A variety of server-based address resolution servers: ATMARP (RFC 1577), LANE server, BUS server, MPOA server, NHRP server…. Use of separate pt-pt and pt-mpt VCs with servers Multiple servers + backup VCs to them needed for fault tolerance Separate servers needed in every LOGICAL domain (eg: LIS) Mismatch between the notion of IP subnet and ATM network sizing Cut-through forwarding between nodes on same ATM network hard to achieve! Issue 2: Mapping IP control-plane (eg: OSPF) to ATM:  Issue 2: Mapping IP control-plane (eg: OSPF) to ATM Basic OSPF assumes that subnets are pt-pt or offer broadcast capability. ATM is a Non-Broadcast Multiple Access (NBMA) media NBMA “segments” support multiple “routers” with pt-pt VCs but do not support data-link broadcast/mcast capability Each VC is costly => setting up full mesh for OSPF Hello messages is prohibitively expensive! Two “flooding adjacency” models in OSPF: Non-Broadcast Multiple Access (NBMA) model Point-to-Multipoint (pt-mpt) Model Different tradeoffs… Partial Mesh: NBMA model:  Partial Mesh: NBMA model 1. Neighbor discovery: manually configured 2. Dijkstra SPF views NBMA as a full mesh! Partial Mesh: pt-mpt model:  Partial Mesh: pt-mpt model NBMA vs Pt-Mpt Subnet Model:  NBMA vs Pt-Mpt Subnet Model Key assumption in NBMA model: Each router on the subnet can communicate with every other (same as IP subnetmodel) But this requires a “full mesh” of expensive PVCs at the lower layer! Many organizations have a hub-and-spoke PVC setup, a.k.a. “partial mesh” Conversion into NBMA model requires multiple IP subnets, and complex configuration (see fig on next slide) OSPF’s pt-mpt subnet model breaks the rule that two routers on the same network must be able to talk directly Can turn partial PVC mesh into a single IP subnet OSPF Designated Routers (DRs): NBMA Case:  OSPF Designated Routers (DRs): NBMA Case  Instead of sending a separate router-LSA for each router, one “designated router” can create a network-LSA for the subnet OSPF Designated Router (DR): NBMA Case:  OSPF Designated Router (DR): NBMA Case One router elected as a designated router (DR) Each router in subnet maintains “flooding adjacency” with the DR, I.e., sends acks of LSAs to DR DR informs each router of other routers on LAN DR generates the network-LSA on subnet’s behalf after synchronizing with all routers Complex election protocol for DR in case of failure DR and BDR in OSPF NBMA model:  DR and BDR in OSPF NBMA model In NBMA model: DR and BDR only maintain VCs and Hellos with all routers on NBMA Flooding in NBMA always goes through DR Multicast not available to optimize LSA flooding. DR generates network-LSA Summary: IP-to-ATM Overlay Model Drawbacks:  Summary: IP-to-ATM Overlay Model Drawbacks IP-to-ATM: control-plane mapping issues Need a full mesh of ATM PVCs for mapping IP routing Both NBMA and Pt-Mpt mapping models have drawbacks IP-to-ATM: data-plane mapping issues Address resolution (eg: LANE, RFC 1577, MPOA, NHRP) requires a complex distributed server and multicast VC infrastructure Segmentation-and-Reassembly (SAR) of IP packets into ATM cells can have a multiplier-effect on performance even if one cell in a packet is lost ATM SAR has trouble scaling to OC-48 and OC-192 speeds Packet-over-SONET (POS) emerged as an alternative at the link layer ATM + AAL5 overhead (20%) deemed excessive Re-examining Basics: Routing vs Switching:  Re-examining Basics: Routing vs Switching IP Routing vs IP Switching:  IP Routing vs IP Switching MPLS: Best of Both Worlds:  MPLS: Best of Both Worlds PACKET ROUTING CIRCUIT SWITCHING HYBRID Caveat: one cares about combining the best of both worlds only for large ISP networks that need both features! Note: the “hybrid” also happens to be a solution that bypasses IP-over-ATM mapping woes! History: Ipsilon’s IP Switching: Concept:  History: Ipsilon’s IP Switching: Concept Hybrid: IP routing (control plane) + ATM switching (data plane) Ipsilon’s IP Switching:  Ipsilon’s IP Switching ATM VCs setup when new IP “flows” seen, I.e., “data-driven” VC setup Issues with Ipsilon’s IP switching:  Issues with Ipsilon’s IP switching Tag Switching:  Tag Switching Key difference: tags can be setup in the background using IP routing protocols (I.e. control-driven VC setup) Alphabet Soup!:  Alphabet Soup! MPLS working group in IETF was formed to reach a common standard MPLS Broad Concept: Route at Edge, Switch in Core:  MPLS Broad Concept: Route at Edge, Switch in Core IP Forwarding LABEL SWITCHING IP Forwarding IP IP MPLS Terminology:  MPLS Terminology LDP: Label Distribution Protocol LSP: Label Switched Path FEC: Forwarding Equivalence Class LSR: Label Switching Router LER: Label Edge Router (Useful term not in standards) MPLS is “multi-protocol” both in terms of the protocols it supports ABOVE it and BELOW it in the protocol stack! MPLS Header:  MPLS Header IP packet is encapsulated in MPLS header and sent down LSP IP packet is restored at end of LSP by egress router TTL is adjusted by default … IP Packet 32-bit MPLS Header MPLS Label Stack Concept:  MPLS Label Stack Concept Allows nested tunnels, that are opaque, I.e. do not know or care what protocol data they carry (a.k.a multi-protocol) MPLS Header:  MPLS Header Label Used to match packet to LSP Experimental bits Carries packet queuing priority (CoS) Stacking bit: can build “stacks” of labels Goal: nested tunnels! Time to live Copied from IP TTL TTL Label EXP S Multi-protocol operation:  Multi-protocol operation The abstract notion of a “label” can be mapped to multiple circuit- or VC-oriented technologies! ATM - label is called VPI/VCI and travels with cell. Frame Relay - label is called a DLCI and travels with frame. TDM - label is called a timeslot its implied, like a lane. X25 - a label is an LCN Proprietary labels: TAG (in tag switching) etc.. Frequency or Wavelength substitution where “label” is a light frequency/wavelength? (idea in G-MPLS) Label Encapsulation:  Label Encapsulation ATM FR Ethernet PPP MPLS Encapsulation is specified over various media types. Top labels may use existing format, lower label(s) use a new “shim” label format. VPI VCI DLCI “Shim Label” L2 Label “Shim Label” ……. IP | PAYLOAD MPLS Encapsulation - ATM:  MPLS Encapsulation - ATM ATM LSR constrained by the cell format imposed by existing ATM standards VPI PT CLP HEC 5 Octets ATM Header Format VCI AAL5 Trailer ••• Network Layer Header and Packet (eg. IP) 1 n AAL 5 PDU Frame (nx48 bytes) Generic Label Encap. (PPP/LAN format) ATM SAR ATM Header ATM Payload • • • Top 1 or 2 labels are contained in the VPI/VCI fields of ATM header - one in each or single label in combined field, negotiated by LDP Further fields in stack are encoded with ‘shim’ header in PPP/LAN format - must be at least one, with bottom label distinguished with ‘explicit NULL’ TTL is carried in top label in stack, as a proxy for ATM header (that lacks TTL) 48 Bytes 48 Bytes Label Label Option 1 Option 2 Combined Label Option 3 Label ATM VPI (Tunnel) MPLS Encapsulation - Frame Relay:  MPLS Encapsulation - Frame Relay ••• n 1 DLCI C/ R E A DLCI FE CN BE CN D E E A Q.922 Header Generic Encap. (PPP/LAN Format) Layer 3 Header and Packet DLCI Size = 10, 17, 23 Bits Current label value carried in DLCI field of Frame Relay header Can use either 2 or 4 octet Q.922 Address (10, 17, 23 bytes) Generic encapsulation contains n labels for stack of depth n - top label contains TTL (which FR header lacks), ‘explicit NULL’ label value MPLS Encapsulation: PPP & LAN Data Links:  MPLS Encapsulation: PPP & LAN Data Links Label Exp. S TTL Label: Label Value, 20 bits (0-16 reserved) Exp.: Experimental, 3 bits (was Class of Service) S: Bottom of Stack, 1 bit (1 = last entry in label stack) TTL: Time to Live, 8 bits Layer 2 Header (eg. PPP, 802.3) ••• Network Layer Header and Packet (eg. IP) 4 Octets MPLS ‘Shim’ Headers (1-n) 1 n Network layer must be inferable from value of bottom label of the stack TTL must be set to the value of the IP TTL field when packet is first labelled When last label is popped off stack, MPLS TTL to be copied to IP TTL field Pushing multiple labels may cause length of frame to exceed layer-2 MTU - LSR must support “Max. IP Datagram Size for Labelling” parameter - any unlabelled datagram greater in size than this parameter is to be fragmented MPLS on PPP links and LANs uses ‘Shim’ Header Inserted Between Layer 2 and Layer 3 Headers Label Stack Entry Format MPLS Forwarding: Example:  MPLS Forwarding: Example An IP packet destined to 134.112.1.5/32 arrives in SF San Francisco has route for 134.112/16 Next hop is the LSP to New York San Francisco New York Santa Fe 134.112/16 134.112.1.5 1965 1026 0 MPLS Forwarding Example:  MPLS Forwarding Example San Francisco pre-pends MPLS header onto IP packet and sends packet to first transit router in the path San Francisco New York Santa Fe 134.112/16 MPLS Forwarding Example:  MPLS Forwarding Example Because the packet arrived at Santa Fe with an MPLS header, Santa Fe forwards it using the MPLS forwarding table MPLS forwarding table derived from mpls.0 switching table San Francisco New York Santa Fe 134.112/16 MPLS Forwarding Example:  MPLS Forwarding Example Packet arrives from penultimate router with label 0 Egress router sees label 0 and strips MPLS header Egress router performs standard IP forwarding decision San Francisco New York Santa Fe 134.112/16 Label Setup/Signaling: MPLS Using IP Routing Protocols:  Label Setup/Signaling: MPLS Using IP Routing Protocols Regular IP Forwarding:  Regular IP Forwarding 47.1 47.2 47.3 1 2 3 1 2 1 2 3 IP 47.1.1.1 IP 47.1.1.1 IP 47.1.1.1 IP destination address unchanged in packet header! MPLS Label Distribution:  MPLS Label Distribution 47.1 47.2 47.3 1 2 3 1 2 1 2 3 3 Label Switched Path (LSP):  Label Switched Path (LSP) 47.1 47.2 47.3 1 2 3 1 2 1 2 3 3 A General Vanilla LSP:  - A Vanilla LSP is actually part of a tree from every source to that destination (unidirectional). - Vanilla LDP builds that tree using existing IP forwarding tables to route the control messages. A General Vanilla LSP Explicitly Routed (ER-) LSP:  ER-LSP follows route that source chooses. In other words, the control message to establish the LSP (label request) is source routed. A B C Explicitly Routed (ER-) LSP Explicitly Routed (ER-) LSP Contd:  47.1 47.2 47.3 1 2 3 1 2 1 2 3 3 Explicitly Routed (ER-) LSP Contd ER LSP - advantages:  ER LSP - advantages Operator has routing flexibility (policy-based, QoS-based) Can use routes other than shortest path Can compute routes based on constraints in exactly the same manner as ATM based on distributed topology database. (traffic engineering) ER LSP - discord!:  ER LSP - discord! Two signaling options proposed in the standards: CR-LDP, RSVP extensions: CR-LDP = LDP + Explicit Route RSVP ext = Traditional RSVP + Explicit Route + Scalability Extensions Not going to be resolved any time soon, market will probably have to resolve it. Traffic Engineering:  Traffic Engineering TE: “…that aspect of Internet network engineering dealing with the issue of performance evaluation and performance optimization of operational IP networks …’’ Two abstract sub-problems: 1. Define a traffic aggregate (eg: OC- or T-carrier hierarchy, or ATM PVCs) 2. Map the traffic aggregate to an explicitly setup path Cannot do this in OSPF or BGP-4 today! OSPF and BGP-4 offer only a SINGLE path! Why not TE with OSPF/BGP? :  Why not TE with OSPF/BGP? Internet connectionless routing protocols designed to find only one route (path) The “connectionless” approach to TE is to “tweak” (I.e. change) link weights in IGP (OSPF, IS-IS) or EGP (BGP-4) protocols Assumptions: Quasi-static traffic, knowledge of demand matrix Limitations: Performance is fundamentally limited by the single shortest/policy path nature: All flows to a destination prefix mapped to the same path Desire to map traffic to different route (eg: for load-balancing reasons) => the single default route MUST be changed Changing parameters (eg: OSPF link weights) changes routes AND changes the traffic mapped to the routes Leads to extra control traffic (eg: OSPF floods or BGP-4 update message), convergence problems and routing instability! Summary: Traffic mapping coupled with route availability in OSPF/BGP! MPLS de-couples traffic trunking from path setup Traffic Engineering w/ MPLS (Step I):  Traffic Engineering w/ MPLS (Step I) Engineer unidirectional paths through your network without using the IGP’s shortest path calculation San Francisco IGP shortest path traffic engineered path New York Traffic Engineering w/ MPLS (Part II):  Traffic Engineering w/ MPLS (Part II) IP prefixes (or traffic aggregates) can now be bound to MPLE Label Switched Paths (LSPs) San Francisco New York 192.168.1/24 134.112/16 Traffic Aggregates: Forwarding Equivalence Classes:  Traffic Aggregates: Forwarding Equivalence Classes FEC = “A subset of packets that are all treated the same way by a router” The concept of FECs provides for a great deal of flexibility and scalability In conventional routing, a packet is assigned to a FEC at each hop (i.e. L3 look-up), in MPLS it is only done once at the network ingress Packets are destined for different address prefixes, but can be mapped to common path LSR LSR LER LER LSP Signaled TE Approach (eg: MPLS):  Signaled TE Approach (eg: MPLS) Features: In MPLS, the choice of a route (and its setup) is orthogonal to the problem of traffic mapping onto a route Signaling maps global IDs (addresses, path-specification) to local IDs (labels) FEC mechanism for defining traffic aggregates, label stacking for multi-level opaque tunneling Issues: Requires extensive upgrades in the network Hard to inter-network beyond area boundaries Very hard to go beyond AS boundaries (even in same organization) Impossible for inter-domain routing across multiple organizations => inter-domain TE has to be connectionless Hop-by-Hop vs. Explicit Routing:  Hop-by-Hop vs. Explicit Routing Hop-by-Hop Routing Explicit Routing Source routing of control traffic Builds a path from source to dest Requires manual provisioning, or automated creation mechanisms. LSPs can be ranked so some reroute very quickly and/or backup paths may be pre-provisioned for rapid restoration Operator has routing flexibility (policy-based, QoS-based, Adapts well to traffic engineering Distributes routing of control traffic Builds a set of trees either fragment by fragment like a random fill, or backwards, or forwards in organized manner. Reroute on failure impacted by convergence time of routing protocol Existing routing protocols are destination prefix based Difficult to perform traffic engineering, QoS-based routing Explicit routing shows great promise for traffic engineering RSVP: “Resource reSerVation Protocol” :  RSVP: “Resource reSerVation Protocol” A generic QoS signaling protocol An Internet control protocol Uses IP as its network layer Originally designed for host-to-host Uses the IGP to determine paths RSVP is not A data transport protocol A routing protocol RFC 2205 Recall: Signaling ideas:  Recall: Signaling ideas Classic scheme: sender initiated SETUP, SETUP_ACK, SETUP_RESPONSE Admission control Tentative resource reservation and confirmation Simplex and duplex setup; no multicast support RSVP: Internet Signaling:  RSVP: Internet Signaling Creates and maintains distributed reservation state De-coupled from routing & also to support IP multicast model: Multicast trees setup by routing protocols, not RSVP (unlike ATM or telephony signaling) Key features of RSVP: Receiver-initiated: scales for multicast Soft-state: reservation times out unless refreshed Latest paths discovered through “PATH” messages (forward direction) and used by RESV mesgs (reverse direction). Again dictated by needs of de-coupling from IP routing and to support IP multicast model RSVP Path Signaling Example:  RSVP Path Signaling Example Signaling protocol sets up path from San Francisco to New York, reserving bandwidth along the way Miami Seattle San Francisco (Ingress) New York (Egress) RSVP Path Signaling Example:  RSVP Path Signaling Example Once path is established, signaling protocol assigns label numbers in reverse order from New York to San Francisco San Francisco (Ingress) New York (Egress) 1965 1026 3 Miami Seattle Call Admission:  Call Admission Session must first declare its QOS requirement and characterize the traffic it will send through the network R-spec: defines the QOS being requested T-spec: defines the traffic characteristics A signaling protocol is needed to carry the R-spec and T-spec to the routers where reservation is required; RSVP is a leading candidate for such signaling protocol Call Admission:  Call Admission Call Admission: routers will admit calls based on their R-spec and T-spec and base on the current resource allocated at the routers to other calls. Summary: Basic RSVP Path Signaling:  Summary: Basic RSVP Path Signaling Reservation for simplex (unidirectional) flows Ingress router initiates connection “Soft” state Path and resources are maintained dynamically Can change during the life of the RSVP session Path message sent downstream Resv message sent upstream MPLS Extensions to RSVP:  MPLS Extensions to RSVP Path and Resv message objects Explicit Route Object (ERO) Label Request Object Label Object Record Route Object Session Attribute Object Tspec Object For more detail on contents of objects: daft-ietf-mpls-rsvp-lsp-tunnel-04.txt Extensions to RSVP for LSP Tunnels Explicit Route Object:  Explicit Route Object Used to specify the explicit route RSVP Path messages take for setting up LSP Can specify loose or strict routes Loose routes rely on routing table to find destination Strict routes specify the directly-connected next router A route can have both loose and strict components ERO: Strict Route:  ERO: Strict Route A F E D C B Ingress LSR Egress LSR Next hop must be directly connected to previous hop Strict ERO: Loose Route:  ERO: Loose Route A F E D C B Egress LSR Consult the routing table at each hop to determine the best path: similar to IP routing option concept Ingress LSR Loose ERO: Strict/Loose Path:  ERO: Strict/Loose Path A F E D C B Egress LSR Strict and loose routes can be mixed Ingress LSR Strict Loose Label Objects:  Label Objects Label Request Object Added to PATH message at ingress LSR Requests that each LSR provide label to upstream LSR Label Object Carried in RESV messages along return path upstream Provides label to upstream LSR Record Route Object— PATH Message:  Record Route Object— PATH Message Added to PATH message by ingress LSR Adds outgoing IP address of each hop in the path In downstream direction Loop detection mechanism Sends “Routing problem, loop detected” PathErr message Drops PATH message Session Attribute Object:  Session Attribute Object Added to PATH message by ingress router Controls LSP Priority Preemption Fast-reroute Identifies session ASCII character string for LSP name Adjacency Maintenance—Hello Message:  Adjacency Maintenance—Hello Message New RSVP extension: leverage RSVP for hellos! Hello message Hello Request Hello Acknowledge Rapid node to node failure detection Asynchronous updates 3 second default update timer 12 second default dead timer Path Maintenance — Refresh Messages:  Path Maintenance — Refresh Messages Maintains reservation of each LSP Sent every 30 seconds by default Consists of PATH and RESV messages RSVP Message Aggregation:  RSVP Message Aggregation Bundles up to 30 RSVP messages within single PDU Controls Flooding of PathTear or PathErr messages Periodic refresh messages (PATH and RESV) Enhances protocol efficiency and reliability Disabled by default Traffic Engineering: Constrained Routing:  Traffic Engineering: Constrained Routing Signaled vs Constrained LSPs :  Signaled vs Constrained LSPs Common Features Signaled by RSVP MPLS labels automatically assigned Configured on ingress router only Signaled LSPs CSPF not used (I.e. normal IP routing is used) User configured ERO handed to RSVP for signaling RSVP consults routing table to make next hop decision Constrained LSPs CSPF used Full path computed by CSPF at ingress router Complete ERO handed to RSVP for signaling Constrained Shortest Path First Algorithm:  Constrained Shortest Path First Algorithm Modified “shortest path first” algorithm Finds shortest path based on IGP metric while satisfying additional QoS constraints Integrates TED (Traffic Engineering Database) IGP topology information Available bandwidth Link color Modified by administrative constraints Maximum hop count Bandwidth Strict or loose routing Administrative groups Computing the ERO:  Computing the ERO Ingress LSR passes user defined restrictions to CSPF Strict and loose hops Bandwidth constraints Admin Groups CSPF algorithm Factors in user defined restrictions Runs computation against the TED Determines the shortest path CSPF hands full ERO to RSVP for signaling Summary: Key Benifits of MPLS:  Summary: Key Benifits of MPLS Goal: Low-overhead virtual circuits for IP Originally designed to make routers faster by leveraging ATM switch cores (bypasses IP-over-ATM overlay problems) Fixed label lookup faster than longest match used by IP routing Caveat: Not true anymore! IP forwarding has broken terabit/s speeds through innovative data-structures (next class) ! PPP-over-SONET (POS) provides a link layer! Value of MPLS is now purportedly in “traffic engineering” Same forwarding mechanism can support multiple new services (eg: VoIP, VPNs etc) Allows network resource optimization at the level of routing (eg: constrained based routing) Allow survivability and fast-reroute features… Can be generalized for optical networks (G-MPLS)

Related presentations


Other presentations created by Alien

Physical Security Lecture
05. 01. 2008
0 views

Physical Security Lecture

GREEK THEATRE
15. 10. 2007
0 views

GREEK THEATRE

Singapore National Symbols
14. 09. 2007
0 views

Singapore National Symbols

Origins of the Cold War
23. 12. 2007
0 views

Origins of the Cold War

CG43SlideSet
30. 04. 2008
0 views

CG43SlideSet

kaiser pres
28. 04. 2008
0 views

kaiser pres

GoldDifferences
22. 04. 2008
0 views

GoldDifferences

visn8
17. 04. 2008
0 views

visn8

Nov24 Regulatory approaches
16. 04. 2008
0 views

Nov24 Regulatory approaches

dr rom
14. 04. 2008
0 views

dr rom

file 6943
13. 04. 2008
0 views

file 6943

The Peak Oil Context Tom Petrie
10. 04. 2008
0 views

The Peak Oil Context Tom Petrie

H106g
09. 04. 2008
0 views

H106g

JapaneseGeography
07. 04. 2008
0 views

JapaneseGeography

Hamburg 2007
14. 09. 2007
0 views

Hamburg 2007

lfg
14. 09. 2007
0 views

lfg

Eddie Final Presentation
14. 09. 2007
0 views

Eddie Final Presentation

chalmers
14. 09. 2007
0 views

chalmers

The Rain Forest Final
14. 09. 2007
0 views

The Rain Forest Final

ECAKnowledgeFair
12. 10. 2007
0 views

ECAKnowledgeFair

Ch18part1
15. 10. 2007
0 views

Ch18part1

WNV AVB 02212006
21. 10. 2007
0 views

WNV AVB 02212006

giraffe pp
14. 09. 2007
0 views

giraffe pp

giraffe powerpoint
14. 09. 2007
0 views

giraffe powerpoint

giraffe
14. 09. 2007
0 views

giraffe

COOL STUFF ABOUT GIRAFFES
14. 09. 2007
0 views

COOL STUFF ABOUT GIRAFFES

ub041104
23. 10. 2007
0 views

ub041104

STORY OF THEME AND PLOT
23. 10. 2007
0 views

STORY OF THEME AND PLOT

PhiladelphiaZooPPP
14. 09. 2007
0 views

PhiladelphiaZooPPP

qu10 11
01. 12. 2007
0 views

qu10 11

Angelos CME Energetics
02. 11. 2007
0 views

Angelos CME Energetics

pptPanama s
22. 10. 2007
0 views

pptPanama s

hirotani
13. 11. 2007
0 views

hirotani

PROF AZZA
23. 10. 2007
0 views

PROF AZZA

Fenton
29. 10. 2007
0 views

Fenton

Countering Offshore
29. 12. 2007
0 views

Countering Offshore

walters082902
23. 11. 2007
0 views

walters082902

razbash
26. 11. 2007
0 views

razbash

DVMRPandMOSPF
01. 01. 2008
0 views

DVMRPandMOSPF

One 783Ngupta
04. 01. 2008
0 views

One 783Ngupta

Chapter 18 PPT
22. 10. 2007
0 views

Chapter 18 PPT

History of NAIS John Wiemers
20. 08. 2007
0 views

History of NAIS John Wiemers

BSP2D
14. 09. 2007
0 views

BSP2D

costarica1 ftparraud
22. 10. 2007
0 views

costarica1 ftparraud

mcmc2000a
06. 11. 2007
0 views

mcmc2000a

050317lc
16. 11. 2007
0 views

050317lc

ALA2003 OAI
04. 10. 2007
0 views

ALA2003 OAI

fwing
22. 10. 2007
0 views

fwing

acute 060727 transfusionmed
23. 10. 2007
0 views

acute 060727 transfusionmed

bckexpk3b
09. 07. 2007
0 views

bckexpk3b

anorexia
09. 07. 2007
0 views

anorexia

070207 Adjektiv
09. 07. 2007
0 views

070207 Adjektiv

A Brachmann
09. 10. 2007
0 views

A Brachmann

mueller jun07
19. 10. 2007
0 views

mueller jun07

Late Classic Maya Collapse
16. 02. 2008
0 views

Late Classic Maya Collapse

ISLAS GALAPAGOS
14. 09. 2007
0 views

ISLAS GALAPAGOS

Heatingoilwebsection ppp
24. 02. 2008
0 views

Heatingoilwebsection ppp

PIndustrialTrucks
26. 02. 2008
0 views

PIndustrialTrucks

ethanap
14. 09. 2007
0 views

ethanap

Propulsion CEV
07. 11. 2007
0 views

Propulsion CEV

MichelleWatt
20. 02. 2008
0 views

MichelleWatt

newsletterfall04
11. 03. 2008
0 views

newsletterfall04

EC T9 2008 Conference Proposal
12. 03. 2008
0 views

EC T9 2008 Conference Proposal

drugstatistics
17. 12. 2007
0 views

drugstatistics

icfa chep06
23. 10. 2007
0 views

icfa chep06

Hubert CW8
14. 09. 2007
0 views

Hubert CW8

A mi Papi 2089
19. 06. 2007
0 views

A mi Papi 2089

An ode to Mothers
19. 06. 2007
0 views

An ode to Mothers

LoffPresentation
17. 10. 2007
0 views

LoffPresentation

Maschera
19. 06. 2007
0 views

Maschera

manual
19. 06. 2007
0 views

manual

Luces De Navidad 1848
19. 06. 2007
0 views

Luces De Navidad 1848

leer
19. 06. 2007
0 views

leer

Lean Six SigmaATL011706
19. 06. 2007
0 views

Lean Six SigmaATL011706

lexisnexis
05. 10. 2007
0 views

lexisnexis

OAT Presentation v5
19. 06. 2007
0 views

OAT Presentation v5

moscatelli
19. 06. 2007
0 views

moscatelli

moon split
19. 06. 2007
0 views

moon split

money plus
19. 06. 2007
0 views

money plus

MKCL
19. 06. 2007
0 views

MKCL

Journey of the Spirit Lesson 6
01. 10. 2007
0 views

Journey of the Spirit Lesson 6

2 Jornada BISHOP
10. 10. 2007
0 views

2 Jornada BISHOP

No esperes
19. 06. 2007
0 views

No esperes

Amores locos 1992
19. 06. 2007
0 views

Amores locos 1992

College English book 2 Unit 7
24. 02. 2008
0 views

College English book 2 Unit 7

A vista de pajaro II 2109
19. 06. 2007
0 views

A vista de pajaro II 2109

Ammosov Vladimir ammosov pra
12. 10. 2007
0 views

Ammosov Vladimir ammosov pra

Amber la mejor de todas
19. 06. 2007
0 views

Amber la mejor de todas

CP317 lecture 6 Huck II 05
11. 12. 2007
0 views

CP317 lecture 6 Huck II 05

AHQA031204Mck
09. 07. 2007
0 views

AHQA031204Mck

Evergreen
03. 01. 2008
0 views

Evergreen

04 NJIT3
02. 01. 2008
0 views

04 NJIT3

Poster A4 Glasgow nov04
04. 10. 2007
0 views

Poster A4 Glasgow nov04

Ally McBeal
09. 07. 2007
0 views

Ally McBeal

sara paige
14. 09. 2007
0 views

sara paige

36181003
24. 10. 2007
0 views

36181003

MusicApprecBaroque 2
22. 11. 2007
0 views

MusicApprecBaroque 2

ELE386 Malware
20. 08. 2007
0 views

ELE386 Malware

RohanShah
12. 10. 2007
0 views

RohanShah

1022MAS net big picture
03. 01. 2008
0 views

1022MAS net big picture

Lo Suficiente 1744
19. 06. 2007
0 views

Lo Suficiente 1744

gm3 jp item14 Mangrove ITTO
22. 10. 2007
0 views

gm3 jp item14 Mangrove ITTO

2005AuditResults
09. 07. 2007
0 views

2005AuditResults

HABIC1 summary
17. 11. 2007
0 views

HABIC1 summary

aro ald informalsession
24. 10. 2007
0 views

aro ald informalsession

etu ambassadeurs juin 07 en
13. 03. 2008
0 views

etu ambassadeurs juin 07 en

Gobert poster
03. 10. 2007
0 views

Gobert poster

Kistenev
15. 11. 2007
0 views

Kistenev

6 History of Chemistry I
12. 10. 2007
0 views

6 History of Chemistry I

Jan2000report
04. 01. 2008
0 views

Jan2000report

course 4
03. 01. 2008
0 views

course 4