Homework 10 Student: Son Tran ID: 2007-23576 Data Networks Spring 2008
4.13. a) The table similar to the one in Figure 4.9 describing the situation in each collision resolution slot is the following. Slot Xmit Set 1 2 3 4 5 6 7 S L R RL RLL RLR R
Homework 2 Student name: Son Tran () Student ID: 2007-23576 Class: Data Networks - 2008 2.15 - For a given generator polynomial g(D) of degree L and given data length K, let
c (i ) ( D)
( c Li )1 DL
1
. c1(i ) D c0
be the CRC resulting from th
Homework 2 Student name: Son Tran () Student ID: 2007-23576 Class: Data Networks - 2008 2.30 Answer: (a) Stuffed bits are in bold and strikethrough: 011011111000111110101011111011111001111010 (b) Flags are in bold and underlined; stuffed bits are i
THE UNIVERSITY OF WESTERN ONTARIO DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING ECE-433b-COMMUNICATION THEORY EXERCISE # 1 Solutions 1. For k =3 The parity bit b1 is chosen based on m1 to denote modulo-2 addition. Message bits Parity bit Codeword (
THE UNIVERSITY OF WESTERN ONTARIO FACULTY OF ENGINEERING DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING ECE-433b-COMMUNICATION SYSTEMS Exercise-2 [Release Date: January 23, 2007] 1. Show that the final parity check in a horizontal and vertical parit
THE UNIVERSITY OF WESTERN ONTARIO FACULTY OF ENGINEERING DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING ECE-433b-COMMUNICATION SYSTEMS EXERCISE # 2 Solution
1. Let xij be the bit in row i and column j . Then the i horizontal parity check is
th
hi hi
j
xi
THE UNIVERSITY OF WESTERN ONTARIO FACULTY OF ENGINEERING DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING ECE-433b-COMMUNICATION SYSTEMS Exercise-3 (Solutions)
1) Consider the CRC-16 code described by the generator 16 15 2 X X 1 . Using examples demonstrat
THE UNIVERSITY OF WESTERN ONTARIO FACULTY OF ENGINEERING SCIENCE DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING ECE 433b - COMMUNICATION SYSTEMS Exercise # 5 February 20, 2007 Topics covered on February 6, 7, 9, 13, 14, and 16, 2007 Digital Modulation
THE UNIVERSITY OF WESTERN ONTARIO FACULTY OF ENGINEERING DEPARTMENT OF ELECTRICAL & COMPUTER ENGINEERING ECE-433b-COMMUNICATION SYSTEMS Exercise # 5 (Solutions) 1. Given:
erfc( x)
and
2
x
e t dt
2
Q( x)
Let
1 2
e
x
t2 / 2
dt
t 2
z , then dt
2dz and when t
Title: Single-sex schools, they offer no benefits.
Thesis: Over the last ten years, there has been a rise in same-sex schooling in some parts of the world
especially in United States. Some hope that schools can increase students' academic achievement and
Ad
Traffic
Manager
Supervised By Jakhongir ( Joe )
Boydedaev, 16102277
Contents
Ad Traffic Manager
Reasons to choose the job.
Attaining my dream
Future Goals.
Conclusion.
Ad traffic Manager
Controlling the Marketing efforts
Responsibility for Ads on
Good Afternoon everyone. My name is Jakhongir Boydedaev and today Im here to talk to you
about My dream job that I feel is of great importance. So my topic today is Ad traffic manager.
Before I begin I want to highlight exactly what I want you to take awa
Good Afternoon everyone. My name is Jakhongir.Im a freshman student studying Information
Technologies Management, and I here to talk to you about educational issue that I feel is of
great importance. My objective is not to try and persuade you to take a s
Single sex vs. Co-ed schools
IT Management, Seoul National University of science and technology
Supervised by: Jakhongir Boydedaev, 16102277
Introduction
Modern psychology tells us that boys and girls need to be
educated together as equals because of its
Mid-term Exam, Spring Semester, 2008 Data Networks Professor: Sunghyun Choi 2008-05-06 (Tue), 12:30pm-2:15pm 1. (10 points) We are given a bit transmission facility that transmits each bit correctly with probability 1-p and incorrectly with probabil
Homework 9 Student: Son Tran ID: 2007-23576 Data Networks Spring 2008
4.1 a) Let pn(k) be the probability to have n backlogged nodes during time slot k. The transition probability Pi , j is the probability to have j backlogged nodes in next time
Homework 8 Student Name: Son Tran Student ID: 2007-23576 Class: Data Networks Spring 2008
3.61 We have . The arrival rate at the CPU is /p0 and the arrival rate at the ith I/O port is pi / p0. By Jackson's Theorem, we have
Where
, and
for i >
DATA LINK LAYER
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
ARQ
Retransmission strategy Assumptions
(a1) receiving DLC knows when frames start and when they end (a2) all frames containing transmission errors are detected ( most unr
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Introduction
Total delay of the i-th customer in the system Ti = Wi + i
N(t) : the number of customers in the system Nq (t) : the number of customers in
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
M/G/1
The service times are generally distributed Xi : the service time of the i-th arrival
E[X] = 1/ = average service time E[X2] = second moment of servic
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Priority Queueing
M/G/1 with n priority classes of customers
,Xk , X k2 For class k, k k Independent Poisson arrival processes 1
Non preemptive priority
C
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Network of Transmission Lines
Tandem queues
Two equal-capacity transmission lines in tandem
Difficult to analyze Interarrival times at the 2nd queue are str
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Time Reversibility - Burke's theorem
Birth-death process: Markov chain with integer states in that transitions occur only between neighboring states Consider
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Networks of Queues Jackson's theorem
Each queue is assumed to be M/M/1
K queues
Pij: transition prob. from queues i to j rj: external input rate at queue
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Closed Queueing Networks
No customers are allowed to arrive or depart M: the number of customers in the system
K
pij
1
i
1,
,K
j
( m ) : the state de
Queueing Theory (Delay Models)
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Introduction
Total delay of the i-th customer in the system Ti = Wi + i
N(t) : the number of customers in the system Nq (t) : the number of customers in
Multiaccess Communication
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Channel Allocation Problem
In any broadcast network, the key issue is how to determine who gets to use the channel MAC: medium access control
Between the data lin
Multiaccess Communication
Sunghyun Choi Adopted from Prof. Saewoong Bahk's material
Stabilized Slotted ALOHA
Maintain the attempt rate G(n) at 1.
when an idle slot occurs, increase qr when a collision occurs, decrease qr Success, idle, collision