IMPORTANCE OF SLIDING WINDOW PROTOCOL
نویسندگان
چکیده
منابع مشابه
Verifying a Sliding Window Protocol in µCRL
We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show 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, and was checked with the help of PVS.
متن کاملThe Sliding-Window Protocol in CSP
A formal specification and proof of correctness is given of the sliding window protocol using the notation of Communicating Sequential Pro cesses. First the stop-and-wait protocol is defined; its correetne8S, that it forms a I-place buffer, is almost evident. Next the alternating-bit protocol is defined and described in terms of the stop-and-wait proto col, and its correctness deduced. Final...
متن کاملLecture 5: The sliding window protocol
network utilization (the ratio of throughput to the capacity of the underlying network) is PKT SIZE RTT / C, where C is the network’s capacity, PKT SIZE is the size of a single packet, and RTT is the round-trip time for the path from the sender to the receiver. When we use the variable RTT , we mean the minimum round-trip time excluding queueing delays inflicted by transmissions between the sen...
متن کاملThe Importance of Sliding Window Protocol Generalisation in a Communication Protocols Course
⎯ All modern communication systems rely on the correct operation of communication protocols that are running in different layers of protocol stacks. Hence, a deep knowledge and understanding of them must be possessed by all communications engineers. Therefore, a basic communication protocols course must be an essential constituent of any higher education communications engineering programme. Au...
متن کاملVerification of a Sliding Window Protocol Using IOA and MONA
We show how to use a decision procedure for WS1S (the MONA tool) to give automated correctness proofs of a sliding window protocol under assumptions of unbounded window sizes, buffer sizes, and channel capacities. We also verify a version of the protocol where the window size is fixed. Since our mechanized target logic is WS1S, not the finite structures of traditional model checking, our method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Research in Engineering and Technology
سال: 2013
ISSN: 2321-7308,2319-1163
DOI: 10.15623/ijret.2013.0210077