8.0 引言 8.1 系统的状态空间描述 8.2 状态方程的建立 8.3 连续系统状态方程的解 8.4 离散系统状态方程的解 8.5 系统稳定性判别

4.1 拉普拉斯变换 一、从傅里叶变换到拉普拉斯变换 二、收敛域 三、(单边)拉普拉斯变换 4.2 拉普拉斯变换的性质 4.3 拉普拉斯变换逆变换 4.4 复频域分析 一、微分方程的变换解 二、系统函数 三、系统的s域框图 四、电路的s域模型

assachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6. 111-Introductory Digital Systems Laboratory Project resources Project resources are allocated on a per student basis. This means that a two-person

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6. 111-Introductory Digital Systems Laboratory Project Information Introduction The term project in 6 1 1 1 is your opportunity to specify a small digital system. You will

Data Link Layer (DLC) Responsible for reliable transmission of packets over a link Framing: Determine the start and end of packets(sec 2.5) Error Detection: Determine when a packet contains errors ( sec 2.3) Error recovery: Retransmission of packets containing errors(sec 2. 4) DLC layer recovery May be done at higher layer

Service times Poisson arrivals at rate n Service time has arbitrary distribution with given E[X] and E[X2I Service times are independent and identically distributed (ID) Independent of arrival times E[service time]=1/u Single Server queue

An interesting property of an M/M/ 1 queue, which greatly simplifies combining these queues into a network, is the surprising fact that the output of an M/M/ queue with arrival rate is a Poisson process of rate This is part of Burke's theorem, which follows from reversibility A Markov chain has the property that P[future present, past] P[future present] Conditional on the present state, future states and past states are independent

Multiple Access shared transmission medium a receiver can hear multiple transmitters a transmitter can be heard by multiple receivers the major problem with multi-access is allocating the channel between the users the nodes do not know when the other nodes have data to send Need to coordinate transmissions

Carrier Sense Multiple Access(CSMA) In certain situations nodes can hear each other by listening to the channel “Carrier Sensing CSMA: Polite version of Aloha Nodes listen to the channel before they start transmission Channel idle=> Transmit Channel busy = Wait (join backlog) When do backlogged nodes transmit? When channel becomes idle backlogged nodes attempt transmission with probability q=1 Persistent protocol, q=1 Non-persistent protocol,< 1

Optimal Routing View routing as\global\ optimization problem Assumptions: The cost of using a link is a function of the flow on that link The total network cost is the sum of the link costs The required traffic rate between each source-destination pair is known in advance Traffic between source-destination pair can be split along multiple paths with infinite precision