Open navigation menu
Close suggestions
Search
Search
en
Change Language
Upload
Sign in
Sign in
Download free for days
0 ratings
0% found this document useful (0 votes)
16 views
Computer Network
quantum
Uploaded by
mohitrajputboy2911
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save Computer Network For Later
Download
Save
Save Computer Network For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
0 ratings
0% found this document useful (0 votes)
16 views
Computer Network
quantum
Uploaded by
mohitrajputboy2911
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
Download now
Download
Save Computer Network For Later
Carousel Previous
Carousel Next
Save
Save Computer Network For Later
0%
0% found this document useful, undefined
0%
, undefined
Embed
Share
Print
Report
Download now
Download
You are on page 1
/ 186
Search
Fullscreen
‘Computer Networks(KCS- 603) ‘Course Outcome (CO) Bloom’s Knowledge Level (KL) ‘At the end of course, the student will be able to Explain basic concepts, OSI reference model, services and role of each layer of OST model and CO1 | rep, networks devices and wansmission media, Analog and digital data wansmission Kuk C02 _ | Apply channel allocation, framing, error and flow control techniques. K Gos | Describe the functions of Network Layer ie. Logical addressing, subneting & Routing KK Mechanism, Coa _ | Explain the different Transport Layer Function te, Port addressing, Connection Management, KK Error control and Flow control mechanism. aK COS _ | Explain the functions offered by session and presentation layer and their Implementation. KK, Coe | Explain the different protocols wsed at application layer ie. HTTP, SNMP, SMTP, FIP, K TELNET and VPN, DETAILED SYLLABUS 3-0-0 Unit Topic Proposed Lecture Introductory Concepts: Goals and applications of networks, Categories of networks, Organization of the Internet, ISP, Network structure and architecture (layering principles, services, protocols and standards), The OSI reference model, TCP/IP protocol suite, Network devices and 1 | components. Physical Layer: Network topology design, Types of connections, Transmission media, Signal transmission and encoding, Network performance and transmission impairments, Switching techniques and multiplexing Link layer: Framing, Error Detection and Comection, Flow control (Elementary Data Link I1_| Protocols, Sliding Window protocols) 08 Medium Access Control and Local Area Networks: Channel allocation, Multiple access protocols, LAN standards, Link layer switches & bridges (learning bridge and spanning tree algorithms). a | Network Layer: Pointto-point networks, Logical addressing, Basic internetworking (IP, CIDR, ARP, RARP, DHCP, ICMP), Routing, forwarding and delivery, Static and dynamic routing, | 08 Routing algorithms and protocols, Congestion control algorithms, IPv6, Ty | Tfamsport Layer: Process-lo-process delivery. Transport layer protocols (UDP and TCP), Multiplexing, Connection management, Flow control and retransmission, Window management, | 08 ‘TCP Congestion control, Quality of service. y | Application Layer: Domain Name System, World Wide Web and Hyper Text Transfer Protocol, Electronic mail, File Transfer Protocol, Remote login, Network management, Data compression, | 08 Cryptography — basic concepts. ‘Text books and References: WA. Behrouz Forouzan, “Data Communication and Networking”, McGraw Hill Andrew Tanenbaum “Computer Networks”, Prentice Hall William Stallings, “Data and Computer Communication”, Pearso Kurose and Ross, “Computer Networking- A Top-Down Approach”, Pearson. Peterson and Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann Shay, “Understanding Communications and Networks”, Cengage Learning. D, Comer, “Computer Networks and Internets”, Pearson, Behrouz Forouzan, “TCP/IP Protocol Suite”, MeGraw Hill ‘cuneutum & Eva 24Introduction Concept, CONTENTS 2A Cea) S Long Answer Ty TTT Write ws Part-l + Introduction Concepts vom 122A to 1-94 Goals and Applications of Network Part-2 : Network Structure. 1-3A to 1-124 and Architecture The OSI Reference Model Part-3 + Services 148A to 1-144 Part-4 : Network ‘Topology Design somes I-14A to 1-19A - Delay Analysis em b. Wide AreaN Part-5 : Backbone Design 1-19A to 1-20A | i WANis Part-6 : Local Access Network Design. ik Thenets Parez; aa © Metropolita i MANis Parts + i Nisley Part-9 ; ii, Itmaye Gao lS | Descritn ‘Answer | LIA Csr, Goals of network ar Cost reduction by High reliability by Greater flexibilit Increase product users, Scanned by CamScannerIntroduction Concepts 1-2A (CS/IT-6) PART-1 Introduction Concepts : Goals and Application of Network. Questions-Answers Long Answer Type and Medium Answer Type Questions Que 11. | Write a short note on computer network. | ‘A computer network can be defined as a collection of nodes. Anode can be any device capable of transmitting or receiving data. ‘The communicating nodes have to be connected by communication links. Categories of network are categorized on the basis of their size. The three basic categories of computer networks are a. Local Area Network (LAN): LAN is usually limited to a few kilometers of area. ii, It may be privately owned and could be a network inside an office on one of the floor of a building or a LAN could be a network consisting of the computers in an entire building. b. Wide Area Network (WAN): WAN is made of all the networks in a (geographically) large Pk ewe i it area, i, The network in the entire state of Maharashtra could be a WAN. . Metropolitan Area Network (MAN) i. MANis of size between LAN and WAN. ii It is larger than LAN but smaller than WAN. iii, It may comprise the entire network in a city like Mumbai. Que 1.2. | Describe the goals and application of network. “Answer | Goals of network are : 1. Cost reduction by sharing hardware and software resources. 2. High reliability by having multiple sources of supply. 3. Greater flexibility because of possibility to connect devices. 4, Increase productivity by making it easier to access data by the several users. Scanned by CamScanner————SS—si‘a;&BPMnas'S 1-3A (CSI) Computer Networks bial sae aa 5, To increase the systems performance, as the work load increas just adding more processors. 4 5 6 Computer networks provide a powerful communication medium, Applications of network are 1. Marketing and sales : i. Marketing professional use to collect, exchange and analyze data relating to customer needs and product development cycles. ii, Sales application includes teleshopping, which uses order entry computers or telephone connected to an order processing network, and online reservation services for railways, hotels, airlines, restaurants, theatre etc. 2 Finaneial services :It include credit history searches, foreign exchange and investment services and Electronie Fund Transfer (EFT), which allow a user to transfer money without going to bank. 3 Electronic messaging : i Emails transfer the messages between two and more users in a network, il With this application user can transfer the information in the form of text, picture and voice. 4 Directory services :It allows lst offiles tobe stored in central location to speed up the world wide search operation. 5. Information services : i. It includes bulletin boards and data bank. i. Awww’ site offering the technical specification for a new : 2 we in an information services, pepnet SONCEPT OUTLINE * OSI model consists of seven layers i Physical layer | Datalink layer Network layer iv. Transportlayer ¥. Session layer vi, Presentation layer Yi, Application layer Scanned by CamScanner——_=u=a= 14 A (CSIT-6) Introduction Concepts ————————— a Se Questions-Answers ™ _Long Answer Type and Medium Answer Type Questions per | SS eee = Que 1.3. ] Describe OSI reference model in detail. OR Discuss the services of each layer of OSI reference model. AKTU 2014-15, Marks 05 oR Explain functionalities of every layer in OSI reference model with neat block diagram. AKTU 2016-17, Marks 7.5 “Answer | a OSI reference model is a seven layer architecture which defines seven. Jevels or layers in a complete communication system. The lowest layer is physical layer and highest one is called as the application layer. b. It is called as OSI (Open System Interconnection) reference model because it is designed to deal with open systems ic., the systems which are open for communication with other systems. The OSI model suggested by IEEE has seven layers : Physical layer : i. The physical layer coordinates the functions required to transmit a bit stream over a physical medium. ii It deals with the mechanical and electrical specifications of the interface and transmission medium. iii, Fig, 1.9.1 shows the position of the physical layer with respect to the transmission medium and the data link layer. eumitiatsaink layer ‘To data link layer Physical Tor000010 er 701000010 ‘Transmission medium Scanned by CamScannerComputer Network: 1-5 ACCS Computer Networks Specific services/functions of the physical layer are : i. Physical characteristics of interfaces und media :The physica) "layer defines the characteristics of the interface between the devica, and the transmission medium. It also defines the type ot transmission medium. a ii, i : The physical layer defines the type of eeprom aerate ee transmitted. iii, Data rate : The transmission rate, the number of bit ‘second, is also defined by the physical layer. iv. Synchronization of bits : The sender and receiver must be ‘synchronized at the bit level. \- Line configuration : The physical layer is concerned with the connection of devices to the medium. In a point-to-point configuration, two devices are connected together through dedicated link. In a multipoint configuration, a link is shared between several devices. 2 Data link layer: © Pe data link laver transforms the physical layer, araw transmission facility, to areliable linkand is responsible for node-to-node delivery. iL It makes the physical layer appear error free to the upper layer ts Sent per (network layer) From network layer To network layer [dae] (sae | f v Frame Frame T : - Data H2) link j aia 5 ToIOTOODoOOTT ToIoTOONDONTT ‘To physical layer From physical layer from the nety Uink layer divides the stream of bits received ii, reset Jayer into manageable data units called frames sing :If frames are to be dicy_. systems on the network. tobe distributed to different » the data link lay ee : . yer adds a header to ad to def Physical 'S of the sender (source address) sm Teceiver (destination address) of the freon (SESS L6A Csat.6) iii, Flow o¢ the rece iv. Errore layer bs lost frar Access which ¢ Network I: i The ne deliver i Thene origin i. Tftwo, a nety
1,then the number of frames generated are more then the UES» Necanhandle, and every time probability of collisions © ee] 1G =S, throughput isjust the offered load, @ times the probability — of transmission being successful ie.,. $= GP, time i i ' i ey || 1 =— i ' = {cate AI ci | | withthe 1 with the | fe 1 Sstartof {*— —*t_end of the the shaded ‘shaded frame! ms fe : ' : frame iytt tyt2t tye3t of Saiaaa Fig. 2.9.1. where P, isthe probability, when the frames do not suffer from collision. ave data Que 20. | Discuss slotted ALOHA. collision Answer 1. Ie follows a synchronous transmission system, with time divided into sects the Each lot size is equal to afixed packet transmission time. »station When the packet is ready for transmission, it needs to wait until the ‘oyed. previous slot is over. its os 4, Ituses the common clock at each station and satellite. t oor 5, Fig. 2.10.1 shows packets completely or without any overlap, ses sending ® © © Orpolosy ee! ie si lie ci 1 a ss” 2 Ss = oisson* Fig. 2.10.1, Slotted ALOHA. tof the Scanned by CamScanner2-10 A (CSIIT-6) Medium Access Sub Layer Performance of slotted ALOHA S=Gx probability of no other transmission/overlap/arrival in previous slot = Get Its peak at G = 1 with « throughput 0.368 (twice that of pure ALOHA) Operation at higher G reduces the number of empty slots but incre collision. ‘Que 2-11, | How can youcompare pure ALOHA and slotted ALOHA ? AKTU 2013-14, Marks 05 [ARTU 2014-15, Marks 2.5 Answer S.No, Pure ALOHA, Slotted ALOHA 1. | The user can transmit the data | The userhas to wait till the next | frame whenever the station | time slot start, to transmit the ‘has the data to be transmitted. | data frame. 2. | In pure ALOHA, the time is | In slotted ALOHA, the time Is continuous. discrete. is not globally | The timeis globally synchronized Que 2:12:| A pure ALOHA network transmits 200 bit frames on Cres hannel of 200 kbps. What is the throughput if the system (all station together) Produces 250 frames er second ? If the system creates 250 frames Per second, that is (1/4) frame per millisecond. The load is (U4). In this case S = G x ¢-20 or S=0,152 ‘This means that the throughput is 250 x 0.152 = 38, Only 38 frames out of 250 will probably survive. Que 23.] An ALOHA network uses 19.2 Kbps channel for sending message packets of 100 bits long size. Calculate the maximum throughput for pure ALOHA network. [AKTU20i616 Maris OF ‘The network is pure ALOHA, so, efficiency = 18 % Usable bandwidth for 19.2 Kbps = 19.2 x 0.18 = 3.456 Kbps Therefore, the maximum throughput of pure ALOHA ee AKTU 2014-15, Marks 2.5 SSS es 25 | il IEE SFD the! i EW 700m wom Scanned by CamScannerComputer Networks PART-3 ‘Que 2.14. | Explain the IEEE 802.3 MAC sublayer frame format. Answer IEEE 802.3 specifies one type of frame containing seven fields : preamble, SED, DA, SA, length/type of PDU, 802.2 frame and the CRC. The format of the MAC frame in CSMA/CD is shown in Fig. 2.14.1. Preamble :66 bits ofalterating 1s and Ot SFD : Start Geld deiiter, ag (10101011) a ani | eae al ee oe [Pie] Sas [se] Tove aan a etre veal pa re Fig. 214.1. Preamble : The first field of the 802.3 frame, the preamble, contains seven bytes (56 bits) of alternating 0's and 1's that alerts the receiving system to the coming frame and enable it to synchronize its input timing, ‘Start Frame Delimiter (SFD) : The second field (one byte : 10101011) of the 802.3 frame signals at the beginning of the frame. The SED tells the receiver that everything that follows is data, starting with the addresses. Destination Address (DA) : The Destination Address (DA) field is allotted six bytes and contains the physical address of the packet's next destination. A system's physical address is a bit pattern encoded on its Network Interface Card (NIC). Source Address (SA) : The source address (SA) field is also allotted six bytes and contains the physical address ofthe last device to forward the packet, That device can be the sending station or the most recent router to receive and forward the packet. Scanned by CamScanner2-10 A (CS/IT-6) Medium Ace Performance of slotted ALOHA : " . 8 =G x probability of no other transmission/overlap/arrival in previous slot Gee Its peak at G = 1 with « throughput 0.368 (twice that of pure ALOHA) Operation at higher G reduces the number of empty slots but increases collision. ‘Que 2.11. | How can youcompare pure ALOHA and slotted ALOHA ? AKTU 2013-14, Marks 05 AKTU 2014-15, Marks 25 S.No. Pure ALOHA Slotted ALOHA ‘The user can transmit the data | The user has to wait till the next frame whenever the station | time slot start, to transmit the has the data tobe transmitted. | data frame. ea ‘Que 242;] A pure ALOHA network transmits 200 bit frames on shared channel of 200 kbps. What is the throughput if the system {all station together) produces 250 frames per second ? 2 | In pure ALOHA, the time is | In slotted ALOHA, the time is continuous. discrete. 3. |The time is not globally | Thetimeis globally synchronized. If the system creates 250 frames Per second, that is (1/4) frame per millisecond. The load is (1/4). In this caseS=Gxe™ or $=0152 ‘This means that the throughput is 250 x 0.152 = 38, Onl: f 250 will probably survive. ie names to Que 2.13. | An ALOHA network uses 19.2 Kbps channel for sending message packets of 100 bits long size, Calculate the maximum throughput for pure ALOHA network, ARTU 2016-16, Marks 05 The network is pure ALOHA, so, efficiency = 18 % Usable bandwidth for 19.2 Kbps = 19.2 x 0.1 synchronized, AKTU 2014-15, Marks 2.5 8 = 3.456 Kbps Therefore, the maximum throughput of pure ALOHA Scanned by CamScanner‘Scanned by CamScanner2-12 A (CS/IT-6) Medium Access Sub Layer & Len of Protocol Data Unit (PDU) : These next two bytes i PDU. If the length of the dicate the number of bytes in the coming PDUis fixed, this field can be used to indicate type, or as a base for other protocols. & Data: This field can be split up into two parts Data (0-1500 bytes) and padding (0-46 bytes). 7. CRC: The last field in the 802.3 frame contains the error detection information, in this case a CRC-32. Que 2.5. | How does in IEEE standard 802.5 LAN operates? Discuss. ee 1, IEEE standard 802.5 LAN is a token ring system which is as shown in Fig. 2.15.1. It consists of a number of stations connected to the ring through a Ring Interface Unit (RIU) 2. The RIU is basically a repeater, therefore it regenerates the received data frames and sends them to the next station after some delay. }@ - Ring Interface Unit (RIU) Fig. 2.15.1. Media Access Control (MAC) : 1. The access to the medium (i.c., who will transmit) is controlled by the special control frame called token. The token is passed from one station to the other round the ring. The eae a okey ne is dependent on the physical location of the ations connected to the ring, It isnot d s ee net lependent on logical number as 3. A station which is in possession of the token only can transmit the sane ay cunt one or more data frames but before the expiry transmit ftedan® Time (THT). Thus every station gets a fixed time 0 4. Typically this time is of 10 msec, Afte - the handed over to some other station ee Tt the token frame must be Que 2.16, 1 How does IEEE standard 802.4 LAN operates ? 1. The IEEE 802.4 stand: oo lard for Media Access Control (MAC) is known #8 2: Scanned by CamScanneryer Computer Networks 2-13.A (CS/T-6) Logically the interconnected stations form a ring as shown in Fig, 2.16.1 tes the = a physical topology is bus topology as shown in Fig, 2.16.1 a = wo Ga nd - * 950] (ost = Fig. 2.16.1, Physical topology in token passing. Media access control : maa ‘The operation of token bus taken place as follows 1. Atany time, the station which holds the token only can transmit its data frameson the bus. Every frame contains source and destination address. 2, Allthe other stations are ready to receive these data frames. 3, _Assoon asthe transmission time of a station is over, it passes the token to the next station in the logical sequence. That station is allowed to transmit its data now. Inone cycle of operation, each station will get an op) once. The same station can get more number of chances to transmit in one cycle if more than one address is assigned to it. QueBa7, | Differentiate between 802.3, 802.4, and 802.5 IEEE standards. AKTU 2013-14, Marks 05 Answer in 1g portunity to transmit 6 HE] Parameters | 802.3 Ethernet | 802.4Token | 802.5 Token No. Bus Bus Ring e 1. | Physical topology| Linear Linear Ring e 2, | Logical topology | None Ring Ring e 3._ [Contention Random chance | By token By token ; 4. |Maintenance _ | Nocentral Distributed [A designated maintenance algorithm —_| monitor station’ : provides performs y maintenance. |maintenance. P 5. | Cable used ‘Twisted pair, co- | Co-axial Twisted pair axial fiber optic Jand fiber optic. Cablolongth | 50m to 2000 m_|200 m to 500 m/50 m to 1000 m 7. | Frequency 0 Mbps to 100 |10Mbps 4 to 100 Mbps ‘Mbps 8 | Frame structure | 1500 bytes B19 bytes [5000 bytes Scanned by CamScanner214A (CSIT-6) BAB] Devine Fiber Distributed Data Interface (FDDI) in detail with the help of its frame format. Answer ] FDDI: 1. Fiber Distributed Data Interface (FDDI) is a local area network protocol 2. _Itsupports data rates of 100 Mbps and provides a high speed alternative to Ethernet and token ring. 3. The copper version of FDDI is known as CDDI. 4. InFDDI, accessiis limited by time. 5. A station may send as many frames as it can within its allotted access Pernod, with the provision that real time data be sent first. Frame format : [Destination] D| Fs Sa ED] Fs Thyte Tbyte 2-6 05 Is bytes bytes bytes bytes Frame fields: 1. Start Delimiter (SD): The frst byte of the feld i the frame's starting flag. 2 Frame Control (FC) : The second byte of the frame identifies the frame type, 3 Addresses :The next two fields re the dest ion and, iddressi Each address consists of two to six ae 4 Data: Each data frame can ¢ & Cyclic Redundancy Check (CRC); 6 End Delimiter (ED) : This field consiste half, or afull byte in the token frame, It lathengeii x the 7 violation symbol in the data/ the token frame, 7 Frame Status (FS) : The Fp) Ttisincluded only in the dat byte in the data frame in the physical layer with ommand frame or two T symbols in DI FS field i land. is similar to that of token ring. alcomn, frame and consists of 1.5 bytes Scanned by CamScannerComputer Networks 215A (CS/IT-6) Que 2:19. Brief about how line coding implemented in FDDI and describe its format. AKTU 2016-17, Marks 10 a] Line coding implementation : 1 2g 3 4. FDDI line coding use NRZI scheme in transition of data, In this scheme, 4B/5B method is used in group encoding strategy. The 4B/5B encoding scheme takes data in four bits codes and maps them to corresponding five bit codes, For example, the four bit data code for the letter F (1111) corresponding to the five bit encoding 11101. These five bit codes are then transmitted using NRZI. By transmitting five bit codes using NRZI, a logical 1 bit is transmitted at least once every five sequential data bits, resulting in a signal transition, Frame format for FDDI : Refer Q. 2.18, Page 2-14A, Unit-2 Discuss the issues in the data link layer and about its protocol on the basis of layering principle. AKTU 2016-17, 2017-18; Marks 10 Data link layer issues are: 1. Services provided to the network layer: 2 data link layer act as a service interface to the network layer. pei vice is transferring data from the network layer Sa Deg otic to the network layer on destination machine. Tiic transfer always takes place via DLL (Dynamic Link Library). Ss Frame synchronization + a The source machine sends to the destination machine. data in the form of blocks called frames Scanned by CamScanner‘Scanned by CamScannerComputer Networks 2-17 A (CS/T-6) b. This openness, combined with the ease of me dominant in the local area network. c. The Ethernet system consists of thee i The physical medium used to eens computers ii A set of medium access control rue thernet interface that allow mi wultiple computers to fairly _. access to the shared Ethernet channel, : iii, An Ethernet frame that consists of a standardized set of bits used to carry data over the system, has made Ethernet basic elements, y Ethernet signals between s embedded in each PART-5 Sliding Window Protocols, Questions-Answers Long Answer Type and Medium Answer Type Questions Que 2.21. | Explain sliding window protocol. OR Write short note on sliding window protocol. AKTU 2014-15, Marks 2.5 ‘AKTU 2017-18, Marks 05 Answer 1. Sliding window protocol is afeature 2. Peon refers to an imaginary boxes that hold the frames on both sender and receiver side. 3. Insliding window method, mul t is needed. , Bee | ear pees have been transmitted = _ received, slidi Ble isize of fhe window. ich means they are numbered Jo-n, whieh m ° Se ee an the frames are numbered 0, 1, 2, RaeniO tors ~ 1. Bor og, 7, 05 1, uw The size uf the window is 3, 4, 5, 6, 7,0, 1, 2,9, 4 5% & 1G er of the next ee it includes the number © 6 When the receiver son ae ‘words, to acknowledge the receipt ve. feame it expects 10702 in frame 4 the receiver sends an ACK : of a string of ber 6. containing the num! of packet based data transmission tiple frames are sent by sender at a time Scanned by CamScanner2-18 A (CSIIT-6) Medium Access Sub Layer 7. When the sender sees an ACK with the number 5, it knows that all frames up to number 4 have been received 8. The window can hold n ~1 frames at either end; therefore, a maximum of'n —1 frames may be sent before an acknowledgement is required sz Window i]2]3]s]s]e[7 [ols [2 ]3 [45 Fig. 221.1, Sender window : At the beginning of a transmission, the sender's window contains » ~ 1 frames. As frames are sent out, the left boundary of the window moves inward, shrinking the size of the window. 1. Given a window of size w, if three frames have been transmitted since the last acknowledgement, then the number of frames left in the window isw-3. 2 Once an ACK arrives, the window expands to allow in a number of new frames equal to the number of frames acknowledged by that ACK. Fig. 2.21.2 shows a sender sliding window of size 7. Sender window o [2] s]4]s [e|7fola jays Direction [= Direction ‘This wall moves to the righ) (_ This wall moves tothe right, frame by frame, when a || the sizeof several frames at frame is sent. 4 time, when an ACK received, Receiver window : At the beginning of transmission, the receiver window contains not n~1 frames but n ~ 1 spaces for frames, 1. As new fre receiver ‘Scanned by CamScannerComputer Networks tnGaite) Receiver a bo PEELE fe Diretion ‘This wall moves ta the right, the size of several frames at atime, when an ACK is sent This wall moves to the right frame by frame, when a frame is received Fig. 2.21.3, ‘Que 2.22, | Discuss stop and wait technique for flow control. 1. Stop and wait technique is the simplest form of flow control where a sender transmits a data frame. 2. After receiving the frame, the receiver indicates its willingness to accept another frame by sending back an ACK frame acknowledging the frame just received. 3. The sender must wait until it receives the ACK frame before sending the next data frame. 4, This technique is simple to understand and easy to implement, but not very efficient. 5. Fig. 2.22.1 illustrates the operation of the stop and wait protocol. Sender Receiver Frame 0 z e Fig. 2.22.1. ‘QiETTE,| state drawbacks of stop and wait protocols, AKTU 2019-14, Marks 05 Anower | Drawbacks of stop and wait protocols are : 1 Data is lost due to processing or storage that occurs between the last backup and the subsequent disk erash, system crash, or some other such disaster. | ‘Scanned by CamScanner‘Scanned by CamScanner2-21 A(CS/T-6) Computer Networks 2, For example, the sender transmits a data frame : data 0. The receiver returns an ACK 1, indicating the data 0 arrived undamaged and itis now expecting data 1 3, The sender transmits its next frame: data 1. Itarrives undamaged, and the receiver returns ACK 0. 4, The sender transmits its next frame : data 0. The receiver discovers an error in data 0 and returns a NAK. 5, The sender retransmits data 0. This time data 0 arrives intact, and the receiver returns ACK 1 Senter = Fig. 224.1. b. Operation in case of lost frame : 1. Anyofthe three frame types can be lost in transit. Fig. 2.24.2 shows how stop and wait ARQ handles the loss of a data frame. 2 The sender is provided with a timer that starts every time when a dataframeis transmitted, Ifthe frame never makesit to the receiver, the receiver ean never acknowledge it, positively or negatively. 3, The sending device waits for an ACK or NAK frame until its timer goos of, at which point it tries again. Ttretransmits the lost data Feome, restarts its timer, and waits for an acknowledgement. Sender Receiver Time out Time Fig, 294.2. Scanned by CamScanner222A (CSIT-6) Medium Access Sub Lay ©. Operation in case of lost acknowledgement : 1. In this case, the data frame has made it to the receiver and has been found to be either acceptable or not acceptable. But the ACK or NAK frame returned by the receiver is lost in transit. 2 The sending device waits until its timer goes off, then retransmits the data frame. 3. The receiver checks the number of the new data frame. Ifthe lost frame was a NAK, the receiver accepts the new copy and returns the appropriate ACK. 4. Ifthe lost frame was an ACK, the receiver recognizes the new copy as a duplicate, acknowledges it receipt, then discards it and waits for the next frame. Sender Receiver Time Fig. 2.24.3. Time ‘QueBBs.] Describe the Go-back-N ARQ protocol. OR Write a short note on Go-backN ARQ. [ARTU 201416, Marks 25 AKTU 2017-18, Marks 05 1. _Inthis method if one frame is damaged, all frames are sent since the last frame acknowledged are retransmitted. 2 This method is used to overcome the inefficiency of stop and wait ARQ by allowing transmitter to transmit the frames continuously. Following are the operations of protocol under certain condition : 1. Operation when the frame is damaged a. The second data frame is damaged, so the error is detected and receiver send NAK-2 signal back as shown in Fig. 2.25.1. b. On receiving this signal, the transmitter starts retransmission from frame 2. ¢. All the frames received after frame 2 are discarded by the receive’: _ eat Scanned by CamScannerComputer Networks osiaucamn a Receiver fal = | Error due ‘to damaged frame Discard frames Retransmitted| Retransmitted } Retransmitted frames Retransmittd Y Time Time 2 Operation when a frame is lost : a. As shown in Fig. 2.25.2, the case of lost frame is also treated in the ‘same manner as that of the damaged frame. Sender Receiver Discard frame Discard frame Retransmission { Cee rames are recieved z. Time Time | ‘Fig. 2.25.2. Go-back-N, lost data frame. b. Thereceiver, if it does not receive a particular data frame it sends a NAK to the transmitter and the transmitter :etransmits all the frames sent since the last frame acknowledged. —<$< Scanned by CamScanner‘Scanned by CamScannerye 2-25 A (CS/AT-6) computer Networks 5, The efficieney for Go-Back-N i given by : ly — Mo Noay = —F ), then Go-Back-N attains the Ifthe channel is error-free, that is P, best possible efficiency, namely, 1—ryn, Que 227. | Write a short note on selective repeat ARQ. AKTU 2014-15, Marks 2.5 Answer ‘The selective repetitive ARQ scheme retransmits only those for which a NAKs are received or for which timer has expired, this is shown in the Fig. 2.27.1. 2, Thisis the most efficient among the ARQ schemes, but the sender must pe more complex so that it can send out-of-order frames. 3, The receiver also must have storage space to store the post NAK frames and processing power to reinsert frames in proper sequence. 4, Inselective repeat ARQ, the receiver while keeping track of sequence umber, buffers the frames in memory and sends NAK for only frame which is missing or damaged. Sender Receiver ‘Set time for 2 (Close time for 0 send ose time for 1 send 4 Time-out fr 2 send frame 2 agai layer protocols : Go-back-N and BRST compere ovo date ick selective repeat in terms of flow control, error recovery and packet loss. ‘Scanned by CamScanner2-26 A (CSIT-6) Criteria Go-back-N Selective repeat Flow control | Flow control is done by storing frame of| window size (N) in buffer at receiver end. Flow control is done by | storing continuous occurring frame in buffer at receiver end. 2, | Errorrecovery | It detects and controls the error during transmission of packets, Itdetects and corrects the | error during transmission of packets. 3. Packet loss Ifpacket is lost during transmission then it discards all the packets after receiving NAK| acknowledgement for the lost packet. If packet is lost during) transmission then it discards only the packet which is lost. and continues to send other packets. (QaeRRIT] Consider the use of 10 K-bit size frames on a 10 Mbps satellite channel with 270 ms delay. What is the link utilization for stop-and-wait ARQ technique assuming P = 10°? 1.999/(1 + 2 * 270) = 0.0018 = 0. Henee, a= 270/1~270 Link utilization: | What is piggybacking ? oR Write a short note on piggybacking. 1. Piggybacking is a technique of temporarily delaying; outgoing acknowledgments, So, that they can be hooked into the next outgoing data frame, 2. A better solution would be to use each channel (forward and reverse) to transmit frames both ways, with both channels having the same capacity. ‘Scanned by CamScannerComputer Networks 2-27 A (CS/AT-6) A gale be ihe users. Then the data frames from A to B are ae a oe e acknowledgements from A to B. By checking the Kind feld in the header of the received frame, the received fr be identified as either data frame or acknowledgement, 4. When a data frame arrives, the receiver en ts, does not sei intro frame (acknowledgement) back imm odistaly does not send the control 5, Thereceiver waits until its network layer, asses in the next data packet. ‘The acknowledgement is then attached to this outgoing data frame. ‘Thus the acknowledgement travels along with next data frame. 2 CONCEPT OUTLINE ‘+ Three error detecting methods : i Parity checking i, Checksum error detection ii, Cyclic redundancy check GReTL | Discuss error and its types. Answer | ‘Whenever an electromagnetic signal flows from one point to another, it : Daubjedt to mnpredictable interference from heat, magnetism, and other forms of electricity. ii : 2. This interference can change the shape or timing of the signal. ‘signal i such changes can alter the 3. Ifthe is carrying encoded binary data, s meanings of the data. This condition results in error. ; Depending on the number of bits in error we can classify the errors into two types as: 1. Single bit error: a “The term single bit error suauosts data unit such as byte is in error. F ‘That means only one bit ina transmitted byte will change from 1 to 0 or 0 to 1, as shown in Fig, 2.31.1. that only one bit in the given b. Scanned by CamScanneroir Medium Acc CAS Medium Ace Medium, 9}i ff ofofa a4} ""* ofa ‘Tranamitied byt Received byte 2 Burst errors; % Iftwo ormore bits from adata unit such asa byte chan ; We from 1 ty 0 or from 0 to 1 then burst errors are said to have occurred, >. The length of the burst error extends from the first erroneous big to the last erroneous bit. Even. though some of the bits in between pave not been corrupted the length ofthe burst, error is shown ty be 5 bits, Burst errors are illustrated in Fig. 21,2. Length of burst error (5 bits) eRipppays “te RTT Transmitted byte Received byte Fie 288 Bunt ioe, Que 2.32, 1M does parity checking is hepflin error detetion Answer] 1 The parity 7 orehine atthe receiver ean detec the presence n ifthe parity ofthe received signal is different from theexpected party 2. That means if itis known that the pay Of the transmitted signal js always going to be “even” and the received Signalhasan odd parity thes the receiver can conclude that the ‘"sceived signal isnot correct. This as shown in Fig. 2.32.1, P___Message its Parity. ao ‘Transmitted code : [T1001 61 10] Even Correct word error P Received code with[OTOOOTOITO) oda Incorrect word one error rors Pt Received code with(OTODOOOITD] ova Tncorreet word three error FY 280.1 The receiver detects the presence of eror Ii) “Dumber of errors is odd iv. 1,3, 5. Scanned by CamScanner‘Computer Networks eee ~ 2-29 A (CSMIT. . Ifasingle error RACES). cg trsperresion ¢dd number ofbits changed e parity of the codeword ee roe introduced change. 4 Parity ofthe received codeword i “ag dis chee! B egein perity then t's ute Ked at the receive 55 ler i sr and if there is Gpord This is os chown in Fig, etal i thaterroris present in the acl 5, Inpresence of error i pres r is detected then the receiver will ignore the received byte and request for the ah eee retransmission of the same byte to the Explain the conce] pt of cheeksum. Ho using the checksum byte? preemnel dete Tamer | 1. Achecksum ii i i abe is a value used to verify the integrity of a file or a data 2, Itisasum that checks the validity of data. 3, Achecksum is a simple type of redundancy check that is used to detect errors in data. 4, Checksums are typically used to ¢ they are the same. 5. At the receiver end, the checksum functi frame to retrieve the numerical value 6. Ifthe received checksum value matches the sent vi is considered to be successful and error free, Error detection using checksum byte: the data is divided into k segments compare two sets of data to make sure ion is applied to the message alue, the transmission 1. Inchecksumerror detection scheme, ‘each of m bits. 2 In the sender's end the arithmetic to get the sum- 3. The sum is complemented to 4. ‘The checksum segment is sent along 5. At the receiver's end, all received segm complement. arithmetic to get the sum. |G. Ittheresult iszero, the received data is accepted o Let consider following data sogments are added using 1's complement get the checksum. with the data segments. ents are added using 1's ‘sum is complemented. therwise discarded. Scanned by CamScanner2-90 (CS/T-6) Medium Access sy, 10011001111000100010010010000100 Original data 10011001 | 11100010 T k=4,m28 ‘Sender 1 10011001 2 11100010 ea 1 01111100 300100100 10100000 4 10000100 Sum: 00100101 Checksum: 11011010 10011001 11100010 faeaeen 1 ‘O1tTi100 00100100 “10100000 4 10000100 ppezonnee 1 00100101 Lio11010 Sum: 11111111 Complement: 0000000 Conclusion ‘Que 2.34.] Write a short note on cRc, 2 Polynomial arithmetic uses a subtraction are identical to EX-OR. For CRC code the sender and receiver should agree upon a generator Polynomial Giz). A codeword can be generated for a given dataword message) polynomial Mux) with the hemor; CRC works on the principle ofbinary di This word is called appended message word, The appended word thus obtai generator word corresponding ‘ined becomes to Gtx), + Accept data ithmetic ic., addition and long division, 's exactly divisible by the Scanned by CamScannerComputer Networks 2-31 A (CS/T-6) CRC generator : The CRC generator is shown in Fig. 2.34.1 “bits [Message TOW 0 Appended message word Binary division Codeword Message [GRO Fig. 2.34.1. CRC generator. 2, The stepwise procedure in CRC generation is as follows : Step 1: Append a train of n Os to the message word where nis 1 less than the number of bits in the predecided divisor (.e., generator word). Ifthe divisor is 5-bit long then we have to append 4-zeros to the message. ‘Step 2 : Divide the newly generated data unit in step 1 by the divisor (generator). This is a binary division Step 3 : The remainder obtained after the division in step 2 is then bit ORC. Step 4 : This CRC will replace the n 0s appended to the data unit in step 1, to get the codeword to be transmitted as shown in Fig. 2.34.1 CRC checker: 1 Fig. 2.34.2 shows the CRC checker. Received codeword Message | ORC jinary division Divisor If remainder is 0 then ‘Fig. 2.34.2, ORC checker. 2 ‘The codeword received at the receiver consists of message and CRC. 3. ‘The receiver treats it as one unit and divides it by the same (n + 1) bit divisor (generator werd) which was used at the transmitter. The remainder of this division is then checked. Scanned by CamScanner‘Scanned by CamScannerComputer Networks 2-93.A (CS/IT-6) Each parity bit calculates the parity for some of the bitsiin the code word. The position of the parity bit determines the sequence of bits that it alternately checks and skips. os Position 1 : Check 1 bits, skip 1 bits, check 1 bits, skip 1 bits, ete (1,3,5,7,9,11,13,15,...) Position 2 : Check 2 bits, skip 2 bits, check 2 bits, skip 2 bits, ete (23,6,7,10,11,14,16,...) Position 4 : Check 4 bits, skip 4 bits, check 4 bits, skip 4 bits, ete. (4,5,6.7,12,13,14,15,20,21,22,23,...) Position 8 : Check 8 bits, skip 8 bits, check 8 bits, skip bits, ete. (8-15,24-31,40-47,..) Position 16: Check 16 bits, skip 16 bits, check 16 bits, skip 16 bits, ete., (16-31,48-63,80-95,...) Position 32: Check 32bits, skip 32 bits, check 32bits, skip 32 bits, etc., (82-63,96-127,160-191., Set a parity bit to 1 if the total number of ones in the positions it checks isoda. Set a parity bit to 0 ifthe total number ofones in the positions it. checks is even For example : Ifthe 7-bit hamming codeword received by a receiver is 1011011. Assuming the even parity state whether the received codeword is correct or wrong. If wrong, locate the bit in error. DDBRmRR DAR A Toya [2 Received codeword: [1 | 0 | 1 Step 1: Analyze bits 4, 5, and 7 PD, Dy D; = 1101+ Odd parity. Error exists here. Put P, = Lin the 4’s position of the error word. Step 2: Analyze bits 2, 3, 6 and 7: P,D, D, D, = 100.1 > Bven parity so no error. Hence put P, = 0 in the 2's position of the error word, Step 3: Check the bits 1, 3,5, 7: PD_D,D, = 1011-> Odd parity 50 error exists. Hence put P, = 1 in the 1's position of the error word. Step 4: Write the error word Error word E=| Py a t 2's position 4’s positionMedium Access Sub L: Substituting the values of P, P, and P, obtained in steps 1, 2and 3 we _ : “ 7 =O. Hence, bit 6 of the transmitted codeword is in error. 3 a " Ge eee Step 5 : Correct the error: Invert the incorrect bit to obtain the correct codeword as follows : Correct codeword = (1001011) (QHERIA] Given «10-bit soquence 1010011110 and a divisor of 1011, Find the CRC. Check your answer. U 2014-15, Marks 05‘Scanned by CamScanner‘Scanned by CamScanner~ Quantum. Chen Wuantum- Chemistry - Farm - SideB1 UNIT Network Layer CONTENT: Part-l_: Network Layer : Point-to-Point Networks Part-2 : Routing. - BBA to 3-10A Part-3 : Congestion Control ....... 310A to 3-17A Part-4 : Internetworking-TCP/IP .. 3-17A to 3-18A, Part-5 : IP Packet.. S-18A to 3-93A IP Address IPy6 3-1 (CSIIT-6) Scanned by CamScanner
You might also like
Discuss The Benefits and Constraints of Different Network Types and Standards
PDF
No ratings yet
Discuss The Benefits and Constraints of Different Network Types and Standards
31 pages
A Summer Training Report Networking
PDF
No ratings yet
A Summer Training Report Networking
44 pages
Computer Networks
PDF
No ratings yet
Computer Networks
97 pages
CN Coursefile1
PDF
No ratings yet
CN Coursefile1
40 pages
Computer Network1
PDF
No ratings yet
Computer Network1
21 pages
Gold VTH Sem
PDF
No ratings yet
Gold VTH Sem
167 pages
CN QB
PDF
No ratings yet
CN QB
26 pages
CN Unit-1 Part 1
PDF
No ratings yet
CN Unit-1 Part 1
48 pages
Computer Networking May 09 PDF
PDF
No ratings yet
Computer Networking May 09 PDF
24 pages
01.data Communication Basics - Network Basics
PDF
No ratings yet
01.data Communication Basics - Network Basics
40 pages
Overview of Networking
PDF
No ratings yet
Overview of Networking
118 pages
The OSI Model Module 3
PDF
No ratings yet
The OSI Model Module 3
4 pages
Lec 1-Modified-Introduction For Wireless Networks
PDF
No ratings yet
Lec 1-Modified-Introduction For Wireless Networks
48 pages
CN Unit 1
PDF
No ratings yet
CN Unit 1
10 pages
Edited Unit 1 CN 4TH Sem
PDF
No ratings yet
Edited Unit 1 CN 4TH Sem
13 pages
G Unit-I
PDF
No ratings yet
G Unit-I
104 pages
OSI Model New11
PDF
No ratings yet
OSI Model New11
104 pages
cnunit1[1]
PDF
No ratings yet
cnunit1[1]
77 pages
CS8591-Computer Networks Department of CSE 2020-2021
PDF
No ratings yet
CS8591-Computer Networks Department of CSE 2020-2021
24 pages
Computer Networks
PDF
No ratings yet
Computer Networks
11 pages
Introduction To Computer Networks
PDF
No ratings yet
Introduction To Computer Networks
57 pages
cnm question bank
PDF
No ratings yet
cnm question bank
7 pages
Chap-1-Intro
PDF
No ratings yet
Chap-1-Intro
122 pages
Computernetwork
PDF
No ratings yet
Computernetwork
382 pages
CN Question Bank For Mid Term
PDF
No ratings yet
CN Question Bank For Mid Term
26 pages
Introduccion A Redes de Computadores y Comunicaciones
PDF
No ratings yet
Introduccion A Redes de Computadores y Comunicaciones
11 pages
Chapter 1_Intro Computer Network ^0 Internet
PDF
No ratings yet
Chapter 1_Intro Computer Network ^0 Internet
54 pages
CNS Model Answers Unit 1
PDF
No ratings yet
CNS Model Answers Unit 1
29 pages
Advance Networks Week 2,3,4
PDF
No ratings yet
Advance Networks Week 2,3,4
58 pages
Network and Internet
PDF
No ratings yet
Network and Internet
18 pages
Data_Communication_Overview_1736055051305879120677a190b433a9
PDF
No ratings yet
Data_Communication_Overview_1736055051305879120677a190b433a9
201 pages
Cs6551 - Computer Networks
PDF
No ratings yet
Cs6551 - Computer Networks
93 pages
Practical File On Bba 5th Sem
PDF
100% (1)
Practical File On Bba 5th Sem
27 pages
Computer Network
PDF
No ratings yet
Computer Network
28 pages
CN Unit 1
PDF
No ratings yet
CN Unit 1
61 pages
CN KCS-603 Important Questions Solved
PDF
No ratings yet
CN KCS-603 Important Questions Solved
162 pages
Instructional Material For Networking I
PDF
No ratings yet
Instructional Material For Networking I
29 pages
Network Models: ISO - OSI & TCP/IP: Compiled by Wadkar Harshad Suryakant
PDF
No ratings yet
Network Models: ISO - OSI & TCP/IP: Compiled by Wadkar Harshad Suryakant
28 pages
CCNA Guide To Cisco Networking: Chapter 1: Introducing Networks
PDF
No ratings yet
CCNA Guide To Cisco Networking: Chapter 1: Introducing Networks
43 pages
Unit 1 5
PDF
No ratings yet
Unit 1 5
369 pages
TUTORIAL SHEET-1 (Solution) : Kcs-603: Computer Networks
PDF
No ratings yet
TUTORIAL SHEET-1 (Solution) : Kcs-603: Computer Networks
8 pages
networking
PDF
No ratings yet
networking
16 pages
CCNA Day 1 Notes
PDF
No ratings yet
CCNA Day 1 Notes
20 pages
Module - 1
PDF
No ratings yet
Module - 1
89 pages
Computer Networks Basics Components
PDF
No ratings yet
Computer Networks Basics Components
49 pages
CN Unit 1 Slides
PDF
No ratings yet
CN Unit 1 Slides
46 pages
CNND_QB_Ans
PDF
No ratings yet
CNND_QB_Ans
20 pages
???????? ??????? ??? ???
PDF
No ratings yet
???????? ??????? ??? ???
23 pages
CNWEEK3
PDF
No ratings yet
CNWEEK3
24 pages
Inglés Modelo Osi VS TCP Ip
PDF
No ratings yet
Inglés Modelo Osi VS TCP Ip
10 pages
Cse Module 6
PDF
No ratings yet
Cse Module 6
45 pages
1.Transmission Control Protocol
PDF
No ratings yet
1.Transmission Control Protocol
28 pages
Computer Networking
PDF
No ratings yet
Computer Networking
116 pages
OSI MODEL
PDF
No ratings yet
OSI MODEL
17 pages
Network Standards Edtd (1)
PDF
No ratings yet
Network Standards Edtd (1)
6 pages
chapter 2 networking
PDF
No ratings yet
chapter 2 networking
27 pages
CN_Module notes
PDF
No ratings yet
CN_Module notes
22 pages
chapter 5
PDF
No ratings yet
chapter 5
32 pages
CCDN Notes
PDF
No ratings yet
CCDN Notes
35 pages
Related titles
Click to expand Related Titles
Carousel Previous
Carousel Next
Discuss The Benefits and Constraints of Different Network Types and Standards
PDF
Discuss The Benefits and Constraints of Different Network Types and Standards
A Summer Training Report Networking
PDF
A Summer Training Report Networking
Computer Networks
PDF
Computer Networks
CN Coursefile1
PDF
CN Coursefile1
Computer Network1
PDF
Computer Network1
Gold VTH Sem
PDF
Gold VTH Sem
CN QB
PDF
CN QB
CN Unit-1 Part 1
PDF
CN Unit-1 Part 1
Computer Networking May 09 PDF
PDF
Computer Networking May 09 PDF
01.data Communication Basics - Network Basics
PDF
01.data Communication Basics - Network Basics
Overview of Networking
PDF
Overview of Networking
The OSI Model Module 3
PDF
The OSI Model Module 3
Lec 1-Modified-Introduction For Wireless Networks
PDF
Lec 1-Modified-Introduction For Wireless Networks
CN Unit 1
PDF
CN Unit 1
Edited Unit 1 CN 4TH Sem
PDF
Edited Unit 1 CN 4TH Sem
G Unit-I
PDF
G Unit-I
OSI Model New11
PDF
OSI Model New11
cnunit1[1]
PDF
cnunit1[1]
CS8591-Computer Networks Department of CSE 2020-2021
PDF
CS8591-Computer Networks Department of CSE 2020-2021
Computer Networks
PDF
Computer Networks
Introduction To Computer Networks
PDF
Introduction To Computer Networks
cnm question bank
PDF
cnm question bank
Chap-1-Intro
PDF
Chap-1-Intro
Computernetwork
PDF
Computernetwork
CN Question Bank For Mid Term
PDF
CN Question Bank For Mid Term
Introduccion A Redes de Computadores y Comunicaciones
PDF
Introduccion A Redes de Computadores y Comunicaciones
Chapter 1_Intro Computer Network ^0 Internet
PDF
Chapter 1_Intro Computer Network ^0 Internet
CNS Model Answers Unit 1
PDF
CNS Model Answers Unit 1
Advance Networks Week 2,3,4
PDF
Advance Networks Week 2,3,4
Network and Internet
PDF
Network and Internet
Data_Communication_Overview_1736055051305879120677a190b433a9
PDF
Data_Communication_Overview_1736055051305879120677a190b433a9
Cs6551 - Computer Networks
PDF
Cs6551 - Computer Networks
Practical File On Bba 5th Sem
PDF
Practical File On Bba 5th Sem
Computer Network
PDF
Computer Network
CN Unit 1
PDF
CN Unit 1
CN KCS-603 Important Questions Solved
PDF
CN KCS-603 Important Questions Solved
Instructional Material For Networking I
PDF
Instructional Material For Networking I
Network Models: ISO - OSI & TCP/IP: Compiled by Wadkar Harshad Suryakant
PDF
Network Models: ISO - OSI & TCP/IP: Compiled by Wadkar Harshad Suryakant
CCNA Guide To Cisco Networking: Chapter 1: Introducing Networks
PDF
CCNA Guide To Cisco Networking: Chapter 1: Introducing Networks
Unit 1 5
PDF
Unit 1 5
TUTORIAL SHEET-1 (Solution) : Kcs-603: Computer Networks
PDF
TUTORIAL SHEET-1 (Solution) : Kcs-603: Computer Networks
networking
PDF
networking
CCNA Day 1 Notes
PDF
CCNA Day 1 Notes
Module - 1
PDF
Module - 1
Computer Networks Basics Components
PDF
Computer Networks Basics Components
CN Unit 1 Slides
PDF
CN Unit 1 Slides
CNND_QB_Ans
PDF
CNND_QB_Ans
???????? ??????? ??? ???
PDF
???????? ??????? ??? ???
CNWEEK3
PDF
CNWEEK3
Inglés Modelo Osi VS TCP Ip
PDF
Inglés Modelo Osi VS TCP Ip
Cse Module 6
PDF
Cse Module 6
1.Transmission Control Protocol
PDF
1.Transmission Control Protocol
Computer Networking
PDF
Computer Networking
OSI MODEL
PDF
OSI MODEL
Network Standards Edtd (1)
PDF
Network Standards Edtd (1)
chapter 2 networking
PDF
chapter 2 networking
CN_Module notes
PDF
CN_Module notes
chapter 5
PDF
chapter 5
CCDN Notes
PDF
CCDN Notes