The document discusses the data link layer of the OSI model. It covers topics such as:
- Framing methods including character-oriented, bit-oriented, and byte stuffing
- Flow control and error control functions of the data link layer
- Common data link layer protocols including simplex and stop-and-wait
In block coding, we divide our message into blocks, each of k bits, called datawords. We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called codewords.
Parity checking, Cyclic redundancy checking (CRC) and Hamming codes are some error detection techniques that I discussed here.
In block coding, we divide our message into blocks, each of k bits, called datawords. We add r redundant bits to each block to make the length n = k + r. The resulting n-bit blocks are called codewords.
Parity checking, Cyclic redundancy checking (CRC) and Hamming codes are some error detection techniques that I discussed here.
The data link layer, or layer 2, is the second layer of the seven-layer OSI model of computer networking. This layer is the protocol layer that transfers data between adjacent network nodes in a wide area network (WAN) or between nodes on the same local area network (LAN) segment.
RANDOM ACCESS PROTOCOL IN COMMUNICATION AMOGHA A K
In random access ,each station has right to send the data. However , if more than one station tries to send ,collision will occur .To avoid this collision , protocols came into existence.
In random access method , no stations are superior & none is assigned the control over the other .
When a station has a data to send , it uses a procedure defined by a protocol whether to send or not .
CCN notes for &th EC students, VTU, UNIT 1 Network MOdels explanation like OSI model ,TCP/IP model and tlepohone networks and cable network for data transmission
Carrier-sense multiple access with collision detection (CSMA/CD) is a media access control method used most notably in early Ethernet technology for local area networking.Carrier-sense multiple access with collision detection is a media access control method used most notably in early Ethernet technology for local area networking. It uses carrier-sensing to defer transmissions until no other stations are transmitting.
Medium Access Control :-
1.Distributed Operation
2.Synchronization
3.Hidden Terminals
4.Exposed terminals
5.Throughput
6.Access delay
7.Fairness
8.Real-time Traffic support
9.Resource reservation
10.Ability to measure resource availability
11.Capability for power control
Adaptive rate control
Use of directional antennas
In multicast communication, there is one source and a group of destination.
In multicasting, the router may forward the received packet through several of its interfaces.
The source address is a unicast address, but destination address is a group address.
The data link layer, or layer 2, is the second layer of the seven-layer OSI model of computer networking. This layer is the protocol layer that transfers data between adjacent network nodes in a wide area network (WAN) or between nodes on the same local area network (LAN) segment.
RANDOM ACCESS PROTOCOL IN COMMUNICATION AMOGHA A K
In random access ,each station has right to send the data. However , if more than one station tries to send ,collision will occur .To avoid this collision , protocols came into existence.
In random access method , no stations are superior & none is assigned the control over the other .
When a station has a data to send , it uses a procedure defined by a protocol whether to send or not .
CCN notes for &th EC students, VTU, UNIT 1 Network MOdels explanation like OSI model ,TCP/IP model and tlepohone networks and cable network for data transmission
Carrier-sense multiple access with collision detection (CSMA/CD) is a media access control method used most notably in early Ethernet technology for local area networking.Carrier-sense multiple access with collision detection is a media access control method used most notably in early Ethernet technology for local area networking. It uses carrier-sensing to defer transmissions until no other stations are transmitting.
Medium Access Control :-
1.Distributed Operation
2.Synchronization
3.Hidden Terminals
4.Exposed terminals
5.Throughput
6.Access delay
7.Fairness
8.Real-time Traffic support
9.Resource reservation
10.Ability to measure resource availability
11.Capability for power control
Adaptive rate control
Use of directional antennas
In multicast communication, there is one source and a group of destination.
In multicasting, the router may forward the received packet through several of its interfaces.
The source address is a unicast address, but destination address is a group address.
What is Artificial Intelligence | Artificial Intelligence Tutorial For Beginn...Edureka!
** Machine Learning Engineer Masters Program: https://www.edureka.co/masters-program/machine-learning-engineer-training **
This tutorial on Artificial Intelligence gives you a brief introduction to AI discussing how it can be a threat as well as useful. This tutorial covers the following topics:
1. AI as a threat
2. What is AI?
3. History of AI
4. Machine Learning & Deep Learning examples
5. Dependency on AI
6.Applications of AI
7. AI Course at Edureka - https://goo.gl/VWNeAu
For more information, please write back to us at sales@edureka.co
Call us at IN: 9606058406 / US: 18338555775
Facebook: https://www.facebook.com/edurekaIN/
Twitter: https://twitter.com/edurekain
LinkedIn: https://www.linkedin.com/company/edureka
Advancement in wireless communications lead more and more mobile wireless networks e.g.,
mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. Some of
the challenges in MANET include: Dynamic network topology, Speed, Bandwidth, computation
capability, Scalability, Quality of service, Secure and Reliable routing. One of the most
important challenges in mobile wireless networks is the Secure and reliable routing and the
main characteristic of MANET with respect to security is the lack of clear line of defence.
Therefore, the SP routing problem in MANET turns into dynamic optimization problem. In this
paper, a path detection algorithm and a model to detect intruders that is misbehaving nodes in
the alternative paths is proposed.
MODELLING AND SIMULATION OF 128-BIT CROSSBAR SWITCH FOR NETWORK -ONCHIPVLSICS Design
This is widely accepted that Network-on-Chip represents a promising solution for forthcoming complex embedded systems. The current SoC Solutions are built from heterogeneous hardware and Software components integrated around a complex communication infrastructure. The crossbar is a vital component of in any NoC router. In this work, we have designed a crossbar interconnect for serial bit data transfer and 128-parallel bit data transfer. We have shown comparision between power and delay for the serial bit and parallel bit data transfer through crossbar switch. The design is implemented in 0.180 micron TSM technology.The bit rate achived in serial transfer is slow as compared with parallel data transfer. The simulation resuls show that the critical path delay is less for parallel bit data transfer but power dissipation is high.
Performance Evaluation of a Layered WSN Using AODV and MCF Protocols in NS-2csandit
In layered networks, reliability is a major concern
as link failures at lower layer will have a
great impact on network reliability. Failure at a l
ower layer may lead to multiple failures at the
upper layers which deteriorate the network performa
nce. In this paper, the scenario of such a
layered wireless sensor network is considered for A
d hoc On-Demand Distance Vector (AODV)
and Multi Commodity Flow (MCF) routing protocols. M
CF is
developed using
polynomial time
approximation algorithms for the failure polynomial
. Both protocols are compared in terms of
different network parameters such as throughput, pa
cket loss and end to end delay. It was
shown that the network reliability is better when M
CF protocol is used. It was also shown that
maximizing the min cut of the layered network maxim
izes reliability in the terms of successful
packet transmission of network. Thetwo routing prot
ocolsare implemented in the scenario of
discrete network event simulator NS-2.
Wireless channel-based ciphering key generation: effect of aging and treatmentIJECEIAES
Key generation for data cryptography is vital in wireless communications secu- rity. This key must be generated in a random way so that can not be regenerated by a third party other than the intended receiver. The random nature of the wireless channel is utilized to generate the encryption key. However, the ran- domness of wireless channels deteriorated over time due to channel aging which casing security threats, particularly for spatially correlated channels. In this pa- per, the effect of channel aging on the ciphering key generations is addressed. A proposed method to randomize the encryption key each coherence time is de- veloped which decreases the correlation between keys generated at consecutive coherence times. When compared to the conventional method, the randomness improvement is significant at each time interval. The simulation results show that the proposed method improves the randomness of the encrypting keys.
Literature Review: Convey the Data in Massive Parallel ComputingAM Publications,India
In this paper we have studied several works on direct network architectures which are well-built contestant for useful in many successful cost-effective, experimental massive parallel computers and well scale up shared memory of multiprocessors. The uniqueness of direct networks, as reflected by the communication latency and routing latency metrics are significant to the performance of such systems. A multiprocessor system can be used for the wormhole routing for the most capable switching method and has been adopted in several new massive parallel computers. This technique is unique technical challenges in routing and flow control in particular system, and avoid deadlock. The highly scale up network is a combination of topology and hypercube. Due to the being of concurrent multiple mesh and hypercubes, this network provides a great architectural support for parallel processing. The growth of the network is more efficient in terms of communication, interconnection network is scaled up the network and will be more reliable and also the unreliability of the interconnection network to get minimized. This is very desirable characteristic for the interconnection network as the network remains equipped for more failure of adjoining nodes or links in parallel computer architecture. Formulations to optimize the performance of throughput of networks through queuing theory M\M\1 concept.
RUNNING HEAD: Integrative Network Design Project
Integrative Network Design Project
Student Name
Institute
Date
Class
Explain the network’s fundamental characteristics and components.
KFF Network Design Kudler Fine Foods (KFF) utilizes a direct transport topology comprising of a fundamental run of the link made of an eliminator at every end. The recording server, workstations, and peripherals are all joined with the direct link. Under the structural engineering of network utilized, it is anything but difficult to interface fringe or a PC to the straight transport, and it spares expenses included in obtaining links (Cisco Inc., 2000). Nonetheless, there are high information exchange rates because of utilization of Ethernet yet in the event that the direct link breaks, it stops the whole network. KFF's network permits imparting of assets, for example, printer, modems, and CD-ROM, which makes it less expensive to set up the network and save money on expenses. Additionally, arranged PCs have the capacity to impart concentrated key PC projects, for example, stock spreadsheets permitting clients to have the same program instead of duplicates of the project thus they can deal with the network all the while. Moreover, the network backings robotized unattended reinforcement of substance and assets that make it simple to reinforcement fundamental records without squandering time. Utilization of Ethernet in KFF guarantees that PCs listen to the link before transmitting information through the network.
Evaluate the current network topology
KFF utilizes an outdated network topology that ensures the hindrance of complete breakdown on the off chance that the spine straight link breaks. The Bus topology is constrained to obliging just a couple of PC and fringe parts and if a part falls flat, then the whole string fizzles. In this sort of network, it is difficult to focus the source reason for an issue in the event that it happens accordingly tedious as far as the issue distinguishing proof and determination. Nonetheless, the transport network topology appreciates quick, constant information correspondence and straightforward remote checking and administration of parts. The outline is shabby and simple to arrange. Regarding dependability, the transport topology is not dependable by any means. It emerges from information transmission style where information is engendered in the manifestation of electrical heartbeats. Fundamentally, when a hub transmits a progression of electrical heartbeats, the beats go in all headings along the bearer link and they keep going until they discover a part to assimilate them, or they debilitate in such a way, to the point that they are imperceptible. On the off chance that a sign experiences the end of a link, it bobs back until it is ingested. In this way, from transmission, information signs are transferred crosswise over transportation medium and are relied upon to go to both closures of the transport conse.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
Evaluation of load balancing algorithms on overlappiing wireless accesspointsnooriasukmaningtyas
Wireless networks came into the computing world replacing the costlier and
more complex wired method of connecting numerous equipment in the same
or different location via the use of cables. It provides the user devices a
connection to one another and the greater internet via connections to access
points. Generally, 802.11 access point products follow a default strongest
signal first approach in selecting user devices or nodes to connect to the
access point or overlapping access points. This standard does not make
provisions for even distribution of load and hence the quality of service and
the throughput in areas of congestion would be reduced. This article brings
forward two algorithms used in load balancing and they include round-robin
technique and the weighted round-robin technique to be used in the
simulation of the distribution of the load amongst the access points with the
results collated and compared to clearly show which algorithm is best suited
to be used as a standard for access point load distribution.
Intro. IoT Module 1- 22ETC15H by Dr.Suresha V.pdfSURESHA V
Introduction to IoT for 1st year VTU students for the syllabus 2022-23.
Module 1:Basics of networking and Emergence of IoT examination notes.
Emerging technology course (ETC) for 1st-year students.
prepared by Dr.Suresha V, Professor,KVGCE,Sullia.(d.K)
Palestine last event orientationfvgnh .pptxRaedMohamed3
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
How to Create Map Views in the Odoo 17 ERPCeline George
The map views are useful for providing a geographical representation of data. They allow users to visualize and analyze the data in a more intuitive manner.
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
The Art Pastor's Guide to Sabbath | Steve ThomasonSteve Thomason
What is the purpose of the Sabbath Law in the Torah. It is interesting to compare how the context of the law shifts from Exodus to Deuteronomy. Who gets to rest, and why?
The Roman Empire A Historical Colossus.pdfkaushalkr1407
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
Model Attribute Check Company Auto PropertyCeline George
In Odoo, the multi-company feature allows you to manage multiple companies within a single Odoo database instance. Each company can have its own configurations while still sharing common resources such as products, customers, and suppliers.
How to Make a Field invisible in Odoo 17Celine George
It is possible to hide or invisible some fields in odoo. Commonly using “invisible” attribute in the field definition to invisible the fields. This slide will show how to make a field invisible in odoo 17.
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptxEduSkills OECD
Andreas Schleicher presents at the OECD webinar ‘Digital devices in schools: detrimental distraction or secret to success?’ on 27 May 2024. The presentation was based on findings from PISA 2022 results and the webinar helped launch the PISA in Focus ‘Managing screen time: How to protect and equip students against distraction’ https://www.oecd-ilibrary.org/education/managing-screen-time_7c225af4-en and the OECD Education Policy Perspective ‘Students, digital devices and success’ can be found here - https://oe.cd/il/5yV
Students, digital devices and success - Andreas Schleicher - 27 May 2024..pptx
Ccn unit-2- data link layer by prof.suresha v
1.
2. U NIT- T WO D ata L ink L ayer Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327
3. INTRODUCTION Farther of Internet Prof. Vinton Cerf Vinton Cerf Vint Cerf in Vilnius , September 2010. Born June 23, 1943 (age 68) New Haven, Connecticut Residence USA Citizenship United States of America Fields Computer science Institutions IBM , [1] UCLA , [1] Stanford University , [1] DARPA , [1] MCI , [1][2] CNRI , [1] Google [3] Alma mater Stanford University , UCLA Known for TCP/IP Internet Society Notable awards National Medal of Technology Presidential Medal of Freedom Turing Award
4.
5.
6.
7.
8. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 1.1 Character-oriented framing approach (cont’d…) ( for reference only) A character stream. (a) Without errors. (b) With one error. 1.FRAMING (cont…)
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
23.
24.
25.
26. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 2. Design Figure shows Design of Stop-and-Wait Protocol
27. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 3. Algorithms Algorithm 3.1 Sender-site algorithm for the Stop-and-Wait Protocol
28.
29.
30.
31.
32.
33. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 1. 2 Design ( Figure shows Design of the Stop-and-Wait ARQ Protocol )
34.
35.
36.
37.
38.
39.
40.
41.
42.
43.
44. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 Figure 3: Send window for Go-Back-N ARQ
45.
46.
47.
48.
49. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 3.2 Go-Back-N Automatic Repeat reQuest (ARQ) (cont’d….) Figure 5 : Design of Go-Back-N ARQ
50.
51.
52.
53.
54.
55.
56.
57.
58.
59.
60.
61.
62. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 Figure 3.3.3 Design of Selective Repeat ARQ 3.3 Selective Repeat Automatic Repeat Request (cont…)
63.
64. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 3.3 Selective Repeat Automatic Repeat Request (cont…) Algorithms: Sender-site Selective Repeat algorithm continued)
65. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 3.3 Selective Repeat Automatic Repeat Request (cont…) Algorithms: Sender-site Selective Repeat algorithm ( continued) continued)
66. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 3.3 Selective Repeat Automatic Repeat Request (cont…) Algorithms: Sender-site Selective Repeat algorithm ( continued)
67. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 3.3 Selective Repeat Automatic Repeat Request (cont…) Algorithm : Receiver-site Selective Repeat algorithm (continued
68. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 3.3 Selective Repeat Automatic Repeat Request (cont…) Algorithm : Receiver-site Selective Repeat algorithm (continued)
69.
70.
71. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 Figure 5 Flow diagram for Example 1
72.
73.
74. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 Figure 5.1 : Design of piggybacking in Go-Back-N ARQ
75. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 COMPARISON CHART PROTOCOL:- GO-BACK-N STOP AND WAIT SELECTIVE REPEAT Bandwidth utilization Medium Low High Maximum sender Size Window 2^m-1 N.A 2^(m-1) Maximum receiver Size Window 1 N.A 2^(m-1) Pipelining Implemented Not Implemented Implemented Out of order Frames Discarded Discarded Accepted Cumulative ACK Applicable N.A Applicable NAK N.A N.A Applicable
76.
77.
78.
79.
80.
81.
82.
83.
84.
85. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 HDLC Fields Description (continue) 2.Address field : (Fig for reference only)
86.
87.
88.
89.
90.
91.
92.
93.
94.
95.
96. HDLC Format Use of P/F Field (For reference only) Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327
97. Use of P/F Field( For reference only) Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 HDLC Format
98. Use of P/F Field (for reference only) Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 HDLC Format
99. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 Use of P/F Field( For reference only) HDLC Format
100. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 Use of P/F Field( For reference only) HDLC Format
101.
102. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 . Table 6 U-frame control command and response
103. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 . Example 11.9 Figure shown below explain how U-frames can be used for connection establishment and connection release. Node A asks for a connection with a set asynchronous balanced mode (SABM) frame; node B gives a positive response with an unnumbered acknowledgment (UA) frame. After these two exchanges, data can be transferred between the two nodes (not shown in the figure). After data transfer, node A sends a DISC (disconnect) frame to release the connection; it is confirmed by node B responding with a UA (unnumbered acknowledgment). Example of connection and disconnection
104. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 . Example 11.10 Figure 11.30 shows an exchange using piggybacking. Node A begins the exchange of information with an I-frame numbered 0 followed by another I-frame numbered 1. Node B piggybacks its acknowledgment of both frames onto an I-frame of its own. Node B’s first I-frame is also numbered 0 [N(S) field] and contains a 2 in its N(R) field, acknowledging the receipt of A’s frames 1 and 0 and indicating that it expects frame 2 to arrive next. Node B transmits its second and third I-frames (numbered 1 and 2) before accepting further frames from node A. Its N(R) information, therefore, has not changed: B frames 1 and 2 indicate that node B is still expecting A’s frame 2 to arrive next. Node A has sent all its data. Therefore, it cannot piggyback an acknowledgment onto an I-frame and sends an S-frame instead. The RR code indicates that A is still ready to receive. The number 3 in the N(R) field tells B that frames 0, 1, and 2 have all been accepted and that A is now expecting frame number 3.
105. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 . Figure 11.30 Example of piggybacking without error
106. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 . Example 11.11 Figure 11.31 shows an exchange in which a frame is lost. Node B sends three data frames (0, 1, and 2), but frame 1 is lost. When node A receives frame 2, it discards it and sends a REJ frame for frame 1. Note that the protocol being used is Go-Back-N with the special use of an REJ frame as a NAK frame. The NAK frame does two things here: It confirms the receipt of frame 0 and declares that frame 1 and any following frames must be resent. Node B, after receiving the REJ frame, resends frames 1 and 2. Node A acknowledges the receipt by sending an RR frame (ACK) with acknowledgment number 3.
107. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 . Figure 11.31 Example of piggybacking with error
108.
109.
110.
111.
112. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 . THE END OF UNIT- 2 Data Link Layer
113. Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 Acknowledgement : My Sincere Thanks To The Author Prof.BEHROUZ A FOROUZAN. Because The Above Presentation Materials Are Heavily Borrowed From His Textbook “Data Communication & Networking” 4 th Edition, publisher Tata McGraw Hill By Prof.Suresha V
114. Any questions? Thank you Suresha V. Professor, Dept. of E&C, KVG College Of Engineering. Sullia, D.K - 574 327 reach me at : suresha.vee@gmail.com Mercedes Horse
Editor's Notes
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327
09/12/11 suresha v,professor,Dept. of E&C,KVGCE,Sullia.D.k-574 327