By Topic

Self-stabilizing ARQ on channels with bounded memory or bounded delay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Spinelli, J.M. ; Dept. of Electr. Eng., Union Coll., Schenectady, NY, USA

It is shown that implementing self-stabilizing versions of standard ARQ (automatic-repeat-request) protocols, such as stop-and-wait or go-back-n, would require knowledge of a bound on the maximum delay or maximum memory of the communication channel involved. An alternative approach to self-stabilizing ARQ that incorporates a delay or memory bound directly as part of the communication model is given. Two ARQ protocols are presented that self-stabilize by using one bit of overhead in each transmitted message. The protocols operate exactly like standard stop-and-wait ARQ except that when a fault places them in an incorrect (unsafe) state, the additional bit in the protocol messages allows automatic recovery

Published in:

INFOCOM '93. Proceedings.Twelfth Annual Joint Conference of the IEEE Computer and Communications Societies. Networking: Foundation for the Future, IEEE

Date of Conference:

1993