Module 3 Assignment Problem 1 Hosts A and B are attached to a local area network. Draw a diagram that shows the complete sequence of actions that takes place (the primitives passed from the network to the data link layer of host A, the protocol data units sent over the LAN, and the primitives passed from the data link to the network layer of host B) for the following cases (assume the link has not yet been initialized): a. Unacknowledged connectionless transfer of two frames of data from host A to host B. b. Acknowledged connectionless transfer of two frames of data from host A to host B. c. Connection oriented transfer of two frames of data from host A to host B. Problem 2 A frame transfer sequence for the logical link control protocol is shown below. (a) What are the values for the send variable, N(S), and the receive variable, N(R), for each frame sent? Assume that the send and receive variables have been initialized to N(S)=N(R)=0. (b) How many frames are buffered in the data link layer in node A (1) After step (8)? (2) After step (9)? Problem 3 (a) Given a baseband bus with station 1 located at 10m, station 2 located at 1000m, and station 3 located at 1010 meters. If the data rate of the bus is 10 Mbps, and the propagation speed of the medium is 200 m/microsecond, how long would it take to send a packet of 100 bits: (1) Between stations 3 and 2? (2) Between stations 3 and 1? (b) Given a broaband bus with station 1 located at 10m, station 2 located at 1000m, and station 3 located at 1010 meters, and the headend is located at A (see diagram above). If the data rate of the bus is 10 Mbps, and the propagation speed of the medium is 200 m/microsecond, how long would it take to send a packet of 100 bits: (1) Between stations 3 and 2? (2) Between stations 3 and 1? Problem 4 Given a five station token bus LAN with station addresses of 3000, 500, 100, 70, and 50. Stations with addresses of 5000, 4000, 400, 90, and 60 are waiting to enter the ring. Assume a 16 bit address size for the token bus LAN. (a) Show, in the correct order, each of the MAC control frames that would be sent over the token bus when station 100 attempts to add new station(s) to the ring. (b) Show, in the correct order, each of the MAC control frames that would be sent over the token bus when station 50 attempts to add new station(s) to the ring. Use the frame format show below to identify the MAC control frames being sent: Problem 5 Consider a five station token bus network. Calculate the number of frames sent, and the token rotation time (TRTC) for each station, for 5 complete rotations of the token. The priorities of the stations are as follows: Station Address Priority 1 6 2 4 3 4 4 4 5 6 Assume the following conditions for the network: • Time is measured in octet times • The time to pass the token is 20 • All stations have an unlimited number of frames to send • The token holding time (THT) for sending priority 6 frames is 400 • The target token rotation time for the priority 4 frames (TRT4) is fixed at a value of 1400 • The frame length is the same fixed value for each station and equal to 100 octets • The stations are ordered by decreasing station address number Problem 6 Consider the five station token ring network shown below. Show all of the frames that would be sent, and indicate the related activity carried out by each of the stations to perform the complete neighbor notification process. Assume station 200 is the active monitor, ring priority is 0, and no stations have data to send. Use the following frame format to show the results (fill in the relevant values for the fields for each frame sent), where AC is Access Control, FC is Frame Control, DA is destination address and SA is Source Address (16 bit addresses used). Problem 7 Consider the above five station token ring network. Show all of the frames that will be sent over the ring if each station has the following PDUs to send: In the above table, DA is the destination address and Pm is the priority of the station’s PDUs. Assume the value of the token holding timer (THT) will allow a maximum of 2 PDUs to be sent by each station and that station 1 initially has the token. Show the results using the following format: where P, T and R are the Priority, Token and Reservation values in the access control field, and DA and SA are destination and source addresses in the token ring frame.