Quiz 2 ECE/CSC 570 - Fall 2010, Section 001, 601.

Slides:



Advertisements
Similar presentations
Channel Allocation Protocols. Dynamic Channel Allocation Parameters Station Model. –N independent stations, each acting as a Poisson Process for the purpose.
Advertisements

The ALOHA Protocol “Free for all”: whenever station has a frame to send, it does so. –Station listens for maximum RTT for an ACK. –If no ACK after a specified.
EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.
Fundamentals of Computer Networks ECE 478/578
Module C- Part 1 WLAN Performance Aspects
Communication Networks Lecture 5 NETW 501-L5: NETW 501-L5: Medium Access Control Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204,
MAC Protocols Media Access Control (who gets the use the channel) zContention-based yALOHA and Slotted ALOHA. yCSMA. yCSMA/CD. TDM and FDM are inefficient.
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
Copyright © 2003, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Chapter 6 Multiple Radio Access.
7C Cimini-9/97 ALOHA Carrier-Sense Techniques Reservation Protocols Voice and Data Techniques - PRMA - Adaptive CDMA Power Control “Channel access.
EEC-484/584 Computer Networks Lecture 7 Wenbing Zhao
7C Cimini-9/97 RANDOM ACCESS TECHNIQUES ALOHA Carrier-Sense Techniques Reservation Protocols PRMA.
Studying Local Area Networks Via Media Access Control (MAC) SubLayer
ECE358: Computer Networks Spring 2012
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
Networks: Local Area Networks1 LANs Studying Local Area Networks Via Media Access Control (MAC) SubLayer.
Computer Networks: Local Area Networks 1 LANs Studying Local Area Networks via the Media Access Control (MAC) SubLayer.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Medium Access Control Sublayer Chapter.
1 Chapter 5 The Medium Access Sublayer. 2 Chapter 5 The Medium Access Layer 5.1 The Channel Allocation problem - Static and dynamic channel allocation.
Chap 4 Multiaccess Communication (Part 1)
Multiple Access Protocols Chapter 6 of Hiroshi Harada Book
Opersating Mode DCF: distributed coordination function
1 Computer Communication & Networks Lecture 12 Datalink Layer: Multiple Access Waleed Ejaz
LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.
جلسه دهم شبکه های کامپیوتری به نــــــــــــام خدا.
ARQ Mechanisms Rudra Dutta ECE/CSC Fall 2010, Section 001, 601.
Computer and Data Communications Semester Mohd Nazri Mahmud Session 2a-27 Feb 2012.
Cyclic Redundancy Check (CRC).  An error detection mechanism in which a special number is appended to a block of data in order to detect any changes.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2000 Unit-II Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
LOCAL AREA NETWORKS. CSMA/CD Carrier Sense Multiple Access with Collision Detection The CSMA method does not specify the procedure following a collision.
Medium Access Control Sub Layer
7-1 Introduction to Queueing Theory l Components of a queueing system n probability density function (pdf) of interarrival times n pdf of service times.
Multiple Access.
Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks Lecture Note 9.
Giuseppe Bianchi Random Access Performance the case of Aloha.
Samples of Descriptive Problems CSC/ECE 573, Sections 001 Fall, 2012.
Ethernet. Ethernet (802.3) 1-persistent CSMA, CD, binary exponential backoff Carrier sense: station listens to channel first. 1-persistent: If idle, station.
CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.
Background of Ad hoc Wireless Networks Student Presentations Wireless Communication Technology and Research Ad hoc Routing and Mobile IP and Mobility Wireless.
Review of key networking techniques: –Reliable communication over unreliable channels –Error detection and correction –Medium access control –routing –Congestion.
CS3502: Data and Computer Networks Local Area Networks - 1 introduction and early broadcast protocols.
ECEN 621, Prof. Xi Zhang ECEN “ Mobile Wireless Networking” Course Materials: Papers, Reference Texts: Bertsekas/Gallager, Stuber, Stallings, etc.
1 Ethernet CSE 3213 Fall February Introduction Rapid changes in technology designs Broader use of LANs New schemes for high-speed LANs High-speed.
Tel Hai Academic College Department of Computer Science Prof. Reuven Aviv Markov Models for Access Control in Computer Networks Resource: Fayez Gebali,
Data Link Control Layer General Concepts Rudra Dutta ECE/CSC Fall 2010, Section 001, 601.
Data Link Control - Medium Access Control Rudra Dutta ECE/CSC Fall 2010, Section 001, 601.
Medium Access Control Protocols, Local Area Networks, and Wireless Local Area Networks Lecture Note 10.
Lecture Focus: Data Communications and Networking  Data Link Layer  Media Access Control (MAC) Lecture 23 CSCS 311.
Multiple Access By, B. R. Chandavarkar, CSE Dept., NITK, Surathkal Ref: B. A. Forouzan, 5 th Edition.
CS 5253 Workshop 1 MAC Protocol and Traffic Model.
ECEN “Mobile Wireless Networking”
Data link layer divided into two functionality-oriented sublayers
Introduction to Queueing Theory
Lab 7 – CSMA/CD (Data Link Layer Layer)
Medium Access Control Protocols
Idle sense.
Channel Allocation (MAC)
DTMC Applications Ranking Web Pages & Slotted ALOHA
Chapter 12 Multiple Access
Services of DLL Framing Link access Reliable delivery
Reading Exercise (Routing) Policy-Mechanism Separation: PCE, ForCES
Communication Networks NETW 501
Chapter 12 Multiple Access
Chapter 12 Multiple Access
Data Communication Networks
Zafer Sahinoglu, Ghulam Bhatti, Anil Mehta
CSE 313 Data Communication
Figure 3.1 Internet model.
Chapter 6 Multiple Radio Access.
Satellite Packet Communications A UNIT -V Satellite Packet Communications.
Presentation transcript:

Quiz 2 ECE/CSC 570 - Fall 2010, Section 001, 601

Q1. Markov Model Consider the following numerical values for the slotted ALOHA system. The arrival process at each station is an independent Poisson process, with rate 0.05 (arrivals/slot time). Backlogged stations attempt re-transmission with a probability of 0.02 in each frame slot. Use the model given for the rigorous analysis of slotted ALOHA, with all the assumptions listed there. Assume that there are 20 stations on the medium, and at the end of a given timeslot, 12 of them are backlogged. What is the probability that 12 or more stations will be backlogged at the end of the next timeslot? qa = 1 - e-l/m = 1 – e-0.05 = 1 – 0.95 = 0.05 qr = 0.02 For 12 or more to be backlogged, we must have either an idle slot, OR collision (any combination of new transmissions and retransmissions), OR one new transmission, successful That is, must exclude only the case of one successful retransmission Probability of that is (0.95)8 12C1 (0.98)11 0.02 = 0.13 Therefore required probability is 0.87 Copyright Rudra Dutta, NCSU, Fall, 2009

Q2. Error Free Routing In the network shown below, part of the FIBs of each of the four nodes is shown. Complete any entries in the tables that can have only one possible value in order for the whole routing to be correct.  A B - C D Only the three shown inside the tables in bold are forced. The two entries in D’s table are obvious – D only has one option. The entry for B in C’s table is forced to be B, because the other option (A) would create a loop between A and C. The other two entries are NOT forced, since multiple combinations would produce correct routes (shown in matched colors). A - B C D A B B B C A B C - D C D A B C D - B A B Copyright Rudra Dutta, NCSU, Fall, 2009