Compen/EE 362
Asst. 3 Solution
Spring 2011
Problem 1. A radio signal in free space has its power reduced in
proportion to the inverse of the square of the distance from the
antenna. Note that this is not the same attenuation behavior as
propagation over a
Broadband wireless IEEE Standard 802.16.
High rate from network to/from home/office.
Differences from 802.11 objectives:
Non-mobile + 4G mobile, Fixed wireless
Full Duplex
Longer distances
Support voice, television, streamed data
services, more users.
Sho
Compen/EE 362
Asst. 6 Solution.
Fall 2010
Problem 1. Three stations, A, B and C, are attached to a common cable as shown. The stations are using CSMA/CD. Propagation times (one way) are shown.
a) Draw a space-time diagram with time going down vertically,
Spatially Distributed
Queues II
M/G/1
2 Servers
N servers: Hypercube Queueing Model
Approximations
Setup: Hypercube
Queueing Model
Region comprised of geographical atoms
or nodes
Each node j is an independent Poisson
generator, with rate j
Travel times: i
Networks: Lecture 1
Amedeo R. Odoni
November 15, 2006
* Thanks to Prof. R. C. Larson for
some of the slides
General Comments
From continuous to a more discretized travel
environment
Enormous literature and variety of problems
Transportation
Spatially Distributed
Queues
M/G/1
2 Servers
N servers
Approximations
Why Spatial Queues?
Demand responsive transportation systems
Organ donation queues
Warehouses
Supply chains
Cell phone systems
People waiting to be evacuated in a
hurricane
M/G/1
Direct
1.203J, 6.281J, 15.073J, 16.76J, etc.
Logistical and Transportation Planning Methods
Some Important Heuristics for the TSP
We summarize below some of the principal characteristics of a number of
the best-known heuristic algorithms for the TSP. The worst-c
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
Chapter 3
Power Factor and Measures of
Distortion
Read Chapter 3 of Principles of Po
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
Chapter 5
Introduction to DC/DC
Converters
Analysis techniques: Average KVL, KCL, P.
Networks: Lecture 2
Amedeo R. Odoni
November 20, 2006
Outline
Generic heuristics for the TSP
Euclidean TSP: tour construction, tour
improvement, hybrids
Worst-case performance
Probabilistic analysis and asymptotic result
for Euclidean TSP [Separat
Queueing Systems: Lecture 6
Amedeo R. Odoni
November 6, 2006
Lecture Outline
Congestion pricing in transportation: the
fundamental ideas Congestion pricing and queueing theory Numerical examples A real example from LaGuardia Airport Practical c
Fall 2006
Urban OR (1.203J/6.281J/etc.)
Congestion Pricing and Queueing Theory
Congestion Pricing
Congestion costs due to any specific user have 2 components:
(1) Cost of delay to that user (internal)
(2) Cost of delay to all other users caused by that
Queueing Systems: Lecture 3
Amedeo R. Odoni
October 18, 2006
Announcements
PS #3 due tomorrow by 3 PM
Office hours Odoni: Wed, 10/18, 2:30-4:30;
next week: Tue, 10/24
Quiz #1: October 25, open book, in class;
options: 10-12 or 10:30-12:30
Old quiz
Queueing Systems: Lecture 4
Amedeo R. Odoni
October 20, 2006
Lecture Outline
M/G/1: a simple example
Introduction to systems with priorities
Representation of a priority queuing system
The M/G/1 non-preemptive priority system
An important optimization the
Queueing Systems: Lecture 5
Amedeo R. Odoni
October 30, 2006
Lecture Outline
A fundamental result for queueing networks State transition diagrams for Markovian
queueing systems and networks: examples Examples Dynamic queueing systems and viable a
Announcements
PS #3 out this afternoon
Queueing Systems: Lecture 1
Amedeo R. Odoni
October 4, 2006
Due: October 19 (graded by 10/23)
Office hours Odoni: Mon. 2:30-4:30
- Wed. 2:30-4:30 on Oct. 18 (No office hrs 10/16)
_ Or send me a message
Quiz #
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
Chapter 4
Phase-controlled Rectifiers
Read Chapter 5 of "Principles of Power Electro
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
Problem Set ff5
Issued: November 8,2006
Due: November 20,2006
Problem 1
Consider a I-mile-by-Smile h ~ o p e o sertice regon s e n d by two mobile patrollin3
u~
sewers as shown i Figure I. H m are the asswnptiom ofthe model:
n
1. Cwtoener locations are u
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
Urban OR
Fall 2006
Problem Set 6
(Due: Wednesday, December 6, 2006)
Problem 1
Problem 6.6 in Larson and Odoni
Problem 2
Exercise 6.7 (page 442) in Larson and Odoni.
Problem 3
Suppose we have a network G(N, A) such as the one pictured in Figure 1, which ca
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
Chapter 2
Introduction to Rectiers
Read Chapter 3 of Principles of Power Electronics
Urban OR
Fall 2006
Problem Set 4
(Due: Wednesday, November 8, 2006)
Problem 1 [This is a review problem on M/G/1 queues. We have already done the first
four parts in class, as an example.]
Consider a single-server queueing system with infinite queue capa
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.
Urban OR
Fall 2006
Problem Set 3
(Due: Thursday, October 19, 2006)
[Please note: Despite including seven problems, this assignment is not a long one. Most
of the problems, with the possible exception of Problem 3, do not require much in terms
of mathemat
1.203J / 6.281J / 13.665J / 15.073J / 16.76J / ESD.216J
Logistical and Transportation Planning Methods
Problem Set #1
Issued: September 11, 2006
Due: September 20, 2006
Problem 1
Two-horse race
Consider a long-distance, two-horse race between horses A and
1.203J / 6.281J / 13.665J / 15.073J / 16.76J / ESD.216J
Logistical and Transportation Planning Methods
Problem Set #2
Issued: September 25, 2006
Due: October 4, 2006
Problem 1
Mendel arrives at a random time to ride the Lemon Line, on which the intervals
MIT OpenCourseWare
http:/ocw.mit.edu
6.334 Power Electronics
Spring 2007
For information about citing these materials or our Terms of Use, visit: http:/ocw.mit.edu/terms.