Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 448 papers for “Sliding window protocol”

The Sliding Window Protocol Revisited

Jan Van De · 2007

Introduction In this note, we give a correctness proof of the sliding window protocol. We discuss both safety and liveness properties. We specialize our program to window size 1 and obtain the alternating bit protocol. The alternating bit protocol can be traced back to [2]. We have been unable to trace back the origins of the sliding window protocols; [7] discusses one of the versions and lists networks using related protocols. 2 A faulty channel A communication protocol is used to provide reliable transmission of data over a faulty communication channel that garbles, duplicates, or loses data. We consider the case in which data is transmitted in one direction over the faulty channel, and we assume the presence of a channel in the opposite direction in JAN 173-1 order to be able to communicate the need for retransmission of a message. The latter channel is also faulty. No assumptions on the slack of the faulty or of the fault-free channel are to be made. It is

Cited by 0

2.2 The Sliding Window Protocol....................

Lars Lockefeer, Wan Fokkink, David M. Williams · 2013

The Transmission Control Protocol (TCP) aims to provide a reliable transport service between two parties that communicate over a possibly faulty network. The responsibilities of TCP can roughly be divided into two categories: connection management and data transmission. Connection management sets up the connections, manages the byte streams and their corresponding states and ensures that connections are closed in a safe manner. Data transmission involves the transfer of segments from the sender to the receiver. The specification of TCP is far from formal and very complex. The original protocol was only specified in natural language in RFC 793. As TCP was implemented on a large scale, several ambiguities and other issues surfaced. RFC 1122 clarified some of these ambiguities and proposed solutions for many issues. Moreover, the networks that TCP operates over have changed remarkably over the years, and have now reached a bandwidth and speed that had never been envisioned at the time that the protocol was originally defined. To ensure reliable and efficient operation of TCP over these modern networks, RFC 1323 proposes the Window Scale Option that enables the use of windows larger than 2 16. For complex systems, formal specification and verification can be used to manage their complexity. The approach is twofold: first, the system is modelled using formal techniques that have mathematical

Cited by 0

The Sliding Window Protocol Revisited

Van de Snepscheut, Jan L. A. · Caltech Library · 1991

We give a correctness proof of the sliding window protocol. Both safety and liveness properties are addressed. We show how faulty channels can be represented as nondeterministic programs. The correctness proof is given as a sequence of correctness-preserving transformations of a sequential program that satisfies the original specification, with the exception that it does not have any faulty channels. We work as long as possible with a sequential program, although the transformation steps are guided by the aim of going to a distributed program. The final transformation steps consist in distributing the actions of the sequential program over a number of processes.

Cited by 0Open access

IMPORTANCE OF SLIDING WINDOW PROTOCOL

Balwinder Kaur, Eep Kaur, Pooja Mudgil et al. · 2015

The data can get lost, reordered or duplicated due to the presence of routers and buffer space over the unreliable channel in the conventional networks. The data link layer deals with frame formation, flow control, error control, and addressing and link management. All such functions will be performed only by data link protocols. The sliding window protocol will detect and correct error if the received data have enough redundant bits or repeat a retransmission of data. The paper shows the working of this duplex protocol of data link network.

Cited by 0

Deductive Verification of the Sliding Window Protocol

Дмитрий Александрович Шкляев, Валерий Александрович Непомнящий · Modeling and Analysis of Information Systems · 2015

We consider the well-known Sliding Window Protocol which provides reliable and efficient transmission of data over unreliable channels. A formal proof of correctness for this protocol faces substantial difficulties caused by a high degree of parallelism which creates a significant potential for errors. Here we consider a version of the protocol that is based on selective repeat of frames. The specification of the protocol by a state machine and its safety property are represented in the language of the verification system PVS. Using the PVS system, we give an interactive proof of this property of the Sliding Window Protocol.

Cited by 0Open access

Sliding Window Protocol for Internet of Things

M. Hasan, Jaypal Medida, N. Laxmi Prasanna · International Journal of Recent Technology and Engineering (IJRTE) · 2021

