Effect of Sliding Windows Technique on the Performance of TCP/IP Networks

Abstract

Abstract Two basic strategies have developed by network designers to deal including errors. by adding extra information to data before sending. such approach is to comprise sufficient extra information to make destination to infer what the sent data should be, or it possible to add only sufficient extra information to let destination to infer that errors have been occurred, however not which error then have it ask re-send defected data. Previous strategy utilizes errors correcting mechanism and latter uses errors detecting mechanism. Utilize of errors correcting mechanism is named as Forward Error Correction (FEC). In this thesis, sliding window has been implemented over Multi-Protocol Label Switching (MPLS). Therefore, MPLS send data from one node to other node on network depend on short path labels instead of logical addresses in network layer, in addition to that MPLS is connection oriented compared to IP network. Finally, we have study and analyze sliding technique performance over MPLS from delay, throughput and packet loss point of view. It is show that go back N has belter performance compared to selective repeat in term of throughput.