MALTEPE UNIVERSITY Electrical-Electronics Engineering Department ks Brondeast Networks (3 point)tt CSMA/CD LAN (18 points) A local area nctwork (LAN) wi SMACD (Carer Multiple A. Collision De ha oe n d = 2000 m operates with L,= 1000 byte frames. Assuain pagation speed of electrical i = peed m permits the detection of the collision of th i (One-way signal peopagstion to Ops point Thus, = 24, = 21010 = 2 The maximum transmission rae: R 0010 bps =400 Mbps (20 pons) . R D0 SOMbyte/s Rancan . the followin preporse - Name of layer (2 pins -— Muliplening network s Neework congestion co . 4. Packet counting or durFind the handwts Brcad ofthe PCM signa 6 pin Answer Symbol rte of the sampled sgn : symbols = S0heymbel/s Information content: H = log = lg (6 biveymb (4 pint Mi pocity: Ca = R=240000 bps = 240 Kh (5 pnts)MALTEPE UNIVERSITY Electrical-Electronics Engineering Department EE 431 Communication Networks 2*4 Midterm Examina SOLUTIONS Date Pace Exam du pensive) Op pensive) (3p) R= 100 Mips: SNR = 3048; C=Blogy(1+SNR) : C= = 100 Mbps = 10" bps 0 4B = 10 logs SNR SNR) ; Antilogarithm: 10° = SNR 52-107 He=10x10" He=10 MLinparallel (4p. Ameer Computers send “Alacovery frames” This ) Frame explosion 6 p) Rete de im comparer Eo computer Av LAN 3- B2-LAN2—BI-LANA. (6 poIn the computer nctwork given in Figure 2, bth way dels Apply Dijksta’s algorithm for Router 1. tn applying the Z J1™ alguidi, usc the below given table wo waite the I Z “> for cach iteration, (Label: Minimum delay, owe = \ YS Y~ definition). (6p) \ > Briefly explain when the algoritum ends. (4p) . - Innate which labels willbe stored a the routing ble of Rower | (Sp) we Anewer Sistas algorithen for Router 1. (6) Sp