Internet of Things (IoT) refers to the concept of connecting non-traditional computers and related sources with the help of the internet. This includes incorporating basic computing and communication technologies for daily use into Physical things. Security and Confidentiality are two major challenges in IoT. In the current security mechanisms available for IoT, the limitations in the memory, energy resources, and CPU of IoT devices compromises the critical security specifications in IoT devices. Also, the centralized architectures for security are not appropriate for IoT because of a Single attack point. It is costly to defend against attacks targeted on centralized infrastructure. Therefore, it is important to decentralize the IoT security architecture to meet the requirements of resource constraints. Blockchain is a decentralized encryption system with a large number of uses. However, because of its high computational complexity and poor scalability, the Traditional Blockchain environment is not suitable for IoT applications. So, we introduce a Sliding window protocol to the traditional blockchain so that it will better suit the applications in the IoT environment. Changing the conventional blockchain and introducing a sliding window to it makes it use previous blocks in proof of work to shape the next hash block. SWBC's results are analyzed on a data stream generated from an IoT testbed (Smart Home) in real-time. The results show that the proposed sliding window protocol improves security and reduces memory overhead and consumes fewer resources for Security.

Cited by 0Open accessRetracted

Verifying a Sliding Window Protocol in µCRL

Fokkink, WJ Wan, Groote, JF Jan Friso, Pang, J et al. · TU/e Research Portal (Eindhoven University of Technology) · 2004

. We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory.

Cited by 0

A formal derivation of a sliding window protocol

RR Rob Hoogerwoord · Data Archiving and Networked Services (DANS) · 2006

The MOPC-460 plasma cell tumor possesses tumor specific antigens. It nevertheless grows and kills its syngeneic host. The possible impairment of immune responsiveness in tumor bearing mice was investigated by measuring their ability to mount a humoral immune response against foreign antigens, such as sheep red blood cells or bacteriophage T4. No significant decrease in the response to either antigen was found until the tumor mass exceeded 10-15% of the host's body weight. Moreover, circulating anti-tumor antibodies were detected in the serum throughout the initial period of tumor growth. The possible interference of these antibodies with cell-mediated defence mechanism was ruled out by experiments where the humoral response was selectively suppressed from birth by repeated administrations of anti-immunoglobulin heavy chain antiserum. In a "suppressed" mice, tumors took, grew and developed more rapidly than in controls. It is concluded that, at least in the model studied, the humoral immune response operates as a defence mechanism against expansion of the tumor clone.

Cited by 3Open access

Verification of a sliding window protocol in µCRL

Bahareh Badban, Wan Fokkink, Jan Friso Groote et al. · TU/e Research Portal (Eindhoven University of Technology) · 2004

We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given\nentirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS.

Cited by 3Open access

Verifying a sliding window protocol in mu-CRL

Fokkink, W.J. (Wan), Groote, J.F. (Jan Friso), Pang, J. et al. · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 2003

Cited by 0Open access

Formal Verification of an Improved Sliding Window Protocol

D Dmitri Chkliaev, Jjm Jozef Hooman, de Ep Erik Vink · Radboud Repository (Radboud University) · 2002

The well-known Sliding Window protocol caters for the reliable and efficient transmission of data over unreliable channels that can lose, reorder and duplicate messages. Despite the practical importance of the protocol and its high potential for errors, it has never been formally verified for the general setting. We try to fill this gap by giving a fully formal specification and verification of an improved version of the protocol. The protocol is specified\nby a timed state machine in the language of the verification system PVS. This allows a mechanical check of the proof by the interactive proof checker of PVS. Our modelling is very general and includes such important features of the protocol as sending and receiving windows of arbitrary size, bounded sequence numbers and the three types of channel faults mentioned above.

Cited by 2Open access

A verified sliding window protocol with variable flow control

A. Udaya Shankar · 1986

We present a verified sliding window protocol which uses modulo-N sequence numbers to achieve reliable flow-controlled data transfer between a source and a destination. Communication channels are assumed to lose, duplicate and reorder messages in transit. The destination's data needs are represented by a receive window whose size can vary with time. The destination entity uses acknowledgement messages to inform the source entity of the current receive window size and the sequence number of the data word next expected. The source entity responds by sending segments of data words that lie within the allowed window. Each data segment is accompanied by an identifying sequence number and the size of the data segment. The destination entity also uses selective acknowledgement and selective reject messages to inform the source entity of the reception or lack of reception, respectively, of out-of-sequence data segments. Thus, this protocol is a proper extension of the Arpanet's TCP. We have obtained the minimum value of N that ensures correct data transfer and flow control, in terms of the minimum message transmission time, the maximum message lifetime, and the maximum receive window size. The protocol imposes no constraints on the retransmissions of messages or on the data segment sizes; thus, any retransmission policy that optimizes the protocol's performance can be used.

Cited by 6Open access