EROSPACE DYNAMiCS EXAMPLE: GWE ACCELERATIoN of THE TIP 0F认ERU0毛R人TM5Hc人AF LDk小 G For A650LUT # CCELER升T10 N UTH RES/∈ct T0wE工NERT1 AL FRAME (∈ TH IN THiS CASE) 0EFNE兵8uNcH0 f PoINTS

EROSPACE DYNAMiCS EXAMPLE: GWE ACCELERATIoN of THE TIP 0F认ERU0毛R人TM5Hc人AF LDk小 G For A650LUT # CCELER升T10 N UTH RES/∈ct T0wE工NERT1 AL FRAME (∈ TH IN THiS CASE) 0EFNE兵8uNcH0 f PoINTS

where f:R\×Rn×R→ R\ and g:R\×R\×R→ R are continuous functions. Assume that f, g are continuously differentiable with respect to their first two arguments in a neigborhood of the trajectory co(t), yo(t), and that the derivative

with x(0)=I exist and are unique on the time interval t E [ 0, 1] for allTER\.Then discrete time system(4. 1)with f(5)=r(, i)describes the evolution of continuous time system(4.)at discrete time samples. In particular, if a is continuous then so is f Let us call a point in the closure of X locally attractive for system(4. 1)if there exists

3.1.2 A general uniqueness theorem The key issue for uniqueness of solutions turns out to be the maximal slope of a=a(a) to guarantee uniqueness on time interval T=[to, t,, it is sufficient to require existence of a constant M such that

Cyclic Codes a cyclic code is a linear block code where if c is a codeword, so are all cyclic shifts of c E.g., 1000, 110, 101,011 is a cyclic code Cyclic codes can be dealt with in the very same way as all other lbc s Generator and parity check matrix can be found a cyclic code can be completely described by a generator string G All codewords are multiples of the generator string In practice, cyclic codes are often used for error detection(CRc) Used for packet networks When an error is detected by the received, it requests retransmission

CSMA/CD and Ethernet Two way cable wsws Ws W CSMA with Collision Detection(CD)capability Nodes able to detect collisions Upon detection of a collision nodes stop transmission Reduce the amount of time wasted on collisions Protocol

The TCP/P Protocol Suite Transmission Control Protocol Internet protocol Developed by darPa to connect Universities and Research Labs Four Layer model Applications Telnet, FTP, email, etc Transport TCP, UDP Network IP ICMP, IGMP Link

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 Static routing: route chosen in a prearranged way based on O/D pairs Eytan Modiano

Used for analyzing network performance In packet networks, events are random Random packet arrivals Random packet lengths While at the physical layer we were concerned with bit-error-rate, at the network layer we care about delays How long does a packet spend waiting in buffers?