FINAL EXAMINATION

COMPUTER ENGINEERING DEPARTMENT College of Computer & Information Sciences

Instructor: Dr. Sami Al-Wakeel Time: 3 hours Networks Date: May 23, 2002

Course Code: Course Name:

CEN 534 Local Computer

Semester: 2nd Semester 1422/23

Q. 1) Consider an unslotted CSMA/CD system in which the propagation delay is negligible compared to the required for a node to detect that the channel is idle or busy. Assume that each packet requires one time unit for transmission. Asume that time units after either a successful transmission or a collision ends, all back logged nodes attempt transmission after a random delay and that the composite process of initiation times is Poisson or fate G (up to time after the first initiation). For simplicity, assume that each collision lasts for time units. (a) Find the probability that the first transmission initiation after a given idle detection is successful. (b) Find the expected time from one idle detection to the next. (c) Find the throughput (for the given assumptions). (d) Optimize the throughput numerically over G. Q. 2) Consider a slotted ring of length 10 km with a data rate of 10 Mbps and 500 repeaters, each of which introduces a 1-bit delay. Each slot contains room for one source address byte, one destination address byte, two data bytes, and five control bits for a total length of 37 bits. How many slots are on the ring? Q. 3) Consider two stations on a baseband bus at a distance of 1 km from each other. Let the data rate be 1 Mbps, the frame length be 100 bits, and the propagation velocity be 2x108 m/s. Assume that each station generates frames at an average rate of 1000 frames per second. For the ALOHA protocol, if one station begins to transmit a frame at time t, with is the probability of collision? Repeat for slotted ALOHA. Q. 4) a. A circuit-switching system has a call arrival rate = 1 call/3sec. The average call-holding time is 1/ = 30 sec. Find the minimum number of trunks N needed to have the blocking probability not exceed 1 percent.

b. Design a nonblocking three-stage space switch for N=104 inputs to be connected to N=104 outputs. Compare the resultant C with Copt. for design case, n has to be an integer number close to the optimum value of n. c. Sketch a five stage non-blocking space switch. Q. 5) Four stations are connected on a double wire to a controller, as shown in Fig. 1. Each generates an average of 75 1000-bit packets/sec destined for the controller. The line transmission rate is 600 kbps. The propagation delay is 5 micro sec/km.

Fig. 1 a. Roll-call polling is used. Calculate the average scan time if the polling message is 60 bits and each station requires 0.1 mili sec to synchronize to a poll. The stations are 5-km apart, as shown. Find the average scan time if the controller polls in a counterclockwise direction as shown. b. Repeat part a. if hub polling is used. c. Could a contention-type scheme such as slotted Aloha or CS MA/CD be used? Explain.