LAN Performance From Stallings text on LANs. CSMA/CD What is the maximum utilization possible for n nodes?

Slides:

Advertisements

Similar presentations

Miss Battaglia AB Calculus. Given a point, P, we want to define and calculate the slope of the line tangent to the graph at P. Definition of Tangent Line.

Advertisements

EECC694 - Shaaban #1 lec #5 Spring Data Link In Broadcast Networks: The Media Access Sublayer Broadcast networks with multi-access (or random.

Multiple access What if multiple machines are sharing the same link?

The Data Link Layer introduction point-to-point data link protocols

LECTURE 11 CT1303 LAN. DYNAMIC MAC PROTOCOL No fixed assignment for transmission media or any network resources.. It allows transmission when needed.

Communication Networks Lecture 5 NETW 501-L5: NETW 501-L5: Medium Access Control Dr.-Ing. Khaled Shawky Hassan Room: C3-222, ext: 1204,

1 K. Salah Module 4.2: Media Access Control The Media Access Control (MAC) sublayer –Random Access (CSMA), IEEE –Token Passing, IEEE Ch 13-

Chapter 12 Multiple Access Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols.

LANs Media Access Control Step 1 in Sharing Resources.

LAN Performance From Stallings text on LANs. CSMA/CD What is the maximum utilization possible for n nodes?

CMPE 150- Introduction to Computer Networks 1 CMPE 150 Fall 2005 Lecture 17 Introduction to Computer Networks.

Chapter 14 LAN Systems Ethernet (CSMA/CD) ALOHA Slotted ALOHA CSMA

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Chapter 13 Multiple Access.

1 6/27/ :02 Chapter 15LAN Performance1 Rivier College CS575: Advanced LANs Chapter 15: LAN Performance.

EE 4272Spring, 2003 Chapter 14 LAN Systems Ethernet (CSMA/CD)  ALOHA  Slotted ALOHA  CSMA  CSMA/CD Token Ring /FDDI Fiber Channel  Fiber Channel Protocol.

Studying Local Area Networks Via Media Access Control (MAC) SubLayer

ECE358: Computer Networks Spring 2012

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.

Semester EEE449 Computer Networks The Data Link Layer Part 2: Media Access Control En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex,

Shashank Srivastava Motilal Nehru National Institute Of Technology, Allahabad Medium Access Control.

McGraw-Hill © The McGraw-Hill Companies, Inc., 2004 Chapter 12 Multiple Access Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction.

Chi-Cheng Lin, Winona State University CS412 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.

Chapter 12 Multiple Access Figure 12.1 Data link layer divided into two functionality-oriented sublayers Figure 12.2 Taxonomy of multiple-access protocols.

Ch. 16 High-Speed LANs The Emergence of High- Speed LANs Trends –Computing power of PCs has continued to grow. –MIS organizations recognize the.

© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking LANs 2: MAC protocols.

Medium Access Control NWEN302 Computer Network Design.

Data and Computer Communications Ninth Edition by William Stallings Data and Computer Communications, Ninth Edition by William Stallings, (c) Pearson Education.

Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Medium Access Control Sublayer.

جلسه یازدهم شبکه های کامپیوتری به نــــــــــــام خدا.

