ELEN E6761 Computer Communication Networks

Homework 4: CSMA

  1. In all our discussions so far we have considered equal size packets where the transmission time of each packet was one unit. In this question, we consider slotted CSMA with variable packet lengths. Assume that the transmission time of each packet is a random variable X; for consistency with the slotted assumption, assume that X is discrete, taking values that are integer multiples of β. Assume that all transmission times are independent and identically distributed (i.i.d.) with the mean X¯ = 1. Further, the idle detection time β is very small.
  • Let Y be the longer of two iid transmissions X1 and X2 (i.e., Y = max(X1,X2)). Show that the expected value of Y satisfies Y¯ ≤ 2X¯.
  • Using (a), show that the expected cycle length, given a collision of two packets, is atmost 2 + β.
  • Let Nk = n be the number of packets in the system at the beginning of cycle k. Show that the the expected number of attempted transmissions in this cycle is g(n) = λβ +
  • Show that the expected cycle length is at most

βeg(n) + (1 + β)g(n)eg(n) + (1 + (β/2))g2(n)eg(n).

Hint: To show this, use the following facts: a binomial B(n,p) distribution can be approximated by a poisson distribution with mean np if n is large and p is small, then it follows that the number of attempted transmissions can be approximated by a Poisson random variable with mean g(n). Also we can ignore collisions of more than two packets as the probability of such events is negligible (g(n) is small).

  • Find an upperbound on the drift Dk and write down the condition on the arrival rate λ for stability of the system.
  • Show that the throughput is maximized (for small β) by g(n) = √β.
  • What is the optimal q? What is the maximum throughput?

USA Universities

Alabama State University [ASU]

Auburn University Montgomery [AUM]

American University of the Caribbean School of Medicine

Bob Jones University [BJU]

Brigham young University [BYU]

Brown University [Brown]

California State University, Chico [Chico State]

Campsbell University Assignment Help

Carnegie Mellon University [CMU]

Colorado State University

Columbia University [CU]

Christopher Newport University [CNU]

Denison University [DU]

Drew University

Florida Atlantic University Navitas

Full Sail University

George Mason University [MASON]

Harrisburg University

Hampton University [HU]

Hofstra University

Howard University [HU]

Hult International Business School

Illinois State University

Johns Hopkins University [JHU]

Jackson State University

Liberty University Assignment Help

Marshall University

New York Institute of Technology

New York University [NYU]

Northwestern University [NW]

Oregon State University

Princeton University [PU]

Richard Bland College of William and Mary

Santa Clara University [SCU]

Saint Leo University

Stanford Essay help

SUNY Geneseo University

University of Alabama at Birmingham

University of Massachusetts Boston

University of California, Berkeley [UC Berkeley]

University of California, Davis [UC Davis]

University of Florida [UF]

University of Georgia [UGA]

University of Idaho Navitas

University of Maryland, Baltimore County [UMBC]

University of Massachusetts Dartmouth Navitas

University of Massachusetts Lowell Navitas

University of New Hampshire Navitas

University of Richmond [UR]

University of Rochester [UR]

University of Texas [UT]

University of South Florida

University of Vermont [UVM]

University of Virginia [UVA]

University of Washington [UDub]

Virginia Commonwealth University [VCU]

Wake Forest University [WFU]

Washington State University

Western Washington University [Western]

Youngstown State University [YSU]

Yale University

USA Universities Question

CS 5480/6480: Computer Networks

IT Infrastructure Project Phase II Instructions

MCU-CS500: Advanced Data Analysis

Purdue University essay Writing

GEOL 591 Subsurface Methods

PE 7023 Advanced Production Design

Econ 201 Principles of Microeconomics

NUR 6307 Advanced Nursing Technologies

IS 333A Business Computer Systems Analysis