Analysis of Sliding Window Protocol for Connected Node
Kapil Kumar Bansal1, Rakesh Kumar Yadav2
1Dr. Kapil Kumar Bansal, Head Research and Publication, SRM University, NCR Campus Modinagr, Ghaziabad (U.P.), India
2Rakesh Kumar Yadav, Department of Computer Science & Engineering, SRM University, NCR Campus Modinagr, Ghaziabad (U.P.), India
Manuscript received on November 01, 2012. | Revised Manuscript received on November 02, 2012. | Manuscript published on November 05, 2012. | PP: 292-294 | Volume-2 Issue-5, November 2012. | Retrieval Number: E1064102512/2012©BEIESP
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Abstract- In conventional networks lack of reliable and efficient transmission of data over unreliable channels that can lose, reorder and duplicate messages due to router or receiver limited buffer space, are retransmitted by the source. These scenarios usually data blocks contain error detection codes to detect whether an error has occurred during data transmission or not. If an error is detected, the receiver can try to fix the error if the received data has enough redundant bits or request a retransmission of data, for fulfill this requirement sliding window protocol is use. This paper shows calculated link utilization is better than observed link utilization for sliding window protocol using Deft Netz2.0 network simulation.
Keywords: Network, Congestion, Buffer, Simulation, Bandwidth, Reliable, Efficient, Netz2.0