4: DataLink Layer1 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single wire, e.g. PPP, SLIP) r broadcast (shared wire.

Data Communications, Kwangwoon University12-1 Chapter 12. Multiple Access 1.Random Access 2.Controlled Access 3.Channelization.

Outlines Received due 13 March 0%. Homework... Review your notes. Prepare for Midterm! Review your notes. Prepare for Midterm! Work on outline Work on.

1 Chap. 4 Data link layer 3. 2 MAC(medium access control) model MAC  If two nodes are transmitted simultaneously, collision of two frames is occurred.

IEEE (Token Ring) LAN Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.

802.5 Token-Ring Networks: Topology An alternative to Ethernet LANs Physical Layer Topology: Ring –Stations connected in a loop –Signals go in only.

Chapter 11 Extending LANs 1. Distance limitations of LANs 2. Connecting multiple LANs together 3. Repeaters 4. Bridges 5. Filtering frame 6. Bridged network.

5: DataLink Layer 5a-1 Multiple Access protocol. 5: DataLink Layer 5a-2 Multiple Access Links and Protocols Three types of “links”: r point-to-point (single.

Ch 12. Multiple Access. Multiple Access for Shared Link Dedicated link – Point-to-point connection is sufficient Shared link – Link is not dedicated –

IEEE l IEEE has had the greatest impact on Layer 2 standards. l IEEE divided Layer 2 into two sublayers.

LECTURE9 NET301 11/5/2015Lect 9 NET DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies.

EE 122: Lecture 6 Ion Stoica September 13, 2001 (* this talk is based in part on the on-line slides of J. Kurose & K. Rose)

Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.

UNIT 3 MULTIPLE ACCESS Adapted from lecture slides by Behrouz A. Forouzan © The McGraw-Hill Companies, Inc. All rights reserved.

Chapter 7.. Local Area Networks When CCITT and ISO first designed the OSI model, little attention was paid to the local area networks. This was quite.

5: DataLink Layer5-1 Slotted ALOHA Assumptions r all frames same size r time is divided into equal size slots, time to transmit 1 frame r nodes start to.

Multiple Access By, B. R. Chandavarkar, CSE Dept., NITK, Surathkal Ref: B. A. Forouzan, 5 th Edition.

LECTURE 11 NET301 11/16/2015Lect IEEE LAN STANDARDS Ethernet LAN (by Xerox): Topology: Bus Transmission Media: Thick Coaxial Cable. Signal: Digital.

Example DLL Protocols 1. High-Level Data Link Control (HDLC).

Data Link Layer Lower Layers Local Area Network Standards

IEEE (Token Ring) LAN Dr. Sanjay P. Ahuja, Ph.D.

CT301 LECTURE 8.

High Speed LANs – Ethernet and Token Ring

Chapter 14 LAN Systems Ethernet (CSMA/CD) ALOHA Slotted ALOHA CSMA

Results for p = 0.1 Graphs at different values of Call Arrival Rate for Call Blocking Probability (in %) System Utilization (Efficiency) (in %) Average.

Multiple Access Mahesh Jangid Assistant Professor JVW University.

Net301 lecture9 11/5/2015 Lect 9 NET301.

Services of DLL Framing Link access Reliable delivery

Multiple access.

CprE 458/558: Real-Time Systems

Learning Objectives After interacting with this Learning Object, the learner will be able to: Explain the process of collision detection in CSMA/CD.

Chapter 11 Data Compression

Chapter 12 Multiple Access

Link Layer and LANs Not everyone is meant to make a difference. But for me, the choice to lead an ordinary life is no longer an option 5: DataLink Layer.

A graphing calculator is required for some problems or parts of problems 2000.

Chapter-5 Traffic Engineering.

Multiple Access Control (MAC) Protocols

Chapter 12 Media Access Control (MAC)

Bridges Computer Networks.

Presentation transcript:

LAN Performance From Stallings text on LANs

CSMA/CD What is the maximum utilization possible for n nodes?

Determine Optimal Behavior of Each Node 1.Calculate probability of one node transmitting. 2.Optimize that probability with respect to N (it is a function of N). 3.Calculate expected number of contention cycles prior to a successful transmission. 4.Calculate efficiency.

Probability of ONE node transmitting P is the probability of each node transmitting 1-P is the probability that a node does not transmit Success is marked by the occurrence of one tranmission in conjunction with n-1 nodes refraining Probability each node transmitting Step 1

Maximize A with respect to P Step 2

So… the maximum value of A is

Probability of ONE node transmitting Estimate the length of the contention interval! Step 3

Therefore: Maximum utilization is Step 4

Results

Token Ring

a<1 and n nodes a is the fraction of the frame which can exist on the link OR the “time” it will take for the head to propagate back to the sender a/n is the time required to propagate from one node to the next node (time to pass the token) IF the token is released immediately after xmit:

a>1 and n nodes More than one frame fits. Head does not return to sender before xmit completes If sender needs the leading edge before forwarding the token: If sender needs the trailing edge before forwarding the token:

Asymptotic Token Ring Behavior as

See graphs