Broadcast Routing Route a packet from a source to all nodes in the network Possible solutions: – Flooding: Each node sends packet on all outgoing links Discard packets received a second time – Spanning Tree Routing: Send packet along a tree that includes all of the nodes in the network

Routing Must choose routes for various origin destination pairs (O/D pairs) or for various sessions – Datagram routing: route chosen on a packet by packet basis Using datagram routing is an easy way to split paths – Virtual circuit routing: route chosen a session by session basis

Background Developed over the last 25 years- Brandt (1973) published first paper with practical results Offers the possibility of solving a problem with work and storage proportional to the number of unknowns Well developed for linear elliptic problems application to other equations is still an active area of research

Responsible for reliable transmission of packets over a link – Framing: Determine t he star t and end of packets (sec 2.5) – Error Detection: Determine w hen a packet contains errors (sec 2.3) – Error recovery: Retransmissio n of packets containing errors (sec 2..4)

1 Model problem 1.1 Poisson Equation in 1D Boundary Value Problem(BVP) (x)=∫(x) (0,1),u(0)=(1)=0,f Describes many simple physical phenomena(e.g) Deformation of an elastic bar Deformation of a string under tension Temperature distribution in a bar The Poisson equation in one dimension is in fact an ordinary differ tion. When dealing with ordinary differential equations we Poisson equation will be used here to illastrate numerical techniques for elliptic PDE's in multi-dimensions. Other techniques specialized for ordinary differen tial equations could be used if we were only interested in the one dimension

Despite its apparent simplicity this equation appears in a wide range of dis m heat 7 to financial er we will make extensive use of this equation, and several of the limiting cases contained therein, to illustrate the numerical techniques that will be presented

())/0=),6()/+2g= edrhugdr)/2M),oxdx) o: Elex Enwk'< uz=x), a(z qurgdiea= uuv y= adwvopu)z(o j): ac=2 Ghwceo(udo: 2M( Hw(uy 0: w cloks rE o Chu Tnr(i b)iwgiffadu cu wa rdo h ouno pk- which wite pexy a ca)=dre halfan a)+x=gub)whwxppdpxiv z=ioy u)udre Wwv ay co)(igad )o)a)i o u v( wh

Poisson Equation in 1D Model Problem Boundary Value Problem(BVP) Wra(ac)= f(a) N1 x∈(0,1),w(0)=(1)=0,f∈C0N2 Describes many simple physical phen

1 Motivation The Poisson problem has a strong formulation a minimization formulation and a weak formulation T weak formulations are more general than the strong formulation in terms of regularity and admissible data SLIDE 2 The minimization/weak formulations are defined by: a space X; a bilinear The minimization/weak formulations identify ESSENTIAL boundary conditions NATURAL boundary conditions ed in a The points of departure for the finite element method are the weak formulation(more generally) the minimization statement (if a is SPD) 2 The dirichlet problem 2.1 Strong Formulation Find u such that

In this lecture, we will revisit the application of Newton's second law to a system of particles and derive some useful relationships expressing the conservation of angular momentum. Center of Mass Consider a system made up of n particles. A typical particle, i, has mass mi, and, at the instant considered, occupies the position Ti relative to a frame xyz. We can then define the center of mass, G, as the point