SYLLABUS COMPUTER NETWORKS (CIC-307)/(CIC-313) Applicable from Batch admitted in Academic Session 2021-22 Onwards UNITI Data Communications: Components, Networks, The Internet, Protocols and Standards, Network Models: The OSI Model, TCPAP Protocol Suite, A Comparison of the OSI and TCP/IP Reference Models, Addressing, Physical Layer: Analog and Digital Signais, Transmission modes, Transmission Media: Guided Media, Unguided Media, Review of Error Detection and Correction codes, m Switching: Circuit switching (space-division, time division and space-time division), pa ket switching (virtual circuit and Datagram approach), message switching. UNIT Il Data Link Layer: Design issues, Data Link Control and Protocols: Flow and Error Control, Stop-and-wait ARQ. Sliding window protocol, Go-Back-N ARQ, Selective Repeat ARQ, HDLG, Point-to ~Point Access: PPP Point -to- Point Protocol, PPP Stack, Medium Accéss Sub* layer: Channel allocation problem, Controlled Access, Channelization, multiple access protocols, IEEE standard 802.3 & 802.11 for LANS and WLAN, high-speed LANs, Token ring, Token Bus, FDDI based LAN, Network Devices- repeaters, hubs, switches bridges. UNIT Ill Network Layer: Design issues, Routing algorithms, Congestion control algorithms, Host to Host Delivery: Internetworking, addressing and routing, IP addressing (class full & Classless), Subnet, Network Layer Protocols: ARP, IPV4, ICMP, IPV6 and ICMPV6. UNIT IV ‘Transport Layer: Process to Process Delivery: UDP; TCP, congestion control and Quality of service. Application Layer: Client Server Model, Socket Interface, Domain Name System (DNS): Electronic Mail (SMTP), file transfer (FTP), HTTP and WWW.SYLLABUS DATA COMMUNICATION & NETWORKING (ECC-311) Applicable from Batch Admitted in Academic Session 2021-22 onwards UNITI provocols and standards, Ni work and Protocol Data Communications : Compone Architecture, Reference Model 1S0-OSI, TCPIPOvernew top mode, digital signals, digstal to digital encoding, digtal data interface, interface standards, modems, cable modem. trar unguided, transmission impairment. Performanee, we: ele: wgth and Shannen capacity Review of Error Detection and Correction todas. Switching: Circut switching (space-division. time division and spece time dsvision), packet switching ‘virtual arcut and Dateztam approach, message switching mn (No. of Hours: 11] sse2on meda- guided and UNITS Data Link Layer: Design issues Dat\L ok Control and Protocols. Flow ws dd Error Control, Stop-and-wait(ARQ Sithozg* window protocol, Go-Back-N ARQ. Selective Repeat ARQ, HDLC, Point te Point Acéess: PPP Point to- Point Protocol, PPP Stack Medium Access Sub layer: Channel allocation problem, Controlled Access, Channelization/ multi pile access protocols, IEEE standard 802 3 & 802.11 for LANS and WLAN, high@peed LANs, Token ring. Token Bus, FDDI hased LAN, Network Devicea- repeaters, hubs switches Lridges. . [No. of Hours: 11} UNIT U1 Network Layer: Design issues, Routing algonthms. Congestion control algorithms, Host to Host Delivery: Internetworking. addressing and routing, IP addressing \class full & Classless), Subnet, Network Layer Protocols ARP, IPV4, ICMP, IPV6 ad ICMPV6. (No. of Hours: 11] UNIT IV Transport Layer: Process to Process Delivery UDP; TCP. congestion control and Quality of service. Application Layer: Client Server Model, Socket Interface, Domain Name System (DNS» Electronic Mail (SMTP), file transfer (FTP), HTTP and WWW UNo. of Hours: 11]SYLLABUS (2016-17) DATA COMMUNICATION AND NETWORKS (ETEC-310) Instructions to Paper Setters: Max. Marks: 75 1. Question No. 1 should be compulsory and cover the entire syllabus. Thus question should have obyective or short answert type questions, It should be of 25 marks. 2. Apart from Question No. 1, rest of the paper shall consists of four units aa per the ryllabus. Every unit should have two question. However, student may be asked to attempt only 1 question from each unst,, Each question should be of 12.6 marks UNIT-I Data Communications: Components, protocols and standards, Network and Protocol Architecture, Reference Model 1S0-OSI, TCP/P-Overview, topology, transmission mode, digital signals, digital to digital encoding, digital data tranamission, DTE-DCE interface, interface standarda, modems, cable modem, tranamission media-guided and unguided, tranemission impairment, Performance, wavelength and Shannon capacity. Review of Error Detection and Correction codes, Switching: Circuit switching (space-diyielon, time division and space-time division), packet ewitching (virtual cireuitand Datagram approach), message switching. {T1, T2, RA, R4) (No. of Hours : 11) UNIT-IL Data Link Layer: Design issues, Data Link Control and Protocols: Flow and Error Contiol, Stop and-wait ARQ. Sliding window protocol, Go-Back-N ARQ, Selective Repeat ARQ, HDLC. Point-to-Point Accces: PPP Point-to-Point Protocol, PPP Stack. Mediuin Access Sub Layer: Channel allocation problem, Controlled Access, Channelization, multiple aetess protocols. IEEE Standard 892.3 & 802.11 for LANS and WLAN, high speed LAMY, Teken ring, Token Bus, FDDI based LAN, Network Devicss- repeaters, bubs, switches bridges {T1, 72, 1] (No. of Hours: 11] UNIT-I11 Network Layer: Design issues, Routing algorithms, Congestion control algorithms. Host to Host Delivery: Internetworking, addressing and routing. IP addressing (class full & Claseless), Subnet, Network wayer Protocols: ARP, 1PV4, ICMP, IPVG ad ICMPV6. {T1, T2, Ri} (No. of Hours: 11) UNIT-IV ‘Transport Layer: Process to Process Delivery: UDP; TCP, congestion control and Quality of service Application Layer: Client Server Model, Socket Interface, Domain Name System (DNS). Electronic Mail (SMTP), file transfer (FTP), HTTP and WWW. (12, T1, RA, RA} (No. of Hours : 11}As per the New Syllabus 2021-22 onwards {CIC -309)(ECC-311)(CIC-313) UNIT -1 @ Rafer 1042, Few Important Question (Py. No 1.2) Q Wefer to G1 (0), (e)Piret Term Exam 2016 (Pg No 1, 2-2016) Q Hofer to Q 2 th) First Term Exam 2016 (Pg No 22016) Q, Mefer to Q4 (a) (b) First Term Finan 2016 (Py No 34-2016) Q Refer to QA (©) First Term Exim 2016 (Pg No % 2016) Q Kefer to QA (ni,(b) End Term Fam 2016 (Pg No. 14-2016) Q Mofer to QA (f) End Term Exam 2016 (Pg No 14-2016) Q, Refer to Q2 End Term Exam 2016 (Py No 16-2016) Q, Refer to Q.5 (a) (b) End Term Exam 2016 (Pg No 16,21 2016) Q Refer to Q1 (a),(b) Firat Term Exam 2017 (Pg. 0 12017) Q, Hofer to (2 (a) b) First Term Exam 2917 (Py Ne 23-2017) Q. Refer ta Q3 (b) Firat Term Exam 2017 Wg N8) 32917), Q Hofer to Q4 (b) (d) First Term Exam 2017 (Pg No 4,5-2017) Q. Hofer to Q 1 (aie) (h) End Term Exhm 2017 (Pq No 6,7.9-2017) Q. Refer to Q.2 (n),(b) (c) End Term Exam 2017 (I'¢ No 1143-2917) Q. Refer to Qa) {c) End Term Exam 2017 I'g..No 14-2017) Q Refer to Q5 (h) End Term Exam 20172, No 18-2017) @ Refer to Q.1 (a) (b) Firet Term Exar 18g. No 12018) @ Refer to Q2 (a) Firat Terma Extn 2015 (Pg, No. 3-2018) Q. Hofer to 3 (agle) First, Term Exam 2018 (Pg. No 7,9-2018) Q Refer to QI (aj End Term Exam 2018 (Pg. No 12-2016) Q. Refer toQ Mf) End Term Exam 2016 (Pg No. 14-2018) Q. Kefer'to Q4 (a) End Term) Exam 2018 (Pz No 18-2019) Q Refer Q) (c) First Term Exam 2019 (Pg. No 18-2019) Q, Refer to Q4 (a) (b) Firat Term Exam 2019 (Pg. No. 3,4-2019) Q. Hefer to QI (a) (b) End Term Exam 2019 (Px. No. 6-2019) Q Refer to Q 2 (a) End Term Exam 2019 (Pg. No. 9-2019) Q. Refer to Q3 (a) End Term Exam 2019 (Pg. No 9-2019) UNIT - IT Q. Refer to Q.1 (b) (c) (d) Pirst Term Examination 2016 (Pg. No. 1-2016) Q Refer to Q 2 (a) First Term Examination 2016 (Pg No 2-2016). Q, Refer to Q3 (b) of First Term Examination 2016 (Pg. No. 3-2016) Q Refer to QA (c)(d) First Term Examination 2016 (Pg. No. 4,5-2016). Q. Refer to Q.1 (a) Second Term Exarnination 2016 (Pg. No. 6-2016) Q, Refer to Q 1 (c) (d) End Term Examination 2016 (Pg. No, 13-2016). Q Kafer to Q4 (a) (b) End Term Examination 2016 (Pg. No. 22,23-2016). Q Kefer to Q5 (a)(b) End Terma Examination 2016 (Pg. No. 25,27-2016). Q, Refer to Q1 (c) (A) Firet Term Exarmination 2017 (Pg. No. 1,2-2017). pe i el eeLP. University-{B.Tech]-Akash Books 2022-5 Q. Refer to Q3 (a) First Term Examination 2017 (Ps. No. 3-2017). @ Refer to Q4 (a) (o)(e) First Term Examination 2017 (Pg. No. 4,5-2017). Q Refer to Q,1 (0 (6) (f(g) End Term Examination 2017 (Pg. No. 8,9-2011). @ Refer to Q5 (b) End Term Examination 2017 (Pg, No. 14-2017). @ Refer to Q4 (a)(b) End Term Examination 2017 (Pg, No. 16,16-2017). @. Refer to Q.5 (a) End Term Examination 2017 (Pg. No 17-2017). Q Refer to Q.1 (e)(d) (e) First Term Examination 2018 (Pg. No. 3-2018) Q Refer to Q2 () (c) First Term Examination 2018 (Pg. No. 6,7-2018). @.Rofer to Q.4 (a) (b)(c) First Term Examination 2018 (Pg. No 9,11-2018). Q Refer to Q.1 (d)(e) (g) End Term Examination 2018 (Pg. No. 14,15-2018). Q. Refer to Q2 (a) (b) End Term Examination 2018 (Pg, No. 16,17-2016). Q. Refer to Q.3 (b) End Term Examination 2018 (Pg. No. 21-2018). Q. Refer to Q-4 (a),(b) End Term Examination 2018 (Pg. No. 21,22-2018). Q. Refer to Q.1 (a), (b), (g) First Term Examination 2019 (Pg. No. 1,2-2019). @Q. Refer to Q.2. First Term Examination 2019 (Pg. No. 2-2019). @Q. Refer to Q.3 (c) First Term Examination 2019 (Pg. No. 5-2019): Q Refer to Q.4 (a),(b), (c) First Term Examination 2019 (Pg, No. 6-2019). Q Refer to Q.1 (c),(d), (e), (g), (j) End Term Exam 2019 (Pg. No. 7,8,9-2019). Q. Refer to Q.3 (b) End Term Examination 2010 (Pg. No. 11-2019). Q Refer to Q.4.(a), (b) End Term Examination 2019 (Pg, No. 12-2019). Q. Refer to Q.5 (a),(b) End Term Examination 2019 (Pg. No. 13,14-2019). Q Refer to Q.7 (a) End Term Examination 2019 (Pg. No. 19-2019). UNIT - III Q. Refer to Q.l Few Important Question (Pg. No.1). Q. Refer toQ.1 (b),(2), (e)Second Term Examination 2016 (Pg. No. 7-2016). Q. Refer to Q.2,(b) Second Term Examination 2016 (Pg. No. 9-2016). Q Refer to Q.3 (a), (b) Second Term Examination 2016 (Pg. No. 10,11-2016). Q Refer to Q-4 (i), ii) Second Term Examination 2016 (Pg. No. 11-2016). Q Refer to Q.1 (g) End Term Examination 2016 (Pg. No. 14-2016). Q. Refer to Q.6 (a), (b) End Term Examination 2016 (Pg. No. ,27,28-2016). Q Refer to Q.7 (a) End Term Examination 2016 (Pg, No. 29-2016). Q Refer to Q.8 (b) End Term Examination 2016 (Pg. No. 30-2016). Q Refer to Q.1 (b) End Term Examination 2017 (Pg. No. 8-2017). Q Refer to Q.1 (j) End Term Examination 2017 (Pg. No. 11-2017). Q. Refer to Q.6 (a),(b) End Term Examination 2017 (Pg. No. 19-2017). Q. Refer to Q.7 (a),(b) End Term Examination 2017 (Pg. No. 19,20-2017). Q. Refer to Q.8 (b) End Term Examination 2017 (Pg. No. 22-2017). Q. Refer to Q.9 (a) End Term Examination 2017 (Pg. No. 22-2017). Q. Refer to Q.1 (c) End Term Examination 2018 (Pg. No. 13-2018). Q. Refer to Q.5 (a),(b) End Term Examination 2018 (Pg. No. 22,25-2018). Q. Refer to Q.6 (a),(b) End Term Examination 2018 (Pg. No. 25,26-2018). Q. Refer to Q.7 End Term Exomination 2018 (Pg. No. 27-2018).62072 1ifth Serseater Q, Refer to Q1 (6, G) End Term bacmination 2919 (Py No 49-2045) @ Mafer (16 (ab) find Toran Hx seeatinns DONG Ve Bo 16,17 294g) Q Refer to). (0) ind Term Bewminntion 2019 (Py Mo 19-2619) Unt -1v Q Refer 10 4) 4.0), (ivi, (v) Second Term Pawn 2016 (Py Sy 11 2018) Q Hefer to. 1 (6) Bud Term Exain 2916 (Pg Mo 13-2000) Recor 10 Q 5 (0) Rind Term Rasen 2016 (Pg Mo 2916, Q Refer to Q9 Prd Term Basta 2016 (Pg. No. 31-2016) @ Refer to Q 1.4) Pind Tern Buxen 2617 (Py. Mo 92017) Q Refer to QB (a) Rud Toren Pain 2017 (Pg. Mo 21 i Q Refer to 9 (hy, te, (4), 6) Bad Tera nam 24 Mo 29.24.2017) Refer to Q.1 th) Bred Term Exar 2014 (PyEND TERM EXAMINATION (JULY 2023) SIXTH SEMESTER (B.TECH) DATA COMMUNICATION AND NETWORKS. (ETEC-310] Time: 3 Hrs. Max. Marks: 75 Note: Attempt any five questions including Q No. 1 which ix compulsory. Select one question from each unit. QL Attempt any Five Gabsen QL. (a) Explain the correlation between the OSI model and TCP/AP model with » proper diagrammatical form. @1. (b) What do you understand by Circuit Switching and Packet Switching? Discuss through the diagram. Q1. (c) Describe the LAN-based FDDI over a basic token ring in detail. Q1. (d) Differentiate SMTP & POP protocol, Q1. fe) Explain the IP¥4 protocol with header format. Also, compare with IPv6. Q1. (f Explain the High-level Data Link Control (ADLC) protocol used in computer networks. Discuss its key featureé, frame structure, and modes of operation. UNIT Q2 (a) What is the OSI reference model? Draw a block diagram and explain the functioning of cach layer. (7.5) Q2 (b) (i) Define the transmission modes with a diagram. (2.5) (i) Describe the transmission impairment. (25) Q3 Explain the follow ing terms with proper examples: (2.5 x 5 = 12.5) (a) Virtual Circuit with diagram (b) Guided and Unguided Media (c) Wavelength (d) Differentiate Process to Process and Host to Host delivery (e) Baseband transmission and Broadband transmission UNIT: QA (a) Explain the working of the Go-Back-N ARQ protocol and the Selective Repeat ARQ protocol. Also, compare the Sender and Receiver Window Sizes of both ARQ. (6.5) QA. (b) Short note on: 6) (i) Leaky bucket algorithm (ii) Channelization in Medium Access Control @5. (a) Define the meaning of carrier sense in CSMA. Also, Explain the CSMA'CD and CSMA/CA with Ihe diagram. (6.5)8-902 Fifth Sem QS. (b) Explain the following: () Control Protocols in Medium Access Control i) (i) Pure ALOHA and Slotted ALOHA Q6, (a) Explain the classful IP addressing in detail, ay QG. (b) Describe and Differontiate between: ® () ARP and RARP (UD ICMP and IGMP 7. (a) Givo n detailed description of standard IEEE 802.11 QL mA datagram of 3000 bytes (20 bytes of IP header + 2989 IP payload) Teached the router and must be forwarded to link with (maximum transmission unit) of 500 bytes, How many fragments will be Granted also write MB offset, and total length value for all? QS. Explain the following: (es (6.5, 6) Q& (@) What is FTP? How file ato transferred using FTP? QS (b) Difference betwoon UDP and TOP: Q9. Attempt any Two: (6.25 x2) Q9. (a) Explain the DNS, Q9. (©) Explain TEP Header indctal, @9.(c) Describe the terms JITEP and WWW.FIRST TERM EXAMINATION [FEB.-2016] SIXTH SEMESTER [B.TECH] DATA COMMUNICATION & NETWORKS [ETEC-310] Time : 1.30 Hrs. M.M. :30 Note: Attempt Q.1 and any 2 other Q.1. (a) What is the difference between circuit switelting and packet switching? (10) Ans. Circuit Switching Packet Switching Packet Switching a (Datagram type) (Virtual Circuit type) Dedicated path No Dedicated path No Dedicated path Path is established for | Route is established for Route is established for entire entire conversation each packet conversation Call setup delay Packet transmission delay | Call setup delay as well os _| Packet transmission delay Overload may block | Overload increases packet | Overload may block call setup call setup delay and inereases packet delay Fixed bandwidth Dynamic bandwidth Dynamic bandwidth No overhead bits after | Overhead bits in Overhead bits in each call setup each packet packet Q.1. (6) What factors should be considered in deciding the size of sliding window? Ans. By placing limits on the number of packets that can be transmitted or received at any given time, a sliding window protocol allows an unlimited number of packets to be communicated using fixed-size sequence numbers. The term “window” on the transmitter side represents the logical boundary of the total number of packets yet to be acknowledged by the receiver. The receiver informs the transmitter in each acknowledgment packet the current maximum receiver buffer size (window boundary). The receiver informs the transmitter in each acknowledgment packet the current maximum receiver buffer size (window boundary). The TCP header uses a 16 bit field to report the receive window size to the sender. Therefore, the largest window that can be used is 216 = 64 kilobytes Q.1. (c) What is the deciding factor in Go back N and Selective Repeat protocol? ' : Ans. Deciding factors are bandwidth, complexity of protocol, types of links (noisy and noisy less), window size, sorting, searching, storing. Q.1. (d) What kind of error is undetectable by checksum? Ans. At least three types of error cannot be detected by the current checksum calculation. First, if two data items are swapped during transmission, the sum and the checksum values will not change. Second, if the value of one data item is increased (intentionally or maliciously) and the value of another one is decreased (intentionally or maliciously) the same amount, the sum and the checksum cannot detect these changes. Third, if one or more data items is changed in such a way that the change is a multiple of 216 — 1, the sum or the checksum cannot detect the changes.Sixth Semester, Data Commrunication and Networks Q.1. (e) What is the difference between baseband transmission ang broadband transmissions? Ans. Baseband: © Digital signals are used * Frequency division multiplexing is not possible * Baseband is bi-directional transmission * Short distance signal travelling * Entire bandwidth of the cable is consumed by a single signal in a baseband transmission. Broadban . Anaiee sighals are used * Transmission of data is unidirectional * Signal travelling distance is long * Frequency division multiplexing is possible * The signals are sent on multiple frequencies and allow all the multiple signals are sent simultaneously in broadband transmission. Q.2. (a) What is MAC layer? How is it different from Data Link Layer? (5) Ans. The Media Access Control Layer is 6ne of two sublayers that make up the Data Link Layer of the OSI model. The MAC layer is responsible for moving data packets to and from one Network Iriterface Gard (NIC) to another across a shared channel. In the Open Systems Intereonmection (OSI) model of communication, the Media Access Control layer/is one of two sublayers of the Data Link Control layer and is concerned with sharing the physical eunnection to the network among several computers. Each computer has its own unique MAC address, Ethernet is an example of a protocol that works atthe Media Access Control layer level ‘The Data-Link layéris the protocol layer in a program that handles the moving of data in and out across a physical link in a network. The Data-Link layer is layer 2 in the Open Systems Interconnect (OSI) model for a set of telecommunication protocols. The Data-Link layer contdins two sublayers that are described in the IEEE-802 LAN standards: Media Access Control (MAC) Logical Link Control (LLC) The Data-Link layer ensures that an initial connection has been set up, divides output data into data frames, and handles the acknowledgements from a receiver that the data arrived successfully. It also ensures that incoming data has been received successfully by analyzing bit patterns at special places in the frames. Q.2. (b) Avoice grade channel of the telephone network has a bandwidth of 3.4 kHz. Calculate the information capacity of the telephone channel for a signal- to-noise ratio of 50dB? (5) Ans. C = Blog,(1+S/N) = 3.4 x 10° Log, (1 + 50) » = 3400 x 6.66 = 19244 kbivs Q.3, (a) Explain the frame format of DLC. Ans. Refer Q.4. (b) of End Term Examination 2016 (6)LP University-(B.Tech)-AB Publisher 2016-3 Q5. (b) Show that the hamming code can correct vue bit error in the following case: Transmitted code is 0101 and the received at the receiver is 1100101. Specify which bit has an error and correct it, Ans. Transmitted code : 0101 Received code : 1100101 We know that 2” >n+r41 where n = code words of length n r= parity bits if = 5 there eqn (1) will be satisfied 2 >4e1el 298 Table for Hamming code (Assume even parity) Bit Position Sat Evert | Even PL parity | symbol check _Code word 1 First 1 Fail --l Parity Bit check (P,.3,5,7) Second ae pass | —01 parity Bit check (P,, 3,6, 7) Third - Pass | 001 parity check (P,, 5, 6,7) ‘Thus the first bit position is in error. ‘The correct code data is 0100101 QA. Write a short note on: (Attempt any four) Q4.(a) DTE-DCE interface (2.5) Ans. A data circuit-terminating equipment (DCE) is a device that sits between the data terminal equipment (DTE) and a data transmission circuit. It is also called data communication(s) equipment and data carrier equipment. Usually, the DTE device is the terminal (or computer), and the DCE is a modem. : Data terminal equipment (DTE) is an end instrument that converts user information into signals or reconverts received signals. These can also be called tail circuits. A DTE device communicates with the data circuit-terminating equipment (DCE). The DTEY DCE classification was introduced by IBM. V.35 in a high-speed serial interface designed to support both higher data rates and connectivity between DTEs (data-terminal equipment) or DCEs (data-communication equi pment) over digital lines. ee}-2016 Sixth Semester, Data Communication and Networks Two different types of devices are assumed on each end of the intereo; « for a case of simply edding DTE to the topology (e.g. toa hub, DCE), which also bea less trivial case of interconnection of devices of the same type: DTE-DTE or De E-Dep Such cases need crossover cables, such as for the Ethernet or null modem for RS.299 Q.4. (b) Guided and Unguided media. Ans. Guided media are more commonly known as wired media, or those m, « which electrical or optical signals are transmitted through a cables or wires. Ungui media are more commonly known as wireless media, in which electromagnetic gj are sent through space with no direction. Both types of media can be used for long. distance dnd short-distance communication Guided transmission medi 1. TWisted pair cable 2. Co-axial cable 3. Fiber-optic cable Unguided transmission media: 1. Infrared 2. Microwaves 3. Satellite QA. (c) PPP Stack. (2.5) Ans. PPP (Point-to-Point Prototol) 18 @ protocol for communication between two computers using a serial interface) typically a personal computer connected by phone metimes considered a Protocols. Relative to the open systems interconnection (OSI) reference model, PPP provides layer 2 (data-link layer) service. Essentially, it Packages your computer's TOP/IP packets and forwards them to the server where they can actually be put on the Internet. PPP is a full-duplex protocol that can be used on various physical media, including twisted pair or fiber optic lines or satellite transmission. It uses a variation of high speed data link control (HDLC) for packet encapsulation. tare? [Pana eat nga tort peewee] Leyes seater] sere ett pes ae oS taye2| oman | prpanarne tenes| Pre is Line Internet i ferred over the earlier de facto standard Serial es etre) visotea it can handle synchronou: well as asynchronous eating, PPP can share a line with other users and it has error detection that SLIP lacks. Where a choice is possible, PPP is preferred. ———eLP University (1 Tech) AD Publisher 2016-4 Qu. dt) CSMA (2.6) Ana, Carrier sense niultiple access (CSMA) ia a media access contral (MAC) protocol in which a node verifies the absence of other traffic before tranarmitting on « shared transmission medium, such as an electrical bua, or a band of the electromagnetic spectrum A transmitter attempts to determine whether another transmission bs in progress before initiating a tranamisaion uaing « carrier sense mechanism That ia, it tries to dotoct the presence of a currior signal from another node before attempting to tranemit. Ifa carrier in sensed, the node waits for the transmission in progress to end before initiating tts own transmniaxion, Using CSMA, multiple nodes may rend and receive on the samo medium, ‘Transmissions by ono node are generally received by all other nodes ed to the medium. ‘ariations on basic CSMA include addition of collision avoidance, collision detection and collision resolution techniques There Are Threo Different Typo of CSMA Protocola (i) L-persistont CSMA: In this method, station that wants to transmit data continuously senses the channel to check whether the channel is idle or buay, * If the channel is busy, the station waits until it becomes idle, * When the station detects an idle-channel, it immediately transmits the frame with probability 1, Hence it is called I-persiatent GSMA. (ii) Non-Persistent CSMA: In this scheme, ifa.station wants to transmit a frame and it finds that the channel is buay (some other station is transmitting) then it will wait for fixed interval oftime, * After this time, it again checks the statusof the channel and ifthe channel is.free it will transmit. * Astation that has a frame toecnd senses the channel. * If the channel is idle, it sends immediately. * If the channel is busy, It waits a random amount of time and then senses the channel again, * In non-persistent GSMA the station does not continuously sense the channel for the purpose of capturing it when it detects the end of previous transmission. (iii) p-persistent CSMA: This method is used when channel has time slots such that the time slot duration is equal to or greater than the maximum propagation delay time. * Whenever a station becomes ready to send, it senses the channel. * If channel is busy, station waits until next slot. * Ifchannel is idle, it transmits with a probability p. * With the probability q =/-p, the station then waits for the beginning uf the next time slot. * Ifthe next slot is also idle, it either transmits or waits again with probabilities pandq © This process is repeated till either frame has been transmitted or another station has begun transmitting. * In case of the transmission by another station, the station acts as though a collision has occurred and it waits a random amount of time and starts again. Q.4. (e) Difference between FDMA and TDMAT. Ans.4(e) Refer Q.No 2 of Few Important QuestionsSECOND TERM EXAMINATION (APRIL-2016) SIXTH SEMESTER [B.TECH] DATA COMMUNICATION & NETWORKs [ETEC-310] ‘Time : 1.30 Hrs, Note: Attempt Q-1 and any 2 other. Q.1. (a) What is the frame format of FDDI? (10 Marky Ans. The FDDI frame format is similar to the format of a Token Ring frame Thin ig one of the areas where FDDI borrows heavily from earlier LAN technologies, ¢ uch ‘Token Ring. FDDI frames can be as large as 4,500 bytes. Figure shows the frame forma of an FDDI data frame and token MAL :ag Data frame. Preambie| Start | Frame |Destnaton) Source End | Frame delimiter | Control | address | sadrage Data Fes Detmiter | status Token Ss.” Stat] Frame | End es ale Delimiter Figs: FDDI frame format’ FDDI Frame Fields; The following descriptions summarize the FDDI data frame and token fields illustrated in Fig PreambleyA unique sequence that prepares each station for an upcoming frame. Start Delimiter: Indicates the beginning ofa frame by employing a signaling pattern that differentiates it from the rest of the frame. Frame Control: Indicates the size of the address fields and whether the frame contains asynchronous or synchronous data, among other control information. Destination Address: Contains a unicast (singular), multicast (group), or broadcast (every station) address. As with Ethernet and Token Ring addresses, FDDI destination addresses are 6 bytes long. Source Address: Identifies the single station that sent the frame. As with Ethernet and Token Ring addresses, FDDI source addresses are 6 bytes long. Data: Contains either information destined for an upper-layer protocol or control ae S): Filed by the tion with a calculated eyei snce (FCS): Filed by the soured station with a calculated eyelic oS a pendent on frame contents (as with Token Ring and Ethernet). ‘The destination address recalculates the value to determine whether the frame was damaged in transit. Ifso, the frame is discarded. End Delimiter: Contains unique symbols, which cannot be data symbols, that a of the frame. eee Aes the souree station to determine whether an error occurred and whether the frame was recognized and copied by a receiving station,LP University B.fech/-AR Pubiisher 2016-7 Q.1. (6) What is process to process delivery? ‘Ans. The transport layer 1s responsible for process-to-process delivery. Real communication takes place between (wo processes. So that we need process-to-process delivery. However, at any moment, several processes may be running on the source host land several on the destination host. To complete the delivery, we need a mechanism to deliver data from ane of Unese processes running on the source host to the corresponding process running on the destination host. Q.1. (c) What is the use of Classless addressing? Ans. Use of classless addressing: Classless addressing is a way to allocate and epecify the Internet addresses used in inter-domain routing more flexibly than with the onginal system of Internet Protocal (IP) address classes, What happened in classful addressing is that if any company needs more than 254 host machines but far fewer than the 65,433 host addresses than the only option for the company is to take the class B address, Now suppose company needs only 1000 IP addresses for its host computers then in this (65533-1000 =61533] IP addresses get wasted, For this reason, the Internet was, until the arrival of CIDR, running than necessary. Classless addressing effectively solved the problem by providing a new and more flexible way to specify network addresses in a router. Q.1{d) Deference between hub and switch ? Ans, Refer Q.No 3 of Few Important Questions . Q.1.(e) What is the difference between IP V4 and IPV6? Ans, IPva oN IPvé ‘The Address Space is 32 bits. The space is 128 bits. The length of header is 20 bytes ‘The length of header is 40 /4 bytes for each adress in the header | 16 bytes for each addressing the header I |The number of Header field 12 The number of header field 8 \Checksum field, used to measure Checksum field eliminated from header error in the header, required as error in the IP header are ot very crucial Internet protocol security (IPSec) Internet Protocol Security (IpSec) with with repect to network security respect to network security is mandatory is optional No identification to the packet flow | The flow level field on the header portion (Lack of QoS handling). identifies the packet flow and directs to to router (Efficient QoS handling) ‘The Fargmentation is done both ‘The fragmentation is done both by sending| \and routers there is no role of the routers. No identification to the packet flow | The flow level field on the header portion (Lack of Qos handing). identifies the packet flow and directs to router (Efficient QoS handling) Clients have approach Dynamic Clients do not have to approach any such Host Configuration server (DHCS) server as they are permanent adresses. whenever they connect to an network. Pee!8-2016 Sixth Semester, Data Communication and Networks ; Q.2. (a) Explain congestion control algorithm. i Ans. Main Congestion Control Algorithms are % 1. Leaky Bucket Algorithm * It is a traffic shaping mechanism that controls the amount and the nd traffic sent to the network teu * Aleaky bucket algorithm shapes bursty traffic into fixed rate traffic bya, the data rate A * Imagine a bucket with a small hole at the bottom * The rate at which the water is poured into the bucket is not fixed and can y, it leaks from the bucket at a constant rate. Thus (as long as water is Present in by by the rate at which the water leaks does not depend on the rate at which the water is to the bucket. ‘APU US trace og IB ——torgutaten ee | 0+ = | | pockets 3 Fixed flow {constant rate) Tatwork 10) A footy Bucket with woter {b) A leaky Bucket with packets * Also, when, the bucket is full, any additional water that enters into the bucket spills over the sides and is lost. * The same concept can be applied to packets in the network. Consider that data is RUDE from the souree at variable speeds. Suppose that a source sends data at te Mbps for 4 seconds. Then there is no data for 3 seconds. The source again transmits data at a rate of 10 Mbps for 2 seconds. Thus, in a time span of 9 seconds, 68 Mb data has been transmitted. Ifa leaky bucket algorithm is used, the data flow will be 8 Mbps for 9 seconds. Thus constant flow is maintained. 2. Token bucket Algorithm * The leaky bucket algorithm allows only an average (constant) rate of data flow. Its major problem is that it cannot deal with bursty data. + Aleaky bucket algorithm does not consider the idle time of the host. For example, if the host was idle for 10 seconds and now it is willing to sent data at a very high speed for another 10 seconds, the total data transmission will be divided into 20 seconds and average data rate will be maintained. The host is having no advantage of sitting idle for 10 seconds. ' * To overcome this problem, a token bucket algorithm is used. A token bucket algorithm allows bursty data transfers. LLLP University4B Tech}-AB Publisher 2016-9 * Atoken bucket algorithm is a modification of leaky bucket in which leaky bucket contains tokens * In this algorithm, a token(s) are generated at every clock tick. For a packet to be transmitted, system must remove token‘s) from the bucket. ° Thus, a token bucket algorithm allows idle hosts to accumulate credit for the future in form of tokens. * For example, if a system generates 100 tokens in one clock tick and the host is idle for 100 ticks. The bucket will contain 10,000 tokens Now, if the host wants to send bursty data, it can consume all 10,000 tokens at once for sending 10,000 cells or bytes. Thus a host can send bursty data as long as bucket is not empty. Departure Token bucket algoritm Q.2. (6) Write a note on the various classes of IP address. (5) Ans. Process of dividing an IP network in to sub divisions is called subnetting. Subnetting divides an IP address in to two parts as the network (or routing prefix) and the rest field (which is used to identify a specific host). CIDR’notation is used to write a routing prefix. This notation uses a slash (/) to separate the network starting address and the length of the network prefix (in bits). For example, in IPv4, 192.60.128.0/22 indicates that 22 bits are allocated for the network prefix and the remaining 10 bits are reserved for the host address. In addition, routing prefix can also be represented using the subnet mask. 255.255.252.0 (11111111.11111111.11111100.00000000) is the subnet mask for 192.60.128.0/22. Separating the network portion and the subnet portion of an IP address is done by performing a bitwise and operation between the IP address and the subnet mask. This would result in identifying the network prefix and the host identifier. Supernetting is the process of combining several IP networks with a common network prefix. Supernetting was introduced as a solution to the problem of increasing size in routing tables. Supernetting also simplifies the routing process. For example, the subnetworks 192.60.2.0/24 and 192.60.3.0/24 can be combined in to the supernetwork denoted by 192.60.2.0/23. In the supernet, the first 23 bits are the network part of theentific Bo ont orice taal be other 9 bits are weal 4 reduce the a for class C TP ag a ab ‘Typically, * ), and most of the routing ya table. xo 223 in deciiN” yorder KatewaY Protocg} art ch as exterior gateway pp, rt supernetting, 10-2016 sixth Semester address and the eeveral small networks incladed in the reuling (addresses beginning support supernetting 3 and open shortest pat EGP) and the routing informa! aaa ies'silll Q.3. (a) Explain the frame gala imple me cng ‘Ans. The Address Resolution Protoco one aso of the ARP me seas depen freee rsalUtion map ven by the type of i oe ven by the type of netwopy, we tania, aan ON a the upper layer an a ary protocol (usually Pv) in use ae ras pater epi these = upper layer protocol is ranmingon The ee conned tht "at i at ete pt oa for request (1) and reply iver hosts. hardware and protocol address eer “Fen Phe fllowing GLa ie | packet structure 0! pa In this scenario, th Sica ti race of [Pv networks running of Bitiaccs: nade : has 4S bit fields for the sender hardware address ¢ res nine THA), and 32-bit fields for the correspand nS Sa Se SPA and TPA). Thus, the ARP packet size in this 7 Boole sud first (OSPF) But, RIP) do not suppo) Sender HA (Octets 0.3) Senden HA oete's 6) | Sender IP (octets 0-1) Sender HA(octets 23) | Target HA (octets 0-1) ‘Target HA (octets 2-5) Target IP (octets 0-3) Fig. Structure of ARP packet Hardware type (HTYPE): This ficld specifies the network protocol type. Example: Ethernet is 1 Protocol type (PTYPE): This field specifies the internetwork protocol for which the ARP request is intended. For IPv4, this has the value 0x0800. The permitted PTYPE values share a numbering space with those for Ether Type. Hardware length (HLEN): Length (in octets) of a hardware address. Ethernet addresses size is 6 Protocol length (PLEN): Length (in octets) of addresses used in the upper layet Protocol. (The upper layer protocol specified in PTYPE.) IPv4 address size is te ic ee ‘Specifies the operation that the sender ig performing: 1 for request! Sender hardware address (SHA): Media addre this field is use ta indicate the address ofthe host send on a ARP ret st sending the request. In an Al tr et ener ars creat ta ress ofthe host thatthe request was | that ewitches donot pay attention ta this Berd on the case of virtual media.) Net ' field, particularly in learning MAC addressThe ARP PDU is encapsulated in Ethernet frame, and that is what Layer 2 devices examine Sender protocol address (SPA): Internetwork address of the sender, Target hardware address (THA); Media address of the intended receiver. In an ARP request this field is ignored. In an ARP reply this field is used to indicate the address of the host that originated the ARP request. Target protocol address (TPA); Internetwork address of the intended receiver. Q.3. (b) An organisation is granted the block 211.17.180.0/24. The administrator wants to create 32 subnets. (5) (@ Find the subnet mask. (ii) Find the number of addresses is cach subnet, (ii) Find the first and last addresses in subnet 1 Ans. (i) This is a Class C network. We require a mask that provides 32 subnets. / 24 has no subnets, So we increase it until 32 . Thus the mask is /29 = 265.255.255.248 (ii) There are 3 host bits remaining and 2°= 8. Two addresses are not available hence a maximum of 6 hosts can be used. (ii) Find the first and last allocatable addresses in subnet 1. The first allocatable address in subnet 1 will be 211.17.180.1 , the last allocatable address in subnet 1 will be 211.17.180. Q.4. Write a short note on: (Attempt any four) (10) @ RARP (ii) ICMP (iii) FTP (iv) Domain Name System (DNS) (v) Quality of service Ans.(i) Refer Q.No.6(a) of find Term f xam 2017 (é) ICMP: The Internet Control Message Protocol (ICMP) is a supporting protocol in the Internet protocol suite. Itis used by network devices, like routers, to send error messages and operational information indicating, for example, that a requested service is not available orthat a host or router could not be reached. ICMP differs from transport protocols suchas TCP afd. UDP in that it is not typically used to exchange data between systems, nor i regularly employed by end-user network applications (with the exception of some diagtiostic tools ike ping and traceroute). (iii) FTP: The Pile Transfer Protocol (FTP) is a standard network protocol used to transfer computer files between a client and server on a computer network. FTP is built on a client-server model architecture and uses separate control and data connections between the client and the server. FTP users may authenticate themselves with a clear-text sign-in protocol, normally in the form of a username and paseword, but can connect anonymously if the server is configured to allow it. For secure transmission that protects the username and password, and encrypts the content, FTP is often secured with SSL/TLS (FTPS). SSH File Transfer Protocol (SFTP) is sometimes also used instead, but is technologically different. The first FTP client applications were command-line programs developed before operating systems had graphical user interfaces, and are still shipped with most Windows, Unix, and Linux operating systems. Many FTP clients and automation utilities have since been developed for desktops, servers, mobile devices, and hardware, and FTP has been incorporated into productivity applications, such as web page editors. (ic) DNS: The Domain Name System (DNS) is a hierarchical decentralized naming system for computers, services, or any resource connected to the Internet.or a private ty twork. [t associates various information with domain names assigned to each of the12-2016 Sixth Semester, Data Communication and Networks rticipating entities. Most prominently, it translates more readily memor; aaa the numerical IP addresses needed for the purpose of locating ang iden wort ey services and devices with the underlying network protocols. By roma worldwide, distributed directory service, the Domain Name System is an ‘ component of the functionality of the Internet, and has been in use since the Tan was created in 1983 by Paul Mockapetris. . hy The Domain Name System delegates the responsibility of assigning domain Dan and mapping those names to Internet resources by designating authoritative Servers for each domain. Network administrators may delegate authority over domains of their allocated name space to other name servers. This mechanism TOFide distributed and fault tolerant service and was designed to avoid a single large centeg database. The Domain Name System also Specifies the technical functionality of the datai Service that is at its core. It defines the DNS protocol, a detailed Specification Of the data structures and data communication exchanges used in the DNS, as Part Of the Internet Protocol Suite. Historical] ly, other directory services preceding DNS Were not sealable to large or global directories as they were originally based on text filea, prominently the HOSTS. TXT resolver. (v) Quality of Service (QoS): Refers to the capability of a network to provide better service to selected network traffic over various technologies, including frame Relay, Asynchronous Transfer Mode (ATM), Ethernet and 802.1 networks, SONET, and IP-routed networks that may use ‘any oral! ofthese underlying technologies. flows does not make other flows fail. QoS technologies provide the elemental building blocks that will be used for future business applications in campus, WAN, and serviceEND TERM EXAMINATION [MAY-JUNE-2016] SIXTH SEMESTER [B.TECH] DATA COMMUNICATION & NETWORKS (fETEC-310] Time 3 Siew 2 Lise on advantage and disadvantage for serial transmission @) Adeasaage of Served Gucns Lhe Timstuiest lane cost bs the factor Denudrascapes nf Sera Tamenussom: : TANS Lt SOO Lod Seema ONE mut weed ip acense 9 Delhi af sopwet gs cooppaced Gp parallel Gremmemingion as tuts are camemiant wcuady ome afer the ache Ql ot Why dr yor aed encoding of cata before sending over a medbum!? tape wit me Ass Samtw ennui of amy gf terces of Gece rece end ecror ree End omer che, = ca Ql. c Deeioe the gern euccoer scmsein CSMACD™ s Ass laccur mse ts emcee witbeslbsce Secu CSMACD ua meds muxc touabtiiy a eects Dopesnes wectoolngy far inca! even tes os coi, CDs a aSifiestiee of pot comer seme Solople aooess “CSN. COMA CDs weed ogre: CSM! perder by cemeeng Deasmmssaom Be Sonn BF a culbqurt as Getemed thes eheruecme the come ceqered before a reary can be ettemmpted Ql 2 Deierectiace FO Svar cokes rong. ” ‘Aas 1 Thibes sng ses single ring, FIDE uses additional cing to achewe beter vera amt ese cuemee of ee i Tuker cay mses rwsced pat cuts end FDOT uses Sher canis LIDO0 uses a comed taker pretand wher Taber Tong oes cast moos sewing or Sfiememoe = Same format md how etem Tadic bended Tages Ting uses GOTT Ene veservames boa. Pas he prurcay eperenon af the FOOE nag uses a prongs thet ts based am 8 pucemeter inows as the Token Rotetion Tue, TET QL we Explants bow QaS is previdind through Integrated Services? uo) Ass The sospice: weomces ecchorctoce madel RPC IGM June 1954 wns tuned fe the tues of cealcome appllimemoms sack es temite Widen malomedea Communication and Networks - 1tprovides a way to deliver the end.tg, tocol (RSVP) to explicitly signal the Qog he end-to-end path through the serve the necessary bandwidth, IntServ uses Resource Reservation Prot needs of an application's traffic along the devices in t network. Ifevery network device along the path can re the originating application can begin transmitting. Resides end-to-end signaling, IntServ requires several functions of routers and switches along the path: Admission Control: Determine whether a new flow can be granted the requested QoS without impacting existing reservations Classification: Recognize packets that need particular levels of QoS Policing: Take action, including possibly dropping packets, when traffic does not conform to its specified characteristics . Queuing and Scheduling: Forward packets according to those QoS requests that have been granted. Q.1. () What is meant by circuit switching? Discuss. (4) Ans. Circuit switching is a method of implementing a telecommunications network in which two network Modes establish a dedicated communications channel (circuit) through the network before the nodes may communicate. The circuit guarantees the full bandwidth of the channel and remains connected for the duration of the communication session. The cireuit functions as if the nodes were physically connected as with an electrical cireuit. The defining cxamiple of a cireuit-switched network is the early analog telephone network. When a call is made from one telephone to another, switches within the telephone exchanges create a continuous wire circuit between the two telephones, for as long as the call lasts: Circuit switching contrasts with packet switching which divides the data to be transmitted into packets transmitted through the network independently. In packet switching, instead of being dedicated to one communication session at a time, network sinks are shared by packets from multiple competing communication sessions, resulting in the loss of the quality of service guarantees that are provided by circuit switching. Q.L (g) Explain IP4 packet format. (4) Ans. Internet Protocal being a layer-3 protocol (OSI) takes data Segments from layer-4 (Transport) and divides it into packets. IP packet encapsulates data unit received from above layer and add to its own header information. IP Header Layer ~4 Data (0? Encapsulation) The encapsulated data is referred to as IP Payload. IP head H nesestary information to deliver the packet at the other end. Ae a eeLP University (1 Tech} AB Publisher 2016-15 a8 _ x aa (image; IP Header) UP header includes many relevant information including Version Number, which, in this context, is 4. Other details are as follows: Version no. of Internet Protocol used (e.g. [Pv4). IHL: Internet Header Length; Length of entire JP header, DSCP; Differentiated Services Code Point, this is Type of Service. ECN: Explicit Congestion Notification; 1 carries information about the congestion seen in the route. Total Length: Length of entire IP Packet (including IP header and IP Payload). Identifications If IP packet is fragmented during the transmission, all the fragments contain same fdentification number. to identify original IP packet they belong to Version: Flags: As required by the network resources, if IP Packet is too large to handle, these ‘flags’ tells if they can be fragmented or not. In this 3-bit flag, the MSB is always set to 0 Fragment Offset: This offset tells the exact position of the fragment in the original IP Packet. Time to Live: To avoid looping in the network, every packet is sent with some TTL value set, which tells the network how many routers (hops) this packet can cross. At each hop, its value is decremented by one and when the value reaches zero, the packet is diecarded Protocol: Tells the Network layer at the destination host, to which Protocol this packet belongs to, i.e. the next level Protocol. For example protocol number of ICMP is 1, TCP is 6 and UDP is 17 Header Checksum: This field is used to keep checksum value of entire header which is then used to check if the packet is received error-free. Source Address: 32-bit address of the Sender (or source) of the packet. Destination Address: 32-bit address of the Receiver (or destination) of the packet. Options: This is optional field, which is used if the value of IHL is greater than 5. These options may contain values for options such as Security, Record Route, Tin Stamp, ete16-2016 Sixth Semester, Data Communication and Networks UNIT-I Q.2. Explain the ISO/OSI Network model with neat diagram. (2g) ‘Ans, ISO/OSI Model in Communication Networks: ‘There are n numbers of users who use computer network and are located over the world, So to ensure, national and worldwide data communication, systems must by developed which are compatible to communicate with each other ISO has developeg this. ISO stands for International organization of Standardization. This is called g model for Open System Interconnection (OSI) and is commonly known as OSI model The [SO-OSI model is a seven layer architecture. It defines seven layers or levels in a complete communication system. Perenrerry i ALLL Ng Feature of OSI Model : 1. Big picture of communication over network is understandable through this OSI model. 2, We see how hardware and software work together. 3, We can understand new technologies as they are developed. 4, Troubleshooting is easier by separate networks. 5, Can be used to compare basic functional relationships on different networks. Functions of Different Layers: Layer 1: The Physical Layer: 1. It is the lowest layer of the OSI Model. 2. It activates, maintains and deactivates the physical connection. 3. It is responsible for transmission and reception of the unstructured raw data over network. 4. Voltages and data rates needed for transmission is defined in the physical layet- 5, It converts the digital/analog bits into electrical signal or optical signals. j 6. Data encoding is also done in this layer. __ PeLP. UniversityB.Tech-AB Publisher 2016-17 Layer 2: Data Link Layer: 1. Data link Jayer synchronizes the information which is to be transmitted over the physical layer. 2, The main function of this layer is to make sure data transfer is error free from one node to another, over the physical layer 3, Transmitting and receiving data frames sequentially is managed by this layer. 4, This layer sends and expects acknowledgements for frames received and sent respectively. Resending of non-acknowledgement received frames is also handled by this layer. 5. This layer establishes a logical layer between two nodes and also manages the Frame traffic control over the network. It signals the transmitting node to stop, when the frame buffers are full Layer 3: The Network Layer: 1. It routes the signal through different channels from one node to other. 2. It acts as a network controlier. It manages the Subnet traffic. 3. It decides by which route data should take, 4. It divides the outgoing messages into packets and assembles the incoming packets into messages for higher levels Layer 4: Transport Layer: 1, It decides if data transmission should be on parallel path or single path. 2. Functions such as Multiplexing, Segmenting or Splitting on the data are done by this layer 3. It receives messages from the Session layer above it, convert the message into smaller units and passes it on to the Network layer. 4 Transport layer can be very complex) depending upon the network requirements. ‘Transport layer breaks the message (data) into small units so that they are handled more efficiently by the network layer: se Layer 5: The Session Layer: 1. Session layer manages and synchronize the conversation between two different applications. 2. Transfer of data from source to destination session layer streams of data are marked and are resynchronized properly, so that the ends of the messages are not cut prematurely and data loss is avoided. Layer 6: The Presentation Layer : 1. Presentation layer takes care that the data is sent in such a way that the receiver will understand the information (data) and will be able to use the data. 2. While receiving the data, presentation layer transforms the data to be ready for the application layer. - 3. Languages(syntax) can be different of the two communicating systems. Under this condition presentation layer plays a role of translator. 2 4. It perfroms Data compression, Data encryption, Data conversion etc. Layer 7: Application Layer : 1. It is the topmost layer. 2. Transferring of files disturbing the results to the user is also done in this layer. Mail services, directory services, network resource etc are services provided by application layer. 3. This layer mainly holds application programs to act upon the received and to be sent data. eS| 18-2016 Sixth Semester, Data Commuracation and Networks Merits of OSI reference model: 1.OSI model distinguishes well between the services, interfaces and proven, 2. Protocols of OSI model are very well hidden. 3. Protocols can be replaced by new protacols as technology changes, 4. Supports connection oriented services aa well a9 connectionless wervies Demerits of OSI reference model: 1. Model was devised before the invention of protocols. 2. Pitting of protocols is tedious tank. 3.1t is just used as a reference model Q.3.(a) Discuss the different signal encoding techniques. Ans. In order to transport digital bits of data across carrier waves, enoud techniques have been developed each with their own pros and cons. This document briefly describes some of the more common techniques. Manchester Phase Encoding (MPE) 802.3 Ethernet uses Manchester Phase Eneoding (APE). A data bit ‘I’ from te level-encoded signal (i.e. that from the digital eireuitry in the host machine sending data) is represented by a full cycle of the inverted signal from the master clock which matches with the ‘0’ to ‘1’ rise of the phase-encoded signal (linked to the phase of the carrier signal which goes out on the wire). i c.-V in the first half of the signal and +V in the second half. The data bit ‘0' from the level-encodeti signal ia represented by a full normal cycle of the master clock which gives the ‘I’ to ‘U’ fali.of the phase-encoded signal. i.e. +V in the first half of the signal andV in the second half. ‘The above diagram shows graphically how MPE operates. The example at the bottom of the diagram indicates how the digital bit stream 10110 is encoded. ‘A transition in the middle of each bit makes it possible to synchronize the sender and receiver. At any instant the ether can be in one of three states: transmitting a 0 bit (-0.86v), transmitting a 1 bit (0.85v) or idle (0 volts). Having a norma} clock signal well as an inverted clock signal leads to regular transitions which means that . a ee